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"
48 #include "substring-locations.h"
49 #include "spellcheck.h"
51 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
53 /* Mode used to build pointers (VOIDmode means ptr_mode). */
55 machine_mode c_default_pointer_mode
= VOIDmode
;
57 /* The following symbols are subsumed in the c_global_trees array, and
58 listed here individually for documentation purposes.
60 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
62 tree short_integer_type_node;
63 tree long_integer_type_node;
64 tree long_long_integer_type_node;
66 tree short_unsigned_type_node;
67 tree long_unsigned_type_node;
68 tree long_long_unsigned_type_node;
70 tree truthvalue_type_node;
71 tree truthvalue_false_node;
72 tree truthvalue_true_node;
74 tree ptrdiff_type_node;
76 tree unsigned_char_type_node;
77 tree signed_char_type_node;
80 tree char16_type_node;
81 tree char32_type_node;
84 tree double_type_node;
85 tree long_double_type_node;
87 tree complex_integer_type_node;
88 tree complex_float_type_node;
89 tree complex_double_type_node;
90 tree complex_long_double_type_node;
92 tree dfloat32_type_node;
93 tree dfloat64_type_node;
94 tree_dfloat128_type_node;
100 tree intTI_type_node;
102 tree unsigned_intQI_type_node;
103 tree unsigned_intHI_type_node;
104 tree unsigned_intSI_type_node;
105 tree unsigned_intDI_type_node;
106 tree unsigned_intTI_type_node;
108 tree widest_integer_literal_type_node;
109 tree widest_unsigned_literal_type_node;
111 Nodes for types `void *' and `const void *'.
113 tree ptr_type_node, const_ptr_type_node;
115 Nodes for types `char *' and `const char *'.
117 tree string_type_node, const_string_type_node;
119 Type `char[SOMENUMBER]'.
120 Used when an array of char is needed and the size is irrelevant.
122 tree char_array_type_node;
124 Type `wchar_t[SOMENUMBER]' or something like it.
125 Used when a wide string literal is created.
127 tree wchar_array_type_node;
129 Type `char16_t[SOMENUMBER]' or something like it.
130 Used when a UTF-16 string literal is created.
132 tree char16_array_type_node;
134 Type `char32_t[SOMENUMBER]' or something like it.
135 Used when a UTF-32 string literal is created.
137 tree char32_array_type_node;
139 Type `int ()' -- used for implicit declaration of functions.
141 tree default_function_type;
143 A VOID_TYPE node, packaged in a TREE_LIST.
147 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
148 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
149 VAR_DECLS, but C++ does.)
151 tree function_name_decl_node;
152 tree pretty_function_name_decl_node;
153 tree c99_function_name_decl_node;
155 Stack of nested function name VAR_DECLs.
157 tree saved_function_name_decls;
161 tree c_global_trees
[CTI_MAX
];
163 /* Switches common to the C front ends. */
165 /* Nonzero means don't output line number information. */
167 char flag_no_line_commands
;
169 /* Nonzero causes -E output not to be done, but directives such as
170 #define that have side effects are still obeyed. */
174 /* Nonzero means dump macros in some fashion. */
176 char flag_dump_macros
;
178 /* Nonzero means pass #include lines through to the output. */
180 char flag_dump_includes
;
182 /* Nonzero means process PCH files while preprocessing. */
184 bool flag_pch_preprocess
;
186 /* The file name to which we should write a precompiled header, or
187 NULL if no header will be written in this compile. */
189 const char *pch_file
;
191 /* Nonzero if an ISO standard was selected. It rejects macros in the
195 /* C/ObjC language option variables. */
198 /* Nonzero means allow type mismatches in conditional expressions;
199 just make their values `void'. */
201 int flag_cond_mismatch
;
203 /* Nonzero means enable C89 Amendment 1 features. */
207 /* Nonzero means use the ISO C99 (or C11) dialect of C. */
211 /* Nonzero means use the ISO C11 dialect of C. */
215 /* Nonzero means that we have builtin functions, and main is an int. */
220 /* ObjC language option variables. */
223 /* Tells the compiler that this is a special run. Do not perform any
224 compiling, instead we are to test some platform dependent features
225 and output a C header file with appropriate definitions. */
227 int print_struct_values
;
229 /* Tells the compiler what is the constant string class for ObjC. */
231 const char *constant_string_class_name
;
234 /* C++ language option variables. */
236 /* The reference version of the ABI for -Wabi. */
238 int warn_abi_version
= -1;
240 /* Nonzero means generate separate instantiation control files and
241 juggle them at link time. */
243 int flag_use_repository
;
245 /* The C++ dialect being used. Default set in c_common_post_options. */
247 enum cxx_dialect cxx_dialect
= cxx_unset
;
249 /* Maximum template instantiation depth. This limit exists to limit the
250 time it takes to notice excessively recursive template instantiations.
252 The default is lower than the 1024 recommended by the C++0x standard
253 because G++ runs out of stack before 1024 with highly recursive template
254 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
256 int max_tinst_depth
= 900;
258 /* The elements of `ridpointers' are identifier nodes for the reserved
259 type names and storage classes. It is indexed by a RID_... value. */
262 tree (*make_fname_decl
) (location_t
, tree
, int);
264 /* Nonzero means don't warn about problems that occur when the code is
266 int c_inhibit_evaluation_warnings
;
268 /* Whether we are building a boolean conversion inside
269 convert_for_assignment, or some other late binary operation. If
270 build_binary_op is called for C (from code shared by C and C++) in
271 this case, then the operands have already been folded and the
272 result will not be folded again, so C_MAYBE_CONST_EXPR should not
274 bool in_late_binary_op
;
276 /* Whether lexing has been completed, so subsequent preprocessor
277 errors should use the compiler's input_location. */
278 bool done_lexing
= false;
280 /* Information about how a function name is generated. */
283 tree
*const decl
; /* pointer to the VAR_DECL. */
284 const unsigned rid
; /* RID number for the identifier. */
285 const int pretty
; /* How pretty is it? */
288 /* The three ways of getting then name of the current function. */
290 const struct fname_var_t fname_vars
[] =
292 /* C99 compliant __func__, must be first. */
293 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
294 /* GCC __FUNCTION__ compliant. */
295 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
296 /* GCC __PRETTY_FUNCTION__ compliant. */
297 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
301 /* Global visibility options. */
302 struct visibility_flags visibility_options
;
304 static tree
check_case_value (location_t
, tree
);
305 static bool check_case_bounds (location_t
, tree
, tree
, tree
*, tree
*,
308 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
309 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
310 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
311 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
312 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
313 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
314 static tree
handle_no_sanitize_address_attribute (tree
*, tree
, tree
,
316 static tree
handle_no_address_safety_analysis_attribute (tree
*, tree
, tree
,
318 static tree
handle_no_sanitize_undefined_attribute (tree
*, tree
, tree
, int,
320 static tree
handle_stack_protect_attribute (tree
*, tree
, tree
, int, bool *);
321 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
322 static tree
handle_noclone_attribute (tree
*, tree
, tree
, int, bool *);
323 static tree
handle_noicf_attribute (tree
*, tree
, tree
, int, bool *);
324 static tree
handle_leaf_attribute (tree
*, tree
, tree
, int, bool *);
325 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
327 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int, bool *);
328 static tree
handle_artificial_attribute (tree
*, tree
, tree
, int, bool *);
329 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
330 static tree
handle_error_attribute (tree
*, tree
, tree
, int, bool *);
331 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
332 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
334 static tree
handle_no_reorder_attribute (tree
*, tree
, tree
, int,
336 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
337 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
339 static tree
handle_scalar_storage_order_attribute (tree
*, tree
, tree
,
341 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
342 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
343 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
344 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
345 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
346 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
347 static tree
handle_noplt_attribute (tree
*, tree
, tree
, int, bool *) ;
348 static tree
handle_alias_ifunc_attribute (bool, tree
*, tree
, tree
, bool *);
349 static tree
handle_ifunc_attribute (tree
*, tree
, tree
, int, bool *);
350 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
351 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
352 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
354 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
356 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
358 static tree
handle_no_profile_instrument_function_attribute (tree
*, tree
,
360 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
361 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
362 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
364 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
365 static tree
handle_tm_attribute (tree
*, tree
, tree
, int, bool *);
366 static tree
handle_tm_wrap_attribute (tree
*, tree
, tree
, int, bool *);
367 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
368 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
370 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
372 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
373 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
374 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
375 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
377 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
378 static tree
handle_type_generic_attribute (tree
*, tree
, tree
, int, bool *);
379 static tree
handle_alloc_size_attribute (tree
*, tree
, tree
, int, bool *);
380 static tree
handle_alloc_align_attribute (tree
*, tree
, tree
, int, bool *);
381 static tree
handle_assume_aligned_attribute (tree
*, tree
, tree
, int, bool *);
382 static tree
handle_target_attribute (tree
*, tree
, tree
, int, bool *);
383 static tree
handle_target_clones_attribute (tree
*, tree
, tree
, int, bool *);
384 static tree
handle_optimize_attribute (tree
*, tree
, tree
, int, bool *);
385 static tree
ignore_attribute (tree
*, tree
, tree
, int, bool *);
386 static tree
handle_no_split_stack_attribute (tree
*, tree
, tree
, int, bool *);
387 static tree
handle_fnspec_attribute (tree
*, tree
, tree
, int, bool *);
388 static tree
handle_warn_unused_attribute (tree
*, tree
, tree
, int, bool *);
389 static tree
handle_returns_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
390 static tree
handle_omp_declare_simd_attribute (tree
*, tree
, tree
, int,
392 static tree
handle_simd_attribute (tree
*, tree
, tree
, int, bool *);
393 static tree
handle_omp_declare_target_attribute (tree
*, tree
, tree
, int,
395 static tree
handle_designated_init_attribute (tree
*, tree
, tree
, int, bool *);
396 static tree
handle_bnd_variable_size_attribute (tree
*, tree
, tree
, int, bool *);
397 static tree
handle_bnd_legacy (tree
*, tree
, tree
, int, bool *);
398 static tree
handle_bnd_instrument (tree
*, tree
, tree
, int, bool *);
399 static tree
handle_fallthrough_attribute (tree
*, tree
, tree
, int, bool *);
401 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
402 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
403 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
404 static int resort_field_decl_cmp (const void *, const void *);
406 /* Reserved words. The third field is a mask: keywords are disabled
407 if they match the mask.
410 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
411 C --std=c99: D_CXXONLY | D_OBJC
412 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
413 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
414 C++ --std=c0x: D_CONLY | D_OBJC
415 ObjC++ is like C++ except that D_OBJC is not set
417 If -fno-asm is used, D_ASM is added to the mask. If
418 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
419 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
420 In C with -Wc++-compat, we warn if D_CXXWARN is set.
422 Note the complication of the D_CXX_OBJC keywords. These are
423 reserved words such as 'class'. In C++, 'class' is a reserved
424 word. In Objective-C++ it is too. In Objective-C, it is a
425 reserved word too, but only if it follows an '@' sign.
427 const struct c_common_resword c_common_reswords
[] =
429 { "_Alignas", RID_ALIGNAS
, D_CONLY
},
430 { "_Alignof", RID_ALIGNOF
, D_CONLY
},
431 { "_Atomic", RID_ATOMIC
, D_CONLY
},
432 { "_Bool", RID_BOOL
, D_CONLY
},
433 { "_Complex", RID_COMPLEX
, 0 },
434 { "_Cilk_spawn", RID_CILK_SPAWN
, 0 },
435 { "_Cilk_sync", RID_CILK_SYNC
, 0 },
436 { "_Cilk_for", RID_CILK_FOR
, 0 },
437 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
438 { "_Float16", RID_FLOAT16
, D_CONLY
},
439 { "_Float32", RID_FLOAT32
, D_CONLY
},
440 { "_Float64", RID_FLOAT64
, D_CONLY
},
441 { "_Float128", RID_FLOAT128
, D_CONLY
},
442 { "_Float32x", RID_FLOAT32X
, D_CONLY
},
443 { "_Float64x", RID_FLOAT64X
, D_CONLY
},
444 { "_Float128x", RID_FLOAT128X
, D_CONLY
},
445 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
446 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
447 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
448 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
449 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
450 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
451 { "_Static_assert", RID_STATIC_ASSERT
, D_CONLY
},
452 { "_Noreturn", RID_NORETURN
, D_CONLY
},
453 { "_Generic", RID_GENERIC
, D_CONLY
},
454 { "_Thread_local", RID_THREAD
, D_CONLY
},
455 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
456 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
457 { "__alignof", RID_ALIGNOF
, 0 },
458 { "__alignof__", RID_ALIGNOF
, 0 },
459 { "__asm", RID_ASM
, 0 },
460 { "__asm__", RID_ASM
, 0 },
461 { "__attribute", RID_ATTRIBUTE
, 0 },
462 { "__attribute__", RID_ATTRIBUTE
, 0 },
463 { "__auto_type", RID_AUTO_TYPE
, D_CONLY
},
464 { "__bases", RID_BASES
, D_CXXONLY
},
465 { "__builtin_call_with_static_chain",
466 RID_BUILTIN_CALL_WITH_STATIC_CHAIN
, D_CONLY
},
467 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
468 { "__builtin_complex", RID_BUILTIN_COMPLEX
, D_CONLY
},
469 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE
, 0 },
470 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
471 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
472 { "__builtin_va_arg", RID_VA_ARG
, 0 },
473 { "__complex", RID_COMPLEX
, 0 },
474 { "__complex__", RID_COMPLEX
, 0 },
475 { "__const", RID_CONST
, 0 },
476 { "__const__", RID_CONST
, 0 },
477 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
478 { "__direct_bases", RID_DIRECT_BASES
, D_CXXONLY
},
479 { "__extension__", RID_EXTENSION
, 0 },
480 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
481 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
482 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
483 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
484 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
485 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
486 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
487 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
488 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
489 { "__imag", RID_IMAGPART
, 0 },
490 { "__imag__", RID_IMAGPART
, 0 },
491 { "__inline", RID_INLINE
, 0 },
492 { "__inline__", RID_INLINE
, 0 },
493 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
494 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
495 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
496 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
497 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
498 { "__is_final", RID_IS_FINAL
, D_CXXONLY
},
499 { "__is_literal_type", RID_IS_LITERAL_TYPE
, D_CXXONLY
},
500 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
501 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
502 { "__is_same_as", RID_IS_SAME_AS
, D_CXXONLY
},
503 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
504 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
505 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE
, D_CXXONLY
},
506 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE
, D_CXXONLY
},
507 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE
, D_CXXONLY
},
508 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
509 { "__label__", RID_LABEL
, 0 },
510 { "__null", RID_NULL
, 0 },
511 { "__real", RID_REALPART
, 0 },
512 { "__real__", RID_REALPART
, 0 },
513 { "__restrict", RID_RESTRICT
, 0 },
514 { "__restrict__", RID_RESTRICT
, 0 },
515 { "__signed", RID_SIGNED
, 0 },
516 { "__signed__", RID_SIGNED
, 0 },
517 { "__thread", RID_THREAD
, 0 },
518 { "__transaction_atomic", RID_TRANSACTION_ATOMIC
, 0 },
519 { "__transaction_relaxed", RID_TRANSACTION_RELAXED
, 0 },
520 { "__transaction_cancel", RID_TRANSACTION_CANCEL
, 0 },
521 { "__typeof", RID_TYPEOF
, 0 },
522 { "__typeof__", RID_TYPEOF
, 0 },
523 { "__underlying_type", RID_UNDERLYING_TYPE
, D_CXXONLY
},
524 { "__volatile", RID_VOLATILE
, 0 },
525 { "__volatile__", RID_VOLATILE
, 0 },
526 { "alignas", RID_ALIGNAS
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
527 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
528 { "asm", RID_ASM
, D_ASM
},
529 { "auto", RID_AUTO
, 0 },
530 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
531 { "break", RID_BREAK
, 0 },
532 { "case", RID_CASE
, 0 },
533 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
534 { "char", RID_CHAR
, 0 },
535 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
536 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
537 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
538 { "const", RID_CONST
, 0 },
539 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
540 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
541 { "continue", RID_CONTINUE
, 0 },
542 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
543 { "default", RID_DEFAULT
, 0 },
544 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
546 { "double", RID_DOUBLE
, 0 },
547 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
548 { "else", RID_ELSE
, 0 },
549 { "enum", RID_ENUM
, 0 },
550 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
551 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
552 { "extern", RID_EXTERN
, 0 },
553 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
554 { "float", RID_FLOAT
, 0 },
555 { "for", RID_FOR
, 0 },
556 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
557 { "goto", RID_GOTO
, 0 },
559 { "inline", RID_INLINE
, D_EXT89
},
560 { "int", RID_INT
, 0 },
561 { "long", RID_LONG
, 0 },
562 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
563 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
564 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
565 { "noexcept", RID_NOEXCEPT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
566 { "nullptr", RID_NULLPTR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
567 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
568 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
569 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
570 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
571 { "register", RID_REGISTER
, 0 },
572 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
573 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
574 { "return", RID_RETURN
, 0 },
575 { "short", RID_SHORT
, 0 },
576 { "signed", RID_SIGNED
, 0 },
577 { "sizeof", RID_SIZEOF
, 0 },
578 { "static", RID_STATIC
, 0 },
579 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
580 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
581 { "struct", RID_STRUCT
, 0 },
582 { "switch", RID_SWITCH
, 0 },
583 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
584 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
585 { "thread_local", RID_THREAD
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
586 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
587 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
588 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
589 { "typedef", RID_TYPEDEF
, 0 },
590 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
591 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
592 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
593 { "union", RID_UNION
, 0 },
594 { "unsigned", RID_UNSIGNED
, 0 },
595 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
596 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
597 { "void", RID_VOID
, 0 },
598 { "volatile", RID_VOLATILE
, 0 },
599 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
600 { "while", RID_WHILE
, 0 },
602 /* C++ transactional memory. */
603 { "synchronized", RID_SYNCHRONIZED
, D_CXX_OBJC
| D_TRANSMEM
},
604 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT
, D_CXXONLY
| D_TRANSMEM
},
605 { "atomic_cancel", RID_ATOMIC_CANCEL
, D_CXXONLY
| D_TRANSMEM
},
606 { "atomic_commit", RID_TRANSACTION_ATOMIC
, D_CXXONLY
| D_TRANSMEM
},
608 /* Concepts-related keywords */
609 { "concept", RID_CONCEPT
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
610 { "requires", RID_REQUIRES
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
612 /* These Objective-C keywords are recognized only immediately after
614 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
615 { "defs", RID_AT_DEFS
, D_OBJC
},
616 { "encode", RID_AT_ENCODE
, D_OBJC
},
617 { "end", RID_AT_END
, D_OBJC
},
618 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
619 { "interface", RID_AT_INTERFACE
, D_OBJC
},
620 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
621 { "selector", RID_AT_SELECTOR
, D_OBJC
},
622 { "finally", RID_AT_FINALLY
, D_OBJC
},
623 { "optional", RID_AT_OPTIONAL
, D_OBJC
},
624 { "required", RID_AT_REQUIRED
, D_OBJC
},
625 { "property", RID_AT_PROPERTY
, D_OBJC
},
626 { "package", RID_AT_PACKAGE
, D_OBJC
},
627 { "synthesize", RID_AT_SYNTHESIZE
, D_OBJC
},
628 { "dynamic", RID_AT_DYNAMIC
, D_OBJC
},
629 /* These are recognized only in protocol-qualifier context
631 { "bycopy", RID_BYCOPY
, D_OBJC
},
632 { "byref", RID_BYREF
, D_OBJC
},
633 { "in", RID_IN
, D_OBJC
},
634 { "inout", RID_INOUT
, D_OBJC
},
635 { "oneway", RID_ONEWAY
, D_OBJC
},
636 { "out", RID_OUT
, D_OBJC
},
637 /* These are recognized inside a property attribute list */
638 { "assign", RID_ASSIGN
, D_OBJC
},
639 { "copy", RID_COPY
, D_OBJC
},
640 { "getter", RID_GETTER
, D_OBJC
},
641 { "nonatomic", RID_NONATOMIC
, D_OBJC
},
642 { "readonly", RID_READONLY
, D_OBJC
},
643 { "readwrite", RID_READWRITE
, D_OBJC
},
644 { "retain", RID_RETAIN
, D_OBJC
},
645 { "setter", RID_SETTER
, D_OBJC
},
648 const unsigned int num_c_common_reswords
=
649 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
651 /* Table of machine-independent attributes common to all C-like languages.
653 All attributes referencing arguments should be additionally processed
654 in chkp_copy_function_type_adding_bounds for correct instrumentation
655 by Pointer Bounds Checker.
656 Current list of processed common attributes: nonnull. */
657 const struct attribute_spec c_common_attribute_table
[] =
659 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
660 affects_type_identity } */
661 { "packed", 0, 0, false, false, false,
662 handle_packed_attribute
, false},
663 { "nocommon", 0, 0, true, false, false,
664 handle_nocommon_attribute
, false},
665 { "common", 0, 0, true, false, false,
666 handle_common_attribute
, false },
667 /* FIXME: logically, noreturn attributes should be listed as
668 "false, true, true" and apply to function types. But implementing this
669 would require all the places in the compiler that use TREE_THIS_VOLATILE
670 on a decl to identify non-returning functions to be located and fixed
671 to check the function type instead. */
672 { "noreturn", 0, 0, true, false, false,
673 handle_noreturn_attribute
, false },
674 { "volatile", 0, 0, true, false, false,
675 handle_noreturn_attribute
, false },
676 { "stack_protect", 0, 0, true, false, false,
677 handle_stack_protect_attribute
, false },
678 { "noinline", 0, 0, true, false, false,
679 handle_noinline_attribute
, false },
680 { "noclone", 0, 0, true, false, false,
681 handle_noclone_attribute
, false },
682 { "no_icf", 0, 0, true, false, false,
683 handle_noicf_attribute
, false },
684 { "leaf", 0, 0, true, false, false,
685 handle_leaf_attribute
, false },
686 { "always_inline", 0, 0, true, false, false,
687 handle_always_inline_attribute
, false },
688 { "gnu_inline", 0, 0, true, false, false,
689 handle_gnu_inline_attribute
, false },
690 { "artificial", 0, 0, true, false, false,
691 handle_artificial_attribute
, false },
692 { "flatten", 0, 0, true, false, false,
693 handle_flatten_attribute
, false },
694 { "used", 0, 0, true, false, false,
695 handle_used_attribute
, false },
696 { "unused", 0, 0, false, false, false,
697 handle_unused_attribute
, false },
698 { "externally_visible", 0, 0, true, false, false,
699 handle_externally_visible_attribute
, false },
700 { "no_reorder", 0, 0, true, false, false,
701 handle_no_reorder_attribute
, false },
702 /* The same comments as for noreturn attributes apply to const ones. */
703 { "const", 0, 0, true, false, false,
704 handle_const_attribute
, false },
705 { "scalar_storage_order", 1, 1, false, false, false,
706 handle_scalar_storage_order_attribute
, false },
707 { "transparent_union", 0, 0, false, false, false,
708 handle_transparent_union_attribute
, false },
709 { "constructor", 0, 1, true, false, false,
710 handle_constructor_attribute
, false },
711 { "destructor", 0, 1, true, false, false,
712 handle_destructor_attribute
, false },
713 { "mode", 1, 1, false, true, false,
714 handle_mode_attribute
, false },
715 { "section", 1, 1, true, false, false,
716 handle_section_attribute
, false },
717 { "aligned", 0, 1, false, false, false,
718 handle_aligned_attribute
, false },
719 { "weak", 0, 0, true, false, false,
720 handle_weak_attribute
, false },
721 { "noplt", 0, 0, true, false, false,
722 handle_noplt_attribute
, false },
723 { "ifunc", 1, 1, true, false, false,
724 handle_ifunc_attribute
, false },
725 { "alias", 1, 1, true, false, false,
726 handle_alias_attribute
, false },
727 { "weakref", 0, 1, true, false, false,
728 handle_weakref_attribute
, false },
729 { "no_instrument_function", 0, 0, true, false, false,
730 handle_no_instrument_function_attribute
,
732 { "no_profile_instrument_function", 0, 0, true, false, false,
733 handle_no_profile_instrument_function_attribute
,
735 { "malloc", 0, 0, true, false, false,
736 handle_malloc_attribute
, false },
737 { "returns_twice", 0, 0, true, false, false,
738 handle_returns_twice_attribute
, false },
739 { "no_stack_limit", 0, 0, true, false, false,
740 handle_no_limit_stack_attribute
, false },
741 { "pure", 0, 0, true, false, false,
742 handle_pure_attribute
, false },
743 { "transaction_callable", 0, 0, false, true, false,
744 handle_tm_attribute
, false },
745 { "transaction_unsafe", 0, 0, false, true, false,
746 handle_tm_attribute
, true },
747 { "transaction_safe", 0, 0, false, true, false,
748 handle_tm_attribute
, true },
749 { "transaction_safe_dynamic", 0, 0, true, false, false,
750 handle_tm_attribute
, false },
751 { "transaction_may_cancel_outer", 0, 0, false, true, false,
752 handle_tm_attribute
, false },
753 /* ??? These two attributes didn't make the transition from the
754 Intel language document to the multi-vendor language document. */
755 { "transaction_pure", 0, 0, false, true, false,
756 handle_tm_attribute
, false },
757 { "transaction_wrap", 1, 1, true, false, false,
758 handle_tm_wrap_attribute
, false },
759 /* For internal use (marking of builtins) only. The name contains space
760 to prevent its usage in source code. */
761 { "no vops", 0, 0, true, false, false,
762 handle_novops_attribute
, false },
763 { "deprecated", 0, 1, false, false, false,
764 handle_deprecated_attribute
, false },
765 { "vector_size", 1, 1, false, true, false,
766 handle_vector_size_attribute
, true },
767 { "visibility", 1, 1, false, false, false,
768 handle_visibility_attribute
, false },
769 { "tls_model", 1, 1, true, false, false,
770 handle_tls_model_attribute
, false },
771 { "nonnull", 0, -1, false, true, true,
772 handle_nonnull_attribute
, false },
773 { "nothrow", 0, 0, true, false, false,
774 handle_nothrow_attribute
, false },
775 { "may_alias", 0, 0, false, true, false, NULL
, false },
776 { "cleanup", 1, 1, true, false, false,
777 handle_cleanup_attribute
, false },
778 { "warn_unused_result", 0, 0, false, true, true,
779 handle_warn_unused_result_attribute
, false },
780 { "sentinel", 0, 1, false, true, true,
781 handle_sentinel_attribute
, false },
782 /* For internal use (marking of builtins) only. The name contains space
783 to prevent its usage in source code. */
784 { "type generic", 0, 0, false, true, true,
785 handle_type_generic_attribute
, false },
786 { "alloc_size", 1, 2, false, true, true,
787 handle_alloc_size_attribute
, false },
788 { "cold", 0, 0, true, false, false,
789 handle_cold_attribute
, false },
790 { "hot", 0, 0, true, false, false,
791 handle_hot_attribute
, false },
792 { "no_address_safety_analysis",
793 0, 0, true, false, false,
794 handle_no_address_safety_analysis_attribute
,
796 { "no_sanitize_address", 0, 0, true, false, false,
797 handle_no_sanitize_address_attribute
,
799 { "no_sanitize_thread", 0, 0, true, false, false,
800 handle_no_sanitize_address_attribute
,
802 { "no_sanitize_undefined", 0, 0, true, false, false,
803 handle_no_sanitize_undefined_attribute
,
805 { "warning", 1, 1, true, false, false,
806 handle_error_attribute
, false },
807 { "error", 1, 1, true, false, false,
808 handle_error_attribute
, false },
809 { "target", 1, -1, true, false, false,
810 handle_target_attribute
, false },
811 { "target_clones", 1, -1, true, false, false,
812 handle_target_clones_attribute
, false },
813 { "optimize", 1, -1, true, false, false,
814 handle_optimize_attribute
, false },
815 /* For internal use only. The leading '*' both prevents its usage in
816 source code and signals that it may be overridden by machine tables. */
817 { "*tm regparm", 0, 0, false, true, true,
818 ignore_attribute
, false },
819 { "no_split_stack", 0, 0, true, false, false,
820 handle_no_split_stack_attribute
, false },
821 /* For internal use (marking of builtins and runtime functions) only.
822 The name contains space to prevent its usage in source code. */
823 { "fn spec", 1, 1, false, true, true,
824 handle_fnspec_attribute
, false },
825 { "warn_unused", 0, 0, false, false, false,
826 handle_warn_unused_attribute
, false },
827 { "returns_nonnull", 0, 0, false, true, true,
828 handle_returns_nonnull_attribute
, false },
829 { "omp declare simd", 0, -1, true, false, false,
830 handle_omp_declare_simd_attribute
, false },
831 { "cilk simd function", 0, -1, true, false, false,
832 handle_omp_declare_simd_attribute
, false },
833 { "simd", 0, 1, true, false, false,
834 handle_simd_attribute
, false },
835 { "omp declare target", 0, 0, true, false, false,
836 handle_omp_declare_target_attribute
, false },
837 { "omp declare target link", 0, 0, true, false, false,
838 handle_omp_declare_target_attribute
, false },
839 { "alloc_align", 1, 1, false, true, true,
840 handle_alloc_align_attribute
, false },
841 { "assume_aligned", 1, 2, false, true, true,
842 handle_assume_aligned_attribute
, false },
843 { "designated_init", 0, 0, false, true, false,
844 handle_designated_init_attribute
, false },
845 { "bnd_variable_size", 0, 0, true, false, false,
846 handle_bnd_variable_size_attribute
, false },
847 { "bnd_legacy", 0, 0, true, false, false,
848 handle_bnd_legacy
, false },
849 { "bnd_instrument", 0, 0, true, false, false,
850 handle_bnd_instrument
, false },
851 { "fallthrough", 0, 0, false, false, false,
852 handle_fallthrough_attribute
, false },
853 { NULL
, 0, 0, false, false, false, NULL
, false }
856 /* Give the specifications for the format attributes, used by C and all
859 All attributes referencing arguments should be additionally processed
860 in chkp_copy_function_type_adding_bounds for correct instrumentation
861 by Pointer Bounds Checker.
862 Current list of processed format attributes: format, format_arg. */
863 const struct attribute_spec c_common_format_attribute_table
[] =
865 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
866 affects_type_identity } */
867 { "format", 3, 3, false, true, true,
868 handle_format_attribute
, false },
869 { "format_arg", 1, 1, false, true, true,
870 handle_format_arg_attribute
, false },
871 { NULL
, 0, 0, false, false, false, NULL
, false }
874 /* Return identifier for address space AS. */
877 c_addr_space_name (addr_space_t as
)
879 int rid
= RID_FIRST_ADDR_SPACE
+ as
;
880 gcc_assert (ridpointers
[rid
]);
881 return IDENTIFIER_POINTER (ridpointers
[rid
]);
884 /* Push current bindings for the function name VAR_DECLS. */
887 start_fname_decls (void)
890 tree saved
= NULL_TREE
;
892 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
894 tree decl
= *fname_vars
[ix
].decl
;
898 saved
= tree_cons (decl
, build_int_cst (integer_type_node
, ix
),
900 *fname_vars
[ix
].decl
= NULL_TREE
;
903 if (saved
|| saved_function_name_decls
)
904 /* Normally they'll have been NULL, so only push if we've got a
905 stack, or they are non-NULL. */
906 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
907 saved_function_name_decls
);
910 /* Finish up the current bindings, adding them into the current function's
911 statement tree. This must be done _before_ finish_stmt_tree is called.
912 If there is no current function, we must be at file scope and no statements
913 are involved. Pop the previous bindings. */
916 finish_fname_decls (void)
919 tree stmts
= NULL_TREE
;
920 tree stack
= saved_function_name_decls
;
922 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
923 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
927 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
929 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
930 bodyp
= &BIND_EXPR_BODY (*bodyp
);
932 append_to_statement_list_force (*bodyp
, &stmts
);
936 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
937 *fname_vars
[ix
].decl
= NULL_TREE
;
941 /* We had saved values, restore them. */
944 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
946 tree decl
= TREE_PURPOSE (saved
);
947 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
949 *fname_vars
[ix
].decl
= decl
;
951 stack
= TREE_CHAIN (stack
);
953 saved_function_name_decls
= stack
;
956 /* Return the text name of the current function, suitably prettified
957 by PRETTY_P. Return string must be freed by caller. */
960 fname_as_string (int pretty_p
)
962 const char *name
= "top level";
965 cpp_string cstr
= { 0, 0 }, strname
;
973 if (current_function_decl
)
974 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
976 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
978 namep
= XNEWVEC (char, len
);
979 snprintf (namep
, len
, "\"%s\"", name
);
980 strname
.text
= (unsigned char *) namep
;
981 strname
.len
= len
- 1;
983 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
986 return (const char *) cstr
.text
;
992 /* Return the VAR_DECL for a const char array naming the current
993 function. If the VAR_DECL has not yet been created, create it
994 now. RID indicates how it should be formatted and IDENTIFIER_NODE
995 ID is its name (unfortunately C and C++ hold the RID values of
996 keywords in different places, so we can't derive RID from ID in
997 this language independent code. LOC is the location of the
1001 fname_decl (location_t loc
, unsigned int rid
, tree id
)
1004 tree decl
= NULL_TREE
;
1006 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1007 if (fname_vars
[ix
].rid
== rid
)
1010 decl
= *fname_vars
[ix
].decl
;
1013 /* If a tree is built here, it would normally have the lineno of
1014 the current statement. Later this tree will be moved to the
1015 beginning of the function and this line number will be wrong.
1016 To avoid this problem set the lineno to 0 here; that prevents
1017 it from appearing in the RTL. */
1019 location_t saved_location
= input_location
;
1020 input_location
= UNKNOWN_LOCATION
;
1022 stmts
= push_stmt_list ();
1023 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
1024 stmts
= pop_stmt_list (stmts
);
1025 if (!IS_EMPTY_STMT (stmts
))
1026 saved_function_name_decls
1027 = tree_cons (decl
, stmts
, saved_function_name_decls
);
1028 *fname_vars
[ix
].decl
= decl
;
1029 input_location
= saved_location
;
1031 if (!ix
&& !current_function_decl
)
1032 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
1037 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1040 fix_string_type (tree value
)
1042 int length
= TREE_STRING_LENGTH (value
);
1044 tree e_type
, i_type
, a_type
;
1046 /* Compute the number of elements, for the array type. */
1047 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
1050 e_type
= char_type_node
;
1052 else if (TREE_TYPE (value
) == char16_array_type_node
)
1054 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
1055 e_type
= char16_type_node
;
1057 else if (TREE_TYPE (value
) == char32_array_type_node
)
1059 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
1060 e_type
= char32_type_node
;
1064 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
1065 e_type
= wchar_type_node
;
1068 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1069 limit in C++98 Annex B is very large (65536) and is not normative,
1070 so we do not diagnose it (warn_overlength_strings is forced off
1071 in c_common_post_options). */
1072 if (warn_overlength_strings
)
1074 const int nchars_max
= flag_isoc99
? 4095 : 509;
1075 const int relevant_std
= flag_isoc99
? 99 : 90;
1076 if (nchars
- 1 > nchars_max
)
1077 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1078 separate the %d from the 'C'. 'ISO' should not be
1079 translated, but it may be moved after 'C%d' in languages
1080 where modifiers follow nouns. */
1081 pedwarn (input_location
, OPT_Woverlength_strings
,
1082 "string length %qd is greater than the length %qd "
1083 "ISO C%d compilers are required to support",
1084 nchars
- 1, nchars_max
, relevant_std
);
1087 /* Create the array type for the string constant. The ISO C++
1088 standard says that a string literal has type `const char[N]' or
1089 `const wchar_t[N]'. We use the same logic when invoked as a C
1090 front-end with -Wwrite-strings.
1091 ??? We should change the type of an expression depending on the
1092 state of a warning flag. We should just be warning -- see how
1093 this is handled in the C++ front-end for the deprecated implicit
1094 conversion from string literals to `char*' or `wchar_t*'.
1096 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1097 array type being the unqualified version of that type.
1098 Therefore, if we are constructing an array of const char, we must
1099 construct the matching unqualified array type first. The C front
1100 end does not require this, but it does no harm, so we do it
1102 i_type
= build_index_type (size_int (nchars
- 1));
1103 a_type
= build_array_type (e_type
, i_type
);
1104 if (c_dialect_cxx() || warn_write_strings
)
1105 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
1107 TREE_TYPE (value
) = a_type
;
1108 TREE_CONSTANT (value
) = 1;
1109 TREE_READONLY (value
) = 1;
1110 TREE_STATIC (value
) = 1;
1114 /* Given a string of type STRING_TYPE, determine what kind of string
1115 token would give an equivalent execution encoding: CPP_STRING,
1116 CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error.
1117 This may not be exactly the string token type that initially created
1118 the string, since CPP_WSTRING is indistinguishable from the 16/32 bit
1119 string type at this point.
1121 This effectively reverses part of the logic in lex_string and
1124 static enum cpp_ttype
1125 get_cpp_ttype_from_string_type (tree string_type
)
1127 gcc_assert (string_type
);
1128 if (TREE_CODE (string_type
) == POINTER_TYPE
)
1129 string_type
= TREE_TYPE (string_type
);
1131 if (TREE_CODE (string_type
) != ARRAY_TYPE
)
1134 tree element_type
= TREE_TYPE (string_type
);
1135 if (TREE_CODE (element_type
) != INTEGER_TYPE
)
1138 int bits_per_character
= TYPE_PRECISION (element_type
);
1139 switch (bits_per_character
)
1142 return CPP_STRING
; /* It could have also been CPP_UTF8STRING. */
1144 return CPP_STRING16
;
1146 return CPP_STRING32
;
1152 /* The global record of string concatentations, for use in
1153 extracting locations within string literals. */
1155 GTY(()) string_concat_db
*g_string_concat_db
;
1157 /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
1160 c_get_substring_location (const substring_loc
&substr_loc
,
1161 location_t
*out_loc
)
1163 enum cpp_ttype tok_type
1164 = get_cpp_ttype_from_string_type (substr_loc
.get_string_type ());
1165 if (tok_type
== CPP_OTHER
)
1166 return "unrecognized string type";
1168 return get_source_location_for_substring (parse_in
, g_string_concat_db
,
1169 substr_loc
.get_fmt_string_loc (),
1171 substr_loc
.get_caret_idx (),
1172 substr_loc
.get_start_idx (),
1173 substr_loc
.get_end_idx (),
1178 /* Fold X for consideration by one of the warning functions when checking
1179 whether an expression has a constant value. */
1182 fold_for_warn (tree x
)
1184 if (c_dialect_cxx ())
1185 return c_fully_fold (x
, /*for_init*/false, /*maybe_constp*/NULL
);
1187 /* The C front-end has already folded X appropriately. */
1191 /* Print a warning if a constant expression had overflow in folding.
1192 Invoke this function on every expression that the language
1193 requires to be a constant expression.
1194 Note the ANSI C standard says it is erroneous for a
1195 constant expression to overflow. */
1198 constant_expression_warning (tree value
)
1200 if (warn_overflow
&& pedantic
1201 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1202 || TREE_CODE (value
) == FIXED_CST
1203 || TREE_CODE (value
) == VECTOR_CST
1204 || TREE_CODE (value
) == COMPLEX_CST
)
1205 && TREE_OVERFLOW (value
))
1206 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1209 /* The same as above but print an unconditional error. */
1211 constant_expression_error (tree value
)
1213 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1214 || TREE_CODE (value
) == FIXED_CST
1215 || TREE_CODE (value
) == VECTOR_CST
1216 || TREE_CODE (value
) == COMPLEX_CST
)
1217 && TREE_OVERFLOW (value
))
1218 error ("overflow in constant expression");
1221 /* Print a warning if an expression had overflow in folding and its
1224 Invoke this function on every expression that
1225 (1) appears in the source code, and
1226 (2) is a constant expression that overflowed, and
1227 (3) is not already checked by convert_and_check;
1228 however, do not invoke this function on operands of explicit casts
1229 or when the expression is the result of an operator and any operand
1230 already overflowed. */
1233 overflow_warning (location_t loc
, tree value
)
1235 if (c_inhibit_evaluation_warnings
!= 0)
1238 switch (TREE_CODE (value
))
1241 warning_at (loc
, OPT_Woverflow
, "integer overflow in expression");
1245 warning_at (loc
, OPT_Woverflow
,
1246 "floating point overflow in expression");
1250 warning_at (loc
, OPT_Woverflow
, "fixed-point overflow in expression");
1254 warning_at (loc
, OPT_Woverflow
, "vector overflow in expression");
1258 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1259 warning_at (loc
, OPT_Woverflow
,
1260 "complex integer overflow in expression");
1261 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1262 warning_at (loc
, OPT_Woverflow
,
1263 "complex floating point overflow in expression");
1271 /* Warn about uses of logical || / && operator in a context where it
1272 is likely that the bitwise equivalent was intended by the
1273 programmer. We have seen an expression in which CODE is a binary
1274 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1275 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1277 warn_logical_operator (location_t location
, enum tree_code code
, tree type
,
1278 enum tree_code code_left
, tree op_left
,
1279 enum tree_code
ARG_UNUSED (code_right
), tree op_right
)
1281 int or_op
= (code
== TRUTH_ORIF_EXPR
|| code
== TRUTH_OR_EXPR
);
1282 int in0_p
, in1_p
, in_p
;
1283 tree low0
, low1
, low
, high0
, high1
, high
, lhs
, rhs
, tem
;
1284 bool strict_overflow_p
= false;
1286 if (code
!= TRUTH_ANDIF_EXPR
1287 && code
!= TRUTH_AND_EXPR
1288 && code
!= TRUTH_ORIF_EXPR
1289 && code
!= TRUTH_OR_EXPR
)
1292 /* We don't want to warn if either operand comes from a macro
1293 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1295 if (from_macro_expansion_at (EXPR_LOCATION (op_left
))
1296 || from_macro_expansion_at (EXPR_LOCATION (op_right
)))
1299 /* Warn if &&/|| are being used in a context where it is
1300 likely that the bitwise equivalent was intended by the
1301 programmer. That is, an expression such as op && MASK
1302 where op should not be any boolean expression, nor a
1303 constant, and mask seems to be a non-boolean integer constant. */
1304 if (TREE_CODE (op_right
) == CONST_DECL
)
1305 /* An enumerator counts as a constant. */
1306 op_right
= DECL_INITIAL (op_right
);
1307 if (!truth_value_p (code_left
)
1308 && INTEGRAL_TYPE_P (TREE_TYPE (op_left
))
1309 && !CONSTANT_CLASS_P (op_left
)
1310 && !TREE_NO_WARNING (op_left
)
1311 && TREE_CODE (op_right
) == INTEGER_CST
1312 && !integer_zerop (op_right
)
1313 && !integer_onep (op_right
))
1316 warning_at (location
, OPT_Wlogical_op
, "logical %<or%>"
1317 " applied to non-boolean constant");
1319 warning_at (location
, OPT_Wlogical_op
, "logical %<and%>"
1320 " applied to non-boolean constant");
1321 TREE_NO_WARNING (op_left
) = true;
1325 /* We do not warn for constants because they are typical of macro
1326 expansions that test for features. */
1327 if (CONSTANT_CLASS_P (fold_for_warn (op_left
))
1328 || CONSTANT_CLASS_P (fold_for_warn (op_right
)))
1331 /* This warning only makes sense with logical operands. */
1332 if (!(truth_value_p (TREE_CODE (op_left
))
1333 || INTEGRAL_TYPE_P (TREE_TYPE (op_left
)))
1334 || !(truth_value_p (TREE_CODE (op_right
))
1335 || INTEGRAL_TYPE_P (TREE_TYPE (op_right
))))
1338 /* The range computations only work with scalars. */
1339 if (VECTOR_TYPE_P (TREE_TYPE (op_left
))
1340 || VECTOR_TYPE_P (TREE_TYPE (op_right
)))
1343 /* We first test whether either side separately is trivially true
1344 (with OR) or trivially false (with AND). If so, do not warn.
1345 This is a common idiom for testing ranges of data types in
1347 lhs
= make_range (op_left
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
1350 if (TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
1351 lhs
= C_MAYBE_CONST_EXPR_EXPR (lhs
);
1353 /* If this is an OR operation, invert both sides; now, the result
1354 should be always false to get a warning. */
1358 tem
= build_range_check (UNKNOWN_LOCATION
, type
, lhs
, in0_p
, low0
, high0
);
1359 if (tem
&& integer_zerop (tem
))
1362 rhs
= make_range (op_right
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
1365 if (TREE_CODE (rhs
) == C_MAYBE_CONST_EXPR
)
1366 rhs
= C_MAYBE_CONST_EXPR_EXPR (rhs
);
1368 /* If this is an OR operation, invert both sides; now, the result
1369 should be always false to get a warning. */
1373 tem
= build_range_check (UNKNOWN_LOCATION
, type
, rhs
, in1_p
, low1
, high1
);
1374 if (tem
&& integer_zerop (tem
))
1377 /* If both expressions have the same operand, if we can merge the
1379 if (operand_equal_p (lhs
, rhs
, 0)
1380 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
1381 in1_p
, low1
, high1
))
1383 tem
= build_range_check (UNKNOWN_LOCATION
, type
, lhs
, in_p
, low
, high
);
1384 /* ... and if the range test is always false, then warn. */
1385 if (tem
&& integer_zerop (tem
))
1388 warning_at (location
, OPT_Wlogical_op
,
1389 "logical %<or%> of collectively exhaustive tests is "
1392 warning_at (location
, OPT_Wlogical_op
,
1393 "logical %<and%> of mutually exclusive tests is "
1396 /* Or warn if the operands have exactly the same range, e.g.
1398 else if (tree_int_cst_equal (low0
, low1
)
1399 && tree_int_cst_equal (high0
, high1
))
1402 warning_at (location
, OPT_Wlogical_op
,
1403 "logical %<or%> of equal expressions");
1405 warning_at (location
, OPT_Wlogical_op
,
1406 "logical %<and%> of equal expressions");
1411 /* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1412 with constant indices. */
1415 find_array_ref_with_const_idx_r (tree
*expr_p
, int *walk_subtrees
, void *data
)
1417 tree expr
= *expr_p
;
1419 if ((TREE_CODE (expr
) == ARRAY_REF
1420 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
1421 && TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
)
1423 *(bool *) data
= true;
1430 /* Warn if a self-comparison always evaluates to true or false. LOC
1431 is the location of the comparison with code CODE, LHS and RHS are
1432 operands of the comparison. */
1435 warn_tautological_cmp (location_t loc
, enum tree_code code
, tree lhs
, tree rhs
)
1437 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
1440 /* Don't warn for various macro expansions. */
1441 if (from_macro_expansion_at (loc
)
1442 || from_macro_expansion_at (EXPR_LOCATION (lhs
))
1443 || from_macro_expansion_at (EXPR_LOCATION (rhs
)))
1446 /* We do not warn for constants because they are typical of macro
1447 expansions that test for features, sizeof, and similar. */
1448 if (CONSTANT_CLASS_P (fold_for_warn (lhs
))
1449 || CONSTANT_CLASS_P (fold_for_warn (rhs
)))
1452 /* Don't warn for e.g.
1455 if (n == (long) n) ...
1457 if ((CONVERT_EXPR_P (lhs
) || TREE_CODE (lhs
) == NON_LVALUE_EXPR
)
1458 || (CONVERT_EXPR_P (rhs
) || TREE_CODE (rhs
) == NON_LVALUE_EXPR
))
1461 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1462 It could be a NaN, and NaN never compares equal to anything, even
1464 if (FLOAT_TYPE_P (TREE_TYPE (lhs
)) || FLOAT_TYPE_P (TREE_TYPE (rhs
)))
1467 if (operand_equal_p (lhs
, rhs
, 0))
1469 /* Don't warn about array references with constant indices;
1470 these are likely to come from a macro. */
1472 walk_tree_without_duplicates (&lhs
, find_array_ref_with_const_idx_r
,
1476 const bool always_true
= (code
== EQ_EXPR
|| code
== LE_EXPR
1477 || code
== GE_EXPR
|| code
== UNLE_EXPR
1478 || code
== UNGE_EXPR
|| code
== UNEQ_EXPR
);
1480 warning_at (loc
, OPT_Wtautological_compare
,
1481 "self-comparison always evaluates to true");
1483 warning_at (loc
, OPT_Wtautological_compare
,
1484 "self-comparison always evaluates to false");
1488 /* Return true iff T is a boolean promoted to int. */
1491 bool_promoted_to_int_p (tree t
)
1493 return (CONVERT_EXPR_P (t
)
1494 && TREE_TYPE (t
) == integer_type_node
1495 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == BOOLEAN_TYPE
);
1498 /* Return true iff EXPR only contains boolean operands, or comparisons. */
1501 expr_has_boolean_operands_p (tree expr
)
1505 if (CONVERT_EXPR_P (expr
))
1506 return bool_promoted_to_int_p (expr
);
1507 else if (UNARY_CLASS_P (expr
))
1508 return expr_has_boolean_operands_p (TREE_OPERAND (expr
, 0));
1509 else if (BINARY_CLASS_P (expr
))
1510 return (expr_has_boolean_operands_p (TREE_OPERAND (expr
, 0))
1511 && expr_has_boolean_operands_p (TREE_OPERAND (expr
, 1)));
1512 else if (COMPARISON_CLASS_P (expr
))
1518 /* Warn about logical not used on the left hand side operand of a comparison.
1519 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1520 Do not warn if RHS is of a boolean type, a logical operator, or
1524 warn_logical_not_parentheses (location_t location
, enum tree_code code
,
1527 if (TREE_CODE_CLASS (code
) != tcc_comparison
1528 || TREE_TYPE (rhs
) == NULL_TREE
1529 || TREE_CODE (TREE_TYPE (rhs
)) == BOOLEAN_TYPE
1530 || truth_value_p (TREE_CODE (rhs
)))
1533 /* Don't warn for expression like !x == ~(bool1 | bool2). */
1534 if (expr_has_boolean_operands_p (rhs
))
1537 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1538 !(x == 0) or !(y != 0). */
1539 if ((code
== EQ_EXPR
|| code
== NE_EXPR
)
1540 && integer_zerop (rhs
))
1543 if (warning_at (location
, OPT_Wlogical_not_parentheses
,
1544 "logical not is only applied to the left hand side of "
1546 && EXPR_HAS_LOCATION (lhs
))
1548 location_t lhs_loc
= EXPR_LOCATION (lhs
);
1549 rich_location
richloc (line_table
, lhs_loc
);
1550 richloc
.add_fixit_insert_before (lhs_loc
, "(");
1551 richloc
.add_fixit_insert_after (lhs_loc
, ")");
1552 inform_at_rich_loc (&richloc
, "add parentheses around left hand side "
1553 "expression to silence this warning");
1557 /* Warn if EXP contains any computations whose results are not used.
1558 Return true if a warning is printed; false otherwise. LOCUS is the
1559 (potential) location of the expression. */
1562 warn_if_unused_value (const_tree exp
, location_t locus
)
1565 if (TREE_USED (exp
) || TREE_NO_WARNING (exp
))
1568 /* Don't warn about void constructs. This includes casting to void,
1569 void function calls, and statement expressions with a final cast
1571 if (VOID_TYPE_P (TREE_TYPE (exp
)))
1574 if (EXPR_HAS_LOCATION (exp
))
1575 locus
= EXPR_LOCATION (exp
);
1577 switch (TREE_CODE (exp
))
1579 case PREINCREMENT_EXPR
:
1580 case POSTINCREMENT_EXPR
:
1581 case PREDECREMENT_EXPR
:
1582 case POSTDECREMENT_EXPR
:
1587 case TRY_CATCH_EXPR
:
1588 case WITH_CLEANUP_EXPR
:
1594 /* For a binding, warn if no side effect within it. */
1595 exp
= BIND_EXPR_BODY (exp
);
1599 case NON_LVALUE_EXPR
:
1601 exp
= TREE_OPERAND (exp
, 0);
1604 case TRUTH_ORIF_EXPR
:
1605 case TRUTH_ANDIF_EXPR
:
1606 /* In && or ||, warn if 2nd operand has no side effect. */
1607 exp
= TREE_OPERAND (exp
, 1);
1611 if (warn_if_unused_value (TREE_OPERAND (exp
, 0), locus
))
1613 /* Let people do `(foo (), 0)' without a warning. */
1614 if (TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
1616 exp
= TREE_OPERAND (exp
, 1);
1620 /* If this is an expression with side effects, don't warn; this
1621 case commonly appears in macro expansions. */
1622 if (TREE_SIDE_EFFECTS (exp
))
1627 /* Don't warn about automatic dereferencing of references, since
1628 the user cannot control it. */
1629 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
1631 exp
= TREE_OPERAND (exp
, 0);
1637 /* Referencing a volatile value is a side effect, so don't warn. */
1638 if ((DECL_P (exp
) || REFERENCE_CLASS_P (exp
))
1639 && TREE_THIS_VOLATILE (exp
))
1642 /* If this is an expression which has no operands, there is no value
1643 to be unused. There are no such language-independent codes,
1644 but front ends may define such. */
1645 if (EXPRESSION_CLASS_P (exp
) && TREE_OPERAND_LENGTH (exp
) == 0)
1649 return warning_at (locus
, OPT_Wunused_value
, "value computed is not used");
1654 /* Print a warning about casts that might indicate violation
1655 of strict aliasing rules if -Wstrict-aliasing is used and
1656 strict aliasing mode is in effect. OTYPE is the original
1657 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1660 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1662 /* Strip pointer conversion chains and get to the correct original type. */
1664 otype
= TREE_TYPE (expr
);
1666 if (!(flag_strict_aliasing
1667 && POINTER_TYPE_P (type
)
1668 && POINTER_TYPE_P (otype
)
1669 && !VOID_TYPE_P (TREE_TYPE (type
)))
1670 /* If the type we are casting to is a ref-all pointer
1671 dereferencing it is always valid. */
1672 || TYPE_REF_CAN_ALIAS_ALL (type
))
1675 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1676 && (DECL_P (TREE_OPERAND (expr
, 0))
1677 || handled_component_p (TREE_OPERAND (expr
, 0))))
1679 /* Casting the address of an object to non void pointer. Warn
1680 if the cast breaks type based aliasing. */
1681 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1683 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1684 "might break strict-aliasing rules");
1689 /* warn_strict_aliasing >= 3. This includes the default (3).
1690 Only warn if the cast is dereferenced immediately. */
1691 alias_set_type set1
=
1692 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1693 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1695 if (set1
!= set2
&& set2
!= 0
1697 || (!alias_set_subset_of (set2
, set1
)
1698 && !alias_sets_conflict_p (set1
, set2
))))
1700 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1701 "pointer will break strict-aliasing rules");
1704 else if (warn_strict_aliasing
== 2
1705 && !alias_sets_must_conflict_p (set1
, set2
))
1707 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1708 "pointer might break strict-aliasing rules");
1714 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1716 /* At this level, warn for any conversions, even if an address is
1717 not taken in the same statement. This will likely produce many
1718 false positives, but could be useful to pinpoint problems that
1719 are not revealed at higher levels. */
1720 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1721 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1722 if (!COMPLETE_TYPE_P (type
)
1723 || !alias_sets_must_conflict_p (set1
, set2
))
1725 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1726 "pointer might break strict-aliasing rules");
1734 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1735 sizeof as last operand of certain builtins. */
1738 sizeof_pointer_memaccess_warning (location_t
*sizeof_arg_loc
, tree callee
,
1739 vec
<tree
, va_gc
> *params
, tree
*sizeof_arg
,
1740 bool (*comp_types
) (tree
, tree
))
1742 tree type
, dest
= NULL_TREE
, src
= NULL_TREE
, tem
;
1743 bool strop
= false, cmp
= false;
1744 unsigned int idx
= ~0;
1747 if (TREE_CODE (callee
) != FUNCTION_DECL
1748 || DECL_BUILT_IN_CLASS (callee
) != BUILT_IN_NORMAL
1749 || vec_safe_length (params
) <= 1)
1752 switch (DECL_FUNCTION_CODE (callee
))
1754 case BUILT_IN_STRNCMP
:
1755 case BUILT_IN_STRNCASECMP
:
1758 case BUILT_IN_STRNCPY
:
1759 case BUILT_IN_STRNCPY_CHK
:
1760 case BUILT_IN_STRNCAT
:
1761 case BUILT_IN_STRNCAT_CHK
:
1762 case BUILT_IN_STPNCPY
:
1763 case BUILT_IN_STPNCPY_CHK
:
1766 case BUILT_IN_MEMCPY
:
1767 case BUILT_IN_MEMCPY_CHK
:
1768 case BUILT_IN_MEMMOVE
:
1769 case BUILT_IN_MEMMOVE_CHK
:
1770 if (params
->length () < 3)
1773 dest
= (*params
)[0];
1776 case BUILT_IN_BCOPY
:
1777 if (params
->length () < 3)
1780 dest
= (*params
)[1];
1783 case BUILT_IN_MEMCMP
:
1785 if (params
->length () < 3)
1788 dest
= (*params
)[0];
1792 case BUILT_IN_MEMSET
:
1793 case BUILT_IN_MEMSET_CHK
:
1794 if (params
->length () < 3)
1796 dest
= (*params
)[0];
1799 case BUILT_IN_BZERO
:
1800 dest
= (*params
)[0];
1803 case BUILT_IN_STRNDUP
:
1808 case BUILT_IN_MEMCHR
:
1809 if (params
->length () < 3)
1814 case BUILT_IN_SNPRINTF
:
1815 case BUILT_IN_SNPRINTF_CHK
:
1816 case BUILT_IN_VSNPRINTF
:
1817 case BUILT_IN_VSNPRINTF_CHK
:
1818 dest
= (*params
)[0];
1829 if (sizeof_arg
[idx
] == NULL
|| sizeof_arg
[idx
] == error_mark_node
)
1832 type
= TYPE_P (sizeof_arg
[idx
])
1833 ? sizeof_arg
[idx
] : TREE_TYPE (sizeof_arg
[idx
]);
1834 if (!POINTER_TYPE_P (type
))
1838 && (tem
= tree_strip_nop_conversions (dest
))
1839 && POINTER_TYPE_P (TREE_TYPE (tem
))
1840 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1844 && (tem
= tree_strip_nop_conversions (src
))
1845 && POINTER_TYPE_P (TREE_TYPE (tem
))
1846 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1849 loc
= sizeof_arg_loc
[idx
];
1853 if (!TYPE_P (sizeof_arg
[idx
])
1854 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1855 && comp_types (TREE_TYPE (dest
), type
))
1857 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1858 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1859 "argument to %<sizeof%> in %qD call is the same "
1860 "expression as the destination; did you mean to "
1861 "remove the addressof?", callee
);
1862 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1863 == TYPE_PRECISION (char_type_node
))
1865 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1866 "argument to %<sizeof%> in %qD call is the same "
1867 "expression as the destination; did you mean to "
1868 "provide an explicit length?", callee
);
1870 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1871 "argument to %<sizeof%> in %qD call is the same "
1872 "expression as the destination; did you mean to "
1873 "dereference it?", callee
);
1877 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1879 && comp_types (TREE_TYPE (dest
), type
)
1880 && !VOID_TYPE_P (TREE_TYPE (type
)))
1882 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1883 "argument to %<sizeof%> in %qD call is the same "
1884 "pointer type %qT as the destination; expected %qT "
1885 "or an explicit length", callee
, TREE_TYPE (dest
),
1886 TREE_TYPE (TREE_TYPE (dest
)));
1893 if (!TYPE_P (sizeof_arg
[idx
])
1894 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1895 && comp_types (TREE_TYPE (src
), type
))
1897 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1898 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1899 "argument to %<sizeof%> in %qD call is the same "
1900 "expression as the source; did you mean to "
1901 "remove the addressof?", callee
);
1902 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1903 == TYPE_PRECISION (char_type_node
))
1905 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1906 "argument to %<sizeof%> in %qD call is the same "
1907 "expression as the source; did you mean to "
1908 "provide an explicit length?", callee
);
1910 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1911 "argument to %<sizeof%> in %qD call is the same "
1912 "expression as the source; did you mean to "
1913 "dereference it?", callee
);
1917 if (POINTER_TYPE_P (TREE_TYPE (src
))
1919 && comp_types (TREE_TYPE (src
), type
)
1920 && !VOID_TYPE_P (TREE_TYPE (type
)))
1922 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1923 "argument to %<sizeof%> in %qD call is the same "
1924 "pointer type %qT as the source; expected %qT "
1925 "or an explicit length", callee
, TREE_TYPE (src
),
1926 TREE_TYPE (TREE_TYPE (src
)));
1933 if (!TYPE_P (sizeof_arg
[idx
])
1934 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1935 && comp_types (TREE_TYPE (dest
), type
))
1937 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1938 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1939 "argument to %<sizeof%> in %qD call is the same "
1940 "expression as the first source; did you mean to "
1941 "remove the addressof?", callee
);
1942 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1943 == TYPE_PRECISION (char_type_node
))
1945 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1946 "argument to %<sizeof%> in %qD call is the same "
1947 "expression as the first source; did you mean to "
1948 "provide an explicit length?", callee
);
1950 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1951 "argument to %<sizeof%> in %qD call is the same "
1952 "expression as the first source; did you mean to "
1953 "dereference it?", callee
);
1957 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1959 && comp_types (TREE_TYPE (dest
), type
)
1960 && !VOID_TYPE_P (TREE_TYPE (type
)))
1962 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1963 "argument to %<sizeof%> in %qD call is the same "
1964 "pointer type %qT as the first source; expected %qT "
1965 "or an explicit length", callee
, TREE_TYPE (dest
),
1966 TREE_TYPE (TREE_TYPE (dest
)));
1973 if (!TYPE_P (sizeof_arg
[idx
])
1974 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1975 && comp_types (TREE_TYPE (src
), type
))
1977 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1978 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1979 "argument to %<sizeof%> in %qD call is the same "
1980 "expression as the second source; did you mean to "
1981 "remove the addressof?", callee
);
1982 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1983 == TYPE_PRECISION (char_type_node
))
1985 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1986 "argument to %<sizeof%> in %qD call is the same "
1987 "expression as the second source; did you mean to "
1988 "provide an explicit length?", callee
);
1990 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1991 "argument to %<sizeof%> in %qD call is the same "
1992 "expression as the second source; did you mean to "
1993 "dereference it?", callee
);
1997 if (POINTER_TYPE_P (TREE_TYPE (src
))
1999 && comp_types (TREE_TYPE (src
), type
)
2000 && !VOID_TYPE_P (TREE_TYPE (type
)))
2002 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
2003 "argument to %<sizeof%> in %qD call is the same "
2004 "pointer type %qT as the second source; expected %qT "
2005 "or an explicit length", callee
, TREE_TYPE (src
),
2006 TREE_TYPE (TREE_TYPE (src
)));
2013 /* Warn for unlikely, improbable, or stupid DECL declarations
2017 check_main_parameter_types (tree decl
)
2019 function_args_iterator iter
;
2023 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl
), type
, iter
)
2025 /* XXX void_type_node belies the abstraction. */
2026 if (type
== void_type_node
|| type
== error_mark_node
)
2030 if (TYPE_ATOMIC (t
))
2031 pedwarn (input_location
, OPT_Wmain
,
2032 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2034 while (POINTER_TYPE_P (t
))
2037 if (TYPE_ATOMIC (t
))
2038 pedwarn (input_location
, OPT_Wmain
,
2039 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2047 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
2048 pedwarn (input_location
, OPT_Wmain
,
2049 "first argument of %q+D should be %<int%>", decl
);
2053 if (TREE_CODE (type
) != POINTER_TYPE
2054 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2055 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2057 pedwarn (input_location
, OPT_Wmain
,
2058 "second argument of %q+D should be %<char **%>", decl
);
2062 if (TREE_CODE (type
) != POINTER_TYPE
2063 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2064 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2066 pedwarn (input_location
, OPT_Wmain
,
2067 "third argument of %q+D should probably be "
2068 "%<char **%>", decl
);
2073 /* It is intentional that this message does not mention the third
2074 argument because it's only mentioned in an appendix of the
2076 if (argct
> 0 && (argct
< 2 || argct
> 3))
2077 pedwarn (input_location
, OPT_Wmain
,
2078 "%q+D takes only zero or two arguments", decl
);
2080 if (stdarg_p (TREE_TYPE (decl
)))
2081 pedwarn (input_location
, OPT_Wmain
,
2082 "%q+D declared as variadic function", decl
);
2085 /* vector_targets_convertible_p is used for vector pointer types. The
2086 callers perform various checks that the qualifiers are satisfactory,
2087 while OTOH vector_targets_convertible_p ignores the number of elements
2088 in the vectors. That's fine with vector pointers as we can consider,
2089 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2090 and that does not require and conversion of the pointer values.
2091 In contrast, vector_types_convertible_p and
2092 vector_types_compatible_elements_p are used for vector value types. */
2093 /* True if pointers to distinct types T1 and T2 can be converted to
2094 each other without an explicit cast. Only returns true for opaque
2097 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
2099 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
2100 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2101 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2107 /* vector_types_convertible_p is used for vector value types.
2108 It could in principle call vector_targets_convertible_p as a subroutine,
2109 but then the check for vector type would be duplicated with its callers,
2110 and also the purpose of vector_targets_convertible_p would become
2112 Where vector_types_convertible_p returns true, a conversion might still be
2113 needed to make the types match.
2114 In contrast, vector_targets_convertible_p is used for vector pointer
2115 values, and vector_types_compatible_elements_p is used specifically
2116 in the context for binary operators, as a check if use is possible without
2118 /* True if vector types T1 and T2 can be converted to each other
2119 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2120 can only be converted with -flax-vector-conversions yet that is not
2121 in effect, emit a note telling the user about that option if such
2122 a note has not previously been emitted. */
2124 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
2126 static bool emitted_lax_note
= false;
2127 bool convertible_lax
;
2129 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2130 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2134 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
2135 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
2136 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
2137 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
2138 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
2140 if (!convertible_lax
|| flag_lax_vector_conversions
)
2141 return convertible_lax
;
2143 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
2144 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2147 if (emit_lax_note
&& !emitted_lax_note
)
2149 emitted_lax_note
= true;
2150 inform (input_location
, "use -flax-vector-conversions to permit "
2151 "conversions between vectors with differing "
2152 "element types or numbers of subparts");
2158 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2159 and have vector types, V0 has the same type as V1, and the number of
2160 elements of V0, V1, MASK is the same.
2162 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2163 called with two arguments. In this case implementation passes the
2164 first argument twice in order to share the same tree code. This fact
2165 could enable the mask-values being twice the vector length. This is
2166 an implementation accident and this semantics is not guaranteed to
2169 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
2174 bool maybe_const
= false;
2175 bool two_arguments
= false;
2177 if (v1
== NULL_TREE
)
2179 two_arguments
= true;
2183 if (v0
== error_mark_node
|| v1
== error_mark_node
2184 || mask
== error_mark_node
)
2185 return error_mark_node
;
2187 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
2190 error_at (loc
, "__builtin_shuffle last argument must "
2191 "be an integer vector");
2192 return error_mark_node
;
2195 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
2196 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
2199 error_at (loc
, "__builtin_shuffle arguments must be vectors");
2200 return error_mark_node
;
2203 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
2206 error_at (loc
, "__builtin_shuffle argument vectors must be of "
2208 return error_mark_node
;
2211 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
2212 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
2213 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
2214 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
2217 error_at (loc
, "__builtin_shuffle number of elements of the "
2218 "argument vector(s) and the mask vector should "
2220 return error_mark_node
;
2223 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
2224 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
2227 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
2228 "must have the same size as inner type of the mask");
2229 return error_mark_node
;
2232 if (!c_dialect_cxx ())
2234 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2235 v0
= c_fully_fold (v0
, false, &maybe_const
);
2236 wrap
&= maybe_const
;
2239 v1
= v0
= save_expr (v0
);
2242 v1
= c_fully_fold (v1
, false, &maybe_const
);
2243 wrap
&= maybe_const
;
2246 mask
= c_fully_fold (mask
, false, &maybe_const
);
2247 wrap
&= maybe_const
;
2249 else if (two_arguments
)
2250 v1
= v0
= save_expr (v0
);
2252 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
2254 if (!c_dialect_cxx () && !wrap
)
2255 ret
= c_wrap_maybe_const (ret
, true);
2260 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2261 to integral type. */
2264 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
2266 op
= get_narrower (op
, unsignedp_ptr
);
2268 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
2269 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
2271 /* C++0x scoped enumerations don't implicitly convert to integral
2272 type; if we stripped an explicit conversion to a larger type we
2273 need to replace it so common_type will still work. */
2274 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
2275 TYPE_UNSIGNED (TREE_TYPE (op
)));
2276 op
= fold_convert (type
, op
);
2281 /* This is a helper function of build_binary_op.
2283 For certain operations if both args were extended from the same
2284 smaller type, do the arithmetic in that type and then extend.
2286 BITWISE indicates a bitwise operation.
2287 For them, this optimization is safe only if
2288 both args are zero-extended or both are sign-extended.
2289 Otherwise, we might change the result.
2290 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2291 but calculated in (unsigned short) it would be (unsigned short)-1.
2294 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
2296 int unsigned0
, unsigned1
;
2301 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2302 excessive narrowing when we call get_narrower below. For
2303 example, suppose that OP0 is of unsigned int extended
2304 from signed char and that RESULT_TYPE is long long int.
2305 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2308 (long long int) (unsigned int) signed_char
2310 which get_narrower would narrow down to
2312 (unsigned int) signed char
2314 If we do not cast OP0 first, get_narrower would return
2315 signed_char, which is inconsistent with the case of the
2317 op0
= convert (result_type
, op0
);
2318 op1
= convert (result_type
, op1
);
2320 arg0
= c_common_get_narrower (op0
, &unsigned0
);
2321 arg1
= c_common_get_narrower (op1
, &unsigned1
);
2323 /* UNS is 1 if the operation to be done is an unsigned one. */
2324 uns
= TYPE_UNSIGNED (result_type
);
2326 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2327 but it *requires* conversion to FINAL_TYPE. */
2329 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2330 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2331 && TREE_TYPE (op0
) != result_type
)
2332 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2333 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2334 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2335 && TREE_TYPE (op1
) != result_type
)
2336 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2338 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2340 /* For bitwise operations, signedness of nominal type
2341 does not matter. Consider only how operands were extended. */
2345 /* Note that in all three cases below we refrain from optimizing
2346 an unsigned operation on sign-extended args.
2347 That would not be valid. */
2349 /* Both args variable: if both extended in same way
2350 from same width, do it in that width.
2351 Do it unsigned if args were zero-extended. */
2352 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2353 < TYPE_PRECISION (result_type
))
2354 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2355 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2356 && unsigned0
== unsigned1
2357 && (unsigned0
|| !uns
))
2358 return c_common_signed_or_unsigned_type
2359 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2361 else if (TREE_CODE (arg0
) == INTEGER_CST
2362 && (unsigned1
|| !uns
)
2363 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2364 < TYPE_PRECISION (result_type
))
2366 = c_common_signed_or_unsigned_type (unsigned1
,
2368 && !POINTER_TYPE_P (type
)
2369 && int_fits_type_p (arg0
, type
))
2372 else if (TREE_CODE (arg1
) == INTEGER_CST
2373 && (unsigned0
|| !uns
)
2374 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2375 < TYPE_PRECISION (result_type
))
2377 = c_common_signed_or_unsigned_type (unsigned0
,
2379 && !POINTER_TYPE_P (type
)
2380 && int_fits_type_p (arg1
, type
))
2386 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2387 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2390 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
2392 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
2393 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
2394 REAL_VALUE_TYPE real_low_bound
=
2395 real_value_from_int_cst (0, type_low_bound
);
2396 REAL_VALUE_TYPE real_high_bound
=
2397 real_value_from_int_cst (0, type_high_bound
);
2399 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
2400 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
2403 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2404 to the complex/real/integer type TYPE. Function returns non-zero when:
2405 * EXPR is a constant which cannot be exactly converted to TYPE.
2406 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2407 for EXPR type and TYPE being both integers or both real, or both
2409 * EXPR is not a constant of complex type and TYPE is a real or
2411 * EXPR is not a constant of real type and TYPE is an integer.
2412 * EXPR is not a constant of integer type which cannot be
2413 exactly converted to real type.
2415 Function allows conversions between types of different signedness and
2416 can return SAFE_CONVERSION (zero) in that case. Function can produce
2417 signedness warnings if PRODUCE_WARNS is true.
2419 Function allows conversions from complex constants to non-complex types,
2420 provided that imaginary part is zero and real part can be safely converted
2423 enum conversion_safety
2424 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, bool produce_warns
)
2426 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
2427 tree expr_type
= TREE_TYPE (expr
);
2428 loc
= expansion_point_location_if_in_system_header (loc
);
2430 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
2432 /* If type is complex, we are interested in compatibility with
2434 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2435 type
= TREE_TYPE (type
);
2437 /* Warn for real constant that is not an exact integer converted
2439 if (TREE_CODE (expr_type
) == REAL_TYPE
2440 && TREE_CODE (type
) == INTEGER_TYPE
)
2442 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
2443 give_warning
= UNSAFE_REAL
;
2445 /* Warn for an integer constant that does not fit into integer type. */
2446 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2447 && TREE_CODE (type
) == INTEGER_TYPE
2448 && !int_fits_type_p (expr
, type
))
2450 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
2451 && tree_int_cst_sgn (expr
) < 0)
2454 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
2455 " implicitly converted to unsigned type");
2457 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
2460 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
2461 " constant value to negative integer");
2464 give_warning
= UNSAFE_OTHER
;
2466 else if (TREE_CODE (type
) == REAL_TYPE
)
2468 /* Warn for an integer constant that does not fit into real type. */
2469 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
2471 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
2472 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2473 give_warning
= UNSAFE_REAL
;
2475 /* Warn for a real constant that does not fit into a smaller
2477 else if (TREE_CODE (expr_type
) == REAL_TYPE
2478 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2480 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2481 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2482 give_warning
= UNSAFE_REAL
;
2487 else if (TREE_CODE (expr
) == COMPLEX_CST
)
2489 tree imag_part
= TREE_IMAGPART (expr
);
2490 /* Conversion from complex constant with zero imaginary part,
2491 perform check for conversion of real part. */
2492 if ((TREE_CODE (imag_part
) == REAL_CST
2493 && real_zerop (imag_part
))
2494 || (TREE_CODE (imag_part
) == INTEGER_CST
2495 && integer_zerop (imag_part
)))
2496 /* Note: in this branch we use recursive call to unsafe_conversion_p
2497 with different type of EXPR, but it is still safe, because when EXPR
2498 is a constant, it's type is not used in text of generated warnings
2499 (otherwise they could sound misleading). */
2500 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
2502 /* Conversion from complex constant with non-zero imaginary part. */
2505 /* Conversion to complex type.
2506 Perform checks for both real and imaginary parts. */
2507 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2509 /* Unfortunately, produce_warns must be false in two subsequent
2510 calls of unsafe_conversion_p, because otherwise we could
2511 produce strange "double" warnings, if both real and imaginary
2512 parts have conversion problems related to signedness.
2515 int32_t _Complex a = 0x80000000 + 0x80000000i;
2517 Possible solution: add a separate function for checking
2518 constants and combine result of two calls appropriately. */
2519 enum conversion_safety re_safety
=
2520 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), false);
2521 enum conversion_safety im_safety
=
2522 unsafe_conversion_p (loc
, type
, imag_part
, false);
2524 /* Merge the results into appropriate single warning. */
2526 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2527 if (re_safety
== im_safety
)
2528 give_warning
= re_safety
;
2529 else if (!re_safety
&& im_safety
)
2530 give_warning
= im_safety
;
2531 else if (re_safety
&& !im_safety
)
2532 give_warning
= re_safety
;
2534 give_warning
= UNSAFE_OTHER
;
2536 /* Warn about conversion from complex to real or integer type. */
2538 give_warning
= UNSAFE_IMAGINARY
;
2542 /* Checks for remaining case: EXPR is not constant. */
2545 /* Warn for real types converted to integer types. */
2546 if (TREE_CODE (expr_type
) == REAL_TYPE
2547 && TREE_CODE (type
) == INTEGER_TYPE
)
2548 give_warning
= UNSAFE_REAL
;
2550 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2551 && TREE_CODE (type
) == INTEGER_TYPE
)
2553 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2554 expr
= get_unwidened (expr
, 0);
2555 expr_type
= TREE_TYPE (expr
);
2557 /* Don't warn for short y; short x = ((int)y & 0xff); */
2558 if (TREE_CODE (expr
) == BIT_AND_EXPR
2559 || TREE_CODE (expr
) == BIT_IOR_EXPR
2560 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2562 /* If both args were extended from a shortest type,
2563 use that type if that is safe. */
2564 expr_type
= shorten_binary_op (expr_type
,
2565 TREE_OPERAND (expr
, 0),
2566 TREE_OPERAND (expr
, 1),
2569 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2571 tree op0
= TREE_OPERAND (expr
, 0);
2572 tree op1
= TREE_OPERAND (expr
, 1);
2573 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2574 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2576 /* If one of the operands is a non-negative constant
2577 that fits in the target type, then the type of the
2578 other operand does not matter. */
2579 if ((TREE_CODE (op0
) == INTEGER_CST
2580 && int_fits_type_p (op0
, c_common_signed_type (type
))
2581 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2582 || (TREE_CODE (op1
) == INTEGER_CST
2583 && int_fits_type_p (op1
, c_common_signed_type (type
))
2584 && int_fits_type_p (op1
,
2585 c_common_unsigned_type (type
))))
2586 return SAFE_CONVERSION
;
2587 /* If constant is unsigned and fits in the target
2588 type, then the result will also fit. */
2589 else if ((TREE_CODE (op0
) == INTEGER_CST
2591 && int_fits_type_p (op0
, type
))
2592 || (TREE_CODE (op1
) == INTEGER_CST
2594 && int_fits_type_p (op1
, type
)))
2595 return SAFE_CONVERSION
;
2598 /* Warn for integer types converted to smaller integer types. */
2599 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2600 give_warning
= UNSAFE_OTHER
;
2602 /* When they are the same width but different signedness,
2603 then the value may change. */
2604 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2605 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2606 /* Even when converted to a bigger type, if the type is
2607 unsigned but expr is signed, then negative values
2609 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2611 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
2612 "may change the sign of the result",
2616 /* Warn for integer types converted to real types if and only if
2617 all the range of values of the integer type cannot be
2618 represented by the real type. */
2619 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2620 && TREE_CODE (type
) == REAL_TYPE
)
2622 /* Don't warn about char y = 0xff; float x = (int) y; */
2623 expr
= get_unwidened (expr
, 0);
2624 expr_type
= TREE_TYPE (expr
);
2626 if (!int_safely_convertible_to_real_p (expr_type
, type
))
2627 give_warning
= UNSAFE_OTHER
;
2630 /* Warn for real types converted to smaller real types. */
2631 else if (TREE_CODE (expr_type
) == REAL_TYPE
2632 && TREE_CODE (type
) == REAL_TYPE
2633 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2634 give_warning
= UNSAFE_REAL
;
2636 /* Check conversion between two complex types. */
2637 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2638 && TREE_CODE (type
) == COMPLEX_TYPE
)
2640 /* Extract underlying types (i.e., type of real and imaginary
2641 parts) of expr_type and type. */
2642 tree from_type
= TREE_TYPE (expr_type
);
2643 tree to_type
= TREE_TYPE (type
);
2645 /* Warn for real types converted to integer types. */
2646 if (TREE_CODE (from_type
) == REAL_TYPE
2647 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2648 give_warning
= UNSAFE_REAL
;
2650 /* Warn for real types converted to smaller real types. */
2651 else if (TREE_CODE (from_type
) == REAL_TYPE
2652 && TREE_CODE (to_type
) == REAL_TYPE
2653 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2654 give_warning
= UNSAFE_REAL
;
2656 /* Check conversion for complex integer types. Here implementation
2657 is simpler than for real-domain integers because it does not
2658 involve sophisticated cases, such as bitmasks, casts, etc. */
2659 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2660 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2662 /* Warn for integer types converted to smaller integer types. */
2663 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2664 give_warning
= UNSAFE_OTHER
;
2666 /* Check for different signedness, see case for real-domain
2667 integers (above) for a more detailed comment. */
2668 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
2669 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
2670 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
2672 warning_at (loc
, OPT_Wsign_conversion
,
2673 "conversion to %qT from %qT "
2674 "may change the sign of the result",
2677 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2678 && TREE_CODE (to_type
) == REAL_TYPE
2679 && !int_safely_convertible_to_real_p (from_type
, to_type
))
2680 give_warning
= UNSAFE_OTHER
;
2683 /* Warn for complex types converted to real or integer types. */
2684 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2685 && TREE_CODE (type
) != COMPLEX_TYPE
)
2686 give_warning
= UNSAFE_IMAGINARY
;
2689 return give_warning
;
2692 /* Warns if the conversion of EXPR to TYPE may alter a value.
2693 This is a helper function for warnings_for_convert_and_check. */
2696 conversion_warning (location_t loc
, tree type
, tree expr
)
2698 tree expr_type
= TREE_TYPE (expr
);
2699 enum conversion_safety conversion_kind
;
2701 if (!warn_conversion
&& !warn_sign_conversion
&& !warn_float_conversion
)
2704 /* This may happen, because for LHS op= RHS we preevaluate
2705 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2706 means we could no longer see the code of the EXPR. */
2707 if (TREE_CODE (expr
) == C_MAYBE_CONST_EXPR
)
2708 expr
= C_MAYBE_CONST_EXPR_EXPR (expr
);
2709 if (TREE_CODE (expr
) == SAVE_EXPR
)
2710 expr
= TREE_OPERAND (expr
, 0);
2712 switch (TREE_CODE (expr
))
2720 case TRUTH_ANDIF_EXPR
:
2721 case TRUTH_ORIF_EXPR
:
2722 case TRUTH_AND_EXPR
:
2724 case TRUTH_XOR_EXPR
:
2725 case TRUTH_NOT_EXPR
:
2726 /* Conversion from boolean to a signed:1 bit-field (which only
2727 can hold the values 0 and -1) doesn't lose information - but
2728 it does change the value. */
2729 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2730 warning_at (loc
, OPT_Wconversion
,
2731 "conversion to %qT from boolean expression", type
);
2737 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2738 if (conversion_kind
== UNSAFE_REAL
)
2739 warning_at (loc
, OPT_Wfloat_conversion
,
2740 "conversion to %qT alters %qT constant value",
2742 else if (conversion_kind
)
2743 warning_at (loc
, OPT_Wconversion
,
2744 "conversion to %qT alters %qT constant value",
2750 /* In case of COND_EXPR, we do not care about the type of
2751 COND_EXPR, only about the conversion of each operand. */
2752 tree op1
= TREE_OPERAND (expr
, 1);
2753 tree op2
= TREE_OPERAND (expr
, 2);
2755 conversion_warning (loc
, type
, op1
);
2756 conversion_warning (loc
, type
, op2
);
2760 default: /* 'expr' is not a constant. */
2761 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2762 if (conversion_kind
== UNSAFE_REAL
)
2763 warning_at (loc
, OPT_Wfloat_conversion
,
2764 "conversion to %qT from %qT may alter its value",
2766 else if (conversion_kind
== UNSAFE_IMAGINARY
)
2767 warning_at (loc
, OPT_Wconversion
,
2768 "conversion to %qT from %qT discards imaginary component",
2770 else if (conversion_kind
)
2771 warning_at (loc
, OPT_Wconversion
,
2772 "conversion to %qT from %qT may alter its value",
2777 /* Produce warnings after a conversion. RESULT is the result of
2778 converting EXPR to TYPE. This is a helper function for
2779 convert_and_check and cp_convert_and_check. */
2782 warnings_for_convert_and_check (location_t loc
, tree type
, tree expr
,
2785 loc
= expansion_point_location_if_in_system_header (loc
);
2787 if (TREE_CODE (expr
) == INTEGER_CST
2788 && (TREE_CODE (type
) == INTEGER_TYPE
2789 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2790 && !int_fits_type_p (expr
, type
))
2792 /* Do not diagnose overflow in a constant expression merely
2793 because a conversion overflowed. */
2794 if (TREE_OVERFLOW (result
))
2795 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2797 if (TYPE_UNSIGNED (type
))
2799 /* This detects cases like converting -129 or 256 to
2801 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2802 warning_at (loc
, OPT_Woverflow
,
2803 "large integer implicitly truncated to unsigned type");
2805 conversion_warning (loc
, type
, expr
);
2807 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2808 warning_at (loc
, OPT_Woverflow
,
2809 "overflow in implicit constant conversion");
2810 /* No warning for converting 0x80000000 to int. */
2812 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2813 || TYPE_PRECISION (TREE_TYPE (expr
))
2814 != TYPE_PRECISION (type
)))
2815 warning_at (loc
, OPT_Woverflow
,
2816 "overflow in implicit constant conversion");
2819 conversion_warning (loc
, type
, expr
);
2821 else if ((TREE_CODE (result
) == INTEGER_CST
2822 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2823 warning_at (loc
, OPT_Woverflow
,
2824 "overflow in implicit constant conversion");
2826 conversion_warning (loc
, type
, expr
);
2830 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2831 Invoke this function on every expression that is converted implicitly,
2832 i.e. because of language rules and not because of an explicit cast. */
2835 convert_and_check (location_t loc
, tree type
, tree expr
)
2838 tree expr_for_warning
;
2840 /* Convert from a value with possible excess precision rather than
2841 via the semantic type, but do not warn about values not fitting
2842 exactly in the semantic type. */
2843 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2845 tree orig_type
= TREE_TYPE (expr
);
2846 expr
= TREE_OPERAND (expr
, 0);
2847 expr_for_warning
= convert (orig_type
, expr
);
2848 if (orig_type
== type
)
2849 return expr_for_warning
;
2852 expr_for_warning
= expr
;
2854 if (TREE_TYPE (expr
) == type
)
2857 result
= convert (type
, expr
);
2859 if (c_inhibit_evaluation_warnings
== 0
2860 && !TREE_OVERFLOW_P (expr
)
2861 && result
!= error_mark_node
)
2862 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
2867 /* A node in a list that describes references to variables (EXPR), which are
2868 either read accesses if WRITER is zero, or write accesses, in which case
2869 WRITER is the parent of EXPR. */
2876 /* Used to implement a cache the results of a call to verify_tree. We only
2877 use this for SAVE_EXPRs. */
2880 struct tlist_cache
*next
;
2881 struct tlist
*cache_before_sp
;
2882 struct tlist
*cache_after_sp
;
2886 /* Obstack to use when allocating tlist structures, and corresponding
2888 static struct obstack tlist_obstack
;
2889 static char *tlist_firstobj
= 0;
2891 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2893 static struct tlist
*warned_ids
;
2894 /* SAVE_EXPRs need special treatment. We process them only once and then
2895 cache the results. */
2896 static struct tlist_cache
*save_expr_cache
;
2898 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2899 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2900 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2901 static int warning_candidate_p (tree
);
2902 static bool candidate_equal_p (const_tree
, const_tree
);
2903 static void warn_for_collisions (struct tlist
*);
2904 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2905 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2907 /* Create a new struct tlist and fill in its fields. */
2908 static struct tlist
*
2909 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2912 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2919 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2920 is nonnull, we ignore any node we find which has a writer equal to it. */
2923 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2927 struct tlist
*next
= add
->next
;
2930 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2931 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2936 /* Merge the nodes of ADD into TO. This merging process is done so that for
2937 each variable that already exists in TO, no new node is added; however if
2938 there is a write access recorded in ADD, and an occurrence on TO is only
2939 a read access, then the occurrence in TO will be modified to record the
2943 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2945 struct tlist
**end
= to
;
2948 end
= &(*end
)->next
;
2954 struct tlist
*next
= add
->next
;
2956 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2957 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2961 tmp2
->writer
= add
->writer
;
2965 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
2966 end
= &(*end
)->next
;
2973 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2974 references in list LIST conflict with it, excluding reads if ONLY writers
2978 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2983 /* Avoid duplicate warnings. */
2984 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2985 if (candidate_equal_p (tmp
->expr
, written
))
2990 if (candidate_equal_p (list
->expr
, written
)
2991 && !candidate_equal_p (list
->writer
, writer
)
2992 && (!only_writes
|| list
->writer
))
2994 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2995 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
2996 OPT_Wsequence_point
, "operation on %qE may be undefined",
3003 /* Given a list LIST of references to variables, find whether any of these
3004 can cause conflicts due to missing sequence points. */
3007 warn_for_collisions (struct tlist
*list
)
3011 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
3014 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
3018 /* Return nonzero if X is a tree that can be verified by the sequence point
3021 warning_candidate_p (tree x
)
3023 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
3026 if (TREE_CODE (x
) == BLOCK
)
3029 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3030 (lvalue_p) crash on TRY/CATCH. */
3031 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
3037 /* No point to track non-const calls, they will never satisfy
3039 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
3042 if (TREE_CODE (x
) == STRING_CST
)
3048 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3050 candidate_equal_p (const_tree x
, const_tree y
)
3052 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
3055 /* Walk the tree X, and record accesses to variables. If X is written by the
3056 parent tree, WRITER is the parent.
3057 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3058 expression or its only operand forces a sequence point, then everything up
3059 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3061 Once we return, we will have emitted warnings if any subexpression before
3062 such a sequence point could be undefined. On a higher level, however, the
3063 sequence point may not be relevant, and we'll merge the two lists.
3065 Example: (b++, a) + b;
3066 The call that processes the COMPOUND_EXPR will store the increment of B
3067 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3068 processes the PLUS_EXPR will need to merge the two lists so that
3069 eventually, all accesses end up on the same list (and we'll warn about the
3070 unordered subexpressions b++ and b.
3072 A note on merging. If we modify the former example so that our expression
3075 care must be taken not simply to add all three expressions into the final
3076 PNO_SP list. The function merge_tlist takes care of that by merging the
3077 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3078 way, so that no more than one access to B is recorded. */
3081 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
3084 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
3085 enum tree_code code
;
3086 enum tree_code_class cl
;
3088 /* X may be NULL if it is the operand of an empty statement expression
3094 code
= TREE_CODE (x
);
3095 cl
= TREE_CODE_CLASS (code
);
3097 if (warning_candidate_p (x
))
3098 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
3107 case TRUTH_ANDIF_EXPR
:
3108 case TRUTH_ORIF_EXPR
:
3109 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
3110 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3111 warn_for_collisions (tmp_nosp
);
3112 merge_tlist (pbefore_sp
, tmp_before
, 0);
3113 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
3114 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3115 warn_for_collisions (tmp_list2
);
3116 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3117 merge_tlist (pno_sp
, tmp_list2
, 0);
3121 tmp_before
= tmp_list2
= 0;
3122 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
3123 warn_for_collisions (tmp_list2
);
3124 merge_tlist (pbefore_sp
, tmp_before
, 0);
3125 merge_tlist (pbefore_sp
, tmp_list2
, 0);
3127 tmp_list3
= tmp_nosp
= 0;
3128 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
3129 warn_for_collisions (tmp_nosp
);
3130 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3132 tmp_list3
= tmp_list2
= 0;
3133 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3134 warn_for_collisions (tmp_list2
);
3135 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3136 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3137 two first, to avoid warning for (a ? b++ : b++). */
3138 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
3139 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3142 case PREDECREMENT_EXPR
:
3143 case PREINCREMENT_EXPR
:
3144 case POSTDECREMENT_EXPR
:
3145 case POSTINCREMENT_EXPR
:
3146 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
3150 tmp_before
= tmp_nosp
= tmp_list3
= 0;
3151 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3152 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
3153 /* Expressions inside the LHS are not ordered wrt. the sequence points
3154 in the RHS. Example:
3156 Despite the fact that the modification of "a" is in the before_sp
3157 list (tmp_before), it conflicts with the use of "a" in the LHS.
3158 We can handle this by adding the contents of tmp_list3
3159 to those of tmp_before, and redoing the collision warnings for that
3161 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
3162 warn_for_collisions (tmp_before
);
3163 /* Exclude the LHS itself here; we first have to merge it into the
3164 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3165 didn't exclude the LHS, we'd get it twice, once as a read and once
3167 add_tlist (pno_sp
, tmp_list3
, x
, 0);
3168 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
3170 merge_tlist (pbefore_sp
, tmp_before
, 0);
3171 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
3172 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
3173 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
3177 /* We need to warn about conflicts among arguments and conflicts between
3178 args and the function address. Side effects of the function address,
3179 however, are not ordered by the sequence point of the call. */
3181 call_expr_arg_iterator iter
;
3183 tmp_before
= tmp_nosp
= 0;
3184 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3185 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
3187 tmp_list2
= tmp_list3
= 0;
3188 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
3189 merge_tlist (&tmp_list3
, tmp_list2
, 0);
3190 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
3192 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
3193 warn_for_collisions (tmp_before
);
3194 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
3199 /* Scan all the list, e.g. indices of multi dimensional array. */
3202 tmp_before
= tmp_nosp
= 0;
3203 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3204 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3205 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3212 struct tlist_cache
*t
;
3213 for (t
= save_expr_cache
; t
; t
= t
->next
)
3214 if (candidate_equal_p (t
->expr
, x
))
3219 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
3220 t
->next
= save_expr_cache
;
3222 save_expr_cache
= t
;
3224 tmp_before
= tmp_nosp
= 0;
3225 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3226 warn_for_collisions (tmp_nosp
);
3229 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
3230 t
->cache_before_sp
= tmp_before
;
3231 t
->cache_after_sp
= tmp_list3
;
3233 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
3234 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
3239 x
= TREE_OPERAND (x
, 0);
3246 /* For other expressions, simply recurse on their operands.
3247 Manual tail recursion for unary expressions.
3248 Other non-expressions need not be processed. */
3249 if (cl
== tcc_unary
)
3251 x
= TREE_OPERAND (x
, 0);
3255 else if (IS_EXPR_CODE_CLASS (cl
))
3258 int max
= TREE_OPERAND_LENGTH (x
);
3259 for (lp
= 0; lp
< max
; lp
++)
3261 tmp_before
= tmp_nosp
= 0;
3262 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
3263 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3264 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3271 /* Try to warn for undefined behavior in EXPR due to missing sequence
3275 verify_sequence_points (tree expr
)
3277 struct tlist
*before_sp
= 0, *after_sp
= 0;
3280 save_expr_cache
= 0;
3281 if (tlist_firstobj
== 0)
3283 gcc_obstack_init (&tlist_obstack
);
3284 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
3287 verify_tree (expr
, &before_sp
, &after_sp
, 0);
3288 warn_for_collisions (after_sp
);
3289 obstack_free (&tlist_obstack
, tlist_firstobj
);
3292 /* Validate the expression after `case' and apply default promotions. */
3295 check_case_value (location_t loc
, tree value
)
3297 if (value
== NULL_TREE
)
3300 if (TREE_CODE (value
) == INTEGER_CST
)
3301 /* Promote char or short to int. */
3302 value
= perform_integral_promotions (value
);
3303 else if (value
!= error_mark_node
)
3305 error_at (loc
, "case label does not reduce to an integer constant");
3306 value
= error_mark_node
;
3309 constant_expression_warning (value
);
3314 /* See if the case values LOW and HIGH are in the range of the original
3315 type (i.e. before the default conversion to int) of the switch testing
3317 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3318 the type before promoting it. CASE_LOW_P is a pointer to the lower
3319 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3320 if the case is not a case range.
3321 The caller has to make sure that we are not called with NULL for
3322 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3323 was a case value that doesn't fit into the range of the ORIG_TYPE.
3324 Returns true if the case label is in range of ORIG_TYPE (saturated or
3325 untouched) or false if the label is out of range. */
3328 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
3329 tree
*case_low_p
, tree
*case_high_p
,
3330 bool *outside_range_p
)
3332 tree min_value
, max_value
;
3333 tree case_low
= *case_low_p
;
3334 tree case_high
= case_high_p
? *case_high_p
: case_low
;
3336 /* If there was a problem with the original type, do nothing. */
3337 if (orig_type
== error_mark_node
)
3340 min_value
= TYPE_MIN_VALUE (orig_type
);
3341 max_value
= TYPE_MAX_VALUE (orig_type
);
3343 /* We'll really need integer constants here. */
3344 case_low
= fold (case_low
);
3345 case_high
= fold (case_high
);
3347 /* Case label is less than minimum for type. */
3348 if (tree_int_cst_compare (case_low
, min_value
) < 0
3349 && tree_int_cst_compare (case_high
, min_value
) < 0)
3351 warning_at (loc
, 0, "case label value is less than minimum value "
3353 *outside_range_p
= true;
3357 /* Case value is greater than maximum for type. */
3358 if (tree_int_cst_compare (case_low
, max_value
) > 0
3359 && tree_int_cst_compare (case_high
, max_value
) > 0)
3361 warning_at (loc
, 0, "case label value exceeds maximum value for type");
3362 *outside_range_p
= true;
3366 /* Saturate lower case label value to minimum. */
3367 if (tree_int_cst_compare (case_high
, min_value
) >= 0
3368 && tree_int_cst_compare (case_low
, min_value
) < 0)
3370 warning_at (loc
, 0, "lower value in case label range"
3371 " less than minimum value for type");
3372 *outside_range_p
= true;
3373 case_low
= min_value
;
3376 /* Saturate upper case label value to maximum. */
3377 if (tree_int_cst_compare (case_low
, max_value
) <= 0
3378 && tree_int_cst_compare (case_high
, max_value
) > 0)
3380 warning_at (loc
, 0, "upper value in case label range"
3381 " exceeds maximum value for type");
3382 *outside_range_p
= true;
3383 case_high
= max_value
;
3386 if (*case_low_p
!= case_low
)
3387 *case_low_p
= convert (type
, case_low
);
3388 if (case_high_p
&& *case_high_p
!= case_high
)
3389 *case_high_p
= convert (type
, case_high
);
3394 /* Return an integer type with BITS bits of precision,
3395 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3398 c_common_type_for_size (unsigned int bits
, int unsignedp
)
3402 if (bits
== TYPE_PRECISION (integer_type_node
))
3403 return unsignedp
? unsigned_type_node
: integer_type_node
;
3405 if (bits
== TYPE_PRECISION (signed_char_type_node
))
3406 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3408 if (bits
== TYPE_PRECISION (short_integer_type_node
))
3409 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3411 if (bits
== TYPE_PRECISION (long_integer_type_node
))
3412 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3414 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
3415 return (unsignedp
? long_long_unsigned_type_node
3416 : long_long_integer_type_node
);
3418 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3419 if (int_n_enabled_p
[i
]
3420 && bits
== int_n_data
[i
].bitsize
)
3421 return (unsignedp
? int_n_trees
[i
].unsigned_type
3422 : int_n_trees
[i
].signed_type
);
3424 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
3425 return (unsignedp
? widest_unsigned_literal_type_node
3426 : widest_integer_literal_type_node
);
3428 if (bits
<= TYPE_PRECISION (intQI_type_node
))
3429 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3431 if (bits
<= TYPE_PRECISION (intHI_type_node
))
3432 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3434 if (bits
<= TYPE_PRECISION (intSI_type_node
))
3435 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3437 if (bits
<= TYPE_PRECISION (intDI_type_node
))
3438 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3443 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3444 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3445 and saturating if SATP is nonzero, otherwise not saturating. */
3448 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
3449 int unsignedp
, int satp
)
3453 mode
= unsignedp
? UQQmode
: QQmode
;
3455 mode
= unsignedp
? UHAmode
: HAmode
;
3457 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
3458 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
3461 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
3463 sorry ("GCC cannot support operators with integer types and "
3464 "fixed-point types that have too many integral and "
3465 "fractional bits together");
3469 return c_common_type_for_mode (mode
, satp
);
3472 /* Used for communication between c_common_type_for_mode and
3473 c_register_builtin_type. */
3474 tree registered_builtin_types
;
3476 /* Return a data type that has machine mode MODE.
3477 If the mode is an integer,
3478 then UNSIGNEDP selects between signed and unsigned types.
3479 If the mode is a fixed-point mode,
3480 then UNSIGNEDP selects between saturating and nonsaturating types. */
3483 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
3488 if (mode
== TYPE_MODE (integer_type_node
))
3489 return unsignedp
? unsigned_type_node
: integer_type_node
;
3491 if (mode
== TYPE_MODE (signed_char_type_node
))
3492 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3494 if (mode
== TYPE_MODE (short_integer_type_node
))
3495 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3497 if (mode
== TYPE_MODE (long_integer_type_node
))
3498 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3500 if (mode
== TYPE_MODE (long_long_integer_type_node
))
3501 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3503 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3504 if (int_n_enabled_p
[i
]
3505 && mode
== int_n_data
[i
].m
)
3506 return (unsignedp
? int_n_trees
[i
].unsigned_type
3507 : int_n_trees
[i
].signed_type
);
3509 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
3510 return unsignedp
? widest_unsigned_literal_type_node
3511 : widest_integer_literal_type_node
;
3514 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3517 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3520 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3523 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3525 #if HOST_BITS_PER_WIDE_INT >= 64
3526 if (mode
== TYPE_MODE (intTI_type_node
))
3527 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3530 if (mode
== TYPE_MODE (float_type_node
))
3531 return float_type_node
;
3533 if (mode
== TYPE_MODE (double_type_node
))
3534 return double_type_node
;
3536 if (mode
== TYPE_MODE (long_double_type_node
))
3537 return long_double_type_node
;
3539 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3540 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3541 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
3542 return FLOATN_NX_TYPE_NODE (i
);
3544 if (mode
== TYPE_MODE (void_type_node
))
3545 return void_type_node
;
3547 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
3549 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3550 : make_signed_type (GET_MODE_PRECISION (mode
)));
3552 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
3554 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3555 : make_signed_type (GET_MODE_PRECISION (mode
)));
3557 if (COMPLEX_MODE_P (mode
))
3559 machine_mode inner_mode
;
3562 if (mode
== TYPE_MODE (complex_float_type_node
))
3563 return complex_float_type_node
;
3564 if (mode
== TYPE_MODE (complex_double_type_node
))
3565 return complex_double_type_node
;
3566 if (mode
== TYPE_MODE (complex_long_double_type_node
))
3567 return complex_long_double_type_node
;
3569 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3570 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3571 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
3572 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
3574 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
3575 return complex_integer_type_node
;
3577 inner_mode
= GET_MODE_INNER (mode
);
3578 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3579 if (inner_type
!= NULL_TREE
)
3580 return build_complex_type (inner_type
);
3582 else if (VECTOR_MODE_P (mode
))
3584 machine_mode inner_mode
= GET_MODE_INNER (mode
);
3585 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3586 if (inner_type
!= NULL_TREE
)
3587 return build_vector_type_for_mode (inner_type
, mode
);
3590 if (mode
== TYPE_MODE (dfloat32_type_node
))
3591 return dfloat32_type_node
;
3592 if (mode
== TYPE_MODE (dfloat64_type_node
))
3593 return dfloat64_type_node
;
3594 if (mode
== TYPE_MODE (dfloat128_type_node
))
3595 return dfloat128_type_node
;
3597 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
3599 if (mode
== TYPE_MODE (short_fract_type_node
))
3600 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
3601 if (mode
== TYPE_MODE (fract_type_node
))
3602 return unsignedp
? sat_fract_type_node
: fract_type_node
;
3603 if (mode
== TYPE_MODE (long_fract_type_node
))
3604 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
3605 if (mode
== TYPE_MODE (long_long_fract_type_node
))
3606 return unsignedp
? sat_long_long_fract_type_node
3607 : long_long_fract_type_node
;
3609 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
3610 return unsignedp
? sat_unsigned_short_fract_type_node
3611 : unsigned_short_fract_type_node
;
3612 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
3613 return unsignedp
? sat_unsigned_fract_type_node
3614 : unsigned_fract_type_node
;
3615 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
3616 return unsignedp
? sat_unsigned_long_fract_type_node
3617 : unsigned_long_fract_type_node
;
3618 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
3619 return unsignedp
? sat_unsigned_long_long_fract_type_node
3620 : unsigned_long_long_fract_type_node
;
3622 if (mode
== TYPE_MODE (short_accum_type_node
))
3623 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3624 if (mode
== TYPE_MODE (accum_type_node
))
3625 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3626 if (mode
== TYPE_MODE (long_accum_type_node
))
3627 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3628 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3629 return unsignedp
? sat_long_long_accum_type_node
3630 : long_long_accum_type_node
;
3632 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3633 return unsignedp
? sat_unsigned_short_accum_type_node
3634 : unsigned_short_accum_type_node
;
3635 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3636 return unsignedp
? sat_unsigned_accum_type_node
3637 : unsigned_accum_type_node
;
3638 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3639 return unsignedp
? sat_unsigned_long_accum_type_node
3640 : unsigned_long_accum_type_node
;
3641 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3642 return unsignedp
? sat_unsigned_long_long_accum_type_node
3643 : unsigned_long_long_accum_type_node
;
3646 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3648 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3650 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3652 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3654 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3656 if (mode
== UQQmode
)
3657 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3658 if (mode
== UHQmode
)
3659 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3660 if (mode
== USQmode
)
3661 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3662 if (mode
== UDQmode
)
3663 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3664 if (mode
== UTQmode
)
3665 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3668 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3670 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3672 return unsignedp
? sat_da_type_node
: da_type_node
;
3674 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3676 if (mode
== UHAmode
)
3677 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3678 if (mode
== USAmode
)
3679 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3680 if (mode
== UDAmode
)
3681 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3682 if (mode
== UTAmode
)
3683 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3686 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3687 if (TYPE_MODE (TREE_VALUE (t
)) == mode
3688 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
3689 return TREE_VALUE (t
);
3695 c_common_unsigned_type (tree type
)
3697 return c_common_signed_or_unsigned_type (1, type
);
3700 /* Return a signed type the same as TYPE in other respects. */
3703 c_common_signed_type (tree type
)
3705 return c_common_signed_or_unsigned_type (0, type
);
3708 /* Return a type the same as TYPE except unsigned or
3709 signed according to UNSIGNEDP. */
3712 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3717 /* This block of code emulates the behavior of the old
3718 c_common_unsigned_type. In particular, it returns
3719 long_unsigned_type_node if passed a long, even when a int would
3720 have the same size. This is necessary for warnings to work
3721 correctly in archs where sizeof(int) == sizeof(long) */
3723 type1
= TYPE_MAIN_VARIANT (type
);
3724 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3725 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3726 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3727 return unsignedp
? unsigned_type_node
: integer_type_node
;
3728 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3729 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3730 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3731 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3732 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3733 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3735 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3736 if (int_n_enabled_p
[i
]
3737 && (type1
== int_n_trees
[i
].unsigned_type
3738 || type1
== int_n_trees
[i
].signed_type
))
3739 return (unsignedp
? int_n_trees
[i
].unsigned_type
3740 : int_n_trees
[i
].signed_type
);
3742 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3743 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3744 #if HOST_BITS_PER_WIDE_INT >= 64
3745 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3746 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3748 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3749 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3750 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3751 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3752 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3753 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3754 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3755 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3757 #define C_COMMON_FIXED_TYPES(NAME) \
3758 if (type1 == short_ ## NAME ## _type_node \
3759 || type1 == unsigned_short_ ## NAME ## _type_node) \
3760 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3761 : short_ ## NAME ## _type_node; \
3762 if (type1 == NAME ## _type_node \
3763 || type1 == unsigned_ ## NAME ## _type_node) \
3764 return unsignedp ? unsigned_ ## NAME ## _type_node \
3765 : NAME ## _type_node; \
3766 if (type1 == long_ ## NAME ## _type_node \
3767 || type1 == unsigned_long_ ## NAME ## _type_node) \
3768 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3769 : long_ ## NAME ## _type_node; \
3770 if (type1 == long_long_ ## NAME ## _type_node \
3771 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3772 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3773 : long_long_ ## NAME ## _type_node;
3775 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3776 if (type1 == NAME ## _type_node \
3777 || type1 == u ## NAME ## _type_node) \
3778 return unsignedp ? u ## NAME ## _type_node \
3779 : NAME ## _type_node;
3781 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3782 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3783 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3784 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3785 : sat_ ## short_ ## NAME ## _type_node; \
3786 if (type1 == sat_ ## NAME ## _type_node \
3787 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3788 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3789 : sat_ ## NAME ## _type_node; \
3790 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3791 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3792 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3793 : sat_ ## long_ ## NAME ## _type_node; \
3794 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3795 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3796 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3797 : sat_ ## long_long_ ## NAME ## _type_node;
3799 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3800 if (type1 == sat_ ## NAME ## _type_node \
3801 || type1 == sat_ ## u ## NAME ## _type_node) \
3802 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3803 : sat_ ## NAME ## _type_node;
3805 C_COMMON_FIXED_TYPES (fract
);
3806 C_COMMON_FIXED_TYPES_SAT (fract
);
3807 C_COMMON_FIXED_TYPES (accum
);
3808 C_COMMON_FIXED_TYPES_SAT (accum
);
3810 C_COMMON_FIXED_MODE_TYPES (qq
);
3811 C_COMMON_FIXED_MODE_TYPES (hq
);
3812 C_COMMON_FIXED_MODE_TYPES (sq
);
3813 C_COMMON_FIXED_MODE_TYPES (dq
);
3814 C_COMMON_FIXED_MODE_TYPES (tq
);
3815 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3816 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3817 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3818 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3819 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3820 C_COMMON_FIXED_MODE_TYPES (ha
);
3821 C_COMMON_FIXED_MODE_TYPES (sa
);
3822 C_COMMON_FIXED_MODE_TYPES (da
);
3823 C_COMMON_FIXED_MODE_TYPES (ta
);
3824 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3825 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3826 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3827 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3829 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3830 the precision; they have precision set to match their range, but
3831 may use a wider mode to match an ABI. If we change modes, we may
3832 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3833 the precision as well, so as to yield correct results for
3834 bit-field types. C++ does not have these separate bit-field
3835 types, and producing a signed or unsigned variant of an
3836 ENUMERAL_TYPE may cause other problems as well. */
3838 if (!INTEGRAL_TYPE_P (type
)
3839 || TYPE_UNSIGNED (type
) == unsignedp
)
3842 #define TYPE_OK(node) \
3843 (TYPE_MODE (type) == TYPE_MODE (node) \
3844 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3845 if (TYPE_OK (signed_char_type_node
))
3846 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3847 if (TYPE_OK (integer_type_node
))
3848 return unsignedp
? unsigned_type_node
: integer_type_node
;
3849 if (TYPE_OK (short_integer_type_node
))
3850 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3851 if (TYPE_OK (long_integer_type_node
))
3852 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3853 if (TYPE_OK (long_long_integer_type_node
))
3854 return (unsignedp
? long_long_unsigned_type_node
3855 : long_long_integer_type_node
);
3857 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3858 if (int_n_enabled_p
[i
]
3859 && TYPE_MODE (type
) == int_n_data
[i
].m
3860 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
3861 return (unsignedp
? int_n_trees
[i
].unsigned_type
3862 : int_n_trees
[i
].signed_type
);
3864 if (TYPE_OK (widest_integer_literal_type_node
))
3865 return (unsignedp
? widest_unsigned_literal_type_node
3866 : widest_integer_literal_type_node
);
3868 #if HOST_BITS_PER_WIDE_INT >= 64
3869 if (TYPE_OK (intTI_type_node
))
3870 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3872 if (TYPE_OK (intDI_type_node
))
3873 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3874 if (TYPE_OK (intSI_type_node
))
3875 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3876 if (TYPE_OK (intHI_type_node
))
3877 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3878 if (TYPE_OK (intQI_type_node
))
3879 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3882 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3885 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3888 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3892 /* Extended integer types of the same width as a standard type have
3893 lesser rank, so those of the same width as int promote to int or
3894 unsigned int and are valid for printf formats expecting int or
3895 unsigned int. To avoid such special cases, avoid creating
3896 extended integer types for bit-fields if a standard integer type
3898 if (width
== TYPE_PRECISION (integer_type_node
))
3899 return unsignedp
? unsigned_type_node
: integer_type_node
;
3900 if (width
== TYPE_PRECISION (signed_char_type_node
))
3901 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3902 if (width
== TYPE_PRECISION (short_integer_type_node
))
3903 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3904 if (width
== TYPE_PRECISION (long_integer_type_node
))
3905 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3906 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3907 return (unsignedp
? long_long_unsigned_type_node
3908 : long_long_integer_type_node
);
3909 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3910 if (int_n_enabled_p
[i
]
3911 && width
== int_n_data
[i
].bitsize
)
3912 return (unsignedp
? int_n_trees
[i
].unsigned_type
3913 : int_n_trees
[i
].signed_type
);
3914 return build_nonstandard_integer_type (width
, unsignedp
);
3917 /* The C version of the register_builtin_type langhook. */
3920 c_register_builtin_type (tree type
, const char* name
)
3924 decl
= build_decl (UNKNOWN_LOCATION
,
3925 TYPE_DECL
, get_identifier (name
), type
);
3926 DECL_ARTIFICIAL (decl
) = 1;
3927 if (!TYPE_NAME (type
))
3928 TYPE_NAME (type
) = decl
;
3931 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3934 /* Print an error message for invalid operands to arith operation
3935 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3936 RICHLOC is a rich location for the message, containing either
3937 three separate locations for each of the operator and operands
3942 (C FE), or one location ranging over all over them
3950 binary_op_error (rich_location
*richloc
, enum tree_code code
,
3951 tree type0
, tree type1
)
3958 opname
= "+"; break;
3960 opname
= "-"; break;
3962 opname
= "*"; break;
3964 opname
= "max"; break;
3966 opname
= "min"; break;
3968 opname
= "=="; break;
3970 opname
= "!="; break;
3972 opname
= "<="; break;
3974 opname
= ">="; break;
3976 opname
= "<"; break;
3978 opname
= ">"; break;
3980 opname
= "<<"; break;
3982 opname
= ">>"; break;
3983 case TRUNC_MOD_EXPR
:
3984 case FLOOR_MOD_EXPR
:
3985 opname
= "%"; break;
3986 case TRUNC_DIV_EXPR
:
3987 case FLOOR_DIV_EXPR
:
3988 opname
= "/"; break;
3990 opname
= "&"; break;
3992 opname
= "|"; break;
3993 case TRUTH_ANDIF_EXPR
:
3994 opname
= "&&"; break;
3995 case TRUTH_ORIF_EXPR
:
3996 opname
= "||"; break;
3998 opname
= "^"; break;
4002 error_at_rich_loc (richloc
,
4003 "invalid operands to binary %s (have %qT and %qT)",
4004 opname
, type0
, type1
);
4007 /* Given an expression as a tree, return its original type. Do this
4008 by stripping any conversion that preserves the sign and precision. */
4010 expr_original_type (tree expr
)
4012 STRIP_SIGN_NOPS (expr
);
4013 return TREE_TYPE (expr
);
4016 /* Subroutine of build_binary_op, used for comparison operations.
4017 See if the operands have both been converted from subword integer types
4018 and, if so, perhaps change them both back to their original type.
4019 This function is also responsible for converting the two operands
4020 to the proper common type for comparison.
4022 The arguments of this function are all pointers to local variables
4023 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4024 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4026 LOC is the location of the comparison.
4028 If this function returns nonzero, it means that the comparison has
4029 a constant value. What this function returns is an expression for
4033 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
4034 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
4037 tree op0
= *op0_ptr
;
4038 tree op1
= *op1_ptr
;
4039 int unsignedp0
, unsignedp1
;
4041 tree primop0
, primop1
;
4042 enum tree_code code
= *rescode_ptr
;
4044 /* Throw away any conversions to wider types
4045 already present in the operands. */
4047 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
4048 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
4050 /* If primopN is first sign-extended from primopN's precision to opN's
4051 precision, then zero-extended from opN's precision to
4052 *restype_ptr precision, shortenings might be invalid. */
4053 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
4054 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
4056 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
4058 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
4059 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
4061 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
4064 /* Handle the case that OP0 does not *contain* a conversion
4065 but it *requires* conversion to FINAL_TYPE. */
4067 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
4068 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
4069 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
4070 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
4072 /* If one of the operands must be floated, we cannot optimize. */
4073 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
4074 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
4076 /* If first arg is constant, swap the args (changing operation
4077 so value is preserved), for canonicalization. Don't do this if
4078 the second arg is 0. */
4080 if (TREE_CONSTANT (primop0
)
4081 && !integer_zerop (primop1
) && !real_zerop (primop1
)
4082 && !fixed_zerop (primop1
))
4084 std::swap (primop0
, primop1
);
4085 std::swap (op0
, op1
);
4088 std::swap (unsignedp0
, unsignedp1
);
4089 std::swap (real1
, real2
);
4108 *rescode_ptr
= code
;
4111 /* If comparing an integer against a constant more bits wide,
4112 maybe we can deduce a value of 1 or 0 independent of the data.
4113 Or else truncate the constant now
4114 rather than extend the variable at run time.
4116 This is only interesting if the constant is the wider arg.
4117 Also, it is not safe if the constant is unsigned and the
4118 variable arg is signed, since in this case the variable
4119 would be sign-extended and then regarded as unsigned.
4120 Our technique fails in this case because the lowest/highest
4121 possible unsigned results don't follow naturally from the
4122 lowest/highest possible values of the variable operand.
4123 For just EQ_EXPR and NE_EXPR there is another technique that
4124 could be used: see if the constant can be faithfully represented
4125 in the other operand's type, by truncating it and reextending it
4126 and see if that preserves the constant's value. */
4128 if (!real1
&& !real2
4129 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
4130 && TREE_CODE (primop1
) == INTEGER_CST
4131 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
4133 int min_gt
, max_gt
, min_lt
, max_lt
;
4134 tree maxval
, minval
;
4135 /* 1 if comparison is nominally unsigned. */
4136 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
4139 type
= c_common_signed_or_unsigned_type (unsignedp0
,
4140 TREE_TYPE (primop0
));
4142 maxval
= TYPE_MAX_VALUE (type
);
4143 minval
= TYPE_MIN_VALUE (type
);
4145 if (unsignedp
&& !unsignedp0
)
4146 *restype_ptr
= c_common_signed_type (*restype_ptr
);
4148 if (TREE_TYPE (primop1
) != *restype_ptr
)
4150 /* Convert primop1 to target type, but do not introduce
4151 additional overflow. We know primop1 is an int_cst. */
4152 primop1
= force_fit_type (*restype_ptr
,
4155 TYPE_PRECISION (*restype_ptr
)),
4156 0, TREE_OVERFLOW (primop1
));
4158 if (type
!= *restype_ptr
)
4160 minval
= convert (*restype_ptr
, minval
);
4161 maxval
= convert (*restype_ptr
, maxval
);
4164 min_gt
= tree_int_cst_lt (primop1
, minval
);
4165 max_gt
= tree_int_cst_lt (primop1
, maxval
);
4166 min_lt
= tree_int_cst_lt (minval
, primop1
);
4167 max_lt
= tree_int_cst_lt (maxval
, primop1
);
4170 /* This used to be a switch, but Genix compiler can't handle that. */
4171 if (code
== NE_EXPR
)
4173 if (max_lt
|| min_gt
)
4174 val
= truthvalue_true_node
;
4176 else if (code
== EQ_EXPR
)
4178 if (max_lt
|| min_gt
)
4179 val
= truthvalue_false_node
;
4181 else if (code
== LT_EXPR
)
4184 val
= truthvalue_true_node
;
4186 val
= truthvalue_false_node
;
4188 else if (code
== GT_EXPR
)
4191 val
= truthvalue_true_node
;
4193 val
= truthvalue_false_node
;
4195 else if (code
== LE_EXPR
)
4198 val
= truthvalue_true_node
;
4200 val
= truthvalue_false_node
;
4202 else if (code
== GE_EXPR
)
4205 val
= truthvalue_true_node
;
4207 val
= truthvalue_false_node
;
4210 /* If primop0 was sign-extended and unsigned comparison specd,
4211 we did a signed comparison above using the signed type bounds.
4212 But the comparison we output must be unsigned.
4214 Also, for inequalities, VAL is no good; but if the signed
4215 comparison had *any* fixed result, it follows that the
4216 unsigned comparison just tests the sign in reverse
4217 (positive values are LE, negative ones GE).
4218 So we can generate an unsigned comparison
4219 against an extreme value of the signed type. */
4221 if (unsignedp
&& !unsignedp0
)
4228 primop1
= TYPE_MIN_VALUE (type
);
4234 primop1
= TYPE_MAX_VALUE (type
);
4241 type
= c_common_unsigned_type (type
);
4244 if (TREE_CODE (primop0
) != INTEGER_CST
4245 /* Don't warn if it's from a (non-system) macro. */
4246 && !(from_macro_expansion_at
4247 (expansion_point_location_if_in_system_header
4248 (EXPR_LOCATION (primop0
)))))
4250 if (val
== truthvalue_false_node
)
4251 warning_at (loc
, OPT_Wtype_limits
,
4252 "comparison is always false due to limited range of data type");
4253 if (val
== truthvalue_true_node
)
4254 warning_at (loc
, OPT_Wtype_limits
,
4255 "comparison is always true due to limited range of data type");
4260 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4261 if (TREE_SIDE_EFFECTS (primop0
))
4262 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
4266 /* Value is not predetermined, but do the comparison
4267 in the type of the operand that is not constant.
4268 TYPE is already properly set. */
4271 /* If either arg is decimal float and the other is float, find the
4272 proper common type to use for comparison. */
4273 else if (real1
&& real2
4274 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4275 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
4276 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4278 /* If either arg is decimal float and the other is float, fail. */
4279 else if (real1
&& real2
4280 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4281 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
4284 else if (real1
&& real2
4285 && (TYPE_PRECISION (TREE_TYPE (primop0
))
4286 == TYPE_PRECISION (TREE_TYPE (primop1
))))
4287 type
= TREE_TYPE (primop0
);
4289 /* If args' natural types are both narrower than nominal type
4290 and both extend in the same manner, compare them
4291 in the type of the wider arg.
4292 Otherwise must actually extend both to the nominal
4293 common type lest different ways of extending
4295 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4297 else if (unsignedp0
== unsignedp1
&& real1
== real2
4298 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
4299 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
4301 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4302 type
= c_common_signed_or_unsigned_type (unsignedp0
4303 || TYPE_UNSIGNED (*restype_ptr
),
4305 /* Make sure shorter operand is extended the right way
4306 to match the longer operand. */
4308 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
4309 TREE_TYPE (primop0
)),
4312 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
4313 TREE_TYPE (primop1
)),
4318 /* Here we must do the comparison on the nominal type
4319 using the args exactly as we received them. */
4320 type
= *restype_ptr
;
4324 if (!real1
&& !real2
&& integer_zerop (primop1
)
4325 && TYPE_UNSIGNED (*restype_ptr
))
4328 /* All unsigned values are >= 0, so we warn. However,
4329 if OP0 is a constant that is >= 0, the signedness of
4330 the comparison isn't an issue, so suppress the
4333 warn_type_limits
&& !in_system_header_at (loc
)
4334 && !(TREE_CODE (primop0
) == INTEGER_CST
4335 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
4337 /* Do not warn for enumeration types. */
4338 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
4344 warning_at (loc
, OPT_Wtype_limits
,
4345 "comparison of unsigned expression >= 0 is always true");
4346 value
= truthvalue_true_node
;
4351 warning_at (loc
, OPT_Wtype_limits
,
4352 "comparison of unsigned expression < 0 is always false");
4353 value
= truthvalue_false_node
;
4362 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4363 if (TREE_SIDE_EFFECTS (primop0
))
4364 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
4371 *op0_ptr
= convert (type
, primop0
);
4372 *op1_ptr
= convert (type
, primop1
);
4374 *restype_ptr
= truthvalue_type_node
;
4379 /* Return a tree for the sum or difference (RESULTCODE says which)
4380 of pointer PTROP and integer INTOP. */
4383 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
4384 tree ptrop
, tree intop
, bool complain
)
4388 /* The result is a pointer of the same type that is being added. */
4389 tree result_type
= TREE_TYPE (ptrop
);
4391 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
4393 if (complain
&& warn_pointer_arith
)
4394 pedwarn (loc
, OPT_Wpointer_arith
,
4395 "pointer of type %<void *%> used in arithmetic");
4397 return error_mark_node
;
4398 size_exp
= integer_one_node
;
4400 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
4402 if (complain
&& warn_pointer_arith
)
4403 pedwarn (loc
, OPT_Wpointer_arith
,
4404 "pointer to a function used in arithmetic");
4406 return error_mark_node
;
4407 size_exp
= integer_one_node
;
4410 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
4412 /* We are manipulating pointer values, so we don't need to warn
4413 about relying on undefined signed overflow. We disable the
4414 warning here because we use integer types so fold won't know that
4415 they are really pointers. */
4416 fold_defer_overflow_warnings ();
4418 /* If what we are about to multiply by the size of the elements
4419 contains a constant term, apply distributive law
4420 and multiply that constant term separately.
4421 This helps produce common subexpressions. */
4422 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
4423 && !TREE_CONSTANT (intop
)
4424 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
4425 && TREE_CONSTANT (size_exp
)
4426 /* If the constant comes from pointer subtraction,
4427 skip this optimization--it would cause an error. */
4428 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
4429 /* If the constant is unsigned, and smaller than the pointer size,
4430 then we must skip this optimization. This is because it could cause
4431 an overflow error if the constant is negative but INTOP is not. */
4432 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
4433 || (TYPE_PRECISION (TREE_TYPE (intop
))
4434 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
4436 enum tree_code subcode
= resultcode
;
4437 tree int_type
= TREE_TYPE (intop
);
4438 if (TREE_CODE (intop
) == MINUS_EXPR
)
4439 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
4440 /* Convert both subexpression types to the type of intop,
4441 because weird cases involving pointer arithmetic
4442 can result in a sum or difference with different type args. */
4443 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
4445 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
4446 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
4449 /* Convert the integer argument to a type the same size as sizetype
4450 so the multiply won't overflow spuriously. */
4451 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
4452 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
4453 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
4454 TYPE_UNSIGNED (sizetype
)), intop
);
4456 /* Replace the integer argument with a suitable product by the object size.
4457 Do this multiplication as signed, then convert to the appropriate type
4458 for the pointer operation and disregard an overflow that occurred only
4459 because of the sign-extension change in the latter conversion. */
4461 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
4462 convert (TREE_TYPE (intop
), size_exp
));
4463 intop
= convert (sizetype
, t
);
4464 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
4465 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
4468 /* Create the sum or difference. */
4469 if (resultcode
== MINUS_EXPR
)
4470 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
4472 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
4474 fold_undefer_and_ignore_overflow_warnings ();
4479 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4480 and if NON_CONST is known not to be permitted in an evaluated part
4481 of a constant expression. */
4484 c_wrap_maybe_const (tree expr
, bool non_const
)
4486 bool nowarning
= TREE_NO_WARNING (expr
);
4487 location_t loc
= EXPR_LOCATION (expr
);
4489 /* This should never be called for C++. */
4490 if (c_dialect_cxx ())
4493 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4494 STRIP_TYPE_NOPS (expr
);
4495 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
4496 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
4498 TREE_NO_WARNING (expr
) = 1;
4499 protected_set_expr_location (expr
, loc
);
4504 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4505 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4506 around the SAVE_EXPR if needed so that c_fully_fold does not need
4507 to look inside SAVE_EXPRs. */
4510 c_save_expr (tree expr
)
4512 bool maybe_const
= true;
4513 if (c_dialect_cxx ())
4514 return save_expr (expr
);
4515 expr
= c_fully_fold (expr
, false, &maybe_const
);
4516 expr
= save_expr (expr
);
4518 expr
= c_wrap_maybe_const (expr
, true);
4522 /* Return whether EXPR is a declaration whose address can never be
4526 decl_with_nonnull_addr_p (const_tree expr
)
4528 return (DECL_P (expr
)
4529 && (TREE_CODE (expr
) == PARM_DECL
4530 || TREE_CODE (expr
) == LABEL_DECL
4531 || !DECL_WEAK (expr
)));
4534 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4535 or for an `if' or `while' statement or ?..: exp. It should already
4536 have been validated to be of suitable type; otherwise, a bad
4537 diagnostic may result.
4539 The EXPR is located at LOCATION.
4541 This preparation consists of taking the ordinary
4542 representation of an expression expr and producing a valid tree
4543 boolean expression describing whether expr is nonzero. We could
4544 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4545 but we optimize comparisons, &&, ||, and !.
4547 The resulting type should always be `truthvalue_type_node'. */
4550 c_common_truthvalue_conversion (location_t location
, tree expr
)
4552 switch (TREE_CODE (expr
))
4554 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
4555 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
4556 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
4557 case ORDERED_EXPR
: case UNORDERED_EXPR
:
4558 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4560 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4561 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
4564 case TRUTH_ANDIF_EXPR
:
4565 case TRUTH_ORIF_EXPR
:
4566 case TRUTH_AND_EXPR
:
4568 case TRUTH_XOR_EXPR
:
4569 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4571 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4572 c_common_truthvalue_conversion (location
,
4573 TREE_OPERAND (expr
, 0)),
4574 c_common_truthvalue_conversion (location
,
4575 TREE_OPERAND (expr
, 1)));
4578 case TRUTH_NOT_EXPR
:
4579 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4581 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
4582 c_common_truthvalue_conversion (location
,
4583 TREE_OPERAND (expr
, 0)));
4590 return integer_zerop (expr
) ? truthvalue_false_node
4591 : truthvalue_true_node
;
4594 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
4595 ? truthvalue_true_node
4596 : truthvalue_false_node
;
4599 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
4600 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
4601 ? truthvalue_true_node
4602 : truthvalue_false_node
;
4605 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, false);
4610 tree inner
= TREE_OPERAND (expr
, 0);
4611 if (decl_with_nonnull_addr_p (inner
))
4613 /* Common Ada/Pascal programmer's mistake. */
4614 warning_at (location
,
4616 "the address of %qD will always evaluate as %<true%>",
4618 return truthvalue_true_node
;
4624 expr
= build_binary_op (EXPR_LOCATION (expr
),
4625 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
4626 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4627 c_common_truthvalue_conversion (location
,
4628 TREE_OPERAND (expr
, 0)),
4629 c_common_truthvalue_conversion (location
,
4630 TREE_OPERAND (expr
, 1)),
4637 case EXCESS_PRECISION_EXPR
:
4638 /* These don't change whether an object is nonzero or zero. */
4639 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
4643 /* These don't change whether an object is zero or nonzero, but
4644 we can't ignore them if their second arg has side-effects. */
4645 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
4647 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
4648 TREE_OPERAND (expr
, 1),
4649 c_common_truthvalue_conversion
4650 (location
, TREE_OPERAND (expr
, 0)));
4654 return c_common_truthvalue_conversion (location
,
4655 TREE_OPERAND (expr
, 0));
4658 if (warn_int_in_bool_context
4659 && !from_macro_definition_at (EXPR_LOCATION (expr
)))
4661 tree val1
= fold_for_warn (TREE_OPERAND (expr
, 1));
4662 tree val2
= fold_for_warn (TREE_OPERAND (expr
, 2));
4663 if (TREE_CODE (val1
) == INTEGER_CST
4664 && TREE_CODE (val2
) == INTEGER_CST
4665 && !integer_zerop (val1
)
4666 && !integer_zerop (val2
)
4667 && (!integer_onep (val1
)
4668 || !integer_onep (val2
)))
4669 warning_at (EXPR_LOCATION (expr
), OPT_Wint_in_bool_context
,
4670 "?: using integer constants in boolean context, "
4671 "the expression will always evaluate to %<true%>");
4673 /* Distribute the conversion into the arms of a COND_EXPR. */
4674 if (c_dialect_cxx ())
4676 tree op1
= TREE_OPERAND (expr
, 1);
4677 tree op2
= TREE_OPERAND (expr
, 2);
4678 /* In C++ one of the arms might have void type if it is throw. */
4679 if (!VOID_TYPE_P (TREE_TYPE (op1
)))
4680 op1
= c_common_truthvalue_conversion (location
, op1
);
4681 if (!VOID_TYPE_P (TREE_TYPE (op2
)))
4682 op2
= c_common_truthvalue_conversion (location
, op2
);
4683 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4684 TREE_OPERAND (expr
, 0), op1
, op2
);
4689 /* Folding will happen later for C. */
4690 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4691 TREE_OPERAND (expr
, 0),
4692 c_common_truthvalue_conversion (location
,
4693 TREE_OPERAND (expr
, 1)),
4694 c_common_truthvalue_conversion (location
,
4695 TREE_OPERAND (expr
, 2)));
4701 tree totype
= TREE_TYPE (expr
);
4702 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
4704 if (POINTER_TYPE_P (totype
)
4705 && !c_inhibit_evaluation_warnings
4706 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4712 warning_at (location
,
4714 "the compiler can assume that the address of "
4715 "%qD will always evaluate to %<true%>",
4719 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4720 since that affects how `default_conversion' will behave. */
4721 if (TREE_CODE (totype
) == REFERENCE_TYPE
4722 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4724 /* Don't strip a conversion from C++0x scoped enum, since they
4725 don't implicitly convert to other types. */
4726 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
4727 && ENUM_IS_SCOPED (fromtype
))
4729 /* If this isn't narrowing the argument, we can ignore it. */
4730 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
4731 return c_common_truthvalue_conversion (location
,
4732 TREE_OPERAND (expr
, 0));
4737 if (!TREE_NO_WARNING (expr
)
4738 && warn_parentheses
)
4740 warning_at (location
, OPT_Wparentheses
,
4741 "suggest parentheses around assignment used as "
4743 TREE_NO_WARNING (expr
) = 1;
4751 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4753 tree t
= (in_late_binary_op
? save_expr (expr
) : c_save_expr (expr
));
4754 expr
= (build_binary_op
4755 (EXPR_LOCATION (expr
),
4756 (TREE_SIDE_EFFECTS (expr
)
4757 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4758 c_common_truthvalue_conversion
4760 build_unary_op (location
, REALPART_EXPR
, t
, false)),
4761 c_common_truthvalue_conversion
4763 build_unary_op (location
, IMAGPART_EXPR
, t
, false)),
4768 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4770 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4772 (TREE_TYPE (expr
))));
4773 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4776 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4779 protected_set_expr_location (expr
, location
);
4783 static void def_builtin_1 (enum built_in_function fncode
,
4785 enum built_in_class fnclass
,
4786 tree fntype
, tree libtype
,
4787 bool both_p
, bool fallback_p
, bool nonansi_p
,
4788 tree fnattrs
, bool implicit_p
);
4791 /* Apply the TYPE_QUALS to the new DECL. */
4794 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4796 tree type
= TREE_TYPE (decl
);
4798 if (type
== error_mark_node
)
4801 if ((type_quals
& TYPE_QUAL_CONST
)
4802 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4803 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4804 constructor can produce constant init, so rely on cp_finish_decl to
4805 clear TREE_READONLY if the variable has non-constant init. */
4806 TREE_READONLY (decl
) = 1;
4807 if (type_quals
& TYPE_QUAL_VOLATILE
)
4809 TREE_SIDE_EFFECTS (decl
) = 1;
4810 TREE_THIS_VOLATILE (decl
) = 1;
4812 if (type_quals
& TYPE_QUAL_RESTRICT
)
4814 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4815 /* Allow 'restrict' on arrays of pointers.
4816 FIXME currently we just ignore it. */
4817 type
= TREE_TYPE (type
);
4819 || !POINTER_TYPE_P (type
)
4820 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4821 error ("invalid use of %<restrict%>");
4825 struct c_type_hasher
: ggc_ptr_hash
<tree_node
>
4827 static hashval_t
hash (tree
);
4828 static bool equal (tree
, tree
);
4831 /* Hash function for the problem of multiple type definitions in
4832 different files. This must hash all types that will compare
4833 equal via comptypes to the same value. In practice it hashes
4834 on some of the simple stuff and leaves the details to comptypes. */
4837 c_type_hasher::hash (tree t
)
4842 switch (TREE_CODE (t
))
4844 /* For pointers, hash on pointee type plus some swizzling. */
4846 return hash (TREE_TYPE (t
)) ^ 0x3003003;
4847 /* Hash on number of elements and total size. */
4850 t2
= TYPE_VALUES (t
);
4854 t2
= TYPE_FIELDS (t
);
4856 case QUAL_UNION_TYPE
:
4858 t2
= TYPE_FIELDS (t
);
4862 t2
= TYPE_FIELDS (t
);
4867 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4868 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4869 n_elements
= list_length (t2
);
4870 /* We might have a VLA here. */
4871 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4874 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4875 return ((size
<< 24) | (n_elements
<< shift
));
4879 c_type_hasher::equal (tree t1
, tree t2
)
4881 return lang_hooks
.types_compatible_p (t1
, t2
);
4884 static GTY(()) hash_table
<c_type_hasher
> *type_hash_table
;
4886 /* Return the typed-based alias set for T, which may be an expression
4887 or a type. Return -1 if we don't do anything special. */
4890 c_common_get_alias_set (tree t
)
4892 /* For VLAs, use the alias set of the element type rather than the
4893 default of alias set 0 for types compared structurally. */
4894 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4896 if (TREE_CODE (t
) == ARRAY_TYPE
)
4897 return get_alias_set (TREE_TYPE (t
));
4901 /* That's all the expressions we handle specially. */
4905 /* The C standard guarantees that any object may be accessed via an
4906 lvalue that has character type. */
4907 if (t
== char_type_node
4908 || t
== signed_char_type_node
4909 || t
== unsigned_char_type_node
)
4912 /* The C standard specifically allows aliasing between signed and
4913 unsigned variants of the same type. We treat the signed
4914 variant as canonical. */
4915 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4917 tree t1
= c_common_signed_type (t
);
4919 /* t1 == t can happen for boolean nodes which are always unsigned. */
4921 return get_alias_set (t1
);
4924 /* Handle the case of multiple type nodes referring to "the same" type,
4925 which occurs with IMA. These share an alias set. FIXME: Currently only
4926 C90 is handled. (In C99 type compatibility is not transitive, which
4927 complicates things mightily. The alias set splay trees can theoretically
4928 represent this, but insertion is tricky when you consider all the
4929 different orders things might arrive in.) */
4931 if (c_language
!= clk_c
|| flag_isoc99
)
4934 /* Save time if there's only one input file. */
4935 if (num_in_fnames
== 1)
4938 /* Pointers need special handling if they point to any type that
4939 needs special handling (below). */
4940 if (TREE_CODE (t
) == POINTER_TYPE
)
4943 /* Find bottom type under any nested POINTERs. */
4944 for (t2
= TREE_TYPE (t
);
4945 TREE_CODE (t2
) == POINTER_TYPE
;
4946 t2
= TREE_TYPE (t2
))
4948 if (!RECORD_OR_UNION_TYPE_P (t2
)
4949 && TREE_CODE (t2
) != ENUMERAL_TYPE
)
4951 if (TYPE_SIZE (t2
) == 0)
4954 /* These are the only cases that need special handling. */
4955 if (!RECORD_OR_UNION_TYPE_P (t
)
4956 && TREE_CODE (t
) != ENUMERAL_TYPE
4957 && TREE_CODE (t
) != POINTER_TYPE
)
4960 if (TYPE_SIZE (t
) == 0)
4963 /* Look up t in hash table. Only one of the compatible types within each
4964 alias set is recorded in the table. */
4965 if (!type_hash_table
)
4966 type_hash_table
= hash_table
<c_type_hasher
>::create_ggc (1021);
4967 tree
*slot
= type_hash_table
->find_slot (t
, INSERT
);
4970 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4971 return TYPE_ALIAS_SET ((tree
)*slot
);
4974 /* Our caller will assign and record (in t) a new alias set; all we need
4975 to do is remember t in the hash table. */
4981 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4982 the IS_SIZEOF parameter indicates which operator is being applied.
4983 The COMPLAIN flag controls whether we should diagnose possibly
4984 ill-formed constructs or not. LOC is the location of the SIZEOF or
4985 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4986 a type in any context should be returned, rather than the normal
4987 alignment for that type. */
4990 c_sizeof_or_alignof_type (location_t loc
,
4991 tree type
, bool is_sizeof
, bool min_alignof
,
4994 const char *op_name
;
4996 enum tree_code type_code
= TREE_CODE (type
);
4998 op_name
= is_sizeof
? "sizeof" : "__alignof__";
5000 if (type_code
== FUNCTION_TYPE
)
5004 if (complain
&& warn_pointer_arith
)
5005 pedwarn (loc
, OPT_Wpointer_arith
,
5006 "invalid application of %<sizeof%> to a function type");
5008 return error_mark_node
;
5009 value
= size_one_node
;
5015 if (c_dialect_cxx ())
5016 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
5017 "%<alignof%> applied to a function type");
5019 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
5020 "%<_Alignof%> applied to a function type");
5022 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
5025 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
5027 if (type_code
== VOID_TYPE
5028 && complain
&& warn_pointer_arith
)
5029 pedwarn (loc
, OPT_Wpointer_arith
,
5030 "invalid application of %qs to a void type", op_name
);
5032 return error_mark_node
;
5033 value
= size_one_node
;
5035 else if (!COMPLETE_TYPE_P (type
)
5036 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
5039 error_at (loc
, "invalid application of %qs to incomplete type %qT",
5041 return error_mark_node
;
5043 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
5044 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
5047 error_at (loc
, "invalid application of %qs to array type %qT of "
5048 "incomplete element type", op_name
, type
);
5049 return error_mark_node
;
5054 /* Convert in case a char is more than one unit. */
5055 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
5056 size_int (TYPE_PRECISION (char_type_node
)
5058 else if (min_alignof
)
5059 value
= size_int (min_align_of_type (type
));
5061 value
= size_int (TYPE_ALIGN_UNIT (type
));
5064 /* VALUE will have the middle-end integer type sizetype.
5065 However, we should really return a value of type `size_t',
5066 which is just a typedef for an ordinary integer type. */
5067 value
= fold_convert_loc (loc
, size_type_node
, value
);
5072 /* Implement the __alignof keyword: Return the minimum required
5073 alignment of EXPR, measured in bytes. For VAR_DECLs,
5074 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5075 from an "aligned" __attribute__ specification). LOC is the
5076 location of the ALIGNOF operator. */
5079 c_alignof_expr (location_t loc
, tree expr
)
5083 if (VAR_OR_FUNCTION_DECL_P (expr
))
5084 t
= size_int (DECL_ALIGN_UNIT (expr
));
5086 else if (TREE_CODE (expr
) == COMPONENT_REF
5087 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
5089 error_at (loc
, "%<__alignof%> applied to a bit-field");
5092 else if (TREE_CODE (expr
) == COMPONENT_REF
5093 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
5094 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
5096 else if (INDIRECT_REF_P (expr
))
5098 tree t
= TREE_OPERAND (expr
, 0);
5100 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5102 while (CONVERT_EXPR_P (t
)
5103 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
5107 t
= TREE_OPERAND (t
, 0);
5108 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5109 if (thisalign
> bestalign
)
5110 best
= t
, bestalign
= thisalign
;
5112 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
5115 return c_alignof (loc
, TREE_TYPE (expr
));
5117 return fold_convert_loc (loc
, size_type_node
, t
);
5120 /* Handle C and C++ default attributes. */
5122 enum built_in_attribute
5124 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5125 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5126 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5127 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5128 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5129 #include "builtin-attrs.def"
5130 #undef DEF_ATTR_NULL_TREE
5132 #undef DEF_ATTR_STRING
5133 #undef DEF_ATTR_IDENT
5134 #undef DEF_ATTR_TREE_LIST
5138 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
5140 static void c_init_attributes (void);
5144 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5145 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5146 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5147 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5148 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5149 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5150 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5151 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5153 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5155 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5156 ARG6, ARG7, ARG8) NAME,
5157 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5158 ARG6, ARG7, ARG8, ARG9) NAME,
5159 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5160 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5161 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5162 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5163 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5164 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5165 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5166 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5167 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5168 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5170 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5172 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5174 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5175 #include "builtin-types.def"
5176 #undef DEF_PRIMITIVE_TYPE
5177 #undef DEF_FUNCTION_TYPE_0
5178 #undef DEF_FUNCTION_TYPE_1
5179 #undef DEF_FUNCTION_TYPE_2
5180 #undef DEF_FUNCTION_TYPE_3
5181 #undef DEF_FUNCTION_TYPE_4
5182 #undef DEF_FUNCTION_TYPE_5
5183 #undef DEF_FUNCTION_TYPE_6
5184 #undef DEF_FUNCTION_TYPE_7
5185 #undef DEF_FUNCTION_TYPE_8
5186 #undef DEF_FUNCTION_TYPE_9
5187 #undef DEF_FUNCTION_TYPE_10
5188 #undef DEF_FUNCTION_TYPE_11
5189 #undef DEF_FUNCTION_TYPE_VAR_0
5190 #undef DEF_FUNCTION_TYPE_VAR_1
5191 #undef DEF_FUNCTION_TYPE_VAR_2
5192 #undef DEF_FUNCTION_TYPE_VAR_3
5193 #undef DEF_FUNCTION_TYPE_VAR_4
5194 #undef DEF_FUNCTION_TYPE_VAR_5
5195 #undef DEF_FUNCTION_TYPE_VAR_6
5196 #undef DEF_FUNCTION_TYPE_VAR_7
5197 #undef DEF_POINTER_TYPE
5201 typedef enum c_builtin_type builtin_type
;
5203 /* A temporary array for c_common_nodes_and_builtins. Used in
5204 communication with def_fn_type. */
5205 static tree builtin_types
[(int) BT_LAST
+ 1];
5207 /* A helper function for c_common_nodes_and_builtins. Build function type
5208 for DEF with return type RET and N arguments. If VAR is true, then the
5209 function should be variadic after those N arguments.
5211 Takes special care not to ICE if any of the types involved are
5212 error_mark_node, which indicates that said type is not in fact available
5213 (see builtin_type_for_size). In which case the function type as a whole
5214 should be error_mark_node. */
5217 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
5220 tree
*args
= XALLOCAVEC (tree
, n
);
5225 for (i
= 0; i
< n
; ++i
)
5227 builtin_type a
= (builtin_type
) va_arg (list
, int);
5228 t
= builtin_types
[a
];
5229 if (t
== error_mark_node
)
5234 t
= builtin_types
[ret
];
5235 if (t
== error_mark_node
)
5238 t
= build_varargs_function_type_array (t
, n
, args
);
5240 t
= build_function_type_array (t
, n
, args
);
5243 builtin_types
[def
] = t
;
5247 /* Build builtin functions common to both C and C++ language
5251 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
5253 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5254 builtin_types[ENUM] = VALUE;
5255 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5256 def_fn_type (ENUM, RETURN, 0, 0);
5257 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5258 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5259 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5260 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5261 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5262 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5263 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5264 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5265 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5266 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5267 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5269 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5270 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5272 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5273 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5275 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5277 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5278 ARG6, ARG7, ARG8, ARG9) \
5279 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5281 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5282 ARG6, ARG7, ARG8, ARG9, ARG10) \
5283 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5284 ARG7, ARG8, ARG9, ARG10);
5285 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5286 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5287 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5288 ARG7, ARG8, ARG9, ARG10, ARG11);
5289 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5290 def_fn_type (ENUM, RETURN, 1, 0);
5291 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5292 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5293 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5294 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5295 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5296 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5297 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5298 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5299 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5300 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5301 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5303 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5304 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5306 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5307 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5308 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5310 #include "builtin-types.def"
5312 #undef DEF_PRIMITIVE_TYPE
5313 #undef DEF_FUNCTION_TYPE_0
5314 #undef DEF_FUNCTION_TYPE_1
5315 #undef DEF_FUNCTION_TYPE_2
5316 #undef DEF_FUNCTION_TYPE_3
5317 #undef DEF_FUNCTION_TYPE_4
5318 #undef DEF_FUNCTION_TYPE_5
5319 #undef DEF_FUNCTION_TYPE_6
5320 #undef DEF_FUNCTION_TYPE_7
5321 #undef DEF_FUNCTION_TYPE_8
5322 #undef DEF_FUNCTION_TYPE_9
5323 #undef DEF_FUNCTION_TYPE_10
5324 #undef DEF_FUNCTION_TYPE_11
5325 #undef DEF_FUNCTION_TYPE_VAR_0
5326 #undef DEF_FUNCTION_TYPE_VAR_1
5327 #undef DEF_FUNCTION_TYPE_VAR_2
5328 #undef DEF_FUNCTION_TYPE_VAR_3
5329 #undef DEF_FUNCTION_TYPE_VAR_4
5330 #undef DEF_FUNCTION_TYPE_VAR_5
5331 #undef DEF_FUNCTION_TYPE_VAR_6
5332 #undef DEF_FUNCTION_TYPE_VAR_7
5333 #undef DEF_POINTER_TYPE
5334 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
5336 c_init_attributes ();
5338 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5339 NONANSI_P, ATTRS, IMPLICIT, COND) \
5341 def_builtin_1 (ENUM, NAME, CLASS, \
5342 builtin_types[(int) TYPE], \
5343 builtin_types[(int) LIBTYPE], \
5344 BOTH_P, FALLBACK_P, NONANSI_P, \
5345 built_in_attributes[(int) ATTRS], IMPLICIT);
5346 #include "builtins.def"
5348 targetm
.init_builtins ();
5350 build_common_builtin_nodes ();
5353 cilk_init_builtins ();
5356 /* Like get_identifier, but avoid warnings about null arguments when
5357 the argument may be NULL for targets where GCC lacks stdint.h type
5361 c_get_ident (const char *id
)
5363 return get_identifier (id
);
5366 /* Build tree nodes and builtin functions common to both C and C++ language
5370 c_common_nodes_and_builtins (void)
5372 int char16_type_size
;
5373 int char32_type_size
;
5374 int wchar_type_size
;
5375 tree array_domain_type
;
5376 tree va_list_ref_type_node
;
5377 tree va_list_arg_type_node
;
5380 build_common_tree_nodes (flag_signed_char
);
5382 /* Define `int' and `char' first so that dbx will output them first. */
5383 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
5384 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5386 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5387 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5388 but not C. Are the conditionals here needed? */
5389 if (c_dialect_cxx ())
5390 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
5391 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5392 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5393 record_builtin_type (RID_MAX
, "long unsigned int",
5394 long_unsigned_type_node
);
5396 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
5400 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
5401 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
5402 int_n_trees
[i
].signed_type
);
5403 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
5404 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
5407 if (c_dialect_cxx ())
5408 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5409 record_builtin_type (RID_MAX
, "long long int",
5410 long_long_integer_type_node
);
5411 record_builtin_type (RID_MAX
, "long long unsigned int",
5412 long_long_unsigned_type_node
);
5413 if (c_dialect_cxx ())
5414 record_builtin_type (RID_MAX
, "long long unsigned",
5415 long_long_unsigned_type_node
);
5416 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5417 record_builtin_type (RID_MAX
, "short unsigned int",
5418 short_unsigned_type_node
);
5419 if (c_dialect_cxx ())
5420 record_builtin_type (RID_MAX
, "unsigned short",
5421 short_unsigned_type_node
);
5423 /* Define both `signed char' and `unsigned char'. */
5424 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5425 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5427 /* These are types that c_common_type_for_size and
5428 c_common_type_for_mode use. */
5429 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5430 TYPE_DECL
, NULL_TREE
,
5432 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5433 TYPE_DECL
, NULL_TREE
,
5435 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5436 TYPE_DECL
, NULL_TREE
,
5438 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5439 TYPE_DECL
, NULL_TREE
,
5441 #if HOST_BITS_PER_WIDE_INT >= 64
5442 /* Note that this is different than the __int128 type that's part of
5443 the generic __intN support. */
5444 if (targetm
.scalar_mode_supported_p (TImode
))
5445 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5447 get_identifier ("__int128_t"),
5450 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5451 TYPE_DECL
, NULL_TREE
,
5452 unsigned_intQI_type_node
));
5453 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5454 TYPE_DECL
, NULL_TREE
,
5455 unsigned_intHI_type_node
));
5456 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5457 TYPE_DECL
, NULL_TREE
,
5458 unsigned_intSI_type_node
));
5459 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5460 TYPE_DECL
, NULL_TREE
,
5461 unsigned_intDI_type_node
));
5462 #if HOST_BITS_PER_WIDE_INT >= 64
5463 if (targetm
.scalar_mode_supported_p (TImode
))
5464 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5466 get_identifier ("__uint128_t"),
5467 unsigned_intTI_type_node
));
5470 /* Create the widest literal types. */
5471 widest_integer_literal_type_node
5472 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
5473 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5474 TYPE_DECL
, NULL_TREE
,
5475 widest_integer_literal_type_node
));
5477 widest_unsigned_literal_type_node
5478 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
5479 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5480 TYPE_DECL
, NULL_TREE
,
5481 widest_unsigned_literal_type_node
));
5483 signed_size_type_node
= c_common_signed_type (size_type_node
);
5486 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
5488 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
5489 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
5490 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5492 if (!c_dialect_cxx ())
5493 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5494 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5495 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
5496 FLOATN_NX_TYPE_NODE (i
));
5498 /* Only supported decimal floating point extension if the target
5499 actually supports underlying modes. */
5500 if (targetm
.scalar_mode_supported_p (SDmode
)
5501 && targetm
.scalar_mode_supported_p (DDmode
)
5502 && targetm
.scalar_mode_supported_p (TDmode
))
5504 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
5505 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
5506 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
5509 if (targetm
.fixed_point_supported_p ())
5511 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
5512 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
5513 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
5514 record_builtin_type (RID_MAX
, "long long _Fract",
5515 long_long_fract_type_node
);
5516 record_builtin_type (RID_MAX
, "unsigned short _Fract",
5517 unsigned_short_fract_type_node
);
5518 record_builtin_type (RID_MAX
, "unsigned _Fract",
5519 unsigned_fract_type_node
);
5520 record_builtin_type (RID_MAX
, "unsigned long _Fract",
5521 unsigned_long_fract_type_node
);
5522 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
5523 unsigned_long_long_fract_type_node
);
5524 record_builtin_type (RID_MAX
, "_Sat short _Fract",
5525 sat_short_fract_type_node
);
5526 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
5527 record_builtin_type (RID_MAX
, "_Sat long _Fract",
5528 sat_long_fract_type_node
);
5529 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
5530 sat_long_long_fract_type_node
);
5531 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
5532 sat_unsigned_short_fract_type_node
);
5533 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
5534 sat_unsigned_fract_type_node
);
5535 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
5536 sat_unsigned_long_fract_type_node
);
5537 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
5538 sat_unsigned_long_long_fract_type_node
);
5539 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
5540 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
5541 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
5542 record_builtin_type (RID_MAX
, "long long _Accum",
5543 long_long_accum_type_node
);
5544 record_builtin_type (RID_MAX
, "unsigned short _Accum",
5545 unsigned_short_accum_type_node
);
5546 record_builtin_type (RID_MAX
, "unsigned _Accum",
5547 unsigned_accum_type_node
);
5548 record_builtin_type (RID_MAX
, "unsigned long _Accum",
5549 unsigned_long_accum_type_node
);
5550 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
5551 unsigned_long_long_accum_type_node
);
5552 record_builtin_type (RID_MAX
, "_Sat short _Accum",
5553 sat_short_accum_type_node
);
5554 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
5555 record_builtin_type (RID_MAX
, "_Sat long _Accum",
5556 sat_long_accum_type_node
);
5557 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
5558 sat_long_long_accum_type_node
);
5559 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
5560 sat_unsigned_short_accum_type_node
);
5561 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
5562 sat_unsigned_accum_type_node
);
5563 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
5564 sat_unsigned_long_accum_type_node
);
5565 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
5566 sat_unsigned_long_long_accum_type_node
);
5570 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5572 get_identifier ("complex int"),
5573 complex_integer_type_node
));
5574 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5576 get_identifier ("complex float"),
5577 complex_float_type_node
));
5578 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5580 get_identifier ("complex double"),
5581 complex_double_type_node
));
5582 lang_hooks
.decls
.pushdecl
5583 (build_decl (UNKNOWN_LOCATION
,
5584 TYPE_DECL
, get_identifier ("complex long double"),
5585 complex_long_double_type_node
));
5587 if (!c_dialect_cxx ())
5588 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5589 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5592 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
5593 floatn_nx_types
[i
].extended
? "x" : "");
5594 lang_hooks
.decls
.pushdecl
5595 (build_decl (UNKNOWN_LOCATION
,
5597 get_identifier (buf
),
5598 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
5601 if (c_dialect_cxx ())
5602 /* For C++, make fileptr_type_node a distinct void * type until
5603 FILE type is defined. */
5604 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
5606 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
5608 /* Set the TYPE_NAME for any variants that were built before
5609 record_builtin_type gave names to the built-in types. */
5611 tree void_name
= TYPE_NAME (void_type_node
);
5612 TYPE_NAME (void_type_node
) = NULL_TREE
;
5613 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
5615 TYPE_NAME (void_type_node
) = void_name
;
5618 void_list_node
= build_void_list_node ();
5620 /* Make a type to be the domain of a few array types
5621 whose domains don't really matter.
5622 200 is small enough that it always fits in size_t
5623 and large enough that it can hold most function names for the
5624 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5625 array_domain_type
= build_index_type (size_int (200));
5627 /* Make a type for arrays of characters.
5628 With luck nothing will ever really depend on the length of this
5630 char_array_type_node
5631 = build_array_type (char_type_node
, array_domain_type
);
5633 string_type_node
= build_pointer_type (char_type_node
);
5634 const_string_type_node
5635 = build_pointer_type (build_qualified_type
5636 (char_type_node
, TYPE_QUAL_CONST
));
5638 /* This is special for C++ so functions can be overloaded. */
5639 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
5640 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
5641 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
5642 underlying_wchar_type_node
= wchar_type_node
;
5643 if (c_dialect_cxx ())
5645 if (TYPE_UNSIGNED (wchar_type_node
))
5646 wchar_type_node
= make_unsigned_type (wchar_type_size
);
5648 wchar_type_node
= make_signed_type (wchar_type_size
);
5649 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
5652 /* This is for wide string constants. */
5653 wchar_array_type_node
5654 = build_array_type (wchar_type_node
, array_domain_type
);
5656 /* Define 'char16_t'. */
5657 char16_type_node
= get_identifier (CHAR16_TYPE
);
5658 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
5659 char16_type_size
= TYPE_PRECISION (char16_type_node
);
5660 if (c_dialect_cxx ())
5662 char16_type_node
= make_unsigned_type (char16_type_size
);
5664 if (cxx_dialect
>= cxx11
)
5665 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
5668 /* This is for UTF-16 string constants. */
5669 char16_array_type_node
5670 = build_array_type (char16_type_node
, array_domain_type
);
5672 /* Define 'char32_t'. */
5673 char32_type_node
= get_identifier (CHAR32_TYPE
);
5674 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
5675 char32_type_size
= TYPE_PRECISION (char32_type_node
);
5676 if (c_dialect_cxx ())
5678 char32_type_node
= make_unsigned_type (char32_type_size
);
5680 if (cxx_dialect
>= cxx11
)
5681 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
5684 /* This is for UTF-32 string constants. */
5685 char32_array_type_node
5686 = build_array_type (char32_type_node
, array_domain_type
);
5689 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
5692 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
5694 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
5696 if (SIG_ATOMIC_TYPE
)
5697 sig_atomic_type_node
=
5698 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
5701 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
5704 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
5707 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
5710 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
5713 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
5715 c_uint16_type_node
= uint16_type_node
=
5716 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
5718 c_uint32_type_node
= uint32_type_node
=
5719 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
5721 c_uint64_type_node
= uint64_type_node
=
5722 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
5723 if (INT_LEAST8_TYPE
)
5724 int_least8_type_node
=
5725 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
5726 if (INT_LEAST16_TYPE
)
5727 int_least16_type_node
=
5728 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
5729 if (INT_LEAST32_TYPE
)
5730 int_least32_type_node
=
5731 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
5732 if (INT_LEAST64_TYPE
)
5733 int_least64_type_node
=
5734 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
5735 if (UINT_LEAST8_TYPE
)
5736 uint_least8_type_node
=
5737 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
5738 if (UINT_LEAST16_TYPE
)
5739 uint_least16_type_node
=
5740 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
5741 if (UINT_LEAST32_TYPE
)
5742 uint_least32_type_node
=
5743 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
5744 if (UINT_LEAST64_TYPE
)
5745 uint_least64_type_node
=
5746 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
5748 int_fast8_type_node
=
5749 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
5750 if (INT_FAST16_TYPE
)
5751 int_fast16_type_node
=
5752 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
5753 if (INT_FAST32_TYPE
)
5754 int_fast32_type_node
=
5755 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
5756 if (INT_FAST64_TYPE
)
5757 int_fast64_type_node
=
5758 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
5759 if (UINT_FAST8_TYPE
)
5760 uint_fast8_type_node
=
5761 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
5762 if (UINT_FAST16_TYPE
)
5763 uint_fast16_type_node
=
5764 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
5765 if (UINT_FAST32_TYPE
)
5766 uint_fast32_type_node
=
5767 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5768 if (UINT_FAST64_TYPE
)
5769 uint_fast64_type_node
=
5770 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5773 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5776 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5778 default_function_type
5779 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
5781 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5782 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5784 lang_hooks
.decls
.pushdecl
5785 (build_decl (UNKNOWN_LOCATION
,
5786 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5787 va_list_type_node
));
5788 if (targetm
.enum_va_list_p
)
5794 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
5796 lang_hooks
.decls
.pushdecl
5797 (build_decl (UNKNOWN_LOCATION
,
5798 TYPE_DECL
, get_identifier (pname
),
5804 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5806 va_list_arg_type_node
= va_list_ref_type_node
=
5807 build_pointer_type (TREE_TYPE (va_list_type_node
));
5811 va_list_arg_type_node
= va_list_type_node
;
5812 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5815 if (!flag_preprocess_only
)
5816 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5818 main_identifier_node
= get_identifier ("main");
5820 /* Create the built-in __null node. It is important that this is
5822 null_node
= make_int_cst (1, 1);
5823 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5825 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5826 memset (builtin_types
, 0, sizeof (builtin_types
));
5829 /* The number of named compound-literals generated thus far. */
5830 static GTY(()) int compound_literal_number
;
5832 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5835 set_compound_literal_name (tree decl
)
5838 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5839 compound_literal_number
);
5840 compound_literal_number
++;
5841 DECL_NAME (decl
) = get_identifier (name
);
5844 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5845 TYPE and operand OP. */
5848 build_va_arg_1 (location_t loc
, tree type
, tree op
)
5850 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
5851 SET_EXPR_LOCATION (expr
, loc
);
5855 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5856 va_arg (EXPR, TYPE) at source location LOC. */
5859 build_va_arg (location_t loc
, tree expr
, tree type
)
5861 tree va_type
= TREE_TYPE (expr
);
5862 tree canon_va_type
= (va_type
== error_mark_node
5864 : targetm
.canonical_va_list_type (va_type
));
5866 if (va_type
== error_mark_node
5867 || canon_va_type
== NULL_TREE
)
5869 if (canon_va_type
== NULL_TREE
)
5870 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
5872 /* Let's handle things neutrallly, if expr:
5873 - has undeclared type, or
5874 - is not an va_list type. */
5875 return build_va_arg_1 (loc
, type
, error_mark_node
);
5878 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
5880 /* Case 1: Not an array type. */
5882 /* Take the address, to get '&ap'. Note that &ap is not a va_list
5884 mark_addressable (expr
);
5885 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
5887 return build_va_arg_1 (loc
, type
, expr
);
5890 /* Case 2: Array type.
5894 For contrast, let's start with the simple case (case 1). If
5895 canon_va_type is not an array type, but say a char *, then when
5896 passing-by-value a va_list, the type of the va_list param decl is
5897 the same as for another va_list decl (all ap's are char *):
5900 D.1815 = VA_ARG (&ap, 0B, 1);
5906 __builtin_va_start (&ap, 0);
5909 __builtin_va_end (&ap);
5913 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5914 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5915 the same as for another va_list decl (case 2a, struct ap[1]).
5918 D.1844 = VA_ARG (ap, 0B, 0);
5923 __builtin_va_start (&ap, 0);
5925 __builtin_va_end (&ap);
5929 Case 2b is different because:
5930 - on the callee side, the parm decl has declared type va_list, but
5931 grokdeclarator changes the type of the parm decl to a pointer to the
5933 - on the caller side, the pass-by-value uses &ap.
5935 We unify these two cases (case 2a: va_list is array type,
5936 case 2b: va_list is pointer to array elem type), by adding '&' for the
5937 array type case, such that we have a pointer to array elem in both
5940 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
5942 /* Case 2a: va_list is array type. */
5944 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5946 mark_addressable (expr
);
5947 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
5950 /* Verify that &ap is still recognized as having va_list type. */
5951 tree canon_expr_type
5952 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
5953 gcc_assert (canon_expr_type
!= NULL_TREE
);
5957 /* Case 2b: va_list is pointer to array elem type. */
5958 gcc_assert (POINTER_TYPE_P (va_type
));
5960 /* Comparison as in std_canonical_va_list_type. */
5961 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
5962 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
5964 /* Don't take the address. We've already got '&ap'. */
5968 return build_va_arg_1 (loc
, type
, expr
);
5972 /* Linked list of disabled built-in functions. */
5974 struct disabled_builtin
5977 struct disabled_builtin
*next
;
5979 static disabled_builtin
*disabled_builtins
= NULL
;
5981 static bool builtin_function_disabled_p (const char *);
5983 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5984 begins with "__builtin_", give an error. */
5987 disable_builtin_function (const char *name
)
5989 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5990 error ("cannot disable built-in function %qs", name
);
5993 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5994 new_disabled_builtin
->name
= name
;
5995 new_disabled_builtin
->next
= disabled_builtins
;
5996 disabled_builtins
= new_disabled_builtin
;
6001 /* Return true if the built-in function NAME has been disabled, false
6005 builtin_function_disabled_p (const char *name
)
6007 disabled_builtin
*p
;
6008 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
6010 if (strcmp (name
, p
->name
) == 0)
6017 /* Worker for DEF_BUILTIN.
6018 Possibly define a builtin function with one or two names.
6019 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6020 nonansi_p and flag_no_nonansi_builtin. */
6023 def_builtin_1 (enum built_in_function fncode
,
6025 enum built_in_class fnclass
,
6026 tree fntype
, tree libtype
,
6027 bool both_p
, bool fallback_p
, bool nonansi_p
,
6028 tree fnattrs
, bool implicit_p
)
6031 const char *libname
;
6033 if (fntype
== error_mark_node
)
6036 gcc_assert ((!both_p
&& !fallback_p
)
6037 || !strncmp (name
, "__builtin_",
6038 strlen ("__builtin_")));
6040 libname
= name
+ strlen ("__builtin_");
6041 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
6042 (fallback_p
? libname
: NULL
),
6045 set_builtin_decl (fncode
, decl
, implicit_p
);
6048 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
6049 && !(nonansi_p
&& flag_no_nonansi_builtin
))
6050 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
6054 /* Nonzero if the type T promotes to int. This is (nearly) the
6055 integral promotions defined in ISO C99 6.3.1.1/2. */
6058 c_promoting_integer_type_p (const_tree t
)
6060 switch (TREE_CODE (t
))
6063 return (TYPE_MAIN_VARIANT (t
) == char_type_node
6064 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
6065 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
6066 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
6067 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
6068 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
6071 /* ??? Technically all enumerations not larger than an int
6072 promote to an int. But this is used along code paths
6073 that only want to notice a size change. */
6074 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
6084 /* Return 1 if PARMS specifies a fixed number of parameters
6085 and none of their types is affected by default promotions. */
6088 self_promoting_args_p (const_tree parms
)
6091 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
6093 tree type
= TREE_VALUE (t
);
6095 if (type
== error_mark_node
)
6098 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
6104 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
6107 if (c_promoting_integer_type_p (type
))
6113 /* Recursively remove any '*' or '&' operator from TYPE. */
6115 strip_pointer_operator (tree t
)
6117 while (POINTER_TYPE_P (t
))
6122 /* Recursively remove pointer or array type from TYPE. */
6124 strip_pointer_or_array_types (tree t
)
6126 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
6131 /* Used to compare case labels. K1 and K2 are actually tree nodes
6132 representing case labels, or NULL_TREE for a `default' label.
6133 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6134 K2, and 0 if K1 and K2 are equal. */
6137 case_compare (splay_tree_key k1
, splay_tree_key k2
)
6139 /* Consider a NULL key (such as arises with a `default' label) to be
6140 smaller than anything else. */
6146 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
6149 /* Process a case label, located at LOC, for the range LOW_VALUE
6150 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6151 then this case label is actually a `default' label. If only
6152 HIGH_VALUE is NULL_TREE, then case label was declared using the
6153 usual C/C++ syntax, rather than the GNU case range extension.
6154 CASES is a tree containing all the case ranges processed so far;
6155 COND is the condition for the switch-statement itself.
6156 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6157 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6158 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6161 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
6162 tree low_value
, tree high_value
, bool *outside_range_p
)
6167 splay_tree_node node
;
6169 /* Create the LABEL_DECL itself. */
6170 label
= create_artificial_label (loc
);
6172 /* If there was an error processing the switch condition, bail now
6173 before we get more confused. */
6174 if (!cond
|| cond
== error_mark_node
)
6177 if ((low_value
&& TREE_TYPE (low_value
)
6178 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
6179 || (high_value
&& TREE_TYPE (high_value
)
6180 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
6182 error_at (loc
, "pointers are not permitted as case values");
6186 /* Case ranges are a GNU extension. */
6188 pedwarn (loc
, OPT_Wpedantic
,
6189 "range expressions in switch statements are non-standard");
6191 type
= TREE_TYPE (cond
);
6194 low_value
= check_case_value (loc
, low_value
);
6195 low_value
= convert_and_check (loc
, type
, low_value
);
6196 if (low_value
== error_mark_node
)
6201 high_value
= check_case_value (loc
, high_value
);
6202 high_value
= convert_and_check (loc
, type
, high_value
);
6203 if (high_value
== error_mark_node
)
6207 if (low_value
&& high_value
)
6209 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6210 really a case range, even though it was written that way.
6211 Remove the HIGH_VALUE to simplify later processing. */
6212 if (tree_int_cst_equal (low_value
, high_value
))
6213 high_value
= NULL_TREE
;
6214 else if (!tree_int_cst_lt (low_value
, high_value
))
6215 warning_at (loc
, 0, "empty range specified");
6218 /* See if the case is in range of the type of the original testing
6219 expression. If both low_value and high_value are out of range,
6220 don't insert the case label and return NULL_TREE. */
6222 && !check_case_bounds (loc
, type
, orig_type
,
6223 &low_value
, high_value
? &high_value
: NULL
,
6227 /* Look up the LOW_VALUE in the table of case labels we already
6229 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
6230 /* If there was not an exact match, check for overlapping ranges.
6231 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6232 that's a `default' label and the only overlap is an exact match. */
6233 if (!node
&& (low_value
|| high_value
))
6235 splay_tree_node low_bound
;
6236 splay_tree_node high_bound
;
6238 /* Even though there wasn't an exact match, there might be an
6239 overlap between this case range and another case range.
6240 Since we've (inductively) not allowed any overlapping case
6241 ranges, we simply need to find the greatest low case label
6242 that is smaller that LOW_VALUE, and the smallest low case
6243 label that is greater than LOW_VALUE. If there is an overlap
6244 it will occur in one of these two ranges. */
6245 low_bound
= splay_tree_predecessor (cases
,
6246 (splay_tree_key
) low_value
);
6247 high_bound
= splay_tree_successor (cases
,
6248 (splay_tree_key
) low_value
);
6250 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6251 the LOW_VALUE, so there is no need to check unless the
6252 LOW_BOUND is in fact itself a case range. */
6254 && CASE_HIGH ((tree
) low_bound
->value
)
6255 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
6258 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6259 range is bigger than the low end of the current range, so we
6260 are only interested if the current range is a real range, and
6261 not an ordinary case label. */
6264 && (tree_int_cst_compare ((tree
) high_bound
->key
,
6269 /* If there was an overlap, issue an error. */
6272 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
6276 error_at (loc
, "duplicate (or overlapping) case value");
6277 error_at (DECL_SOURCE_LOCATION (duplicate
),
6278 "this is the first entry overlapping that value");
6282 error_at (loc
, "duplicate case value") ;
6283 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
6287 error_at (loc
, "multiple default labels in one switch");
6288 error_at (DECL_SOURCE_LOCATION (duplicate
),
6289 "this is the first default label");
6294 /* Add a CASE_LABEL to the statement-tree. */
6295 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
6296 /* Register this case label in the splay tree. */
6297 splay_tree_insert (cases
,
6298 (splay_tree_key
) low_value
,
6299 (splay_tree_value
) case_label
);
6304 /* Add a label so that the back-end doesn't think that the beginning of
6305 the switch is unreachable. Note that we do not add a case label, as
6306 that just leads to duplicates and thence to failure later on. */
6309 tree t
= create_artificial_label (loc
);
6310 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
6312 return error_mark_node
;
6315 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6316 Used to verify that case values match up with enumerator values. */
6319 match_case_to_enum_1 (tree key
, tree type
, tree label
)
6321 char buf
[WIDE_INT_PRINT_BUFFER_SIZE
];
6323 if (tree_fits_uhwi_p (key
))
6324 print_dec (key
, buf
, UNSIGNED
);
6325 else if (tree_fits_shwi_p (key
))
6326 print_dec (key
, buf
, SIGNED
);
6328 print_hex (key
, buf
);
6330 if (TYPE_NAME (type
) == 0)
6331 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6332 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6333 "case value %qs not in enumerated type",
6336 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6337 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6338 "case value %qs not in enumerated type %qT",
6342 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6343 Used to verify that case values match up with enumerator values. */
6346 match_case_to_enum (splay_tree_node node
, void *data
)
6348 tree label
= (tree
) node
->value
;
6349 tree type
= (tree
) data
;
6351 /* Skip default case. */
6352 if (!CASE_LOW (label
))
6355 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6356 when we did our enum->case scan. Reset our scratch bit after. */
6357 if (!CASE_LOW_SEEN (label
))
6358 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
6360 CASE_LOW_SEEN (label
) = 0;
6362 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6363 not set, that means that CASE_HIGH did not appear when we did our
6364 enum->case scan. Reset our scratch bit after. */
6365 if (CASE_HIGH (label
))
6367 if (!CASE_HIGH_SEEN (label
))
6368 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
6370 CASE_HIGH_SEEN (label
) = 0;
6376 /* Handle -Wswitch*. Called from the front end after parsing the
6377 switch construct. */
6378 /* ??? Should probably be somewhere generic, since other languages
6379 besides C and C++ would want this. At the moment, however, C/C++
6380 are the only tree-ssa languages that support enumerations at all,
6381 so the point is moot. */
6384 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
6385 tree type
, tree cond
, bool bool_cond_p
,
6386 bool outside_range_p
)
6388 splay_tree_node default_node
;
6389 splay_tree_node node
;
6392 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
6393 && !warn_switch_bool
)
6396 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
6398 warning_at (switch_location
, OPT_Wswitch_default
,
6399 "switch missing default case");
6401 /* There are certain cases where -Wswitch-bool warnings aren't
6408 so be careful here. */
6409 if (warn_switch_bool
&& bool_cond_p
)
6411 splay_tree_node min_node
;
6412 /* If there's a default node, it's also the value with the minimal
6413 key. So look at the penultimate key (if any). */
6415 min_node
= splay_tree_successor (cases
, (splay_tree_key
) NULL
);
6417 min_node
= splay_tree_min (cases
);
6418 tree min
= min_node
? (tree
) min_node
->key
: NULL_TREE
;
6420 splay_tree_node max_node
= splay_tree_max (cases
);
6421 /* This might be a case range, so look at the value with the
6422 maximal key and then check CASE_HIGH. */
6423 tree max
= max_node
? (tree
) max_node
->value
: NULL_TREE
;
6425 max
= CASE_HIGH (max
) ? CASE_HIGH (max
) : CASE_LOW (max
);
6427 /* If there's a case value > 1 or < 0, that is outside bool
6430 || (max
&& wi::gts_p (max
, 1))
6431 || (min
&& wi::lts_p (min
, 0))
6439 case, where we want to warn. */
6441 && max
&& wi::eq_p (max
, 1)
6442 && min
&& wi::eq_p (min
, 0)))
6443 warning_at (switch_location
, OPT_Wswitch_bool
,
6444 "switch condition has boolean value");
6447 /* From here on, we only care about enumerated types. */
6448 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
6451 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6452 if (!warn_switch_enum
&& !warn_switch
)
6455 /* Check the cases. Warn about case values which are not members of
6456 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6457 there is no default case, check that exactly all enumeration
6458 literals are covered by the cases. */
6460 /* Clearing COND if it is not an integer constant simplifies
6461 the tests inside the loop below. */
6462 if (TREE_CODE (cond
) != INTEGER_CST
)
6465 /* The time complexity here is O(N*lg(N)) worst case, but for the
6466 common case of monotonically increasing enumerators, it is
6467 O(N), since the nature of the splay tree will keep the next
6468 element adjacent to the root at all times. */
6470 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
6472 tree value
= TREE_VALUE (chain
);
6473 if (TREE_CODE (value
) == CONST_DECL
)
6474 value
= DECL_INITIAL (value
);
6475 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
6478 /* Mark the CASE_LOW part of the case entry as seen. */
6479 tree label
= (tree
) node
->value
;
6480 CASE_LOW_SEEN (label
) = 1;
6484 /* Even though there wasn't an exact match, there might be a
6485 case range which includes the enumerator's value. */
6486 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
6487 if (node
&& CASE_HIGH ((tree
) node
->value
))
6489 tree label
= (tree
) node
->value
;
6490 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
6493 /* If we match the upper bound exactly, mark the CASE_HIGH
6494 part of the case entry as seen. */
6496 CASE_HIGH_SEEN (label
) = 1;
6501 /* We've now determined that this enumerated literal isn't
6502 handled by the case labels of the switch statement. */
6504 /* If the switch expression is a constant, we only really care
6505 about whether that constant is handled by the switch. */
6506 if (cond
&& tree_int_cst_compare (cond
, value
))
6509 /* If there is a default_node, the only relevant option is
6510 Wswitch-enum. Otherwise, if both are enabled then we prefer
6511 to warn using -Wswitch because -Wswitch is enabled by -Wall
6512 while -Wswitch-enum is explicit. */
6513 warning_at (switch_location
,
6514 (default_node
|| !warn_switch
6517 "enumeration value %qE not handled in switch",
6518 TREE_PURPOSE (chain
));
6521 /* Warn if there are case expressions that don't correspond to
6522 enumerators. This can occur since C and C++ don't enforce
6523 type-checking of assignments to enumeration variables.
6525 The time complexity here is now always O(N) worst case, since
6526 we should have marked both the lower bound and upper bound of
6527 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6528 above. This scan also resets those fields. */
6530 splay_tree_foreach (cases
, match_case_to_enum
, type
);
6533 /* Finish an expression taking the address of LABEL (an
6534 IDENTIFIER_NODE). Returns an expression for the address.
6536 LOC is the location for the expression returned. */
6539 finish_label_address_expr (tree label
, location_t loc
)
6543 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
6545 if (label
== error_mark_node
)
6546 return error_mark_node
;
6548 label
= lookup_label (label
);
6549 if (label
== NULL_TREE
)
6550 result
= null_pointer_node
;
6553 TREE_USED (label
) = 1;
6554 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
6555 /* The current function is not necessarily uninlinable.
6556 Computed gotos are incompatible with inlining, but the value
6557 here could be used only in a diagnostic, for example. */
6558 protected_set_expr_location (result
, loc
);
6565 /* Given a boolean expression ARG, return a tree representing an increment
6566 or decrement (as indicated by CODE) of ARG. The front end must check for
6567 invalid cases (e.g., decrement in C++). */
6569 boolean_increment (enum tree_code code
, tree arg
)
6572 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
6574 arg
= stabilize_reference (arg
);
6577 case PREINCREMENT_EXPR
:
6578 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6580 case POSTINCREMENT_EXPR
:
6581 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6582 arg
= save_expr (arg
);
6583 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6584 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6586 case PREDECREMENT_EXPR
:
6587 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6588 invert_truthvalue_loc (input_location
, arg
));
6590 case POSTDECREMENT_EXPR
:
6591 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6592 invert_truthvalue_loc (input_location
, arg
));
6593 arg
= save_expr (arg
);
6594 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6595 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6600 TREE_SIDE_EFFECTS (val
) = 1;
6604 /* Built-in macros for stddef.h and stdint.h, that require macros
6605 defined in this file. */
6607 c_stddef_cpp_builtins(void)
6609 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
6610 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
6611 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
6612 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
6613 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
6614 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
6615 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
6616 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
6617 if (SIG_ATOMIC_TYPE
)
6618 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
6620 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
6622 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
6624 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
6626 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
6628 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
6630 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
6632 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
6634 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
6635 if (INT_LEAST8_TYPE
)
6636 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
6637 if (INT_LEAST16_TYPE
)
6638 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
6639 if (INT_LEAST32_TYPE
)
6640 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
6641 if (INT_LEAST64_TYPE
)
6642 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
6643 if (UINT_LEAST8_TYPE
)
6644 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
6645 if (UINT_LEAST16_TYPE
)
6646 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
6647 if (UINT_LEAST32_TYPE
)
6648 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
6649 if (UINT_LEAST64_TYPE
)
6650 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
6652 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
6653 if (INT_FAST16_TYPE
)
6654 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
6655 if (INT_FAST32_TYPE
)
6656 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
6657 if (INT_FAST64_TYPE
)
6658 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
6659 if (UINT_FAST8_TYPE
)
6660 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
6661 if (UINT_FAST16_TYPE
)
6662 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
6663 if (UINT_FAST32_TYPE
)
6664 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
6665 if (UINT_FAST64_TYPE
)
6666 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
6668 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
6670 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
6674 c_init_attributes (void)
6676 /* Fill in the built_in_attributes array. */
6677 #define DEF_ATTR_NULL_TREE(ENUM) \
6678 built_in_attributes[(int) ENUM] = NULL_TREE;
6679 #define DEF_ATTR_INT(ENUM, VALUE) \
6680 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6681 #define DEF_ATTR_STRING(ENUM, VALUE) \
6682 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6683 #define DEF_ATTR_IDENT(ENUM, STRING) \
6684 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6685 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6686 built_in_attributes[(int) ENUM] \
6687 = tree_cons (built_in_attributes[(int) PURPOSE], \
6688 built_in_attributes[(int) VALUE], \
6689 built_in_attributes[(int) CHAIN]);
6690 #include "builtin-attrs.def"
6691 #undef DEF_ATTR_NULL_TREE
6693 #undef DEF_ATTR_IDENT
6694 #undef DEF_ATTR_TREE_LIST
6697 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6698 identifier as an argument, so the front end shouldn't look it up. */
6701 attribute_takes_identifier_p (const_tree attr_id
)
6703 const struct attribute_spec
*spec
= lookup_attribute_spec (attr_id
);
6705 /* Unknown attribute that we'll end up ignoring, return true so we
6706 don't complain about an identifier argument. */
6708 else if (!strcmp ("mode", spec
->name
)
6709 || !strcmp ("format", spec
->name
)
6710 || !strcmp ("cleanup", spec
->name
))
6713 return targetm
.attribute_takes_identifier_p (attr_id
);
6716 /* Attribute handlers common to C front ends. */
6718 /* Handle a "packed" attribute; arguments as in
6719 struct attribute_spec.handler. */
6722 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6723 int flags
, bool *no_add_attrs
)
6727 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6728 *node
= build_variant_type_copy (*node
);
6729 TYPE_PACKED (*node
) = 1;
6731 else if (TREE_CODE (*node
) == FIELD_DECL
)
6733 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
6734 /* Still pack bitfields. */
6735 && ! DECL_INITIAL (*node
))
6736 warning (OPT_Wattributes
,
6737 "%qE attribute ignored for field of type %qT",
6738 name
, TREE_TYPE (*node
));
6740 DECL_PACKED (*node
) = 1;
6742 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6743 used for DECL_REGISTER. It wouldn't mean anything anyway.
6744 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6745 that changes what the typedef is typing. */
6748 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6749 *no_add_attrs
= true;
6755 /* Handle a "nocommon" attribute; arguments as in
6756 struct attribute_spec.handler. */
6759 handle_nocommon_attribute (tree
*node
, tree name
,
6760 tree
ARG_UNUSED (args
),
6761 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6764 DECL_COMMON (*node
) = 0;
6767 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6768 *no_add_attrs
= true;
6774 /* Handle a "common" attribute; arguments as in
6775 struct attribute_spec.handler. */
6778 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6779 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6782 DECL_COMMON (*node
) = 1;
6785 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6786 *no_add_attrs
= true;
6792 /* Handle a "noreturn" attribute; arguments as in
6793 struct attribute_spec.handler. */
6796 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6797 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6799 tree type
= TREE_TYPE (*node
);
6801 /* See FIXME comment in c_common_attribute_table. */
6802 if (TREE_CODE (*node
) == FUNCTION_DECL
6803 || objc_method_decl (TREE_CODE (*node
)))
6804 TREE_THIS_VOLATILE (*node
) = 1;
6805 else if (TREE_CODE (type
) == POINTER_TYPE
6806 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6808 = (build_qualified_type
6810 (build_type_variant (TREE_TYPE (type
),
6811 TYPE_READONLY (TREE_TYPE (type
)), 1)),
6812 TYPE_QUALS (type
)));
6815 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6816 *no_add_attrs
= true;
6822 /* Handle a "hot" and attribute; arguments as in
6823 struct attribute_spec.handler. */
6826 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6827 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6829 if (TREE_CODE (*node
) == FUNCTION_DECL
6830 || TREE_CODE (*node
) == LABEL_DECL
)
6832 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
6834 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6835 "with attribute %qs", name
, "cold");
6836 *no_add_attrs
= true;
6838 /* Most of the rest of the hot processing is done later with
6839 lookup_attribute. */
6843 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6844 *no_add_attrs
= true;
6850 /* Handle a "cold" and attribute; arguments as in
6851 struct attribute_spec.handler. */
6854 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6855 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6857 if (TREE_CODE (*node
) == FUNCTION_DECL
6858 || TREE_CODE (*node
) == LABEL_DECL
)
6860 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
6862 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6863 "with attribute %qs", name
, "hot");
6864 *no_add_attrs
= true;
6866 /* Most of the rest of the cold processing is done later with
6867 lookup_attribute. */
6871 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6872 *no_add_attrs
= true;
6878 /* Handle a "no_sanitize_address" attribute; arguments as in
6879 struct attribute_spec.handler. */
6882 handle_no_sanitize_address_attribute (tree
*node
, tree name
, tree
, int,
6885 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6887 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6888 *no_add_attrs
= true;
6894 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6895 struct attribute_spec.handler. */
6898 handle_no_address_safety_analysis_attribute (tree
*node
, tree name
, tree
, int,
6901 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6902 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6903 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node
)))
6904 DECL_ATTRIBUTES (*node
)
6905 = tree_cons (get_identifier ("no_sanitize_address"),
6906 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6907 *no_add_attrs
= true;
6911 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6912 struct attribute_spec.handler. */
6915 handle_no_sanitize_undefined_attribute (tree
*node
, tree name
, tree
, int,
6918 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6920 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6921 *no_add_attrs
= true;
6927 /* Handle a "stack_protect" attribute; arguments as in
6928 struct attribute_spec.handler. */
6930 handle_stack_protect_attribute (tree
*node
, tree name
, tree
, int,
6933 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6935 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6936 *no_add_attrs
= true;
6939 DECL_ATTRIBUTES (*node
)
6940 = tree_cons (get_identifier ("stack_protect"),
6941 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6946 /* Handle a "noinline" attribute; arguments as in
6947 struct attribute_spec.handler. */
6950 handle_noinline_attribute (tree
*node
, tree name
,
6951 tree
ARG_UNUSED (args
),
6952 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6954 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6956 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
6958 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6959 "with attribute %qs", name
, "always_inline");
6960 *no_add_attrs
= true;
6963 DECL_UNINLINABLE (*node
) = 1;
6967 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6968 *no_add_attrs
= true;
6974 /* Handle a "noclone" attribute; arguments as in
6975 struct attribute_spec.handler. */
6978 handle_noclone_attribute (tree
*node
, tree name
,
6979 tree
ARG_UNUSED (args
),
6980 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6982 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6984 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6985 *no_add_attrs
= true;
6991 /* Handle a "no_icf" attribute; arguments as in
6992 struct attribute_spec.handler. */
6995 handle_noicf_attribute (tree
*node
, tree name
,
6996 tree
ARG_UNUSED (args
),
6997 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6999 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7001 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7002 *no_add_attrs
= true;
7009 /* Handle a "always_inline" attribute; arguments as in
7010 struct attribute_spec.handler. */
7013 handle_always_inline_attribute (tree
*node
, tree name
,
7014 tree
ARG_UNUSED (args
),
7015 int ARG_UNUSED (flags
),
7018 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7020 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node
)))
7022 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
7023 "with %qs attribute", name
, "noinline");
7024 *no_add_attrs
= true;
7026 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
7028 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
7029 "with %qs attribute", name
, "target_clones");
7030 *no_add_attrs
= true;
7033 /* Set the attribute and mark it for disregarding inline
7035 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
7039 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7040 *no_add_attrs
= true;
7046 /* Handle a "gnu_inline" attribute; arguments as in
7047 struct attribute_spec.handler. */
7050 handle_gnu_inline_attribute (tree
*node
, tree name
,
7051 tree
ARG_UNUSED (args
),
7052 int ARG_UNUSED (flags
),
7055 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7057 /* Do nothing else, just set the attribute. We'll get at
7058 it later with lookup_attribute. */
7062 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7063 *no_add_attrs
= true;
7069 /* Handle a "leaf" attribute; arguments as in
7070 struct attribute_spec.handler. */
7073 handle_leaf_attribute (tree
*node
, tree name
,
7074 tree
ARG_UNUSED (args
),
7075 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7077 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7079 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7080 *no_add_attrs
= true;
7082 if (!TREE_PUBLIC (*node
))
7084 warning (OPT_Wattributes
, "%qE attribute has no effect on unit local functions", name
);
7085 *no_add_attrs
= true;
7091 /* Handle an "artificial" attribute; arguments as in
7092 struct attribute_spec.handler. */
7095 handle_artificial_attribute (tree
*node
, tree name
,
7096 tree
ARG_UNUSED (args
),
7097 int ARG_UNUSED (flags
),
7100 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7102 /* Do nothing else, just set the attribute. We'll get at
7103 it later with lookup_attribute. */
7107 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7108 *no_add_attrs
= true;
7114 /* Handle a "flatten" attribute; arguments as in
7115 struct attribute_spec.handler. */
7118 handle_flatten_attribute (tree
*node
, tree name
,
7119 tree args ATTRIBUTE_UNUSED
,
7120 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
7122 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7123 /* Do nothing else, just set the attribute. We'll get at
7124 it later with lookup_attribute. */
7128 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7129 *no_add_attrs
= true;
7135 /* Handle a "warning" or "error" attribute; arguments as in
7136 struct attribute_spec.handler. */
7139 handle_error_attribute (tree
*node
, tree name
, tree args
,
7140 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7142 if (TREE_CODE (*node
) == FUNCTION_DECL
7143 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
7144 /* Do nothing else, just set the attribute. We'll get at
7145 it later with lookup_attribute. */
7149 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7150 *no_add_attrs
= true;
7156 /* Handle a "used" attribute; arguments as in
7157 struct attribute_spec.handler. */
7160 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
7161 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7165 if (TREE_CODE (node
) == FUNCTION_DECL
7166 || (VAR_P (node
) && TREE_STATIC (node
))
7167 || (TREE_CODE (node
) == TYPE_DECL
))
7169 TREE_USED (node
) = 1;
7170 DECL_PRESERVE_P (node
) = 1;
7172 DECL_READ_P (node
) = 1;
7176 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7177 *no_add_attrs
= true;
7183 /* Handle a "unused" attribute; arguments as in
7184 struct attribute_spec.handler. */
7187 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7188 int flags
, bool *no_add_attrs
)
7194 if (TREE_CODE (decl
) == PARM_DECL
7195 || VAR_OR_FUNCTION_DECL_P (decl
)
7196 || TREE_CODE (decl
) == LABEL_DECL
7197 || TREE_CODE (decl
) == CONST_DECL
7198 || TREE_CODE (decl
) == TYPE_DECL
)
7200 TREE_USED (decl
) = 1;
7201 if (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
7202 DECL_READ_P (decl
) = 1;
7206 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7207 *no_add_attrs
= true;
7212 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7213 *node
= build_variant_type_copy (*node
);
7214 TREE_USED (*node
) = 1;
7220 /* Handle a "externally_visible" attribute; arguments as in
7221 struct attribute_spec.handler. */
7224 handle_externally_visible_attribute (tree
*pnode
, tree name
,
7225 tree
ARG_UNUSED (args
),
7226 int ARG_UNUSED (flags
),
7231 if (VAR_OR_FUNCTION_DECL_P (node
))
7233 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
7234 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
7236 warning (OPT_Wattributes
,
7237 "%qE attribute have effect only on public objects", name
);
7238 *no_add_attrs
= true;
7243 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7244 *no_add_attrs
= true;
7250 /* Handle the "no_reorder" attribute. Arguments as in
7251 struct attribute_spec.handler. */
7254 handle_no_reorder_attribute (tree
*pnode
,
7262 if (!VAR_OR_FUNCTION_DECL_P (node
)
7263 && !(TREE_STATIC (node
) || DECL_EXTERNAL (node
)))
7265 warning (OPT_Wattributes
,
7266 "%qE attribute only affects top level objects",
7268 *no_add_attrs
= true;
7274 /* Handle a "const" attribute; arguments as in
7275 struct attribute_spec.handler. */
7278 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7279 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7281 tree type
= TREE_TYPE (*node
);
7283 /* See FIXME comment on noreturn in c_common_attribute_table. */
7284 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7285 TREE_READONLY (*node
) = 1;
7286 else if (TREE_CODE (type
) == POINTER_TYPE
7287 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
7289 = (build_qualified_type
7291 (build_type_variant (TREE_TYPE (type
), 1,
7292 TREE_THIS_VOLATILE (TREE_TYPE (type
)))),
7293 TYPE_QUALS (type
)));
7296 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7297 *no_add_attrs
= true;
7303 /* Handle a "scalar_storage_order" attribute; arguments as in
7304 struct attribute_spec.handler. */
7307 handle_scalar_storage_order_attribute (tree
*node
, tree name
, tree args
,
7308 int flags
, bool *no_add_attrs
)
7310 tree id
= TREE_VALUE (args
);
7313 if (TREE_CODE (*node
) == TYPE_DECL
7314 && ! (flags
& ATTR_FLAG_CXX11
))
7315 node
= &TREE_TYPE (*node
);
7318 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
)
7320 error ("scalar_storage_order is not supported because endianness "
7325 if (RECORD_OR_UNION_TYPE_P (type
) && !c_dialect_cxx ())
7327 bool reverse
= false;
7329 if (TREE_CODE (id
) == STRING_CST
7330 && strcmp (TREE_STRING_POINTER (id
), "big-endian") == 0)
7331 reverse
= !BYTES_BIG_ENDIAN
;
7332 else if (TREE_CODE (id
) == STRING_CST
7333 && strcmp (TREE_STRING_POINTER (id
), "little-endian") == 0)
7334 reverse
= BYTES_BIG_ENDIAN
;
7337 error ("scalar_storage_order argument must be one of \"big-endian\""
7338 " or \"little-endian\"");
7342 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7345 /* A type variant isn't good enough, since we don't want a cast
7346 to such a type to be removed as a no-op. */
7347 *node
= type
= build_duplicate_type (type
);
7350 TYPE_REVERSE_STORAGE_ORDER (type
) = reverse
;
7354 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7355 *no_add_attrs
= true;
7359 /* Handle a "transparent_union" attribute; arguments as in
7360 struct attribute_spec.handler. */
7363 handle_transparent_union_attribute (tree
*node
, tree name
,
7364 tree
ARG_UNUSED (args
), int flags
,
7369 *no_add_attrs
= true;
7371 if (TREE_CODE (*node
) == TYPE_DECL
7372 && ! (flags
& ATTR_FLAG_CXX11
))
7373 node
= &TREE_TYPE (*node
);
7376 if (TREE_CODE (type
) == UNION_TYPE
)
7378 /* Make sure that the first field will work for a transparent union.
7379 If the type isn't complete yet, leave the check to the code in
7381 if (TYPE_SIZE (type
))
7383 tree first
= first_field (type
);
7384 if (first
== NULL_TREE
7385 || DECL_ARTIFICIAL (first
)
7386 || TYPE_MODE (type
) != DECL_MODE (first
))
7390 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7392 /* If the type isn't complete yet, setting the flag
7393 on a variant wouldn't ever be checked. */
7394 if (!TYPE_SIZE (type
))
7397 /* build_duplicate_type doesn't work for C++. */
7398 if (c_dialect_cxx ())
7401 /* A type variant isn't good enough, since we don't want a cast
7402 to such a type to be removed as a no-op. */
7403 *node
= type
= build_duplicate_type (type
);
7406 for (tree t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7407 TYPE_TRANSPARENT_AGGR (t
) = 1;
7412 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7416 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7417 get the requested priority for a constructor or destructor,
7418 possibly issuing diagnostics for invalid or reserved
7421 static priority_type
7422 get_priority (tree args
, bool is_destructor
)
7428 return DEFAULT_INIT_PRIORITY
;
7430 if (!SUPPORTS_INIT_PRIORITY
)
7433 error ("destructor priorities are not supported");
7435 error ("constructor priorities are not supported");
7436 return DEFAULT_INIT_PRIORITY
;
7439 arg
= TREE_VALUE (args
);
7440 if (TREE_CODE (arg
) == IDENTIFIER_NODE
)
7442 if (arg
== error_mark_node
)
7443 return DEFAULT_INIT_PRIORITY
;
7444 arg
= default_conversion (arg
);
7445 if (!tree_fits_shwi_p (arg
)
7446 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
7449 pri
= tree_to_shwi (arg
);
7450 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
7453 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
7457 "destructor priorities from 0 to %d are reserved "
7458 "for the implementation",
7459 MAX_RESERVED_INIT_PRIORITY
);
7462 "constructor priorities from 0 to %d are reserved "
7463 "for the implementation",
7464 MAX_RESERVED_INIT_PRIORITY
);
7470 error ("destructor priorities must be integers from 0 to %d inclusive",
7473 error ("constructor priorities must be integers from 0 to %d inclusive",
7475 return DEFAULT_INIT_PRIORITY
;
7478 /* Handle a "constructor" attribute; arguments as in
7479 struct attribute_spec.handler. */
7482 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
7483 int ARG_UNUSED (flags
),
7487 tree type
= TREE_TYPE (decl
);
7489 if (TREE_CODE (decl
) == FUNCTION_DECL
7490 && TREE_CODE (type
) == FUNCTION_TYPE
7491 && decl_function_context (decl
) == 0)
7493 priority_type priority
;
7494 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
7495 priority
= get_priority (args
, /*is_destructor=*/false);
7496 SET_DECL_INIT_PRIORITY (decl
, priority
);
7497 TREE_USED (decl
) = 1;
7501 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7502 *no_add_attrs
= true;
7508 /* Handle a "destructor" attribute; arguments as in
7509 struct attribute_spec.handler. */
7512 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
7513 int ARG_UNUSED (flags
),
7517 tree type
= TREE_TYPE (decl
);
7519 if (TREE_CODE (decl
) == FUNCTION_DECL
7520 && TREE_CODE (type
) == FUNCTION_TYPE
7521 && decl_function_context (decl
) == 0)
7523 priority_type priority
;
7524 DECL_STATIC_DESTRUCTOR (decl
) = 1;
7525 priority
= get_priority (args
, /*is_destructor=*/true);
7526 SET_DECL_FINI_PRIORITY (decl
, priority
);
7527 TREE_USED (decl
) = 1;
7531 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7532 *no_add_attrs
= true;
7538 /* Nonzero if the mode is a valid vector mode for this architecture.
7539 This returns nonzero even if there is no hardware support for the
7540 vector mode, but we can emulate with narrower modes. */
7543 vector_mode_valid_p (machine_mode mode
)
7545 enum mode_class mclass
= GET_MODE_CLASS (mode
);
7546 machine_mode innermode
;
7548 /* Doh! What's going on? */
7549 if (mclass
!= MODE_VECTOR_INT
7550 && mclass
!= MODE_VECTOR_FLOAT
7551 && mclass
!= MODE_VECTOR_FRACT
7552 && mclass
!= MODE_VECTOR_UFRACT
7553 && mclass
!= MODE_VECTOR_ACCUM
7554 && mclass
!= MODE_VECTOR_UACCUM
)
7557 /* Hardware support. Woo hoo! */
7558 if (targetm
.vector_mode_supported_p (mode
))
7561 innermode
= GET_MODE_INNER (mode
);
7563 /* We should probably return 1 if requesting V4DI and we have no DI,
7564 but we have V2DI, but this is probably very unlikely. */
7566 /* If we have support for the inner mode, we can safely emulate it.
7567 We may not have V2DI, but me can emulate with a pair of DIs. */
7568 return targetm
.scalar_mode_supported_p (innermode
);
7572 /* Handle a "mode" attribute; arguments as in
7573 struct attribute_spec.handler. */
7576 handle_mode_attribute (tree
*node
, tree name
, tree args
,
7577 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7580 tree ident
= TREE_VALUE (args
);
7582 *no_add_attrs
= true;
7584 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
7585 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7589 const char *p
= IDENTIFIER_POINTER (ident
);
7590 int len
= strlen (p
);
7591 machine_mode mode
= VOIDmode
;
7595 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
7596 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
7598 char *newp
= (char *) alloca (len
- 1);
7600 strcpy (newp
, &p
[2]);
7601 newp
[len
- 4] = '\0';
7605 /* Change this type to have a type with the specified mode.
7606 First check for the special modes. */
7607 if (!strcmp (p
, "byte"))
7609 else if (!strcmp (p
, "word"))
7611 else if (!strcmp (p
, "pointer"))
7613 else if (!strcmp (p
, "libgcc_cmp_return"))
7614 mode
= targetm
.libgcc_cmp_return_mode ();
7615 else if (!strcmp (p
, "libgcc_shift_count"))
7616 mode
= targetm
.libgcc_shift_count_mode ();
7617 else if (!strcmp (p
, "unwind_word"))
7618 mode
= targetm
.unwind_word_mode ();
7620 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
7621 if (!strcmp (p
, GET_MODE_NAME (j
)))
7623 mode
= (machine_mode
) j
;
7627 if (mode
== VOIDmode
)
7629 error ("unknown machine mode %qE", ident
);
7634 switch (GET_MODE_CLASS (mode
))
7637 case MODE_PARTIAL_INT
:
7639 case MODE_DECIMAL_FLOAT
:
7644 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
7647 case MODE_COMPLEX_INT
:
7648 case MODE_COMPLEX_FLOAT
:
7649 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
7652 case MODE_VECTOR_INT
:
7653 case MODE_VECTOR_FLOAT
:
7654 case MODE_VECTOR_FRACT
:
7655 case MODE_VECTOR_UFRACT
:
7656 case MODE_VECTOR_ACCUM
:
7657 case MODE_VECTOR_UACCUM
:
7658 warning (OPT_Wattributes
, "specifying vector types with "
7659 "__attribute__ ((mode)) is deprecated");
7660 warning (OPT_Wattributes
,
7661 "use __attribute__ ((vector_size)) instead");
7662 valid_mode
= vector_mode_valid_p (mode
);
7670 error ("unable to emulate %qs", p
);
7674 if (POINTER_TYPE_P (type
))
7676 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
7677 tree (*fn
)(tree
, machine_mode
, bool);
7679 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
7681 error ("invalid pointer mode %qs", p
);
7685 if (TREE_CODE (type
) == POINTER_TYPE
)
7686 fn
= build_pointer_type_for_mode
;
7688 fn
= build_reference_type_for_mode
;
7689 typefm
= fn (TREE_TYPE (type
), mode
, false);
7693 /* For fixed-point modes, we need to test if the signness of type
7694 and the machine mode are consistent. */
7695 if (ALL_FIXED_POINT_MODE_P (mode
)
7696 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
7698 error ("signedness of type and machine mode %qs don%'t match", p
);
7701 /* For fixed-point modes, we need to pass saturating info. */
7702 typefm
= lang_hooks
.types
.type_for_mode (mode
,
7703 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
7704 : TYPE_UNSIGNED (type
));
7707 if (typefm
== NULL_TREE
)
7709 error ("no data type for mode %qs", p
);
7712 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
7714 /* For enumeral types, copy the precision from the integer
7715 type returned above. If not an INTEGER_TYPE, we can't use
7716 this mode for this type. */
7717 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
7719 error ("cannot use mode %qs for enumeral types", p
);
7723 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
7725 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
7730 /* We cannot build a type variant, as there's code that assumes
7731 that TYPE_MAIN_VARIANT has the same mode. This includes the
7732 debug generators. Instead, create a subrange type. This
7733 results in all of the enumeral values being emitted only once
7734 in the original, and the subtype gets them by reference. */
7735 if (TYPE_UNSIGNED (type
))
7736 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
7738 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
7739 TREE_TYPE (typefm
) = type
;
7742 else if (VECTOR_MODE_P (mode
)
7743 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
7744 : TREE_CODE (type
) != TREE_CODE (typefm
))
7746 error ("mode %qs applied to inappropriate type", p
);
7756 /* Handle a "section" attribute; arguments as in
7757 struct attribute_spec.handler. */
7760 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7761 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7765 if (!targetm_common
.have_named_sections
)
7767 error_at (DECL_SOURCE_LOCATION (*node
),
7768 "section attributes are not supported for this target");
7772 user_defined_section_attribute
= true;
7774 if (!VAR_OR_FUNCTION_DECL_P (decl
))
7776 error ("section attribute not allowed for %q+D", *node
);
7780 if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7782 error ("section attribute argument not a string constant");
7787 && current_function_decl
!= NULL_TREE
7788 && !TREE_STATIC (decl
))
7790 error_at (DECL_SOURCE_LOCATION (decl
),
7791 "section attribute cannot be specified for local variables");
7795 /* The decl may have already been given a section attribute
7796 from a previous declaration. Ensure they match. */
7797 if (DECL_SECTION_NAME (decl
) != NULL
7798 && strcmp (DECL_SECTION_NAME (decl
),
7799 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
7801 error ("section of %q+D conflicts with previous declaration", *node
);
7806 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
7807 && DECL_THREAD_LOCAL_P (decl
))
7809 error ("section of %q+D cannot be overridden", *node
);
7813 set_decl_section_name (decl
, TREE_STRING_POINTER (TREE_VALUE (args
)));
7817 *no_add_attrs
= true;
7821 /* Check whether ALIGN is a valid user-specified alignment. If so,
7822 return its base-2 log; if not, output an error and return -1. If
7823 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7826 check_user_alignment (const_tree align
, bool allow_zero
)
7830 if (error_operand_p (align
))
7832 if (TREE_CODE (align
) != INTEGER_CST
7833 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
7835 error ("requested alignment is not an integer constant");
7838 else if (allow_zero
&& integer_zerop (align
))
7840 else if (tree_int_cst_sgn (align
) == -1
7841 || (i
= tree_log2 (align
)) == -1)
7843 error ("requested alignment is not a positive power of 2");
7846 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
7848 error ("requested alignment is too large");
7854 /* If in c++-11, check if the c++-11 alignment constraint with respect
7855 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7856 c++-11 mode, does nothing.
7860 [* if the constant expression evaluates to a fundamental alignment,
7861 the alignment requirement of the declared entity shall be the
7862 specified fundamental alignment.
7864 * if the constant expression evaluates to an extended alignment
7865 and the implementation supports that alignment in the context
7866 of the declaration, the alignment of the declared entity shall
7869 * if the constant expression evaluates to an extended alignment
7870 and the implementation does not support that alignment in the
7871 context of the declaration, the program is ill-formed]. */
7874 check_cxx_fundamental_alignment_constraints (tree node
,
7878 bool alignment_too_large_p
= false;
7879 unsigned requested_alignment
= (1U << align_log
) * BITS_PER_UNIT
;
7880 unsigned max_align
= 0;
7882 if ((!(flags
& ATTR_FLAG_CXX11
) && !warn_cxx_compat
)
7883 || (node
== NULL_TREE
|| node
== error_mark_node
))
7886 if (cxx_fundamental_alignment_p (requested_alignment
))
7891 if (TREE_STATIC (node
) || DECL_EXTERNAL (node
))
7892 /* For file scope variables and static members, the target supports
7893 alignments that are at most MAX_OFILE_ALIGNMENT. */
7894 max_align
= MAX_OFILE_ALIGNMENT
;
7896 /* For stack variables, the target supports at most
7897 MAX_STACK_ALIGNMENT. */
7898 max_align
= MAX_STACK_ALIGNMENT
;
7899 if (requested_alignment
> max_align
)
7900 alignment_too_large_p
= true;
7902 /* Let's be liberal for types and fields; don't limit their alignment any
7903 more than check_user_alignment already did. */
7905 if (alignment_too_large_p
)
7906 pedwarn (input_location
, OPT_Wattributes
,
7907 "requested alignment %d is larger than %d",
7908 requested_alignment
/ BITS_PER_UNIT
, max_align
/ BITS_PER_UNIT
);
7910 return !alignment_too_large_p
;
7913 /* Handle a "aligned" attribute; arguments as in
7914 struct attribute_spec.handler. */
7917 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7918 int flags
, bool *no_add_attrs
)
7920 tree decl
= NULL_TREE
;
7928 align_expr
= TREE_VALUE (args
);
7929 if (align_expr
&& TREE_CODE (align_expr
) != IDENTIFIER_NODE
7930 && TREE_CODE (align_expr
) != FUNCTION_DECL
)
7931 align_expr
= default_conversion (align_expr
);
7934 align_expr
= size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
);
7939 type
= &TREE_TYPE (decl
);
7940 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
7942 else if (TYPE_P (*node
))
7943 type
= node
, is_type
= 1;
7945 if ((i
= check_user_alignment (align_expr
, true)) == -1
7946 || !check_cxx_fundamental_alignment_constraints (*node
, i
, flags
))
7947 *no_add_attrs
= true;
7950 if ((flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7951 /* OK, modify the type in place. */;
7952 /* If we have a TYPE_DECL, then copy the type, so that we
7953 don't accidentally modify a builtin type. See pushdecl. */
7954 else if (decl
&& TREE_TYPE (decl
) != error_mark_node
7955 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
7957 tree tt
= TREE_TYPE (decl
);
7958 *type
= build_variant_type_copy (*type
);
7959 DECL_ORIGINAL_TYPE (decl
) = tt
;
7960 TYPE_NAME (*type
) = decl
;
7961 TREE_USED (*type
) = TREE_USED (decl
);
7962 TREE_TYPE (decl
) = *type
;
7965 *type
= build_variant_type_copy (*type
);
7967 SET_TYPE_ALIGN (*type
, (1U << i
) * BITS_PER_UNIT
);
7968 TYPE_USER_ALIGN (*type
) = 1;
7970 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
7971 && TREE_CODE (decl
) != FIELD_DECL
)
7973 error ("alignment may not be specified for %q+D", decl
);
7974 *no_add_attrs
= true;
7976 else if (DECL_USER_ALIGN (decl
)
7977 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
7978 /* C++-11 [dcl.align/4]:
7980 When multiple alignment-specifiers are specified for an
7981 entity, the alignment requirement shall be set to the
7982 strictest specified alignment.
7984 This formally comes from the c++11 specification but we are
7985 doing it for the GNU attribute syntax as well. */
7986 *no_add_attrs
= true;
7987 else if (TREE_CODE (decl
) == FUNCTION_DECL
7988 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
7990 if (DECL_USER_ALIGN (decl
))
7991 error ("alignment for %q+D was previously specified as %d "
7992 "and may not be decreased", decl
,
7993 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
7995 error ("alignment for %q+D must be at least %d", decl
,
7996 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
7997 *no_add_attrs
= true;
8001 SET_DECL_ALIGN (decl
, (1U << i
) * BITS_PER_UNIT
);
8002 DECL_USER_ALIGN (decl
) = 1;
8008 /* Handle a "weak" attribute; arguments as in
8009 struct attribute_spec.handler. */
8012 handle_weak_attribute (tree
*node
, tree name
,
8013 tree
ARG_UNUSED (args
),
8014 int ARG_UNUSED (flags
),
8015 bool * ARG_UNUSED (no_add_attrs
))
8017 if (TREE_CODE (*node
) == FUNCTION_DECL
8018 && DECL_DECLARED_INLINE_P (*node
))
8020 warning (OPT_Wattributes
, "inline function %q+D declared weak", *node
);
8021 *no_add_attrs
= true;
8023 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8025 error ("indirect function %q+D cannot be declared weak", *node
);
8026 *no_add_attrs
= true;
8029 else if (VAR_OR_FUNCTION_DECL_P (*node
))
8030 declare_weak (*node
);
8032 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8037 /* Handle a "noplt" attribute; arguments as in
8038 struct attribute_spec.handler. */
8041 handle_noplt_attribute (tree
*node
, tree name
,
8042 tree
ARG_UNUSED (args
),
8043 int ARG_UNUSED (flags
),
8044 bool * ARG_UNUSED (no_add_attrs
))
8046 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8048 warning (OPT_Wattributes
,
8049 "%qE attribute is only applicable on functions", name
);
8050 *no_add_attrs
= true;
8056 /* Handle an "alias" or "ifunc" attribute; arguments as in
8057 struct attribute_spec.handler, except that IS_ALIAS tells us
8058 whether this is an alias as opposed to ifunc attribute. */
8061 handle_alias_ifunc_attribute (bool is_alias
, tree
*node
, tree name
, tree args
,
8066 if (TREE_CODE (decl
) != FUNCTION_DECL
8067 && (!is_alias
|| !VAR_P (decl
)))
8069 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8070 *no_add_attrs
= true;
8072 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
8073 || (TREE_CODE (decl
) != FUNCTION_DECL
8074 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
8075 /* A static variable declaration is always a tentative definition,
8076 but the alias is a non-tentative definition which overrides. */
8077 || (TREE_CODE (decl
) != FUNCTION_DECL
8078 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
8080 error ("%q+D defined both normally and as %qE attribute", decl
, name
);
8081 *no_add_attrs
= true;
8085 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl
))
8086 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))))
8088 error ("weak %q+D cannot be defined %qE", decl
, name
);
8089 *no_add_attrs
= true;
8093 /* Note that the very first time we process a nested declaration,
8094 decl_function_context will not be set. Indeed, *would* never
8095 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8096 we do below. After such frobbery, pushdecl would set the context.
8097 In any case, this is never what we want. */
8098 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
8102 id
= TREE_VALUE (args
);
8103 if (TREE_CODE (id
) != STRING_CST
)
8105 error ("attribute %qE argument not a string", name
);
8106 *no_add_attrs
= true;
8109 id
= get_identifier (TREE_STRING_POINTER (id
));
8110 /* This counts as a use of the object pointed to. */
8113 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8114 DECL_INITIAL (decl
) = error_mark_node
;
8116 TREE_STATIC (decl
) = 1;
8119 /* ifuncs are also aliases, so set that attribute too. */
8120 DECL_ATTRIBUTES (decl
)
8121 = tree_cons (get_identifier ("alias"), args
, DECL_ATTRIBUTES (decl
));
8125 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8126 *no_add_attrs
= true;
8129 if (decl_in_symtab_p (*node
))
8131 struct symtab_node
*n
= symtab_node::get (decl
);
8132 if (n
&& n
->refuse_visibility_changes
)
8135 error ("%+D declared alias after being used", decl
);
8137 error ("%+D declared ifunc after being used", decl
);
8145 /* Handle an "alias" or "ifunc" attribute; arguments as in
8146 struct attribute_spec.handler. */
8149 handle_ifunc_attribute (tree
*node
, tree name
, tree args
,
8150 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8152 return handle_alias_ifunc_attribute (false, node
, name
, args
, no_add_attrs
);
8155 /* Handle an "alias" or "ifunc" attribute; arguments as in
8156 struct attribute_spec.handler. */
8159 handle_alias_attribute (tree
*node
, tree name
, tree args
,
8160 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8162 return handle_alias_ifunc_attribute (true, node
, name
, args
, no_add_attrs
);
8165 /* Handle a "weakref" attribute; arguments as in struct
8166 attribute_spec.handler. */
8169 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8170 int flags
, bool *no_add_attrs
)
8172 tree attr
= NULL_TREE
;
8174 /* We must ignore the attribute when it is associated with
8175 local-scoped decls, since attribute alias is ignored and many
8176 such symbols do not even have a DECL_WEAK field. */
8177 if (decl_function_context (*node
)
8178 || current_function_decl
8179 || !VAR_OR_FUNCTION_DECL_P (*node
))
8181 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8182 *no_add_attrs
= true;
8186 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8188 error ("indirect function %q+D cannot be declared weakref", *node
);
8189 *no_add_attrs
= true;
8193 /* The idea here is that `weakref("name")' mutates into `weakref,
8194 alias("name")', and weakref without arguments, in turn,
8195 implicitly adds weak. */
8199 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
8200 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
8202 *no_add_attrs
= true;
8204 decl_attributes (node
, attr
, flags
);
8208 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
8209 error_at (DECL_SOURCE_LOCATION (*node
),
8210 "weakref attribute must appear before alias attribute");
8212 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8213 and that isn't supported; and because it wants to add it to
8214 the list of weak decls, which isn't helpful. */
8215 DECL_WEAK (*node
) = 1;
8218 if (decl_in_symtab_p (*node
))
8220 struct symtab_node
*n
= symtab_node::get (*node
);
8221 if (n
&& n
->refuse_visibility_changes
)
8222 error ("%+D declared weakref after being used", *node
);
8228 /* Handle an "visibility" attribute; arguments as in
8229 struct attribute_spec.handler. */
8232 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
8233 int ARG_UNUSED (flags
),
8234 bool *ARG_UNUSED (no_add_attrs
))
8237 tree id
= TREE_VALUE (args
);
8238 enum symbol_visibility vis
;
8242 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
8244 else if (!RECORD_OR_UNION_TYPE_P (*node
))
8246 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
8250 else if (TYPE_FIELDS (*node
))
8252 error ("%qE attribute ignored because %qT is already defined",
8257 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
8259 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8263 if (TREE_CODE (id
) != STRING_CST
)
8265 error ("visibility argument not a string");
8269 /* If this is a type, set the visibility on the type decl. */
8272 decl
= TYPE_NAME (decl
);
8275 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8277 warning (OPT_Wattributes
, "%qE attribute ignored on types",
8283 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
8284 vis
= VISIBILITY_DEFAULT
;
8285 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
8286 vis
= VISIBILITY_INTERNAL
;
8287 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
8288 vis
= VISIBILITY_HIDDEN
;
8289 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
8290 vis
= VISIBILITY_PROTECTED
;
8293 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8294 vis
= VISIBILITY_DEFAULT
;
8297 if (DECL_VISIBILITY_SPECIFIED (decl
)
8298 && vis
!= DECL_VISIBILITY (decl
))
8300 tree attributes
= (TYPE_P (*node
)
8301 ? TYPE_ATTRIBUTES (*node
)
8302 : DECL_ATTRIBUTES (decl
));
8303 if (lookup_attribute ("visibility", attributes
))
8304 error ("%qD redeclared with different visibility", decl
);
8305 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8306 && lookup_attribute ("dllimport", attributes
))
8307 error ("%qD was declared %qs which implies default visibility",
8309 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8310 && lookup_attribute ("dllexport", attributes
))
8311 error ("%qD was declared %qs which implies default visibility",
8315 DECL_VISIBILITY (decl
) = vis
;
8316 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
8318 /* Go ahead and attach the attribute to the node as well. This is needed
8319 so we can determine whether we have VISIBILITY_DEFAULT because the
8320 visibility was not specified, or because it was explicitly overridden
8321 from the containing scope. */
8326 /* Determine the ELF symbol visibility for DECL, which is either a
8327 variable or a function. It is an error to use this function if a
8328 definition of DECL is not available in this translation unit.
8329 Returns true if the final visibility has been determined by this
8330 function; false if the caller is free to make additional
8334 c_determine_visibility (tree decl
)
8336 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
8338 /* If the user explicitly specified the visibility with an
8339 attribute, honor that. DECL_VISIBILITY will have been set during
8340 the processing of the attribute. We check for an explicit
8341 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8342 to distinguish the use of an attribute from the use of a "#pragma
8343 GCC visibility push(...)"; in the latter case we still want other
8344 considerations to be able to overrule the #pragma. */
8345 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
8346 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8347 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
8348 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
8351 /* Set default visibility to whatever the user supplied with
8352 visibility_specified depending on #pragma GCC visibility. */
8353 if (!DECL_VISIBILITY_SPECIFIED (decl
))
8355 if (visibility_options
.inpragma
8356 || DECL_VISIBILITY (decl
) != default_visibility
)
8358 DECL_VISIBILITY (decl
) = default_visibility
;
8359 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
8360 /* If visibility changed and DECL already has DECL_RTL, ensure
8361 symbol flags are updated. */
8362 if (((VAR_P (decl
) && TREE_STATIC (decl
))
8363 || TREE_CODE (decl
) == FUNCTION_DECL
)
8364 && DECL_RTL_SET_P (decl
))
8365 make_decl_rtl (decl
);
8371 /* Handle an "tls_model" attribute; arguments as in
8372 struct attribute_spec.handler. */
8375 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
8376 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8380 enum tls_model kind
;
8382 *no_add_attrs
= true;
8384 if (!VAR_P (decl
) || !DECL_THREAD_LOCAL_P (decl
))
8386 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8390 kind
= DECL_TLS_MODEL (decl
);
8391 id
= TREE_VALUE (args
);
8392 if (TREE_CODE (id
) != STRING_CST
)
8394 error ("tls_model argument not a string");
8398 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
8399 kind
= TLS_MODEL_LOCAL_EXEC
;
8400 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
8401 kind
= TLS_MODEL_INITIAL_EXEC
;
8402 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
8403 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
8404 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
8405 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
8407 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8409 set_decl_tls_model (decl
, kind
);
8413 /* Handle a "no_instrument_function" attribute; arguments as in
8414 struct attribute_spec.handler. */
8417 handle_no_instrument_function_attribute (tree
*node
, tree name
,
8418 tree
ARG_UNUSED (args
),
8419 int ARG_UNUSED (flags
),
8424 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8426 error_at (DECL_SOURCE_LOCATION (decl
),
8427 "%qE attribute applies only to functions", name
);
8428 *no_add_attrs
= true;
8431 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
8436 /* Handle a "no_profile_instrument_function" attribute; arguments as in
8437 struct attribute_spec.handler. */
8440 handle_no_profile_instrument_function_attribute (tree
*node
, tree name
, tree
,
8441 int, bool *no_add_attrs
)
8443 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8445 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8446 *no_add_attrs
= true;
8452 /* Handle a "malloc" attribute; arguments as in
8453 struct attribute_spec.handler. */
8456 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8457 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8459 if (TREE_CODE (*node
) == FUNCTION_DECL
8460 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
8461 DECL_IS_MALLOC (*node
) = 1;
8464 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8465 *no_add_attrs
= true;
8471 /* Handle a "alloc_size" attribute; arguments as in
8472 struct attribute_spec.handler. */
8475 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8476 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8478 unsigned arg_count
= type_num_arguments (*node
);
8479 for (; args
; args
= TREE_CHAIN (args
))
8481 tree position
= TREE_VALUE (args
);
8482 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8483 && TREE_CODE (position
) != FUNCTION_DECL
)
8484 position
= default_conversion (position
);
8486 if (!tree_fits_uhwi_p (position
)
8488 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8490 warning (OPT_Wattributes
,
8491 "alloc_size parameter outside range");
8492 *no_add_attrs
= true;
8499 /* Handle a "alloc_align" attribute; arguments as in
8500 struct attribute_spec.handler. */
8503 handle_alloc_align_attribute (tree
*node
, tree
, tree args
, int,
8506 unsigned arg_count
= type_num_arguments (*node
);
8507 tree position
= TREE_VALUE (args
);
8508 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8509 && TREE_CODE (position
) != FUNCTION_DECL
)
8510 position
= default_conversion (position
);
8512 if (!tree_fits_uhwi_p (position
)
8514 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8516 warning (OPT_Wattributes
,
8517 "alloc_align parameter outside range");
8518 *no_add_attrs
= true;
8524 /* Handle a "assume_aligned" attribute; arguments as in
8525 struct attribute_spec.handler. */
8528 handle_assume_aligned_attribute (tree
*, tree
, tree args
, int,
8531 for (; args
; args
= TREE_CHAIN (args
))
8533 tree position
= TREE_VALUE (args
);
8534 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8535 && TREE_CODE (position
) != FUNCTION_DECL
)
8536 position
= default_conversion (position
);
8538 if (TREE_CODE (position
) != INTEGER_CST
)
8540 warning (OPT_Wattributes
,
8541 "assume_aligned parameter not integer constant");
8542 *no_add_attrs
= true;
8549 /* Handle a "fn spec" attribute; arguments as in
8550 struct attribute_spec.handler. */
8553 handle_fnspec_attribute (tree
*node ATTRIBUTE_UNUSED
, tree
ARG_UNUSED (name
),
8554 tree args
, int ARG_UNUSED (flags
),
8555 bool *no_add_attrs ATTRIBUTE_UNUSED
)
8558 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
8559 && !TREE_CHAIN (args
));
8563 /* Handle a "bnd_variable_size" attribute; arguments as in
8564 struct attribute_spec.handler. */
8567 handle_bnd_variable_size_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8568 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8570 if (TREE_CODE (*node
) != FIELD_DECL
)
8572 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8573 *no_add_attrs
= true;
8579 /* Handle a "bnd_legacy" attribute; arguments as in
8580 struct attribute_spec.handler. */
8583 handle_bnd_legacy (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8584 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8586 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8588 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8589 *no_add_attrs
= true;
8595 /* Handle a "bnd_instrument" attribute; arguments as in
8596 struct attribute_spec.handler. */
8599 handle_bnd_instrument (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8600 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8602 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8604 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8605 *no_add_attrs
= true;
8611 /* Handle a "warn_unused" attribute; arguments as in
8612 struct attribute_spec.handler. */
8615 handle_warn_unused_attribute (tree
*node
, tree name
,
8616 tree args ATTRIBUTE_UNUSED
,
8617 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
8620 /* Do nothing else, just set the attribute. We'll get at
8621 it later with lookup_attribute. */
8625 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8626 *no_add_attrs
= true;
8632 /* Handle an "omp declare simd" attribute; arguments as in
8633 struct attribute_spec.handler. */
8636 handle_omp_declare_simd_attribute (tree
*, tree
, tree
, int, bool *)
8641 /* Handle a "simd" attribute. */
8644 handle_simd_attribute (tree
*node
, tree name
, tree args
, int, bool *no_add_attrs
)
8646 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8648 if (lookup_attribute ("cilk simd function",
8649 DECL_ATTRIBUTES (*node
)) != NULL
)
8651 error_at (DECL_SOURCE_LOCATION (*node
),
8652 "%<__simd__%> attribute cannot be used in the same "
8653 "function marked as a Cilk Plus SIMD-enabled function");
8654 *no_add_attrs
= true;
8658 tree t
= get_identifier ("omp declare simd");
8659 tree attr
= NULL_TREE
;
8662 tree id
= TREE_VALUE (args
);
8664 if (TREE_CODE (id
) != STRING_CST
)
8666 error ("attribute %qE argument not a string", name
);
8667 *no_add_attrs
= true;
8671 if (strcmp (TREE_STRING_POINTER (id
), "notinbranch") == 0)
8672 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8673 OMP_CLAUSE_NOTINBRANCH
);
8675 if (strcmp (TREE_STRING_POINTER (id
), "inbranch") == 0)
8676 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8677 OMP_CLAUSE_INBRANCH
);
8680 error ("only %<inbranch%> and %<notinbranch%> flags are "
8681 "allowed for %<__simd__%> attribute");
8682 *no_add_attrs
= true;
8687 DECL_ATTRIBUTES (*node
) = tree_cons (t
,
8688 build_tree_list (NULL_TREE
,
8690 DECL_ATTRIBUTES (*node
));
8695 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8696 *no_add_attrs
= true;
8702 /* Handle an "omp declare target" attribute; arguments as in
8703 struct attribute_spec.handler. */
8706 handle_omp_declare_target_attribute (tree
*, tree
, tree
, int, bool *)
8711 /* Handle a "returns_twice" attribute; arguments as in
8712 struct attribute_spec.handler. */
8715 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8716 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8718 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8719 DECL_IS_RETURNS_TWICE (*node
) = 1;
8722 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8723 *no_add_attrs
= true;
8729 /* Handle a "no_limit_stack" attribute; arguments as in
8730 struct attribute_spec.handler. */
8733 handle_no_limit_stack_attribute (tree
*node
, tree name
,
8734 tree
ARG_UNUSED (args
),
8735 int ARG_UNUSED (flags
),
8740 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8742 error_at (DECL_SOURCE_LOCATION (decl
),
8743 "%qE attribute applies only to functions", name
);
8744 *no_add_attrs
= true;
8746 else if (DECL_INITIAL (decl
))
8748 error_at (DECL_SOURCE_LOCATION (decl
),
8749 "can%'t set %qE attribute after definition", name
);
8750 *no_add_attrs
= true;
8753 DECL_NO_LIMIT_STACK (decl
) = 1;
8758 /* Handle a "pure" attribute; arguments as in
8759 struct attribute_spec.handler. */
8762 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8763 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8765 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8766 DECL_PURE_P (*node
) = 1;
8767 /* ??? TODO: Support types. */
8770 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8771 *no_add_attrs
= true;
8777 /* Digest an attribute list destined for a transactional memory statement.
8778 ALLOWED is the set of attributes that are allowed for this statement;
8779 return the attribute we parsed. Multiple attributes are never allowed. */
8782 parse_tm_stmt_attr (tree attrs
, int allowed
)
8787 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
8789 tree a
= TREE_PURPOSE (attrs
);
8792 if (is_attribute_p ("outer", a
))
8793 m
= TM_STMT_ATTR_OUTER
;
8795 if ((m
& allowed
) == 0)
8797 warning (OPT_Wattributes
, "%qE attribute directive ignored", a
);
8806 else if (m_seen
== m
)
8807 warning (OPT_Wattributes
, "%qE attribute duplicated", a
);
8809 warning (OPT_Wattributes
, "%qE attribute follows %qE", a
, a_seen
);
8815 /* Transform a TM attribute name into a maskable integer and back.
8816 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8817 to how the lack of an attribute is treated. */
8820 tm_attr_to_mask (tree attr
)
8824 if (is_attribute_p ("transaction_safe", attr
))
8825 return TM_ATTR_SAFE
;
8826 if (is_attribute_p ("transaction_callable", attr
))
8827 return TM_ATTR_CALLABLE
;
8828 if (is_attribute_p ("transaction_pure", attr
))
8829 return TM_ATTR_PURE
;
8830 if (is_attribute_p ("transaction_unsafe", attr
))
8831 return TM_ATTR_IRREVOCABLE
;
8832 if (is_attribute_p ("transaction_may_cancel_outer", attr
))
8833 return TM_ATTR_MAY_CANCEL_OUTER
;
8838 tm_mask_to_attr (int mask
)
8844 str
= "transaction_safe";
8846 case TM_ATTR_CALLABLE
:
8847 str
= "transaction_callable";
8850 str
= "transaction_pure";
8852 case TM_ATTR_IRREVOCABLE
:
8853 str
= "transaction_unsafe";
8855 case TM_ATTR_MAY_CANCEL_OUTER
:
8856 str
= "transaction_may_cancel_outer";
8861 return get_identifier (str
);
8864 /* Return the first TM attribute seen in LIST. */
8867 find_tm_attribute (tree list
)
8869 for (; list
; list
= TREE_CHAIN (list
))
8871 tree name
= TREE_PURPOSE (list
);
8872 if (tm_attr_to_mask (name
) != 0)
8878 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8879 Here we accept only function types, and verify that none of the other
8880 function TM attributes are also applied. */
8881 /* ??? We need to accept class types for C++, but not C. This greatly
8882 complicates this function, since we can no longer rely on the extra
8883 processing given by function_type_required. */
8886 handle_tm_attribute (tree
*node
, tree name
, tree args
,
8887 int flags
, bool *no_add_attrs
)
8889 /* Only one path adds the attribute; others don't. */
8890 *no_add_attrs
= true;
8892 switch (TREE_CODE (*node
))
8896 /* Only tm_callable and tm_safe apply to classes. */
8897 if (tm_attr_to_mask (name
) & ~(TM_ATTR_SAFE
| TM_ATTR_CALLABLE
))
8904 tree old_name
= find_tm_attribute (TYPE_ATTRIBUTES (*node
));
8905 if (old_name
== name
)
8907 else if (old_name
!= NULL_TREE
)
8908 error ("type was previously declared %qE", old_name
);
8910 *no_add_attrs
= false;
8916 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8917 want to set transaction_safe on the type. */
8918 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name
));
8919 if (!TYPE_P (DECL_CONTEXT (*node
)))
8920 error_at (DECL_SOURCE_LOCATION (*node
),
8921 "%<transaction_safe_dynamic%> may only be specified for "
8922 "a virtual function");
8923 *no_add_attrs
= false;
8924 decl_attributes (&TREE_TYPE (*node
),
8925 build_tree_list (get_identifier ("transaction_safe"),
8933 enum tree_code subcode
= TREE_CODE (TREE_TYPE (*node
));
8934 if (subcode
== FUNCTION_TYPE
|| subcode
== METHOD_TYPE
)
8936 tree fn_tmp
= TREE_TYPE (*node
);
8937 decl_attributes (&fn_tmp
, tree_cons (name
, args
, NULL
), 0);
8938 *node
= build_pointer_type (fn_tmp
);
8945 /* If a function is next, pass it on to be tried next. */
8946 if (flags
& (int) ATTR_FLAG_FUNCTION_NEXT
)
8947 return tree_cons (name
, args
, NULL
);
8950 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8957 /* Handle the TM_WRAP attribute; arguments as in
8958 struct attribute_spec.handler. */
8961 handle_tm_wrap_attribute (tree
*node
, tree name
, tree args
,
8962 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8966 /* We don't need the attribute even on success, since we
8967 record the entry in an external table. */
8968 *no_add_attrs
= true;
8970 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8971 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8974 tree wrap_decl
= TREE_VALUE (args
);
8975 if (error_operand_p (wrap_decl
))
8977 else if (TREE_CODE (wrap_decl
) != IDENTIFIER_NODE
8978 && !VAR_OR_FUNCTION_DECL_P (wrap_decl
))
8979 error ("%qE argument not an identifier", name
);
8982 if (TREE_CODE (wrap_decl
) == IDENTIFIER_NODE
)
8983 wrap_decl
= lookup_name (wrap_decl
);
8984 if (wrap_decl
&& TREE_CODE (wrap_decl
) == FUNCTION_DECL
)
8986 if (lang_hooks
.types_compatible_p (TREE_TYPE (decl
),
8987 TREE_TYPE (wrap_decl
)))
8988 record_tm_replacement (wrap_decl
, decl
);
8990 error ("%qD is not compatible with %qD", wrap_decl
, decl
);
8993 error ("%qE argument is not a function", name
);
9000 /* Ignore the given attribute. Used when this attribute may be usefully
9001 overridden by the target, but is not used generically. */
9004 ignore_attribute (tree
* ARG_UNUSED (node
), tree
ARG_UNUSED (name
),
9005 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9008 *no_add_attrs
= true;
9012 /* Handle a "no vops" attribute; arguments as in
9013 struct attribute_spec.handler. */
9016 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9017 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9018 bool *ARG_UNUSED (no_add_attrs
))
9020 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
9021 DECL_IS_NOVOPS (*node
) = 1;
9025 /* Handle a "deprecated" attribute; arguments as in
9026 struct attribute_spec.handler. */
9029 handle_deprecated_attribute (tree
*node
, tree name
,
9030 tree args
, int flags
,
9033 tree type
= NULL_TREE
;
9035 tree what
= NULL_TREE
;
9038 *no_add_attrs
= true;
9039 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
9041 error ("deprecated message is not a string");
9042 *no_add_attrs
= true;
9048 type
= TREE_TYPE (decl
);
9050 if (TREE_CODE (decl
) == TYPE_DECL
9051 || TREE_CODE (decl
) == PARM_DECL
9052 || VAR_OR_FUNCTION_DECL_P (decl
)
9053 || TREE_CODE (decl
) == FIELD_DECL
9054 || TREE_CODE (decl
) == CONST_DECL
9055 || objc_method_decl (TREE_CODE (decl
)))
9056 TREE_DEPRECATED (decl
) = 1;
9060 else if (TYPE_P (*node
))
9062 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
9063 *node
= build_variant_type_copy (*node
);
9064 TREE_DEPRECATED (*node
) = 1;
9072 *no_add_attrs
= true;
9073 if (type
&& TYPE_NAME (type
))
9075 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
9076 what
= TYPE_NAME (*node
);
9077 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
9078 && DECL_NAME (TYPE_NAME (type
)))
9079 what
= DECL_NAME (TYPE_NAME (type
));
9082 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
9084 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9090 /* Handle a "vector_size" attribute; arguments as in
9091 struct attribute_spec.handler. */
9094 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
9095 int ARG_UNUSED (flags
),
9098 unsigned HOST_WIDE_INT vecsize
, nunits
;
9099 machine_mode orig_mode
;
9100 tree type
= *node
, new_type
, size
;
9102 *no_add_attrs
= true;
9104 size
= TREE_VALUE (args
);
9105 if (size
&& TREE_CODE (size
) != IDENTIFIER_NODE
9106 && TREE_CODE (size
) != FUNCTION_DECL
)
9107 size
= default_conversion (size
);
9109 if (!tree_fits_uhwi_p (size
))
9111 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9115 /* Get the vector size (in bytes). */
9116 vecsize
= tree_to_uhwi (size
);
9118 /* We need to provide for vector pointers, vector arrays, and
9119 functions returning vectors. For example:
9121 __attribute__((vector_size(16))) short *foo;
9123 In this case, the mode is SI, but the type being modified is
9124 HI, so we need to look further. */
9126 while (POINTER_TYPE_P (type
)
9127 || TREE_CODE (type
) == FUNCTION_TYPE
9128 || TREE_CODE (type
) == METHOD_TYPE
9129 || TREE_CODE (type
) == ARRAY_TYPE
9130 || TREE_CODE (type
) == OFFSET_TYPE
)
9131 type
= TREE_TYPE (type
);
9133 /* Get the mode of the type being modified. */
9134 orig_mode
= TYPE_MODE (type
);
9136 if ((!INTEGRAL_TYPE_P (type
)
9137 && !SCALAR_FLOAT_TYPE_P (type
)
9138 && !FIXED_POINT_TYPE_P (type
))
9139 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
9140 && GET_MODE_CLASS (orig_mode
) != MODE_INT
9141 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
9142 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
))
9143 || TREE_CODE (type
) == BOOLEAN_TYPE
)
9145 error ("invalid vector type for attribute %qE", name
);
9149 if (vecsize
% tree_to_uhwi (TYPE_SIZE_UNIT (type
)))
9151 error ("vector size not an integral multiple of component size");
9157 error ("zero vector size");
9161 /* Calculate how many units fit in the vector. */
9162 nunits
= vecsize
/ tree_to_uhwi (TYPE_SIZE_UNIT (type
));
9163 if (nunits
& (nunits
- 1))
9165 error ("number of components of the vector not a power of two");
9169 new_type
= build_vector_type (type
, nunits
);
9171 /* Build back pointers if needed. */
9172 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
9177 /* Handle the "nonnull" attribute. */
9179 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9180 tree args
, int ARG_UNUSED (flags
),
9184 unsigned HOST_WIDE_INT attr_arg_num
;
9186 /* If no arguments are specified, all pointer arguments should be
9187 non-null. Verify a full prototype is given so that the arguments
9188 will have the correct types when we actually check them later.
9189 Avoid diagnosing type-generic built-ins since those have no
9193 if (!prototype_p (type
)
9194 && (!TYPE_ATTRIBUTES (type
)
9195 || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type
))))
9197 error ("nonnull attribute without arguments on a non-prototype");
9198 *no_add_attrs
= true;
9203 /* Argument list specified. Verify that each argument number references
9204 a pointer argument. */
9205 for (attr_arg_num
= 1; args
; attr_arg_num
++, args
= TREE_CHAIN (args
))
9207 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
9209 tree arg
= TREE_VALUE (args
);
9210 if (arg
&& TREE_CODE (arg
) != IDENTIFIER_NODE
9211 && TREE_CODE (arg
) != FUNCTION_DECL
)
9212 arg
= default_conversion (arg
);
9214 if (!get_nonnull_operand (arg
, &arg_num
))
9216 error ("nonnull argument has invalid operand number (argument %lu)",
9217 (unsigned long) attr_arg_num
);
9218 *no_add_attrs
= true;
9222 if (prototype_p (type
))
9224 function_args_iterator iter
;
9227 function_args_iter_init (&iter
, type
);
9228 for (ck_num
= 1; ; ck_num
++, function_args_iter_next (&iter
))
9230 argument
= function_args_iter_cond (&iter
);
9231 if (argument
== NULL_TREE
|| ck_num
== arg_num
)
9236 || TREE_CODE (argument
) == VOID_TYPE
)
9238 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
9239 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9240 *no_add_attrs
= true;
9244 if (TREE_CODE (argument
) != POINTER_TYPE
)
9246 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
9247 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9248 *no_add_attrs
= true;
9257 /* Check the argument list of a function call for null in argument slots
9258 that are marked as requiring a non-null pointer argument. The NARGS
9259 arguments are passed in the array ARGARRAY. */
9262 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
9267 attrs
= lookup_attribute ("nonnull", attrs
);
9268 if (attrs
== NULL_TREE
)
9272 /* See if any of the nonnull attributes has no arguments. If so,
9273 then every pointer argument is checked (in which case the check
9274 for pointer type is done in check_nonnull_arg). */
9275 if (TREE_VALUE (a
) != NULL_TREE
)
9277 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
9278 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
9281 for (i
= 0; i
< nargs
; i
++)
9282 check_function_arguments_recurse (check_nonnull_arg
, &loc
, argarray
[i
],
9286 /* Walk the argument list. If we encounter an argument number we
9287 should check for non-null, do it. */
9288 for (i
= 0; i
< nargs
; i
++)
9290 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
9292 a
= lookup_attribute ("nonnull", a
);
9293 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
9298 check_function_arguments_recurse (check_nonnull_arg
, &loc
,
9299 argarray
[i
], i
+ 1);
9304 /* Check that the Nth argument of a function call (counting backwards
9305 from the end) is a (pointer)0. The NARGS arguments are passed in the
9309 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
9311 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
9318 function_args_iterator iter
;
9321 /* Skip over the named arguments. */
9322 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
9329 if (TREE_VALUE (attr
))
9331 tree p
= TREE_VALUE (TREE_VALUE (attr
));
9332 pos
= TREE_INT_CST_LOW (p
);
9335 /* The sentinel must be one of the varargs, i.e.
9336 in position >= the number of fixed arguments. */
9337 if ((nargs
- 1 - pos
) < len
)
9339 warning (OPT_Wformat_
,
9340 "not enough variable arguments to fit a sentinel");
9344 /* Validate the sentinel. */
9345 sentinel
= argarray
[nargs
- 1 - pos
];
9346 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
9347 || !integer_zerop (sentinel
))
9348 /* Although __null (in C++) is only an integer we allow it
9349 nevertheless, as we are guaranteed that it's exactly
9350 as wide as a pointer, and we don't want to force
9351 users to cast the NULL they have written there.
9352 We warn with -Wstrict-null-sentinel, though. */
9353 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
9354 warning (OPT_Wformat_
, "missing sentinel in function call");
9358 /* Helper for check_function_nonnull; given a list of operands which
9359 must be non-null in ARGS, determine if operand PARAM_NUM should be
9363 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
9365 unsigned HOST_WIDE_INT arg_num
= 0;
9367 for (; args
; args
= TREE_CHAIN (args
))
9369 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
9373 if (arg_num
== param_num
)
9379 /* Check that the function argument PARAM (which is operand number
9380 PARAM_NUM) is non-null. This is called by check_function_nonnull
9381 via check_function_arguments_recurse. */
9384 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
9386 location_t
*ploc
= (location_t
*) ctx
;
9388 /* Just skip checking the argument if it's not a pointer. This can
9389 happen if the "nonnull" attribute was given without an operand
9390 list (which means to check every pointer argument). */
9392 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
9395 if (integer_zerop (param
))
9396 warning_at (*ploc
, OPT_Wnonnull
, "null argument where non-null required "
9397 "(argument %lu)", (unsigned long) param_num
);
9400 /* Helper for nonnull attribute handling; fetch the operand number
9401 from the attribute argument list. */
9404 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
9406 /* Verify the arg number is a small constant. */
9407 if (tree_fits_uhwi_p (arg_num_expr
))
9409 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
9416 /* Handle a "nothrow" attribute; arguments as in
9417 struct attribute_spec.handler. */
9420 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9421 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9423 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9424 TREE_NOTHROW (*node
) = 1;
9425 /* ??? TODO: Support types. */
9428 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9429 *no_add_attrs
= true;
9435 /* Handle a "cleanup" attribute; arguments as in
9436 struct attribute_spec.handler. */
9439 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
9440 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9443 tree cleanup_id
, cleanup_decl
;
9445 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9446 for global destructors in C++. This requires infrastructure that
9447 we don't have generically at the moment. It's also not a feature
9448 we'd be missing too much, since we do have attribute constructor. */
9449 if (!VAR_P (decl
) || TREE_STATIC (decl
))
9451 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9452 *no_add_attrs
= true;
9456 /* Verify that the argument is a function in scope. */
9457 /* ??? We could support pointers to functions here as well, if
9458 that was considered desirable. */
9459 cleanup_id
= TREE_VALUE (args
);
9460 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
9462 error ("cleanup argument not an identifier");
9463 *no_add_attrs
= true;
9466 cleanup_decl
= lookup_name (cleanup_id
);
9467 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
9469 error ("cleanup argument not a function");
9470 *no_add_attrs
= true;
9474 /* That the function has proper type is checked with the
9475 eventual call to build_function_call. */
9480 /* Handle a "warn_unused_result" attribute. No special handling. */
9483 handle_warn_unused_result_attribute (tree
*node
, tree name
,
9484 tree
ARG_UNUSED (args
),
9485 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9487 /* Ignore the attribute for functions not returning any value. */
9488 if (VOID_TYPE_P (TREE_TYPE (*node
)))
9490 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9491 *no_add_attrs
= true;
9497 /* Handle a "sentinel" attribute. */
9500 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
9501 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9503 if (!prototype_p (*node
))
9505 warning (OPT_Wattributes
,
9506 "%qE attribute requires prototypes with named arguments", name
);
9507 *no_add_attrs
= true;
9511 if (!stdarg_p (*node
))
9513 warning (OPT_Wattributes
,
9514 "%qE attribute only applies to variadic functions", name
);
9515 *no_add_attrs
= true;
9521 tree position
= TREE_VALUE (args
);
9522 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
9523 && TREE_CODE (position
) != FUNCTION_DECL
)
9524 position
= default_conversion (position
);
9526 if (TREE_CODE (position
) != INTEGER_CST
9527 || !INTEGRAL_TYPE_P (TREE_TYPE (position
)))
9529 warning (OPT_Wattributes
,
9530 "requested position is not an integer constant");
9531 *no_add_attrs
= true;
9535 if (tree_int_cst_lt (position
, integer_zero_node
))
9537 warning (OPT_Wattributes
,
9538 "requested position is less than zero");
9539 *no_add_attrs
= true;
9547 /* Handle a "type_generic" attribute. */
9550 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9551 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9552 bool * ARG_UNUSED (no_add_attrs
))
9554 /* Ensure we have a function type. */
9555 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
9557 /* Ensure we have a variadic function. */
9558 gcc_assert (!prototype_p (*node
) || stdarg_p (*node
));
9563 /* Handle a "target" attribute. */
9566 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
9569 /* Ensure we have a function type. */
9570 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9572 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9573 *no_add_attrs
= true;
9575 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
9577 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9578 "with %qs attribute", name
, "target_clones");
9579 *no_add_attrs
= true;
9581 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
9583 *no_add_attrs
= true;
9588 /* Handle a "target_clones" attribute. */
9591 handle_target_clones_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9592 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9594 /* Ensure we have a function type. */
9595 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9597 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
9599 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9600 "with %qs attribute", name
, "always_inline");
9601 *no_add_attrs
= true;
9603 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node
)))
9605 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9606 "with %qs attribute", name
, "target");
9607 *no_add_attrs
= true;
9610 /* Do not inline functions with multiple clone targets. */
9611 DECL_UNINLINABLE (*node
) = 1;
9615 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9616 *no_add_attrs
= true;
9621 /* Arguments being collected for optimization. */
9622 typedef const char *const_char_p
; /* For DEF_VEC_P. */
9623 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
9626 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9627 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9628 false for #pragma GCC optimize. */
9631 parse_optimize_options (tree args
, bool attr_p
)
9636 const char **opt_argv
;
9637 struct cl_decoded_option
*decoded_options
;
9638 unsigned int decoded_options_count
;
9641 /* Build up argv vector. Just in case the string is stored away, use garbage
9642 collected strings. */
9643 vec_safe_truncate (optimize_args
, 0);
9644 vec_safe_push (optimize_args
, (const char *) NULL
);
9646 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
9648 tree value
= TREE_VALUE (ap
);
9650 if (TREE_CODE (value
) == INTEGER_CST
)
9653 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
9654 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
9657 else if (TREE_CODE (value
) == STRING_CST
)
9659 /* Split string into multiple substrings. */
9660 size_t len
= TREE_STRING_LENGTH (value
);
9661 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
9662 char *end
= p
+ len
;
9666 while (next_p
!= NULL
)
9672 comma
= strchr (p
, ',');
9685 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
9687 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9689 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
9693 warning (OPT_Wattributes
,
9694 "bad option %qs to attribute %<optimize%>", p
);
9696 warning (OPT_Wpragmas
,
9697 "bad option %qs to pragma %<optimize%>", p
);
9705 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9706 itself is -Os, and any other switch begins with a -f. */
9707 if ((*p
>= '0' && *p
<= '9')
9708 || (p
[0] == 's' && p
[1] == '\0'))
9714 memcpy (r
, p
, len2
);
9716 vec_safe_push (optimize_args
, (const char *) q
);
9722 opt_argc
= optimize_args
->length ();
9723 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
9725 for (i
= 1; i
< opt_argc
; i
++)
9726 opt_argv
[i
] = (*optimize_args
)[i
];
9728 /* Now parse the options. */
9729 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
9731 &decoded_options_count
);
9732 /* Drop non-Optimization options. */
9734 for (i
= 1; i
< decoded_options_count
; ++i
)
9736 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
9740 warning (OPT_Wattributes
,
9741 "bad option %qs to attribute %<optimize%>",
9742 decoded_options
[i
].orig_option_with_args_text
);
9744 warning (OPT_Wpragmas
,
9745 "bad option %qs to pragma %<optimize%>",
9746 decoded_options
[i
].orig_option_with_args_text
);
9750 decoded_options
[j
] = decoded_options
[i
];
9753 decoded_options_count
= j
;
9754 /* And apply them. */
9755 decode_options (&global_options
, &global_options_set
,
9756 decoded_options
, decoded_options_count
,
9757 input_location
, global_dc
);
9759 targetm
.override_options_after_change();
9761 optimize_args
->truncate (0);
9765 /* For handling "optimize" attribute. arguments as in
9766 struct attribute_spec.handler. */
9769 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
9770 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9772 /* Ensure we have a function type. */
9773 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9775 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9776 *no_add_attrs
= true;
9780 struct cl_optimization cur_opts
;
9781 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
9783 /* Save current options. */
9784 cl_optimization_save (&cur_opts
, &global_options
);
9786 /* If we previously had some optimization options, use them as the
9789 cl_optimization_restore (&global_options
,
9790 TREE_OPTIMIZATION (old_opts
));
9792 /* Parse options, and update the vector. */
9793 parse_optimize_options (args
, true);
9794 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
9795 = build_optimization_node (&global_options
);
9797 /* Restore current options. */
9798 cl_optimization_restore (&global_options
, &cur_opts
);
9804 /* Handle a "no_split_stack" attribute. */
9807 handle_no_split_stack_attribute (tree
*node
, tree name
,
9808 tree
ARG_UNUSED (args
),
9809 int ARG_UNUSED (flags
),
9814 if (TREE_CODE (decl
) != FUNCTION_DECL
)
9816 error_at (DECL_SOURCE_LOCATION (decl
),
9817 "%qE attribute applies only to functions", name
);
9818 *no_add_attrs
= true;
9820 else if (DECL_INITIAL (decl
))
9822 error_at (DECL_SOURCE_LOCATION (decl
),
9823 "can%'t set %qE attribute after definition", name
);
9824 *no_add_attrs
= true;
9830 /* Handle a "returns_nonnull" attribute; arguments as in
9831 struct attribute_spec.handler. */
9834 handle_returns_nonnull_attribute (tree
*node
, tree
, tree
, int,
9837 // Even without a prototype we still have a return type we can check.
9838 if (TREE_CODE (TREE_TYPE (*node
)) != POINTER_TYPE
)
9840 error ("returns_nonnull attribute on a function not returning a pointer");
9841 *no_add_attrs
= true;
9846 /* Handle a "designated_init" attribute; arguments as in
9847 struct attribute_spec.handler. */
9850 handle_designated_init_attribute (tree
*node
, tree name
, tree
, int,
9853 if (TREE_CODE (*node
) != RECORD_TYPE
)
9855 error ("%qE attribute is only valid on %<struct%> type", name
);
9856 *no_add_attrs
= true;
9862 /* Handle a "fallthrough" attribute; arguments as in struct
9863 attribute_spec.handler. */
9866 handle_fallthrough_attribute (tree
*, tree name
, tree
, int,
9869 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9870 *no_add_attrs
= true;
9874 /* Check whether ATTR is a valid attribute fallthrough. */
9877 attribute_fallthrough_p (tree attr
)
9879 tree t
= lookup_attribute ("fallthrough", attr
);
9882 /* This attribute shall appear at most once in each attribute-list. */
9883 if (lookup_attribute ("fallthrough", TREE_CHAIN (t
)))
9884 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified multiple "
9886 /* No attribute-argument-clause shall be present. */
9887 else if (TREE_VALUE (t
) != NULL_TREE
)
9888 warning (OPT_Wattributes
, "%<fallthrough%> attribute specified with "
9890 /* Warn if other attributes are found. */
9891 for (t
= attr
; t
!= NULL_TREE
; t
= TREE_CHAIN (t
))
9893 tree name
= get_attribute_name (t
);
9894 if (!is_attribute_p ("fallthrough", name
))
9895 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9901 /* Check for valid arguments being passed to a function with FNTYPE.
9902 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9905 check_function_arguments (location_t loc
, const_tree fntype
, int nargs
,
9908 /* Check for null being passed in a pointer argument that must be
9909 non-null. We also need to do this if format checking is enabled. */
9912 check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9914 /* Check for errors in format strings. */
9916 if (warn_format
|| warn_suggest_attribute_format
)
9917 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9920 check_function_sentinel (fntype
, nargs
, argarray
);
9923 /* Generic argument checking recursion routine. PARAM is the argument to
9924 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9925 once the argument is resolved. CTX is context for the callback. */
9927 check_function_arguments_recurse (void (*callback
)
9928 (void *, tree
, unsigned HOST_WIDE_INT
),
9929 void *ctx
, tree param
,
9930 unsigned HOST_WIDE_INT param_num
)
9932 if (CONVERT_EXPR_P (param
)
9933 && (TYPE_PRECISION (TREE_TYPE (param
))
9934 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
9936 /* Strip coercion. */
9937 check_function_arguments_recurse (callback
, ctx
,
9938 TREE_OPERAND (param
, 0), param_num
);
9942 if (TREE_CODE (param
) == CALL_EXPR
)
9944 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
9946 bool found_format_arg
= false;
9948 /* See if this is a call to a known internationalization function
9949 that modifies a format arg. Such a function may have multiple
9950 format_arg attributes (for example, ngettext). */
9952 for (attrs
= TYPE_ATTRIBUTES (type
);
9954 attrs
= TREE_CHAIN (attrs
))
9955 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
9958 tree format_num_expr
;
9961 call_expr_arg_iterator iter
;
9963 /* Extract the argument number, which was previously checked
9965 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
9967 format_num
= tree_to_uhwi (format_num_expr
);
9969 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
9971 inner_arg
= next_call_expr_arg (&iter
), i
++)
9972 if (i
== format_num
)
9974 check_function_arguments_recurse (callback
, ctx
,
9975 inner_arg
, param_num
);
9976 found_format_arg
= true;
9981 /* If we found a format_arg attribute and did a recursive check,
9982 we are done with checking this argument. Otherwise, we continue
9983 and this will be considered a non-literal. */
9984 if (found_format_arg
)
9988 if (TREE_CODE (param
) == COND_EXPR
)
9990 /* Simplify to avoid warning for an impossible case. */
9991 param
= fold_for_warn (param
);
9992 if (TREE_CODE (param
) == COND_EXPR
)
9994 /* Check both halves of the conditional expression. */
9995 check_function_arguments_recurse (callback
, ctx
,
9996 TREE_OPERAND (param
, 1),
9998 check_function_arguments_recurse (callback
, ctx
,
9999 TREE_OPERAND (param
, 2),
10005 (*callback
) (ctx
, param
, param_num
);
10008 /* Checks for a builtin function FNDECL that the number of arguments
10009 NARGS against the required number REQUIRED and issues an error if
10010 there is a mismatch. Returns true if the number of arguments is
10011 correct, otherwise false. LOC is the location of FNDECL. */
10014 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
10017 if (nargs
< required
)
10019 error_at (loc
, "too few arguments to function %qE", fndecl
);
10022 else if (nargs
> required
)
10024 error_at (loc
, "too many arguments to function %qE", fndecl
);
10030 /* Helper macro for check_builtin_function_arguments. */
10031 #define ARG_LOCATION(N) \
10032 (arg_loc.is_empty () \
10033 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
10034 : expansion_point_location (arg_loc[(N)]))
10036 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
10037 Returns false if there was an error, otherwise true. LOC is the
10038 location of the function; ARG_LOC is a vector of locations of the
10042 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
10043 tree fndecl
, int nargs
, tree
*args
)
10045 if (!DECL_BUILT_IN (fndecl
)
10046 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
10049 switch (DECL_FUNCTION_CODE (fndecl
))
10051 case BUILT_IN_ALLOCA_WITH_ALIGN
:
10053 /* Get the requested alignment (in bits) if it's a constant
10054 integer expression. */
10055 unsigned HOST_WIDE_INT align
10056 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
10058 /* Determine if the requested alignment is a power of 2. */
10059 if ((align
& (align
- 1)))
10062 /* The maximum alignment in bits corresponding to the same
10063 maximum in bytes enforced in check_user_alignment(). */
10064 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
10066 /* Reject invalid alignments. */
10067 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
10069 error_at (ARG_LOCATION (1),
10070 "second argument to function %qE must be a constant "
10071 "integer power of 2 between %qi and %qu bits",
10072 fndecl
, BITS_PER_UNIT
, maxalign
);
10078 case BUILT_IN_CONSTANT_P
:
10079 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
10081 case BUILT_IN_ISFINITE
:
10082 case BUILT_IN_ISINF
:
10083 case BUILT_IN_ISINF_SIGN
:
10084 case BUILT_IN_ISNAN
:
10085 case BUILT_IN_ISNORMAL
:
10086 case BUILT_IN_SIGNBIT
:
10087 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
10089 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
10091 error_at (ARG_LOCATION (0), "non-floating-point argument in "
10092 "call to function %qE", fndecl
);
10099 case BUILT_IN_ISGREATER
:
10100 case BUILT_IN_ISGREATEREQUAL
:
10101 case BUILT_IN_ISLESS
:
10102 case BUILT_IN_ISLESSEQUAL
:
10103 case BUILT_IN_ISLESSGREATER
:
10104 case BUILT_IN_ISUNORDERED
:
10105 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
10107 enum tree_code code0
, code1
;
10108 code0
= TREE_CODE (TREE_TYPE (args
[0]));
10109 code1
= TREE_CODE (TREE_TYPE (args
[1]));
10110 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
10111 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
10112 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
10114 error_at (loc
, "non-floating-point arguments in call to "
10115 "function %qE", fndecl
);
10122 case BUILT_IN_FPCLASSIFY
:
10123 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
10125 for (unsigned int i
= 0; i
< 5; i
++)
10126 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
10128 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
10129 "call to function %qE", i
+ 1, fndecl
);
10133 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
10135 error_at (ARG_LOCATION (5), "non-floating-point argument in "
10136 "call to function %qE", fndecl
);
10143 case BUILT_IN_ASSUME_ALIGNED
:
10144 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
10146 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
10148 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
10149 "function %qE", fndecl
);
10156 case BUILT_IN_ADD_OVERFLOW
:
10157 case BUILT_IN_SUB_OVERFLOW
:
10158 case BUILT_IN_MUL_OVERFLOW
:
10159 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10162 for (i
= 0; i
< 2; i
++)
10163 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10165 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10166 "%qE does not have integral type", i
+ 1, fndecl
);
10169 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
10170 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
10172 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10173 "does not have pointer to integral type", fndecl
);
10176 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
10178 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10179 "has pointer to enumerated type", fndecl
);
10182 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
10184 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10185 "has pointer to boolean type", fndecl
);
10192 case BUILT_IN_ADD_OVERFLOW_P
:
10193 case BUILT_IN_SUB_OVERFLOW_P
:
10194 case BUILT_IN_MUL_OVERFLOW_P
:
10195 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10198 for (i
= 0; i
< 3; i
++)
10199 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10201 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10202 "%qE does not have integral type", i
+ 1, fndecl
);
10205 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
10207 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10208 "%qE has enumerated type", fndecl
);
10211 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
10213 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10214 "%qE has boolean type", fndecl
);
10226 /* Function to help qsort sort FIELD_DECLs by name order. */
10229 field_decl_cmp (const void *x_p
, const void *y_p
)
10231 const tree
*const x
= (const tree
*const) x_p
;
10232 const tree
*const y
= (const tree
*const) y_p
;
10234 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10235 /* A nontype is "greater" than a type. */
10236 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10237 if (DECL_NAME (*x
) == NULL_TREE
)
10239 if (DECL_NAME (*y
) == NULL_TREE
)
10241 if (DECL_NAME (*x
) < DECL_NAME (*y
))
10247 gt_pointer_operator new_value
;
10251 /* This routine compares two fields like field_decl_cmp but using the
10252 pointer operator in resort_data. */
10255 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
10257 const tree
*const x
= (const tree
*const) x_p
;
10258 const tree
*const y
= (const tree
*const) y_p
;
10260 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10261 /* A nontype is "greater" than a type. */
10262 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10263 if (DECL_NAME (*x
) == NULL_TREE
)
10265 if (DECL_NAME (*y
) == NULL_TREE
)
10268 tree d1
= DECL_NAME (*x
);
10269 tree d2
= DECL_NAME (*y
);
10270 resort_data
.new_value (&d1
, resort_data
.cookie
);
10271 resort_data
.new_value (&d2
, resort_data
.cookie
);
10278 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10281 resort_sorted_fields (void *obj
,
10282 void * ARG_UNUSED (orig_obj
),
10283 gt_pointer_operator new_value
,
10286 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
10287 resort_data
.new_value
= new_value
;
10288 resort_data
.cookie
= cookie
;
10289 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
10290 resort_field_decl_cmp
);
10293 /* Subroutine of c_parse_error.
10294 Return the result of concatenating LHS and RHS. RHS is really
10295 a string literal, its first character is indicated by RHS_START and
10296 RHS_SIZE is its length (including the terminating NUL character).
10298 The caller is responsible for deleting the returned pointer. */
10301 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
10303 const int lhs_size
= strlen (lhs
);
10304 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
10305 strncpy (result
, lhs
, lhs_size
);
10306 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
10310 /* Issue the error given by GMSGID, indicating that it occurred before
10311 TOKEN, which had the associated VALUE. */
10314 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
10315 tree value
, unsigned char token_flags
)
10317 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10319 char *message
= NULL
;
10321 if (token_type
== CPP_EOF
)
10322 message
= catenate_messages (gmsgid
, " at end of input");
10323 else if (token_type
== CPP_CHAR
10324 || token_type
== CPP_WCHAR
10325 || token_type
== CPP_CHAR16
10326 || token_type
== CPP_CHAR32
10327 || token_type
== CPP_UTF8CHAR
)
10329 unsigned int val
= TREE_INT_CST_LOW (value
);
10330 const char *prefix
;
10332 switch (token_type
)
10351 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
10352 message
= catenate_messages (gmsgid
, " before %s'%c'");
10354 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
10356 error (message
, prefix
, val
);
10360 else if (token_type
== CPP_CHAR_USERDEF
10361 || token_type
== CPP_WCHAR_USERDEF
10362 || token_type
== CPP_CHAR16_USERDEF
10363 || token_type
== CPP_CHAR32_USERDEF
10364 || token_type
== CPP_UTF8CHAR_USERDEF
)
10365 message
= catenate_messages (gmsgid
,
10366 " before user-defined character literal");
10367 else if (token_type
== CPP_STRING_USERDEF
10368 || token_type
== CPP_WSTRING_USERDEF
10369 || token_type
== CPP_STRING16_USERDEF
10370 || token_type
== CPP_STRING32_USERDEF
10371 || token_type
== CPP_UTF8STRING_USERDEF
)
10372 message
= catenate_messages (gmsgid
, " before user-defined string literal");
10373 else if (token_type
== CPP_STRING
10374 || token_type
== CPP_WSTRING
10375 || token_type
== CPP_STRING16
10376 || token_type
== CPP_STRING32
10377 || token_type
== CPP_UTF8STRING
)
10378 message
= catenate_messages (gmsgid
, " before string constant");
10379 else if (token_type
== CPP_NUMBER
)
10380 message
= catenate_messages (gmsgid
, " before numeric constant");
10381 else if (token_type
== CPP_NAME
)
10383 message
= catenate_messages (gmsgid
, " before %qE");
10384 error (message
, value
);
10388 else if (token_type
== CPP_PRAGMA
)
10389 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
10390 else if (token_type
== CPP_PRAGMA_EOL
)
10391 message
= catenate_messages (gmsgid
, " before end of line");
10392 else if (token_type
== CPP_DECLTYPE
)
10393 message
= catenate_messages (gmsgid
, " before %<decltype%>");
10394 else if (token_type
< N_TTYPES
)
10396 message
= catenate_messages (gmsgid
, " before %qs token");
10397 error (message
, cpp_type2name (token_type
, token_flags
));
10409 #undef catenate_messages
10412 /* Return the gcc option code associated with the reason for a cpp
10413 message, or 0 if none. */
10416 c_option_controlling_cpp_error (int reason
)
10418 const struct cpp_reason_option_codes_t
*entry
;
10420 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
10422 if (entry
->reason
== reason
)
10423 return entry
->option_code
;
10428 /* Callback from cpp_error for PFILE to print diagnostics from the
10429 preprocessor. The diagnostic is of type LEVEL, with REASON set
10430 to the reason code if LEVEL is represents a warning, at location
10431 RICHLOC unless this is after lexing and the compiler's location
10432 should be used instead; MSG is the translated message and AP
10433 the arguments. Returns true if a diagnostic was emitted, false
10437 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
10438 rich_location
*richloc
,
10439 const char *msg
, va_list *ap
)
10441 diagnostic_info diagnostic
;
10442 diagnostic_t dlevel
;
10443 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
10448 case CPP_DL_WARNING_SYSHDR
:
10449 if (flag_no_output
)
10451 global_dc
->dc_warn_system_headers
= 1;
10452 /* Fall through. */
10453 case CPP_DL_WARNING
:
10454 if (flag_no_output
)
10456 dlevel
= DK_WARNING
;
10458 case CPP_DL_PEDWARN
:
10459 if (flag_no_output
&& !flag_pedantic_errors
)
10461 dlevel
= DK_PEDWARN
;
10476 gcc_unreachable ();
10479 richloc
->set_range (line_table
, 0, input_location
, true);
10480 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
10482 diagnostic_override_option_index (&diagnostic
,
10483 c_option_controlling_cpp_error (reason
));
10484 ret
= report_diagnostic (&diagnostic
);
10485 if (level
== CPP_DL_WARNING_SYSHDR
)
10486 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
10490 /* Convert a character from the host to the target execution character
10491 set. cpplib handles this, mostly. */
10494 c_common_to_target_charset (HOST_WIDE_INT c
)
10496 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10497 zero-extended under -fno-signed-char. cpplib insists that characters
10498 and character constants are always unsigned. Hence we must convert
10500 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
10502 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
10504 if (flag_signed_char
)
10505 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
10506 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
10511 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10512 references with an INDIRECT_REF of a constant at the bottom; much like the
10513 traditional rendering of offsetof as a macro. Return the folded result. */
10516 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
10519 tree_code code
= TREE_CODE (expr
);
10526 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
10527 return error_mark_node
;
10531 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10532 return error_mark_node
;
10536 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
10538 error ("cannot apply %<offsetof%> to a non constant address");
10539 return error_mark_node
;
10541 return TREE_OPERAND (expr
, 0);
10543 case COMPONENT_REF
:
10544 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10545 if (base
== error_mark_node
)
10548 t
= TREE_OPERAND (expr
, 1);
10549 if (DECL_C_BIT_FIELD (t
))
10551 error ("attempt to take address of bit-field structure "
10553 return error_mark_node
;
10555 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
10556 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
10561 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10562 if (base
== error_mark_node
)
10565 t
= TREE_OPERAND (expr
, 1);
10567 /* Check if the offset goes beyond the upper bound of the array. */
10568 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
10570 tree upbound
= array_ref_up_bound (expr
);
10571 if (upbound
!= NULL_TREE
10572 && TREE_CODE (upbound
) == INTEGER_CST
10573 && !tree_int_cst_equal (upbound
,
10574 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
10576 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
10577 upbound
= size_binop (PLUS_EXPR
, upbound
,
10578 build_int_cst (TREE_TYPE (upbound
), 1));
10579 if (tree_int_cst_lt (upbound
, t
))
10583 for (v
= TREE_OPERAND (expr
, 0);
10584 TREE_CODE (v
) == COMPONENT_REF
;
10585 v
= TREE_OPERAND (v
, 0))
10586 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
10589 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
10590 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
10591 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
10597 /* Don't warn if the array might be considered a poor
10598 man's flexible array member with a very permissive
10599 definition thereof. */
10600 if (TREE_CODE (v
) == ARRAY_REF
10601 || TREE_CODE (v
) == COMPONENT_REF
)
10602 warning (OPT_Warray_bounds
,
10603 "index %E denotes an offset "
10604 "greater than size of %qT",
10605 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
10610 t
= convert (sizetype
, t
);
10611 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
10614 case COMPOUND_EXPR
:
10615 /* Handle static members of volatile structs. */
10616 t
= TREE_OPERAND (expr
, 1);
10617 gcc_assert (VAR_P (t
));
10618 return fold_offsetof_1 (t
);
10621 gcc_unreachable ();
10624 return fold_build_pointer_plus (base
, off
);
10627 /* Likewise, but convert it to the return type of offsetof. */
10630 fold_offsetof (tree expr
)
10632 return convert (size_type_node
, fold_offsetof_1 (expr
));
10635 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10636 expression, because B will always be true. */
10639 warn_for_omitted_condop (location_t location
, tree cond
)
10641 /* In C++ template declarations it can happen that the type is dependent
10642 and not yet known, thus TREE_TYPE (cond) == NULL_TREE. */
10643 if (truth_value_p (TREE_CODE (cond
))
10644 || (TREE_TYPE (cond
) != NULL_TREE
10645 && TREE_CODE (TREE_TYPE (cond
)) == BOOLEAN_TYPE
))
10646 warning_at (location
, OPT_Wparentheses
,
10647 "the omitted middle operand in ?: will always be %<true%>, "
10648 "suggest explicit middle operand");
10651 /* Give an error for storing into ARG, which is 'const'. USE indicates
10652 how ARG was being used. */
10655 readonly_error (location_t loc
, tree arg
, enum lvalue_use use
)
10657 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
10659 /* Using this macro rather than (for example) arrays of messages
10660 ensures that all the format strings are checked at compile
10662 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10663 : (use == lv_increment ? (I) \
10664 : (use == lv_decrement ? (D) : (AS))))
10665 if (TREE_CODE (arg
) == COMPONENT_REF
)
10667 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
10668 error_at (loc
, READONLY_MSG (G_("assignment of member "
10669 "%qD in read-only object"),
10670 G_("increment of member "
10671 "%qD in read-only object"),
10672 G_("decrement of member "
10673 "%qD in read-only object"),
10674 G_("member %qD in read-only object "
10675 "used as %<asm%> output")),
10676 TREE_OPERAND (arg
, 1));
10678 error_at (loc
, READONLY_MSG (G_("assignment of read-only member %qD"),
10679 G_("increment of read-only member %qD"),
10680 G_("decrement of read-only member %qD"),
10681 G_("read-only member %qD used as %<asm%> output")),
10682 TREE_OPERAND (arg
, 1));
10684 else if (VAR_P (arg
))
10685 error_at (loc
, READONLY_MSG (G_("assignment of read-only variable %qD"),
10686 G_("increment of read-only variable %qD"),
10687 G_("decrement of read-only variable %qD"),
10688 G_("read-only variable %qD used as %<asm%> output")),
10690 else if (TREE_CODE (arg
) == PARM_DECL
)
10691 error_at (loc
, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10692 G_("increment of read-only parameter %qD"),
10693 G_("decrement of read-only parameter %qD"),
10694 G_("read-only parameter %qD use as %<asm%> output")),
10696 else if (TREE_CODE (arg
) == RESULT_DECL
)
10698 gcc_assert (c_dialect_cxx ());
10699 error_at (loc
, READONLY_MSG (G_("assignment of "
10700 "read-only named return value %qD"),
10702 "read-only named return value %qD"),
10704 "read-only named return value %qD"),
10705 G_("read-only named return value %qD "
10706 "used as %<asm%>output")),
10709 else if (TREE_CODE (arg
) == FUNCTION_DECL
)
10710 error_at (loc
, READONLY_MSG (G_("assignment of function %qD"),
10711 G_("increment of function %qD"),
10712 G_("decrement of function %qD"),
10713 G_("function %qD used as %<asm%> output")),
10716 error_at (loc
, READONLY_MSG (G_("assignment of read-only location %qE"),
10717 G_("increment of read-only location %qE"),
10718 G_("decrement of read-only location %qE"),
10719 G_("read-only location %qE used as %<asm%> output")),
10723 /* Print an error message for an invalid lvalue. USE says
10724 how the lvalue is being used and so selects the error message. LOC
10725 is the location for the error. */
10728 lvalue_error (location_t loc
, enum lvalue_use use
)
10733 error_at (loc
, "lvalue required as left operand of assignment");
10736 error_at (loc
, "lvalue required as increment operand");
10739 error_at (loc
, "lvalue required as decrement operand");
10742 error_at (loc
, "lvalue required as unary %<&%> operand");
10745 error_at (loc
, "lvalue required in asm statement");
10748 gcc_unreachable ();
10752 /* Print an error message for an invalid indirection of type TYPE.
10753 ERRSTRING is the name of the operator for the indirection. */
10756 invalid_indirection_error (location_t loc
, tree type
, ref_operator errstring
)
10761 gcc_assert (c_dialect_cxx ());
10762 error_at (loc
, "invalid type argument (have %qT)", type
);
10764 case RO_ARRAY_INDEXING
:
10766 "invalid type argument of array indexing (have %qT)",
10769 case RO_UNARY_STAR
:
10771 "invalid type argument of unary %<*%> (have %qT)",
10776 "invalid type argument of %<->%> (have %qT)",
10779 case RO_ARROW_STAR
:
10781 "invalid type argument of %<->*%> (have %qT)",
10784 case RO_IMPLICIT_CONVERSION
:
10786 "invalid type argument of implicit conversion (have %qT)",
10790 gcc_unreachable ();
10794 /* *PTYPE is an incomplete array. Complete it with a domain based on
10795 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10796 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10797 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10800 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
10802 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
10803 int failure
= 0, quals
;
10804 hashval_t hashcode
= 0;
10805 bool overflow_p
= false;
10807 maxindex
= size_zero_node
;
10810 if (TREE_CODE (initial_value
) == STRING_CST
)
10813 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
10814 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
10816 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
10818 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
10820 if (vec_safe_is_empty (v
))
10824 maxindex
= ssize_int (-1);
10829 unsigned HOST_WIDE_INT cnt
;
10830 constructor_elt
*ce
;
10831 bool fold_p
= false;
10834 maxindex
= (*v
)[0].index
, fold_p
= true;
10836 curindex
= maxindex
;
10838 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
10840 bool curfold_p
= false;
10842 curindex
= ce
->index
, curfold_p
= true;
10847 /* Since we treat size types now as ordinary
10848 unsigned types, we need an explicit overflow
10850 tree orig
= curindex
;
10851 curindex
= fold_convert (sizetype
, curindex
);
10852 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
10854 curindex
= size_binop (PLUS_EXPR
, curindex
,
10857 if (tree_int_cst_lt (maxindex
, curindex
))
10858 maxindex
= curindex
, fold_p
= curfold_p
;
10862 tree orig
= maxindex
;
10863 maxindex
= fold_convert (sizetype
, maxindex
);
10864 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
10870 /* Make an error message unless that happened already. */
10871 if (initial_value
!= error_mark_node
)
10883 elt
= TREE_TYPE (type
);
10884 quals
= TYPE_QUALS (strip_array_types (elt
));
10888 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
10890 /* Using build_distinct_type_copy and modifying things afterward instead
10891 of using build_array_type to create a new type preserves all of the
10892 TYPE_LANG_FLAG_? bits that the front end may have set. */
10893 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
10894 TREE_TYPE (main_type
) = unqual_elt
;
10895 TYPE_DOMAIN (main_type
)
10896 = build_range_type (TREE_TYPE (maxindex
),
10897 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
10898 layout_type (main_type
);
10900 /* Make sure we have the canonical MAIN_TYPE. */
10901 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
10902 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
10904 main_type
= type_hash_canon (hashcode
, main_type
);
10906 /* Fix the canonical type. */
10907 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
10908 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
10909 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
10910 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
10911 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
10912 != TYPE_DOMAIN (main_type
)))
10913 TYPE_CANONICAL (main_type
)
10914 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
10915 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
10917 TYPE_CANONICAL (main_type
) = main_type
;
10922 type
= c_build_qualified_type (main_type
, quals
);
10924 if (COMPLETE_TYPE_P (type
)
10925 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
10926 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
10928 error ("size of array is too large");
10929 /* If we proceed with the array type as it is, we'll eventually
10930 crash in tree_to_[su]hwi(). */
10931 type
= error_mark_node
;
10938 /* Like c_mark_addressable but don't check register qualifier. */
10940 c_common_mark_addressable_vec (tree t
)
10942 while (handled_component_p (t
))
10943 t
= TREE_OPERAND (t
, 0);
10945 && TREE_CODE (t
) != PARM_DECL
10946 && TREE_CODE (t
) != COMPOUND_LITERAL_EXPR
)
10948 TREE_ADDRESSABLE (t
) = 1;
10953 /* Used to help initialize the builtin-types.def table. When a type of
10954 the correct size doesn't exist, use error_mark_node instead of NULL.
10955 The later results in segfaults even when a decl using the type doesn't
10959 builtin_type_for_size (int size
, bool unsignedp
)
10961 tree type
= c_common_type_for_size (size
, unsignedp
);
10962 return type
? type
: error_mark_node
;
10965 /* A helper function for resolve_overloaded_builtin in resolving the
10966 overloaded __sync_ builtins. Returns a positive power of 2 if the
10967 first operand of PARAMS is a pointer to a supported data type.
10968 Returns 0 if an error is encountered.
10969 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10973 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
10975 /* Type of the argument. */
10977 /* Type the argument points to. */
10981 if (vec_safe_is_empty (params
))
10983 error ("too few arguments to function %qE", function
);
10987 argtype
= type
= TREE_TYPE ((*params
)[0]);
10988 if (TREE_CODE (type
) == ARRAY_TYPE
)
10990 /* Force array-to-pointer decay for C++. */
10991 gcc_assert (c_dialect_cxx());
10992 (*params
)[0] = default_conversion ((*params
)[0]);
10993 type
= TREE_TYPE ((*params
)[0]);
10995 if (TREE_CODE (type
) != POINTER_TYPE
)
10998 type
= TREE_TYPE (type
);
10999 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
11002 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
11005 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
11006 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
11010 /* Issue the diagnostic only if the argument is valid, otherwise
11011 it would be redundant at best and could be misleading. */
11012 if (argtype
!= error_mark_node
)
11013 error ("operand type %qT is incompatible with argument %d of %qE",
11014 argtype
, 1, function
);
11018 /* A helper function for resolve_overloaded_builtin. Adds casts to
11019 PARAMS to make arguments match up with those of FUNCTION. Drops
11020 the variadic arguments at the end. Returns false if some error
11021 was encountered; true on success. */
11024 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
11025 vec
<tree
, va_gc
> *params
, bool orig_format
)
11027 function_args_iterator iter
;
11029 unsigned int parmnum
;
11031 function_args_iter_init (&iter
, TREE_TYPE (function
));
11032 /* We've declared the implementation functions to use "volatile void *"
11033 as the pointer parameter, so we shouldn't get any complaints from the
11034 call to check_function_arguments what ever type the user used. */
11035 function_args_iter_next (&iter
);
11036 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
11037 ptype
= TYPE_MAIN_VARIANT (ptype
);
11039 /* For the rest of the values, we need to cast these to FTYPE, so that we
11040 don't get warnings for passing pointer types, etc. */
11044 tree val
, arg_type
;
11046 arg_type
= function_args_iter_cond (&iter
);
11047 /* XXX void_type_node belies the abstraction. */
11048 if (arg_type
== void_type_node
)
11052 if (params
->length () <= parmnum
)
11054 error_at (loc
, "too few arguments to function %qE", orig_function
);
11058 /* Only convert parameters if arg_type is unsigned integer type with
11059 new format sync routines, i.e. don't attempt to convert pointer
11060 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
11061 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
11063 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
11065 /* Ideally for the first conversion we'd use convert_for_assignment
11066 so that we get warnings for anything that doesn't match the pointer
11067 type. This isn't portable across the C and C++ front ends atm. */
11068 val
= (*params
)[parmnum
];
11069 val
= convert (ptype
, val
);
11070 val
= convert (arg_type
, val
);
11071 (*params
)[parmnum
] = val
;
11074 function_args_iter_next (&iter
);
11077 /* __atomic routines are not variadic. */
11078 if (!orig_format
&& params
->length () != parmnum
+ 1)
11080 error_at (loc
, "too many arguments to function %qE", orig_function
);
11084 /* The definition of these primitives is variadic, with the remaining
11085 being "an optional list of variables protected by the memory barrier".
11086 No clue what that's supposed to mean, precisely, but we consider all
11087 call-clobbered variables to be protected so we're safe. */
11088 params
->truncate (parmnum
+ 1);
11093 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11094 RESULT to make it match the type of the first pointer argument in
11098 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
11100 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
11101 tree rtype
= TREE_TYPE (result
);
11102 ptype
= TYPE_MAIN_VARIANT (ptype
);
11104 /* New format doesn't require casting unless the types are the same size. */
11105 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
11106 return convert (ptype
, result
);
11111 /* This function verifies the PARAMS to generic atomic FUNCTION.
11112 It returns the size if all the parameters are the same size, otherwise
11113 0 is returned if the parameters are invalid. */
11116 get_atomic_generic_size (location_t loc
, tree function
,
11117 vec
<tree
, va_gc
> *params
)
11119 unsigned int n_param
;
11120 unsigned int n_model
;
11125 /* Determine the parameter makeup. */
11126 switch (DECL_FUNCTION_CODE (function
))
11128 case BUILT_IN_ATOMIC_EXCHANGE
:
11132 case BUILT_IN_ATOMIC_LOAD
:
11133 case BUILT_IN_ATOMIC_STORE
:
11137 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11142 gcc_unreachable ();
11145 if (vec_safe_length (params
) != n_param
)
11147 error_at (loc
, "incorrect number of arguments to function %qE", function
);
11151 /* Get type of first parameter, and determine its size. */
11152 type_0
= TREE_TYPE ((*params
)[0]);
11153 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
11155 /* Force array-to-pointer decay for C++. */
11156 gcc_assert (c_dialect_cxx());
11157 (*params
)[0] = default_conversion ((*params
)[0]);
11158 type_0
= TREE_TYPE ((*params
)[0]);
11160 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
11162 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
11167 /* Types must be compile time constant sizes. */
11168 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
11171 "argument 1 of %qE must be a pointer to a constant size type",
11176 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
11178 /* Zero size objects are not allowed. */
11182 "argument 1 of %qE must be a pointer to a nonzero size object",
11187 /* Check each other parameter is a pointer and the same size. */
11188 for (x
= 0; x
< n_param
- n_model
; x
++)
11191 tree type
= TREE_TYPE ((*params
)[x
]);
11192 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11193 if (n_param
== 6 && x
== 3)
11195 if (!POINTER_TYPE_P (type
))
11197 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
11201 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
11202 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
11205 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
11206 "size type", x
+ 1, function
);
11209 else if (FUNCTION_POINTER_TYPE_P (type
))
11211 error_at (loc
, "argument %d of %qE must not be a pointer to a "
11212 "function", x
+ 1, function
);
11215 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
11216 size
= type_size
? tree_to_uhwi (type_size
) : 0;
11217 if (size
!= size_0
)
11219 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
11225 /* Check memory model parameters for validity. */
11226 for (x
= n_param
- n_model
; x
< n_param
; x
++)
11228 tree p
= (*params
)[x
];
11229 if (TREE_CODE (p
) == INTEGER_CST
)
11231 int i
= tree_to_uhwi (p
);
11232 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
11234 warning_at (loc
, OPT_Winvalid_memory_model
,
11235 "invalid memory model argument %d of %qE", x
+ 1,
11240 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
11242 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
11252 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11253 at the beginning of the parameter list PARAMS representing the size of the
11254 objects. This is to match the library ABI requirement. LOC is the location
11255 of the function call.
11256 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11257 returned to allow the external call to be constructed. */
11260 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
11261 vec
<tree
, va_gc
> *params
)
11265 /* Insert a SIZE_T parameter as the first param. If there isn't
11266 enough space, allocate a new vector and recursively re-build with that. */
11267 if (!params
->space (1))
11269 unsigned int z
, len
;
11270 vec
<tree
, va_gc
> *v
;
11273 len
= params
->length ();
11274 vec_alloc (v
, len
+ 1);
11275 v
->quick_push (build_int_cst (size_type_node
, n
));
11276 for (z
= 0; z
< len
; z
++)
11277 v
->quick_push ((*params
)[z
]);
11278 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
11283 /* Add the size parameter and leave as a function call for processing. */
11284 size_node
= build_int_cst (size_type_node
, n
);
11285 params
->quick_insert (0, size_node
);
11290 /* Return whether atomic operations for naturally aligned N-byte
11291 arguments are supported, whether inline or through libatomic. */
11293 atomic_size_supported_p (int n
)
11304 return targetm
.scalar_mode_supported_p (TImode
);
11311 /* This will process an __atomic_exchange function call, determine whether it
11312 needs to be mapped to the _N variation, or turned into a library call.
11313 LOC is the location of the builtin call.
11314 FUNCTION is the DECL that has been invoked;
11315 PARAMS is the argument list for the call. The return value is non-null
11316 TRUE is returned if it is translated into the proper format for a call to the
11317 external library, and NEW_RETURN is set the tree for that function.
11318 FALSE is returned if processing for the _N variation is required, and
11319 NEW_RETURN is set to the return value the result is copied into. */
11321 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
11322 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11324 tree p0
, p1
, p2
, p3
;
11325 tree I_type
, I_type_ptr
;
11326 int n
= get_atomic_generic_size (loc
, function
, params
);
11328 /* Size of 0 is an error condition. */
11331 *new_return
= error_mark_node
;
11335 /* If not a lock-free size, change to the library generic format. */
11336 if (!atomic_size_supported_p (n
))
11338 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11342 /* Otherwise there is a lockfree match, transform the call from:
11343 void fn(T* mem, T* desired, T* return, model)
11345 *return = (T) (fn (In* mem, (In) *desired, model)) */
11352 /* Create pointer to appropriate size. */
11353 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11354 I_type_ptr
= build_pointer_type (I_type
);
11356 /* Convert object pointer to required type. */
11357 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11359 /* Convert new value to required type, and dereference it. */
11360 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11361 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11364 /* Move memory model to the 3rd position, and end param list. */
11366 params
->truncate (3);
11368 /* Convert return pointer and dereference it for later assignment. */
11369 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11375 /* This will process an __atomic_compare_exchange function call, determine
11376 whether it needs to be mapped to the _N variation, or turned into a lib call.
11377 LOC is the location of the builtin call.
11378 FUNCTION is the DECL that has been invoked;
11379 PARAMS is the argument list for the call. The return value is non-null
11380 TRUE is returned if it is translated into the proper format for a call to the
11381 external library, and NEW_RETURN is set the tree for that function.
11382 FALSE is returned if processing for the _N variation is required. */
11385 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
11386 vec
<tree
, va_gc
> *params
,
11390 tree I_type
, I_type_ptr
;
11391 int n
= get_atomic_generic_size (loc
, function
, params
);
11393 /* Size of 0 is an error condition. */
11396 *new_return
= error_mark_node
;
11400 /* If not a lock-free size, change to the library generic format. */
11401 if (!atomic_size_supported_p (n
))
11403 /* The library generic format does not have the weak parameter, so
11404 remove it from the param list. Since a parameter has been removed,
11405 we can be sure that there is room for the SIZE_T parameter, meaning
11406 there will not be a recursive rebuilding of the parameter list, so
11407 there is no danger this will be done twice. */
11410 (*params
)[3] = (*params
)[4];
11411 (*params
)[4] = (*params
)[5];
11412 params
->truncate (5);
11414 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11418 /* Otherwise, there is a match, so the call needs to be transformed from:
11419 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11421 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11427 /* Create pointer to appropriate size. */
11428 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11429 I_type_ptr
= build_pointer_type (I_type
);
11431 /* Convert object pointer to required type. */
11432 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11435 /* Convert expected pointer to required type. */
11436 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
11439 /* Convert desired value to required type, and dereference it. */
11440 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11441 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
11444 /* The rest of the parameters are fine. NULL means no special return value
11446 *new_return
= NULL
;
11451 /* This will process an __atomic_load function call, determine whether it
11452 needs to be mapped to the _N variation, or turned into a library call.
11453 LOC is the location of the builtin call.
11454 FUNCTION is the DECL that has been invoked;
11455 PARAMS is the argument list for the call. The return value is non-null
11456 TRUE is returned if it is translated into the proper format for a call to the
11457 external library, and NEW_RETURN is set the tree for that function.
11458 FALSE is returned if processing for the _N variation is required, and
11459 NEW_RETURN is set to the return value the result is copied into. */
11462 resolve_overloaded_atomic_load (location_t loc
, tree function
,
11463 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11466 tree I_type
, I_type_ptr
;
11467 int n
= get_atomic_generic_size (loc
, function
, params
);
11469 /* Size of 0 is an error condition. */
11472 *new_return
= error_mark_node
;
11476 /* If not a lock-free size, change to the library generic format. */
11477 if (!atomic_size_supported_p (n
))
11479 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11483 /* Otherwise, there is a match, so the call needs to be transformed from:
11484 void fn(T* mem, T* return, model)
11486 *return = (T) (fn ((In *) mem, model)) */
11492 /* Create pointer to appropriate size. */
11493 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11494 I_type_ptr
= build_pointer_type (I_type
);
11496 /* Convert object pointer to required type. */
11497 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11500 /* Move memory model to the 2nd position, and end param list. */
11502 params
->truncate (2);
11504 /* Convert return pointer and dereference it for later assignment. */
11505 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11511 /* This will process an __atomic_store function call, determine whether it
11512 needs to be mapped to the _N variation, or turned into a library call.
11513 LOC is the location of the builtin call.
11514 FUNCTION is the DECL that has been invoked;
11515 PARAMS is the argument list for the call. The return value is non-null
11516 TRUE is returned if it is translated into the proper format for a call to the
11517 external library, and NEW_RETURN is set the tree for that function.
11518 FALSE is returned if processing for the _N variation is required, and
11519 NEW_RETURN is set to the return value the result is copied into. */
11522 resolve_overloaded_atomic_store (location_t loc
, tree function
,
11523 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11526 tree I_type
, I_type_ptr
;
11527 int n
= get_atomic_generic_size (loc
, function
, params
);
11529 /* Size of 0 is an error condition. */
11532 *new_return
= error_mark_node
;
11536 /* If not a lock-free size, change to the library generic format. */
11537 if (!atomic_size_supported_p (n
))
11539 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11543 /* Otherwise, there is a match, so the call needs to be transformed from:
11544 void fn(T* mem, T* value, model)
11546 fn ((In *) mem, (In) *value, model) */
11551 /* Create pointer to appropriate size. */
11552 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11553 I_type_ptr
= build_pointer_type (I_type
);
11555 /* Convert object pointer to required type. */
11556 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11559 /* Convert new value to required type, and dereference it. */
11560 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11561 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11564 /* The memory model is in the right spot already. Return is void. */
11565 *new_return
= NULL_TREE
;
11571 /* Some builtin functions are placeholders for other expressions. This
11572 function should be called immediately after parsing the call expression
11573 before surrounding code has committed to the type of the expression.
11575 LOC is the location of the builtin call.
11577 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11578 PARAMS is the argument list for the call. The return value is non-null
11579 when expansion is complete, and null if normal processing should
11583 resolve_overloaded_builtin (location_t loc
, tree function
,
11584 vec
<tree
, va_gc
> *params
)
11586 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
11588 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11589 Those are not valid to call with a pointer to _Bool (or C++ bool)
11590 and so must be rejected. */
11591 bool fetch_op
= true;
11592 bool orig_format
= true;
11593 tree new_return
= NULL_TREE
;
11595 switch (DECL_BUILT_IN_CLASS (function
))
11597 case BUILT_IN_NORMAL
:
11600 if (targetm
.resolve_overloaded_builtin
)
11601 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
11608 /* Handle BUILT_IN_NORMAL here. */
11611 case BUILT_IN_ATOMIC_EXCHANGE
:
11612 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11613 case BUILT_IN_ATOMIC_LOAD
:
11614 case BUILT_IN_ATOMIC_STORE
:
11616 /* Handle these 4 together so that they can fall through to the next
11617 case if the call is transformed to an _N variant. */
11620 case BUILT_IN_ATOMIC_EXCHANGE
:
11622 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
11625 /* Change to the _N variant. */
11626 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
11630 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11632 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
11636 /* Change to the _N variant. */
11637 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
11640 case BUILT_IN_ATOMIC_LOAD
:
11642 if (resolve_overloaded_atomic_load (loc
, function
, params
,
11645 /* Change to the _N variant. */
11646 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
11649 case BUILT_IN_ATOMIC_STORE
:
11651 if (resolve_overloaded_atomic_store (loc
, function
, params
,
11654 /* Change to the _N variant. */
11655 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
11659 gcc_unreachable ();
11663 case BUILT_IN_ATOMIC_EXCHANGE_N
:
11664 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
11665 case BUILT_IN_ATOMIC_LOAD_N
:
11666 case BUILT_IN_ATOMIC_STORE_N
:
11669 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
11670 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
11671 case BUILT_IN_ATOMIC_AND_FETCH_N
:
11672 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
11673 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
11674 case BUILT_IN_ATOMIC_OR_FETCH_N
:
11675 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
11676 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
11677 case BUILT_IN_ATOMIC_FETCH_AND_N
:
11678 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
11679 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
11680 case BUILT_IN_ATOMIC_FETCH_OR_N
:
11681 orig_format
= false;
11683 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
11684 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
11685 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
11686 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
11687 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
11688 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
11689 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
11690 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
11691 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
11692 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
11693 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
11694 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
11695 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
11696 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
11697 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
11698 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
11700 /* The following are not _FETCH_OPs and must be accepted with
11701 pointers to _Bool (or C++ bool). */
11704 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11705 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11706 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11707 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
11709 int n
= sync_resolve_size (function
, params
, fetch_op
);
11710 tree new_function
, first_param
, result
;
11711 enum built_in_function fncode
;
11714 return error_mark_node
;
11716 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
11717 new_function
= builtin_decl_explicit (fncode
);
11718 if (!sync_resolve_params (loc
, function
, new_function
, params
,
11720 return error_mark_node
;
11722 first_param
= (*params
)[0];
11723 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
11725 if (result
== error_mark_node
)
11727 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11728 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
11729 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
11730 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
11731 result
= sync_resolve_return (first_param
, result
, orig_format
);
11734 /* Prevent -Wunused-value warning. */
11735 TREE_USED (result
) = true;
11737 /* If new_return is set, assign function to that expr and cast the
11738 result to void since the generic interface returned void. */
11741 /* Cast function result from I{1,2,4,8,16} to the required type. */
11742 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
11743 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
11745 TREE_SIDE_EFFECTS (result
) = 1;
11746 protected_set_expr_location (result
, loc
);
11747 result
= convert (void_type_node
, result
);
11757 /* vector_types_compatible_elements_p is used in type checks of vectors
11758 values used as operands of binary operators. Where it returns true, and
11759 the other checks of the caller succeed (being vector types in he first
11760 place, and matching number of elements), we can just treat the types
11761 as essentially the same.
11762 Contrast with vector_targets_convertible_p, which is used for vector
11763 pointer types, and vector_types_convertible_p, which will allow
11764 language-specific matches under the control of flag_lax_vector_conversions,
11765 and might still require a conversion. */
11766 /* True if vector types T1 and T2 can be inputs to the same binary
11767 operator without conversion.
11768 We don't check the overall vector size here because some of our callers
11769 want to give different error messages when the vectors are compatible
11770 except for the element count. */
11773 vector_types_compatible_elements_p (tree t1
, tree t2
)
11775 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
11776 t1
= TREE_TYPE (t1
);
11777 t2
= TREE_TYPE (t2
);
11779 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
11781 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
11782 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
11783 || c2
== FIXED_POINT_TYPE
));
11785 t1
= c_common_signed_type (t1
);
11786 t2
= c_common_signed_type (t2
);
11787 /* Equality works here because c_common_signed_type uses
11788 TYPE_MAIN_VARIANT. */
11791 if (opaque
&& c1
== c2
11792 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
11793 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
11798 /* Check for missing format attributes on function pointers. LTYPE is
11799 the new type or left-hand side type. RTYPE is the old type or
11800 right-hand side type. Returns TRUE if LTYPE is missing the desired
11804 check_missing_format_attribute (tree ltype
, tree rtype
)
11806 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
11809 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
11810 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
11815 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
11816 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
11824 /* Subscripting with type char is likely to lose on a machine where
11825 chars are signed. So warn on any machine, but optionally. Don't
11826 warn for unsigned char since that type is safe. Don't warn for
11827 signed char because anyone who uses that must have done so
11828 deliberately. Furthermore, we reduce the false positive load by
11829 warning only for non-constant value of type char. */
11832 warn_array_subscript_with_type_char (location_t loc
, tree index
)
11834 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
11835 && TREE_CODE (index
) != INTEGER_CST
)
11836 warning_at (loc
, OPT_Wchar_subscripts
,
11837 "array subscript has type %<char%>");
11840 /* Implement -Wparentheses for the unexpected C precedence rules, to
11841 cover cases like x + y << z which readers are likely to
11842 misinterpret. We have seen an expression in which CODE is a binary
11843 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11844 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11845 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11846 expression was not formed using a binary or unary operator, or it
11847 was enclosed in parentheses. */
11850 warn_about_parentheses (location_t loc
, enum tree_code code
,
11851 enum tree_code code_left
, tree arg_left
,
11852 enum tree_code code_right
, tree arg_right
)
11854 if (!warn_parentheses
)
11857 /* This macro tests that the expression ARG with original tree code
11858 CODE appears to be a boolean expression. or the result of folding a
11859 boolean expression. */
11860 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11861 (truth_value_p (TREE_CODE (ARG)) \
11862 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11863 /* Folding may create 0 or 1 integers from other expressions. */ \
11864 || ((CODE) != INTEGER_CST \
11865 && (integer_onep (ARG) || integer_zerop (ARG))))
11870 if (code_left
== PLUS_EXPR
)
11871 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11872 "suggest parentheses around %<+%> inside %<<<%>");
11873 else if (code_right
== PLUS_EXPR
)
11874 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11875 "suggest parentheses around %<+%> inside %<<<%>");
11876 else if (code_left
== MINUS_EXPR
)
11877 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11878 "suggest parentheses around %<-%> inside %<<<%>");
11879 else if (code_right
== MINUS_EXPR
)
11880 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11881 "suggest parentheses around %<-%> inside %<<<%>");
11885 if (code_left
== PLUS_EXPR
)
11886 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11887 "suggest parentheses around %<+%> inside %<>>%>");
11888 else if (code_right
== PLUS_EXPR
)
11889 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11890 "suggest parentheses around %<+%> inside %<>>%>");
11891 else if (code_left
== MINUS_EXPR
)
11892 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11893 "suggest parentheses around %<-%> inside %<>>%>");
11894 else if (code_right
== MINUS_EXPR
)
11895 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11896 "suggest parentheses around %<-%> inside %<>>%>");
11899 case TRUTH_ORIF_EXPR
:
11900 if (code_left
== TRUTH_ANDIF_EXPR
)
11901 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11902 "suggest parentheses around %<&&%> within %<||%>");
11903 else if (code_right
== TRUTH_ANDIF_EXPR
)
11904 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11905 "suggest parentheses around %<&&%> within %<||%>");
11909 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
11910 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11911 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11912 "suggest parentheses around arithmetic in operand of %<|%>");
11913 else if (code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
11914 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11915 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11916 "suggest parentheses around arithmetic in operand of %<|%>");
11917 /* Check cases like x|y==z */
11918 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11919 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11920 "suggest parentheses around comparison in operand of %<|%>");
11921 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11922 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11923 "suggest parentheses around comparison in operand of %<|%>");
11924 /* Check cases like !x | y */
11925 else if (code_left
== TRUTH_NOT_EXPR
11926 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11927 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11928 "suggest parentheses around operand of "
11929 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
11933 if (code_left
== BIT_AND_EXPR
11934 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11935 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11936 "suggest parentheses around arithmetic in operand of %<^%>");
11937 else if (code_right
== BIT_AND_EXPR
11938 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11939 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11940 "suggest parentheses around arithmetic in operand of %<^%>");
11941 /* Check cases like x^y==z */
11942 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11943 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11944 "suggest parentheses around comparison in operand of %<^%>");
11945 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11946 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11947 "suggest parentheses around comparison in operand of %<^%>");
11951 if (code_left
== PLUS_EXPR
)
11952 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11953 "suggest parentheses around %<+%> in operand of %<&%>");
11954 else if (code_right
== PLUS_EXPR
)
11955 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11956 "suggest parentheses around %<+%> in operand of %<&%>");
11957 else if (code_left
== MINUS_EXPR
)
11958 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11959 "suggest parentheses around %<-%> in operand of %<&%>");
11960 else if (code_right
== MINUS_EXPR
)
11961 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11962 "suggest parentheses around %<-%> in operand of %<&%>");
11963 /* Check cases like x&y==z */
11964 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11965 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11966 "suggest parentheses around comparison in operand of %<&%>");
11967 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11968 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11969 "suggest parentheses around comparison in operand of %<&%>");
11970 /* Check cases like !x & y */
11971 else if (code_left
== TRUTH_NOT_EXPR
11972 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11973 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11974 "suggest parentheses around operand of "
11975 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
11979 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11980 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11981 "suggest parentheses around comparison in operand of %<==%>");
11982 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11983 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11984 "suggest parentheses around comparison in operand of %<==%>");
11987 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11988 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11989 "suggest parentheses around comparison in operand of %<!=%>");
11990 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11991 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11992 "suggest parentheses around comparison in operand of %<!=%>");
11996 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
11998 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
11999 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
12000 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
12001 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
12002 "comparisons like %<X<=Y<=Z%> do not "
12003 "have their mathematical meaning");
12004 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
12005 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
12006 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))
12007 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
12008 "comparisons like %<X<=Y<=Z%> do not "
12009 "have their mathematical meaning");
12013 #undef NOT_A_BOOLEAN_EXPR_P
12016 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
12019 warn_for_unused_label (tree label
)
12021 if (!TREE_USED (label
))
12023 if (DECL_INITIAL (label
))
12024 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
12026 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
12030 /* Warn for division by zero according to the value of DIVISOR. LOC
12031 is the location of the division operator. */
12034 warn_for_div_by_zero (location_t loc
, tree divisor
)
12036 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
12037 about division by zero. Do not issue a warning if DIVISOR has a
12038 floating-point type, since we consider 0.0/0.0 a valid way of
12039 generating a NaN. */
12040 if (c_inhibit_evaluation_warnings
== 0
12041 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
12042 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
12045 /* Warn for patterns where memset appears to be used incorrectly. The
12046 warning location should be LOC. ARG0, and ARG2 are the first and
12047 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
12048 each argument that was a literal zero. */
12051 warn_for_memset (location_t loc
, tree arg0
, tree arg2
,
12052 int literal_zero_mask
)
12054 if (warn_memset_transposed_args
12055 && integer_zerop (arg2
)
12056 && (literal_zero_mask
& (1 << 2)) != 0
12057 && (literal_zero_mask
& (1 << 1)) == 0)
12058 warning_at (loc
, OPT_Wmemset_transposed_args
,
12059 "%<memset%> used with constant zero length "
12060 "parameter; this could be due to transposed "
12063 if (warn_memset_elt_size
&& TREE_CODE (arg2
) == INTEGER_CST
)
12066 if (TREE_CODE (arg0
) == ADDR_EXPR
)
12067 arg0
= TREE_OPERAND (arg0
, 0);
12068 tree type
= TREE_TYPE (arg0
);
12069 if (type
!= NULL_TREE
&& TREE_CODE (type
) == ARRAY_TYPE
)
12071 tree elt_type
= TREE_TYPE (type
);
12072 tree domain
= TYPE_DOMAIN (type
);
12073 if (!integer_onep (TYPE_SIZE_UNIT (elt_type
))
12074 && domain
!= NULL_TREE
12075 && TYPE_MAXVAL (domain
)
12076 && TYPE_MINVAL (domain
)
12077 && integer_zerop (TYPE_MINVAL (domain
))
12078 && integer_onep (fold_build2 (MINUS_EXPR
, domain
,
12080 TYPE_MAXVAL (domain
))))
12081 warning_at (loc
, OPT_Wmemset_elt_size
,
12082 "%<memset%> used with length equal to "
12083 "number of elements without multiplication "
12084 "by element size");
12089 /* Subroutine of build_binary_op. Give warnings for comparisons
12090 between signed and unsigned quantities that may fail. Do the
12091 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
12092 so that casts will be considered, but default promotions won't
12095 LOCATION is the location of the comparison operator.
12097 The arguments of this function map directly to local variables
12098 of build_binary_op. */
12101 warn_for_sign_compare (location_t location
,
12102 tree orig_op0
, tree orig_op1
,
12103 tree op0
, tree op1
,
12104 tree result_type
, enum tree_code resultcode
)
12106 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
12107 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
12108 int unsignedp0
, unsignedp1
;
12110 /* In C++, check for comparison of different enum types. */
12111 if (c_dialect_cxx()
12112 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
12113 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
12114 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
12115 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
12117 warning_at (location
,
12118 OPT_Wsign_compare
, "comparison between types %qT and %qT",
12119 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
12122 /* Do not warn if the comparison is being done in a signed type,
12123 since the signed type will only be chosen if it can represent
12124 all the values of the unsigned type. */
12125 if (!TYPE_UNSIGNED (result_type
))
12127 /* Do not warn if both operands are unsigned. */
12128 else if (op0_signed
== op1_signed
)
12132 tree sop
, uop
, base_type
;
12136 sop
= orig_op0
, uop
= orig_op1
;
12138 sop
= orig_op1
, uop
= orig_op0
;
12140 STRIP_TYPE_NOPS (sop
);
12141 STRIP_TYPE_NOPS (uop
);
12142 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
12143 ? TREE_TYPE (result_type
) : result_type
);
12145 /* Do not warn if the signed quantity is an unsuffixed integer
12146 literal (or some static constant expression involving such
12147 literals or a conditional expression involving such literals)
12148 and it is non-negative. */
12149 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
12151 /* Do not warn if the comparison is an equality operation, the
12152 unsigned quantity is an integral constant, and it would fit
12153 in the result if the result were signed. */
12154 else if (TREE_CODE (uop
) == INTEGER_CST
12155 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
12156 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
12158 /* In C, do not warn if the unsigned quantity is an enumeration
12159 constant and its maximum value would fit in the result if the
12160 result were signed. */
12161 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
12162 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
12163 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
12164 c_common_signed_type (base_type
)))
12167 warning_at (location
,
12169 "comparison between signed and unsigned integer expressions");
12172 /* Warn if two unsigned values are being compared in a size larger
12173 than their original size, and one (and only one) is the result of
12174 a `~' operator. This comparison will always fail.
12176 Also warn if one operand is a constant, and the constant does not
12177 have all bits set that are set in the ~ operand when it is
12180 op0
= c_common_get_narrower (op0
, &unsignedp0
);
12181 op1
= c_common_get_narrower (op1
, &unsignedp1
);
12183 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
12184 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
12186 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
12187 op0
= c_common_get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
12188 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
12189 op1
= c_common_get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
12191 if (tree_fits_shwi_p (op0
) || tree_fits_shwi_p (op1
))
12194 HOST_WIDE_INT constant
, mask
;
12198 if (tree_fits_shwi_p (op0
))
12201 unsignedp
= unsignedp1
;
12202 constant
= tree_to_shwi (op0
);
12207 unsignedp
= unsignedp0
;
12208 constant
= tree_to_shwi (op1
);
12211 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
12212 if (bits
< TYPE_PRECISION (result_type
)
12213 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
12215 mask
= HOST_WIDE_INT_M1U
<< bits
;
12216 if ((mask
& constant
) != mask
)
12219 warning_at (location
, OPT_Wsign_compare
,
12220 "promoted ~unsigned is always non-zero");
12222 warning_at (location
, OPT_Wsign_compare
,
12223 "comparison of promoted ~unsigned with constant");
12227 else if (unsignedp0
&& unsignedp1
12228 && (TYPE_PRECISION (TREE_TYPE (op0
))
12229 < TYPE_PRECISION (result_type
))
12230 && (TYPE_PRECISION (TREE_TYPE (op1
))
12231 < TYPE_PRECISION (result_type
)))
12232 warning_at (location
, OPT_Wsign_compare
,
12233 "comparison of promoted ~unsigned with unsigned");
12237 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12238 type via c_common_type. If -Wdouble-promotion is in use, and the
12239 conditions for warning have been met, issue a warning. GMSGID is
12240 the warning message. It must have two %T specifiers for the type
12241 that was converted (generally "float") and the type to which it was
12242 converted (generally "double), respectively. LOC is the location
12243 to which the awrning should refer. */
12246 do_warn_double_promotion (tree result_type
, tree type1
, tree type2
,
12247 const char *gmsgid
, location_t loc
)
12251 if (!warn_double_promotion
)
12253 /* If the conversion will not occur at run-time, there is no need to
12255 if (c_inhibit_evaluation_warnings
)
12257 if (TYPE_MAIN_VARIANT (result_type
) != double_type_node
12258 && TYPE_MAIN_VARIANT (result_type
) != complex_double_type_node
)
12260 if (TYPE_MAIN_VARIANT (type1
) == float_type_node
12261 || TYPE_MAIN_VARIANT (type1
) == complex_float_type_node
)
12262 source_type
= type1
;
12263 else if (TYPE_MAIN_VARIANT (type2
) == float_type_node
12264 || TYPE_MAIN_VARIANT (type2
) == complex_float_type_node
)
12265 source_type
= type2
;
12268 warning_at (loc
, OPT_Wdouble_promotion
, gmsgid
, source_type
, result_type
);
12271 /* Possibly warn about unused parameters. */
12274 do_warn_unused_parameter (tree fn
)
12278 for (decl
= DECL_ARGUMENTS (fn
);
12279 decl
; decl
= DECL_CHAIN (decl
))
12280 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
12281 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
)
12282 && !TREE_NO_WARNING (decl
))
12283 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wunused_parameter
,
12284 "unused parameter %qD", decl
);
12288 /* Setup a TYPE_DECL node as a typedef representation.
12290 X is a TYPE_DECL for a typedef statement. Create a brand new
12291 ..._TYPE node (which will be just a variant of the existing
12292 ..._TYPE node with identical properties) and then install X
12293 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12295 The whole point here is to end up with a situation where each
12296 and every ..._TYPE node the compiler creates will be uniquely
12297 associated with AT MOST one node representing a typedef name.
12298 This way, even though the compiler substitutes corresponding
12299 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12300 early on, later parts of the compiler can always do the reverse
12301 translation and get back the corresponding typedef name. For
12304 typedef struct S MY_TYPE;
12307 Later parts of the compiler might only know that `object' was of
12308 type `struct S' if it were not for code just below. With this
12309 code however, later parts of the compiler see something like:
12311 struct S' == struct S
12312 typedef struct S' MY_TYPE;
12315 And they can then deduce (from the node for type struct S') that
12316 the original object declaration was:
12320 Being able to do this is important for proper support of protoize,
12321 and also for generating precise symbolic debugging information
12322 which takes full account of the programmer's (typedef) vocabulary.
12324 Obviously, we don't want to generate a duplicate ..._TYPE node if
12325 the TYPE_DECL node that we are now processing really represents a
12326 standard built-in type. */
12329 set_underlying_type (tree x
)
12331 if (x
== error_mark_node
)
12333 if (DECL_IS_BUILTIN (x
) && TREE_CODE (TREE_TYPE (x
)) != ARRAY_TYPE
)
12335 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
12336 TYPE_NAME (TREE_TYPE (x
)) = x
;
12338 else if (TREE_TYPE (x
) != error_mark_node
12339 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
12341 tree tt
= TREE_TYPE (x
);
12342 DECL_ORIGINAL_TYPE (x
) = tt
;
12343 tt
= build_variant_type_copy (tt
);
12344 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
12345 TYPE_NAME (tt
) = x
;
12346 TREE_USED (tt
) = TREE_USED (x
);
12347 TREE_TYPE (x
) = tt
;
12351 /* Record the types used by the current global variable declaration
12352 being parsed, so that we can decide later to emit their debug info.
12353 Those types are in types_used_by_cur_var_decl, and we are going to
12354 store them in the types_used_by_vars_hash hash table.
12355 DECL is the declaration of the global variable that has been parsed. */
12358 record_types_used_by_current_var_decl (tree decl
)
12360 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
12362 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
12364 tree type
= types_used_by_cur_var_decl
->pop ();
12365 types_used_by_var_decl_insert (type
, decl
);
12369 /* If DECL is a typedef that is declared in the current function,
12370 record it for the purpose of -Wunused-local-typedefs. */
12373 record_locally_defined_typedef (tree decl
)
12375 struct c_language_function
*l
;
12377 if (!warn_unused_local_typedefs
12379 /* if this is not a locally defined typedef then we are not
12381 || !is_typedef_decl (decl
)
12382 || !decl_function_context (decl
))
12385 l
= (struct c_language_function
*) cfun
->language
;
12386 vec_safe_push (l
->local_typedefs
, decl
);
12389 /* If T is a TYPE_DECL declared locally, mark it as used. */
12392 maybe_record_typedef_use (tree t
)
12394 if (!is_typedef_decl (t
))
12397 TREE_USED (t
) = true;
12400 /* Warn if there are some unused locally defined typedefs in the
12401 current function. */
12404 maybe_warn_unused_local_typedefs (void)
12408 /* The number of times we have emitted -Wunused-local-typedefs
12409 warnings. If this is different from errorcount, that means some
12410 unrelated errors have been issued. In which case, we'll avoid
12411 emitting "unused-local-typedefs" warnings. */
12412 static int unused_local_typedefs_warn_count
;
12413 struct c_language_function
*l
;
12418 if ((l
= (struct c_language_function
*) cfun
->language
) == NULL
)
12421 if (warn_unused_local_typedefs
12422 && errorcount
== unused_local_typedefs_warn_count
)
12424 FOR_EACH_VEC_SAFE_ELT (l
->local_typedefs
, i
, decl
)
12425 if (!TREE_USED (decl
))
12426 warning_at (DECL_SOURCE_LOCATION (decl
),
12427 OPT_Wunused_local_typedefs
,
12428 "typedef %qD locally defined but not used", decl
);
12429 unused_local_typedefs_warn_count
= errorcount
;
12432 vec_free (l
->local_typedefs
);
12435 /* Warn about boolean expression compared with an integer value different
12436 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12437 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12438 are the operands of the comparison. The caller must ensure that
12439 either operand is a boolean expression. */
12442 maybe_warn_bool_compare (location_t loc
, enum tree_code code
, tree op0
,
12445 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
12449 if (f
= fold_for_warn (op0
),
12450 TREE_CODE (f
) == INTEGER_CST
)
12452 else if (f
= fold_for_warn (op1
),
12453 TREE_CODE (f
) == INTEGER_CST
)
12458 if (!integer_zerop (cst
) && !integer_onep (cst
))
12460 int sign
= (TREE_CODE (op0
) == INTEGER_CST
12461 ? tree_int_cst_sgn (cst
) : -tree_int_cst_sgn (cst
));
12462 if (code
== EQ_EXPR
12463 || ((code
== GT_EXPR
|| code
== GE_EXPR
) && sign
< 0)
12464 || ((code
== LT_EXPR
|| code
== LE_EXPR
) && sign
> 0))
12465 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12466 "with boolean expression is always false", cst
);
12468 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12469 "with boolean expression is always true", cst
);
12471 else if (integer_zerop (cst
) || integer_onep (cst
))
12473 /* If the non-constant operand isn't of a boolean type, we
12474 don't want to warn here. */
12475 tree noncst
= TREE_CODE (op0
) == INTEGER_CST
? op1
: op0
;
12476 /* Handle booleans promoted to integers. */
12477 if (bool_promoted_to_int_p (noncst
))
12479 else if (TREE_CODE (TREE_TYPE (noncst
)) != BOOLEAN_TYPE
12480 && !truth_value_p (TREE_CODE (noncst
)))
12482 /* Do some magic to get the right diagnostics. */
12483 bool flag
= TREE_CODE (op0
) == INTEGER_CST
;
12484 flag
= integer_zerop (cst
) ? flag
: !flag
;
12485 if ((code
== GE_EXPR
&& !flag
) || (code
== LE_EXPR
&& flag
))
12486 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12487 "with boolean expression is always true", cst
);
12488 else if ((code
== LT_EXPR
&& !flag
) || (code
== GT_EXPR
&& flag
))
12489 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12490 "with boolean expression is always false", cst
);
12494 /* Warn if signed left shift overflows. We don't warn
12495 about left-shifting 1 into the sign bit in C++14; cf.
12496 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12497 LOC is a location of the shift; OP0 and OP1 are the operands.
12498 Return true if an overflow is detected, false otherwise. */
12501 maybe_warn_shift_overflow (location_t loc
, tree op0
, tree op1
)
12503 if (TREE_CODE (op0
) != INTEGER_CST
12504 || TREE_CODE (op1
) != INTEGER_CST
)
12507 tree type0
= TREE_TYPE (op0
);
12508 unsigned int prec0
= TYPE_PRECISION (type0
);
12510 /* Left-hand operand must be signed. */
12511 if (TYPE_UNSIGNED (type0
))
12514 unsigned int min_prec
= (wi::min_precision (op0
, SIGNED
)
12515 + TREE_INT_CST_LOW (op1
));
12516 /* Handle the case of left-shifting 1 into the sign bit.
12517 * However, shifting 1 _out_ of the sign bit, as in
12518 * INT_MIN << 1, is considered an overflow.
12520 if (!tree_int_cst_sign_bit(op0
) && min_prec
== prec0
+ 1)
12522 /* Never warn for C++14 onwards. */
12523 if (cxx_dialect
>= cxx14
)
12525 /* Otherwise only if -Wshift-overflow=2. But return
12526 true to signal an overflow for the sake of integer
12527 constant expressions. */
12528 if (warn_shift_overflow
< 2)
12532 bool overflowed
= min_prec
> prec0
;
12533 if (overflowed
&& c_inhibit_evaluation_warnings
== 0)
12534 warning_at (loc
, OPT_Wshift_overflow_
,
12535 "result of %qE requires %u bits to represent, "
12536 "but %qT only has %u bits",
12537 build2_loc (loc
, LSHIFT_EXPR
, type0
, op0
, op1
),
12538 min_prec
, type0
, prec0
);
12543 /* The C and C++ parsers both use vectors to hold function arguments.
12544 For efficiency, we keep a cache of unused vectors. This is the
12547 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
12548 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
12550 /* Return a new vector from the cache. If the cache is empty,
12551 allocate a new vector. These vectors are GC'ed, so it is OK if the
12552 pointer is not released.. */
12555 make_tree_vector (void)
12557 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
12558 return tree_vector_cache
->pop ();
12561 /* Passing 0 to vec::alloc returns NULL, and our callers require
12562 that we always return a non-NULL value. The vector code uses
12563 4 when growing a NULL vector, so we do too. */
12564 vec
<tree
, va_gc
> *v
;
12570 /* Release a vector of trees back to the cache. */
12573 release_tree_vector (vec
<tree
, va_gc
> *vec
)
12578 vec_safe_push (tree_vector_cache
, vec
);
12582 /* Get a new tree vector holding a single tree. */
12585 make_tree_vector_single (tree t
)
12587 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12588 ret
->quick_push (t
);
12592 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12595 make_tree_vector_from_list (tree list
)
12597 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12598 for (; list
; list
= TREE_CHAIN (list
))
12599 vec_safe_push (ret
, TREE_VALUE (list
));
12603 /* Get a new tree vector which is a copy of an existing one. */
12606 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
12608 vec
<tree
, va_gc
> *ret
;
12612 ret
= make_tree_vector ();
12613 vec_safe_reserve (ret
, vec_safe_length (orig
));
12614 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
12615 ret
->quick_push (t
);
12619 /* Return true if KEYWORD starts a type specifier. */
12622 keyword_begins_type_specifier (enum rid keyword
)
12626 case RID_AUTO_TYPE
:
12636 CASE_RID_FLOATN_NX
:
12639 case RID_DFLOAT128
:
12655 if (keyword
>= RID_FIRST_INT_N
12656 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
12657 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
12663 /* Return true if KEYWORD names a type qualifier. */
12666 keyword_is_type_qualifier (enum rid keyword
)
12680 /* Return true if KEYWORD names a storage class specifier.
12682 RID_TYPEDEF is not included in this list despite `typedef' being
12683 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12684 such for syntactic convenience only. */
12687 keyword_is_storage_class_specifier (enum rid keyword
)
12703 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12706 keyword_is_function_specifier (enum rid keyword
)
12720 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12721 declaration-specifier (C99 6.7). */
12724 keyword_is_decl_specifier (enum rid keyword
)
12726 if (keyword_is_storage_class_specifier (keyword
)
12727 || keyword_is_type_qualifier (keyword
)
12728 || keyword_is_function_specifier (keyword
))
12735 case RID_CONSTEXPR
:
12742 /* Initialize language-specific-bits of tree_contains_struct. */
12745 c_common_init_ts (void)
12747 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
12748 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
12749 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
12752 /* Build a user-defined numeric literal out of an integer constant type VALUE
12753 with identifier SUFFIX. */
12756 build_userdef_literal (tree suffix_id
, tree value
,
12757 enum overflow_type overflow
, tree num_string
)
12759 tree literal
= make_node (USERDEF_LITERAL
);
12760 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
12761 USERDEF_LITERAL_VALUE (literal
) = value
;
12762 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
12763 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
12767 /* For vector[index], convert the vector to an array of the underlying type.
12768 Return true if the resulting ARRAY_REF should not be an lvalue. */
12771 convert_vector_to_array_for_subscript (location_t loc
,
12772 tree
*vecp
, tree index
)
12775 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
12777 tree type
= TREE_TYPE (*vecp
);
12779 ret
= !lvalue_p (*vecp
);
12781 if (TREE_CODE (index
) == INTEGER_CST
)
12782 if (!tree_fits_uhwi_p (index
)
12783 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
12784 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
12786 /* We are building an ARRAY_REF so mark the vector as addressable
12787 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12788 for function parameters. */
12789 c_common_mark_addressable_vec (*vecp
);
12791 *vecp
= build1 (VIEW_CONVERT_EXPR
,
12792 build_array_type_nelts (TREE_TYPE (type
),
12793 TYPE_VECTOR_SUBPARTS (type
)),
12799 /* Determine which of the operands, if any, is a scalar that needs to be
12800 converted to a vector, for the range of operations. */
12802 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
12805 tree type0
= TREE_TYPE (op0
);
12806 tree type1
= TREE_TYPE (op1
);
12807 bool integer_only_op
= false;
12808 enum stv_conv ret
= stv_firstarg
;
12810 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
12813 /* Most GENERIC binary expressions require homogeneous arguments.
12814 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12815 argument that is a vector and a second one that is a scalar, so
12816 we never return stv_secondarg for them. */
12819 if (TREE_CODE (type0
) == INTEGER_TYPE
12820 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12822 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12825 error_at (loc
, "conversion of scalar %qT to vector %qT "
12826 "involves truncation", type0
, type1
);
12830 return stv_firstarg
;
12837 integer_only_op
= true;
12840 case VEC_COND_EXPR
:
12845 case TRUNC_DIV_EXPR
:
12846 case CEIL_DIV_EXPR
:
12847 case FLOOR_DIV_EXPR
:
12848 case ROUND_DIV_EXPR
:
12849 case EXACT_DIV_EXPR
:
12850 case TRUNC_MOD_EXPR
:
12851 case FLOOR_MOD_EXPR
:
12859 /* What about UNLT_EXPR? */
12860 if (VECTOR_TYPE_P (type0
))
12862 ret
= stv_secondarg
;
12863 std::swap (type0
, type1
);
12864 std::swap (op0
, op1
);
12867 if (TREE_CODE (type0
) == INTEGER_TYPE
12868 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12870 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12873 error_at (loc
, "conversion of scalar %qT to vector %qT "
12874 "involves truncation", type0
, type1
);
12879 else if (!integer_only_op
12880 /* Allow integer --> real conversion if safe. */
12881 && (TREE_CODE (type0
) == REAL_TYPE
12882 || TREE_CODE (type0
) == INTEGER_TYPE
)
12883 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
12885 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12888 error_at (loc
, "conversion of scalar %qT to vector %qT "
12889 "involves truncation", type0
, type1
);
12898 return stv_nothing
;
12901 /* Return the alignment of std::max_align_t.
12903 [support.types.layout] The type max_align_t is a POD type whose alignment
12904 requirement is at least as great as that of every scalar type, and whose
12905 alignment requirement is supported in every context. */
12908 max_align_t_align ()
12910 unsigned int max_align
= MAX (TYPE_ALIGN (long_long_integer_type_node
),
12911 TYPE_ALIGN (long_double_type_node
));
12912 if (float128_type_node
!= NULL_TREE
)
12913 max_align
= MAX (max_align
, TYPE_ALIGN (float128_type_node
));
12917 /* Return true iff ALIGN is an integral constant that is a fundamental
12918 alignment, as defined by [basic.align] in the c++-11
12923 [A fundamental alignment is represented by an alignment less than or
12924 equal to the greatest alignment supported by the implementation
12925 in all contexts, which is equal to alignof(max_align_t)]. */
12928 cxx_fundamental_alignment_p (unsigned align
)
12930 return (align
<= max_align_t_align ());
12933 /* Return true if T is a pointer to a zero-sized aggregate. */
12936 pointer_to_zero_sized_aggr_p (tree t
)
12938 if (!POINTER_TYPE_P (t
))
12941 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
12944 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12945 with no library fallback or for an ADDR_EXPR whose operand is such type
12946 issues an error pointing to the location LOC.
12947 Returns true when the expression has been diagnosed and false
12950 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
12952 if (TREE_CODE (expr
) == ADDR_EXPR
)
12953 expr
= TREE_OPERAND (expr
, 0);
12955 if (TREE_TYPE (expr
)
12956 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
12957 && TREE_CODE (expr
) == FUNCTION_DECL
12958 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12959 false positives for user-declared built-ins such as abs or
12960 strlen, and for C++ operators new and delete.
12961 The c_decl_implicit() test avoids false positives for implicitly
12962 declared built-ins with library fallbacks (such as abs). */
12963 && DECL_BUILT_IN (expr
)
12964 && DECL_IS_BUILTIN (expr
)
12965 && !c_decl_implicit (expr
)
12966 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
12968 if (loc
== UNKNOWN_LOCATION
)
12969 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
12971 /* Reject arguments that are built-in functions with
12972 no library fallback. */
12973 error_at (loc
, "built-in function %qE must be directly called", expr
);
12981 /* If we're creating an if-else-if condition chain, first see if we
12982 already have this COND in the CHAIN. If so, warn and don't add COND
12983 into the vector, otherwise add the COND there. LOC is the location
12987 warn_duplicated_cond_add_or_warn (location_t loc
, tree cond
, vec
<tree
> **chain
)
12989 /* No chain has been created yet. Do nothing. */
12990 if (*chain
== NULL
)
12993 if (TREE_SIDE_EFFECTS (cond
))
12995 /* Uh-oh! This condition has a side-effect, thus invalidates
12996 the whole chain. */
13004 bool found
= false;
13005 FOR_EACH_VEC_ELT (**chain
, ix
, t
)
13006 if (operand_equal_p (cond
, t
, 0))
13008 if (warning_at (loc
, OPT_Wduplicated_cond
,
13009 "duplicated %<if%> condition"))
13010 inform (EXPR_LOCATION (t
), "previously used here");
13016 && !CONSTANT_CLASS_P (cond
)
13017 /* Don't infinitely grow the chain. */
13018 && (*chain
)->length () < 512)
13019 (*chain
)->safe_push (cond
);
13022 /* Check if array size calculations overflow or if the array covers more
13023 than half of the address space. Return true if the size of the array
13024 is valid, false otherwise. TYPE is the type of the array and NAME is
13025 the name of the array, or NULL_TREE for unnamed arrays. */
13028 valid_array_size_p (location_t loc
, tree type
, tree name
)
13030 if (type
!= error_mark_node
13031 && COMPLETE_TYPE_P (type
)
13032 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
13033 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
13036 error_at (loc
, "size of array %qE is too large", name
);
13038 error_at (loc
, "size of unnamed array is too large");
13044 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
13045 timestamp to replace embedded current dates to get reproducible
13046 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
13049 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
13051 char *source_date_epoch
;
13055 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
13056 if (!source_date_epoch
)
13057 return (time_t) -1;
13060 #if defined(INT64_T_IS_LONG)
13061 epoch
= strtol (source_date_epoch
, &endptr
, 10);
13063 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
13065 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
13066 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
13068 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
13069 "expand to a non-negative integer less than or equal to %wd",
13070 MAX_SOURCE_DATE_EPOCH
);
13071 return (time_t) -1;
13074 return (time_t) epoch
;
13077 /* Callback for libcpp for offering spelling suggestions for misspelled
13078 directives. GOAL is an unrecognized string; CANDIDATES is a
13079 NULL-terminated array of candidate strings. Return the closest
13080 match to GOAL within CANDIDATES, or NULL if none are good
13084 cb_get_suggestion (cpp_reader
*, const char *goal
,
13085 const char *const *candidates
)
13087 best_match
<const char *, const char *> bm (goal
);
13088 while (*candidates
)
13089 bm
.consider (*candidates
++);
13090 return bm
.get_best_meaningful_candidate ();
13093 /* Check and possibly warn if two declarations have contradictory
13094 attributes, such as always_inline vs. noinline. */
13097 diagnose_mismatched_attributes (tree olddecl
, tree newdecl
)
13099 bool warned
= false;
13101 tree a1
= lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl
));
13102 tree a2
= lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl
));
13103 /* An optimization attribute applied on a declaration after the
13104 definition is likely not what the user wanted. */
13105 if (a2
!= NULL_TREE
13106 && DECL_SAVED_TREE (olddecl
) != NULL_TREE
13107 && (a1
== NULL_TREE
|| !attribute_list_equal (a1
, a2
)))
13108 warned
|= warning (OPT_Wattributes
,
13109 "optimization attribute on %qD follows "
13110 "definition but the attribute doesn%'t match",
13113 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
13114 if (DECL_DECLARED_INLINE_P (newdecl
)
13115 && DECL_UNINLINABLE (olddecl
)
13116 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13117 warned
|= warning (OPT_Wattributes
, "inline declaration of %qD follows "
13118 "declaration with attribute noinline", newdecl
);
13119 else if (DECL_DECLARED_INLINE_P (olddecl
)
13120 && DECL_UNINLINABLE (newdecl
)
13121 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
13122 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13123 "noinline follows inline declaration ", newdecl
);
13124 else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
))
13125 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl
)))
13126 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13127 "%qs follows declaration with attribute %qs",
13128 newdecl
, "noinline", "always_inline");
13129 else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl
))
13130 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13131 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13132 "%qs follows declaration with attribute %qs",
13133 newdecl
, "always_inline", "noinline");
13134 else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl
))
13135 && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl
)))
13136 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13137 "%qs follows declaration with attribute %qs",
13138 newdecl
, "cold", "hot");
13139 else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl
))
13140 && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl
)))
13141 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13142 "%qs follows declaration with attribute %qs",
13143 newdecl
, "hot", "cold");
13147 #include "gt-c-family-c-common.h"