1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #define GCC_C_COMMON_C
24 #include "coretypes.h"
29 #include "gimple-expr.h"
31 #include "stringpool.h"
33 #include "diagnostic.h"
35 #include "stor-layout.h"
39 #include "trans-mem.h"
41 #include "common/common-target.h"
42 #include "langhooks.h"
43 #include "tree-inline.h"
45 #include "tree-iterator.h"
49 cpp_reader *parse_in; /* Declared in c-pragma.h. */
51 /* Mode used to build pointers (VOIDmode means ptr_mode). */
53 machine_mode c_default_pointer_mode = VOIDmode;
55 /* The following symbols are subsumed in the c_global_trees array, and
56 listed here individually for documentation purposes.
58 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
60 tree short_integer_type_node;
61 tree long_integer_type_node;
62 tree long_long_integer_type_node;
64 tree short_unsigned_type_node;
65 tree long_unsigned_type_node;
66 tree long_long_unsigned_type_node;
68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
72 tree ptrdiff_type_node;
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
78 tree char16_type_node;
79 tree char32_type_node;
82 tree double_type_node;
83 tree long_double_type_node;
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;
90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
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;
106 tree widest_integer_literal_type_node;
107 tree widest_unsigned_literal_type_node;
109 Nodes for types `void *' and `const void *'.
111 tree ptr_type_node, const_ptr_type_node;
113 Nodes for types `char *' and `const char *'.
115 tree string_type_node, const_string_type_node;
117 Type `char[SOMENUMBER]'.
118 Used when an array of char is needed and the size is irrelevant.
120 tree char_array_type_node;
122 Type `wchar_t[SOMENUMBER]' or something like it.
123 Used when a wide string literal is created.
125 tree wchar_array_type_node;
127 Type `char16_t[SOMENUMBER]' or something like it.
128 Used when a UTF-16 string literal is created.
130 tree char16_array_type_node;
132 Type `char32_t[SOMENUMBER]' or something like it.
133 Used when a UTF-32 string literal is created.
135 tree char32_array_type_node;
137 Type `int ()' -- used for implicit declaration of functions.
139 tree default_function_type;
141 A VOID_TYPE node, packaged in a TREE_LIST.
145 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
146 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
147 VAR_DECLS, but C++ does.)
149 tree function_name_decl_node;
150 tree pretty_function_name_decl_node;
151 tree c99_function_name_decl_node;
153 Stack of nested function name VAR_DECLs.
155 tree saved_function_name_decls;
159 tree c_global_trees[CTI_MAX];
161 /* Switches common to the C front ends. */
163 /* Nonzero means don't output line number information. */
165 char flag_no_line_commands;
167 /* Nonzero causes -E output not to be done, but directives such as
168 #define that have side effects are still obeyed. */
172 /* Nonzero means dump macros in some fashion. */
174 char flag_dump_macros;
176 /* Nonzero means pass #include lines through to the output. */
178 char flag_dump_includes;
180 /* Nonzero means process PCH files while preprocessing. */
182 bool flag_pch_preprocess;
184 /* The file name to which we should write a precompiled header, or
185 NULL if no header will be written in this compile. */
187 const char *pch_file;
189 /* Nonzero if an ISO standard was selected. It rejects macros in the
193 /* C/ObjC language option variables. */
196 /* Nonzero means allow type mismatches in conditional expressions;
197 just make their values `void'. */
199 int flag_cond_mismatch;
201 /* Nonzero means enable C89 Amendment 1 features. */
205 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
209 /* Nonzero means use the ISO C11 dialect of C. */
213 /* Nonzero means that we have builtin functions, and main is an int. */
218 /* ObjC language option variables. */
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. */
225 int print_struct_values;
227 /* Tells the compiler what is the constant string class for ObjC. */
229 const char *constant_string_class_name;
232 /* C++ language option variables. */
234 /* The reference version of the ABI for -Wabi. */
236 int warn_abi_version = -1;
238 /* Nonzero means generate separate instantiation control files and
239 juggle them at link time. */
241 int flag_use_repository;
243 /* The C++ dialect being used. Default set in c_common_post_options. */
245 enum cxx_dialect cxx_dialect = cxx_unset;
247 /* Maximum template instantiation depth. This limit exists to limit the
248 time it takes to notice excessively recursive template instantiations.
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). */
254 int max_tinst_depth = 900;
256 /* The elements of `ridpointers' are identifier nodes for the reserved
257 type names and storage classes. It is indexed by a RID_... value. */
260 tree (*make_fname_decl) (location_t, tree, int);
262 /* Nonzero means don't warn about problems that occur when the code is
264 int c_inhibit_evaluation_warnings;
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
272 bool in_late_binary_op;
274 /* Whether lexing has been completed, so subsequent preprocessor
275 errors should use the compiler's input_location. */
276 bool done_lexing = false;
278 /* Information about how a function name is generated. */
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? */
286 /* The three ways of getting then name of the current function. */
288 const struct fname_var_t fname_vars[] =
290 /* C99 compliant __func__, must be first. */
291 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
292 /* GCC __FUNCTION__ compliant. */
293 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
294 /* GCC __PRETTY_FUNCTION__ compliant. */
295 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
299 /* Global visibility options. */
300 struct visibility_flags visibility_options;
302 static tree check_case_value (location_t, tree);
303 static bool check_case_bounds (location_t, tree, tree, tree *, tree *,
306 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
307 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
308 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
309 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
310 static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
311 static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
312 static tree handle_no_sanitize_address_attribute (tree *, tree, tree,
314 static tree handle_no_address_safety_analysis_attribute (tree *, tree, tree,
316 static tree handle_no_sanitize_undefined_attribute (tree *, tree, tree, int,
318 static tree handle_stack_protect_attribute (tree *, tree, tree, int, bool *);
319 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
320 static tree handle_noclone_attribute (tree *, tree, tree, int, bool *);
321 static tree handle_noicf_attribute (tree *, tree, tree, int, bool *);
322 static tree handle_leaf_attribute (tree *, tree, tree, int, bool *);
323 static tree handle_always_inline_attribute (tree *, tree, tree, int,
325 static tree handle_gnu_inline_attribute (tree *, tree, tree, int, bool *);
326 static tree handle_artificial_attribute (tree *, tree, tree, int, bool *);
327 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
328 static tree handle_error_attribute (tree *, tree, tree, int, bool *);
329 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
330 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
332 static tree handle_no_reorder_attribute (tree *, tree, tree, int,
334 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
335 static tree handle_transparent_union_attribute (tree *, tree, tree,
337 static tree handle_scalar_storage_order_attribute (tree *, tree, tree,
339 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
340 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
341 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
342 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
343 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
344 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
345 static tree handle_noplt_attribute (tree *, tree, tree, int, bool *) ;
346 static tree handle_alias_ifunc_attribute (bool, tree *, tree, tree, bool *);
347 static tree handle_ifunc_attribute (tree *, tree, tree, int, bool *);
348 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
349 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
350 static tree handle_visibility_attribute (tree *, tree, tree, int,
352 static tree handle_tls_model_attribute (tree *, tree, tree, int,
354 static tree handle_no_instrument_function_attribute (tree *, tree,
356 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
357 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
358 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
360 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
361 static tree handle_tm_attribute (tree *, tree, tree, int, bool *);
362 static tree handle_tm_wrap_attribute (tree *, tree, tree, int, bool *);
363 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
364 static tree handle_deprecated_attribute (tree *, tree, tree, int,
366 static tree handle_vector_size_attribute (tree *, tree, tree, int,
368 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
369 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
370 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
371 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
373 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
374 static tree handle_type_generic_attribute (tree *, tree, tree, int, bool *);
375 static tree handle_alloc_size_attribute (tree *, tree, tree, int, bool *);
376 static tree handle_alloc_align_attribute (tree *, tree, tree, int, bool *);
377 static tree handle_assume_aligned_attribute (tree *, tree, tree, int, bool *);
378 static tree handle_target_attribute (tree *, tree, tree, int, bool *);
379 static tree handle_target_clones_attribute (tree *, tree, tree, int, bool *);
380 static tree handle_optimize_attribute (tree *, tree, tree, int, bool *);
381 static tree ignore_attribute (tree *, tree, tree, int, bool *);
382 static tree handle_no_split_stack_attribute (tree *, tree, tree, int, bool *);
383 static tree handle_fnspec_attribute (tree *, tree, tree, int, bool *);
384 static tree handle_warn_unused_attribute (tree *, tree, tree, int, bool *);
385 static tree handle_returns_nonnull_attribute (tree *, tree, tree, int, bool *);
386 static tree handle_omp_declare_simd_attribute (tree *, tree, tree, int,
388 static tree handle_simd_attribute (tree *, tree, tree, int, bool *);
389 static tree handle_omp_declare_target_attribute (tree *, tree, tree, int,
391 static tree handle_designated_init_attribute (tree *, tree, tree, int, bool *);
392 static tree handle_bnd_variable_size_attribute (tree *, tree, tree, int, bool *);
393 static tree handle_bnd_legacy (tree *, tree, tree, int, bool *);
394 static tree handle_bnd_instrument (tree *, tree, tree, int, bool *);
396 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
397 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
398 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
399 static int resort_field_decl_cmp (const void *, const void *);
401 /* Reserved words. The third field is a mask: keywords are disabled
402 if they match the mask.
405 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
406 C --std=c99: D_CXXONLY | D_OBJC
407 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
408 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
409 C++ --std=c0x: D_CONLY | D_OBJC
410 ObjC++ is like C++ except that D_OBJC is not set
412 If -fno-asm is used, D_ASM is added to the mask. If
413 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
414 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
415 In C with -Wc++-compat, we warn if D_CXXWARN is set.
417 Note the complication of the D_CXX_OBJC keywords. These are
418 reserved words such as 'class'. In C++, 'class' is a reserved
419 word. In Objective-C++ it is too. In Objective-C, it is a
420 reserved word too, but only if it follows an '@' sign.
422 const struct c_common_resword c_common_reswords[] =
424 { "_Alignas", RID_ALIGNAS, D_CONLY },
425 { "_Alignof", RID_ALIGNOF, D_CONLY },
426 { "_Atomic", RID_ATOMIC, D_CONLY },
427 { "_Bool", RID_BOOL, D_CONLY },
428 { "_Complex", RID_COMPLEX, 0 },
429 { "_Cilk_spawn", RID_CILK_SPAWN, 0 },
430 { "_Cilk_sync", RID_CILK_SYNC, 0 },
431 { "_Cilk_for", RID_CILK_FOR, 0 },
432 { "_Imaginary", RID_IMAGINARY, D_CONLY },
433 { "_Decimal32", RID_DFLOAT32, D_CONLY | D_EXT },
434 { "_Decimal64", RID_DFLOAT64, D_CONLY | D_EXT },
435 { "_Decimal128", RID_DFLOAT128, D_CONLY | D_EXT },
436 { "_Fract", RID_FRACT, D_CONLY | D_EXT },
437 { "_Accum", RID_ACCUM, D_CONLY | D_EXT },
438 { "_Sat", RID_SAT, D_CONLY | D_EXT },
439 { "_Static_assert", RID_STATIC_ASSERT, D_CONLY },
440 { "_Noreturn", RID_NORETURN, D_CONLY },
441 { "_Generic", RID_GENERIC, D_CONLY },
442 { "_Thread_local", RID_THREAD, D_CONLY },
443 { "__FUNCTION__", RID_FUNCTION_NAME, 0 },
444 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME, 0 },
445 { "__alignof", RID_ALIGNOF, 0 },
446 { "__alignof__", RID_ALIGNOF, 0 },
447 { "__asm", RID_ASM, 0 },
448 { "__asm__", RID_ASM, 0 },
449 { "__attribute", RID_ATTRIBUTE, 0 },
450 { "__attribute__", RID_ATTRIBUTE, 0 },
451 { "__auto_type", RID_AUTO_TYPE, D_CONLY },
452 { "__bases", RID_BASES, D_CXXONLY },
453 { "__builtin_call_with_static_chain",
454 RID_BUILTIN_CALL_WITH_STATIC_CHAIN, D_CONLY },
455 { "__builtin_choose_expr", RID_CHOOSE_EXPR, D_CONLY },
456 { "__builtin_complex", RID_BUILTIN_COMPLEX, D_CONLY },
457 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE, 0 },
458 { "__builtin_offsetof", RID_OFFSETOF, 0 },
459 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P, D_CONLY },
460 { "__builtin_va_arg", RID_VA_ARG, 0 },
461 { "__complex", RID_COMPLEX, 0 },
462 { "__complex__", RID_COMPLEX, 0 },
463 { "__const", RID_CONST, 0 },
464 { "__const__", RID_CONST, 0 },
465 { "__decltype", RID_DECLTYPE, D_CXXONLY },
466 { "__direct_bases", RID_DIRECT_BASES, D_CXXONLY },
467 { "__extension__", RID_EXTENSION, 0 },
468 { "__func__", RID_C99_FUNCTION_NAME, 0 },
469 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN, D_CXXONLY },
470 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR, D_CXXONLY },
471 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY, D_CXXONLY },
472 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN, D_CXXONLY },
473 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR, D_CXXONLY },
474 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY, D_CXXONLY },
475 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR, D_CXXONLY },
476 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR, D_CXXONLY },
477 { "__imag", RID_IMAGPART, 0 },
478 { "__imag__", RID_IMAGPART, 0 },
479 { "__inline", RID_INLINE, 0 },
480 { "__inline__", RID_INLINE, 0 },
481 { "__is_abstract", RID_IS_ABSTRACT, D_CXXONLY },
482 { "__is_base_of", RID_IS_BASE_OF, D_CXXONLY },
483 { "__is_class", RID_IS_CLASS, D_CXXONLY },
484 { "__is_empty", RID_IS_EMPTY, D_CXXONLY },
485 { "__is_enum", RID_IS_ENUM, D_CXXONLY },
486 { "__is_final", RID_IS_FINAL, D_CXXONLY },
487 { "__is_literal_type", RID_IS_LITERAL_TYPE, D_CXXONLY },
488 { "__is_pod", RID_IS_POD, D_CXXONLY },
489 { "__is_polymorphic", RID_IS_POLYMORPHIC, D_CXXONLY },
490 { "__is_same_as", RID_IS_SAME_AS, D_CXXONLY },
491 { "__is_standard_layout", RID_IS_STD_LAYOUT, D_CXXONLY },
492 { "__is_trivial", RID_IS_TRIVIAL, D_CXXONLY },
493 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE, D_CXXONLY },
494 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE, D_CXXONLY },
495 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE, D_CXXONLY },
496 { "__is_union", RID_IS_UNION, D_CXXONLY },
497 { "__label__", RID_LABEL, 0 },
498 { "__null", RID_NULL, 0 },
499 { "__real", RID_REALPART, 0 },
500 { "__real__", RID_REALPART, 0 },
501 { "__restrict", RID_RESTRICT, 0 },
502 { "__restrict__", RID_RESTRICT, 0 },
503 { "__signed", RID_SIGNED, 0 },
504 { "__signed__", RID_SIGNED, 0 },
505 { "__thread", RID_THREAD, 0 },
506 { "__transaction_atomic", RID_TRANSACTION_ATOMIC, 0 },
507 { "__transaction_relaxed", RID_TRANSACTION_RELAXED, 0 },
508 { "__transaction_cancel", RID_TRANSACTION_CANCEL, 0 },
509 { "__typeof", RID_TYPEOF, 0 },
510 { "__typeof__", RID_TYPEOF, 0 },
511 { "__underlying_type", RID_UNDERLYING_TYPE, D_CXXONLY },
512 { "__volatile", RID_VOLATILE, 0 },
513 { "__volatile__", RID_VOLATILE, 0 },
514 { "alignas", RID_ALIGNAS, D_CXXONLY | D_CXX11 | D_CXXWARN },
515 { "alignof", RID_ALIGNOF, D_CXXONLY | D_CXX11 | D_CXXWARN },
516 { "asm", RID_ASM, D_ASM },
517 { "auto", RID_AUTO, 0 },
518 { "bool", RID_BOOL, D_CXXONLY | D_CXXWARN },
519 { "break", RID_BREAK, 0 },
520 { "case", RID_CASE, 0 },
521 { "catch", RID_CATCH, D_CXX_OBJC | D_CXXWARN },
522 { "char", RID_CHAR, 0 },
523 { "char16_t", RID_CHAR16, D_CXXONLY | D_CXX11 | D_CXXWARN },
524 { "char32_t", RID_CHAR32, D_CXXONLY | D_CXX11 | D_CXXWARN },
525 { "class", RID_CLASS, D_CXX_OBJC | D_CXXWARN },
526 { "const", RID_CONST, 0 },
527 { "constexpr", RID_CONSTEXPR, D_CXXONLY | D_CXX11 | D_CXXWARN },
528 { "const_cast", RID_CONSTCAST, D_CXXONLY | D_CXXWARN },
529 { "continue", RID_CONTINUE, 0 },
530 { "decltype", RID_DECLTYPE, D_CXXONLY | D_CXX11 | D_CXXWARN },
531 { "default", RID_DEFAULT, 0 },
532 { "delete", RID_DELETE, D_CXXONLY | D_CXXWARN },
534 { "double", RID_DOUBLE, 0 },
535 { "dynamic_cast", RID_DYNCAST, D_CXXONLY | D_CXXWARN },
536 { "else", RID_ELSE, 0 },
537 { "enum", RID_ENUM, 0 },
538 { "explicit", RID_EXPLICIT, D_CXXONLY | D_CXXWARN },
539 { "export", RID_EXPORT, D_CXXONLY | D_CXXWARN },
540 { "extern", RID_EXTERN, 0 },
541 { "false", RID_FALSE, D_CXXONLY | D_CXXWARN },
542 { "float", RID_FLOAT, 0 },
543 { "for", RID_FOR, 0 },
544 { "friend", RID_FRIEND, D_CXXONLY | D_CXXWARN },
545 { "goto", RID_GOTO, 0 },
547 { "inline", RID_INLINE, D_EXT89 },
548 { "int", RID_INT, 0 },
549 { "long", RID_LONG, 0 },
550 { "mutable", RID_MUTABLE, D_CXXONLY | D_CXXWARN },
551 { "namespace", RID_NAMESPACE, D_CXXONLY | D_CXXWARN },
552 { "new", RID_NEW, D_CXXONLY | D_CXXWARN },
553 { "noexcept", RID_NOEXCEPT, D_CXXONLY | D_CXX11 | D_CXXWARN },
554 { "nullptr", RID_NULLPTR, D_CXXONLY | D_CXX11 | D_CXXWARN },
555 { "operator", RID_OPERATOR, D_CXXONLY | D_CXXWARN },
556 { "private", RID_PRIVATE, D_CXX_OBJC | D_CXXWARN },
557 { "protected", RID_PROTECTED, D_CXX_OBJC | D_CXXWARN },
558 { "public", RID_PUBLIC, D_CXX_OBJC | D_CXXWARN },
559 { "register", RID_REGISTER, 0 },
560 { "reinterpret_cast", RID_REINTCAST, D_CXXONLY | D_CXXWARN },
561 { "restrict", RID_RESTRICT, D_CONLY | D_C99 },
562 { "return", RID_RETURN, 0 },
563 { "short", RID_SHORT, 0 },
564 { "signed", RID_SIGNED, 0 },
565 { "sizeof", RID_SIZEOF, 0 },
566 { "static", RID_STATIC, 0 },
567 { "static_assert", RID_STATIC_ASSERT, D_CXXONLY | D_CXX11 | D_CXXWARN },
568 { "static_cast", RID_STATCAST, D_CXXONLY | D_CXXWARN },
569 { "struct", RID_STRUCT, 0 },
570 { "switch", RID_SWITCH, 0 },
571 { "template", RID_TEMPLATE, D_CXXONLY | D_CXXWARN },
572 { "this", RID_THIS, D_CXXONLY | D_CXXWARN },
573 { "thread_local", RID_THREAD, D_CXXONLY | D_CXX11 | D_CXXWARN },
574 { "throw", RID_THROW, D_CXX_OBJC | D_CXXWARN },
575 { "true", RID_TRUE, D_CXXONLY | D_CXXWARN },
576 { "try", RID_TRY, D_CXX_OBJC | D_CXXWARN },
577 { "typedef", RID_TYPEDEF, 0 },
578 { "typename", RID_TYPENAME, D_CXXONLY | D_CXXWARN },
579 { "typeid", RID_TYPEID, D_CXXONLY | D_CXXWARN },
580 { "typeof", RID_TYPEOF, D_ASM | D_EXT },
581 { "union", RID_UNION, 0 },
582 { "unsigned", RID_UNSIGNED, 0 },
583 { "using", RID_USING, D_CXXONLY | D_CXXWARN },
584 { "virtual", RID_VIRTUAL, D_CXXONLY | D_CXXWARN },
585 { "void", RID_VOID, 0 },
586 { "volatile", RID_VOLATILE, 0 },
587 { "wchar_t", RID_WCHAR, D_CXXONLY },
588 { "while", RID_WHILE, 0 },
590 /* C++ transactional memory. */
591 { "synchronized", RID_SYNCHRONIZED, D_CXX_OBJC | D_TRANSMEM },
592 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT, D_CXXONLY | D_TRANSMEM },
593 { "atomic_cancel", RID_ATOMIC_CANCEL, D_CXXONLY | D_TRANSMEM },
594 { "atomic_commit", RID_TRANSACTION_ATOMIC, D_CXXONLY | D_TRANSMEM },
596 /* Concepts-related keywords */
597 { "concept", RID_CONCEPT, D_CXX_CONCEPTS_FLAGS | D_CXXWARN },
598 { "requires", RID_REQUIRES, D_CXX_CONCEPTS_FLAGS | D_CXXWARN },
600 /* These Objective-C keywords are recognized only immediately after
602 { "compatibility_alias", RID_AT_ALIAS, D_OBJC },
603 { "defs", RID_AT_DEFS, D_OBJC },
604 { "encode", RID_AT_ENCODE, D_OBJC },
605 { "end", RID_AT_END, D_OBJC },
606 { "implementation", RID_AT_IMPLEMENTATION, D_OBJC },
607 { "interface", RID_AT_INTERFACE, D_OBJC },
608 { "protocol", RID_AT_PROTOCOL, D_OBJC },
609 { "selector", RID_AT_SELECTOR, D_OBJC },
610 { "finally", RID_AT_FINALLY, D_OBJC },
611 { "optional", RID_AT_OPTIONAL, D_OBJC },
612 { "required", RID_AT_REQUIRED, D_OBJC },
613 { "property", RID_AT_PROPERTY, D_OBJC },
614 { "package", RID_AT_PACKAGE, D_OBJC },
615 { "synthesize", RID_AT_SYNTHESIZE, D_OBJC },
616 { "dynamic", RID_AT_DYNAMIC, D_OBJC },
617 /* These are recognized only in protocol-qualifier context
619 { "bycopy", RID_BYCOPY, D_OBJC },
620 { "byref", RID_BYREF, D_OBJC },
621 { "in", RID_IN, D_OBJC },
622 { "inout", RID_INOUT, D_OBJC },
623 { "oneway", RID_ONEWAY, D_OBJC },
624 { "out", RID_OUT, D_OBJC },
625 /* These are recognized inside a property attribute list */
626 { "assign", RID_ASSIGN, D_OBJC },
627 { "copy", RID_COPY, D_OBJC },
628 { "getter", RID_GETTER, D_OBJC },
629 { "nonatomic", RID_NONATOMIC, D_OBJC },
630 { "readonly", RID_READONLY, D_OBJC },
631 { "readwrite", RID_READWRITE, D_OBJC },
632 { "retain", RID_RETAIN, D_OBJC },
633 { "setter", RID_SETTER, D_OBJC },
636 const unsigned int num_c_common_reswords =
637 sizeof c_common_reswords / sizeof (struct c_common_resword);
639 /* Table of machine-independent attributes common to all C-like languages.
641 All attributes referencing arguments should be additionally processed
642 in chkp_copy_function_type_adding_bounds for correct instrumentation
643 by Pointer Bounds Checker.
644 Current list of processed common attributes: nonnull. */
645 const struct attribute_spec c_common_attribute_table[] =
647 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
648 affects_type_identity } */
649 { "packed", 0, 0, false, false, false,
650 handle_packed_attribute , false},
651 { "nocommon", 0, 0, true, false, false,
652 handle_nocommon_attribute, false},
653 { "common", 0, 0, true, false, false,
654 handle_common_attribute, false },
655 /* FIXME: logically, noreturn attributes should be listed as
656 "false, true, true" and apply to function types. But implementing this
657 would require all the places in the compiler that use TREE_THIS_VOLATILE
658 on a decl to identify non-returning functions to be located and fixed
659 to check the function type instead. */
660 { "noreturn", 0, 0, true, false, false,
661 handle_noreturn_attribute, false },
662 { "volatile", 0, 0, true, false, false,
663 handle_noreturn_attribute, false },
664 { "stack_protect", 0, 0, true, false, false,
665 handle_stack_protect_attribute, false },
666 { "noinline", 0, 0, true, false, false,
667 handle_noinline_attribute, false },
668 { "noclone", 0, 0, true, false, false,
669 handle_noclone_attribute, false },
670 { "no_icf", 0, 0, true, false, false,
671 handle_noicf_attribute, false },
672 { "leaf", 0, 0, true, false, false,
673 handle_leaf_attribute, false },
674 { "always_inline", 0, 0, true, false, false,
675 handle_always_inline_attribute, false },
676 { "gnu_inline", 0, 0, true, false, false,
677 handle_gnu_inline_attribute, false },
678 { "artificial", 0, 0, true, false, false,
679 handle_artificial_attribute, false },
680 { "flatten", 0, 0, true, false, false,
681 handle_flatten_attribute, false },
682 { "used", 0, 0, true, false, false,
683 handle_used_attribute, false },
684 { "unused", 0, 0, false, false, false,
685 handle_unused_attribute, false },
686 { "externally_visible", 0, 0, true, false, false,
687 handle_externally_visible_attribute, false },
688 { "no_reorder", 0, 0, true, false, false,
689 handle_no_reorder_attribute, false },
690 /* The same comments as for noreturn attributes apply to const ones. */
691 { "const", 0, 0, true, false, false,
692 handle_const_attribute, false },
693 { "scalar_storage_order", 1, 1, false, false, false,
694 handle_scalar_storage_order_attribute, false },
695 { "transparent_union", 0, 0, false, false, false,
696 handle_transparent_union_attribute, false },
697 { "constructor", 0, 1, true, false, false,
698 handle_constructor_attribute, false },
699 { "destructor", 0, 1, true, false, false,
700 handle_destructor_attribute, false },
701 { "mode", 1, 1, false, true, false,
702 handle_mode_attribute, false },
703 { "section", 1, 1, true, false, false,
704 handle_section_attribute, false },
705 { "aligned", 0, 1, false, false, false,
706 handle_aligned_attribute, false },
707 { "weak", 0, 0, true, false, false,
708 handle_weak_attribute, false },
709 { "noplt", 0, 0, true, false, false,
710 handle_noplt_attribute, false },
711 { "ifunc", 1, 1, true, false, false,
712 handle_ifunc_attribute, false },
713 { "alias", 1, 1, true, false, false,
714 handle_alias_attribute, false },
715 { "weakref", 0, 1, true, false, false,
716 handle_weakref_attribute, false },
717 { "no_instrument_function", 0, 0, true, false, false,
718 handle_no_instrument_function_attribute,
720 { "malloc", 0, 0, true, false, false,
721 handle_malloc_attribute, false },
722 { "returns_twice", 0, 0, true, false, false,
723 handle_returns_twice_attribute, false },
724 { "no_stack_limit", 0, 0, true, false, false,
725 handle_no_limit_stack_attribute, false },
726 { "pure", 0, 0, true, false, false,
727 handle_pure_attribute, false },
728 { "transaction_callable", 0, 0, false, true, false,
729 handle_tm_attribute, false },
730 { "transaction_unsafe", 0, 0, false, true, false,
731 handle_tm_attribute, true },
732 { "transaction_safe", 0, 0, false, true, false,
733 handle_tm_attribute, true },
734 { "transaction_safe_dynamic", 0, 0, true, false, false,
735 handle_tm_attribute, false },
736 { "transaction_may_cancel_outer", 0, 0, false, true, false,
737 handle_tm_attribute, false },
738 /* ??? These two attributes didn't make the transition from the
739 Intel language document to the multi-vendor language document. */
740 { "transaction_pure", 0, 0, false, true, false,
741 handle_tm_attribute, false },
742 { "transaction_wrap", 1, 1, true, false, false,
743 handle_tm_wrap_attribute, false },
744 /* For internal use (marking of builtins) only. The name contains space
745 to prevent its usage in source code. */
746 { "no vops", 0, 0, true, false, false,
747 handle_novops_attribute, false },
748 { "deprecated", 0, 1, false, false, false,
749 handle_deprecated_attribute, false },
750 { "vector_size", 1, 1, false, true, false,
751 handle_vector_size_attribute, false },
752 { "visibility", 1, 1, false, false, false,
753 handle_visibility_attribute, false },
754 { "tls_model", 1, 1, true, false, false,
755 handle_tls_model_attribute, false },
756 { "nonnull", 0, -1, false, true, true,
757 handle_nonnull_attribute, false },
758 { "nothrow", 0, 0, true, false, false,
759 handle_nothrow_attribute, false },
760 { "may_alias", 0, 0, false, true, false, NULL, false },
761 { "cleanup", 1, 1, true, false, false,
762 handle_cleanup_attribute, false },
763 { "warn_unused_result", 0, 0, false, true, true,
764 handle_warn_unused_result_attribute, false },
765 { "sentinel", 0, 1, false, true, true,
766 handle_sentinel_attribute, false },
767 /* For internal use (marking of builtins) only. The name contains space
768 to prevent its usage in source code. */
769 { "type generic", 0, 0, false, true, true,
770 handle_type_generic_attribute, false },
771 { "alloc_size", 1, 2, false, true, true,
772 handle_alloc_size_attribute, false },
773 { "cold", 0, 0, true, false, false,
774 handle_cold_attribute, false },
775 { "hot", 0, 0, true, false, false,
776 handle_hot_attribute, false },
777 { "no_address_safety_analysis",
778 0, 0, true, false, false,
779 handle_no_address_safety_analysis_attribute,
781 { "no_sanitize_address", 0, 0, true, false, false,
782 handle_no_sanitize_address_attribute,
784 { "no_sanitize_thread", 0, 0, true, false, false,
785 handle_no_sanitize_address_attribute,
787 { "no_sanitize_undefined", 0, 0, true, false, false,
788 handle_no_sanitize_undefined_attribute,
790 { "warning", 1, 1, true, false, false,
791 handle_error_attribute, false },
792 { "error", 1, 1, true, false, false,
793 handle_error_attribute, false },
794 { "target", 1, -1, true, false, false,
795 handle_target_attribute, false },
796 { "target_clones", 1, -1, true, false, false,
797 handle_target_clones_attribute, false },
798 { "optimize", 1, -1, true, false, false,
799 handle_optimize_attribute, false },
800 /* For internal use only. The leading '*' both prevents its usage in
801 source code and signals that it may be overridden by machine tables. */
802 { "*tm regparm", 0, 0, false, true, true,
803 ignore_attribute, false },
804 { "no_split_stack", 0, 0, true, false, false,
805 handle_no_split_stack_attribute, false },
806 /* For internal use (marking of builtins and runtime functions) only.
807 The name contains space to prevent its usage in source code. */
808 { "fn spec", 1, 1, false, true, true,
809 handle_fnspec_attribute, false },
810 { "warn_unused", 0, 0, false, false, false,
811 handle_warn_unused_attribute, false },
812 { "returns_nonnull", 0, 0, false, true, true,
813 handle_returns_nonnull_attribute, false },
814 { "omp declare simd", 0, -1, true, false, false,
815 handle_omp_declare_simd_attribute, false },
816 { "cilk simd function", 0, -1, true, false, false,
817 handle_omp_declare_simd_attribute, false },
818 { "simd", 0, 1, true, false, false,
819 handle_simd_attribute, false },
820 { "omp declare target", 0, 0, true, false, false,
821 handle_omp_declare_target_attribute, false },
822 { "omp declare target link", 0, 0, true, false, false,
823 handle_omp_declare_target_attribute, false },
824 { "alloc_align", 1, 1, false, true, true,
825 handle_alloc_align_attribute, false },
826 { "assume_aligned", 1, 2, false, true, true,
827 handle_assume_aligned_attribute, false },
828 { "designated_init", 0, 0, false, true, false,
829 handle_designated_init_attribute, false },
830 { "bnd_variable_size", 0, 0, true, false, false,
831 handle_bnd_variable_size_attribute, false },
832 { "bnd_legacy", 0, 0, true, false, false,
833 handle_bnd_legacy, false },
834 { "bnd_instrument", 0, 0, true, false, false,
835 handle_bnd_instrument, false },
836 { NULL, 0, 0, false, false, false, NULL, false }
839 /* Give the specifications for the format attributes, used by C and all
842 All attributes referencing arguments should be additionally processed
843 in chkp_copy_function_type_adding_bounds for correct instrumentation
844 by Pointer Bounds Checker.
845 Current list of processed format attributes: format, format_arg. */
846 const struct attribute_spec c_common_format_attribute_table[] =
848 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
849 affects_type_identity } */
850 { "format", 3, 3, false, true, true,
851 handle_format_attribute, false },
852 { "format_arg", 1, 1, false, true, true,
853 handle_format_arg_attribute, false },
854 { NULL, 0, 0, false, false, false, NULL, false }
857 /* Return identifier for address space AS. */
860 c_addr_space_name (addr_space_t as)
862 int rid = RID_FIRST_ADDR_SPACE + as;
863 gcc_assert (ridpointers [rid]);
864 return IDENTIFIER_POINTER (ridpointers [rid]);
867 /* Push current bindings for the function name VAR_DECLS. */
870 start_fname_decls (void)
873 tree saved = NULL_TREE;
875 for (ix = 0; fname_vars[ix].decl; ix++)
877 tree decl = *fname_vars[ix].decl;
881 saved = tree_cons (decl, build_int_cst (integer_type_node, ix),
883 *fname_vars[ix].decl = NULL_TREE;
886 if (saved || saved_function_name_decls)
887 /* Normally they'll have been NULL, so only push if we've got a
888 stack, or they are non-NULL. */
889 saved_function_name_decls = tree_cons (saved, NULL_TREE,
890 saved_function_name_decls);
893 /* Finish up the current bindings, adding them into the current function's
894 statement tree. This must be done _before_ finish_stmt_tree is called.
895 If there is no current function, we must be at file scope and no statements
896 are involved. Pop the previous bindings. */
899 finish_fname_decls (void)
902 tree stmts = NULL_TREE;
903 tree stack = saved_function_name_decls;
905 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
906 append_to_statement_list (TREE_VALUE (stack), &stmts);
910 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
912 if (TREE_CODE (*bodyp) == BIND_EXPR)
913 bodyp = &BIND_EXPR_BODY (*bodyp);
915 append_to_statement_list_force (*bodyp, &stmts);
919 for (ix = 0; fname_vars[ix].decl; ix++)
920 *fname_vars[ix].decl = NULL_TREE;
924 /* We had saved values, restore them. */
927 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
929 tree decl = TREE_PURPOSE (saved);
930 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
932 *fname_vars[ix].decl = decl;
934 stack = TREE_CHAIN (stack);
936 saved_function_name_decls = stack;
939 /* Return the text name of the current function, suitably prettified
940 by PRETTY_P. Return string must be freed by caller. */
943 fname_as_string (int pretty_p)
945 const char *name = "top level";
948 cpp_string cstr = { 0, 0 }, strname;
956 if (current_function_decl)
957 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
959 len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
961 namep = XNEWVEC (char, len);
962 snprintf (namep, len, "\"%s\"", name);
963 strname.text = (unsigned char *) namep;
964 strname.len = len - 1;
966 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, CPP_STRING))
969 return (const char *) cstr.text;
975 /* Return the VAR_DECL for a const char array naming the current
976 function. If the VAR_DECL has not yet been created, create it
977 now. RID indicates how it should be formatted and IDENTIFIER_NODE
978 ID is its name (unfortunately C and C++ hold the RID values of
979 keywords in different places, so we can't derive RID from ID in
980 this language independent code. LOC is the location of the
984 fname_decl (location_t loc, unsigned int rid, tree id)
987 tree decl = NULL_TREE;
989 for (ix = 0; fname_vars[ix].decl; ix++)
990 if (fname_vars[ix].rid == rid)
993 decl = *fname_vars[ix].decl;
996 /* If a tree is built here, it would normally have the lineno of
997 the current statement. Later this tree will be moved to the
998 beginning of the function and this line number will be wrong.
999 To avoid this problem set the lineno to 0 here; that prevents
1000 it from appearing in the RTL. */
1002 location_t saved_location = input_location;
1003 input_location = UNKNOWN_LOCATION;
1005 stmts = push_stmt_list ();
1006 decl = (*make_fname_decl) (loc, id, fname_vars[ix].pretty);
1007 stmts = pop_stmt_list (stmts);
1008 if (!IS_EMPTY_STMT (stmts))
1009 saved_function_name_decls
1010 = tree_cons (decl, stmts, saved_function_name_decls);
1011 *fname_vars[ix].decl = decl;
1012 input_location = saved_location;
1014 if (!ix && !current_function_decl)
1015 pedwarn (loc, 0, "%qD is not defined outside of function scope", decl);
1020 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1023 fix_string_type (tree value)
1025 int length = TREE_STRING_LENGTH (value);
1027 tree e_type, i_type, a_type;
1029 /* Compute the number of elements, for the array type. */
1030 if (TREE_TYPE (value) == char_array_type_node || !TREE_TYPE (value))
1033 e_type = char_type_node;
1035 else if (TREE_TYPE (value) == char16_array_type_node)
1037 nchars = length / (TYPE_PRECISION (char16_type_node) / BITS_PER_UNIT);
1038 e_type = char16_type_node;
1040 else if (TREE_TYPE (value) == char32_array_type_node)
1042 nchars = length / (TYPE_PRECISION (char32_type_node) / BITS_PER_UNIT);
1043 e_type = char32_type_node;
1047 nchars = length / (TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT);
1048 e_type = wchar_type_node;
1051 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1052 limit in C++98 Annex B is very large (65536) and is not normative,
1053 so we do not diagnose it (warn_overlength_strings is forced off
1054 in c_common_post_options). */
1055 if (warn_overlength_strings)
1057 const int nchars_max = flag_isoc99 ? 4095 : 509;
1058 const int relevant_std = flag_isoc99 ? 99 : 90;
1059 if (nchars - 1 > nchars_max)
1060 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1061 separate the %d from the 'C'. 'ISO' should not be
1062 translated, but it may be moved after 'C%d' in languages
1063 where modifiers follow nouns. */
1064 pedwarn (input_location, OPT_Woverlength_strings,
1065 "string length %qd is greater than the length %qd "
1066 "ISO C%d compilers are required to support",
1067 nchars - 1, nchars_max, relevant_std);
1070 /* Create the array type for the string constant. The ISO C++
1071 standard says that a string literal has type `const char[N]' or
1072 `const wchar_t[N]'. We use the same logic when invoked as a C
1073 front-end with -Wwrite-strings.
1074 ??? We should change the type of an expression depending on the
1075 state of a warning flag. We should just be warning -- see how
1076 this is handled in the C++ front-end for the deprecated implicit
1077 conversion from string literals to `char*' or `wchar_t*'.
1079 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1080 array type being the unqualified version of that type.
1081 Therefore, if we are constructing an array of const char, we must
1082 construct the matching unqualified array type first. The C front
1083 end does not require this, but it does no harm, so we do it
1085 i_type = build_index_type (size_int (nchars - 1));
1086 a_type = build_array_type (e_type, i_type);
1087 if (c_dialect_cxx() || warn_write_strings)
1088 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
1090 TREE_TYPE (value) = a_type;
1091 TREE_CONSTANT (value) = 1;
1092 TREE_READONLY (value) = 1;
1093 TREE_STATIC (value) = 1;
1097 /* Fold X for consideration by one of the warning functions when checking
1098 whether an expression has a constant value. */
1101 fold_for_warn (tree x)
1103 if (c_dialect_cxx ())
1104 return c_fully_fold (x, /*for_init*/false, /*maybe_constp*/NULL);
1106 /* The C front-end has already folded X appropriately. */
1110 /* Print a warning if a constant expression had overflow in folding.
1111 Invoke this function on every expression that the language
1112 requires to be a constant expression.
1113 Note the ANSI C standard says it is erroneous for a
1114 constant expression to overflow. */
1117 constant_expression_warning (tree value)
1119 if (warn_overflow && pedantic
1120 && (TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1121 || TREE_CODE (value) == FIXED_CST
1122 || TREE_CODE (value) == VECTOR_CST
1123 || TREE_CODE (value) == COMPLEX_CST)
1124 && TREE_OVERFLOW (value))
1125 pedwarn (input_location, OPT_Woverflow, "overflow in constant expression");
1128 /* The same as above but print an unconditional error. */
1130 constant_expression_error (tree value)
1132 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1133 || TREE_CODE (value) == FIXED_CST
1134 || TREE_CODE (value) == VECTOR_CST
1135 || TREE_CODE (value) == COMPLEX_CST)
1136 && TREE_OVERFLOW (value))
1137 error ("overflow in constant expression");
1140 /* Print a warning if an expression had overflow in folding and its
1143 Invoke this function on every expression that
1144 (1) appears in the source code, and
1145 (2) is a constant expression that overflowed, and
1146 (3) is not already checked by convert_and_check;
1147 however, do not invoke this function on operands of explicit casts
1148 or when the expression is the result of an operator and any operand
1149 already overflowed. */
1152 overflow_warning (location_t loc, tree value)
1154 if (c_inhibit_evaluation_warnings != 0)
1157 switch (TREE_CODE (value))
1160 warning_at (loc, OPT_Woverflow, "integer overflow in expression");
1164 warning_at (loc, OPT_Woverflow,
1165 "floating point overflow in expression");
1169 warning_at (loc, OPT_Woverflow, "fixed-point overflow in expression");
1173 warning_at (loc, OPT_Woverflow, "vector overflow in expression");
1177 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
1178 warning_at (loc, OPT_Woverflow,
1179 "complex integer overflow in expression");
1180 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
1181 warning_at (loc, OPT_Woverflow,
1182 "complex floating point overflow in expression");
1190 /* Warn about uses of logical || / && operator in a context where it
1191 is likely that the bitwise equivalent was intended by the
1192 programmer. We have seen an expression in which CODE is a binary
1193 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1194 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1196 warn_logical_operator (location_t location, enum tree_code code, tree type,
1197 enum tree_code code_left, tree op_left,
1198 enum tree_code ARG_UNUSED (code_right), tree op_right)
1200 int or_op = (code == TRUTH_ORIF_EXPR || code == TRUTH_OR_EXPR);
1201 int in0_p, in1_p, in_p;
1202 tree low0, low1, low, high0, high1, high, lhs, rhs, tem;
1203 bool strict_overflow_p = false;
1205 if (code != TRUTH_ANDIF_EXPR
1206 && code != TRUTH_AND_EXPR
1207 && code != TRUTH_ORIF_EXPR
1208 && code != TRUTH_OR_EXPR)
1211 /* We don't want to warn if either operand comes from a macro
1212 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1214 if (from_macro_expansion_at (EXPR_LOCATION (op_left))
1215 || from_macro_expansion_at (EXPR_LOCATION (op_right)))
1218 /* Warn if &&/|| are being used in a context where it is
1219 likely that the bitwise equivalent was intended by the
1220 programmer. That is, an expression such as op && MASK
1221 where op should not be any boolean expression, nor a
1222 constant, and mask seems to be a non-boolean integer constant. */
1223 if (TREE_CODE (op_right) == CONST_DECL)
1224 /* An enumerator counts as a constant. */
1225 op_right = DECL_INITIAL (op_right);
1226 if (!truth_value_p (code_left)
1227 && INTEGRAL_TYPE_P (TREE_TYPE (op_left))
1228 && !CONSTANT_CLASS_P (op_left)
1229 && !TREE_NO_WARNING (op_left)
1230 && TREE_CODE (op_right) == INTEGER_CST
1231 && !integer_zerop (op_right)
1232 && !integer_onep (op_right))
1235 warning_at (location, OPT_Wlogical_op, "logical %<or%>"
1236 " applied to non-boolean constant");
1238 warning_at (location, OPT_Wlogical_op, "logical %<and%>"
1239 " applied to non-boolean constant");
1240 TREE_NO_WARNING (op_left) = true;
1244 /* We do not warn for constants because they are typical of macro
1245 expansions that test for features. */
1246 if (CONSTANT_CLASS_P (fold_for_warn (op_left))
1247 || CONSTANT_CLASS_P (fold_for_warn (op_right)))
1250 /* This warning only makes sense with logical operands. */
1251 if (!(truth_value_p (TREE_CODE (op_left))
1252 || INTEGRAL_TYPE_P (TREE_TYPE (op_left)))
1253 || !(truth_value_p (TREE_CODE (op_right))
1254 || INTEGRAL_TYPE_P (TREE_TYPE (op_right))))
1257 /* The range computations only work with scalars. */
1258 if (VECTOR_TYPE_P (TREE_TYPE (op_left))
1259 || VECTOR_TYPE_P (TREE_TYPE (op_right)))
1262 /* We first test whether either side separately is trivially true
1263 (with OR) or trivially false (with AND). If so, do not warn.
1264 This is a common idiom for testing ranges of data types in
1266 lhs = make_range (op_left, &in0_p, &low0, &high0, &strict_overflow_p);
1269 if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
1270 lhs = C_MAYBE_CONST_EXPR_EXPR (lhs);
1272 /* If this is an OR operation, invert both sides; now, the result
1273 should be always false to get a warning. */
1277 tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in0_p, low0, high0);
1278 if (tem && integer_zerop (tem))
1281 rhs = make_range (op_right, &in1_p, &low1, &high1, &strict_overflow_p);
1284 if (TREE_CODE (rhs) == C_MAYBE_CONST_EXPR)
1285 rhs = C_MAYBE_CONST_EXPR_EXPR (rhs);
1287 /* If this is an OR operation, invert both sides; now, the result
1288 should be always false to get a warning. */
1292 tem = build_range_check (UNKNOWN_LOCATION, type, rhs, in1_p, low1, high1);
1293 if (tem && integer_zerop (tem))
1296 /* If both expressions have the same operand, if we can merge the
1298 if (operand_equal_p (lhs, rhs, 0)
1299 && merge_ranges (&in_p, &low, &high, in0_p, low0, high0,
1300 in1_p, low1, high1))
1302 tem = build_range_check (UNKNOWN_LOCATION, type, lhs, in_p, low, high);
1303 /* ... and if the range test is always false, then warn. */
1304 if (tem && integer_zerop (tem))
1307 warning_at (location, OPT_Wlogical_op,
1308 "logical %<or%> of collectively exhaustive tests is "
1311 warning_at (location, OPT_Wlogical_op,
1312 "logical %<and%> of mutually exclusive tests is "
1315 /* Or warn if the operands have exactly the same range, e.g.
1317 else if (tree_int_cst_equal (low0, low1)
1318 && tree_int_cst_equal (high0, high1))
1321 warning_at (location, OPT_Wlogical_op,
1322 "logical %<or%> of equal expressions");
1324 warning_at (location, OPT_Wlogical_op,
1325 "logical %<and%> of equal expressions");
1330 /* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1331 with constant indices. */
1334 find_array_ref_with_const_idx_r (tree *expr_p, int *walk_subtrees, void *data)
1336 tree expr = *expr_p;
1338 if ((TREE_CODE (expr) == ARRAY_REF
1339 || TREE_CODE (expr) == ARRAY_RANGE_REF)
1340 && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)
1342 *(bool *) data = true;
1349 /* Warn if a self-comparison always evaluates to true or false. LOC
1350 is the location of the comparison with code CODE, LHS and RHS are
1351 operands of the comparison. */
1354 warn_tautological_cmp (location_t loc, enum tree_code code, tree lhs, tree rhs)
1356 if (TREE_CODE_CLASS (code) != tcc_comparison)
1359 /* Don't warn for various macro expansions. */
1360 if (from_macro_expansion_at (loc)
1361 || from_macro_expansion_at (EXPR_LOCATION (lhs))
1362 || from_macro_expansion_at (EXPR_LOCATION (rhs)))
1365 /* We do not warn for constants because they are typical of macro
1366 expansions that test for features, sizeof, and similar. */
1367 if (CONSTANT_CLASS_P (fold_for_warn (lhs))
1368 || CONSTANT_CLASS_P (fold_for_warn (rhs)))
1371 /* Don't warn for e.g.
1374 if (n == (long) n) ...
1376 if ((CONVERT_EXPR_P (lhs) || TREE_CODE (lhs) == NON_LVALUE_EXPR)
1377 || (CONVERT_EXPR_P (rhs) || TREE_CODE (rhs) == NON_LVALUE_EXPR))
1380 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1381 It could be a NaN, and NaN never compares equal to anything, even
1383 if (FLOAT_TYPE_P (TREE_TYPE (lhs)) || FLOAT_TYPE_P (TREE_TYPE (rhs)))
1386 if (operand_equal_p (lhs, rhs, 0))
1388 /* Don't warn about array references with constant indices;
1389 these are likely to come from a macro. */
1391 walk_tree_without_duplicates (&lhs, find_array_ref_with_const_idx_r,
1395 const bool always_true = (code == EQ_EXPR || code == LE_EXPR
1396 || code == GE_EXPR || code == UNLE_EXPR
1397 || code == UNGE_EXPR || code == UNEQ_EXPR);
1399 warning_at (loc, OPT_Wtautological_compare,
1400 "self-comparison always evaluates to true");
1402 warning_at (loc, OPT_Wtautological_compare,
1403 "self-comparison always evaluates to false");
1407 /* Warn about logical not used on the left hand side operand of a comparison.
1408 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1409 Do not warn if RHS is of a boolean type. */
1412 warn_logical_not_parentheses (location_t location, enum tree_code code,
1415 if (TREE_CODE_CLASS (code) != tcc_comparison
1416 || TREE_TYPE (rhs) == NULL_TREE
1417 || TREE_CODE (TREE_TYPE (rhs)) == BOOLEAN_TYPE)
1420 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1421 !(x == 0) or !(y != 0). */
1422 if ((code == EQ_EXPR || code == NE_EXPR)
1423 && integer_zerop (rhs))
1426 warning_at (location, OPT_Wlogical_not_parentheses,
1427 "logical not is only applied to the left hand side of "
1431 /* Warn if EXP contains any computations whose results are not used.
1432 Return true if a warning is printed; false otherwise. LOCUS is the
1433 (potential) location of the expression. */
1436 warn_if_unused_value (const_tree exp, location_t locus)
1439 if (TREE_USED (exp) || TREE_NO_WARNING (exp))
1442 /* Don't warn about void constructs. This includes casting to void,
1443 void function calls, and statement expressions with a final cast
1445 if (VOID_TYPE_P (TREE_TYPE (exp)))
1448 if (EXPR_HAS_LOCATION (exp))
1449 locus = EXPR_LOCATION (exp);
1451 switch (TREE_CODE (exp))
1453 case PREINCREMENT_EXPR:
1454 case POSTINCREMENT_EXPR:
1455 case PREDECREMENT_EXPR:
1456 case POSTDECREMENT_EXPR:
1461 case TRY_CATCH_EXPR:
1462 case WITH_CLEANUP_EXPR:
1468 /* For a binding, warn if no side effect within it. */
1469 exp = BIND_EXPR_BODY (exp);
1473 case NON_LVALUE_EXPR:
1475 exp = TREE_OPERAND (exp, 0);
1478 case TRUTH_ORIF_EXPR:
1479 case TRUTH_ANDIF_EXPR:
1480 /* In && or ||, warn if 2nd operand has no side effect. */
1481 exp = TREE_OPERAND (exp, 1);
1485 if (warn_if_unused_value (TREE_OPERAND (exp, 0), locus))
1487 /* Let people do `(foo (), 0)' without a warning. */
1488 if (TREE_CONSTANT (TREE_OPERAND (exp, 1)))
1490 exp = TREE_OPERAND (exp, 1);
1494 /* If this is an expression with side effects, don't warn; this
1495 case commonly appears in macro expansions. */
1496 if (TREE_SIDE_EFFECTS (exp))
1501 /* Don't warn about automatic dereferencing of references, since
1502 the user cannot control it. */
1503 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE)
1505 exp = TREE_OPERAND (exp, 0);
1511 /* Referencing a volatile value is a side effect, so don't warn. */
1512 if ((DECL_P (exp) || REFERENCE_CLASS_P (exp))
1513 && TREE_THIS_VOLATILE (exp))
1516 /* If this is an expression which has no operands, there is no value
1517 to be unused. There are no such language-independent codes,
1518 but front ends may define such. */
1519 if (EXPRESSION_CLASS_P (exp) && TREE_OPERAND_LENGTH (exp) == 0)
1523 return warning_at (locus, OPT_Wunused_value, "value computed is not used");
1528 /* Print a warning about casts that might indicate violation
1529 of strict aliasing rules if -Wstrict-aliasing is used and
1530 strict aliasing mode is in effect. OTYPE is the original
1531 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1534 strict_aliasing_warning (tree otype, tree type, tree expr)
1536 /* Strip pointer conversion chains and get to the correct original type. */
1538 otype = TREE_TYPE (expr);
1540 if (!(flag_strict_aliasing
1541 && POINTER_TYPE_P (type)
1542 && POINTER_TYPE_P (otype)
1543 && !VOID_TYPE_P (TREE_TYPE (type)))
1544 /* If the type we are casting to is a ref-all pointer
1545 dereferencing it is always valid. */
1546 || TYPE_REF_CAN_ALIAS_ALL (type))
1549 if ((warn_strict_aliasing > 1) && TREE_CODE (expr) == ADDR_EXPR
1550 && (DECL_P (TREE_OPERAND (expr, 0))
1551 || handled_component_p (TREE_OPERAND (expr, 0))))
1553 /* Casting the address of an object to non void pointer. Warn
1554 if the cast breaks type based aliasing. */
1555 if (!COMPLETE_TYPE_P (TREE_TYPE (type)) && warn_strict_aliasing == 2)
1557 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1558 "might break strict-aliasing rules");
1563 /* warn_strict_aliasing >= 3. This includes the default (3).
1564 Only warn if the cast is dereferenced immediately. */
1565 alias_set_type set1 =
1566 get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
1567 alias_set_type set2 = get_alias_set (TREE_TYPE (type));
1569 if (set1 != set2 && set2 != 0
1571 || (!alias_set_subset_of (set2, set1)
1572 && !alias_sets_conflict_p (set1, set2))))
1574 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1575 "pointer will break strict-aliasing rules");
1578 else if (warn_strict_aliasing == 2
1579 && !alias_sets_must_conflict_p (set1, set2))
1581 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1582 "pointer might break strict-aliasing rules");
1588 if ((warn_strict_aliasing == 1) && !VOID_TYPE_P (TREE_TYPE (otype)))
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. */
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)
1597 || !alias_sets_must_conflict_p (set1, set2))
1599 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1600 "pointer might break strict-aliasing rules");
1608 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1609 sizeof as last operand of certain builtins. */
1612 sizeof_pointer_memaccess_warning (location_t *sizeof_arg_loc, tree callee,
1613 vec<tree, va_gc> *params, tree *sizeof_arg,
1614 bool (*comp_types) (tree, tree))
1616 tree type, dest = NULL_TREE, src = NULL_TREE, tem;
1617 bool strop = false, cmp = false;
1618 unsigned int idx = ~0;
1621 if (TREE_CODE (callee) != FUNCTION_DECL
1622 || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL
1623 || vec_safe_length (params) <= 1)
1626 switch (DECL_FUNCTION_CODE (callee))
1628 case BUILT_IN_STRNCMP:
1629 case BUILT_IN_STRNCASECMP:
1632 case BUILT_IN_STRNCPY:
1633 case BUILT_IN_STRNCPY_CHK:
1634 case BUILT_IN_STRNCAT:
1635 case BUILT_IN_STRNCAT_CHK:
1636 case BUILT_IN_STPNCPY:
1637 case BUILT_IN_STPNCPY_CHK:
1640 case BUILT_IN_MEMCPY:
1641 case BUILT_IN_MEMCPY_CHK:
1642 case BUILT_IN_MEMMOVE:
1643 case BUILT_IN_MEMMOVE_CHK:
1644 if (params->length () < 3)
1647 dest = (*params)[0];
1650 case BUILT_IN_BCOPY:
1651 if (params->length () < 3)
1654 dest = (*params)[1];
1657 case BUILT_IN_MEMCMP:
1659 if (params->length () < 3)
1662 dest = (*params)[0];
1666 case BUILT_IN_MEMSET:
1667 case BUILT_IN_MEMSET_CHK:
1668 if (params->length () < 3)
1670 dest = (*params)[0];
1673 case BUILT_IN_BZERO:
1674 dest = (*params)[0];
1677 case BUILT_IN_STRNDUP:
1682 case BUILT_IN_MEMCHR:
1683 if (params->length () < 3)
1688 case BUILT_IN_SNPRINTF:
1689 case BUILT_IN_SNPRINTF_CHK:
1690 case BUILT_IN_VSNPRINTF:
1691 case BUILT_IN_VSNPRINTF_CHK:
1692 dest = (*params)[0];
1703 if (sizeof_arg[idx] == NULL || sizeof_arg[idx] == error_mark_node)
1706 type = TYPE_P (sizeof_arg[idx])
1707 ? sizeof_arg[idx] : TREE_TYPE (sizeof_arg[idx]);
1708 if (!POINTER_TYPE_P (type))
1712 && (tem = tree_strip_nop_conversions (dest))
1713 && POINTER_TYPE_P (TREE_TYPE (tem))
1714 && comp_types (TREE_TYPE (TREE_TYPE (tem)), type))
1718 && (tem = tree_strip_nop_conversions (src))
1719 && POINTER_TYPE_P (TREE_TYPE (tem))
1720 && comp_types (TREE_TYPE (TREE_TYPE (tem)), type))
1723 loc = sizeof_arg_loc[idx];
1727 if (!TYPE_P (sizeof_arg[idx])
1728 && operand_equal_p (dest, sizeof_arg[idx], 0)
1729 && comp_types (TREE_TYPE (dest), type))
1731 if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
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))
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);
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);
1751 if (POINTER_TYPE_P (TREE_TYPE (dest))
1753 && comp_types (TREE_TYPE (dest), type)
1754 && !VOID_TYPE_P (TREE_TYPE (type)))
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)));
1767 if (!TYPE_P (sizeof_arg[idx])
1768 && operand_equal_p (src, sizeof_arg[idx], 0)
1769 && comp_types (TREE_TYPE (src), type))
1771 if (TREE_CODE (sizeof_arg[idx]) == ADDR_EXPR && !strop)
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))
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);
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);
1791 if (POINTER_TYPE_P (TREE_TYPE (src))
1793 && comp_types (TREE_TYPE (src), type)
1794 && !VOID_TYPE_P (TREE_TYPE (type)))
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)));
1807 if (!TYPE_P (sizeof_arg[idx])
1808 && operand_equal_p (dest, sizeof_arg[idx], 0)
1809 && comp_types (TREE_TYPE (dest), type))
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))
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);
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);
1831 if (POINTER_TYPE_P (TREE_TYPE (dest))
1833 && comp_types (TREE_TYPE (dest), type)
1834 && !VOID_TYPE_P (TREE_TYPE (type)))
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)));
1847 if (!TYPE_P (sizeof_arg[idx])
1848 && operand_equal_p (src, sizeof_arg[idx], 0)
1849 && comp_types (TREE_TYPE (src), type))
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))
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);
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);
1871 if (POINTER_TYPE_P (TREE_TYPE (src))
1873 && comp_types (TREE_TYPE (src), type)
1874 && !VOID_TYPE_P (TREE_TYPE (type)))
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)));
1887 /* Warn for unlikely, improbable, or stupid DECL declarations
1891 check_main_parameter_types (tree decl)
1893 function_args_iterator iter;
1897 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl), type, iter)
1899 /* XXX void_type_node belies the abstraction. */
1900 if (type == void_type_node || type == error_mark_node )
1904 if (TYPE_ATOMIC (t))
1905 pedwarn (input_location, OPT_Wmain,
1906 "%<_Atomic%>-qualified parameter type %qT of %q+D",
1908 while (POINTER_TYPE_P (t))
1911 if (TYPE_ATOMIC (t))
1912 pedwarn (input_location, OPT_Wmain,
1913 "%<_Atomic%>-qualified parameter type %qT of %q+D",
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);
1927 if (TREE_CODE (type) != POINTER_TYPE
1928 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1929 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1931 pedwarn (input_location, OPT_Wmain,
1932 "second argument of %q+D should be %<char **%>", decl);
1936 if (TREE_CODE (type) != POINTER_TYPE
1937 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1938 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1940 pedwarn (input_location, OPT_Wmain,
1941 "third argument of %q+D should probably be "
1942 "%<char **%>", decl);
1947 /* It is intentional that this message does not mention the third
1948 argument because it's only mentioned in an appendix of the
1950 if (argct > 0 && (argct < 2 || argct > 3))
1951 pedwarn (input_location, OPT_Wmain,
1952 "%q+D takes only zero or two arguments", decl);
1954 if (stdarg_p (TREE_TYPE (decl)))
1955 pedwarn (input_location, OPT_Wmain,
1956 "%q+D declared as variadic function", decl);
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. */
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
1971 vector_targets_convertible_p (const_tree t1, const_tree t2)
1973 if (VECTOR_TYPE_P (t1) && VECTOR_TYPE_P (t2)
1974 && (TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
1975 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
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
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
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. */
1998 vector_types_convertible_p (const_tree t1, const_tree t2, bool emit_lax_note)
2000 static bool emitted_lax_note = false;
2001 bool convertible_lax;
2003 if ((TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2))
2004 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
2008 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
2009 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
2010 TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2))
2011 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
2012 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
2014 if (!convertible_lax || flag_lax_vector_conversions)
2015 return convertible_lax;
2017 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
2018 && lang_hooks.types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
2021 if (emit_lax_note && !emitted_lax_note)
2023 emitted_lax_note = true;
2024 inform (input_location, "use -flax-vector-conversions to permit "
2025 "conversions between vectors with differing "
2026 "element types or numbers of subparts");
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.
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
2043 c_build_vec_perm_expr (location_t loc, tree v0, tree v1, tree mask,
2048 bool maybe_const = false;
2049 bool two_arguments = false;
2051 if (v1 == NULL_TREE)
2053 two_arguments = true;
2057 if (v0 == error_mark_node || v1 == error_mark_node
2058 || mask == error_mark_node)
2059 return error_mark_node;
2061 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask)))
2064 error_at (loc, "__builtin_shuffle last argument must "
2065 "be an integer vector");
2066 return error_mark_node;
2069 if (!VECTOR_TYPE_P (TREE_TYPE (v0))
2070 || !VECTOR_TYPE_P (TREE_TYPE (v1)))
2073 error_at (loc, "__builtin_shuffle arguments must be vectors");
2074 return error_mark_node;
2077 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1)))
2080 error_at (loc, "__builtin_shuffle argument vectors must be of "
2082 return error_mark_node;
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)))
2091 error_at (loc, "__builtin_shuffle number of elements of the "
2092 "argument vector(s) and the mask vector should "
2094 return error_mark_node;
2097 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0))))
2098 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask)))))
2101 error_at (loc, "__builtin_shuffle argument vector(s) inner type "
2102 "must have the same size as inner type of the mask");
2103 return error_mark_node;
2106 if (!c_dialect_cxx ())
2108 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2109 v0 = c_fully_fold (v0, false, &maybe_const);
2110 wrap &= maybe_const;
2113 v1 = v0 = save_expr (v0);
2116 v1 = c_fully_fold (v1, false, &maybe_const);
2117 wrap &= maybe_const;
2120 mask = c_fully_fold (mask, false, &maybe_const);
2121 wrap &= maybe_const;
2123 else if (two_arguments)
2124 v1 = v0 = save_expr (v0);
2126 ret = build3_loc (loc, VEC_PERM_EXPR, TREE_TYPE (v0), v0, v1, mask);
2128 if (!c_dialect_cxx () && !wrap)
2129 ret = c_wrap_maybe_const (ret, true);
2134 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2135 to integral type. */
2138 c_common_get_narrower (tree op, int *unsignedp_ptr)
2140 op = get_narrower (op, unsignedp_ptr);
2142 if (TREE_CODE (TREE_TYPE (op)) == ENUMERAL_TYPE
2143 && ENUM_IS_SCOPED (TREE_TYPE (op)))
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. */
2148 tree type = c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op)),
2149 TYPE_UNSIGNED (TREE_TYPE (op)));
2150 op = fold_convert (type, op);
2155 /* This is a helper function of build_binary_op.
2157 For certain operations if both args were extended from the same
2158 smaller type, do the arithmetic in that type and then extend.
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
2165 but calculated in (unsigned short) it would be (unsigned short)-1.
2168 shorten_binary_op (tree result_type, tree op0, tree op1, bool bitwise)
2170 int unsigned0, unsigned1;
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
2182 (long long int) (unsigned int) signed_char
2184 which get_narrower would narrow down to
2186 (unsigned int) signed char
2188 If we do not cast OP0 first, get_narrower would return
2189 signed_char, which is inconsistent with the case of the
2191 op0 = convert (result_type, op0);
2192 op1 = convert (result_type, op1);
2194 arg0 = c_common_get_narrower (op0, &unsigned0);
2195 arg1 = c_common_get_narrower (op1, &unsigned1);
2197 /* UNS is 1 if the operation to be done is an unsigned one. */
2198 uns = TYPE_UNSIGNED (result_type);
2200 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2201 but it *requires* conversion to FINAL_TYPE. */
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));
2212 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2214 /* For bitwise operations, signedness of nominal type
2215 does not matter. Consider only how operands were extended. */
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. */
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)));
2235 else if (TREE_CODE (arg0) == INTEGER_CST
2236 && (unsigned1 || !uns)
2237 && (TYPE_PRECISION (TREE_TYPE (arg1))
2238 < TYPE_PRECISION (result_type))
2240 = c_common_signed_or_unsigned_type (unsigned1,
2242 && !POINTER_TYPE_P (type)
2243 && int_fits_type_p (arg0, type))
2246 else if (TREE_CODE (arg1) == INTEGER_CST
2247 && (unsigned0 || !uns)
2248 && (TYPE_PRECISION (TREE_TYPE (arg0))
2249 < TYPE_PRECISION (result_type))
2251 = c_common_signed_or_unsigned_type (unsigned0,
2253 && !POINTER_TYPE_P (type)
2254 && int_fits_type_p (arg1, type))
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. */
2264 int_safely_convertible_to_real_p (const_tree from_type, const_tree to_type)
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);
2273 return exact_real_truncate (TYPE_MODE (to_type), &real_low_bound)
2274 && exact_real_truncate (TYPE_MODE (to_type), &real_high_bound);
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:
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,
2281 for EXPR type and TYPE being both integers or both real, or both
2283 * EXPR is not a constant of complex type and TYPE is a real or
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.
2289 Function allows conversions between types of different signedness and
2290 can return SAFE_CONVERSION (zero) in that case. Function can produce
2291 signedness warnings if PRODUCE_WARNS is true.
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
2297 enum conversion_safety
2298 unsafe_conversion_p (location_t loc, tree type, tree expr, bool produce_warns)
2300 enum conversion_safety give_warning = SAFE_CONVERSION; /* is 0 or false */
2301 tree expr_type = TREE_TYPE (expr);
2302 loc = expansion_point_location_if_in_system_header (loc);
2304 if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
2306 /* If type is complex, we are interested in compatibility with
2308 if (TREE_CODE (type) == COMPLEX_TYPE)
2309 type = TREE_TYPE (type);
2311 /* Warn for real constant that is not an exact integer converted
2313 if (TREE_CODE (expr_type) == REAL_TYPE
2314 && TREE_CODE (type) == INTEGER_TYPE)
2316 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (expr_type)))
2317 give_warning = UNSAFE_REAL;
2319 /* Warn for an integer constant that does not fit into integer type. */
2320 else if (TREE_CODE (expr_type) == INTEGER_TYPE
2321 && TREE_CODE (type) == INTEGER_TYPE
2322 && !int_fits_type_p (expr, type))
2324 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)
2325 && tree_int_cst_sgn (expr) < 0)
2328 warning_at (loc, OPT_Wsign_conversion, "negative integer"
2329 " implicitly converted to unsigned type");
2331 else if (!TYPE_UNSIGNED (type) && TYPE_UNSIGNED (expr_type))
2334 warning_at (loc, OPT_Wsign_conversion, "conversion of unsigned"
2335 " constant value to negative integer");
2338 give_warning = UNSAFE_OTHER;
2340 else if (TREE_CODE (type) == REAL_TYPE)
2342 /* Warn for an integer constant that does not fit into real type. */
2343 if (TREE_CODE (expr_type) == INTEGER_TYPE)
2345 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
2346 if (!exact_real_truncate (TYPE_MODE (type), &a))
2347 give_warning = UNSAFE_REAL;
2349 /* Warn for a real constant that does not fit into a smaller
2351 else if (TREE_CODE (expr_type) == REAL_TYPE
2352 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2354 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
2355 if (!exact_real_truncate (TYPE_MODE (type), &a))
2356 give_warning = UNSAFE_REAL;
2361 else if (TREE_CODE (expr) == COMPLEX_CST)
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),
2376 /* Conversion from complex constant with non-zero imaginary part. */
2379 /* Conversion to complex type.
2380 Perform checks for both real and imaginary parts. */
2381 if (TREE_CODE (type) == COMPLEX_TYPE)
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.
2389 int32_t _Complex a = 0x80000000 + 0x80000000i;
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);
2398 /* Merge the results into appropriate single warning. */
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;
2408 give_warning = UNSAFE_OTHER;
2410 /* Warn about conversion from complex to real or integer type. */
2412 give_warning = UNSAFE_IMAGINARY;
2416 /* Checks for remaining case: EXPR is not constant. */
2419 /* Warn for real types converted to integer types. */
2420 if (TREE_CODE (expr_type) == REAL_TYPE
2421 && TREE_CODE (type) == INTEGER_TYPE)
2422 give_warning = UNSAFE_REAL;
2424 else if (TREE_CODE (expr_type) == INTEGER_TYPE
2425 && TREE_CODE (type) == INTEGER_TYPE)
2427 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2428 expr = get_unwidened (expr, 0);
2429 expr_type = TREE_TYPE (expr);
2431 /* Don't warn for short y; short x = ((int)y & 0xff); */
2432 if (TREE_CODE (expr) == BIT_AND_EXPR
2433 || TREE_CODE (expr) == BIT_IOR_EXPR
2434 || TREE_CODE (expr) == BIT_XOR_EXPR)
2436 /* If both args were extended from a shortest type,
2437 use that type if that is safe. */
2438 expr_type = shorten_binary_op (expr_type,
2439 TREE_OPERAND (expr, 0),
2440 TREE_OPERAND (expr, 1),
2443 if (TREE_CODE (expr) == BIT_AND_EXPR)
2445 tree op0 = TREE_OPERAND (expr, 0);
2446 tree op1 = TREE_OPERAND (expr, 1);
2447 bool unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2448 bool unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
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. */
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
2457 && int_fits_type_p (op1, c_common_signed_type (type))
2458 && int_fits_type_p (op1,
2459 c_common_unsigned_type (type))))
2460 return SAFE_CONVERSION;
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
2465 && int_fits_type_p (op0, type))
2466 || (TREE_CODE (op1) == INTEGER_CST
2468 && int_fits_type_p (op1, type)))
2469 return SAFE_CONVERSION;
2472 /* Warn for integer types converted to smaller integer types. */
2473 if (TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2474 give_warning = UNSAFE_OTHER;
2476 /* When they are the same width but different signedness,
2477 then the value may change. */
2478 else if (((TYPE_PRECISION (type) == TYPE_PRECISION (expr_type)
2479 && TYPE_UNSIGNED (expr_type) != TYPE_UNSIGNED (type))
2480 /* Even when converted to a bigger type, if the type is
2481 unsigned but expr is signed, then negative values
2483 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (expr_type)))
2485 warning_at (loc, OPT_Wsign_conversion, "conversion to %qT from %qT "
2486 "may change the sign of the result",
2490 /* Warn for integer types converted to real types if and only if
2491 all the range of values of the integer type cannot be
2492 represented by the real type. */
2493 else if (TREE_CODE (expr_type) == INTEGER_TYPE
2494 && TREE_CODE (type) == REAL_TYPE)
2496 /* Don't warn about char y = 0xff; float x = (int) y; */
2497 expr = get_unwidened (expr, 0);
2498 expr_type = TREE_TYPE (expr);
2500 if (!int_safely_convertible_to_real_p (expr_type, type))
2501 give_warning = UNSAFE_OTHER;
2504 /* Warn for real types converted to smaller real types. */
2505 else if (TREE_CODE (expr_type) == REAL_TYPE
2506 && TREE_CODE (type) == REAL_TYPE
2507 && TYPE_PRECISION (type) < TYPE_PRECISION (expr_type))
2508 give_warning = UNSAFE_REAL;
2510 /* Check conversion between two complex types. */
2511 else if (TREE_CODE (expr_type) == COMPLEX_TYPE
2512 && TREE_CODE (type) == COMPLEX_TYPE)
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);
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;
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;
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)
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;
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)))
2546 warning_at (loc, OPT_Wsign_conversion,
2547 "conversion to %qT from %qT "
2548 "may change the sign of the result",
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;
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;
2563 return give_warning;
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. */
2570 conversion_warning (location_t loc, tree type, tree expr)
2572 tree expr_type = TREE_TYPE (expr);
2573 enum conversion_safety conversion_kind;
2575 if (!warn_conversion && !warn_sign_conversion && !warn_float_conversion)
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);
2586 switch (TREE_CODE (expr))
2594 case TRUTH_ANDIF_EXPR:
2595 case TRUTH_ORIF_EXPR:
2596 case TRUTH_AND_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);
2611 conversion_kind = unsafe_conversion_p (loc, type, expr, true);
2612 if (conversion_kind == UNSAFE_REAL)
2613 warning_at (loc, OPT_Wfloat_conversion,
2614 "conversion to %qT alters %qT constant value",
2616 else if (conversion_kind)
2617 warning_at (loc, OPT_Wconversion,
2618 "conversion to %qT alters %qT constant value",
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);
2629 conversion_warning (loc, type, op1);
2630 conversion_warning (loc, type, op2);
2634 default: /* 'expr' is not a constant. */
2635 conversion_kind = unsafe_conversion_p (loc, type, expr, true);
2636 if (conversion_kind == UNSAFE_REAL)
2637 warning_at (loc, OPT_Wfloat_conversion,
2638 "conversion to %qT from %qT may alter its value",
2640 else if (conversion_kind == UNSAFE_IMAGINARY)
2641 warning_at (loc, OPT_Wconversion,
2642 "conversion to %qT from %qT discards imaginary component",
2644 else if (conversion_kind)
2645 warning_at (loc, OPT_Wconversion,
2646 "conversion to %qT from %qT may alter its value",
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. */
2656 warnings_for_convert_and_check (location_t loc, tree type, tree expr,
2659 loc = expansion_point_location_if_in_system_header (loc);
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))
2666 /* Do not diagnose overflow in a constant expression merely
2667 because a conversion overflowed. */
2668 if (TREE_OVERFLOW (result))
2669 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
2671 if (TYPE_UNSIGNED (type))
2673 /* This detects cases like converting -129 or 256 to
2675 if (!int_fits_type_p (expr, c_common_signed_type (type)))
2676 warning_at (loc, OPT_Woverflow,
2677 "large integer implicitly truncated to unsigned type");
2679 conversion_warning (loc, type, expr);
2681 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
2682 warning_at (loc, OPT_Woverflow,
2683 "overflow in implicit constant conversion");
2684 /* No warning for converting 0x80000000 to int. */
2686 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
2687 || TYPE_PRECISION (TREE_TYPE (expr))
2688 != TYPE_PRECISION (type)))
2689 warning_at (loc, OPT_Woverflow,
2690 "overflow in implicit constant conversion");
2693 conversion_warning (loc, type, expr);
2695 else if ((TREE_CODE (result) == INTEGER_CST
2696 || TREE_CODE (result) == FIXED_CST) && TREE_OVERFLOW (result))
2697 warning_at (loc, OPT_Woverflow,
2698 "overflow in implicit constant conversion");
2700 conversion_warning (loc, type, expr);
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. */
2709 convert_and_check (location_t loc, tree type, tree expr)
2712 tree expr_for_warning;
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)
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;
2726 expr_for_warning = expr;
2728 if (TREE_TYPE (expr) == type)
2731 result = convert (type, expr);
2733 if (c_inhibit_evaluation_warnings == 0
2734 && !TREE_OVERFLOW_P (expr)
2735 && result != error_mark_node)
2736 warnings_for_convert_and_check (loc, type, expr_for_warning, result);
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. */
2750 /* Used to implement a cache the results of a call to verify_tree. We only
2751 use this for SAVE_EXPRs. */
2754 struct tlist_cache *next;
2755 struct tlist *cache_before_sp;
2756 struct tlist *cache_after_sp;
2760 /* Obstack to use when allocating tlist structures, and corresponding
2762 static struct obstack tlist_obstack;
2763 static char *tlist_firstobj = 0;
2765 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2767 static struct tlist *warned_ids;
2768 /* SAVE_EXPRs need special treatment. We process them only once and then
2769 cache the results. */
2770 static struct tlist_cache *save_expr_cache;
2772 static void add_tlist (struct tlist **, struct tlist *, tree, int);
2773 static void merge_tlist (struct tlist **, struct tlist *, int);
2774 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
2775 static int warning_candidate_p (tree);
2776 static bool candidate_equal_p (const_tree, const_tree);
2777 static void warn_for_collisions (struct tlist *);
2778 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
2779 static struct tlist *new_tlist (struct tlist *, tree, tree);
2781 /* Create a new struct tlist and fill in its fields. */
2782 static struct tlist *
2783 new_tlist (struct tlist *next, tree t, tree writer)
2786 l = XOBNEW (&tlist_obstack, struct tlist);
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. */
2797 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
2801 struct tlist *next = add->next;
2804 if (!exclude_writer || !candidate_equal_p (add->writer, exclude_writer))
2805 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
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
2817 merge_tlist (struct tlist **to, struct tlist *add, int copy)
2819 struct tlist **end = to;
2822 end = &(*end)->next;
2828 struct tlist *next = add->next;
2830 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
2831 if (candidate_equal_p (tmp2->expr, add->expr))
2835 tmp2->writer = add->writer;
2839 *end = copy ? new_tlist (NULL, add->expr, add->writer) : add;
2840 end = &(*end)->next;
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
2852 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
2857 /* Avoid duplicate warnings. */
2858 for (tmp = warned_ids; tmp; tmp = tmp->next)
2859 if (candidate_equal_p (tmp->expr, written))
2864 if (candidate_equal_p (list->expr, written)
2865 && !candidate_equal_p (list->writer, writer)
2866 && (!only_writes || list->writer))
2868 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
2869 warning_at (EXPR_LOC_OR_LOC (writer, input_location),
2870 OPT_Wsequence_point, "operation on %qE may be undefined",
2877 /* Given a list LIST of references to variables, find whether any of these
2878 can cause conflicts due to missing sequence points. */
2881 warn_for_collisions (struct tlist *list)
2885 for (tmp = list; tmp; tmp = tmp->next)
2888 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
2892 /* Return nonzero if X is a tree that can be verified by the sequence point
2895 warning_candidate_p (tree x)
2897 if (DECL_P (x) && DECL_ARTIFICIAL (x))
2900 if (TREE_CODE (x) == BLOCK)
2903 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2904 (lvalue_p) crash on TRY/CATCH. */
2905 if (TREE_TYPE (x) == NULL_TREE || VOID_TYPE_P (TREE_TYPE (x)))
2911 /* No point to track non-const calls, they will never satisfy
2913 if (TREE_CODE (x) == CALL_EXPR && (call_expr_flags (x) & ECF_CONST) == 0)
2916 if (TREE_CODE (x) == STRING_CST)
2922 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2924 candidate_equal_p (const_tree x, const_tree y)
2926 return (x == y) || (x && y && operand_equal_p (x, y, 0));
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
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.
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.
2946 A note on merging. If we modify the former example so that our expression
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. */
2955 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
2958 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
2959 enum tree_code code;
2960 enum tree_code_class cl;
2962 /* X may be NULL if it is the operand of an empty statement expression
2968 code = TREE_CODE (x);
2969 cl = TREE_CODE_CLASS (code);
2971 if (warning_candidate_p (x))
2972 *pno_sp = new_tlist (*pno_sp, x, writer);
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);
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);
2997 merge_tlist (pbefore_sp, tmp_list2, 0);
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);
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);
3014 case PREDECREMENT_EXPR:
3015 case PREINCREMENT_EXPR:
3016 case POSTDECREMENT_EXPR:
3017 case POSTINCREMENT_EXPR:
3018 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
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:
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
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
3039 add_tlist (pno_sp, tmp_list3, x, 0);
3040 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
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);
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. */
3053 call_expr_arg_iterator iter;
3055 tmp_before = tmp_nosp = 0;
3056 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
3057 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
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);
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);
3071 /* Scan all the list, e.g. indices of multi dimensional array. */
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);
3084 struct tlist_cache *t;
3085 for (t = save_expr_cache; t; t = t->next)
3086 if (candidate_equal_p (t->expr, x))
3091 t = XOBNEW (&tlist_obstack, struct tlist_cache);
3092 t->next = save_expr_cache;
3094 save_expr_cache = t;
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);
3101 merge_tlist (&tmp_list3, tmp_nosp, 0);
3102 t->cache_before_sp = tmp_before;
3103 t->cache_after_sp = tmp_list3;
3105 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
3106 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
3111 x = TREE_OPERAND (x, 0);
3118 /* For other expressions, simply recurse on their operands.
3119 Manual tail recursion for unary expressions.
3120 Other non-expressions need not be processed. */
3121 if (cl == tcc_unary)
3123 x = TREE_OPERAND (x, 0);
3127 else if (IS_EXPR_CODE_CLASS (cl))
3130 int max = TREE_OPERAND_LENGTH (x);
3131 for (lp = 0; lp < max; lp++)
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);
3143 /* Try to warn for undefined behavior in EXPR due to missing sequence
3147 verify_sequence_points (tree expr)
3149 struct tlist *before_sp = 0, *after_sp = 0;
3152 save_expr_cache = 0;
3153 if (tlist_firstobj == 0)
3155 gcc_obstack_init (&tlist_obstack);
3156 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
3159 verify_tree (expr, &before_sp, &after_sp, 0);
3160 warn_for_collisions (after_sp);
3161 obstack_free (&tlist_obstack, tlist_firstobj);
3164 /* Validate the expression after `case' and apply default promotions. */
3167 check_case_value (location_t loc, tree value)
3169 if (value == NULL_TREE)
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)
3177 error_at (loc, "case label does not reduce to an integer constant");
3178 value = error_mark_node;
3181 constant_expression_warning (value);
3186 /* See if the case values LOW and HIGH are in the range of the original
3187 type (i.e. before the default conversion to int) of the switch testing
3189 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3190 the type before promoting it. CASE_LOW_P is a pointer to the lower
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
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.
3196 Returns true if the case label is in range of ORIG_TYPE (saturated or
3197 untouched) or false if the label is out of range. */
3200 check_case_bounds (location_t loc, tree type, tree orig_type,
3201 tree *case_low_p, tree *case_high_p,
3202 bool *outside_range_p)
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;
3208 /* If there was a problem with the original type, do nothing. */
3209 if (orig_type == error_mark_node)
3212 min_value = TYPE_MIN_VALUE (orig_type);
3213 max_value = TYPE_MAX_VALUE (orig_type);
3215 /* We'll really need integer constants here. */
3216 case_low = fold (case_low);
3217 case_high = fold (case_high);
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)
3223 warning_at (loc, 0, "case label value is less than minimum value "
3225 *outside_range_p = true;
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)
3233 warning_at (loc, 0, "case label value exceeds maximum value for type");
3234 *outside_range_p = true;
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)
3242 warning_at (loc, 0, "lower value in case label range"
3243 " less than minimum value for type");
3244 *outside_range_p = true;
3245 case_low = min_value;
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)
3252 warning_at (loc, 0, "upper value in case label range"
3253 " exceeds maximum value for type");
3254 *outside_range_p = true;
3255 case_high = max_value;
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);
3266 /* Return an integer type with BITS bits of precision,
3267 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3270 c_common_type_for_size (unsigned int bits, int unsignedp)
3274 if (bits == TYPE_PRECISION (integer_type_node))
3275 return unsignedp ? unsigned_type_node : integer_type_node;
3277 if (bits == TYPE_PRECISION (signed_char_type_node))
3278 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3280 if (bits == TYPE_PRECISION (short_integer_type_node))
3281 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3283 if (bits == TYPE_PRECISION (long_integer_type_node))
3284 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3286 if (bits == TYPE_PRECISION (long_long_integer_type_node))
3287 return (unsignedp ? long_long_unsigned_type_node
3288 : long_long_integer_type_node);
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);
3296 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
3297 return (unsignedp ? widest_unsigned_literal_type_node
3298 : widest_integer_literal_type_node);
3300 if (bits <= TYPE_PRECISION (intQI_type_node))
3301 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3303 if (bits <= TYPE_PRECISION (intHI_type_node))
3304 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3306 if (bits <= TYPE_PRECISION (intSI_type_node))
3307 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3309 if (bits <= TYPE_PRECISION (intDI_type_node))
3310 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
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. */
3320 c_common_fixed_point_type_for_size (unsigned int ibit, unsigned int fbit,
3321 int unsignedp, int satp)
3325 mode = unsignedp ? UQQmode : QQmode;
3327 mode = unsignedp ? UHAmode : HAmode;
3329 for (; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
3330 if (GET_MODE_IBIT (mode) >= ibit && GET_MODE_FBIT (mode) >= fbit)
3333 if (mode == VOIDmode || !targetm.scalar_mode_supported_p (mode))
3335 sorry ("GCC cannot support operators with integer types and "
3336 "fixed-point types that have too many integral and "
3337 "fractional bits together");
3341 return c_common_type_for_mode (mode, satp);
3344 /* Used for communication between c_common_type_for_mode and
3345 c_register_builtin_type. */
3346 tree registered_builtin_types;
3348 /* Return a data type that has machine mode MODE.
3349 If the mode is an integer,
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. */
3355 c_common_type_for_mode (machine_mode mode, int unsignedp)
3360 if (mode == TYPE_MODE (integer_type_node))
3361 return unsignedp ? unsigned_type_node : integer_type_node;
3363 if (mode == TYPE_MODE (signed_char_type_node))
3364 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3366 if (mode == TYPE_MODE (short_integer_type_node))
3367 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3369 if (mode == TYPE_MODE (long_integer_type_node))
3370 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3372 if (mode == TYPE_MODE (long_long_integer_type_node))
3373 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
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);
3381 if (mode == TYPE_MODE (widest_integer_literal_type_node))
3382 return unsignedp ? widest_unsigned_literal_type_node
3383 : widest_integer_literal_type_node;
3386 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3389 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3392 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3395 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3397 #if HOST_BITS_PER_WIDE_INT >= 64
3398 if (mode == TYPE_MODE (intTI_type_node))
3399 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3402 if (mode == TYPE_MODE (float_type_node))
3403 return float_type_node;
3405 if (mode == TYPE_MODE (double_type_node))
3406 return double_type_node;
3408 if (mode == TYPE_MODE (long_double_type_node))
3409 return long_double_type_node;
3411 if (mode == TYPE_MODE (void_type_node))
3412 return void_type_node;
3414 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
3416 ? make_unsigned_type (GET_MODE_PRECISION (mode))
3417 : make_signed_type (GET_MODE_PRECISION (mode)));
3419 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
3421 ? make_unsigned_type (GET_MODE_PRECISION (mode))
3422 : make_signed_type (GET_MODE_PRECISION (mode)));
3424 if (COMPLEX_MODE_P (mode))
3426 machine_mode inner_mode;
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;
3436 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
3437 return complex_integer_type_node;
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);
3444 else if (VECTOR_MODE_P (mode))
3446 machine_mode inner_mode = GET_MODE_INNER (mode);
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);
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;
3459 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode))
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;
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;
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;
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;
3508 return unsignedp ? sat_qq_type_node : qq_type_node;
3510 return unsignedp ? sat_hq_type_node : hq_type_node;
3512 return unsignedp ? sat_sq_type_node : sq_type_node;
3514 return unsignedp ? sat_dq_type_node : dq_type_node;
3516 return unsignedp ? sat_tq_type_node : tq_type_node;
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;
3530 return unsignedp ? sat_ha_type_node : ha_type_node;
3532 return unsignedp ? sat_sa_type_node : sa_type_node;
3534 return unsignedp ? sat_da_type_node : da_type_node;
3536 return unsignedp ? sat_ta_type_node : ta_type_node;
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;
3548 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
3549 if (TYPE_MODE (TREE_VALUE (t)) == mode
3550 && !!unsignedp == !!TYPE_UNSIGNED (TREE_VALUE (t)))
3551 return TREE_VALUE (t);
3557 c_common_unsigned_type (tree type)
3559 return c_common_signed_or_unsigned_type (1, type);
3562 /* Return a signed type the same as TYPE in other respects. */
3565 c_common_signed_type (tree type)
3567 return c_common_signed_or_unsigned_type (0, type);
3570 /* Return a type the same as TYPE except unsigned or
3571 signed according to UNSIGNEDP. */
3574 c_common_signed_or_unsigned_type (int unsignedp, tree type)
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) */
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;
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);
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;
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;
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;
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;
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;
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;
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);
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);
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. */
3700 if (!INTEGRAL_TYPE_P (type)
3701 || TYPE_UNSIGNED (type) == unsignedp)
3704 #define TYPE_OK(node) \
3705 (TYPE_MODE (type) == TYPE_MODE (node) \
3706 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3707 if (TYPE_OK (signed_char_type_node))
3708 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
3709 if (TYPE_OK (integer_type_node))
3710 return unsignedp ? unsigned_type_node : integer_type_node;
3711 if (TYPE_OK (short_integer_type_node))
3712 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
3713 if (TYPE_OK (long_integer_type_node))
3714 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
3715 if (TYPE_OK (long_long_integer_type_node))
3716 return (unsignedp ? long_long_unsigned_type_node
3717 : long_long_integer_type_node);
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);
3726 if (TYPE_OK (widest_integer_literal_type_node))
3727 return (unsignedp ? widest_unsigned_literal_type_node
3728 : widest_integer_literal_type_node);
3730 #if HOST_BITS_PER_WIDE_INT >= 64
3731 if (TYPE_OK (intTI_type_node))
3732 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
3734 if (TYPE_OK (intDI_type_node))
3735 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
3736 if (TYPE_OK (intSI_type_node))
3737 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
3738 if (TYPE_OK (intHI_type_node))
3739 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
3740 if (TYPE_OK (intQI_type_node))
3741 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
3744 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
3747 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3750 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
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
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);
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);
3776 return build_nonstandard_integer_type (width, unsignedp);
3779 /* The C version of the register_builtin_type langhook. */
3782 c_register_builtin_type (tree type, const char* name)
3786 decl = build_decl (UNKNOWN_LOCATION,
3787 TYPE_DECL, get_identifier (name), type);
3788 DECL_ARTIFICIAL (decl) = 1;
3789 if (!TYPE_NAME (type))
3790 TYPE_NAME (type) = decl;
3793 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
3796 /* Print an error message for invalid operands to arith operation
3797 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3798 RICHLOC is a rich location for the message, containing either
3799 three separate locations for each of the operator and operands
3804 (C FE), or one location ranging over all over them
3812 binary_op_error (rich_location *richloc, enum tree_code code,
3813 tree type0, tree type1)
3820 opname = "+"; break;
3822 opname = "-"; break;
3824 opname = "*"; break;
3826 opname = "max"; break;
3828 opname = "min"; break;
3830 opname = "=="; break;
3832 opname = "!="; break;
3834 opname = "<="; break;
3836 opname = ">="; break;
3838 opname = "<"; break;
3840 opname = ">"; break;
3842 opname = "<<"; break;
3844 opname = ">>"; break;
3845 case TRUNC_MOD_EXPR:
3846 case FLOOR_MOD_EXPR:
3847 opname = "%"; break;
3848 case TRUNC_DIV_EXPR:
3849 case FLOOR_DIV_EXPR:
3850 opname = "/"; break;
3852 opname = "&"; break;
3854 opname = "|"; break;
3855 case TRUTH_ANDIF_EXPR:
3856 opname = "&&"; break;
3857 case TRUTH_ORIF_EXPR:
3858 opname = "||"; break;
3860 opname = "^"; break;
3864 error_at_rich_loc (richloc,
3865 "invalid operands to binary %s (have %qT and %qT)",
3866 opname, type0, type1);
3869 /* Given an expression as a tree, return its original type. Do this
3870 by stripping any conversion that preserves the sign and precision. */
3872 expr_original_type (tree expr)
3874 STRIP_SIGN_NOPS (expr);
3875 return TREE_TYPE (expr);
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.
3881 This function is also responsible for converting the two operands
3882 to the proper common type for comparison.
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.
3888 LOC is the location of the comparison.
3890 If this function returns nonzero, it means that the comparison has
3891 a constant value. What this function returns is an expression for
3895 shorten_compare (location_t loc, tree *op0_ptr, tree *op1_ptr,
3896 tree *restype_ptr, enum tree_code *rescode_ptr)
3899 tree op0 = *op0_ptr;
3900 tree op1 = *op1_ptr;
3901 int unsignedp0, unsignedp1;
3903 tree primop0, primop1;
3904 enum tree_code code = *rescode_ptr;
3906 /* Throw away any conversions to wider types
3907 already present in the operands. */
3909 primop0 = c_common_get_narrower (op0, &unsignedp0);
3910 primop1 = c_common_get_narrower (op1, &unsignedp1);
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)
3918 && TYPE_UNSIGNED (TREE_TYPE (op0)))
3920 if (TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (TREE_TYPE (op1))
3921 && TYPE_PRECISION (TREE_TYPE (op1)) < TYPE_PRECISION (*restype_ptr)
3923 && TYPE_UNSIGNED (TREE_TYPE (op1)))
3926 /* Handle the case that OP0 does not *contain* a conversion
3927 but it *requires* conversion to FINAL_TYPE. */
3929 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
3930 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
3931 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
3932 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
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;
3938 /* If first arg is constant, swap the args (changing operation
3939 so value is preserved), for canonicalization. Don't do this if
3940 the second arg is 0. */
3942 if (TREE_CONSTANT (primop0)
3943 && !integer_zerop (primop1) && !real_zerop (primop1)
3944 && !fixed_zerop (primop1))
3946 std::swap (primop0, primop1);
3947 std::swap (op0, op1);
3950 std::swap (unsignedp0, unsignedp1);
3951 std::swap (real1, real2);
3970 *rescode_ptr = code;
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.
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. */
3990 if (!real1 && !real2
3991 && TREE_CODE (TREE_TYPE (primop0)) != FIXED_POINT_TYPE
3992 && TREE_CODE (primop1) == INTEGER_CST
3993 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
3995 int min_gt, max_gt, min_lt, max_lt;
3996 tree maxval, minval;
3997 /* 1 if comparison is nominally unsigned. */
3998 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
4001 type = c_common_signed_or_unsigned_type (unsignedp0,
4002 TREE_TYPE (primop0));
4004 maxval = TYPE_MAX_VALUE (type);
4005 minval = TYPE_MIN_VALUE (type);
4007 if (unsignedp && !unsignedp0)
4008 *restype_ptr = c_common_signed_type (*restype_ptr);
4010 if (TREE_TYPE (primop1) != *restype_ptr)
4012 /* Convert primop1 to target type, but do not introduce
4013 additional overflow. We know primop1 is an int_cst. */
4014 primop1 = force_fit_type (*restype_ptr,
4017 TYPE_PRECISION (*restype_ptr)),
4018 0, TREE_OVERFLOW (primop1));
4020 if (type != *restype_ptr)
4022 minval = convert (*restype_ptr, minval);
4023 maxval = convert (*restype_ptr, maxval);
4026 min_gt = tree_int_cst_lt (primop1, minval);
4027 max_gt = tree_int_cst_lt (primop1, maxval);
4028 min_lt = tree_int_cst_lt (minval, primop1);
4029 max_lt = tree_int_cst_lt (maxval, primop1);
4032 /* This used to be a switch, but Genix compiler can't handle that. */
4033 if (code == NE_EXPR)
4035 if (max_lt || min_gt)
4036 val = truthvalue_true_node;
4038 else if (code == EQ_EXPR)
4040 if (max_lt || min_gt)
4041 val = truthvalue_false_node;
4043 else if (code == LT_EXPR)
4046 val = truthvalue_true_node;
4048 val = truthvalue_false_node;
4050 else if (code == GT_EXPR)
4053 val = truthvalue_true_node;
4055 val = truthvalue_false_node;
4057 else if (code == LE_EXPR)
4060 val = truthvalue_true_node;
4062 val = truthvalue_false_node;
4064 else if (code == GE_EXPR)
4067 val = truthvalue_true_node;
4069 val = truthvalue_false_node;
4072 /* If primop0 was sign-extended and unsigned comparison specd,
4073 we did a signed comparison above using the signed type bounds.
4074 But the comparison we output must be unsigned.
4076 Also, for inequalities, VAL is no good; but if the signed
4077 comparison had *any* fixed result, it follows that the
4078 unsigned comparison just tests the sign in reverse
4079 (positive values are LE, negative ones GE).
4080 So we can generate an unsigned comparison
4081 against an extreme value of the signed type. */
4083 if (unsignedp && !unsignedp0)
4090 primop1 = TYPE_MIN_VALUE (type);
4096 primop1 = TYPE_MAX_VALUE (type);
4103 type = c_common_unsigned_type (type);
4106 if (TREE_CODE (primop0) != INTEGER_CST
4107 /* Don't warn if it's from a (non-system) macro. */
4108 && !(from_macro_expansion_at
4109 (expansion_point_location_if_in_system_header
4110 (EXPR_LOCATION (primop0)))))
4112 if (val == truthvalue_false_node)
4113 warning_at (loc, OPT_Wtype_limits,
4114 "comparison is always false due to limited range of data type");
4115 if (val == truthvalue_true_node)
4116 warning_at (loc, OPT_Wtype_limits,
4117 "comparison is always true due to limited range of data type");
4122 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4123 if (TREE_SIDE_EFFECTS (primop0))
4124 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
4128 /* Value is not predetermined, but do the comparison
4129 in the type of the operand that is not constant.
4130 TYPE is already properly set. */
4133 /* If either arg is decimal float and the other is float, find the
4134 proper common type to use for comparison. */
4135 else if (real1 && real2
4136 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
4137 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1))))
4138 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
4140 /* If either arg is decimal float and the other is float, fail. */
4141 else if (real1 && real2
4142 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
4143 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
4146 else if (real1 && real2
4147 && (TYPE_PRECISION (TREE_TYPE (primop0))
4148 == TYPE_PRECISION (TREE_TYPE (primop1))))
4149 type = TREE_TYPE (primop0);
4151 /* If args' natural types are both narrower than nominal type
4152 and both extend in the same manner, compare them
4153 in the type of the wider arg.
4154 Otherwise must actually extend both to the nominal
4155 common type lest different ways of extending
4157 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4159 else if (unsignedp0 == unsignedp1 && real1 == real2
4160 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
4161 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
4163 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
4164 type = c_common_signed_or_unsigned_type (unsignedp0
4165 || TYPE_UNSIGNED (*restype_ptr),
4167 /* Make sure shorter operand is extended the right way
4168 to match the longer operand. */
4170 = convert (c_common_signed_or_unsigned_type (unsignedp0,
4171 TREE_TYPE (primop0)),
4174 = convert (c_common_signed_or_unsigned_type (unsignedp1,
4175 TREE_TYPE (primop1)),
4180 /* Here we must do the comparison on the nominal type
4181 using the args exactly as we received them. */
4182 type = *restype_ptr;
4186 if (!real1 && !real2 && integer_zerop (primop1)
4187 && TYPE_UNSIGNED (*restype_ptr))
4190 /* All unsigned values are >= 0, so we warn. However,
4191 if OP0 is a constant that is >= 0, the signedness of
4192 the comparison isn't an issue, so suppress the
4195 warn_type_limits && !in_system_header_at (loc)
4196 && !(TREE_CODE (primop0) == INTEGER_CST
4197 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
4199 /* Do not warn for enumeration types. */
4200 && (TREE_CODE (expr_original_type (primop0)) != ENUMERAL_TYPE);
4206 warning_at (loc, OPT_Wtype_limits,
4207 "comparison of unsigned expression >= 0 is always true");
4208 value = truthvalue_true_node;
4213 warning_at (loc, OPT_Wtype_limits,
4214 "comparison of unsigned expression < 0 is always false");
4215 value = truthvalue_false_node;
4224 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4225 if (TREE_SIDE_EFFECTS (primop0))
4226 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
4233 *op0_ptr = convert (type, primop0);
4234 *op1_ptr = convert (type, primop1);
4236 *restype_ptr = truthvalue_type_node;
4241 /* Return a tree for the sum or difference (RESULTCODE says which)
4242 of pointer PTROP and integer INTOP. */
4245 pointer_int_sum (location_t loc, enum tree_code resultcode,
4246 tree ptrop, tree intop, bool complain)
4250 /* The result is a pointer of the same type that is being added. */
4251 tree result_type = TREE_TYPE (ptrop);
4253 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
4255 if (complain && warn_pointer_arith)
4256 pedwarn (loc, OPT_Wpointer_arith,
4257 "pointer of type %<void *%> used in arithmetic");
4259 return error_mark_node;
4260 size_exp = integer_one_node;
4262 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
4264 if (complain && warn_pointer_arith)
4265 pedwarn (loc, OPT_Wpointer_arith,
4266 "pointer to a function used in arithmetic");
4268 return error_mark_node;
4269 size_exp = integer_one_node;
4272 size_exp = size_in_bytes_loc (loc, TREE_TYPE (result_type));
4274 /* We are manipulating pointer values, so we don't need to warn
4275 about relying on undefined signed overflow. We disable the
4276 warning here because we use integer types so fold won't know that
4277 they are really pointers. */
4278 fold_defer_overflow_warnings ();
4280 /* If what we are about to multiply by the size of the elements
4281 contains a constant term, apply distributive law
4282 and multiply that constant term separately.
4283 This helps produce common subexpressions. */
4284 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
4285 && !TREE_CONSTANT (intop)
4286 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
4287 && TREE_CONSTANT (size_exp)
4288 /* If the constant comes from pointer subtraction,
4289 skip this optimization--it would cause an error. */
4290 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
4291 /* If the constant is unsigned, and smaller than the pointer size,
4292 then we must skip this optimization. This is because it could cause
4293 an overflow error if the constant is negative but INTOP is not. */
4294 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
4295 || (TYPE_PRECISION (TREE_TYPE (intop))
4296 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
4298 enum tree_code subcode = resultcode;
4299 tree int_type = TREE_TYPE (intop);
4300 if (TREE_CODE (intop) == MINUS_EXPR)
4301 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
4302 /* Convert both subexpression types to the type of intop,
4303 because weird cases involving pointer arithmetic
4304 can result in a sum or difference with different type args. */
4305 ptrop = build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop, 1)),
4307 convert (int_type, TREE_OPERAND (intop, 1)), 1);
4308 intop = convert (int_type, TREE_OPERAND (intop, 0));
4311 /* Convert the integer argument to a type the same size as sizetype
4312 so the multiply won't overflow spuriously. */
4313 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
4314 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
4315 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
4316 TYPE_UNSIGNED (sizetype)), intop);
4318 /* Replace the integer argument with a suitable product by the object size.
4319 Do this multiplication as signed, then convert to the appropriate type
4320 for the pointer operation and disregard an overflow that occurred only
4321 because of the sign-extension change in the latter conversion. */
4323 tree t = fold_build2_loc (loc, MULT_EXPR, TREE_TYPE (intop), intop,
4324 convert (TREE_TYPE (intop), size_exp));
4325 intop = convert (sizetype, t);
4326 if (TREE_OVERFLOW_P (intop) && !TREE_OVERFLOW (t))
4327 intop = wide_int_to_tree (TREE_TYPE (intop), intop);
4330 /* Create the sum or difference. */
4331 if (resultcode == MINUS_EXPR)
4332 intop = fold_build1_loc (loc, NEGATE_EXPR, sizetype, intop);
4334 ret = fold_build_pointer_plus_loc (loc, ptrop, intop);
4336 fold_undefer_and_ignore_overflow_warnings ();
4341 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4342 and if NON_CONST is known not to be permitted in an evaluated part
4343 of a constant expression. */
4346 c_wrap_maybe_const (tree expr, bool non_const)
4348 bool nowarning = TREE_NO_WARNING (expr);
4349 location_t loc = EXPR_LOCATION (expr);
4351 /* This should never be called for C++. */
4352 if (c_dialect_cxx ())
4355 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4356 STRIP_TYPE_NOPS (expr);
4357 expr = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL, expr);
4358 C_MAYBE_CONST_EXPR_NON_CONST (expr) = non_const;
4360 TREE_NO_WARNING (expr) = 1;
4361 protected_set_expr_location (expr, loc);
4366 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4367 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4368 around the SAVE_EXPR if needed so that c_fully_fold does not need
4369 to look inside SAVE_EXPRs. */
4372 c_save_expr (tree expr)
4374 bool maybe_const = true;
4375 if (c_dialect_cxx ())
4376 return save_expr (expr);
4377 expr = c_fully_fold (expr, false, &maybe_const);
4378 expr = save_expr (expr);
4380 expr = c_wrap_maybe_const (expr, true);
4384 /* Return whether EXPR is a declaration whose address can never be
4388 decl_with_nonnull_addr_p (const_tree expr)
4390 return (DECL_P (expr)
4391 && (TREE_CODE (expr) == PARM_DECL
4392 || TREE_CODE (expr) == LABEL_DECL
4393 || !DECL_WEAK (expr)));
4396 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4397 or for an `if' or `while' statement or ?..: exp. It should already
4398 have been validated to be of suitable type; otherwise, a bad
4399 diagnostic may result.
4401 The EXPR is located at LOCATION.
4403 This preparation consists of taking the ordinary
4404 representation of an expression expr and producing a valid tree
4405 boolean expression describing whether expr is nonzero. We could
4406 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4407 but we optimize comparisons, &&, ||, and !.
4409 The resulting type should always be `truthvalue_type_node'. */
4412 c_common_truthvalue_conversion (location_t location, tree expr)
4414 switch (TREE_CODE (expr))
4416 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
4417 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
4418 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
4419 case ORDERED_EXPR: case UNORDERED_EXPR:
4420 if (TREE_TYPE (expr) == truthvalue_type_node)
4422 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
4423 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
4426 case TRUTH_ANDIF_EXPR:
4427 case TRUTH_ORIF_EXPR:
4428 case TRUTH_AND_EXPR:
4430 case TRUTH_XOR_EXPR:
4431 if (TREE_TYPE (expr) == truthvalue_type_node)
4433 expr = build2 (TREE_CODE (expr), truthvalue_type_node,
4434 c_common_truthvalue_conversion (location,
4435 TREE_OPERAND (expr, 0)),
4436 c_common_truthvalue_conversion (location,
4437 TREE_OPERAND (expr, 1)));
4440 case TRUTH_NOT_EXPR:
4441 if (TREE_TYPE (expr) == truthvalue_type_node)
4443 expr = build1 (TREE_CODE (expr), truthvalue_type_node,
4444 c_common_truthvalue_conversion (location,
4445 TREE_OPERAND (expr, 0)));
4452 return integer_zerop (expr) ? truthvalue_false_node
4453 : truthvalue_true_node;
4456 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
4457 ? truthvalue_true_node
4458 : truthvalue_false_node;
4461 return fixed_compare (NE_EXPR, &TREE_FIXED_CST (expr),
4462 &FCONST0 (TYPE_MODE (TREE_TYPE (expr))))
4463 ? truthvalue_true_node
4464 : truthvalue_false_node;
4467 expr = build_unary_op (location, ADDR_EXPR, expr, 0);
4472 tree inner = TREE_OPERAND (expr, 0);
4473 if (decl_with_nonnull_addr_p (inner))
4475 /* Common Ada/Pascal programmer's mistake. */
4476 warning_at (location,
4478 "the address of %qD will always evaluate as %<true%>",
4480 return truthvalue_true_node;
4486 expr = build_binary_op (EXPR_LOCATION (expr),
4487 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
4488 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
4489 c_common_truthvalue_conversion (location,
4490 TREE_OPERAND (expr, 0)),
4491 c_common_truthvalue_conversion (location,
4492 TREE_OPERAND (expr, 1)),
4499 case EXCESS_PRECISION_EXPR:
4500 /* These don't change whether an object is nonzero or zero. */
4501 return c_common_truthvalue_conversion (location, TREE_OPERAND (expr, 0));
4505 /* These don't change whether an object is zero or nonzero, but
4506 we can't ignore them if their second arg has side-effects. */
4507 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
4509 expr = build2 (COMPOUND_EXPR, truthvalue_type_node,
4510 TREE_OPERAND (expr, 1),
4511 c_common_truthvalue_conversion
4512 (location, TREE_OPERAND (expr, 0)));
4516 return c_common_truthvalue_conversion (location,
4517 TREE_OPERAND (expr, 0));
4520 /* Distribute the conversion into the arms of a COND_EXPR. */
4521 if (c_dialect_cxx ())
4523 tree op1 = TREE_OPERAND (expr, 1);
4524 tree op2 = TREE_OPERAND (expr, 2);
4525 /* In C++ one of the arms might have void type if it is throw. */
4526 if (!VOID_TYPE_P (TREE_TYPE (op1)))
4527 op1 = c_common_truthvalue_conversion (location, op1);
4528 if (!VOID_TYPE_P (TREE_TYPE (op2)))
4529 op2 = c_common_truthvalue_conversion (location, op2);
4530 expr = fold_build3_loc (location, COND_EXPR, truthvalue_type_node,
4531 TREE_OPERAND (expr, 0), op1, op2);
4536 /* Folding will happen later for C. */
4537 expr = build3 (COND_EXPR, truthvalue_type_node,
4538 TREE_OPERAND (expr, 0),
4539 c_common_truthvalue_conversion (location,
4540 TREE_OPERAND (expr, 1)),
4541 c_common_truthvalue_conversion (location,
4542 TREE_OPERAND (expr, 2)));
4548 tree totype = TREE_TYPE (expr);
4549 tree fromtype = TREE_TYPE (TREE_OPERAND (expr, 0));
4551 if (POINTER_TYPE_P (totype)
4552 && TREE_CODE (fromtype) == REFERENCE_TYPE)
4558 warning_at (location,
4560 "the compiler can assume that the address of "
4561 "%qD will always evaluate to %<true%>",
4565 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4566 since that affects how `default_conversion' will behave. */
4567 if (TREE_CODE (totype) == REFERENCE_TYPE
4568 || TREE_CODE (fromtype) == REFERENCE_TYPE)
4570 /* Don't strip a conversion from C++0x scoped enum, since they
4571 don't implicitly convert to other types. */
4572 if (TREE_CODE (fromtype) == ENUMERAL_TYPE
4573 && ENUM_IS_SCOPED (fromtype))
4575 /* If this isn't narrowing the argument, we can ignore it. */
4576 if (TYPE_PRECISION (totype) >= TYPE_PRECISION (fromtype))
4577 return c_common_truthvalue_conversion (location,
4578 TREE_OPERAND (expr, 0));
4583 if (!TREE_NO_WARNING (expr)
4584 && warn_parentheses)
4586 warning (OPT_Wparentheses,
4587 "suggest parentheses around assignment used as truth value");
4588 TREE_NO_WARNING (expr) = 1;
4596 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
4598 tree t = (in_late_binary_op ? save_expr (expr) : c_save_expr (expr));
4599 expr = (build_binary_op
4600 (EXPR_LOCATION (expr),
4601 (TREE_SIDE_EFFECTS (expr)
4602 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
4603 c_common_truthvalue_conversion
4605 build_unary_op (location, REALPART_EXPR, t, 0)),
4606 c_common_truthvalue_conversion
4608 build_unary_op (location, IMAGPART_EXPR, t, 0)),
4613 if (TREE_CODE (TREE_TYPE (expr)) == FIXED_POINT_TYPE)
4615 tree fixed_zero_node = build_fixed (TREE_TYPE (expr),
4617 (TREE_TYPE (expr))));
4618 return build_binary_op (location, NE_EXPR, expr, fixed_zero_node, 1);
4621 return build_binary_op (location, NE_EXPR, expr, integer_zero_node, 1);
4624 protected_set_expr_location (expr, location);
4628 static void def_builtin_1 (enum built_in_function fncode,
4630 enum built_in_class fnclass,
4631 tree fntype, tree libtype,
4632 bool both_p, bool fallback_p, bool nonansi_p,
4633 tree fnattrs, bool implicit_p);
4636 /* Apply the TYPE_QUALS to the new DECL. */
4639 c_apply_type_quals_to_decl (int type_quals, tree decl)
4641 tree type = TREE_TYPE (decl);
4643 if (type == error_mark_node)
4646 if ((type_quals & TYPE_QUAL_CONST)
4647 || (type && TREE_CODE (type) == REFERENCE_TYPE))
4648 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4649 constructor can produce constant init, so rely on cp_finish_decl to
4650 clear TREE_READONLY if the variable has non-constant init. */
4651 TREE_READONLY (decl) = 1;
4652 if (type_quals & TYPE_QUAL_VOLATILE)
4654 TREE_SIDE_EFFECTS (decl) = 1;
4655 TREE_THIS_VOLATILE (decl) = 1;
4657 if (type_quals & TYPE_QUAL_RESTRICT)
4659 while (type && TREE_CODE (type) == ARRAY_TYPE)
4660 /* Allow 'restrict' on arrays of pointers.
4661 FIXME currently we just ignore it. */
4662 type = TREE_TYPE (type);
4664 || !POINTER_TYPE_P (type)
4665 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
4666 error ("invalid use of %<restrict%>");
4670 struct c_type_hasher : ggc_ptr_hash<tree_node>
4672 static hashval_t hash (tree);
4673 static bool equal (tree, tree);
4676 /* Hash function for the problem of multiple type definitions in
4677 different files. This must hash all types that will compare
4678 equal via comptypes to the same value. In practice it hashes
4679 on some of the simple stuff and leaves the details to comptypes. */
4682 c_type_hasher::hash (tree t)
4687 switch (TREE_CODE (t))
4689 /* For pointers, hash on pointee type plus some swizzling. */
4691 return hash (TREE_TYPE (t)) ^ 0x3003003;
4692 /* Hash on number of elements and total size. */
4695 t2 = TYPE_VALUES (t);
4699 t2 = TYPE_FIELDS (t);
4701 case QUAL_UNION_TYPE:
4703 t2 = TYPE_FIELDS (t);
4707 t2 = TYPE_FIELDS (t);
4712 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4713 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4714 n_elements = list_length (t2);
4715 /* We might have a VLA here. */
4716 if (TREE_CODE (TYPE_SIZE (t)) != INTEGER_CST)
4719 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
4720 return ((size << 24) | (n_elements << shift));
4724 c_type_hasher::equal (tree t1, tree t2)
4726 return lang_hooks.types_compatible_p (t1, t2);
4729 static GTY(()) hash_table<c_type_hasher> *type_hash_table;
4731 /* Return the typed-based alias set for T, which may be an expression
4732 or a type. Return -1 if we don't do anything special. */
4735 c_common_get_alias_set (tree t)
4739 /* For VLAs, use the alias set of the element type rather than the
4740 default of alias set 0 for types compared structurally. */
4741 if (TYPE_P (t) && TYPE_STRUCTURAL_EQUALITY_P (t))
4743 if (TREE_CODE (t) == ARRAY_TYPE)
4744 return get_alias_set (TREE_TYPE (t));
4748 /* Permit type-punning when accessing a union, provided the access
4749 is directly through the union. For example, this code does not
4750 permit taking the address of a union member and then storing
4751 through it. Even the type-punning allowed here is a GCC
4752 extension, albeit a common and useful one; the C standard says
4753 that such accesses have implementation-defined behavior. */
4755 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
4756 u = TREE_OPERAND (u, 0))
4757 if (TREE_CODE (u) == COMPONENT_REF
4758 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
4761 /* That's all the expressions we handle specially. */
4765 /* The C standard guarantees that any object may be accessed via an
4766 lvalue that has character type. */
4767 if (t == char_type_node
4768 || t == signed_char_type_node
4769 || t == unsigned_char_type_node)
4772 /* The C standard specifically allows aliasing between signed and
4773 unsigned variants of the same type. We treat the signed
4774 variant as canonical. */
4775 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
4777 tree t1 = c_common_signed_type (t);
4779 /* t1 == t can happen for boolean nodes which are always unsigned. */
4781 return get_alias_set (t1);
4784 /* Handle the case of multiple type nodes referring to "the same" type,
4785 which occurs with IMA. These share an alias set. FIXME: Currently only
4786 C90 is handled. (In C99 type compatibility is not transitive, which
4787 complicates things mightily. The alias set splay trees can theoretically
4788 represent this, but insertion is tricky when you consider all the
4789 different orders things might arrive in.) */
4791 if (c_language != clk_c || flag_isoc99)
4794 /* Save time if there's only one input file. */
4795 if (num_in_fnames == 1)
4798 /* Pointers need special handling if they point to any type that
4799 needs special handling (below). */
4800 if (TREE_CODE (t) == POINTER_TYPE)
4803 /* Find bottom type under any nested POINTERs. */
4804 for (t2 = TREE_TYPE (t);
4805 TREE_CODE (t2) == POINTER_TYPE;
4806 t2 = TREE_TYPE (t2))
4808 if (!RECORD_OR_UNION_TYPE_P (t2)
4809 && TREE_CODE (t2) != ENUMERAL_TYPE)
4811 if (TYPE_SIZE (t2) == 0)
4814 /* These are the only cases that need special handling. */
4815 if (!RECORD_OR_UNION_TYPE_P (t)
4816 && TREE_CODE (t) != ENUMERAL_TYPE
4817 && TREE_CODE (t) != POINTER_TYPE)
4820 if (TYPE_SIZE (t) == 0)
4823 /* Look up t in hash table. Only one of the compatible types within each
4824 alias set is recorded in the table. */
4825 if (!type_hash_table)
4826 type_hash_table = hash_table<c_type_hasher>::create_ggc (1021);
4827 tree *slot = type_hash_table->find_slot (t, INSERT);
4830 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
4831 return TYPE_ALIAS_SET ((tree)*slot);
4834 /* Our caller will assign and record (in t) a new alias set; all we need
4835 to do is remember t in the hash table. */
4841 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4842 the IS_SIZEOF parameter indicates which operator is being applied.
4843 The COMPLAIN flag controls whether we should diagnose possibly
4844 ill-formed constructs or not. LOC is the location of the SIZEOF or
4845 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4846 a type in any context should be returned, rather than the normal
4847 alignment for that type. */
4850 c_sizeof_or_alignof_type (location_t loc,
4851 tree type, bool is_sizeof, bool min_alignof,
4854 const char *op_name;
4856 enum tree_code type_code = TREE_CODE (type);
4858 op_name = is_sizeof ? "sizeof" : "__alignof__";
4860 if (type_code == FUNCTION_TYPE)
4864 if (complain && warn_pointer_arith)
4865 pedwarn (loc, OPT_Wpointer_arith,
4866 "invalid application of %<sizeof%> to a function type");
4868 return error_mark_node;
4869 value = size_one_node;
4875 if (c_dialect_cxx ())
4876 pedwarn (loc, OPT_Wpedantic, "ISO C++ does not permit "
4877 "%<alignof%> applied to a function type");
4879 pedwarn (loc, OPT_Wpedantic, "ISO C does not permit "
4880 "%<_Alignof%> applied to a function type");
4882 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
4885 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
4887 if (type_code == VOID_TYPE
4888 && complain && warn_pointer_arith)
4889 pedwarn (loc, OPT_Wpointer_arith,
4890 "invalid application of %qs to a void type", op_name);
4892 return error_mark_node;
4893 value = size_one_node;
4895 else if (!COMPLETE_TYPE_P (type)
4896 && (!c_dialect_cxx () || is_sizeof || type_code != ARRAY_TYPE))
4899 error_at (loc, "invalid application of %qs to incomplete type %qT",
4901 return error_mark_node;
4903 else if (c_dialect_cxx () && type_code == ARRAY_TYPE
4904 && !COMPLETE_TYPE_P (TREE_TYPE (type)))
4907 error_at (loc, "invalid application of %qs to array type %qT of "
4908 "incomplete element type", op_name, type);
4909 return error_mark_node;
4914 /* Convert in case a char is more than one unit. */
4915 value = size_binop_loc (loc, CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
4916 size_int (TYPE_PRECISION (char_type_node)
4918 else if (min_alignof)
4919 value = size_int (min_align_of_type (type));
4921 value = size_int (TYPE_ALIGN_UNIT (type));
4924 /* VALUE will have the middle-end integer type sizetype.
4925 However, we should really return a value of type `size_t',
4926 which is just a typedef for an ordinary integer type. */
4927 value = fold_convert_loc (loc, size_type_node, value);
4932 /* Implement the __alignof keyword: Return the minimum required
4933 alignment of EXPR, measured in bytes. For VAR_DECLs,
4934 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4935 from an "aligned" __attribute__ specification). LOC is the
4936 location of the ALIGNOF operator. */
4939 c_alignof_expr (location_t loc, tree expr)
4943 if (VAR_OR_FUNCTION_DECL_P (expr))
4944 t = size_int (DECL_ALIGN_UNIT (expr));
4946 else if (TREE_CODE (expr) == COMPONENT_REF
4947 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
4949 error_at (loc, "%<__alignof%> applied to a bit-field");
4952 else if (TREE_CODE (expr) == COMPONENT_REF
4953 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
4954 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
4956 else if (INDIRECT_REF_P (expr))
4958 tree t = TREE_OPERAND (expr, 0);
4960 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4962 while (CONVERT_EXPR_P (t)
4963 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
4967 t = TREE_OPERAND (t, 0);
4968 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
4969 if (thisalign > bestalign)
4970 best = t, bestalign = thisalign;
4972 return c_alignof (loc, TREE_TYPE (TREE_TYPE (best)));
4975 return c_alignof (loc, TREE_TYPE (expr));
4977 return fold_convert_loc (loc, size_type_node, t);
4980 /* Handle C and C++ default attributes. */
4982 enum built_in_attribute
4984 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4985 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4986 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
4987 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4988 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4989 #include "builtin-attrs.def"
4990 #undef DEF_ATTR_NULL_TREE
4992 #undef DEF_ATTR_STRING
4993 #undef DEF_ATTR_IDENT
4994 #undef DEF_ATTR_TREE_LIST
4998 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
5000 static void c_init_attributes (void);
5004 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5005 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5006 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5007 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5008 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5009 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5010 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5011 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5013 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5015 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5016 ARG6, ARG7, ARG8) NAME,
5017 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5018 ARG6, ARG7, ARG8, ARG9) NAME,
5019 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5020 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5021 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5022 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5023 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5024 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5025 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5026 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5027 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5028 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5030 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5032 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5034 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5035 #include "builtin-types.def"
5036 #undef DEF_PRIMITIVE_TYPE
5037 #undef DEF_FUNCTION_TYPE_0
5038 #undef DEF_FUNCTION_TYPE_1
5039 #undef DEF_FUNCTION_TYPE_2
5040 #undef DEF_FUNCTION_TYPE_3
5041 #undef DEF_FUNCTION_TYPE_4
5042 #undef DEF_FUNCTION_TYPE_5
5043 #undef DEF_FUNCTION_TYPE_6
5044 #undef DEF_FUNCTION_TYPE_7
5045 #undef DEF_FUNCTION_TYPE_8
5046 #undef DEF_FUNCTION_TYPE_9
5047 #undef DEF_FUNCTION_TYPE_10
5048 #undef DEF_FUNCTION_TYPE_11
5049 #undef DEF_FUNCTION_TYPE_VAR_0
5050 #undef DEF_FUNCTION_TYPE_VAR_1
5051 #undef DEF_FUNCTION_TYPE_VAR_2
5052 #undef DEF_FUNCTION_TYPE_VAR_3
5053 #undef DEF_FUNCTION_TYPE_VAR_4
5054 #undef DEF_FUNCTION_TYPE_VAR_5
5055 #undef DEF_FUNCTION_TYPE_VAR_6
5056 #undef DEF_FUNCTION_TYPE_VAR_7
5057 #undef DEF_POINTER_TYPE
5061 typedef enum c_builtin_type builtin_type;
5063 /* A temporary array for c_common_nodes_and_builtins. Used in
5064 communication with def_fn_type. */
5065 static tree builtin_types[(int) BT_LAST + 1];
5067 /* A helper function for c_common_nodes_and_builtins. Build function type
5068 for DEF with return type RET and N arguments. If VAR is true, then the
5069 function should be variadic after those N arguments.
5071 Takes special care not to ICE if any of the types involved are
5072 error_mark_node, which indicates that said type is not in fact available
5073 (see builtin_type_for_size). In which case the function type as a whole
5074 should be error_mark_node. */
5077 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
5080 tree *args = XALLOCAVEC (tree, n);
5085 for (i = 0; i < n; ++i)
5087 builtin_type a = (builtin_type) va_arg (list, int);
5088 t = builtin_types[a];
5089 if (t == error_mark_node)
5094 t = builtin_types[ret];
5095 if (t == error_mark_node)
5098 t = build_varargs_function_type_array (t, n, args);
5100 t = build_function_type_array (t, n, args);
5103 builtin_types[def] = t;
5107 /* Build builtin functions common to both C and C++ language
5111 c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
5113 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5114 builtin_types[ENUM] = VALUE;
5115 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5116 def_fn_type (ENUM, RETURN, 0, 0);
5117 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5118 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5119 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5120 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5121 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5122 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5123 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5124 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5125 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5126 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5127 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5129 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5130 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5132 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5133 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5135 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5137 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5138 ARG6, ARG7, ARG8, ARG9) \
5139 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5141 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5142 ARG6, ARG7, ARG8, ARG9, ARG10) \
5143 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5144 ARG7, ARG8, ARG9, ARG10);
5145 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5146 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5147 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5148 ARG7, ARG8, ARG9, ARG10, ARG11);
5149 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5150 def_fn_type (ENUM, RETURN, 1, 0);
5151 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5152 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5153 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5154 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5155 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5156 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5157 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5158 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5159 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5160 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5161 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5163 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5164 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5166 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5167 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5168 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5170 #include "builtin-types.def"
5172 #undef DEF_PRIMITIVE_TYPE
5173 #undef DEF_FUNCTION_TYPE_0
5174 #undef DEF_FUNCTION_TYPE_1
5175 #undef DEF_FUNCTION_TYPE_2
5176 #undef DEF_FUNCTION_TYPE_3
5177 #undef DEF_FUNCTION_TYPE_4
5178 #undef DEF_FUNCTION_TYPE_5
5179 #undef DEF_FUNCTION_TYPE_6
5180 #undef DEF_FUNCTION_TYPE_7
5181 #undef DEF_FUNCTION_TYPE_8
5182 #undef DEF_FUNCTION_TYPE_9
5183 #undef DEF_FUNCTION_TYPE_10
5184 #undef DEF_FUNCTION_TYPE_11
5185 #undef DEF_FUNCTION_TYPE_VAR_0
5186 #undef DEF_FUNCTION_TYPE_VAR_1
5187 #undef DEF_FUNCTION_TYPE_VAR_2
5188 #undef DEF_FUNCTION_TYPE_VAR_3
5189 #undef DEF_FUNCTION_TYPE_VAR_4
5190 #undef DEF_FUNCTION_TYPE_VAR_5
5191 #undef DEF_FUNCTION_TYPE_VAR_6
5192 #undef DEF_FUNCTION_TYPE_VAR_7
5193 #undef DEF_POINTER_TYPE
5194 builtin_types[(int) BT_LAST] = NULL_TREE;
5196 c_init_attributes ();
5198 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5199 NONANSI_P, ATTRS, IMPLICIT, COND) \
5201 def_builtin_1 (ENUM, NAME, CLASS, \
5202 builtin_types[(int) TYPE], \
5203 builtin_types[(int) LIBTYPE], \
5204 BOTH_P, FALLBACK_P, NONANSI_P, \
5205 built_in_attributes[(int) ATTRS], IMPLICIT);
5206 #include "builtins.def"
5208 targetm.init_builtins ();
5210 build_common_builtin_nodes ();
5213 cilk_init_builtins ();
5216 /* Like get_identifier, but avoid warnings about null arguments when
5217 the argument may be NULL for targets where GCC lacks stdint.h type
5221 c_get_ident (const char *id)
5223 return get_identifier (id);
5226 /* Build tree nodes and builtin functions common to both C and C++ language
5230 c_common_nodes_and_builtins (void)
5232 int char16_type_size;
5233 int char32_type_size;
5234 int wchar_type_size;
5235 tree array_domain_type;
5236 tree va_list_ref_type_node;
5237 tree va_list_arg_type_node;
5240 build_common_tree_nodes (flag_signed_char);
5242 /* Define `int' and `char' first so that dbx will output them first. */
5243 record_builtin_type (RID_INT, NULL, integer_type_node);
5244 record_builtin_type (RID_CHAR, "char", char_type_node);
5246 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5247 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5248 but not C. Are the conditionals here needed? */
5249 if (c_dialect_cxx ())
5250 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
5251 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
5252 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
5253 record_builtin_type (RID_MAX, "long unsigned int",
5254 long_unsigned_type_node);
5256 for (i = 0; i < NUM_INT_N_ENTS; i ++)
5260 sprintf (name, "__int%d", int_n_data[i].bitsize);
5261 record_builtin_type ((enum rid)(RID_FIRST_INT_N + i), name,
5262 int_n_trees[i].signed_type);
5263 sprintf (name, "__int%d unsigned", int_n_data[i].bitsize);
5264 record_builtin_type (RID_MAX, name, int_n_trees[i].unsigned_type);
5267 if (c_dialect_cxx ())
5268 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
5269 record_builtin_type (RID_MAX, "long long int",
5270 long_long_integer_type_node);
5271 record_builtin_type (RID_MAX, "long long unsigned int",
5272 long_long_unsigned_type_node);
5273 if (c_dialect_cxx ())
5274 record_builtin_type (RID_MAX, "long long unsigned",
5275 long_long_unsigned_type_node);
5276 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
5277 record_builtin_type (RID_MAX, "short unsigned int",
5278 short_unsigned_type_node);
5279 if (c_dialect_cxx ())
5280 record_builtin_type (RID_MAX, "unsigned short",
5281 short_unsigned_type_node);
5283 /* Define both `signed char' and `unsigned char'. */
5284 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
5285 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
5287 /* These are types that c_common_type_for_size and
5288 c_common_type_for_mode use. */
5289 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5290 TYPE_DECL, NULL_TREE,
5292 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5293 TYPE_DECL, NULL_TREE,
5295 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5296 TYPE_DECL, NULL_TREE,
5298 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5299 TYPE_DECL, NULL_TREE,
5301 #if HOST_BITS_PER_WIDE_INT >= 64
5302 /* Note that this is different than the __int128 type that's part of
5303 the generic __intN support. */
5304 if (targetm.scalar_mode_supported_p (TImode))
5305 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5307 get_identifier ("__int128_t"),
5310 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5311 TYPE_DECL, NULL_TREE,
5312 unsigned_intQI_type_node));
5313 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5314 TYPE_DECL, NULL_TREE,
5315 unsigned_intHI_type_node));
5316 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5317 TYPE_DECL, NULL_TREE,
5318 unsigned_intSI_type_node));
5319 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5320 TYPE_DECL, NULL_TREE,
5321 unsigned_intDI_type_node));
5322 #if HOST_BITS_PER_WIDE_INT >= 64
5323 if (targetm.scalar_mode_supported_p (TImode))
5324 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5326 get_identifier ("__uint128_t"),
5327 unsigned_intTI_type_node));
5330 /* Create the widest literal types. */
5331 widest_integer_literal_type_node
5332 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
5333 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5334 TYPE_DECL, NULL_TREE,
5335 widest_integer_literal_type_node));
5337 widest_unsigned_literal_type_node
5338 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
5339 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5340 TYPE_DECL, NULL_TREE,
5341 widest_unsigned_literal_type_node));
5343 signed_size_type_node = c_common_signed_type (size_type_node);
5346 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
5348 record_builtin_type (RID_FLOAT, NULL, float_type_node);
5349 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
5350 record_builtin_type (RID_MAX, "long double", long_double_type_node);
5352 /* Only supported decimal floating point extension if the target
5353 actually supports underlying modes. */
5354 if (targetm.scalar_mode_supported_p (SDmode)
5355 && targetm.scalar_mode_supported_p (DDmode)
5356 && targetm.scalar_mode_supported_p (TDmode))
5358 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
5359 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
5360 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
5363 if (targetm.fixed_point_supported_p ())
5365 record_builtin_type (RID_MAX, "short _Fract", short_fract_type_node);
5366 record_builtin_type (RID_FRACT, NULL, fract_type_node);
5367 record_builtin_type (RID_MAX, "long _Fract", long_fract_type_node);
5368 record_builtin_type (RID_MAX, "long long _Fract",
5369 long_long_fract_type_node);
5370 record_builtin_type (RID_MAX, "unsigned short _Fract",
5371 unsigned_short_fract_type_node);
5372 record_builtin_type (RID_MAX, "unsigned _Fract",
5373 unsigned_fract_type_node);
5374 record_builtin_type (RID_MAX, "unsigned long _Fract",
5375 unsigned_long_fract_type_node);
5376 record_builtin_type (RID_MAX, "unsigned long long _Fract",
5377 unsigned_long_long_fract_type_node);
5378 record_builtin_type (RID_MAX, "_Sat short _Fract",
5379 sat_short_fract_type_node);
5380 record_builtin_type (RID_MAX, "_Sat _Fract", sat_fract_type_node);
5381 record_builtin_type (RID_MAX, "_Sat long _Fract",
5382 sat_long_fract_type_node);
5383 record_builtin_type (RID_MAX, "_Sat long long _Fract",
5384 sat_long_long_fract_type_node);
5385 record_builtin_type (RID_MAX, "_Sat unsigned short _Fract",
5386 sat_unsigned_short_fract_type_node);
5387 record_builtin_type (RID_MAX, "_Sat unsigned _Fract",
5388 sat_unsigned_fract_type_node);
5389 record_builtin_type (RID_MAX, "_Sat unsigned long _Fract",
5390 sat_unsigned_long_fract_type_node);
5391 record_builtin_type (RID_MAX, "_Sat unsigned long long _Fract",
5392 sat_unsigned_long_long_fract_type_node);
5393 record_builtin_type (RID_MAX, "short _Accum", short_accum_type_node);
5394 record_builtin_type (RID_ACCUM, NULL, accum_type_node);
5395 record_builtin_type (RID_MAX, "long _Accum", long_accum_type_node);
5396 record_builtin_type (RID_MAX, "long long _Accum",
5397 long_long_accum_type_node);
5398 record_builtin_type (RID_MAX, "unsigned short _Accum",
5399 unsigned_short_accum_type_node);
5400 record_builtin_type (RID_MAX, "unsigned _Accum",
5401 unsigned_accum_type_node);
5402 record_builtin_type (RID_MAX, "unsigned long _Accum",
5403 unsigned_long_accum_type_node);
5404 record_builtin_type (RID_MAX, "unsigned long long _Accum",
5405 unsigned_long_long_accum_type_node);
5406 record_builtin_type (RID_MAX, "_Sat short _Accum",
5407 sat_short_accum_type_node);
5408 record_builtin_type (RID_MAX, "_Sat _Accum", sat_accum_type_node);
5409 record_builtin_type (RID_MAX, "_Sat long _Accum",
5410 sat_long_accum_type_node);
5411 record_builtin_type (RID_MAX, "_Sat long long _Accum",
5412 sat_long_long_accum_type_node);
5413 record_builtin_type (RID_MAX, "_Sat unsigned short _Accum",
5414 sat_unsigned_short_accum_type_node);
5415 record_builtin_type (RID_MAX, "_Sat unsigned _Accum",
5416 sat_unsigned_accum_type_node);
5417 record_builtin_type (RID_MAX, "_Sat unsigned long _Accum",
5418 sat_unsigned_long_accum_type_node);
5419 record_builtin_type (RID_MAX, "_Sat unsigned long long _Accum",
5420 sat_unsigned_long_long_accum_type_node);
5424 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5426 get_identifier ("complex int"),
5427 complex_integer_type_node));
5428 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5430 get_identifier ("complex float"),
5431 complex_float_type_node));
5432 lang_hooks.decls.pushdecl (build_decl (UNKNOWN_LOCATION,
5434 get_identifier ("complex double"),
5435 complex_double_type_node));
5436 lang_hooks.decls.pushdecl
5437 (build_decl (UNKNOWN_LOCATION,
5438 TYPE_DECL, get_identifier ("complex long double"),
5439 complex_long_double_type_node));
5441 if (c_dialect_cxx ())
5442 /* For C++, make fileptr_type_node a distinct void * type until
5443 FILE type is defined. */
5444 fileptr_type_node = build_variant_type_copy (ptr_type_node);
5446 record_builtin_type (RID_VOID, NULL, void_type_node);
5448 /* Set the TYPE_NAME for any variants that were built before
5449 record_builtin_type gave names to the built-in types. */
5451 tree void_name = TYPE_NAME (void_type_node);
5452 TYPE_NAME (void_type_node) = NULL_TREE;
5453 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
5455 TYPE_NAME (void_type_node) = void_name;
5458 void_list_node = build_void_list_node ();
5460 /* Make a type to be the domain of a few array types
5461 whose domains don't really matter.
5462 200 is small enough that it always fits in size_t
5463 and large enough that it can hold most function names for the
5464 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5465 array_domain_type = build_index_type (size_int (200));
5467 /* Make a type for arrays of characters.
5468 With luck nothing will ever really depend on the length of this
5470 char_array_type_node
5471 = build_array_type (char_type_node, array_domain_type);
5473 string_type_node = build_pointer_type (char_type_node);
5474 const_string_type_node
5475 = build_pointer_type (build_qualified_type
5476 (char_type_node, TYPE_QUAL_CONST));
5478 /* This is special for C++ so functions can be overloaded. */
5479 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
5480 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
5481 wchar_type_size = TYPE_PRECISION (wchar_type_node);
5482 underlying_wchar_type_node = wchar_type_node;
5483 if (c_dialect_cxx ())
5485 if (TYPE_UNSIGNED (wchar_type_node))
5486 wchar_type_node = make_unsigned_type (wchar_type_size);
5488 wchar_type_node = make_signed_type (wchar_type_size);
5489 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
5492 /* This is for wide string constants. */
5493 wchar_array_type_node
5494 = build_array_type (wchar_type_node, array_domain_type);
5496 /* Define 'char16_t'. */
5497 char16_type_node = get_identifier (CHAR16_TYPE);
5498 char16_type_node = TREE_TYPE (identifier_global_value (char16_type_node));
5499 char16_type_size = TYPE_PRECISION (char16_type_node);
5500 if (c_dialect_cxx ())
5502 char16_type_node = make_unsigned_type (char16_type_size);
5504 if (cxx_dialect >= cxx11)
5505 record_builtin_type (RID_CHAR16, "char16_t", char16_type_node);
5508 /* This is for UTF-16 string constants. */
5509 char16_array_type_node
5510 = build_array_type (char16_type_node, array_domain_type);
5512 /* Define 'char32_t'. */
5513 char32_type_node = get_identifier (CHAR32_TYPE);
5514 char32_type_node = TREE_TYPE (identifier_global_value (char32_type_node));
5515 char32_type_size = TYPE_PRECISION (char32_type_node);
5516 if (c_dialect_cxx ())
5518 char32_type_node = make_unsigned_type (char32_type_size);
5520 if (cxx_dialect >= cxx11)
5521 record_builtin_type (RID_CHAR32, "char32_t", char32_type_node);
5524 /* This is for UTF-32 string constants. */
5525 char32_array_type_node
5526 = build_array_type (char32_type_node, array_domain_type);
5529 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
5532 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
5534 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
5536 if (SIG_ATOMIC_TYPE)
5537 sig_atomic_type_node =
5538 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE)));
5541 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE)));
5544 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE)));
5547 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE)));
5550 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE)));
5553 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE)));
5555 c_uint16_type_node = uint16_type_node =
5556 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE)));
5558 c_uint32_type_node = uint32_type_node =
5559 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE)));
5561 c_uint64_type_node = uint64_type_node =
5562 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE)));
5563 if (INT_LEAST8_TYPE)
5564 int_least8_type_node =
5565 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE)));
5566 if (INT_LEAST16_TYPE)
5567 int_least16_type_node =
5568 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE)));
5569 if (INT_LEAST32_TYPE)
5570 int_least32_type_node =
5571 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE)));
5572 if (INT_LEAST64_TYPE)
5573 int_least64_type_node =
5574 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE)));
5575 if (UINT_LEAST8_TYPE)
5576 uint_least8_type_node =
5577 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE)));
5578 if (UINT_LEAST16_TYPE)
5579 uint_least16_type_node =
5580 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE)));
5581 if (UINT_LEAST32_TYPE)
5582 uint_least32_type_node =
5583 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE)));
5584 if (UINT_LEAST64_TYPE)
5585 uint_least64_type_node =
5586 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE)));
5588 int_fast8_type_node =
5589 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE)));
5590 if (INT_FAST16_TYPE)
5591 int_fast16_type_node =
5592 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE)));
5593 if (INT_FAST32_TYPE)
5594 int_fast32_type_node =
5595 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE)));
5596 if (INT_FAST64_TYPE)
5597 int_fast64_type_node =
5598 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE)));
5599 if (UINT_FAST8_TYPE)
5600 uint_fast8_type_node =
5601 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE)));
5602 if (UINT_FAST16_TYPE)
5603 uint_fast16_type_node =
5604 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE)));
5605 if (UINT_FAST32_TYPE)
5606 uint_fast32_type_node =
5607 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE)));
5608 if (UINT_FAST64_TYPE)
5609 uint_fast64_type_node =
5610 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE)));
5613 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE)));
5616 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE)));
5618 default_function_type
5619 = build_varargs_function_type_list (integer_type_node, NULL_TREE);
5621 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
5622 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
5624 lang_hooks.decls.pushdecl
5625 (build_decl (UNKNOWN_LOCATION,
5626 TYPE_DECL, get_identifier ("__builtin_va_list"),
5627 va_list_type_node));
5628 if (targetm.enum_va_list_p)
5634 for (l = 0; targetm.enum_va_list_p (l, &pname, &ptype); ++l)
5636 lang_hooks.decls.pushdecl
5637 (build_decl (UNKNOWN_LOCATION,
5638 TYPE_DECL, get_identifier (pname),
5644 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
5646 va_list_arg_type_node = va_list_ref_type_node =
5647 build_pointer_type (TREE_TYPE (va_list_type_node));
5651 va_list_arg_type_node = va_list_type_node;
5652 va_list_ref_type_node = build_reference_type (va_list_type_node);
5655 if (!flag_preprocess_only)
5656 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
5658 main_identifier_node = get_identifier ("main");
5660 /* Create the built-in __null node. It is important that this is
5662 null_node = make_int_cst (1, 1);
5663 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
5665 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5666 memset (builtin_types, 0, sizeof (builtin_types));
5669 /* The number of named compound-literals generated thus far. */
5670 static GTY(()) int compound_literal_number;
5672 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5675 set_compound_literal_name (tree decl)
5678 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
5679 compound_literal_number);
5680 compound_literal_number++;
5681 DECL_NAME (decl) = get_identifier (name);
5684 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5685 TYPE and operand OP. */
5688 build_va_arg_1 (location_t loc, tree type, tree op)
5690 tree expr = build1 (VA_ARG_EXPR, type, op);
5691 SET_EXPR_LOCATION (expr, loc);
5695 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5696 va_arg (EXPR, TYPE) at source location LOC. */
5699 build_va_arg (location_t loc, tree expr, tree type)
5701 tree va_type = TREE_TYPE (expr);
5702 tree canon_va_type = (va_type == error_mark_node
5704 : targetm.canonical_va_list_type (va_type));
5706 if (va_type == error_mark_node
5707 || canon_va_type == NULL_TREE)
5709 /* Let's handle things neutrallly, if expr:
5710 - has undeclared type, or
5711 - is not an va_list type. */
5712 return build_va_arg_1 (loc, type, expr);
5715 if (TREE_CODE (canon_va_type) != ARRAY_TYPE)
5717 /* Case 1: Not an array type. */
5719 /* Take the address, to get '&ap'. */
5720 mark_addressable (expr);
5721 expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (expr)), expr);
5723 /* Verify that &ap is still recognized as having va_list type. */
5724 tree canon_expr_type
5725 = targetm.canonical_va_list_type (TREE_TYPE (expr));
5726 if (canon_expr_type == NULL_TREE)
5729 "first argument to %<va_arg%> not of type %<va_list%>");
5730 return error_mark_node;
5733 return build_va_arg_1 (loc, type, expr);
5736 /* Case 2: Array type.
5740 For contrast, let's start with the simple case (case 1). If
5741 canon_va_type is not an array type, but say a char *, then when
5742 passing-by-value a va_list, the type of the va_list param decl is
5743 the same as for another va_list decl (all ap's are char *):
5746 D.1815 = VA_ARG (&ap, 0B, 1);
5752 __builtin_va_start (&ap, 0);
5755 __builtin_va_end (&ap);
5759 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5760 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5761 the same as for another va_list decl (case 2a, struct ap[1]).
5764 D.1844 = VA_ARG (ap, 0B, 0);
5769 __builtin_va_start (&ap, 0);
5771 __builtin_va_end (&ap);
5775 Case 2b is different because:
5776 - on the callee side, the parm decl has declared type va_list, but
5777 grokdeclarator changes the type of the parm decl to a pointer to the
5779 - on the caller side, the pass-by-value uses &ap.
5781 We unify these two cases (case 2a: va_list is array type,
5782 case 2b: va_list is pointer to array elem type), by adding '&' for the
5783 array type case, such that we have a pointer to array elem in both
5786 if (TREE_CODE (va_type) == ARRAY_TYPE)
5788 /* Case 2a: va_list is array type. */
5790 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5792 mark_addressable (expr);
5793 expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (canon_va_type)),
5796 /* Verify that &ap is still recognized as having va_list type. */
5797 tree canon_expr_type
5798 = targetm.canonical_va_list_type (TREE_TYPE (expr));
5799 if (canon_expr_type == NULL_TREE)
5802 "first argument to %<va_arg%> not of type %<va_list%>");
5803 return error_mark_node;
5808 /* Case 2b: va_list is pointer to array elem type. */
5809 gcc_assert (POINTER_TYPE_P (va_type));
5810 gcc_assert (TREE_TYPE (va_type) == TREE_TYPE (canon_va_type));
5812 /* Don't take the address. We've already got '&ap'. */
5816 return build_va_arg_1 (loc, type, expr);
5820 /* Linked list of disabled built-in functions. */
5822 struct disabled_builtin
5825 struct disabled_builtin *next;
5827 static disabled_builtin *disabled_builtins = NULL;
5829 static bool builtin_function_disabled_p (const char *);
5831 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5832 begins with "__builtin_", give an error. */
5835 disable_builtin_function (const char *name)
5837 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
5838 error ("cannot disable built-in function %qs", name);
5841 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
5842 new_disabled_builtin->name = name;
5843 new_disabled_builtin->next = disabled_builtins;
5844 disabled_builtins = new_disabled_builtin;
5849 /* Return true if the built-in function NAME has been disabled, false
5853 builtin_function_disabled_p (const char *name)
5855 disabled_builtin *p;
5856 for (p = disabled_builtins; p != NULL; p = p->next)
5858 if (strcmp (name, p->name) == 0)
5865 /* Worker for DEF_BUILTIN.
5866 Possibly define a builtin function with one or two names.
5867 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5868 nonansi_p and flag_no_nonansi_builtin. */
5871 def_builtin_1 (enum built_in_function fncode,
5873 enum built_in_class fnclass,
5874 tree fntype, tree libtype,
5875 bool both_p, bool fallback_p, bool nonansi_p,
5876 tree fnattrs, bool implicit_p)
5879 const char *libname;
5881 if (fntype == error_mark_node)
5884 gcc_assert ((!both_p && !fallback_p)
5885 || !strncmp (name, "__builtin_",
5886 strlen ("__builtin_")));
5888 libname = name + strlen ("__builtin_");
5889 decl = add_builtin_function (name, fntype, fncode, fnclass,
5890 (fallback_p ? libname : NULL),
5893 set_builtin_decl (fncode, decl, implicit_p);
5896 && !flag_no_builtin && !builtin_function_disabled_p (libname)
5897 && !(nonansi_p && flag_no_nonansi_builtin))
5898 add_builtin_function (libname, libtype, fncode, fnclass,
5902 /* Nonzero if the type T promotes to int. This is (nearly) the
5903 integral promotions defined in ISO C99 6.3.1.1/2. */
5906 c_promoting_integer_type_p (const_tree t)
5908 switch (TREE_CODE (t))
5911 return (TYPE_MAIN_VARIANT (t) == char_type_node
5912 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
5913 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
5914 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
5915 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
5916 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
5919 /* ??? Technically all enumerations not larger than an int
5920 promote to an int. But this is used along code paths
5921 that only want to notice a size change. */
5922 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
5932 /* Return 1 if PARMS specifies a fixed number of parameters
5933 and none of their types is affected by default promotions. */
5936 self_promoting_args_p (const_tree parms)
5939 for (t = parms; t; t = TREE_CHAIN (t))
5941 tree type = TREE_VALUE (t);
5943 if (type == error_mark_node)
5946 if (TREE_CHAIN (t) == 0 && type != void_type_node)
5952 if (TYPE_MAIN_VARIANT (type) == float_type_node)
5955 if (c_promoting_integer_type_p (type))
5961 /* Recursively remove any '*' or '&' operator from TYPE. */
5963 strip_pointer_operator (tree t)
5965 while (POINTER_TYPE_P (t))
5970 /* Recursively remove pointer or array type from TYPE. */
5972 strip_pointer_or_array_types (tree t)
5974 while (TREE_CODE (t) == ARRAY_TYPE || POINTER_TYPE_P (t))
5979 /* Used to compare case labels. K1 and K2 are actually tree nodes
5980 representing case labels, or NULL_TREE for a `default' label.
5981 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5982 K2, and 0 if K1 and K2 are equal. */
5985 case_compare (splay_tree_key k1, splay_tree_key k2)
5987 /* Consider a NULL key (such as arises with a `default' label) to be
5988 smaller than anything else. */
5994 return tree_int_cst_compare ((tree) k1, (tree) k2);
5997 /* Process a case label, located at LOC, for the range LOW_VALUE
5998 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5999 then this case label is actually a `default' label. If only
6000 HIGH_VALUE is NULL_TREE, then case label was declared using the
6001 usual C/C++ syntax, rather than the GNU case range extension.
6002 CASES is a tree containing all the case ranges processed so far;
6003 COND is the condition for the switch-statement itself.
6004 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6005 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6006 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6009 c_add_case_label (location_t loc, splay_tree cases, tree cond, tree orig_type,
6010 tree low_value, tree high_value, bool *outside_range_p)
6015 splay_tree_node node;
6017 /* Create the LABEL_DECL itself. */
6018 label = create_artificial_label (loc);
6020 /* If there was an error processing the switch condition, bail now
6021 before we get more confused. */
6022 if (!cond || cond == error_mark_node)
6025 if ((low_value && TREE_TYPE (low_value)
6026 && POINTER_TYPE_P (TREE_TYPE (low_value)))
6027 || (high_value && TREE_TYPE (high_value)
6028 && POINTER_TYPE_P (TREE_TYPE (high_value))))
6030 error_at (loc, "pointers are not permitted as case values");
6034 /* Case ranges are a GNU extension. */
6036 pedwarn (loc, OPT_Wpedantic,
6037 "range expressions in switch statements are non-standard");
6039 type = TREE_TYPE (cond);
6042 low_value = check_case_value (loc, low_value);
6043 low_value = convert_and_check (loc, type, low_value);
6044 if (low_value == error_mark_node)
6049 high_value = check_case_value (loc, high_value);
6050 high_value = convert_and_check (loc, type, high_value);
6051 if (high_value == error_mark_node)
6055 if (low_value && high_value)
6057 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6058 really a case range, even though it was written that way.
6059 Remove the HIGH_VALUE to simplify later processing. */
6060 if (tree_int_cst_equal (low_value, high_value))
6061 high_value = NULL_TREE;
6062 else if (!tree_int_cst_lt (low_value, high_value))
6063 warning_at (loc, 0, "empty range specified");
6066 /* See if the case is in range of the type of the original testing
6067 expression. If both low_value and high_value are out of range,
6068 don't insert the case label and return NULL_TREE. */
6070 && !check_case_bounds (loc, type, orig_type,
6071 &low_value, high_value ? &high_value : NULL,
6075 /* Look up the LOW_VALUE in the table of case labels we already
6077 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
6078 /* If there was not an exact match, check for overlapping ranges.
6079 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6080 that's a `default' label and the only overlap is an exact match. */
6081 if (!node && (low_value || high_value))
6083 splay_tree_node low_bound;
6084 splay_tree_node high_bound;
6086 /* Even though there wasn't an exact match, there might be an
6087 overlap between this case range and another case range.
6088 Since we've (inductively) not allowed any overlapping case
6089 ranges, we simply need to find the greatest low case label
6090 that is smaller that LOW_VALUE, and the smallest low case
6091 label that is greater than LOW_VALUE. If there is an overlap
6092 it will occur in one of these two ranges. */
6093 low_bound = splay_tree_predecessor (cases,
6094 (splay_tree_key) low_value);
6095 high_bound = splay_tree_successor (cases,
6096 (splay_tree_key) low_value);
6098 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6099 the LOW_VALUE, so there is no need to check unless the
6100 LOW_BOUND is in fact itself a case range. */
6102 && CASE_HIGH ((tree) low_bound->value)
6103 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
6106 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6107 range is bigger than the low end of the current range, so we
6108 are only interested if the current range is a real range, and
6109 not an ordinary case label. */
6112 && (tree_int_cst_compare ((tree) high_bound->key,
6117 /* If there was an overlap, issue an error. */
6120 tree duplicate = CASE_LABEL ((tree) node->value);
6124 error_at (loc, "duplicate (or overlapping) case value");
6125 error_at (DECL_SOURCE_LOCATION (duplicate),
6126 "this is the first entry overlapping that value");
6130 error_at (loc, "duplicate case value") ;
6131 error_at (DECL_SOURCE_LOCATION (duplicate), "previously used here");
6135 error_at (loc, "multiple default labels in one switch");
6136 error_at (DECL_SOURCE_LOCATION (duplicate),
6137 "this is the first default label");
6142 /* Add a CASE_LABEL to the statement-tree. */
6143 case_label = add_stmt (build_case_label (low_value, high_value, label));
6144 /* Register this case label in the splay tree. */
6145 splay_tree_insert (cases,
6146 (splay_tree_key) low_value,
6147 (splay_tree_value) case_label);
6152 /* Add a label so that the back-end doesn't think that the beginning of
6153 the switch is unreachable. Note that we do not add a case label, as
6154 that just leads to duplicates and thence to failure later on. */
6157 tree t = create_artificial_label (loc);
6158 add_stmt (build_stmt (loc, LABEL_EXPR, t));
6160 return error_mark_node;
6163 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6164 Used to verify that case values match up with enumerator values. */
6167 match_case_to_enum_1 (tree key, tree type, tree label)
6169 char buf[WIDE_INT_PRINT_BUFFER_SIZE];
6171 if (tree_fits_uhwi_p (key))
6172 print_dec (key, buf, UNSIGNED);
6173 else if (tree_fits_shwi_p (key))
6174 print_dec (key, buf, SIGNED);
6176 print_hex (key, buf);
6178 if (TYPE_NAME (type) == 0)
6179 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
6180 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
6181 "case value %qs not in enumerated type",
6184 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label)),
6185 warn_switch ? OPT_Wswitch : OPT_Wswitch_enum,
6186 "case value %qs not in enumerated type %qT",
6190 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6191 Used to verify that case values match up with enumerator values. */
6194 match_case_to_enum (splay_tree_node node, void *data)
6196 tree label = (tree) node->value;
6197 tree type = (tree) data;
6199 /* Skip default case. */
6200 if (!CASE_LOW (label))
6203 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6204 when we did our enum->case scan. Reset our scratch bit after. */
6205 if (!CASE_LOW_SEEN (label))
6206 match_case_to_enum_1 (CASE_LOW (label), type, label);
6208 CASE_LOW_SEEN (label) = 0;
6210 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6211 not set, that means that CASE_HIGH did not appear when we did our
6212 enum->case scan. Reset our scratch bit after. */
6213 if (CASE_HIGH (label))
6215 if (!CASE_HIGH_SEEN (label))
6216 match_case_to_enum_1 (CASE_HIGH (label), type, label);
6218 CASE_HIGH_SEEN (label) = 0;
6224 /* Handle -Wswitch*. Called from the front end after parsing the
6225 switch construct. */
6226 /* ??? Should probably be somewhere generic, since other languages
6227 besides C and C++ would want this. At the moment, however, C/C++
6228 are the only tree-ssa languages that support enumerations at all,
6229 so the point is moot. */
6232 c_do_switch_warnings (splay_tree cases, location_t switch_location,
6233 tree type, tree cond, bool bool_cond_p,
6234 bool outside_range_p)
6236 splay_tree_node default_node;
6237 splay_tree_node node;
6240 if (!warn_switch && !warn_switch_enum && !warn_switch_default
6241 && !warn_switch_bool)
6244 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
6246 warning_at (switch_location, OPT_Wswitch_default,
6247 "switch missing default case");
6249 /* There are certain cases where -Wswitch-bool warnings aren't
6256 so be careful here. */
6257 if (warn_switch_bool && bool_cond_p)
6259 splay_tree_node min_node;
6260 /* If there's a default node, it's also the value with the minimal
6261 key. So look at the penultimate key (if any). */
6263 min_node = splay_tree_successor (cases, (splay_tree_key) NULL);
6265 min_node = splay_tree_min (cases);
6266 tree min = min_node ? (tree) min_node->key : NULL_TREE;
6268 splay_tree_node max_node = splay_tree_max (cases);
6269 /* This might be a case range, so look at the value with the
6270 maximal key and then check CASE_HIGH. */
6271 tree max = max_node ? (tree) max_node->value : NULL_TREE;
6273 max = CASE_HIGH (max) ? CASE_HIGH (max) : CASE_LOW (max);
6275 /* If there's a case value > 1 or < 0, that is outside bool
6278 || (max && wi::gts_p (max, 1))
6279 || (min && wi::lts_p (min, 0))
6287 case, where we want to warn. */
6289 && max && wi::eq_p (max, 1)
6290 && min && wi::eq_p (min, 0)))
6291 warning_at (switch_location, OPT_Wswitch_bool,
6292 "switch condition has boolean value");
6295 /* From here on, we only care about enumerated types. */
6296 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
6299 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6300 if (!warn_switch_enum && !warn_switch)
6303 /* Check the cases. Warn about case values which are not members of
6304 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6305 there is no default case, check that exactly all enumeration
6306 literals are covered by the cases. */
6308 /* Clearing COND if it is not an integer constant simplifies
6309 the tests inside the loop below. */
6310 if (TREE_CODE (cond) != INTEGER_CST)
6313 /* The time complexity here is O(N*lg(N)) worst case, but for the
6314 common case of monotonically increasing enumerators, it is
6315 O(N), since the nature of the splay tree will keep the next
6316 element adjacent to the root at all times. */
6318 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
6320 tree value = TREE_VALUE (chain);
6321 if (TREE_CODE (value) == CONST_DECL)
6322 value = DECL_INITIAL (value);
6323 node = splay_tree_lookup (cases, (splay_tree_key) value);
6326 /* Mark the CASE_LOW part of the case entry as seen. */
6327 tree label = (tree) node->value;
6328 CASE_LOW_SEEN (label) = 1;
6332 /* Even though there wasn't an exact match, there might be a
6333 case range which includes the enumerator's value. */
6334 node = splay_tree_predecessor (cases, (splay_tree_key) value);
6335 if (node && CASE_HIGH ((tree) node->value))
6337 tree label = (tree) node->value;
6338 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
6341 /* If we match the upper bound exactly, mark the CASE_HIGH
6342 part of the case entry as seen. */
6344 CASE_HIGH_SEEN (label) = 1;
6349 /* We've now determined that this enumerated literal isn't
6350 handled by the case labels of the switch statement. */
6352 /* If the switch expression is a constant, we only really care
6353 about whether that constant is handled by the switch. */
6354 if (cond && tree_int_cst_compare (cond, value))
6357 /* If there is a default_node, the only relevant option is
6358 Wswitch-enum. Otherwise, if both are enabled then we prefer
6359 to warn using -Wswitch because -Wswitch is enabled by -Wall
6360 while -Wswitch-enum is explicit. */
6361 warning_at (switch_location,
6362 (default_node || !warn_switch
6365 "enumeration value %qE not handled in switch",
6366 TREE_PURPOSE (chain));
6369 /* Warn if there are case expressions that don't correspond to
6370 enumerators. This can occur since C and C++ don't enforce
6371 type-checking of assignments to enumeration variables.
6373 The time complexity here is now always O(N) worst case, since
6374 we should have marked both the lower bound and upper bound of
6375 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6376 above. This scan also resets those fields. */
6378 splay_tree_foreach (cases, match_case_to_enum, type);
6381 /* Finish an expression taking the address of LABEL (an
6382 IDENTIFIER_NODE). Returns an expression for the address.
6384 LOC is the location for the expression returned. */
6387 finish_label_address_expr (tree label, location_t loc)
6391 pedwarn (input_location, OPT_Wpedantic, "taking the address of a label is non-standard");
6393 if (label == error_mark_node)
6394 return error_mark_node;
6396 label = lookup_label (label);
6397 if (label == NULL_TREE)
6398 result = null_pointer_node;
6401 TREE_USED (label) = 1;
6402 result = build1 (ADDR_EXPR, ptr_type_node, label);
6403 /* The current function is not necessarily uninlinable.
6404 Computed gotos are incompatible with inlining, but the value
6405 here could be used only in a diagnostic, for example. */
6406 protected_set_expr_location (result, loc);
6413 /* Given a boolean expression ARG, return a tree representing an increment
6414 or decrement (as indicated by CODE) of ARG. The front end must check for
6415 invalid cases (e.g., decrement in C++). */
6417 boolean_increment (enum tree_code code, tree arg)
6420 tree true_res = build_int_cst (TREE_TYPE (arg), 1);
6422 arg = stabilize_reference (arg);
6425 case PREINCREMENT_EXPR:
6426 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
6428 case POSTINCREMENT_EXPR:
6429 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
6430 arg = save_expr (arg);
6431 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
6432 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
6434 case PREDECREMENT_EXPR:
6435 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
6436 invert_truthvalue_loc (input_location, arg));
6438 case POSTDECREMENT_EXPR:
6439 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
6440 invert_truthvalue_loc (input_location, arg));
6441 arg = save_expr (arg);
6442 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
6443 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
6448 TREE_SIDE_EFFECTS (val) = 1;
6452 /* Built-in macros for stddef.h and stdint.h, that require macros
6453 defined in this file. */
6455 c_stddef_cpp_builtins(void)
6457 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
6458 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
6459 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
6460 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
6461 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
6462 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
6463 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE, 0);
6464 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE, 0);
6465 if (SIG_ATOMIC_TYPE)
6466 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE, 0);
6468 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE, 0);
6470 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE, 0);
6472 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE, 0);
6474 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE, 0);
6476 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE, 0);
6478 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE, 0);
6480 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE, 0);
6482 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE, 0);
6483 if (INT_LEAST8_TYPE)
6484 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE, 0);
6485 if (INT_LEAST16_TYPE)
6486 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE, 0);
6487 if (INT_LEAST32_TYPE)
6488 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE, 0);
6489 if (INT_LEAST64_TYPE)
6490 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE, 0);
6491 if (UINT_LEAST8_TYPE)
6492 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE, 0);
6493 if (UINT_LEAST16_TYPE)
6494 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE, 0);
6495 if (UINT_LEAST32_TYPE)
6496 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE, 0);
6497 if (UINT_LEAST64_TYPE)
6498 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE, 0);
6500 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE, 0);
6501 if (INT_FAST16_TYPE)
6502 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE, 0);
6503 if (INT_FAST32_TYPE)
6504 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE, 0);
6505 if (INT_FAST64_TYPE)
6506 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE, 0);
6507 if (UINT_FAST8_TYPE)
6508 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE, 0);
6509 if (UINT_FAST16_TYPE)
6510 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE, 0);
6511 if (UINT_FAST32_TYPE)
6512 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE, 0);
6513 if (UINT_FAST64_TYPE)
6514 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE, 0);
6516 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE, 0);
6518 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE, 0);
6522 c_init_attributes (void)
6524 /* Fill in the built_in_attributes array. */
6525 #define DEF_ATTR_NULL_TREE(ENUM) \
6526 built_in_attributes[(int) ENUM] = NULL_TREE;
6527 #define DEF_ATTR_INT(ENUM, VALUE) \
6528 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6529 #define DEF_ATTR_STRING(ENUM, VALUE) \
6530 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6531 #define DEF_ATTR_IDENT(ENUM, STRING) \
6532 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6533 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6534 built_in_attributes[(int) ENUM] \
6535 = tree_cons (built_in_attributes[(int) PURPOSE], \
6536 built_in_attributes[(int) VALUE], \
6537 built_in_attributes[(int) CHAIN]);
6538 #include "builtin-attrs.def"
6539 #undef DEF_ATTR_NULL_TREE
6541 #undef DEF_ATTR_IDENT
6542 #undef DEF_ATTR_TREE_LIST
6545 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6546 identifier as an argument, so the front end shouldn't look it up. */
6549 attribute_takes_identifier_p (const_tree attr_id)
6551 const struct attribute_spec *spec = lookup_attribute_spec (attr_id);
6553 /* Unknown attribute that we'll end up ignoring, return true so we
6554 don't complain about an identifier argument. */
6556 else if (!strcmp ("mode", spec->name)
6557 || !strcmp ("format", spec->name)
6558 || !strcmp ("cleanup", spec->name))
6561 return targetm.attribute_takes_identifier_p (attr_id);
6564 /* Attribute handlers common to C front ends. */
6566 /* Handle a "packed" attribute; arguments as in
6567 struct attribute_spec.handler. */
6570 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6571 int flags, bool *no_add_attrs)
6575 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
6576 *node = build_variant_type_copy (*node);
6577 TYPE_PACKED (*node) = 1;
6579 else if (TREE_CODE (*node) == FIELD_DECL)
6581 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT
6582 /* Still pack bitfields. */
6583 && ! DECL_INITIAL (*node))
6584 warning (OPT_Wattributes,
6585 "%qE attribute ignored for field of type %qT",
6586 name, TREE_TYPE (*node));
6588 DECL_PACKED (*node) = 1;
6590 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6591 used for DECL_REGISTER. It wouldn't mean anything anyway.
6592 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6593 that changes what the typedef is typing. */
6596 warning (OPT_Wattributes, "%qE attribute ignored", name);
6597 *no_add_attrs = true;
6603 /* Handle a "nocommon" attribute; arguments as in
6604 struct attribute_spec.handler. */
6607 handle_nocommon_attribute (tree *node, tree name,
6608 tree ARG_UNUSED (args),
6609 int ARG_UNUSED (flags), bool *no_add_attrs)
6612 DECL_COMMON (*node) = 0;
6615 warning (OPT_Wattributes, "%qE attribute ignored", name);
6616 *no_add_attrs = true;
6622 /* Handle a "common" attribute; arguments as in
6623 struct attribute_spec.handler. */
6626 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6627 int ARG_UNUSED (flags), bool *no_add_attrs)
6630 DECL_COMMON (*node) = 1;
6633 warning (OPT_Wattributes, "%qE attribute ignored", name);
6634 *no_add_attrs = true;
6640 /* Handle a "noreturn" attribute; arguments as in
6641 struct attribute_spec.handler. */
6644 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6645 int ARG_UNUSED (flags), bool *no_add_attrs)
6647 tree type = TREE_TYPE (*node);
6649 /* See FIXME comment in c_common_attribute_table. */
6650 if (TREE_CODE (*node) == FUNCTION_DECL
6651 || objc_method_decl (TREE_CODE (*node)))
6652 TREE_THIS_VOLATILE (*node) = 1;
6653 else if (TREE_CODE (type) == POINTER_TYPE
6654 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
6656 = (build_qualified_type
6658 (build_type_variant (TREE_TYPE (type),
6659 TYPE_READONLY (TREE_TYPE (type)), 1)),
6660 TYPE_QUALS (type)));
6663 warning (OPT_Wattributes, "%qE attribute ignored", name);
6664 *no_add_attrs = true;
6670 /* Handle a "hot" and attribute; arguments as in
6671 struct attribute_spec.handler. */
6674 handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6675 int ARG_UNUSED (flags), bool *no_add_attrs)
6677 if (TREE_CODE (*node) == FUNCTION_DECL
6678 || TREE_CODE (*node) == LABEL_DECL)
6680 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
6682 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6683 "with attribute %qs", name, "cold");
6684 *no_add_attrs = true;
6686 /* Most of the rest of the hot processing is done later with
6687 lookup_attribute. */
6691 warning (OPT_Wattributes, "%qE attribute ignored", name);
6692 *no_add_attrs = true;
6698 /* Handle a "cold" and attribute; arguments as in
6699 struct attribute_spec.handler. */
6702 handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
6703 int ARG_UNUSED (flags), bool *no_add_attrs)
6705 if (TREE_CODE (*node) == FUNCTION_DECL
6706 || TREE_CODE (*node) == LABEL_DECL)
6708 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
6710 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6711 "with attribute %qs", name, "hot");
6712 *no_add_attrs = true;
6714 /* Most of the rest of the cold processing is done later with
6715 lookup_attribute. */
6719 warning (OPT_Wattributes, "%qE attribute ignored", name);
6720 *no_add_attrs = true;
6726 /* Handle a "no_sanitize_address" attribute; arguments as in
6727 struct attribute_spec.handler. */
6730 handle_no_sanitize_address_attribute (tree *node, tree name, tree, int,
6733 if (TREE_CODE (*node) != FUNCTION_DECL)
6735 warning (OPT_Wattributes, "%qE attribute ignored", name);
6736 *no_add_attrs = true;
6742 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6743 struct attribute_spec.handler. */
6746 handle_no_address_safety_analysis_attribute (tree *node, tree name, tree, int,
6749 if (TREE_CODE (*node) != FUNCTION_DECL)
6750 warning (OPT_Wattributes, "%qE attribute ignored", name);
6751 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node)))
6752 DECL_ATTRIBUTES (*node)
6753 = tree_cons (get_identifier ("no_sanitize_address"),
6754 NULL_TREE, DECL_ATTRIBUTES (*node));
6755 *no_add_attrs = true;
6759 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6760 struct attribute_spec.handler. */
6763 handle_no_sanitize_undefined_attribute (tree *node, tree name, tree, int,
6766 if (TREE_CODE (*node) != FUNCTION_DECL)
6768 warning (OPT_Wattributes, "%qE attribute ignored", name);
6769 *no_add_attrs = true;
6775 /* Handle a "stack_protect" attribute; arguments as in
6776 struct attribute_spec.handler. */
6778 handle_stack_protect_attribute (tree *node, tree name, tree, int,
6781 if (TREE_CODE (*node) != FUNCTION_DECL)
6783 warning (OPT_Wattributes, "%qE attribute ignored", name);
6784 *no_add_attrs = true;
6787 DECL_ATTRIBUTES (*node)
6788 = tree_cons (get_identifier ("stack_protect"),
6789 NULL_TREE, DECL_ATTRIBUTES (*node));
6794 /* Handle a "noinline" attribute; arguments as in
6795 struct attribute_spec.handler. */
6798 handle_noinline_attribute (tree *node, tree name,
6799 tree ARG_UNUSED (args),
6800 int ARG_UNUSED (flags), bool *no_add_attrs)
6802 if (TREE_CODE (*node) == FUNCTION_DECL)
6804 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
6806 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6807 "with attribute %qs", name, "always_inline");
6808 *no_add_attrs = true;
6811 DECL_UNINLINABLE (*node) = 1;
6815 warning (OPT_Wattributes, "%qE attribute ignored", name);
6816 *no_add_attrs = true;
6822 /* Handle a "noclone" attribute; arguments as in
6823 struct attribute_spec.handler. */
6826 handle_noclone_attribute (tree *node, tree name,
6827 tree ARG_UNUSED (args),
6828 int ARG_UNUSED (flags), bool *no_add_attrs)
6830 if (TREE_CODE (*node) != FUNCTION_DECL)
6832 warning (OPT_Wattributes, "%qE attribute ignored", name);
6833 *no_add_attrs = true;
6839 /* Handle a "no_icf" attribute; arguments as in
6840 struct attribute_spec.handler. */
6843 handle_noicf_attribute (tree *node, tree name,
6844 tree ARG_UNUSED (args),
6845 int ARG_UNUSED (flags), bool *no_add_attrs)
6847 if (TREE_CODE (*node) != FUNCTION_DECL)
6849 warning (OPT_Wattributes, "%qE attribute ignored", name);
6850 *no_add_attrs = true;
6857 /* Handle a "always_inline" attribute; arguments as in
6858 struct attribute_spec.handler. */
6861 handle_always_inline_attribute (tree *node, tree name,
6862 tree ARG_UNUSED (args),
6863 int ARG_UNUSED (flags),
6866 if (TREE_CODE (*node) == FUNCTION_DECL)
6868 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node)))
6870 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6871 "with %qs attribute", name, "noinline");
6872 *no_add_attrs = true;
6874 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
6876 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
6877 "with %qs attribute", name, "target_clones");
6878 *no_add_attrs = true;
6881 /* Set the attribute and mark it for disregarding inline
6883 DECL_DISREGARD_INLINE_LIMITS (*node) = 1;
6887 warning (OPT_Wattributes, "%qE attribute ignored", name);
6888 *no_add_attrs = true;
6894 /* Handle a "gnu_inline" attribute; arguments as in
6895 struct attribute_spec.handler. */
6898 handle_gnu_inline_attribute (tree *node, tree name,
6899 tree ARG_UNUSED (args),
6900 int ARG_UNUSED (flags),
6903 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6905 /* Do nothing else, just set the attribute. We'll get at
6906 it later with lookup_attribute. */
6910 warning (OPT_Wattributes, "%qE attribute ignored", name);
6911 *no_add_attrs = true;
6917 /* Handle a "leaf" attribute; arguments as in
6918 struct attribute_spec.handler. */
6921 handle_leaf_attribute (tree *node, tree name,
6922 tree ARG_UNUSED (args),
6923 int ARG_UNUSED (flags), bool *no_add_attrs)
6925 if (TREE_CODE (*node) != FUNCTION_DECL)
6927 warning (OPT_Wattributes, "%qE attribute ignored", name);
6928 *no_add_attrs = true;
6930 if (!TREE_PUBLIC (*node))
6932 warning (OPT_Wattributes, "%qE attribute has no effect on unit local functions", name);
6933 *no_add_attrs = true;
6939 /* Handle an "artificial" attribute; arguments as in
6940 struct attribute_spec.handler. */
6943 handle_artificial_attribute (tree *node, tree name,
6944 tree ARG_UNUSED (args),
6945 int ARG_UNUSED (flags),
6948 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
6950 /* Do nothing else, just set the attribute. We'll get at
6951 it later with lookup_attribute. */
6955 warning (OPT_Wattributes, "%qE attribute ignored", name);
6956 *no_add_attrs = true;
6962 /* Handle a "flatten" attribute; arguments as in
6963 struct attribute_spec.handler. */
6966 handle_flatten_attribute (tree *node, tree name,
6967 tree args ATTRIBUTE_UNUSED,
6968 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
6970 if (TREE_CODE (*node) == FUNCTION_DECL)
6971 /* Do nothing else, just set the attribute. We'll get at
6972 it later with lookup_attribute. */
6976 warning (OPT_Wattributes, "%qE attribute ignored", name);
6977 *no_add_attrs = true;
6983 /* Handle a "warning" or "error" attribute; arguments as in
6984 struct attribute_spec.handler. */
6987 handle_error_attribute (tree *node, tree name, tree args,
6988 int ARG_UNUSED (flags), bool *no_add_attrs)
6990 if (TREE_CODE (*node) == FUNCTION_DECL
6991 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
6992 /* Do nothing else, just set the attribute. We'll get at
6993 it later with lookup_attribute. */
6997 warning (OPT_Wattributes, "%qE attribute ignored", name);
6998 *no_add_attrs = true;
7004 /* Handle a "used" attribute; arguments as in
7005 struct attribute_spec.handler. */
7008 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
7009 int ARG_UNUSED (flags), bool *no_add_attrs)
7013 if (TREE_CODE (node) == FUNCTION_DECL
7014 || (VAR_P (node) && TREE_STATIC (node))
7015 || (TREE_CODE (node) == TYPE_DECL))
7017 TREE_USED (node) = 1;
7018 DECL_PRESERVE_P (node) = 1;
7020 DECL_READ_P (node) = 1;
7024 warning (OPT_Wattributes, "%qE attribute ignored", name);
7025 *no_add_attrs = true;
7031 /* Handle a "unused" attribute; arguments as in
7032 struct attribute_spec.handler. */
7035 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7036 int flags, bool *no_add_attrs)
7042 if (TREE_CODE (decl) == PARM_DECL
7043 || VAR_OR_FUNCTION_DECL_P (decl)
7044 || TREE_CODE (decl) == LABEL_DECL
7045 || TREE_CODE (decl) == CONST_DECL
7046 || TREE_CODE (decl) == TYPE_DECL)
7048 TREE_USED (decl) = 1;
7049 if (VAR_P (decl) || TREE_CODE (decl) == PARM_DECL)
7050 DECL_READ_P (decl) = 1;
7054 warning (OPT_Wattributes, "%qE attribute ignored", name);
7055 *no_add_attrs = true;
7060 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7061 *node = build_variant_type_copy (*node);
7062 TREE_USED (*node) = 1;
7068 /* Handle a "externally_visible" attribute; arguments as in
7069 struct attribute_spec.handler. */
7072 handle_externally_visible_attribute (tree *pnode, tree name,
7073 tree ARG_UNUSED (args),
7074 int ARG_UNUSED (flags),
7079 if (VAR_OR_FUNCTION_DECL_P (node))
7081 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
7082 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
7084 warning (OPT_Wattributes,
7085 "%qE attribute have effect only on public objects", name);
7086 *no_add_attrs = true;
7091 warning (OPT_Wattributes, "%qE attribute ignored", name);
7092 *no_add_attrs = true;
7098 /* Handle the "no_reorder" attribute. Arguments as in
7099 struct attribute_spec.handler. */
7102 handle_no_reorder_attribute (tree *pnode,
7110 if (!VAR_OR_FUNCTION_DECL_P (node)
7111 && !(TREE_STATIC (node) || DECL_EXTERNAL (node)))
7113 warning (OPT_Wattributes,
7114 "%qE attribute only affects top level objects",
7116 *no_add_attrs = true;
7122 /* Handle a "const" attribute; arguments as in
7123 struct attribute_spec.handler. */
7126 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
7127 int ARG_UNUSED (flags), bool *no_add_attrs)
7129 tree type = TREE_TYPE (*node);
7131 /* See FIXME comment on noreturn in c_common_attribute_table. */
7132 if (TREE_CODE (*node) == FUNCTION_DECL)
7133 TREE_READONLY (*node) = 1;
7134 else if (TREE_CODE (type) == POINTER_TYPE
7135 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
7137 = (build_qualified_type
7139 (build_type_variant (TREE_TYPE (type), 1,
7140 TREE_THIS_VOLATILE (TREE_TYPE (type)))),
7141 TYPE_QUALS (type)));
7144 warning (OPT_Wattributes, "%qE attribute ignored", name);
7145 *no_add_attrs = true;
7151 /* Handle a "scalar_storage_order" attribute; arguments as in
7152 struct attribute_spec.handler. */
7155 handle_scalar_storage_order_attribute (tree *node, tree name, tree args,
7156 int flags, bool *no_add_attrs)
7158 tree id = TREE_VALUE (args);
7161 if (TREE_CODE (*node) == TYPE_DECL
7162 && ! (flags & ATTR_FLAG_CXX11))
7163 node = &TREE_TYPE (*node);
7166 if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN)
7168 error ("scalar_storage_order is not supported because endianness "
7173 if (RECORD_OR_UNION_TYPE_P (type) && !c_dialect_cxx ())
7175 bool reverse = false;
7177 if (TREE_CODE (id) == STRING_CST
7178 && strcmp (TREE_STRING_POINTER (id), "big-endian") == 0)
7179 reverse = !BYTES_BIG_ENDIAN;
7180 else if (TREE_CODE (id) == STRING_CST
7181 && strcmp (TREE_STRING_POINTER (id), "little-endian") == 0)
7182 reverse = BYTES_BIG_ENDIAN;
7185 error ("scalar_storage_order argument must be one of \"big-endian\""
7186 " or \"little-endian\"");
7190 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7193 /* A type variant isn't good enough, since we don't want a cast
7194 to such a type to be removed as a no-op. */
7195 *node = type = build_duplicate_type (type);
7198 TYPE_REVERSE_STORAGE_ORDER (type) = reverse;
7202 warning (OPT_Wattributes, "%qE attribute ignored", name);
7203 *no_add_attrs = true;
7207 /* Handle a "transparent_union" attribute; arguments as in
7208 struct attribute_spec.handler. */
7211 handle_transparent_union_attribute (tree *node, tree name,
7212 tree ARG_UNUSED (args), int flags,
7217 *no_add_attrs = true;
7219 if (TREE_CODE (*node) == TYPE_DECL
7220 && ! (flags & ATTR_FLAG_CXX11))
7221 node = &TREE_TYPE (*node);
7224 if (TREE_CODE (type) == UNION_TYPE)
7226 /* Make sure that the first field will work for a transparent union.
7227 If the type isn't complete yet, leave the check to the code in
7229 if (TYPE_SIZE (type))
7231 tree first = first_field (type);
7232 if (first == NULL_TREE
7233 || DECL_ARTIFICIAL (first)
7234 || TYPE_MODE (type) != DECL_MODE (first))
7238 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7240 /* If the type isn't complete yet, setting the flag
7241 on a variant wouldn't ever be checked. */
7242 if (!TYPE_SIZE (type))
7245 /* build_duplicate_type doesn't work for C++. */
7246 if (c_dialect_cxx ())
7249 /* A type variant isn't good enough, since we don't want a cast
7250 to such a type to be removed as a no-op. */
7251 *node = type = build_duplicate_type (type);
7254 for (tree t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
7255 TYPE_TRANSPARENT_AGGR (t) = 1;
7260 warning (OPT_Wattributes, "%qE attribute ignored", name);
7264 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7265 get the requested priority for a constructor or destructor,
7266 possibly issuing diagnostics for invalid or reserved
7269 static priority_type
7270 get_priority (tree args, bool is_destructor)
7276 return DEFAULT_INIT_PRIORITY;
7278 if (!SUPPORTS_INIT_PRIORITY)
7281 error ("destructor priorities are not supported");
7283 error ("constructor priorities are not supported");
7284 return DEFAULT_INIT_PRIORITY;
7287 arg = TREE_VALUE (args);
7288 if (TREE_CODE (arg) == IDENTIFIER_NODE)
7290 if (arg == error_mark_node)
7291 return DEFAULT_INIT_PRIORITY;
7292 arg = default_conversion (arg);
7293 if (!tree_fits_shwi_p (arg)
7294 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
7297 pri = tree_to_shwi (arg);
7298 if (pri < 0 || pri > MAX_INIT_PRIORITY)
7301 if (pri <= MAX_RESERVED_INIT_PRIORITY)
7305 "destructor priorities from 0 to %d are reserved "
7306 "for the implementation",
7307 MAX_RESERVED_INIT_PRIORITY);
7310 "constructor priorities from 0 to %d are reserved "
7311 "for the implementation",
7312 MAX_RESERVED_INIT_PRIORITY);
7318 error ("destructor priorities must be integers from 0 to %d inclusive",
7321 error ("constructor priorities must be integers from 0 to %d inclusive",
7323 return DEFAULT_INIT_PRIORITY;
7326 /* Handle a "constructor" attribute; arguments as in
7327 struct attribute_spec.handler. */
7330 handle_constructor_attribute (tree *node, tree name, tree args,
7331 int ARG_UNUSED (flags),
7335 tree type = TREE_TYPE (decl);
7337 if (TREE_CODE (decl) == FUNCTION_DECL
7338 && TREE_CODE (type) == FUNCTION_TYPE
7339 && decl_function_context (decl) == 0)
7341 priority_type priority;
7342 DECL_STATIC_CONSTRUCTOR (decl) = 1;
7343 priority = get_priority (args, /*is_destructor=*/false);
7344 SET_DECL_INIT_PRIORITY (decl, priority);
7345 TREE_USED (decl) = 1;
7349 warning (OPT_Wattributes, "%qE attribute ignored", name);
7350 *no_add_attrs = true;
7356 /* Handle a "destructor" attribute; arguments as in
7357 struct attribute_spec.handler. */
7360 handle_destructor_attribute (tree *node, tree name, tree args,
7361 int ARG_UNUSED (flags),
7365 tree type = TREE_TYPE (decl);
7367 if (TREE_CODE (decl) == FUNCTION_DECL
7368 && TREE_CODE (type) == FUNCTION_TYPE
7369 && decl_function_context (decl) == 0)
7371 priority_type priority;
7372 DECL_STATIC_DESTRUCTOR (decl) = 1;
7373 priority = get_priority (args, /*is_destructor=*/true);
7374 SET_DECL_FINI_PRIORITY (decl, priority);
7375 TREE_USED (decl) = 1;
7379 warning (OPT_Wattributes, "%qE attribute ignored", name);
7380 *no_add_attrs = true;
7386 /* Nonzero if the mode is a valid vector mode for this architecture.
7387 This returns nonzero even if there is no hardware support for the
7388 vector mode, but we can emulate with narrower modes. */
7391 vector_mode_valid_p (machine_mode mode)
7393 enum mode_class mclass = GET_MODE_CLASS (mode);
7394 machine_mode innermode;
7396 /* Doh! What's going on? */
7397 if (mclass != MODE_VECTOR_INT
7398 && mclass != MODE_VECTOR_FLOAT
7399 && mclass != MODE_VECTOR_FRACT
7400 && mclass != MODE_VECTOR_UFRACT
7401 && mclass != MODE_VECTOR_ACCUM
7402 && mclass != MODE_VECTOR_UACCUM)
7405 /* Hardware support. Woo hoo! */
7406 if (targetm.vector_mode_supported_p (mode))
7409 innermode = GET_MODE_INNER (mode);
7411 /* We should probably return 1 if requesting V4DI and we have no DI,
7412 but we have V2DI, but this is probably very unlikely. */
7414 /* If we have support for the inner mode, we can safely emulate it.
7415 We may not have V2DI, but me can emulate with a pair of DIs. */
7416 return targetm.scalar_mode_supported_p (innermode);
7420 /* Handle a "mode" attribute; arguments as in
7421 struct attribute_spec.handler. */
7424 handle_mode_attribute (tree *node, tree name, tree args,
7425 int ARG_UNUSED (flags), bool *no_add_attrs)
7428 tree ident = TREE_VALUE (args);
7430 *no_add_attrs = true;
7432 if (TREE_CODE (ident) != IDENTIFIER_NODE)
7433 warning (OPT_Wattributes, "%qE attribute ignored", name);
7437 const char *p = IDENTIFIER_POINTER (ident);
7438 int len = strlen (p);
7439 machine_mode mode = VOIDmode;
7443 if (len > 4 && p[0] == '_' && p[1] == '_'
7444 && p[len - 1] == '_' && p[len - 2] == '_')
7446 char *newp = (char *) alloca (len - 1);
7448 strcpy (newp, &p[2]);
7449 newp[len - 4] = '\0';
7453 /* Change this type to have a type with the specified mode.
7454 First check for the special modes. */
7455 if (!strcmp (p, "byte"))
7457 else if (!strcmp (p, "word"))
7459 else if (!strcmp (p, "pointer"))
7461 else if (!strcmp (p, "libgcc_cmp_return"))
7462 mode = targetm.libgcc_cmp_return_mode ();
7463 else if (!strcmp (p, "libgcc_shift_count"))
7464 mode = targetm.libgcc_shift_count_mode ();
7465 else if (!strcmp (p, "unwind_word"))
7466 mode = targetm.unwind_word_mode ();
7468 for (j = 0; j < NUM_MACHINE_MODES; j++)
7469 if (!strcmp (p, GET_MODE_NAME (j)))
7471 mode = (machine_mode) j;
7475 if (mode == VOIDmode)
7477 error ("unknown machine mode %qE", ident);
7482 switch (GET_MODE_CLASS (mode))
7485 case MODE_PARTIAL_INT:
7487 case MODE_DECIMAL_FLOAT:
7492 valid_mode = targetm.scalar_mode_supported_p (mode);
7495 case MODE_COMPLEX_INT:
7496 case MODE_COMPLEX_FLOAT:
7497 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
7500 case MODE_VECTOR_INT:
7501 case MODE_VECTOR_FLOAT:
7502 case MODE_VECTOR_FRACT:
7503 case MODE_VECTOR_UFRACT:
7504 case MODE_VECTOR_ACCUM:
7505 case MODE_VECTOR_UACCUM:
7506 warning (OPT_Wattributes, "specifying vector types with "
7507 "__attribute__ ((mode)) is deprecated");
7508 warning (OPT_Wattributes,
7509 "use __attribute__ ((vector_size)) instead");
7510 valid_mode = vector_mode_valid_p (mode);
7518 error ("unable to emulate %qs", p);
7522 if (POINTER_TYPE_P (type))
7524 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
7525 tree (*fn)(tree, machine_mode, bool);
7527 if (!targetm.addr_space.valid_pointer_mode (mode, as))
7529 error ("invalid pointer mode %qs", p);
7533 if (TREE_CODE (type) == POINTER_TYPE)
7534 fn = build_pointer_type_for_mode;
7536 fn = build_reference_type_for_mode;
7537 typefm = fn (TREE_TYPE (type), mode, false);
7541 /* For fixed-point modes, we need to test if the signness of type
7542 and the machine mode are consistent. */
7543 if (ALL_FIXED_POINT_MODE_P (mode)
7544 && TYPE_UNSIGNED (type) != UNSIGNED_FIXED_POINT_MODE_P (mode))
7546 error ("signedness of type and machine mode %qs don%'t match", p);
7549 /* For fixed-point modes, we need to pass saturating info. */
7550 typefm = lang_hooks.types.type_for_mode (mode,
7551 ALL_FIXED_POINT_MODE_P (mode) ? TYPE_SATURATING (type)
7552 : TYPE_UNSIGNED (type));
7555 if (typefm == NULL_TREE)
7557 error ("no data type for mode %qs", p);
7560 else if (TREE_CODE (type) == ENUMERAL_TYPE)
7562 /* For enumeral types, copy the precision from the integer
7563 type returned above. If not an INTEGER_TYPE, we can't use
7564 this mode for this type. */
7565 if (TREE_CODE (typefm) != INTEGER_TYPE)
7567 error ("cannot use mode %qs for enumeral types", p);
7571 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
7573 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
7578 /* We cannot build a type variant, as there's code that assumes
7579 that TYPE_MAIN_VARIANT has the same mode. This includes the
7580 debug generators. Instead, create a subrange type. This
7581 results in all of the enumeral values being emitted only once
7582 in the original, and the subtype gets them by reference. */
7583 if (TYPE_UNSIGNED (type))
7584 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
7586 typefm = make_signed_type (TYPE_PRECISION (typefm));
7587 TREE_TYPE (typefm) = type;
7590 else if (VECTOR_MODE_P (mode)
7591 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
7592 : TREE_CODE (type) != TREE_CODE (typefm))
7594 error ("mode %qs applied to inappropriate type", p);
7604 /* Handle a "section" attribute; arguments as in
7605 struct attribute_spec.handler. */
7608 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
7609 int ARG_UNUSED (flags), bool *no_add_attrs)
7613 if (!targetm_common.have_named_sections)
7615 error_at (DECL_SOURCE_LOCATION (*node),
7616 "section attributes are not supported for this target");
7620 user_defined_section_attribute = true;
7622 if (!VAR_OR_FUNCTION_DECL_P (decl))
7624 error ("section attribute not allowed for %q+D", *node);
7628 if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
7630 error ("section attribute argument not a string constant");
7635 && current_function_decl != NULL_TREE
7636 && !TREE_STATIC (decl))
7638 error_at (DECL_SOURCE_LOCATION (decl),
7639 "section attribute cannot be specified for local variables");
7643 /* The decl may have already been given a section attribute
7644 from a previous declaration. Ensure they match. */
7645 if (DECL_SECTION_NAME (decl) != NULL
7646 && strcmp (DECL_SECTION_NAME (decl),
7647 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
7649 error ("section of %q+D conflicts with previous declaration", *node);
7654 && !targetm.have_tls && targetm.emutls.tmpl_section
7655 && DECL_THREAD_LOCAL_P (decl))
7657 error ("section of %q+D cannot be overridden", *node);
7661 set_decl_section_name (decl, TREE_STRING_POINTER (TREE_VALUE (args)));
7665 *no_add_attrs = true;
7669 /* Check whether ALIGN is a valid user-specified alignment. If so,
7670 return its base-2 log; if not, output an error and return -1. If
7671 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7674 check_user_alignment (const_tree align, bool allow_zero)
7678 if (error_operand_p (align))
7680 if (TREE_CODE (align) != INTEGER_CST
7681 || !INTEGRAL_TYPE_P (TREE_TYPE (align)))
7683 error ("requested alignment is not an integer constant");
7686 else if (allow_zero && integer_zerop (align))
7688 else if (tree_int_cst_sgn (align) == -1
7689 || (i = tree_log2 (align)) == -1)
7691 error ("requested alignment is not a positive power of 2");
7694 else if (i >= HOST_BITS_PER_INT - BITS_PER_UNIT_LOG)
7696 error ("requested alignment is too large");
7703 If in c++-11, check if the c++-11 alignment constraint with respect
7704 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7705 c++-11 mode, does nothing.
7709 [* if the constant expression evaluates to a fundamental alignment,
7710 the alignment requirement of the declared entity shall be the
7711 specified fundamental alignment.
7713 * if the constant expression evaluates to an extended alignment
7714 and the implementation supports that alignment in the context
7715 of the declaration, the alignment of the declared entity shall
7718 * if the constant expression evaluates to an extended alignment
7719 and the implementation does not support that alignment in the
7720 context of the declaration, the program is ill-formed]. */
7723 check_cxx_fundamental_alignment_constraints (tree node,
7727 bool alignment_too_large_p = false;
7728 unsigned requested_alignment = 1U << align_log;
7729 unsigned max_align = 0;
7731 if ((!(flags & ATTR_FLAG_CXX11) && !warn_cxx_compat)
7732 || (node == NULL_TREE || node == error_mark_node))
7735 if (cxx_fundamental_alignment_p (requested_alignment))
7740 if (TREE_STATIC (node))
7742 /* For file scope variables and static members, the target
7743 supports alignments that are at most
7744 MAX_OFILE_ALIGNMENT. */
7745 if (requested_alignment > (max_align = MAX_OFILE_ALIGNMENT))
7746 alignment_too_large_p = true;
7750 #ifdef BIGGEST_FIELD_ALIGNMENT
7751 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7753 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7755 /* For non-static members, the target supports either
7756 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7757 if it is defined or BIGGEST_ALIGNMENT. */
7758 max_align = MAX_TARGET_FIELD_ALIGNMENT;
7759 if (TREE_CODE (node) == FIELD_DECL
7760 && requested_alignment > (max_align = MAX_TARGET_FIELD_ALIGNMENT))
7761 alignment_too_large_p = true;
7762 #undef MAX_TARGET_FIELD_ALIGNMENT
7763 /* For stack variables, the target supports at most
7764 MAX_STACK_ALIGNMENT. */
7765 else if (decl_function_context (node) != NULL
7766 && requested_alignment > (max_align = MAX_STACK_ALIGNMENT))
7767 alignment_too_large_p = true;
7770 else if (TYPE_P (node))
7772 /* Let's be liberal for types. */
7773 if (requested_alignment > (max_align = BIGGEST_ALIGNMENT))
7774 alignment_too_large_p = true;
7777 if (alignment_too_large_p)
7778 pedwarn (input_location, OPT_Wattributes,
7779 "requested alignment %d is larger than %d",
7780 requested_alignment, max_align);
7782 return !alignment_too_large_p;
7785 /* Handle a "aligned" attribute; arguments as in
7786 struct attribute_spec.handler. */
7789 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
7790 int flags, bool *no_add_attrs)
7792 tree decl = NULL_TREE;
7800 align_expr = TREE_VALUE (args);
7801 if (align_expr && TREE_CODE (align_expr) != IDENTIFIER_NODE
7802 && TREE_CODE (align_expr) != FUNCTION_DECL)
7803 align_expr = default_conversion (align_expr);
7806 align_expr = size_int (ATTRIBUTE_ALIGNED_VALUE / BITS_PER_UNIT);
7811 type = &TREE_TYPE (decl);
7812 is_type = TREE_CODE (*node) == TYPE_DECL;
7814 else if (TYPE_P (*node))
7815 type = node, is_type = 1;
7817 if ((i = check_user_alignment (align_expr, true)) == -1
7818 || !check_cxx_fundamental_alignment_constraints (*node, i, flags))
7819 *no_add_attrs = true;
7822 if ((flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
7823 /* OK, modify the type in place. */;
7824 /* If we have a TYPE_DECL, then copy the type, so that we
7825 don't accidentally modify a builtin type. See pushdecl. */
7826 else if (decl && TREE_TYPE (decl) != error_mark_node
7827 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
7829 tree tt = TREE_TYPE (decl);
7830 *type = build_variant_type_copy (*type);
7831 DECL_ORIGINAL_TYPE (decl) = tt;
7832 TYPE_NAME (*type) = decl;
7833 TREE_USED (*type) = TREE_USED (decl);
7834 TREE_TYPE (decl) = *type;
7837 *type = build_variant_type_copy (*type);
7839 SET_TYPE_ALIGN (*type, (1U << i) * BITS_PER_UNIT);
7840 TYPE_USER_ALIGN (*type) = 1;
7842 else if (! VAR_OR_FUNCTION_DECL_P (decl)
7843 && TREE_CODE (decl) != FIELD_DECL)
7845 error ("alignment may not be specified for %q+D", decl);
7846 *no_add_attrs = true;
7848 else if (DECL_USER_ALIGN (decl)
7849 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
7850 /* C++-11 [dcl.align/4]:
7852 When multiple alignment-specifiers are specified for an
7853 entity, the alignment requirement shall be set to the
7854 strictest specified alignment.
7856 This formally comes from the c++11 specification but we are
7857 doing it for the GNU attribute syntax as well. */
7858 *no_add_attrs = true;
7859 else if (TREE_CODE (decl) == FUNCTION_DECL
7860 && DECL_ALIGN (decl) > (1U << i) * BITS_PER_UNIT)
7862 if (DECL_USER_ALIGN (decl))
7863 error ("alignment for %q+D was previously specified as %d "
7864 "and may not be decreased", decl,
7865 DECL_ALIGN (decl) / BITS_PER_UNIT);
7867 error ("alignment for %q+D must be at least %d", decl,
7868 DECL_ALIGN (decl) / BITS_PER_UNIT);
7869 *no_add_attrs = true;
7873 SET_DECL_ALIGN (decl, (1U << i) * BITS_PER_UNIT);
7874 DECL_USER_ALIGN (decl) = 1;
7880 /* Handle a "weak" attribute; arguments as in
7881 struct attribute_spec.handler. */
7884 handle_weak_attribute (tree *node, tree name,
7885 tree ARG_UNUSED (args),
7886 int ARG_UNUSED (flags),
7887 bool * ARG_UNUSED (no_add_attrs))
7889 if (TREE_CODE (*node) == FUNCTION_DECL
7890 && DECL_DECLARED_INLINE_P (*node))
7892 warning (OPT_Wattributes, "inline function %q+D declared weak", *node);
7893 *no_add_attrs = true;
7895 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
7897 error ("indirect function %q+D cannot be declared weak", *node);
7898 *no_add_attrs = true;
7901 else if (VAR_OR_FUNCTION_DECL_P (*node))
7902 declare_weak (*node);
7904 warning (OPT_Wattributes, "%qE attribute ignored", name);
7909 /* Handle a "noplt" attribute; arguments as in
7910 struct attribute_spec.handler. */
7913 handle_noplt_attribute (tree *node, tree name,
7914 tree ARG_UNUSED (args),
7915 int ARG_UNUSED (flags),
7916 bool * ARG_UNUSED (no_add_attrs))
7918 if (TREE_CODE (*node) != FUNCTION_DECL)
7920 warning (OPT_Wattributes,
7921 "%qE attribute is only applicable on functions", name);
7922 *no_add_attrs = true;
7928 /* Handle an "alias" or "ifunc" attribute; arguments as in
7929 struct attribute_spec.handler, except that IS_ALIAS tells us
7930 whether this is an alias as opposed to ifunc attribute. */
7933 handle_alias_ifunc_attribute (bool is_alias, tree *node, tree name, tree args,
7938 if (TREE_CODE (decl) != FUNCTION_DECL
7939 && (!is_alias || !VAR_P (decl)))
7941 warning (OPT_Wattributes, "%qE attribute ignored", name);
7942 *no_add_attrs = true;
7944 else if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
7945 || (TREE_CODE (decl) != FUNCTION_DECL
7946 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
7947 /* A static variable declaration is always a tentative definition,
7948 but the alias is a non-tentative definition which overrides. */
7949 || (TREE_CODE (decl) != FUNCTION_DECL
7950 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
7952 error ("%q+D defined both normally and as %qE attribute", decl, name);
7953 *no_add_attrs = true;
7957 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl))
7958 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl))))
7960 error ("weak %q+D cannot be defined %qE", decl, name);
7961 *no_add_attrs = true;
7965 /* Note that the very first time we process a nested declaration,
7966 decl_function_context will not be set. Indeed, *would* never
7967 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
7968 we do below. After such frobbery, pushdecl would set the context.
7969 In any case, this is never what we want. */
7970 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
7974 id = TREE_VALUE (args);
7975 if (TREE_CODE (id) != STRING_CST)
7977 error ("attribute %qE argument not a string", name);
7978 *no_add_attrs = true;
7981 id = get_identifier (TREE_STRING_POINTER (id));
7982 /* This counts as a use of the object pointed to. */
7985 if (TREE_CODE (decl) == FUNCTION_DECL)
7986 DECL_INITIAL (decl) = error_mark_node;
7988 TREE_STATIC (decl) = 1;
7991 /* ifuncs are also aliases, so set that attribute too. */
7992 DECL_ATTRIBUTES (decl)
7993 = tree_cons (get_identifier ("alias"), args, DECL_ATTRIBUTES (decl));
7997 warning (OPT_Wattributes, "%qE attribute ignored", name);
7998 *no_add_attrs = true;
8001 if (decl_in_symtab_p (*node))
8003 struct symtab_node *n = symtab_node::get (decl);
8004 if (n && n->refuse_visibility_changes)
8007 error ("%+D declared alias after being used", decl);
8009 error ("%+D declared ifunc after being used", decl);
8017 /* Handle an "alias" or "ifunc" attribute; arguments as in
8018 struct attribute_spec.handler. */
8021 handle_ifunc_attribute (tree *node, tree name, tree args,
8022 int ARG_UNUSED (flags), bool *no_add_attrs)
8024 return handle_alias_ifunc_attribute (false, node, name, args, no_add_attrs);
8027 /* Handle an "alias" or "ifunc" attribute; arguments as in
8028 struct attribute_spec.handler. */
8031 handle_alias_attribute (tree *node, tree name, tree args,
8032 int ARG_UNUSED (flags), bool *no_add_attrs)
8034 return handle_alias_ifunc_attribute (true, node, name, args, no_add_attrs);
8037 /* Handle a "weakref" attribute; arguments as in struct
8038 attribute_spec.handler. */
8041 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
8042 int flags, bool *no_add_attrs)
8044 tree attr = NULL_TREE;
8046 /* We must ignore the attribute when it is associated with
8047 local-scoped decls, since attribute alias is ignored and many
8048 such symbols do not even have a DECL_WEAK field. */
8049 if (decl_function_context (*node)
8050 || current_function_decl
8051 || !VAR_OR_FUNCTION_DECL_P (*node))
8053 warning (OPT_Wattributes, "%qE attribute ignored", name);
8054 *no_add_attrs = true;
8058 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node)))
8060 error ("indirect function %q+D cannot be declared weakref", *node);
8061 *no_add_attrs = true;
8065 /* The idea here is that `weakref("name")' mutates into `weakref,
8066 alias("name")', and weakref without arguments, in turn,
8067 implicitly adds weak. */
8071 attr = tree_cons (get_identifier ("alias"), args, attr);
8072 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
8074 *no_add_attrs = true;
8076 decl_attributes (node, attr, flags);
8080 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
8081 error_at (DECL_SOURCE_LOCATION (*node),
8082 "weakref attribute must appear before alias attribute");
8084 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8085 and that isn't supported; and because it wants to add it to
8086 the list of weak decls, which isn't helpful. */
8087 DECL_WEAK (*node) = 1;
8090 if (decl_in_symtab_p (*node))
8092 struct symtab_node *n = symtab_node::get (*node);
8093 if (n && n->refuse_visibility_changes)
8094 error ("%+D declared weakref after being used", *node);
8100 /* Handle an "visibility" attribute; arguments as in
8101 struct attribute_spec.handler. */
8104 handle_visibility_attribute (tree *node, tree name, tree args,
8105 int ARG_UNUSED (flags),
8106 bool *ARG_UNUSED (no_add_attrs))
8109 tree id = TREE_VALUE (args);
8110 enum symbol_visibility vis;
8114 if (TREE_CODE (*node) == ENUMERAL_TYPE)
8116 else if (!RECORD_OR_UNION_TYPE_P (*node))
8118 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
8122 else if (TYPE_FIELDS (*node))
8124 error ("%qE attribute ignored because %qT is already defined",
8129 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
8131 warning (OPT_Wattributes, "%qE attribute ignored", name);
8135 if (TREE_CODE (id) != STRING_CST)
8137 error ("visibility argument not a string");
8141 /* If this is a type, set the visibility on the type decl. */
8144 decl = TYPE_NAME (decl);
8147 if (TREE_CODE (decl) == IDENTIFIER_NODE)
8149 warning (OPT_Wattributes, "%qE attribute ignored on types",
8155 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
8156 vis = VISIBILITY_DEFAULT;
8157 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
8158 vis = VISIBILITY_INTERNAL;
8159 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
8160 vis = VISIBILITY_HIDDEN;
8161 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
8162 vis = VISIBILITY_PROTECTED;
8165 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8166 vis = VISIBILITY_DEFAULT;
8169 if (DECL_VISIBILITY_SPECIFIED (decl)
8170 && vis != DECL_VISIBILITY (decl))
8172 tree attributes = (TYPE_P (*node)
8173 ? TYPE_ATTRIBUTES (*node)
8174 : DECL_ATTRIBUTES (decl));
8175 if (lookup_attribute ("visibility", attributes))
8176 error ("%qD redeclared with different visibility", decl);
8177 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8178 && lookup_attribute ("dllimport", attributes))
8179 error ("%qD was declared %qs which implies default visibility",
8181 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8182 && lookup_attribute ("dllexport", attributes))
8183 error ("%qD was declared %qs which implies default visibility",
8187 DECL_VISIBILITY (decl) = vis;
8188 DECL_VISIBILITY_SPECIFIED (decl) = 1;
8190 /* Go ahead and attach the attribute to the node as well. This is needed
8191 so we can determine whether we have VISIBILITY_DEFAULT because the
8192 visibility was not specified, or because it was explicitly overridden
8193 from the containing scope. */
8198 /* Determine the ELF symbol visibility for DECL, which is either a
8199 variable or a function. It is an error to use this function if a
8200 definition of DECL is not available in this translation unit.
8201 Returns true if the final visibility has been determined by this
8202 function; false if the caller is free to make additional
8206 c_determine_visibility (tree decl)
8208 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
8210 /* If the user explicitly specified the visibility with an
8211 attribute, honor that. DECL_VISIBILITY will have been set during
8212 the processing of the attribute. We check for an explicit
8213 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8214 to distinguish the use of an attribute from the use of a "#pragma
8215 GCC visibility push(...)"; in the latter case we still want other
8216 considerations to be able to overrule the #pragma. */
8217 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl))
8218 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8219 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl))
8220 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))))
8223 /* Set default visibility to whatever the user supplied with
8224 visibility_specified depending on #pragma GCC visibility. */
8225 if (!DECL_VISIBILITY_SPECIFIED (decl))
8227 if (visibility_options.inpragma
8228 || DECL_VISIBILITY (decl) != default_visibility)
8230 DECL_VISIBILITY (decl) = default_visibility;
8231 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
8232 /* If visibility changed and DECL already has DECL_RTL, ensure
8233 symbol flags are updated. */
8234 if (((VAR_P (decl) && TREE_STATIC (decl))
8235 || TREE_CODE (decl) == FUNCTION_DECL)
8236 && DECL_RTL_SET_P (decl))
8237 make_decl_rtl (decl);
8243 /* Handle an "tls_model" attribute; arguments as in
8244 struct attribute_spec.handler. */
8247 handle_tls_model_attribute (tree *node, tree name, tree args,
8248 int ARG_UNUSED (flags), bool *no_add_attrs)
8252 enum tls_model kind;
8254 *no_add_attrs = true;
8256 if (!VAR_P (decl) || !DECL_THREAD_LOCAL_P (decl))
8258 warning (OPT_Wattributes, "%qE attribute ignored", name);
8262 kind = DECL_TLS_MODEL (decl);
8263 id = TREE_VALUE (args);
8264 if (TREE_CODE (id) != STRING_CST)
8266 error ("tls_model argument not a string");
8270 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
8271 kind = TLS_MODEL_LOCAL_EXEC;
8272 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
8273 kind = TLS_MODEL_INITIAL_EXEC;
8274 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
8275 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
8276 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
8277 kind = TLS_MODEL_GLOBAL_DYNAMIC;
8279 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8281 set_decl_tls_model (decl, kind);
8285 /* Handle a "no_instrument_function" attribute; arguments as in
8286 struct attribute_spec.handler. */
8289 handle_no_instrument_function_attribute (tree *node, tree name,
8290 tree ARG_UNUSED (args),
8291 int ARG_UNUSED (flags),
8296 if (TREE_CODE (decl) != FUNCTION_DECL)
8298 error_at (DECL_SOURCE_LOCATION (decl),
8299 "%qE attribute applies only to functions", name);
8300 *no_add_attrs = true;
8303 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
8308 /* Handle a "malloc" attribute; arguments as in
8309 struct attribute_spec.handler. */
8312 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8313 int ARG_UNUSED (flags), bool *no_add_attrs)
8315 if (TREE_CODE (*node) == FUNCTION_DECL
8316 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
8317 DECL_IS_MALLOC (*node) = 1;
8320 warning (OPT_Wattributes, "%qE attribute ignored", name);
8321 *no_add_attrs = true;
8327 /* Handle a "alloc_size" attribute; arguments as in
8328 struct attribute_spec.handler. */
8331 handle_alloc_size_attribute (tree *node, tree ARG_UNUSED (name), tree args,
8332 int ARG_UNUSED (flags), bool *no_add_attrs)
8334 unsigned arg_count = type_num_arguments (*node);
8335 for (; args; args = TREE_CHAIN (args))
8337 tree position = TREE_VALUE (args);
8338 if (position && TREE_CODE (position) != IDENTIFIER_NODE
8339 && TREE_CODE (position) != FUNCTION_DECL)
8340 position = default_conversion (position);
8342 if (!tree_fits_uhwi_p (position)
8344 || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
8346 warning (OPT_Wattributes,
8347 "alloc_size parameter outside range");
8348 *no_add_attrs = true;
8355 /* Handle a "alloc_align" attribute; arguments as in
8356 struct attribute_spec.handler. */
8359 handle_alloc_align_attribute (tree *node, tree, tree args, int,
8362 unsigned arg_count = type_num_arguments (*node);
8363 tree position = TREE_VALUE (args);
8364 if (position && TREE_CODE (position) != IDENTIFIER_NODE)
8365 position = default_conversion (position);
8367 if (!tree_fits_uhwi_p (position)
8369 || !IN_RANGE (tree_to_uhwi (position), 1, arg_count))
8371 warning (OPT_Wattributes,
8372 "alloc_align parameter outside range");
8373 *no_add_attrs = true;
8379 /* Handle a "assume_aligned" attribute; arguments as in
8380 struct attribute_spec.handler. */
8383 handle_assume_aligned_attribute (tree *, tree, tree args, int,
8386 for (; args; args = TREE_CHAIN (args))
8388 tree position = TREE_VALUE (args);
8389 if (position && TREE_CODE (position) != IDENTIFIER_NODE
8390 && TREE_CODE (position) != FUNCTION_DECL)
8391 position = default_conversion (position);
8393 if (TREE_CODE (position) != INTEGER_CST)
8395 warning (OPT_Wattributes,
8396 "assume_aligned parameter not integer constant");
8397 *no_add_attrs = true;
8404 /* Handle a "fn spec" attribute; arguments as in
8405 struct attribute_spec.handler. */
8408 handle_fnspec_attribute (tree *node ATTRIBUTE_UNUSED, tree ARG_UNUSED (name),
8409 tree args, int ARG_UNUSED (flags),
8410 bool *no_add_attrs ATTRIBUTE_UNUSED)
8413 && TREE_CODE (TREE_VALUE (args)) == STRING_CST
8414 && !TREE_CHAIN (args));
8418 /* Handle a "bnd_variable_size" attribute; arguments as in
8419 struct attribute_spec.handler. */
8422 handle_bnd_variable_size_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8423 int ARG_UNUSED (flags), bool *no_add_attrs)
8425 if (TREE_CODE (*node) != FIELD_DECL)
8427 warning (OPT_Wattributes, "%qE attribute ignored", name);
8428 *no_add_attrs = true;
8434 /* Handle a "bnd_legacy" attribute; arguments as in
8435 struct attribute_spec.handler. */
8438 handle_bnd_legacy (tree *node, tree name, tree ARG_UNUSED (args),
8439 int ARG_UNUSED (flags), bool *no_add_attrs)
8441 if (TREE_CODE (*node) != FUNCTION_DECL)
8443 warning (OPT_Wattributes, "%qE attribute ignored", name);
8444 *no_add_attrs = true;
8450 /* Handle a "bnd_instrument" attribute; arguments as in
8451 struct attribute_spec.handler. */
8454 handle_bnd_instrument (tree *node, tree name, tree ARG_UNUSED (args),
8455 int ARG_UNUSED (flags), bool *no_add_attrs)
8457 if (TREE_CODE (*node) != FUNCTION_DECL)
8459 warning (OPT_Wattributes, "%qE attribute ignored", name);
8460 *no_add_attrs = true;
8466 /* Handle a "warn_unused" attribute; arguments as in
8467 struct attribute_spec.handler. */
8470 handle_warn_unused_attribute (tree *node, tree name,
8471 tree args ATTRIBUTE_UNUSED,
8472 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
8475 /* Do nothing else, just set the attribute. We'll get at
8476 it later with lookup_attribute. */
8480 warning (OPT_Wattributes, "%qE attribute ignored", name);
8481 *no_add_attrs = true;
8487 /* Handle an "omp declare simd" attribute; arguments as in
8488 struct attribute_spec.handler. */
8491 handle_omp_declare_simd_attribute (tree *, tree, tree, int, bool *)
8496 /* Handle a "simd" attribute. */
8499 handle_simd_attribute (tree *node, tree name, tree args, int, bool *no_add_attrs)
8501 if (TREE_CODE (*node) == FUNCTION_DECL)
8503 if (lookup_attribute ("cilk simd function",
8504 DECL_ATTRIBUTES (*node)) != NULL)
8506 error_at (DECL_SOURCE_LOCATION (*node),
8507 "%<__simd__%> attribute cannot be used in the same "
8508 "function marked as a Cilk Plus SIMD-enabled function");
8509 *no_add_attrs = true;
8513 tree t = get_identifier ("omp declare simd");
8514 tree attr = NULL_TREE;
8517 tree id = TREE_VALUE (args);
8519 if (TREE_CODE (id) != STRING_CST)
8521 error ("attribute %qE argument not a string", name);
8522 *no_add_attrs = true;
8526 if (strcmp (TREE_STRING_POINTER (id), "notinbranch") == 0)
8527 attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
8528 OMP_CLAUSE_NOTINBRANCH);
8530 if (strcmp (TREE_STRING_POINTER (id), "inbranch") == 0)
8531 attr = build_omp_clause (DECL_SOURCE_LOCATION (*node),
8532 OMP_CLAUSE_INBRANCH);
8535 error ("only %<inbranch%> and %<notinbranch%> flags are "
8536 "allowed for %<__simd__%> attribute");
8537 *no_add_attrs = true;
8542 DECL_ATTRIBUTES (*node) = tree_cons (t,
8543 build_tree_list (NULL_TREE,
8545 DECL_ATTRIBUTES (*node));
8550 warning (OPT_Wattributes, "%qE attribute ignored", name);
8551 *no_add_attrs = true;
8557 /* Handle an "omp declare target" attribute; arguments as in
8558 struct attribute_spec.handler. */
8561 handle_omp_declare_target_attribute (tree *, tree, tree, int, bool *)
8566 /* Handle a "returns_twice" attribute; arguments as in
8567 struct attribute_spec.handler. */
8570 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8571 int ARG_UNUSED (flags), bool *no_add_attrs)
8573 if (TREE_CODE (*node) == FUNCTION_DECL)
8574 DECL_IS_RETURNS_TWICE (*node) = 1;
8577 warning (OPT_Wattributes, "%qE attribute ignored", name);
8578 *no_add_attrs = true;
8584 /* Handle a "no_limit_stack" attribute; arguments as in
8585 struct attribute_spec.handler. */
8588 handle_no_limit_stack_attribute (tree *node, tree name,
8589 tree ARG_UNUSED (args),
8590 int ARG_UNUSED (flags),
8595 if (TREE_CODE (decl) != FUNCTION_DECL)
8597 error_at (DECL_SOURCE_LOCATION (decl),
8598 "%qE attribute applies only to functions", name);
8599 *no_add_attrs = true;
8601 else if (DECL_INITIAL (decl))
8603 error_at (DECL_SOURCE_LOCATION (decl),
8604 "can%'t set %qE attribute after definition", name);
8605 *no_add_attrs = true;
8608 DECL_NO_LIMIT_STACK (decl) = 1;
8613 /* Handle a "pure" attribute; arguments as in
8614 struct attribute_spec.handler. */
8617 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
8618 int ARG_UNUSED (flags), bool *no_add_attrs)
8620 if (TREE_CODE (*node) == FUNCTION_DECL)
8621 DECL_PURE_P (*node) = 1;
8622 /* ??? TODO: Support types. */
8625 warning (OPT_Wattributes, "%qE attribute ignored", name);
8626 *no_add_attrs = true;
8632 /* Digest an attribute list destined for a transactional memory statement.
8633 ALLOWED is the set of attributes that are allowed for this statement;
8634 return the attribute we parsed. Multiple attributes are never allowed. */
8637 parse_tm_stmt_attr (tree attrs, int allowed)
8642 for ( ; attrs ; attrs = TREE_CHAIN (attrs))
8644 tree a = TREE_PURPOSE (attrs);
8647 if (is_attribute_p ("outer", a))
8648 m = TM_STMT_ATTR_OUTER;
8650 if ((m & allowed) == 0)
8652 warning (OPT_Wattributes, "%qE attribute directive ignored", a);
8661 else if (m_seen == m)
8662 warning (OPT_Wattributes, "%qE attribute duplicated", a);
8664 warning (OPT_Wattributes, "%qE attribute follows %qE", a, a_seen);
8670 /* Transform a TM attribute name into a maskable integer and back.
8671 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8672 to how the lack of an attribute is treated. */
8675 tm_attr_to_mask (tree attr)
8679 if (is_attribute_p ("transaction_safe", attr))
8680 return TM_ATTR_SAFE;
8681 if (is_attribute_p ("transaction_callable", attr))
8682 return TM_ATTR_CALLABLE;
8683 if (is_attribute_p ("transaction_pure", attr))
8684 return TM_ATTR_PURE;
8685 if (is_attribute_p ("transaction_unsafe", attr))
8686 return TM_ATTR_IRREVOCABLE;
8687 if (is_attribute_p ("transaction_may_cancel_outer", attr))
8688 return TM_ATTR_MAY_CANCEL_OUTER;
8693 tm_mask_to_attr (int mask)
8699 str = "transaction_safe";
8701 case TM_ATTR_CALLABLE:
8702 str = "transaction_callable";
8705 str = "transaction_pure";
8707 case TM_ATTR_IRREVOCABLE:
8708 str = "transaction_unsafe";
8710 case TM_ATTR_MAY_CANCEL_OUTER:
8711 str = "transaction_may_cancel_outer";
8716 return get_identifier (str);
8719 /* Return the first TM attribute seen in LIST. */
8722 find_tm_attribute (tree list)
8724 for (; list ; list = TREE_CHAIN (list))
8726 tree name = TREE_PURPOSE (list);
8727 if (tm_attr_to_mask (name) != 0)
8733 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8734 Here we accept only function types, and verify that none of the other
8735 function TM attributes are also applied. */
8736 /* ??? We need to accept class types for C++, but not C. This greatly
8737 complicates this function, since we can no longer rely on the extra
8738 processing given by function_type_required. */
8741 handle_tm_attribute (tree *node, tree name, tree args,
8742 int flags, bool *no_add_attrs)
8744 /* Only one path adds the attribute; others don't. */
8745 *no_add_attrs = true;
8747 switch (TREE_CODE (*node))
8751 /* Only tm_callable and tm_safe apply to classes. */
8752 if (tm_attr_to_mask (name) & ~(TM_ATTR_SAFE | TM_ATTR_CALLABLE))
8759 tree old_name = find_tm_attribute (TYPE_ATTRIBUTES (*node));
8760 if (old_name == name)
8762 else if (old_name != NULL_TREE)
8763 error ("type was previously declared %qE", old_name);
8765 *no_add_attrs = false;
8771 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8772 want to set transaction_safe on the type. */
8773 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name));
8774 if (!TYPE_P (DECL_CONTEXT (*node)))
8775 error_at (DECL_SOURCE_LOCATION (*node),
8776 "%<transaction_safe_dynamic%> may only be specified for "
8777 "a virtual function");
8778 *no_add_attrs = false;
8779 decl_attributes (&TREE_TYPE (*node),
8780 build_tree_list (get_identifier ("transaction_safe"),
8788 enum tree_code subcode = TREE_CODE (TREE_TYPE (*node));
8789 if (subcode == FUNCTION_TYPE || subcode == METHOD_TYPE)
8791 tree fn_tmp = TREE_TYPE (*node);
8792 decl_attributes (&fn_tmp, tree_cons (name, args, NULL), 0);
8793 *node = build_pointer_type (fn_tmp);
8800 /* If a function is next, pass it on to be tried next. */
8801 if (flags & (int) ATTR_FLAG_FUNCTION_NEXT)
8802 return tree_cons (name, args, NULL);
8805 warning (OPT_Wattributes, "%qE attribute ignored", name);
8812 /* Handle the TM_WRAP attribute; arguments as in
8813 struct attribute_spec.handler. */
8816 handle_tm_wrap_attribute (tree *node, tree name, tree args,
8817 int ARG_UNUSED (flags), bool *no_add_attrs)
8821 /* We don't need the attribute even on success, since we
8822 record the entry in an external table. */
8823 *no_add_attrs = true;
8825 if (TREE_CODE (decl) != FUNCTION_DECL)
8826 warning (OPT_Wattributes, "%qE attribute ignored", name);
8829 tree wrap_decl = TREE_VALUE (args);
8830 if (error_operand_p (wrap_decl))
8832 else if (TREE_CODE (wrap_decl) != IDENTIFIER_NODE
8833 && !VAR_OR_FUNCTION_DECL_P (wrap_decl))
8834 error ("%qE argument not an identifier", name);
8837 if (TREE_CODE (wrap_decl) == IDENTIFIER_NODE)
8838 wrap_decl = lookup_name (wrap_decl);
8839 if (wrap_decl && TREE_CODE (wrap_decl) == FUNCTION_DECL)
8841 if (lang_hooks.types_compatible_p (TREE_TYPE (decl),
8842 TREE_TYPE (wrap_decl)))
8843 record_tm_replacement (wrap_decl, decl);
8845 error ("%qD is not compatible with %qD", wrap_decl, decl);
8848 error ("%qE argument is not a function", name);
8855 /* Ignore the given attribute. Used when this attribute may be usefully
8856 overridden by the target, but is not used generically. */
8859 ignore_attribute (tree * ARG_UNUSED (node), tree ARG_UNUSED (name),
8860 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
8863 *no_add_attrs = true;
8867 /* Handle a "no vops" attribute; arguments as in
8868 struct attribute_spec.handler. */
8871 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
8872 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
8873 bool *ARG_UNUSED (no_add_attrs))
8875 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
8876 DECL_IS_NOVOPS (*node) = 1;
8880 /* Handle a "deprecated" attribute; arguments as in
8881 struct attribute_spec.handler. */
8884 handle_deprecated_attribute (tree *node, tree name,
8885 tree args, int flags,
8888 tree type = NULL_TREE;
8890 tree what = NULL_TREE;
8893 *no_add_attrs = true;
8894 else if (TREE_CODE (TREE_VALUE (args)) != STRING_CST)
8896 error ("deprecated message is not a string");
8897 *no_add_attrs = true;
8903 type = TREE_TYPE (decl);
8905 if (TREE_CODE (decl) == TYPE_DECL
8906 || TREE_CODE (decl) == PARM_DECL
8907 || VAR_OR_FUNCTION_DECL_P (decl)
8908 || TREE_CODE (decl) == FIELD_DECL
8909 || TREE_CODE (decl) == CONST_DECL
8910 || objc_method_decl (TREE_CODE (decl)))
8911 TREE_DEPRECATED (decl) = 1;
8915 else if (TYPE_P (*node))
8917 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
8918 *node = build_variant_type_copy (*node);
8919 TREE_DEPRECATED (*node) = 1;
8927 *no_add_attrs = true;
8928 if (type && TYPE_NAME (type))
8930 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
8931 what = TYPE_NAME (*node);
8932 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
8933 && DECL_NAME (TYPE_NAME (type)))
8934 what = DECL_NAME (TYPE_NAME (type));
8937 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
8939 warning (OPT_Wattributes, "%qE attribute ignored", name);
8945 /* Handle a "vector_size" attribute; arguments as in
8946 struct attribute_spec.handler. */
8949 handle_vector_size_attribute (tree *node, tree name, tree args,
8950 int ARG_UNUSED (flags),
8953 unsigned HOST_WIDE_INT vecsize, nunits;
8954 machine_mode orig_mode;
8955 tree type = *node, new_type, size;
8957 *no_add_attrs = true;
8959 size = TREE_VALUE (args);
8960 if (size && TREE_CODE (size) != IDENTIFIER_NODE
8961 && TREE_CODE (size) != FUNCTION_DECL)
8962 size = default_conversion (size);
8964 if (!tree_fits_uhwi_p (size))
8966 warning (OPT_Wattributes, "%qE attribute ignored", name);
8970 /* Get the vector size (in bytes). */
8971 vecsize = tree_to_uhwi (size);
8973 /* We need to provide for vector pointers, vector arrays, and
8974 functions returning vectors. For example:
8976 __attribute__((vector_size(16))) short *foo;
8978 In this case, the mode is SI, but the type being modified is
8979 HI, so we need to look further. */
8981 while (POINTER_TYPE_P (type)
8982 || TREE_CODE (type) == FUNCTION_TYPE
8983 || TREE_CODE (type) == METHOD_TYPE
8984 || TREE_CODE (type) == ARRAY_TYPE
8985 || TREE_CODE (type) == OFFSET_TYPE)
8986 type = TREE_TYPE (type);
8988 /* Get the mode of the type being modified. */
8989 orig_mode = TYPE_MODE (type);
8991 if ((!INTEGRAL_TYPE_P (type)
8992 && !SCALAR_FLOAT_TYPE_P (type)
8993 && !FIXED_POINT_TYPE_P (type))
8994 || (!SCALAR_FLOAT_MODE_P (orig_mode)
8995 && GET_MODE_CLASS (orig_mode) != MODE_INT
8996 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode))
8997 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type))
8998 || TREE_CODE (type) == BOOLEAN_TYPE)
9000 error ("invalid vector type for attribute %qE", name);
9004 if (vecsize % tree_to_uhwi (TYPE_SIZE_UNIT (type)))
9006 error ("vector size not an integral multiple of component size");
9012 error ("zero vector size");
9016 /* Calculate how many units fit in the vector. */
9017 nunits = vecsize / tree_to_uhwi (TYPE_SIZE_UNIT (type));
9018 if (nunits & (nunits - 1))
9020 error ("number of components of the vector not a power of two");
9024 new_type = build_vector_type (type, nunits);
9026 /* Build back pointers if needed. */
9027 *node = lang_hooks.types.reconstruct_complex_type (*node, new_type);
9032 /* Handle the "nonnull" attribute. */
9034 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
9035 tree args, int ARG_UNUSED (flags),
9039 unsigned HOST_WIDE_INT attr_arg_num;
9041 /* If no arguments are specified, all pointer arguments should be
9042 non-null. Verify a full prototype is given so that the arguments
9043 will have the correct types when we actually check them later.
9044 Avoid diagnosing type-generic built-ins since those have no
9048 if (!prototype_p (type)
9049 && (!TYPE_ATTRIBUTES (type)
9050 || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type))))
9052 error ("nonnull attribute without arguments on a non-prototype");
9053 *no_add_attrs = true;
9058 /* Argument list specified. Verify that each argument number references
9059 a pointer argument. */
9060 for (attr_arg_num = 1; args; attr_arg_num++, args = TREE_CHAIN (args))
9062 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
9064 tree arg = TREE_VALUE (args);
9065 if (arg && TREE_CODE (arg) != IDENTIFIER_NODE
9066 && TREE_CODE (arg) != FUNCTION_DECL)
9067 arg = default_conversion (arg);
9069 if (!get_nonnull_operand (arg, &arg_num))
9071 error ("nonnull argument has invalid operand number (argument %lu)",
9072 (unsigned long) attr_arg_num);
9073 *no_add_attrs = true;
9077 if (prototype_p (type))
9079 function_args_iterator iter;
9082 function_args_iter_init (&iter, type);
9083 for (ck_num = 1; ; ck_num++, function_args_iter_next (&iter))
9085 argument = function_args_iter_cond (&iter);
9086 if (argument == NULL_TREE || ck_num == arg_num)
9091 || TREE_CODE (argument) == VOID_TYPE)
9093 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
9094 (unsigned long) attr_arg_num, (unsigned long) arg_num);
9095 *no_add_attrs = true;
9099 if (TREE_CODE (argument) != POINTER_TYPE)
9101 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
9102 (unsigned long) attr_arg_num, (unsigned long) arg_num);
9103 *no_add_attrs = true;
9112 /* Check the argument list of a function call for null in argument slots
9113 that are marked as requiring a non-null pointer argument. The NARGS
9114 arguments are passed in the array ARGARRAY. */
9117 check_function_nonnull (location_t loc, tree attrs, int nargs, tree *argarray)
9122 attrs = lookup_attribute ("nonnull", attrs);
9123 if (attrs == NULL_TREE)
9127 /* See if any of the nonnull attributes has no arguments. If so,
9128 then every pointer argument is checked (in which case the check
9129 for pointer type is done in check_nonnull_arg). */
9130 if (TREE_VALUE (a) != NULL_TREE)
9132 a = lookup_attribute ("nonnull", TREE_CHAIN (a));
9133 while (a != NULL_TREE && TREE_VALUE (a) != NULL_TREE);
9136 for (i = 0; i < nargs; i++)
9137 check_function_arguments_recurse (check_nonnull_arg, &loc, argarray[i],
9141 /* Walk the argument list. If we encounter an argument number we
9142 should check for non-null, do it. */
9143 for (i = 0; i < nargs; i++)
9145 for (a = attrs; ; a = TREE_CHAIN (a))
9147 a = lookup_attribute ("nonnull", a);
9148 if (a == NULL_TREE || nonnull_check_p (TREE_VALUE (a), i + 1))
9153 check_function_arguments_recurse (check_nonnull_arg, &loc,
9154 argarray[i], i + 1);
9159 /* Check that the Nth argument of a function call (counting backwards
9160 from the end) is a (pointer)0. The NARGS arguments are passed in the
9164 check_function_sentinel (const_tree fntype, int nargs, tree *argarray)
9166 tree attr = lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype));
9173 function_args_iterator iter;
9176 /* Skip over the named arguments. */
9177 FOREACH_FUNCTION_ARGS (fntype, t, iter)
9184 if (TREE_VALUE (attr))
9186 tree p = TREE_VALUE (TREE_VALUE (attr));
9187 pos = TREE_INT_CST_LOW (p);
9190 /* The sentinel must be one of the varargs, i.e.
9191 in position >= the number of fixed arguments. */
9192 if ((nargs - 1 - pos) < len)
9194 warning (OPT_Wformat_,
9195 "not enough variable arguments to fit a sentinel");
9199 /* Validate the sentinel. */
9200 sentinel = argarray[nargs - 1 - pos];
9201 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
9202 || !integer_zerop (sentinel))
9203 /* Although __null (in C++) is only an integer we allow it
9204 nevertheless, as we are guaranteed that it's exactly
9205 as wide as a pointer, and we don't want to force
9206 users to cast the NULL they have written there.
9207 We warn with -Wstrict-null-sentinel, though. */
9208 && (warn_strict_null_sentinel || null_node != sentinel))
9209 warning (OPT_Wformat_, "missing sentinel in function call");
9213 /* Helper for check_function_nonnull; given a list of operands which
9214 must be non-null in ARGS, determine if operand PARAM_NUM should be
9218 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
9220 unsigned HOST_WIDE_INT arg_num = 0;
9222 for (; args; args = TREE_CHAIN (args))
9224 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
9228 if (arg_num == param_num)
9234 /* Check that the function argument PARAM (which is operand number
9235 PARAM_NUM) is non-null. This is called by check_function_nonnull
9236 via check_function_arguments_recurse. */
9239 check_nonnull_arg (void *ctx, tree param, unsigned HOST_WIDE_INT param_num)
9241 location_t *ploc = (location_t *) ctx;
9243 /* Just skip checking the argument if it's not a pointer. This can
9244 happen if the "nonnull" attribute was given without an operand
9245 list (which means to check every pointer argument). */
9247 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
9250 if (integer_zerop (param))
9251 warning_at (*ploc, OPT_Wnonnull, "null argument where non-null required "
9252 "(argument %lu)", (unsigned long) param_num);
9255 /* Helper for nonnull attribute handling; fetch the operand number
9256 from the attribute argument list. */
9259 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
9261 /* Verify the arg number is a small constant. */
9262 if (tree_fits_uhwi_p (arg_num_expr))
9264 *valp = TREE_INT_CST_LOW (arg_num_expr);
9271 /* Handle a "nothrow" attribute; arguments as in
9272 struct attribute_spec.handler. */
9275 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
9276 int ARG_UNUSED (flags), bool *no_add_attrs)
9278 if (TREE_CODE (*node) == FUNCTION_DECL)
9279 TREE_NOTHROW (*node) = 1;
9280 /* ??? TODO: Support types. */
9283 warning (OPT_Wattributes, "%qE attribute ignored", name);
9284 *no_add_attrs = true;
9290 /* Handle a "cleanup" attribute; arguments as in
9291 struct attribute_spec.handler. */
9294 handle_cleanup_attribute (tree *node, tree name, tree args,
9295 int ARG_UNUSED (flags), bool *no_add_attrs)
9298 tree cleanup_id, cleanup_decl;
9300 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9301 for global destructors in C++. This requires infrastructure that
9302 we don't have generically at the moment. It's also not a feature
9303 we'd be missing too much, since we do have attribute constructor. */
9304 if (!VAR_P (decl) || TREE_STATIC (decl))
9306 warning (OPT_Wattributes, "%qE attribute ignored", name);
9307 *no_add_attrs = true;
9311 /* Verify that the argument is a function in scope. */
9312 /* ??? We could support pointers to functions here as well, if
9313 that was considered desirable. */
9314 cleanup_id = TREE_VALUE (args);
9315 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
9317 error ("cleanup argument not an identifier");
9318 *no_add_attrs = true;
9321 cleanup_decl = lookup_name (cleanup_id);
9322 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
9324 error ("cleanup argument not a function");
9325 *no_add_attrs = true;
9329 /* That the function has proper type is checked with the
9330 eventual call to build_function_call. */
9335 /* Handle a "warn_unused_result" attribute. No special handling. */
9338 handle_warn_unused_result_attribute (tree *node, tree name,
9339 tree ARG_UNUSED (args),
9340 int ARG_UNUSED (flags), bool *no_add_attrs)
9342 /* Ignore the attribute for functions not returning any value. */
9343 if (VOID_TYPE_P (TREE_TYPE (*node)))
9345 warning (OPT_Wattributes, "%qE attribute ignored", name);
9346 *no_add_attrs = true;
9352 /* Handle a "sentinel" attribute. */
9355 handle_sentinel_attribute (tree *node, tree name, tree args,
9356 int ARG_UNUSED (flags), bool *no_add_attrs)
9358 if (!prototype_p (*node))
9360 warning (OPT_Wattributes,
9361 "%qE attribute requires prototypes with named arguments", name);
9362 *no_add_attrs = true;
9366 if (!stdarg_p (*node))
9368 warning (OPT_Wattributes,
9369 "%qE attribute only applies to variadic functions", name);
9370 *no_add_attrs = true;
9376 tree position = TREE_VALUE (args);
9377 if (position && TREE_CODE (position) != IDENTIFIER_NODE
9378 && TREE_CODE (position) != FUNCTION_DECL)
9379 position = default_conversion (position);
9381 if (TREE_CODE (position) != INTEGER_CST
9382 || !INTEGRAL_TYPE_P (TREE_TYPE (position)))
9384 warning (OPT_Wattributes,
9385 "requested position is not an integer constant");
9386 *no_add_attrs = true;
9390 if (tree_int_cst_lt (position, integer_zero_node))
9392 warning (OPT_Wattributes,
9393 "requested position is less than zero");
9394 *no_add_attrs = true;
9402 /* Handle a "type_generic" attribute. */
9405 handle_type_generic_attribute (tree *node, tree ARG_UNUSED (name),
9406 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
9407 bool * ARG_UNUSED (no_add_attrs))
9409 /* Ensure we have a function type. */
9410 gcc_assert (TREE_CODE (*node) == FUNCTION_TYPE);
9412 /* Ensure we have a variadic function. */
9413 gcc_assert (!prototype_p (*node) || stdarg_p (*node));
9418 /* Handle a "target" attribute. */
9421 handle_target_attribute (tree *node, tree name, tree args, int flags,
9424 /* Ensure we have a function type. */
9425 if (TREE_CODE (*node) != FUNCTION_DECL)
9427 warning (OPT_Wattributes, "%qE attribute ignored", name);
9428 *no_add_attrs = true;
9430 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node)))
9432 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9433 "with %qs attribute", name, "target_clones");
9434 *no_add_attrs = true;
9436 else if (! targetm.target_option.valid_attribute_p (*node, name, args,
9438 *no_add_attrs = true;
9443 /* Handle a "target_clones" attribute. */
9446 handle_target_clones_attribute (tree *node, tree name, tree ARG_UNUSED (args),
9447 int ARG_UNUSED (flags), bool *no_add_attrs)
9449 /* Ensure we have a function type. */
9450 if (TREE_CODE (*node) == FUNCTION_DECL)
9452 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node)))
9454 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9455 "with %qs attribute", name, "always_inline");
9456 *no_add_attrs = true;
9458 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node)))
9460 warning (OPT_Wattributes, "%qE attribute ignored due to conflict "
9461 "with %qs attribute", name, "target");
9462 *no_add_attrs = true;
9465 /* Do not inline functions with multiple clone targets. */
9466 DECL_UNINLINABLE (*node) = 1;
9470 warning (OPT_Wattributes, "%qE attribute ignored", name);
9471 *no_add_attrs = true;
9476 /* Arguments being collected for optimization. */
9477 typedef const char *const_char_p; /* For DEF_VEC_P. */
9478 static GTY(()) vec<const_char_p, va_gc> *optimize_args;
9481 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9482 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9483 false for #pragma GCC optimize. */
9486 parse_optimize_options (tree args, bool attr_p)
9491 const char **opt_argv;
9492 struct cl_decoded_option *decoded_options;
9493 unsigned int decoded_options_count;
9496 /* Build up argv vector. Just in case the string is stored away, use garbage
9497 collected strings. */
9498 vec_safe_truncate (optimize_args, 0);
9499 vec_safe_push (optimize_args, (const char *) NULL);
9501 for (ap = args; ap != NULL_TREE; ap = TREE_CHAIN (ap))
9503 tree value = TREE_VALUE (ap);
9505 if (TREE_CODE (value) == INTEGER_CST)
9508 sprintf (buffer, "-O%ld", (long) TREE_INT_CST_LOW (value));
9509 vec_safe_push (optimize_args, ggc_strdup (buffer));
9512 else if (TREE_CODE (value) == STRING_CST)
9514 /* Split string into multiple substrings. */
9515 size_t len = TREE_STRING_LENGTH (value);
9516 char *p = ASTRDUP (TREE_STRING_POINTER (value));
9517 char *end = p + len;
9521 while (next_p != NULL)
9527 comma = strchr (p, ',');
9540 r = q = (char *) ggc_alloc_atomic (len2 + 3);
9542 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9544 if (*p == '-' && p[1] != 'O' && p[1] != 'f')
9548 warning (OPT_Wattributes,
9549 "bad option %qs to attribute %<optimize%>", p);
9551 warning (OPT_Wpragmas,
9552 "bad option %qs to pragma %<optimize%>", p);
9560 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9561 itself is -Os, and any other switch begins with a -f. */
9562 if ((*p >= '0' && *p <= '9')
9563 || (p[0] == 's' && p[1] == '\0'))
9569 memcpy (r, p, len2);
9571 vec_safe_push (optimize_args, (const char *) q);
9577 opt_argc = optimize_args->length ();
9578 opt_argv = (const char **) alloca (sizeof (char *) * (opt_argc + 1));
9580 for (i = 1; i < opt_argc; i++)
9581 opt_argv[i] = (*optimize_args)[i];
9583 /* Now parse the options. */
9584 decode_cmdline_options_to_array_default_mask (opt_argc, opt_argv,
9586 &decoded_options_count);
9587 /* Drop non-Optimization options. */
9589 for (i = 1; i < decoded_options_count; ++i)
9591 if (! (cl_options[decoded_options[i].opt_index].flags & CL_OPTIMIZATION))
9595 warning (OPT_Wattributes,
9596 "bad option %qs to attribute %<optimize%>",
9597 decoded_options[i].orig_option_with_args_text);
9599 warning (OPT_Wpragmas,
9600 "bad option %qs to pragma %<optimize%>",
9601 decoded_options[i].orig_option_with_args_text);
9605 decoded_options[j] = decoded_options[i];
9608 decoded_options_count = j;
9609 /* And apply them. */
9610 decode_options (&global_options, &global_options_set,
9611 decoded_options, decoded_options_count,
9612 input_location, global_dc);
9614 targetm.override_options_after_change();
9616 optimize_args->truncate (0);
9620 /* For handling "optimize" attribute. arguments as in
9621 struct attribute_spec.handler. */
9624 handle_optimize_attribute (tree *node, tree name, tree args,
9625 int ARG_UNUSED (flags), bool *no_add_attrs)
9627 /* Ensure we have a function type. */
9628 if (TREE_CODE (*node) != FUNCTION_DECL)
9630 warning (OPT_Wattributes, "%qE attribute ignored", name);
9631 *no_add_attrs = true;
9635 struct cl_optimization cur_opts;
9636 tree old_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node);
9638 /* Save current options. */
9639 cl_optimization_save (&cur_opts, &global_options);
9641 /* If we previously had some optimization options, use them as the
9644 cl_optimization_restore (&global_options,
9645 TREE_OPTIMIZATION (old_opts));
9647 /* Parse options, and update the vector. */
9648 parse_optimize_options (args, true);
9649 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node)
9650 = build_optimization_node (&global_options);
9652 /* Restore current options. */
9653 cl_optimization_restore (&global_options, &cur_opts);
9659 /* Handle a "no_split_stack" attribute. */
9662 handle_no_split_stack_attribute (tree *node, tree name,
9663 tree ARG_UNUSED (args),
9664 int ARG_UNUSED (flags),
9669 if (TREE_CODE (decl) != FUNCTION_DECL)
9671 error_at (DECL_SOURCE_LOCATION (decl),
9672 "%qE attribute applies only to functions", name);
9673 *no_add_attrs = true;
9675 else if (DECL_INITIAL (decl))
9677 error_at (DECL_SOURCE_LOCATION (decl),
9678 "can%'t set %qE attribute after definition", name);
9679 *no_add_attrs = true;
9685 /* Handle a "returns_nonnull" attribute; arguments as in
9686 struct attribute_spec.handler. */
9689 handle_returns_nonnull_attribute (tree *node, tree, tree, int,
9692 // Even without a prototype we still have a return type we can check.
9693 if (TREE_CODE (TREE_TYPE (*node)) != POINTER_TYPE)
9695 error ("returns_nonnull attribute on a function not returning a pointer");
9696 *no_add_attrs = true;
9701 /* Handle a "designated_init" attribute; arguments as in
9702 struct attribute_spec.handler. */
9705 handle_designated_init_attribute (tree *node, tree name, tree, int,
9708 if (TREE_CODE (*node) != RECORD_TYPE)
9710 error ("%qE attribute is only valid on %<struct%> type", name);
9711 *no_add_attrs = true;
9717 /* Check for valid arguments being passed to a function with FNTYPE.
9718 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9721 check_function_arguments (location_t loc, const_tree fntype, int nargs,
9724 /* Check for null being passed in a pointer argument that must be
9725 non-null. We also need to do this if format checking is enabled. */
9728 check_function_nonnull (loc, TYPE_ATTRIBUTES (fntype), nargs, argarray);
9730 /* Check for errors in format strings. */
9732 if (warn_format || warn_suggest_attribute_format)
9733 check_function_format (TYPE_ATTRIBUTES (fntype), nargs, argarray);
9736 check_function_sentinel (fntype, nargs, argarray);
9739 /* Generic argument checking recursion routine. PARAM is the argument to
9740 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9741 once the argument is resolved. CTX is context for the callback. */
9743 check_function_arguments_recurse (void (*callback)
9744 (void *, tree, unsigned HOST_WIDE_INT),
9745 void *ctx, tree param,
9746 unsigned HOST_WIDE_INT param_num)
9748 if (CONVERT_EXPR_P (param)
9749 && (TYPE_PRECISION (TREE_TYPE (param))
9750 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
9752 /* Strip coercion. */
9753 check_function_arguments_recurse (callback, ctx,
9754 TREE_OPERAND (param, 0), param_num);
9758 if (TREE_CODE (param) == CALL_EXPR)
9760 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
9762 bool found_format_arg = false;
9764 /* See if this is a call to a known internationalization function
9765 that modifies a format arg. Such a function may have multiple
9766 format_arg attributes (for example, ngettext). */
9768 for (attrs = TYPE_ATTRIBUTES (type);
9770 attrs = TREE_CHAIN (attrs))
9771 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
9774 tree format_num_expr;
9777 call_expr_arg_iterator iter;
9779 /* Extract the argument number, which was previously checked
9781 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
9783 format_num = tree_to_uhwi (format_num_expr);
9785 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
9787 inner_arg = next_call_expr_arg (&iter), i++)
9788 if (i == format_num)
9790 check_function_arguments_recurse (callback, ctx,
9791 inner_arg, param_num);
9792 found_format_arg = true;
9797 /* If we found a format_arg attribute and did a recursive check,
9798 we are done with checking this argument. Otherwise, we continue
9799 and this will be considered a non-literal. */
9800 if (found_format_arg)
9804 if (TREE_CODE (param) == COND_EXPR)
9806 /* Simplify to avoid warning for an impossible case. */
9807 param = fold_for_warn (param);
9808 if (TREE_CODE (param) == COND_EXPR)
9810 /* Check both halves of the conditional expression. */
9811 check_function_arguments_recurse (callback, ctx,
9812 TREE_OPERAND (param, 1),
9814 check_function_arguments_recurse (callback, ctx,
9815 TREE_OPERAND (param, 2),
9821 (*callback) (ctx, param, param_num);
9824 /* Checks for a builtin function FNDECL that the number of arguments
9825 NARGS against the required number REQUIRED and issues an error if
9826 there is a mismatch. Returns true if the number of arguments is
9827 correct, otherwise false. LOC is the location of FNDECL. */
9830 builtin_function_validate_nargs (location_t loc, tree fndecl, int nargs,
9833 if (nargs < required)
9835 error_at (loc, "too few arguments to function %qE", fndecl);
9838 else if (nargs > required)
9840 error_at (loc, "too many arguments to function %qE", fndecl);
9846 /* Helper macro for check_builtin_function_arguments. */
9847 #define ARG_LOCATION(N) \
9848 (arg_loc.is_empty () \
9849 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
9850 : expansion_point_location (arg_loc[(N)]))
9852 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9853 Returns false if there was an error, otherwise true. LOC is the
9854 location of the function; ARG_LOC is a vector of locations of the
9858 check_builtin_function_arguments (location_t loc, vec<location_t> arg_loc,
9859 tree fndecl, int nargs, tree *args)
9861 if (!DECL_BUILT_IN (fndecl)
9862 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
9865 switch (DECL_FUNCTION_CODE (fndecl))
9867 case BUILT_IN_ALLOCA_WITH_ALIGN:
9869 /* Get the requested alignment (in bits) if it's a constant
9870 integer expression. */
9871 unsigned HOST_WIDE_INT align
9872 = tree_fits_uhwi_p (args[1]) ? tree_to_uhwi (args[1]) : 0;
9874 /* Determine if the requested alignment is a power of 2. */
9875 if ((align & (align - 1)))
9878 /* The maximum alignment in bits corresponding to the same
9879 maximum in bytes enforced in check_user_alignment(). */
9880 unsigned maxalign = (UINT_MAX >> 1) + 1;
9882 /* Reject invalid alignments. */
9883 if (align < BITS_PER_UNIT || maxalign < align)
9885 error_at (ARG_LOCATION (1),
9886 "second argument to function %qE must be a constant "
9887 "integer power of 2 between %qi and %qu bits",
9888 fndecl, BITS_PER_UNIT, maxalign);
9894 case BUILT_IN_CONSTANT_P:
9895 return builtin_function_validate_nargs (loc, fndecl, nargs, 1);
9897 case BUILT_IN_ISFINITE:
9898 case BUILT_IN_ISINF:
9899 case BUILT_IN_ISINF_SIGN:
9900 case BUILT_IN_ISNAN:
9901 case BUILT_IN_ISNORMAL:
9902 case BUILT_IN_SIGNBIT:
9903 if (builtin_function_validate_nargs (loc, fndecl, nargs, 1))
9905 if (TREE_CODE (TREE_TYPE (args[0])) != REAL_TYPE)
9907 error_at (ARG_LOCATION (0), "non-floating-point argument in "
9908 "call to function %qE", fndecl);
9915 case BUILT_IN_ISGREATER:
9916 case BUILT_IN_ISGREATEREQUAL:
9917 case BUILT_IN_ISLESS:
9918 case BUILT_IN_ISLESSEQUAL:
9919 case BUILT_IN_ISLESSGREATER:
9920 case BUILT_IN_ISUNORDERED:
9921 if (builtin_function_validate_nargs (loc, fndecl, nargs, 2))
9923 enum tree_code code0, code1;
9924 code0 = TREE_CODE (TREE_TYPE (args[0]));
9925 code1 = TREE_CODE (TREE_TYPE (args[1]));
9926 if (!((code0 == REAL_TYPE && code1 == REAL_TYPE)
9927 || (code0 == REAL_TYPE && code1 == INTEGER_TYPE)
9928 || (code0 == INTEGER_TYPE && code1 == REAL_TYPE)))
9930 error_at (loc, "non-floating-point arguments in call to "
9931 "function %qE", fndecl);
9938 case BUILT_IN_FPCLASSIFY:
9939 if (builtin_function_validate_nargs (loc, fndecl, nargs, 6))
9941 for (unsigned int i = 0; i < 5; i++)
9942 if (TREE_CODE (args[i]) != INTEGER_CST)
9944 error_at (ARG_LOCATION (i), "non-const integer argument %u in "
9945 "call to function %qE", i + 1, fndecl);
9949 if (TREE_CODE (TREE_TYPE (args[5])) != REAL_TYPE)
9951 error_at (ARG_LOCATION (5), "non-floating-point argument in "
9952 "call to function %qE", fndecl);
9959 case BUILT_IN_ASSUME_ALIGNED:
9960 if (builtin_function_validate_nargs (loc, fndecl, nargs, 2 + (nargs > 2)))
9962 if (nargs >= 3 && TREE_CODE (TREE_TYPE (args[2])) != INTEGER_TYPE)
9964 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
9965 "function %qE", fndecl);
9972 case BUILT_IN_ADD_OVERFLOW:
9973 case BUILT_IN_SUB_OVERFLOW:
9974 case BUILT_IN_MUL_OVERFLOW:
9975 if (builtin_function_validate_nargs (loc, fndecl, nargs, 3))
9978 for (i = 0; i < 2; i++)
9979 if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i])))
9981 error_at (ARG_LOCATION (i), "argument %u in call to function "
9982 "%qE does not have integral type", i + 1, fndecl);
9985 if (TREE_CODE (TREE_TYPE (args[2])) != POINTER_TYPE
9986 || TREE_CODE (TREE_TYPE (TREE_TYPE (args[2]))) != INTEGER_TYPE)
9988 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
9989 "does not have pointer to integer type", fndecl);
9996 case BUILT_IN_ADD_OVERFLOW_P:
9997 case BUILT_IN_SUB_OVERFLOW_P:
9998 case BUILT_IN_MUL_OVERFLOW_P:
9999 if (builtin_function_validate_nargs (loc, fndecl, nargs, 3))
10002 for (i = 0; i < 3; i++)
10003 if (!INTEGRAL_TYPE_P (TREE_TYPE (args[i])))
10005 error_at (ARG_LOCATION (i), "argument %u in call to function "
10006 "%qE does not have integral type", i + 1, fndecl);
10018 /* Function to help qsort sort FIELD_DECLs by name order. */
10021 field_decl_cmp (const void *x_p, const void *y_p)
10023 const tree *const x = (const tree *const) x_p;
10024 const tree *const y = (const tree *const) y_p;
10026 if (DECL_NAME (*x) == DECL_NAME (*y))
10027 /* A nontype is "greater" than a type. */
10028 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
10029 if (DECL_NAME (*x) == NULL_TREE)
10031 if (DECL_NAME (*y) == NULL_TREE)
10033 if (DECL_NAME (*x) < DECL_NAME (*y))
10039 gt_pointer_operator new_value;
10043 /* This routine compares two fields like field_decl_cmp but using the
10044 pointer operator in resort_data. */
10047 resort_field_decl_cmp (const void *x_p, const void *y_p)
10049 const tree *const x = (const tree *const) x_p;
10050 const tree *const y = (const tree *const) y_p;
10052 if (DECL_NAME (*x) == DECL_NAME (*y))
10053 /* A nontype is "greater" than a type. */
10054 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
10055 if (DECL_NAME (*x) == NULL_TREE)
10057 if (DECL_NAME (*y) == NULL_TREE)
10060 tree d1 = DECL_NAME (*x);
10061 tree d2 = DECL_NAME (*y);
10062 resort_data.new_value (&d1, resort_data.cookie);
10063 resort_data.new_value (&d2, resort_data.cookie);
10070 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10073 resort_sorted_fields (void *obj,
10074 void * ARG_UNUSED (orig_obj),
10075 gt_pointer_operator new_value,
10078 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
10079 resort_data.new_value = new_value;
10080 resort_data.cookie = cookie;
10081 qsort (&sf->elts[0], sf->len, sizeof (tree),
10082 resort_field_decl_cmp);
10085 /* Subroutine of c_parse_error.
10086 Return the result of concatenating LHS and RHS. RHS is really
10087 a string literal, its first character is indicated by RHS_START and
10088 RHS_SIZE is its length (including the terminating NUL character).
10090 The caller is responsible for deleting the returned pointer. */
10093 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
10095 const int lhs_size = strlen (lhs);
10096 char *result = XNEWVEC (char, lhs_size + rhs_size);
10097 strncpy (result, lhs, lhs_size);
10098 strncpy (result + lhs_size, rhs_start, rhs_size);
10102 /* Issue the error given by GMSGID, indicating that it occurred before
10103 TOKEN, which had the associated VALUE. */
10106 c_parse_error (const char *gmsgid, enum cpp_ttype token_type,
10107 tree value, unsigned char token_flags)
10109 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10111 char *message = NULL;
10113 if (token_type == CPP_EOF)
10114 message = catenate_messages (gmsgid, " at end of input");
10115 else if (token_type == CPP_CHAR
10116 || token_type == CPP_WCHAR
10117 || token_type == CPP_CHAR16
10118 || token_type == CPP_CHAR32
10119 || token_type == CPP_UTF8CHAR)
10121 unsigned int val = TREE_INT_CST_LOW (value);
10122 const char *prefix;
10124 switch (token_type)
10143 if (val <= UCHAR_MAX && ISGRAPH (val))
10144 message = catenate_messages (gmsgid, " before %s'%c'");
10146 message = catenate_messages (gmsgid, " before %s'\\x%x'");
10148 error (message, prefix, val);
10152 else if (token_type == CPP_CHAR_USERDEF
10153 || token_type == CPP_WCHAR_USERDEF
10154 || token_type == CPP_CHAR16_USERDEF
10155 || token_type == CPP_CHAR32_USERDEF
10156 || token_type == CPP_UTF8CHAR_USERDEF)
10157 message = catenate_messages (gmsgid,
10158 " before user-defined character literal");
10159 else if (token_type == CPP_STRING_USERDEF
10160 || token_type == CPP_WSTRING_USERDEF
10161 || token_type == CPP_STRING16_USERDEF
10162 || token_type == CPP_STRING32_USERDEF
10163 || token_type == CPP_UTF8STRING_USERDEF)
10164 message = catenate_messages (gmsgid, " before user-defined string literal");
10165 else if (token_type == CPP_STRING
10166 || token_type == CPP_WSTRING
10167 || token_type == CPP_STRING16
10168 || token_type == CPP_STRING32
10169 || token_type == CPP_UTF8STRING)
10170 message = catenate_messages (gmsgid, " before string constant");
10171 else if (token_type == CPP_NUMBER)
10172 message = catenate_messages (gmsgid, " before numeric constant");
10173 else if (token_type == CPP_NAME)
10175 message = catenate_messages (gmsgid, " before %qE");
10176 error (message, value);
10180 else if (token_type == CPP_PRAGMA)
10181 message = catenate_messages (gmsgid, " before %<#pragma%>");
10182 else if (token_type == CPP_PRAGMA_EOL)
10183 message = catenate_messages (gmsgid, " before end of line");
10184 else if (token_type == CPP_DECLTYPE)
10185 message = catenate_messages (gmsgid, " before %<decltype%>");
10186 else if (token_type < N_TTYPES)
10188 message = catenate_messages (gmsgid, " before %qs token");
10189 error (message, cpp_type2name (token_type, token_flags));
10201 #undef catenate_messages
10204 /* Return the gcc option code associated with the reason for a cpp
10205 message, or 0 if none. */
10208 c_option_controlling_cpp_error (int reason)
10210 const struct cpp_reason_option_codes_t *entry;
10212 for (entry = cpp_reason_option_codes; entry->reason != CPP_W_NONE; entry++)
10214 if (entry->reason == reason)
10215 return entry->option_code;
10220 /* Callback from cpp_error for PFILE to print diagnostics from the
10221 preprocessor. The diagnostic is of type LEVEL, with REASON set
10222 to the reason code if LEVEL is represents a warning, at location
10223 RICHLOC unless this is after lexing and the compiler's location
10224 should be used instead; MSG is the translated message and AP
10225 the arguments. Returns true if a diagnostic was emitted, false
10229 c_cpp_error (cpp_reader *pfile ATTRIBUTE_UNUSED, int level, int reason,
10230 rich_location *richloc,
10231 const char *msg, va_list *ap)
10233 diagnostic_info diagnostic;
10234 diagnostic_t dlevel;
10235 bool save_warn_system_headers = global_dc->dc_warn_system_headers;
10240 case CPP_DL_WARNING_SYSHDR:
10241 if (flag_no_output)
10243 global_dc->dc_warn_system_headers = 1;
10244 /* Fall through. */
10245 case CPP_DL_WARNING:
10246 if (flag_no_output)
10248 dlevel = DK_WARNING;
10250 case CPP_DL_PEDWARN:
10251 if (flag_no_output && !flag_pedantic_errors)
10253 dlevel = DK_PEDWARN;
10268 gcc_unreachable ();
10271 richloc->set_range (line_table, 0, input_location, true);
10272 diagnostic_set_info_translated (&diagnostic, msg, ap,
10274 diagnostic_override_option_index (&diagnostic,
10275 c_option_controlling_cpp_error (reason));
10276 ret = report_diagnostic (&diagnostic);
10277 if (level == CPP_DL_WARNING_SYSHDR)
10278 global_dc->dc_warn_system_headers = save_warn_system_headers;
10282 /* Convert a character from the host to the target execution character
10283 set. cpplib handles this, mostly. */
10286 c_common_to_target_charset (HOST_WIDE_INT c)
10288 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10289 zero-extended under -fno-signed-char. cpplib insists that characters
10290 and character constants are always unsigned. Hence we must convert
10292 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
10294 uc = cpp_host_to_exec_charset (parse_in, uc);
10296 if (flag_signed_char)
10297 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
10298 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
10303 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10304 references with an INDIRECT_REF of a constant at the bottom; much like the
10305 traditional rendering of offsetof as a macro. Return the folded result. */
10308 fold_offsetof_1 (tree expr, enum tree_code ctx)
10311 tree_code code = TREE_CODE (expr);
10318 error ("cannot apply %<offsetof%> to static data member %qD", expr);
10319 return error_mark_node;
10323 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10324 return error_mark_node;
10328 if (!TREE_CONSTANT (TREE_OPERAND (expr, 0)))
10330 error ("cannot apply %<offsetof%> to a non constant address");
10331 return error_mark_node;
10333 return TREE_OPERAND (expr, 0);
10335 case COMPONENT_REF:
10336 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code);
10337 if (base == error_mark_node)
10340 t = TREE_OPERAND (expr, 1);
10341 if (DECL_C_BIT_FIELD (t))
10343 error ("attempt to take address of bit-field structure "
10345 return error_mark_node;
10347 off = size_binop_loc (input_location, PLUS_EXPR, DECL_FIELD_OFFSET (t),
10348 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t))
10353 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), code);
10354 if (base == error_mark_node)
10357 t = TREE_OPERAND (expr, 1);
10359 /* Check if the offset goes beyond the upper bound of the array. */
10360 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) >= 0)
10362 tree upbound = array_ref_up_bound (expr);
10363 if (upbound != NULL_TREE
10364 && TREE_CODE (upbound) == INTEGER_CST
10365 && !tree_int_cst_equal (upbound,
10366 TYPE_MAX_VALUE (TREE_TYPE (upbound))))
10368 if (ctx != ARRAY_REF && ctx != COMPONENT_REF)
10369 upbound = size_binop (PLUS_EXPR, upbound,
10370 build_int_cst (TREE_TYPE (upbound), 1));
10371 if (tree_int_cst_lt (upbound, t))
10375 for (v = TREE_OPERAND (expr, 0);
10376 TREE_CODE (v) == COMPONENT_REF;
10377 v = TREE_OPERAND (v, 0))
10378 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v, 0)))
10381 tree fld_chain = DECL_CHAIN (TREE_OPERAND (v, 1));
10382 for (; fld_chain; fld_chain = DECL_CHAIN (fld_chain))
10383 if (TREE_CODE (fld_chain) == FIELD_DECL)
10389 /* Don't warn if the array might be considered a poor
10390 man's flexible array member with a very permissive
10391 definition thereof. */
10392 if (TREE_CODE (v) == ARRAY_REF
10393 || TREE_CODE (v) == COMPONENT_REF)
10394 warning (OPT_Warray_bounds,
10395 "index %E denotes an offset "
10396 "greater than size of %qT",
10397 t, TREE_TYPE (TREE_OPERAND (expr, 0)));
10402 t = convert (sizetype, t);
10403 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
10406 case COMPOUND_EXPR:
10407 /* Handle static members of volatile structs. */
10408 t = TREE_OPERAND (expr, 1);
10409 gcc_assert (VAR_P (t));
10410 return fold_offsetof_1 (t);
10413 gcc_unreachable ();
10416 return fold_build_pointer_plus (base, off);
10419 /* Likewise, but convert it to the return type of offsetof. */
10422 fold_offsetof (tree expr)
10424 return convert (size_type_node, fold_offsetof_1 (expr));
10427 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10428 expression, because B will always be true. */
10431 warn_for_omitted_condop (location_t location, tree cond)
10433 if (truth_value_p (TREE_CODE (cond)))
10434 warning_at (location, OPT_Wparentheses,
10435 "the omitted middle operand in ?: will always be %<true%>, "
10436 "suggest explicit middle operand");
10439 /* Give an error for storing into ARG, which is 'const'. USE indicates
10440 how ARG was being used. */
10443 readonly_error (location_t loc, tree arg, enum lvalue_use use)
10445 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
10447 /* Using this macro rather than (for example) arrays of messages
10448 ensures that all the format strings are checked at compile
10450 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10451 : (use == lv_increment ? (I) \
10452 : (use == lv_decrement ? (D) : (AS))))
10453 if (TREE_CODE (arg) == COMPONENT_REF)
10455 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
10456 error_at (loc, READONLY_MSG (G_("assignment of member "
10457 "%qD in read-only object"),
10458 G_("increment of member "
10459 "%qD in read-only object"),
10460 G_("decrement of member "
10461 "%qD in read-only object"),
10462 G_("member %qD in read-only object "
10463 "used as %<asm%> output")),
10464 TREE_OPERAND (arg, 1));
10466 error_at (loc, READONLY_MSG (G_("assignment of read-only member %qD"),
10467 G_("increment of read-only member %qD"),
10468 G_("decrement of read-only member %qD"),
10469 G_("read-only member %qD used as %<asm%> output")),
10470 TREE_OPERAND (arg, 1));
10472 else if (VAR_P (arg))
10473 error_at (loc, READONLY_MSG (G_("assignment of read-only variable %qD"),
10474 G_("increment of read-only variable %qD"),
10475 G_("decrement of read-only variable %qD"),
10476 G_("read-only variable %qD used as %<asm%> output")),
10478 else if (TREE_CODE (arg) == PARM_DECL)
10479 error_at (loc, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10480 G_("increment of read-only parameter %qD"),
10481 G_("decrement of read-only parameter %qD"),
10482 G_("read-only parameter %qD use as %<asm%> output")),
10484 else if (TREE_CODE (arg) == RESULT_DECL)
10486 gcc_assert (c_dialect_cxx ());
10487 error_at (loc, READONLY_MSG (G_("assignment of "
10488 "read-only named return value %qD"),
10490 "read-only named return value %qD"),
10492 "read-only named return value %qD"),
10493 G_("read-only named return value %qD "
10494 "used as %<asm%>output")),
10497 else if (TREE_CODE (arg) == FUNCTION_DECL)
10498 error_at (loc, READONLY_MSG (G_("assignment of function %qD"),
10499 G_("increment of function %qD"),
10500 G_("decrement of function %qD"),
10501 G_("function %qD used as %<asm%> output")),
10504 error_at (loc, READONLY_MSG (G_("assignment of read-only location %qE"),
10505 G_("increment of read-only location %qE"),
10506 G_("decrement of read-only location %qE"),
10507 G_("read-only location %qE used as %<asm%> output")),
10511 /* Print an error message for an invalid lvalue. USE says
10512 how the lvalue is being used and so selects the error message. LOC
10513 is the location for the error. */
10516 lvalue_error (location_t loc, enum lvalue_use use)
10521 error_at (loc, "lvalue required as left operand of assignment");
10524 error_at (loc, "lvalue required as increment operand");
10527 error_at (loc, "lvalue required as decrement operand");
10530 error_at (loc, "lvalue required as unary %<&%> operand");
10533 error_at (loc, "lvalue required in asm statement");
10536 gcc_unreachable ();
10540 /* Print an error message for an invalid indirection of type TYPE.
10541 ERRSTRING is the name of the operator for the indirection. */
10544 invalid_indirection_error (location_t loc, tree type, ref_operator errstring)
10549 gcc_assert (c_dialect_cxx ());
10550 error_at (loc, "invalid type argument (have %qT)", type);
10552 case RO_ARRAY_INDEXING:
10554 "invalid type argument of array indexing (have %qT)",
10557 case RO_UNARY_STAR:
10559 "invalid type argument of unary %<*%> (have %qT)",
10564 "invalid type argument of %<->%> (have %qT)",
10567 case RO_ARROW_STAR:
10569 "invalid type argument of %<->*%> (have %qT)",
10572 case RO_IMPLICIT_CONVERSION:
10574 "invalid type argument of implicit conversion (have %qT)",
10578 gcc_unreachable ();
10582 /* *PTYPE is an incomplete array. Complete it with a domain based on
10583 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10584 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10585 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10588 complete_array_type (tree *ptype, tree initial_value, bool do_default)
10590 tree maxindex, type, main_type, elt, unqual_elt;
10591 int failure = 0, quals;
10592 hashval_t hashcode = 0;
10593 bool overflow_p = false;
10595 maxindex = size_zero_node;
10598 if (TREE_CODE (initial_value) == STRING_CST)
10601 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
10602 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
10604 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
10606 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (initial_value);
10608 if (vec_safe_is_empty (v))
10612 maxindex = ssize_int (-1);
10617 unsigned HOST_WIDE_INT cnt;
10618 constructor_elt *ce;
10619 bool fold_p = false;
10622 maxindex = (*v)[0].index, fold_p = true;
10624 curindex = maxindex;
10626 for (cnt = 1; vec_safe_iterate (v, cnt, &ce); cnt++)
10628 bool curfold_p = false;
10630 curindex = ce->index, curfold_p = true;
10635 /* Since we treat size types now as ordinary
10636 unsigned types, we need an explicit overflow
10638 tree orig = curindex;
10639 curindex = fold_convert (sizetype, curindex);
10640 overflow_p |= tree_int_cst_lt (curindex, orig);
10642 curindex = size_binop (PLUS_EXPR, curindex,
10645 if (tree_int_cst_lt (maxindex, curindex))
10646 maxindex = curindex, fold_p = curfold_p;
10650 tree orig = maxindex;
10651 maxindex = fold_convert (sizetype, maxindex);
10652 overflow_p |= tree_int_cst_lt (maxindex, orig);
10658 /* Make an error message unless that happened already. */
10659 if (initial_value != error_mark_node)
10671 elt = TREE_TYPE (type);
10672 quals = TYPE_QUALS (strip_array_types (elt));
10676 unqual_elt = c_build_qualified_type (elt, KEEP_QUAL_ADDR_SPACE (quals));
10678 /* Using build_distinct_type_copy and modifying things afterward instead
10679 of using build_array_type to create a new type preserves all of the
10680 TYPE_LANG_FLAG_? bits that the front end may have set. */
10681 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
10682 TREE_TYPE (main_type) = unqual_elt;
10683 TYPE_DOMAIN (main_type)
10684 = build_range_type (TREE_TYPE (maxindex),
10685 build_int_cst (TREE_TYPE (maxindex), 0), maxindex);
10686 layout_type (main_type);
10688 /* Make sure we have the canonical MAIN_TYPE. */
10689 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
10690 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
10692 main_type = type_hash_canon (hashcode, main_type);
10694 /* Fix the canonical type. */
10695 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type))
10696 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type)))
10697 SET_TYPE_STRUCTURAL_EQUALITY (main_type);
10698 else if (TYPE_CANONICAL (TREE_TYPE (main_type)) != TREE_TYPE (main_type)
10699 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type))
10700 != TYPE_DOMAIN (main_type)))
10701 TYPE_CANONICAL (main_type)
10702 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type)),
10703 TYPE_CANONICAL (TYPE_DOMAIN (main_type)));
10705 TYPE_CANONICAL (main_type) = main_type;
10710 type = c_build_qualified_type (main_type, quals);
10712 if (COMPLETE_TYPE_P (type)
10713 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
10714 && (overflow_p || TREE_OVERFLOW (TYPE_SIZE_UNIT (type))))
10716 error ("size of array is too large");
10717 /* If we proceed with the array type as it is, we'll eventually
10718 crash in tree_to_[su]hwi(). */
10719 type = error_mark_node;
10726 /* Like c_mark_addressable but don't check register qualifier. */
10728 c_common_mark_addressable_vec (tree t)
10730 while (handled_component_p (t))
10731 t = TREE_OPERAND (t, 0);
10732 if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
10734 TREE_ADDRESSABLE (t) = 1;
10739 /* Used to help initialize the builtin-types.def table. When a type of
10740 the correct size doesn't exist, use error_mark_node instead of NULL.
10741 The later results in segfaults even when a decl using the type doesn't
10745 builtin_type_for_size (int size, bool unsignedp)
10747 tree type = c_common_type_for_size (size, unsignedp);
10748 return type ? type : error_mark_node;
10751 /* A helper function for resolve_overloaded_builtin in resolving the
10752 overloaded __sync_ builtins. Returns a positive power of 2 if the
10753 first operand of PARAMS is a pointer to a supported data type.
10754 Returns 0 if an error is encountered.
10755 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10759 sync_resolve_size (tree function, vec<tree, va_gc> *params, bool fetch)
10761 /* Type of the argument. */
10763 /* Type the argument points to. */
10767 if (vec_safe_is_empty (params))
10769 error ("too few arguments to function %qE", function);
10773 argtype = type = TREE_TYPE ((*params)[0]);
10774 if (TREE_CODE (type) == ARRAY_TYPE)
10776 /* Force array-to-pointer decay for C++. */
10777 gcc_assert (c_dialect_cxx());
10778 (*params)[0] = default_conversion ((*params)[0]);
10779 type = TREE_TYPE ((*params)[0]);
10781 if (TREE_CODE (type) != POINTER_TYPE)
10784 type = TREE_TYPE (type);
10785 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
10788 if (fetch && TREE_CODE (type) == BOOLEAN_TYPE)
10791 size = tree_to_uhwi (TYPE_SIZE_UNIT (type));
10792 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
10796 /* Issue the diagnostic only if the argument is valid, otherwise
10797 it would be redundant at best and could be misleading. */
10798 if (argtype != error_mark_node)
10799 error ("operand type %qT is incompatible with argument %d of %qE",
10800 argtype, 1, function);
10804 /* A helper function for resolve_overloaded_builtin. Adds casts to
10805 PARAMS to make arguments match up with those of FUNCTION. Drops
10806 the variadic arguments at the end. Returns false if some error
10807 was encountered; true on success. */
10810 sync_resolve_params (location_t loc, tree orig_function, tree function,
10811 vec<tree, va_gc> *params, bool orig_format)
10813 function_args_iterator iter;
10815 unsigned int parmnum;
10817 function_args_iter_init (&iter, TREE_TYPE (function));
10818 /* We've declared the implementation functions to use "volatile void *"
10819 as the pointer parameter, so we shouldn't get any complaints from the
10820 call to check_function_arguments what ever type the user used. */
10821 function_args_iter_next (&iter);
10822 ptype = TREE_TYPE (TREE_TYPE ((*params)[0]));
10823 ptype = TYPE_MAIN_VARIANT (ptype);
10825 /* For the rest of the values, we need to cast these to FTYPE, so that we
10826 don't get warnings for passing pointer types, etc. */
10830 tree val, arg_type;
10832 arg_type = function_args_iter_cond (&iter);
10833 /* XXX void_type_node belies the abstraction. */
10834 if (arg_type == void_type_node)
10838 if (params->length () <= parmnum)
10840 error_at (loc, "too few arguments to function %qE", orig_function);
10844 /* Only convert parameters if arg_type is unsigned integer type with
10845 new format sync routines, i.e. don't attempt to convert pointer
10846 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10847 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10849 if (TREE_CODE (arg_type) == INTEGER_TYPE && TYPE_UNSIGNED (arg_type))
10851 /* Ideally for the first conversion we'd use convert_for_assignment
10852 so that we get warnings for anything that doesn't match the pointer
10853 type. This isn't portable across the C and C++ front ends atm. */
10854 val = (*params)[parmnum];
10855 val = convert (ptype, val);
10856 val = convert (arg_type, val);
10857 (*params)[parmnum] = val;
10860 function_args_iter_next (&iter);
10863 /* __atomic routines are not variadic. */
10864 if (!orig_format && params->length () != parmnum + 1)
10866 error_at (loc, "too many arguments to function %qE", orig_function);
10870 /* The definition of these primitives is variadic, with the remaining
10871 being "an optional list of variables protected by the memory barrier".
10872 No clue what that's supposed to mean, precisely, but we consider all
10873 call-clobbered variables to be protected so we're safe. */
10874 params->truncate (parmnum + 1);
10879 /* A helper function for resolve_overloaded_builtin. Adds a cast to
10880 RESULT to make it match the type of the first pointer argument in
10884 sync_resolve_return (tree first_param, tree result, bool orig_format)
10886 tree ptype = TREE_TYPE (TREE_TYPE (first_param));
10887 tree rtype = TREE_TYPE (result);
10888 ptype = TYPE_MAIN_VARIANT (ptype);
10890 /* New format doesn't require casting unless the types are the same size. */
10891 if (orig_format || tree_int_cst_equal (TYPE_SIZE (ptype), TYPE_SIZE (rtype)))
10892 return convert (ptype, result);
10897 /* This function verifies the PARAMS to generic atomic FUNCTION.
10898 It returns the size if all the parameters are the same size, otherwise
10899 0 is returned if the parameters are invalid. */
10902 get_atomic_generic_size (location_t loc, tree function,
10903 vec<tree, va_gc> *params)
10905 unsigned int n_param;
10906 unsigned int n_model;
10911 /* Determine the parameter makeup. */
10912 switch (DECL_FUNCTION_CODE (function))
10914 case BUILT_IN_ATOMIC_EXCHANGE:
10918 case BUILT_IN_ATOMIC_LOAD:
10919 case BUILT_IN_ATOMIC_STORE:
10923 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
10928 gcc_unreachable ();
10931 if (vec_safe_length (params) != n_param)
10933 error_at (loc, "incorrect number of arguments to function %qE", function);
10937 /* Get type of first parameter, and determine its size. */
10938 type_0 = TREE_TYPE ((*params)[0]);
10939 if (TREE_CODE (type_0) == ARRAY_TYPE)
10941 /* Force array-to-pointer decay for C++. */
10942 gcc_assert (c_dialect_cxx());
10943 (*params)[0] = default_conversion ((*params)[0]);
10944 type_0 = TREE_TYPE ((*params)[0]);
10946 if (TREE_CODE (type_0) != POINTER_TYPE || VOID_TYPE_P (TREE_TYPE (type_0)))
10948 error_at (loc, "argument 1 of %qE must be a non-void pointer type",
10953 /* Types must be compile time constant sizes. */
10954 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0)))) != INTEGER_CST)
10957 "argument 1 of %qE must be a pointer to a constant size type",
10962 size_0 = tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0)));
10964 /* Zero size objects are not allowed. */
10968 "argument 1 of %qE must be a pointer to a nonzero size object",
10973 /* Check each other parameter is a pointer and the same size. */
10974 for (x = 0; x < n_param - n_model; x++)
10977 tree type = TREE_TYPE ((*params)[x]);
10978 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
10979 if (n_param == 6 && x == 3)
10981 if (!POINTER_TYPE_P (type))
10983 error_at (loc, "argument %d of %qE must be a pointer type", x + 1,
10987 tree type_size = TYPE_SIZE_UNIT (TREE_TYPE (type));
10988 size = type_size ? tree_to_uhwi (type_size) : 0;
10989 if (size != size_0)
10991 error_at (loc, "size mismatch in argument %d of %qE", x + 1,
10997 /* Check memory model parameters for validity. */
10998 for (x = n_param - n_model ; x < n_param; x++)
11000 tree p = (*params)[x];
11001 if (TREE_CODE (p) == INTEGER_CST)
11003 int i = tree_to_uhwi (p);
11004 if (i < 0 || (memmodel_base (i) >= MEMMODEL_LAST))
11006 warning_at (loc, OPT_Winvalid_memory_model,
11007 "invalid memory model argument %d of %qE", x + 1,
11012 if (!INTEGRAL_TYPE_P (TREE_TYPE (p)))
11014 error_at (loc, "non-integer memory model argument %d of %qE", x + 1,
11024 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11025 at the beginning of the parameter list PARAMS representing the size of the
11026 objects. This is to match the library ABI requirement. LOC is the location
11027 of the function call.
11028 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11029 returned to allow the external call to be constructed. */
11032 add_atomic_size_parameter (unsigned n, location_t loc, tree function,
11033 vec<tree, va_gc> *params)
11037 /* Insert a SIZE_T parameter as the first param. If there isn't
11038 enough space, allocate a new vector and recursively re-build with that. */
11039 if (!params->space (1))
11041 unsigned int z, len;
11042 vec<tree, va_gc> *v;
11045 len = params->length ();
11046 vec_alloc (v, len + 1);
11047 v->quick_push (build_int_cst (size_type_node, n));
11048 for (z = 0; z < len; z++)
11049 v->quick_push ((*params)[z]);
11050 f = build_function_call_vec (loc, vNULL, function, v, NULL);
11055 /* Add the size parameter and leave as a function call for processing. */
11056 size_node = build_int_cst (size_type_node, n);
11057 params->quick_insert (0, size_node);
11062 /* Return whether atomic operations for naturally aligned N-byte
11063 arguments are supported, whether inline or through libatomic. */
11065 atomic_size_supported_p (int n)
11076 return targetm.scalar_mode_supported_p (TImode);
11083 /* This will process an __atomic_exchange function call, determine whether it
11084 needs to be mapped to the _N variation, or turned into a library call.
11085 LOC is the location of the builtin call.
11086 FUNCTION is the DECL that has been invoked;
11087 PARAMS is the argument list for the call. The return value is non-null
11088 TRUE is returned if it is translated into the proper format for a call to the
11089 external library, and NEW_RETURN is set the tree for that function.
11090 FALSE is returned if processing for the _N variation is required, and
11091 NEW_RETURN is set to the return value the result is copied into. */
11093 resolve_overloaded_atomic_exchange (location_t loc, tree function,
11094 vec<tree, va_gc> *params, tree *new_return)
11096 tree p0, p1, p2, p3;
11097 tree I_type, I_type_ptr;
11098 int n = get_atomic_generic_size (loc, function, params);
11100 /* Size of 0 is an error condition. */
11103 *new_return = error_mark_node;
11107 /* If not a lock-free size, change to the library generic format. */
11108 if (!atomic_size_supported_p (n))
11110 *new_return = add_atomic_size_parameter (n, loc, function, params);
11114 /* Otherwise there is a lockfree match, transform the call from:
11115 void fn(T* mem, T* desired, T* return, model)
11117 *return = (T) (fn (In* mem, (In) *desired, model)) */
11124 /* Create pointer to appropriate size. */
11125 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11126 I_type_ptr = build_pointer_type (I_type);
11128 /* Convert object pointer to required type. */
11129 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
11131 /* Convert new value to required type, and dereference it. */
11132 p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11133 p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1);
11136 /* Move memory model to the 3rd position, and end param list. */
11138 params->truncate (3);
11140 /* Convert return pointer and dereference it for later assignment. */
11141 *new_return = build_indirect_ref (loc, p2, RO_UNARY_STAR);
11147 /* This will process an __atomic_compare_exchange function call, determine
11148 whether it needs to be mapped to the _N variation, or turned into a lib call.
11149 LOC is the location of the builtin call.
11150 FUNCTION is the DECL that has been invoked;
11151 PARAMS is the argument list for the call. The return value is non-null
11152 TRUE is returned if it is translated into the proper format for a call to the
11153 external library, and NEW_RETURN is set the tree for that function.
11154 FALSE is returned if processing for the _N variation is required. */
11157 resolve_overloaded_atomic_compare_exchange (location_t loc, tree function,
11158 vec<tree, va_gc> *params,
11162 tree I_type, I_type_ptr;
11163 int n = get_atomic_generic_size (loc, function, params);
11165 /* Size of 0 is an error condition. */
11168 *new_return = error_mark_node;
11172 /* If not a lock-free size, change to the library generic format. */
11173 if (!atomic_size_supported_p (n))
11175 /* The library generic format does not have the weak parameter, so
11176 remove it from the param list. Since a parameter has been removed,
11177 we can be sure that there is room for the SIZE_T parameter, meaning
11178 there will not be a recursive rebuilding of the parameter list, so
11179 there is no danger this will be done twice. */
11182 (*params)[3] = (*params)[4];
11183 (*params)[4] = (*params)[5];
11184 params->truncate (5);
11186 *new_return = add_atomic_size_parameter (n, loc, function, params);
11190 /* Otherwise, there is a match, so the call needs to be transformed from:
11191 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11193 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11199 /* Create pointer to appropriate size. */
11200 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11201 I_type_ptr = build_pointer_type (I_type);
11203 /* Convert object pointer to required type. */
11204 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
11207 /* Convert expected pointer to required type. */
11208 p1 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p1);
11211 /* Convert desired value to required type, and dereference it. */
11212 p2 = build_indirect_ref (loc, p2, RO_UNARY_STAR);
11213 p2 = build1 (VIEW_CONVERT_EXPR, I_type, p2);
11216 /* The rest of the parameters are fine. NULL means no special return value
11218 *new_return = NULL;
11223 /* This will process an __atomic_load function call, determine whether it
11224 needs to be mapped to the _N variation, or turned into a library call.
11225 LOC is the location of the builtin call.
11226 FUNCTION is the DECL that has been invoked;
11227 PARAMS is the argument list for the call. The return value is non-null
11228 TRUE is returned if it is translated into the proper format for a call to the
11229 external library, and NEW_RETURN is set the tree for that function.
11230 FALSE is returned if processing for the _N variation is required, and
11231 NEW_RETURN is set to the return value the result is copied into. */
11234 resolve_overloaded_atomic_load (location_t loc, tree function,
11235 vec<tree, va_gc> *params, tree *new_return)
11238 tree I_type, I_type_ptr;
11239 int n = get_atomic_generic_size (loc, function, params);
11241 /* Size of 0 is an error condition. */
11244 *new_return = error_mark_node;
11248 /* If not a lock-free size, change to the library generic format. */
11249 if (!atomic_size_supported_p (n))
11251 *new_return = add_atomic_size_parameter (n, loc, function, params);
11255 /* Otherwise, there is a match, so the call needs to be transformed from:
11256 void fn(T* mem, T* return, model)
11258 *return = (T) (fn ((In *) mem, model)) */
11264 /* Create pointer to appropriate size. */
11265 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11266 I_type_ptr = build_pointer_type (I_type);
11268 /* Convert object pointer to required type. */
11269 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
11272 /* Move memory model to the 2nd position, and end param list. */
11274 params->truncate (2);
11276 /* Convert return pointer and dereference it for later assignment. */
11277 *new_return = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11283 /* This will process an __atomic_store function call, determine whether it
11284 needs to be mapped to the _N variation, or turned into a library call.
11285 LOC is the location of the builtin call.
11286 FUNCTION is the DECL that has been invoked;
11287 PARAMS is the argument list for the call. The return value is non-null
11288 TRUE is returned if it is translated into the proper format for a call to the
11289 external library, and NEW_RETURN is set the tree for that function.
11290 FALSE is returned if processing for the _N variation is required, and
11291 NEW_RETURN is set to the return value the result is copied into. */
11294 resolve_overloaded_atomic_store (location_t loc, tree function,
11295 vec<tree, va_gc> *params, tree *new_return)
11298 tree I_type, I_type_ptr;
11299 int n = get_atomic_generic_size (loc, function, params);
11301 /* Size of 0 is an error condition. */
11304 *new_return = error_mark_node;
11308 /* If not a lock-free size, change to the library generic format. */
11309 if (!atomic_size_supported_p (n))
11311 *new_return = add_atomic_size_parameter (n, loc, function, params);
11315 /* Otherwise, there is a match, so the call needs to be transformed from:
11316 void fn(T* mem, T* value, model)
11318 fn ((In *) mem, (In) *value, model) */
11323 /* Create pointer to appropriate size. */
11324 I_type = builtin_type_for_size (BITS_PER_UNIT * n, 1);
11325 I_type_ptr = build_pointer_type (I_type);
11327 /* Convert object pointer to required type. */
11328 p0 = build1 (VIEW_CONVERT_EXPR, I_type_ptr, p0);
11331 /* Convert new value to required type, and dereference it. */
11332 p1 = build_indirect_ref (loc, p1, RO_UNARY_STAR);
11333 p1 = build1 (VIEW_CONVERT_EXPR, I_type, p1);
11336 /* The memory model is in the right spot already. Return is void. */
11337 *new_return = NULL_TREE;
11343 /* Some builtin functions are placeholders for other expressions. This
11344 function should be called immediately after parsing the call expression
11345 before surrounding code has committed to the type of the expression.
11347 LOC is the location of the builtin call.
11349 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11350 PARAMS is the argument list for the call. The return value is non-null
11351 when expansion is complete, and null if normal processing should
11355 resolve_overloaded_builtin (location_t loc, tree function,
11356 vec<tree, va_gc> *params)
11358 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
11360 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11361 Those are not valid to call with a pointer to _Bool (or C++ bool)
11362 and so must be rejected. */
11363 bool fetch_op = true;
11364 bool orig_format = true;
11365 tree new_return = NULL_TREE;
11367 switch (DECL_BUILT_IN_CLASS (function))
11369 case BUILT_IN_NORMAL:
11372 if (targetm.resolve_overloaded_builtin)
11373 return targetm.resolve_overloaded_builtin (loc, function, params);
11380 /* Handle BUILT_IN_NORMAL here. */
11383 case BUILT_IN_ATOMIC_EXCHANGE:
11384 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
11385 case BUILT_IN_ATOMIC_LOAD:
11386 case BUILT_IN_ATOMIC_STORE:
11388 /* Handle these 4 together so that they can fall through to the next
11389 case if the call is transformed to an _N variant. */
11392 case BUILT_IN_ATOMIC_EXCHANGE:
11394 if (resolve_overloaded_atomic_exchange (loc, function, params,
11397 /* Change to the _N variant. */
11398 orig_code = BUILT_IN_ATOMIC_EXCHANGE_N;
11402 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE:
11404 if (resolve_overloaded_atomic_compare_exchange (loc, function,
11408 /* Change to the _N variant. */
11409 orig_code = BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N;
11412 case BUILT_IN_ATOMIC_LOAD:
11414 if (resolve_overloaded_atomic_load (loc, function, params,
11417 /* Change to the _N variant. */
11418 orig_code = BUILT_IN_ATOMIC_LOAD_N;
11421 case BUILT_IN_ATOMIC_STORE:
11423 if (resolve_overloaded_atomic_store (loc, function, params,
11426 /* Change to the _N variant. */
11427 orig_code = BUILT_IN_ATOMIC_STORE_N;
11431 gcc_unreachable ();
11433 /* Fallthrough to the normal processing. */
11435 case BUILT_IN_ATOMIC_EXCHANGE_N:
11436 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N:
11437 case BUILT_IN_ATOMIC_LOAD_N:
11438 case BUILT_IN_ATOMIC_STORE_N:
11441 /* Fallthrough to further processing. */
11443 case BUILT_IN_ATOMIC_ADD_FETCH_N:
11444 case BUILT_IN_ATOMIC_SUB_FETCH_N:
11445 case BUILT_IN_ATOMIC_AND_FETCH_N:
11446 case BUILT_IN_ATOMIC_NAND_FETCH_N:
11447 case BUILT_IN_ATOMIC_XOR_FETCH_N:
11448 case BUILT_IN_ATOMIC_OR_FETCH_N:
11449 case BUILT_IN_ATOMIC_FETCH_ADD_N:
11450 case BUILT_IN_ATOMIC_FETCH_SUB_N:
11451 case BUILT_IN_ATOMIC_FETCH_AND_N:
11452 case BUILT_IN_ATOMIC_FETCH_NAND_N:
11453 case BUILT_IN_ATOMIC_FETCH_XOR_N:
11454 case BUILT_IN_ATOMIC_FETCH_OR_N:
11456 orig_format = false;
11457 /* Fallthru for parameter processing. */
11459 case BUILT_IN_SYNC_FETCH_AND_ADD_N:
11460 case BUILT_IN_SYNC_FETCH_AND_SUB_N:
11461 case BUILT_IN_SYNC_FETCH_AND_OR_N:
11462 case BUILT_IN_SYNC_FETCH_AND_AND_N:
11463 case BUILT_IN_SYNC_FETCH_AND_XOR_N:
11464 case BUILT_IN_SYNC_FETCH_AND_NAND_N:
11465 case BUILT_IN_SYNC_ADD_AND_FETCH_N:
11466 case BUILT_IN_SYNC_SUB_AND_FETCH_N:
11467 case BUILT_IN_SYNC_OR_AND_FETCH_N:
11468 case BUILT_IN_SYNC_AND_AND_FETCH_N:
11469 case BUILT_IN_SYNC_XOR_AND_FETCH_N:
11470 case BUILT_IN_SYNC_NAND_AND_FETCH_N:
11471 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N:
11472 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N:
11473 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N:
11474 case BUILT_IN_SYNC_LOCK_RELEASE_N:
11476 /* The following are not _FETCH_OPs and must be accepted with
11477 pointers to _Bool (or C++ bool). */
11480 (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11481 && orig_code != BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11482 && orig_code != BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11483 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N);
11485 int n = sync_resolve_size (function, params, fetch_op);
11486 tree new_function, first_param, result;
11487 enum built_in_function fncode;
11490 return error_mark_node;
11492 fncode = (enum built_in_function)((int)orig_code + exact_log2 (n) + 1);
11493 new_function = builtin_decl_explicit (fncode);
11494 if (!sync_resolve_params (loc, function, new_function, params,
11496 return error_mark_node;
11498 first_param = (*params)[0];
11499 result = build_function_call_vec (loc, vNULL, new_function, params,
11501 if (result == error_mark_node)
11503 if (orig_code != BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11504 && orig_code != BUILT_IN_SYNC_LOCK_RELEASE_N
11505 && orig_code != BUILT_IN_ATOMIC_STORE_N)
11506 result = sync_resolve_return (first_param, result, orig_format);
11509 /* Prevent -Wunused-value warning. */
11510 TREE_USED (result) = true;
11512 /* If new_return is set, assign function to that expr and cast the
11513 result to void since the generic interface returned void. */
11516 /* Cast function result from I{1,2,4,8,16} to the required type. */
11517 result = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (new_return), result);
11518 result = build2 (MODIFY_EXPR, TREE_TYPE (new_return), new_return,
11520 TREE_SIDE_EFFECTS (result) = 1;
11521 protected_set_expr_location (result, loc);
11522 result = convert (void_type_node, result);
11532 /* vector_types_compatible_elements_p is used in type checks of vectors
11533 values used as operands of binary operators. Where it returns true, and
11534 the other checks of the caller succeed (being vector types in he first
11535 place, and matching number of elements), we can just treat the types
11536 as essentially the same.
11537 Contrast with vector_targets_convertible_p, which is used for vector
11538 pointer types, and vector_types_convertible_p, which will allow
11539 language-specific matches under the control of flag_lax_vector_conversions,
11540 and might still require a conversion. */
11541 /* True if vector types T1 and T2 can be inputs to the same binary
11542 operator without conversion.
11543 We don't check the overall vector size here because some of our callers
11544 want to give different error messages when the vectors are compatible
11545 except for the element count. */
11548 vector_types_compatible_elements_p (tree t1, tree t2)
11550 bool opaque = TYPE_VECTOR_OPAQUE (t1) || TYPE_VECTOR_OPAQUE (t2);
11551 t1 = TREE_TYPE (t1);
11552 t2 = TREE_TYPE (t2);
11554 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
11556 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE || c1 == FIXED_POINT_TYPE)
11557 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE
11558 || c2 == FIXED_POINT_TYPE));
11560 t1 = c_common_signed_type (t1);
11561 t2 = c_common_signed_type (t2);
11562 /* Equality works here because c_common_signed_type uses
11563 TYPE_MAIN_VARIANT. */
11566 if (opaque && c1 == c2
11567 && (c1 == INTEGER_TYPE || c1 == REAL_TYPE)
11568 && TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
11573 /* Check for missing format attributes on function pointers. LTYPE is
11574 the new type or left-hand side type. RTYPE is the old type or
11575 right-hand side type. Returns TRUE if LTYPE is missing the desired
11579 check_missing_format_attribute (tree ltype, tree rtype)
11581 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
11584 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
11585 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
11590 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
11591 if (is_attribute_p ("format", TREE_PURPOSE (la)))
11599 /* Subscripting with type char is likely to lose on a machine where
11600 chars are signed. So warn on any machine, but optionally. Don't
11601 warn for unsigned char since that type is safe. Don't warn for
11602 signed char because anyone who uses that must have done so
11603 deliberately. Furthermore, we reduce the false positive load by
11604 warning only for non-constant value of type char. */
11607 warn_array_subscript_with_type_char (location_t loc, tree index)
11609 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
11610 && TREE_CODE (index) != INTEGER_CST)
11611 warning_at (loc, OPT_Wchar_subscripts,
11612 "array subscript has type %<char%>");
11615 /* Implement -Wparentheses for the unexpected C precedence rules, to
11616 cover cases like x + y << z which readers are likely to
11617 misinterpret. We have seen an expression in which CODE is a binary
11618 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11619 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11620 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11621 expression was not formed using a binary or unary operator, or it
11622 was enclosed in parentheses. */
11625 warn_about_parentheses (location_t loc, enum tree_code code,
11626 enum tree_code code_left, tree arg_left,
11627 enum tree_code code_right, tree arg_right)
11629 if (!warn_parentheses)
11632 /* This macro tests that the expression ARG with original tree code
11633 CODE appears to be a boolean expression. or the result of folding a
11634 boolean expression. */
11635 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11636 (truth_value_p (TREE_CODE (ARG)) \
11637 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11638 /* Folding may create 0 or 1 integers from other expressions. */ \
11639 || ((CODE) != INTEGER_CST \
11640 && (integer_onep (ARG) || integer_zerop (ARG))))
11645 if (code_left == PLUS_EXPR)
11646 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11647 "suggest parentheses around %<+%> inside %<<<%>");
11648 else if (code_right == PLUS_EXPR)
11649 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11650 "suggest parentheses around %<+%> inside %<<<%>");
11651 else if (code_left == MINUS_EXPR)
11652 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11653 "suggest parentheses around %<-%> inside %<<<%>");
11654 else if (code_right == MINUS_EXPR)
11655 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11656 "suggest parentheses around %<-%> inside %<<<%>");
11660 if (code_left == PLUS_EXPR)
11661 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11662 "suggest parentheses around %<+%> inside %<>>%>");
11663 else if (code_right == PLUS_EXPR)
11664 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11665 "suggest parentheses around %<+%> inside %<>>%>");
11666 else if (code_left == MINUS_EXPR)
11667 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11668 "suggest parentheses around %<-%> inside %<>>%>");
11669 else if (code_right == MINUS_EXPR)
11670 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11671 "suggest parentheses around %<-%> inside %<>>%>");
11674 case TRUTH_ORIF_EXPR:
11675 if (code_left == TRUTH_ANDIF_EXPR)
11676 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11677 "suggest parentheses around %<&&%> within %<||%>");
11678 else if (code_right == TRUTH_ANDIF_EXPR)
11679 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11680 "suggest parentheses around %<&&%> within %<||%>");
11684 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
11685 || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
11686 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11687 "suggest parentheses around arithmetic in operand of %<|%>");
11688 else if (code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
11689 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
11690 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11691 "suggest parentheses around arithmetic in operand of %<|%>");
11692 /* Check cases like x|y==z */
11693 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11694 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11695 "suggest parentheses around comparison in operand of %<|%>");
11696 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11697 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11698 "suggest parentheses around comparison in operand of %<|%>");
11699 /* Check cases like !x | y */
11700 else if (code_left == TRUTH_NOT_EXPR
11701 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
11702 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11703 "suggest parentheses around operand of "
11704 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
11708 if (code_left == BIT_AND_EXPR
11709 || code_left == PLUS_EXPR || code_left == MINUS_EXPR)
11710 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11711 "suggest parentheses around arithmetic in operand of %<^%>");
11712 else if (code_right == BIT_AND_EXPR
11713 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
11714 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11715 "suggest parentheses around arithmetic in operand of %<^%>");
11716 /* Check cases like x^y==z */
11717 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11718 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11719 "suggest parentheses around comparison in operand of %<^%>");
11720 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11721 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11722 "suggest parentheses around comparison in operand of %<^%>");
11726 if (code_left == PLUS_EXPR)
11727 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11728 "suggest parentheses around %<+%> in operand of %<&%>");
11729 else if (code_right == PLUS_EXPR)
11730 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11731 "suggest parentheses around %<+%> in operand of %<&%>");
11732 else if (code_left == MINUS_EXPR)
11733 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11734 "suggest parentheses around %<-%> in operand of %<&%>");
11735 else if (code_right == MINUS_EXPR)
11736 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11737 "suggest parentheses around %<-%> in operand of %<&%>");
11738 /* Check cases like x&y==z */
11739 else if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11740 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11741 "suggest parentheses around comparison in operand of %<&%>");
11742 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11743 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11744 "suggest parentheses around comparison in operand of %<&%>");
11745 /* Check cases like !x & y */
11746 else if (code_left == TRUTH_NOT_EXPR
11747 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right, arg_right))
11748 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11749 "suggest parentheses around operand of "
11750 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
11754 if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11755 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11756 "suggest parentheses around comparison in operand of %<==%>");
11757 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11758 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11759 "suggest parentheses around comparison in operand of %<==%>");
11762 if (TREE_CODE_CLASS (code_left) == tcc_comparison)
11763 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11764 "suggest parentheses around comparison in operand of %<!=%>");
11765 else if (TREE_CODE_CLASS (code_right) == tcc_comparison)
11766 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11767 "suggest parentheses around comparison in operand of %<!=%>");
11771 if (TREE_CODE_CLASS (code) == tcc_comparison)
11773 if (TREE_CODE_CLASS (code_left) == tcc_comparison
11774 && code_left != NE_EXPR && code_left != EQ_EXPR
11775 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left)))
11776 warning_at (EXPR_LOC_OR_LOC (arg_left, loc), OPT_Wparentheses,
11777 "comparisons like %<X<=Y<=Z%> do not "
11778 "have their mathematical meaning");
11779 else if (TREE_CODE_CLASS (code_right) == tcc_comparison
11780 && code_right != NE_EXPR && code_right != EQ_EXPR
11781 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right)))
11782 warning_at (EXPR_LOC_OR_LOC (arg_right, loc), OPT_Wparentheses,
11783 "comparisons like %<X<=Y<=Z%> do not "
11784 "have their mathematical meaning");
11788 #undef NOT_A_BOOLEAN_EXPR_P
11791 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11794 warn_for_unused_label (tree label)
11796 if (!TREE_USED (label))
11798 if (DECL_INITIAL (label))
11799 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
11801 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
11805 /* Warn for division by zero according to the value of DIVISOR. LOC
11806 is the location of the division operator. */
11809 warn_for_div_by_zero (location_t loc, tree divisor)
11811 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11812 about division by zero. Do not issue a warning if DIVISOR has a
11813 floating-point type, since we consider 0.0/0.0 a valid way of
11814 generating a NaN. */
11815 if (c_inhibit_evaluation_warnings == 0
11816 && (integer_zerop (divisor) || fixed_zerop (divisor)))
11817 warning_at (loc, OPT_Wdiv_by_zero, "division by zero");
11820 /* Warn for patterns where memset appears to be used incorrectly. The
11821 warning location should be LOC. ARG0, and ARG2 are the first and
11822 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
11823 each argument that was a literal zero. */
11826 warn_for_memset (location_t loc, tree arg0, tree arg2,
11827 int literal_zero_mask)
11829 if (warn_memset_transposed_args
11830 && integer_zerop (arg2)
11831 && (literal_zero_mask & (1 << 2)) != 0
11832 && (literal_zero_mask & (1 << 1)) == 0)
11833 warning_at (loc, OPT_Wmemset_transposed_args,
11834 "%<memset%> used with constant zero length "
11835 "parameter; this could be due to transposed "
11838 if (warn_memset_elt_size && TREE_CODE (arg2) == INTEGER_CST)
11841 if (TREE_CODE (arg0) == ADDR_EXPR)
11842 arg0 = TREE_OPERAND (arg0, 0);
11843 tree type = TREE_TYPE (arg0);
11844 if (TREE_CODE (type) == ARRAY_TYPE)
11846 tree elt_type = TREE_TYPE (type);
11847 tree domain = TYPE_DOMAIN (type);
11848 if (!integer_onep (TYPE_SIZE_UNIT (elt_type))
11849 && domain != NULL_TREE
11850 && TYPE_MAXVAL (domain)
11851 && TYPE_MINVAL (domain)
11852 && integer_zerop (TYPE_MINVAL (domain))
11853 && integer_onep (fold_build2 (MINUS_EXPR, domain,
11855 TYPE_MAXVAL (domain))))
11856 warning_at (loc, OPT_Wmemset_elt_size,
11857 "%<memset%> used with length equal to "
11858 "number of elements without multiplication "
11859 "by element size");
11864 /* Subroutine of build_binary_op. Give warnings for comparisons
11865 between signed and unsigned quantities that may fail. Do the
11866 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
11867 so that casts will be considered, but default promotions won't
11870 LOCATION is the location of the comparison operator.
11872 The arguments of this function map directly to local variables
11873 of build_binary_op. */
11876 warn_for_sign_compare (location_t location,
11877 tree orig_op0, tree orig_op1,
11878 tree op0, tree op1,
11879 tree result_type, enum tree_code resultcode)
11881 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
11882 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
11883 int unsignedp0, unsignedp1;
11885 /* In C++, check for comparison of different enum types. */
11886 if (c_dialect_cxx()
11887 && TREE_CODE (TREE_TYPE (orig_op0)) == ENUMERAL_TYPE
11888 && TREE_CODE (TREE_TYPE (orig_op1)) == ENUMERAL_TYPE
11889 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0))
11890 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1)))
11892 warning_at (location,
11893 OPT_Wsign_compare, "comparison between types %qT and %qT",
11894 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1));
11897 /* Do not warn if the comparison is being done in a signed type,
11898 since the signed type will only be chosen if it can represent
11899 all the values of the unsigned type. */
11900 if (!TYPE_UNSIGNED (result_type))
11902 /* Do not warn if both operands are unsigned. */
11903 else if (op0_signed == op1_signed)
11907 tree sop, uop, base_type;
11911 sop = orig_op0, uop = orig_op1;
11913 sop = orig_op1, uop = orig_op0;
11915 STRIP_TYPE_NOPS (sop);
11916 STRIP_TYPE_NOPS (uop);
11917 base_type = (TREE_CODE (result_type) == COMPLEX_TYPE
11918 ? TREE_TYPE (result_type) : result_type);
11920 /* Do not warn if the signed quantity is an unsuffixed integer
11921 literal (or some static constant expression involving such
11922 literals or a conditional expression involving such literals)
11923 and it is non-negative. */
11924 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
11926 /* Do not warn if the comparison is an equality operation, the
11927 unsigned quantity is an integral constant, and it would fit
11928 in the result if the result were signed. */
11929 else if (TREE_CODE (uop) == INTEGER_CST
11930 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
11931 && int_fits_type_p (uop, c_common_signed_type (base_type)))
11933 /* In C, do not warn if the unsigned quantity is an enumeration
11934 constant and its maximum value would fit in the result if the
11935 result were signed. */
11936 else if (!c_dialect_cxx() && TREE_CODE (uop) == INTEGER_CST
11937 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
11938 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop)),
11939 c_common_signed_type (base_type)))
11942 warning_at (location,
11944 "comparison between signed and unsigned integer expressions");
11947 /* Warn if two unsigned values are being compared in a size larger
11948 than their original size, and one (and only one) is the result of
11949 a `~' operator. This comparison will always fail.
11951 Also warn if one operand is a constant, and the constant does not
11952 have all bits set that are set in the ~ operand when it is
11955 op0 = c_common_get_narrower (op0, &unsignedp0);
11956 op1 = c_common_get_narrower (op1, &unsignedp1);
11958 if ((TREE_CODE (op0) == BIT_NOT_EXPR)
11959 ^ (TREE_CODE (op1) == BIT_NOT_EXPR))
11961 if (TREE_CODE (op0) == BIT_NOT_EXPR)
11962 op0 = c_common_get_narrower (TREE_OPERAND (op0, 0), &unsignedp0);
11963 if (TREE_CODE (op1) == BIT_NOT_EXPR)
11964 op1 = c_common_get_narrower (TREE_OPERAND (op1, 0), &unsignedp1);
11966 if (tree_fits_shwi_p (op0) || tree_fits_shwi_p (op1))
11969 HOST_WIDE_INT constant, mask;
11973 if (tree_fits_shwi_p (op0))
11976 unsignedp = unsignedp1;
11977 constant = tree_to_shwi (op0);
11982 unsignedp = unsignedp0;
11983 constant = tree_to_shwi (op1);
11986 bits = TYPE_PRECISION (TREE_TYPE (primop));
11987 if (bits < TYPE_PRECISION (result_type)
11988 && bits < HOST_BITS_PER_LONG && unsignedp)
11990 mask = (~ (unsigned HOST_WIDE_INT) 0) << bits;
11991 if ((mask & constant) != mask)
11994 warning_at (location, OPT_Wsign_compare,
11995 "promoted ~unsigned is always non-zero");
11997 warning_at (location, OPT_Wsign_compare,
11998 "comparison of promoted ~unsigned with constant");
12002 else if (unsignedp0 && unsignedp1
12003 && (TYPE_PRECISION (TREE_TYPE (op0))
12004 < TYPE_PRECISION (result_type))
12005 && (TYPE_PRECISION (TREE_TYPE (op1))
12006 < TYPE_PRECISION (result_type)))
12007 warning_at (location, OPT_Wsign_compare,
12008 "comparison of promoted ~unsigned with unsigned");
12012 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12013 type via c_common_type. If -Wdouble-promotion is in use, and the
12014 conditions for warning have been met, issue a warning. GMSGID is
12015 the warning message. It must have two %T specifiers for the type
12016 that was converted (generally "float") and the type to which it was
12017 converted (generally "double), respectively. LOC is the location
12018 to which the awrning should refer. */
12021 do_warn_double_promotion (tree result_type, tree type1, tree type2,
12022 const char *gmsgid, location_t loc)
12026 if (!warn_double_promotion)
12028 /* If the conversion will not occur at run-time, there is no need to
12030 if (c_inhibit_evaluation_warnings)
12032 if (TYPE_MAIN_VARIANT (result_type) != double_type_node
12033 && TYPE_MAIN_VARIANT (result_type) != complex_double_type_node)
12035 if (TYPE_MAIN_VARIANT (type1) == float_type_node
12036 || TYPE_MAIN_VARIANT (type1) == complex_float_type_node)
12037 source_type = type1;
12038 else if (TYPE_MAIN_VARIANT (type2) == float_type_node
12039 || TYPE_MAIN_VARIANT (type2) == complex_float_type_node)
12040 source_type = type2;
12043 warning_at (loc, OPT_Wdouble_promotion, gmsgid, source_type, result_type);
12046 /* Possibly warn about unused parameters. */
12049 do_warn_unused_parameter (tree fn)
12053 for (decl = DECL_ARGUMENTS (fn);
12054 decl; decl = DECL_CHAIN (decl))
12055 if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
12056 && DECL_NAME (decl) && !DECL_ARTIFICIAL (decl)
12057 && !TREE_NO_WARNING (decl))
12058 warning_at (DECL_SOURCE_LOCATION (decl), OPT_Wunused_parameter,
12059 "unused parameter %qD", decl);
12063 /* Setup a TYPE_DECL node as a typedef representation.
12065 X is a TYPE_DECL for a typedef statement. Create a brand new
12066 ..._TYPE node (which will be just a variant of the existing
12067 ..._TYPE node with identical properties) and then install X
12068 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12070 The whole point here is to end up with a situation where each
12071 and every ..._TYPE node the compiler creates will be uniquely
12072 associated with AT MOST one node representing a typedef name.
12073 This way, even though the compiler substitutes corresponding
12074 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12075 early on, later parts of the compiler can always do the reverse
12076 translation and get back the corresponding typedef name. For
12079 typedef struct S MY_TYPE;
12082 Later parts of the compiler might only know that `object' was of
12083 type `struct S' if it were not for code just below. With this
12084 code however, later parts of the compiler see something like:
12086 struct S' == struct S
12087 typedef struct S' MY_TYPE;
12090 And they can then deduce (from the node for type struct S') that
12091 the original object declaration was:
12095 Being able to do this is important for proper support of protoize,
12096 and also for generating precise symbolic debugging information
12097 which takes full account of the programmer's (typedef) vocabulary.
12099 Obviously, we don't want to generate a duplicate ..._TYPE node if
12100 the TYPE_DECL node that we are now processing really represents a
12101 standard built-in type. */
12104 set_underlying_type (tree x)
12106 if (x == error_mark_node)
12108 if (DECL_IS_BUILTIN (x))
12110 if (TYPE_NAME (TREE_TYPE (x)) == 0)
12111 TYPE_NAME (TREE_TYPE (x)) = x;
12113 else if (TREE_TYPE (x) != error_mark_node
12114 && DECL_ORIGINAL_TYPE (x) == NULL_TREE)
12116 tree tt = TREE_TYPE (x);
12117 DECL_ORIGINAL_TYPE (x) = tt;
12118 tt = build_variant_type_copy (tt);
12119 TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
12120 TYPE_NAME (tt) = x;
12121 TREE_USED (tt) = TREE_USED (x);
12122 TREE_TYPE (x) = tt;
12126 /* Record the types used by the current global variable declaration
12127 being parsed, so that we can decide later to emit their debug info.
12128 Those types are in types_used_by_cur_var_decl, and we are going to
12129 store them in the types_used_by_vars_hash hash table.
12130 DECL is the declaration of the global variable that has been parsed. */
12133 record_types_used_by_current_var_decl (tree decl)
12135 gcc_assert (decl && DECL_P (decl) && TREE_STATIC (decl));
12137 while (types_used_by_cur_var_decl && !types_used_by_cur_var_decl->is_empty ())
12139 tree type = types_used_by_cur_var_decl->pop ();
12140 types_used_by_var_decl_insert (type, decl);
12144 /* If DECL is a typedef that is declared in the current function,
12145 record it for the purpose of -Wunused-local-typedefs. */
12148 record_locally_defined_typedef (tree decl)
12150 struct c_language_function *l;
12152 if (!warn_unused_local_typedefs
12154 /* if this is not a locally defined typedef then we are not
12156 || !is_typedef_decl (decl)
12157 || !decl_function_context (decl))
12160 l = (struct c_language_function *) cfun->language;
12161 vec_safe_push (l->local_typedefs, decl);
12164 /* If T is a TYPE_DECL declared locally, mark it as used. */
12167 maybe_record_typedef_use (tree t)
12169 if (!is_typedef_decl (t))
12172 TREE_USED (t) = true;
12175 /* Warn if there are some unused locally defined typedefs in the
12176 current function. */
12179 maybe_warn_unused_local_typedefs (void)
12183 /* The number of times we have emitted -Wunused-local-typedefs
12184 warnings. If this is different from errorcount, that means some
12185 unrelated errors have been issued. In which case, we'll avoid
12186 emitting "unused-local-typedefs" warnings. */
12187 static int unused_local_typedefs_warn_count;
12188 struct c_language_function *l;
12193 if ((l = (struct c_language_function *) cfun->language) == NULL)
12196 if (warn_unused_local_typedefs
12197 && errorcount == unused_local_typedefs_warn_count)
12199 FOR_EACH_VEC_SAFE_ELT (l->local_typedefs, i, decl)
12200 if (!TREE_USED (decl))
12201 warning_at (DECL_SOURCE_LOCATION (decl),
12202 OPT_Wunused_local_typedefs,
12203 "typedef %qD locally defined but not used", decl);
12204 unused_local_typedefs_warn_count = errorcount;
12207 vec_free (l->local_typedefs);
12210 /* Warn about boolean expression compared with an integer value different
12211 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12212 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12213 are the operands of the comparison. The caller must ensure that
12214 either operand is a boolean expression. */
12217 maybe_warn_bool_compare (location_t loc, enum tree_code code, tree op0,
12220 if (TREE_CODE_CLASS (code) != tcc_comparison)
12224 if (f = fold_for_warn (op0),
12225 TREE_CODE (f) == INTEGER_CST)
12227 else if (f = fold_for_warn (op1),
12228 TREE_CODE (f) == INTEGER_CST)
12233 if (!integer_zerop (cst) && !integer_onep (cst))
12235 int sign = (TREE_CODE (op0) == INTEGER_CST
12236 ? tree_int_cst_sgn (cst) : -tree_int_cst_sgn (cst));
12237 if (code == EQ_EXPR
12238 || ((code == GT_EXPR || code == GE_EXPR) && sign < 0)
12239 || ((code == LT_EXPR || code == LE_EXPR) && sign > 0))
12240 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12241 "with boolean expression is always false", cst);
12243 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12244 "with boolean expression is always true", cst);
12246 else if (integer_zerop (cst) || integer_onep (cst))
12248 /* If the non-constant operand isn't of a boolean type, we
12249 don't want to warn here. */
12250 tree noncst = TREE_CODE (op0) == INTEGER_CST ? op1 : op0;
12251 /* Handle booleans promoted to integers. */
12252 if (CONVERT_EXPR_P (noncst)
12253 && TREE_TYPE (noncst) == integer_type_node
12254 && TREE_CODE (TREE_TYPE (TREE_OPERAND (noncst, 0))) == BOOLEAN_TYPE)
12256 else if (TREE_CODE (TREE_TYPE (noncst)) != BOOLEAN_TYPE
12257 && !truth_value_p (TREE_CODE (noncst)))
12259 /* Do some magic to get the right diagnostics. */
12260 bool flag = TREE_CODE (op0) == INTEGER_CST;
12261 flag = integer_zerop (cst) ? flag : !flag;
12262 if ((code == GE_EXPR && !flag) || (code == LE_EXPR && flag))
12263 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12264 "with boolean expression is always true", cst);
12265 else if ((code == LT_EXPR && !flag) || (code == GT_EXPR && flag))
12266 warning_at (loc, OPT_Wbool_compare, "comparison of constant %qE "
12267 "with boolean expression is always false", cst);
12271 /* Warn if signed left shift overflows. We don't warn
12272 about left-shifting 1 into the sign bit in C++14; cf.
12273 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12274 LOC is a location of the shift; OP0 and OP1 are the operands.
12275 Return true if an overflow is detected, false otherwise. */
12278 maybe_warn_shift_overflow (location_t loc, tree op0, tree op1)
12280 if (TREE_CODE (op0) != INTEGER_CST
12281 || TREE_CODE (op1) != INTEGER_CST)
12284 tree type0 = TREE_TYPE (op0);
12285 unsigned int prec0 = TYPE_PRECISION (type0);
12287 /* Left-hand operand must be signed. */
12288 if (TYPE_UNSIGNED (type0))
12291 unsigned int min_prec = (wi::min_precision (op0, SIGNED)
12292 + TREE_INT_CST_LOW (op1));
12293 /* Handle the case of left-shifting 1 into the sign bit.
12294 * However, shifting 1 _out_ of the sign bit, as in
12295 * INT_MIN << 1, is considered an overflow.
12297 if (!tree_int_cst_sign_bit(op0) && min_prec == prec0 + 1)
12299 /* Never warn for C++14 onwards. */
12300 if (cxx_dialect >= cxx14)
12302 /* Otherwise only if -Wshift-overflow=2. But return
12303 true to signal an overflow for the sake of integer
12304 constant expressions. */
12305 if (warn_shift_overflow < 2)
12309 bool overflowed = min_prec > prec0;
12310 if (overflowed && c_inhibit_evaluation_warnings == 0)
12311 warning_at (loc, OPT_Wshift_overflow_,
12312 "result of %qE requires %u bits to represent, "
12313 "but %qT only has %u bits",
12314 build2_loc (loc, LSHIFT_EXPR, type0, op0, op1),
12315 min_prec, type0, prec0);
12320 /* The C and C++ parsers both use vectors to hold function arguments.
12321 For efficiency, we keep a cache of unused vectors. This is the
12324 typedef vec<tree, va_gc> *tree_gc_vec;
12325 static GTY((deletable)) vec<tree_gc_vec, va_gc> *tree_vector_cache;
12327 /* Return a new vector from the cache. If the cache is empty,
12328 allocate a new vector. These vectors are GC'ed, so it is OK if the
12329 pointer is not released.. */
12332 make_tree_vector (void)
12334 if (tree_vector_cache && !tree_vector_cache->is_empty ())
12335 return tree_vector_cache->pop ();
12338 /* Passing 0 to vec::alloc returns NULL, and our callers require
12339 that we always return a non-NULL value. The vector code uses
12340 4 when growing a NULL vector, so we do too. */
12341 vec<tree, va_gc> *v;
12347 /* Release a vector of trees back to the cache. */
12350 release_tree_vector (vec<tree, va_gc> *vec)
12355 vec_safe_push (tree_vector_cache, vec);
12359 /* Get a new tree vector holding a single tree. */
12362 make_tree_vector_single (tree t)
12364 vec<tree, va_gc> *ret = make_tree_vector ();
12365 ret->quick_push (t);
12369 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12372 make_tree_vector_from_list (tree list)
12374 vec<tree, va_gc> *ret = make_tree_vector ();
12375 for (; list; list = TREE_CHAIN (list))
12376 vec_safe_push (ret, TREE_VALUE (list));
12380 /* Get a new tree vector which is a copy of an existing one. */
12383 make_tree_vector_copy (const vec<tree, va_gc> *orig)
12385 vec<tree, va_gc> *ret;
12389 ret = make_tree_vector ();
12390 vec_safe_reserve (ret, vec_safe_length (orig));
12391 FOR_EACH_VEC_SAFE_ELT (orig, ix, t)
12392 ret->quick_push (t);
12396 /* Return true if KEYWORD starts a type specifier. */
12399 keyword_begins_type_specifier (enum rid keyword)
12403 case RID_AUTO_TYPE:
12415 case RID_DFLOAT128:
12431 if (keyword >= RID_FIRST_INT_N
12432 && keyword < RID_FIRST_INT_N + NUM_INT_N_ENTS
12433 && int_n_enabled_p[keyword-RID_FIRST_INT_N])
12439 /* Return true if KEYWORD names a type qualifier. */
12442 keyword_is_type_qualifier (enum rid keyword)
12456 /* Return true if KEYWORD names a storage class specifier.
12458 RID_TYPEDEF is not included in this list despite `typedef' being
12459 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12460 such for syntactic convenience only. */
12463 keyword_is_storage_class_specifier (enum rid keyword)
12479 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12482 keyword_is_function_specifier (enum rid keyword)
12496 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12497 declaration-specifier (C99 6.7). */
12500 keyword_is_decl_specifier (enum rid keyword)
12502 if (keyword_is_storage_class_specifier (keyword)
12503 || keyword_is_type_qualifier (keyword)
12504 || keyword_is_function_specifier (keyword))
12511 case RID_CONSTEXPR:
12518 /* Initialize language-specific-bits of tree_contains_struct. */
12521 c_common_init_ts (void)
12523 MARK_TS_TYPED (C_MAYBE_CONST_EXPR);
12524 MARK_TS_TYPED (EXCESS_PRECISION_EXPR);
12525 MARK_TS_TYPED (ARRAY_NOTATION_REF);
12528 /* Build a user-defined numeric literal out of an integer constant type VALUE
12529 with identifier SUFFIX. */
12532 build_userdef_literal (tree suffix_id, tree value,
12533 enum overflow_type overflow, tree num_string)
12535 tree literal = make_node (USERDEF_LITERAL);
12536 USERDEF_LITERAL_SUFFIX_ID (literal) = suffix_id;
12537 USERDEF_LITERAL_VALUE (literal) = value;
12538 USERDEF_LITERAL_OVERFLOW (literal) = overflow;
12539 USERDEF_LITERAL_NUM_STRING (literal) = num_string;
12543 /* For vector[index], convert the vector to an array of the underlying type.
12544 Return true if the resulting ARRAY_REF should not be an lvalue. */
12547 convert_vector_to_array_for_subscript (location_t loc,
12548 tree *vecp, tree index)
12551 if (VECTOR_TYPE_P (TREE_TYPE (*vecp)))
12553 tree type = TREE_TYPE (*vecp);
12555 ret = !lvalue_p (*vecp);
12557 if (TREE_CODE (index) == INTEGER_CST)
12558 if (!tree_fits_uhwi_p (index)
12559 || tree_to_uhwi (index) >= TYPE_VECTOR_SUBPARTS (type))
12560 warning_at (loc, OPT_Warray_bounds, "index value is out of bound");
12562 /* We are building an ARRAY_REF so mark the vector as addressable
12563 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12564 for function parameters. */
12565 c_common_mark_addressable_vec (*vecp);
12567 *vecp = build1 (VIEW_CONVERT_EXPR,
12568 build_array_type_nelts (TREE_TYPE (type),
12569 TYPE_VECTOR_SUBPARTS (type)),
12575 /* Determine which of the operands, if any, is a scalar that needs to be
12576 converted to a vector, for the range of operations. */
12578 scalar_to_vector (location_t loc, enum tree_code code, tree op0, tree op1,
12581 tree type0 = TREE_TYPE (op0);
12582 tree type1 = TREE_TYPE (op1);
12583 bool integer_only_op = false;
12584 enum stv_conv ret = stv_firstarg;
12586 gcc_assert (VECTOR_TYPE_P (type0) || VECTOR_TYPE_P (type1));
12589 /* Most GENERIC binary expressions require homogeneous arguments.
12590 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12591 argument that is a vector and a second one that is a scalar, so
12592 we never return stv_secondarg for them. */
12595 if (TREE_CODE (type0) == INTEGER_TYPE
12596 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
12598 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
12601 error_at (loc, "conversion of scalar %qT to vector %qT "
12602 "involves truncation", type0, type1);
12606 return stv_firstarg;
12613 integer_only_op = true;
12614 /* ... fall through ... */
12616 case VEC_COND_EXPR:
12621 case TRUNC_DIV_EXPR:
12622 case CEIL_DIV_EXPR:
12623 case FLOOR_DIV_EXPR:
12624 case ROUND_DIV_EXPR:
12625 case EXACT_DIV_EXPR:
12626 case TRUNC_MOD_EXPR:
12627 case FLOOR_MOD_EXPR:
12635 /* What about UNLT_EXPR? */
12636 if (VECTOR_TYPE_P (type0))
12638 ret = stv_secondarg;
12639 std::swap (type0, type1);
12640 std::swap (op0, op1);
12643 if (TREE_CODE (type0) == INTEGER_TYPE
12644 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
12646 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
12649 error_at (loc, "conversion of scalar %qT to vector %qT "
12650 "involves truncation", type0, type1);
12655 else if (!integer_only_op
12656 /* Allow integer --> real conversion if safe. */
12657 && (TREE_CODE (type0) == REAL_TYPE
12658 || TREE_CODE (type0) == INTEGER_TYPE)
12659 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1)))
12661 if (unsafe_conversion_p (loc, TREE_TYPE (type1), op0, false))
12664 error_at (loc, "conversion of scalar %qT to vector %qT "
12665 "involves truncation", type0, type1);
12674 return stv_nothing;
12677 /* Return true iff ALIGN is an integral constant that is a fundamental
12678 alignment, as defined by [basic.align] in the c++-11
12683 [A fundamental alignment is represented by an alignment less than or
12684 equal to the greatest alignment supported by the implementation
12685 in all contexts, which is equal to
12686 alignof(max_align_t)]. */
12689 cxx_fundamental_alignment_p (unsigned align)
12691 return (align <= MAX (TYPE_ALIGN (long_long_integer_type_node),
12692 TYPE_ALIGN (long_double_type_node)));
12695 /* Return true if T is a pointer to a zero-sized aggregate. */
12698 pointer_to_zero_sized_aggr_p (tree t)
12700 if (!POINTER_TYPE_P (t))
12703 return (TYPE_SIZE (t) && integer_zerop (TYPE_SIZE (t)));
12706 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12707 with no library fallback or for an ADDR_EXPR whose operand is such type
12708 issues an error pointing to the location LOC.
12709 Returns true when the expression has been diagnosed and false
12712 reject_gcc_builtin (const_tree expr, location_t loc /* = UNKNOWN_LOCATION */)
12714 if (TREE_CODE (expr) == ADDR_EXPR)
12715 expr = TREE_OPERAND (expr, 0);
12717 if (TREE_TYPE (expr)
12718 && TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
12719 && TREE_CODE (expr) == FUNCTION_DECL
12720 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12721 false positives for user-declared built-ins such as abs or
12722 strlen, and for C++ operators new and delete.
12723 The c_decl_implicit() test avoids false positives for implicitly
12724 declared built-ins with library fallbacks (such as abs). */
12725 && DECL_BUILT_IN (expr)
12726 && DECL_IS_BUILTIN (expr)
12727 && !c_decl_implicit (expr)
12728 && !DECL_ASSEMBLER_NAME_SET_P (expr))
12730 if (loc == UNKNOWN_LOCATION)
12731 loc = EXPR_LOC_OR_LOC (expr, input_location);
12733 /* Reject arguments that are built-in functions with
12734 no library fallback. */
12735 error_at (loc, "built-in function %qE must be directly called", expr);
12743 /* If we're creating an if-else-if condition chain, first see if we
12744 already have this COND in the CHAIN. If so, warn and don't add COND
12745 into the vector, otherwise add the COND there. LOC is the location
12749 warn_duplicated_cond_add_or_warn (location_t loc, tree cond, vec<tree> **chain)
12751 /* No chain has been created yet. Do nothing. */
12752 if (*chain == NULL)
12755 if (TREE_SIDE_EFFECTS (cond))
12757 /* Uh-oh! This condition has a side-effect, thus invalidates
12758 the whole chain. */
12766 bool found = false;
12767 FOR_EACH_VEC_ELT (**chain, ix, t)
12768 if (operand_equal_p (cond, t, 0))
12770 if (warning_at (loc, OPT_Wduplicated_cond,
12771 "duplicated %<if%> condition"))
12772 inform (EXPR_LOCATION (t), "previously used here");
12778 && !CONSTANT_CLASS_P (cond)
12779 /* Don't infinitely grow the chain. */
12780 && (*chain)->length () < 512)
12781 (*chain)->safe_push (cond);
12784 /* Check if array size calculations overflow or if the array covers more
12785 than half of the address space. Return true if the size of the array
12786 is valid, false otherwise. TYPE is the type of the array and NAME is
12787 the name of the array, or NULL_TREE for unnamed arrays. */
12790 valid_array_size_p (location_t loc, tree type, tree name)
12792 if (type != error_mark_node
12793 && COMPLETE_TYPE_P (type)
12794 && TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST
12795 && !valid_constant_size_p (TYPE_SIZE_UNIT (type)))
12798 error_at (loc, "size of array %qE is too large", name);
12800 error_at (loc, "size of unnamed array is too large");
12806 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
12807 timestamp to replace embedded current dates to get reproducible
12808 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
12811 cb_get_source_date_epoch (cpp_reader *pfile ATTRIBUTE_UNUSED)
12813 char *source_date_epoch;
12817 source_date_epoch = getenv ("SOURCE_DATE_EPOCH");
12818 if (!source_date_epoch)
12819 return (time_t) -1;
12822 epoch = strtoll (source_date_epoch, &endptr, 10);
12823 if (errno != 0 || endptr == source_date_epoch || *endptr != '\0'
12824 || epoch < 0 || epoch > MAX_SOURCE_DATE_EPOCH)
12826 error_at (input_location, "environment variable SOURCE_DATE_EPOCH must "
12827 "expand to a non-negative integer less than or equal to %wd",
12828 MAX_SOURCE_DATE_EPOCH);
12829 return (time_t) -1;
12832 return (time_t) epoch;
12835 /* Check and possibly warn if two declarations have contradictory
12836 attributes, such as always_inline vs. noinline. */
12839 diagnose_mismatched_attributes (tree olddecl, tree newdecl)
12841 bool warned = false;
12843 tree a1 = lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl));
12844 tree a2 = lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl));
12845 /* An optimization attribute applied on a declaration after the
12846 definition is likely not what the user wanted. */
12847 if (a2 != NULL_TREE
12848 && DECL_SAVED_TREE (olddecl) != NULL_TREE
12849 && (a1 == NULL_TREE || !attribute_list_equal (a1, a2)))
12850 warned |= warning (OPT_Wattributes,
12851 "optimization attribute on %qD follows "
12852 "definition but the attribute doesn%'t match",
12855 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
12856 if (DECL_DECLARED_INLINE_P (newdecl)
12857 && DECL_UNINLINABLE (olddecl)
12858 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
12859 warned |= warning (OPT_Wattributes, "inline declaration of %qD follows "
12860 "declaration with attribute noinline", newdecl);
12861 else if (DECL_DECLARED_INLINE_P (olddecl)
12862 && DECL_UNINLINABLE (newdecl)
12863 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
12864 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12865 "noinline follows inline declaration ", newdecl);
12866 else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl))
12867 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl)))
12868 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12869 "%qs follows declaration with attribute %qs",
12870 newdecl, "noinline", "always_inline");
12871 else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl))
12872 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
12873 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12874 "%qs follows declaration with attribute %qs",
12875 newdecl, "always_inline", "noinline");
12876 else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl))
12877 && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl)))
12878 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12879 "%qs follows declaration with attribute %qs",
12880 newdecl, "cold", "hot");
12881 else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl))
12882 && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl)))
12883 warned |= warning (OPT_Wattributes, "declaration of %q+D with attribute "
12884 "%qs follows declaration with attribute %qs",
12885 newdecl, "hot", "cold");
12889 #include "gt-c-family-c-common.h"