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 *);
400 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
401 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
402 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
403 static int resort_field_decl_cmp (const void *, const void *);
405 /* Reserved words. The third field is a mask: keywords are disabled
406 if they match the mask.
409 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
410 C --std=c99: D_CXXONLY | D_OBJC
411 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
412 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
413 C++ --std=c0x: D_CONLY | D_OBJC
414 ObjC++ is like C++ except that D_OBJC is not set
416 If -fno-asm is used, D_ASM is added to the mask. If
417 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
418 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
419 In C with -Wc++-compat, we warn if D_CXXWARN is set.
421 Note the complication of the D_CXX_OBJC keywords. These are
422 reserved words such as 'class'. In C++, 'class' is a reserved
423 word. In Objective-C++ it is too. In Objective-C, it is a
424 reserved word too, but only if it follows an '@' sign.
426 const struct c_common_resword c_common_reswords
[] =
428 { "_Alignas", RID_ALIGNAS
, D_CONLY
},
429 { "_Alignof", RID_ALIGNOF
, D_CONLY
},
430 { "_Atomic", RID_ATOMIC
, D_CONLY
},
431 { "_Bool", RID_BOOL
, D_CONLY
},
432 { "_Complex", RID_COMPLEX
, 0 },
433 { "_Cilk_spawn", RID_CILK_SPAWN
, 0 },
434 { "_Cilk_sync", RID_CILK_SYNC
, 0 },
435 { "_Cilk_for", RID_CILK_FOR
, 0 },
436 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
437 { "_Float16", RID_FLOAT16
, D_CONLY
},
438 { "_Float32", RID_FLOAT32
, D_CONLY
},
439 { "_Float64", RID_FLOAT64
, D_CONLY
},
440 { "_Float128", RID_FLOAT128
, D_CONLY
},
441 { "_Float32x", RID_FLOAT32X
, D_CONLY
},
442 { "_Float64x", RID_FLOAT64X
, D_CONLY
},
443 { "_Float128x", RID_FLOAT128X
, D_CONLY
},
444 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
445 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
446 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
447 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
448 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
449 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
450 { "_Static_assert", RID_STATIC_ASSERT
, D_CONLY
},
451 { "_Noreturn", RID_NORETURN
, D_CONLY
},
452 { "_Generic", RID_GENERIC
, D_CONLY
},
453 { "_Thread_local", RID_THREAD
, D_CONLY
},
454 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
455 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
456 { "__alignof", RID_ALIGNOF
, 0 },
457 { "__alignof__", RID_ALIGNOF
, 0 },
458 { "__asm", RID_ASM
, 0 },
459 { "__asm__", RID_ASM
, 0 },
460 { "__attribute", RID_ATTRIBUTE
, 0 },
461 { "__attribute__", RID_ATTRIBUTE
, 0 },
462 { "__auto_type", RID_AUTO_TYPE
, D_CONLY
},
463 { "__bases", RID_BASES
, D_CXXONLY
},
464 { "__builtin_call_with_static_chain",
465 RID_BUILTIN_CALL_WITH_STATIC_CHAIN
, D_CONLY
},
466 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
467 { "__builtin_complex", RID_BUILTIN_COMPLEX
, D_CONLY
},
468 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE
, 0 },
469 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
470 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
471 { "__builtin_va_arg", RID_VA_ARG
, 0 },
472 { "__complex", RID_COMPLEX
, 0 },
473 { "__complex__", RID_COMPLEX
, 0 },
474 { "__const", RID_CONST
, 0 },
475 { "__const__", RID_CONST
, 0 },
476 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
477 { "__direct_bases", RID_DIRECT_BASES
, D_CXXONLY
},
478 { "__extension__", RID_EXTENSION
, 0 },
479 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
480 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
481 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
482 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
483 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
484 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
485 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
486 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
487 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
488 { "__imag", RID_IMAGPART
, 0 },
489 { "__imag__", RID_IMAGPART
, 0 },
490 { "__inline", RID_INLINE
, 0 },
491 { "__inline__", RID_INLINE
, 0 },
492 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
493 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
494 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
495 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
496 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
497 { "__is_final", RID_IS_FINAL
, D_CXXONLY
},
498 { "__is_literal_type", RID_IS_LITERAL_TYPE
, D_CXXONLY
},
499 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
500 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
501 { "__is_same_as", RID_IS_SAME_AS
, D_CXXONLY
},
502 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
503 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
504 { "__is_trivially_assignable", RID_IS_TRIVIALLY_ASSIGNABLE
, D_CXXONLY
},
505 { "__is_trivially_constructible", RID_IS_TRIVIALLY_CONSTRUCTIBLE
, D_CXXONLY
},
506 { "__is_trivially_copyable", RID_IS_TRIVIALLY_COPYABLE
, D_CXXONLY
},
507 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
508 { "__label__", RID_LABEL
, 0 },
509 { "__null", RID_NULL
, 0 },
510 { "__real", RID_REALPART
, 0 },
511 { "__real__", RID_REALPART
, 0 },
512 { "__restrict", RID_RESTRICT
, 0 },
513 { "__restrict__", RID_RESTRICT
, 0 },
514 { "__signed", RID_SIGNED
, 0 },
515 { "__signed__", RID_SIGNED
, 0 },
516 { "__thread", RID_THREAD
, 0 },
517 { "__transaction_atomic", RID_TRANSACTION_ATOMIC
, 0 },
518 { "__transaction_relaxed", RID_TRANSACTION_RELAXED
, 0 },
519 { "__transaction_cancel", RID_TRANSACTION_CANCEL
, 0 },
520 { "__typeof", RID_TYPEOF
, 0 },
521 { "__typeof__", RID_TYPEOF
, 0 },
522 { "__underlying_type", RID_UNDERLYING_TYPE
, D_CXXONLY
},
523 { "__volatile", RID_VOLATILE
, 0 },
524 { "__volatile__", RID_VOLATILE
, 0 },
525 { "alignas", RID_ALIGNAS
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
526 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
527 { "asm", RID_ASM
, D_ASM
},
528 { "auto", RID_AUTO
, 0 },
529 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
530 { "break", RID_BREAK
, 0 },
531 { "case", RID_CASE
, 0 },
532 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
533 { "char", RID_CHAR
, 0 },
534 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
535 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
536 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
537 { "const", RID_CONST
, 0 },
538 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
539 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
540 { "continue", RID_CONTINUE
, 0 },
541 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
542 { "default", RID_DEFAULT
, 0 },
543 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
545 { "double", RID_DOUBLE
, 0 },
546 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
547 { "else", RID_ELSE
, 0 },
548 { "enum", RID_ENUM
, 0 },
549 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
550 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
551 { "extern", RID_EXTERN
, 0 },
552 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
553 { "float", RID_FLOAT
, 0 },
554 { "for", RID_FOR
, 0 },
555 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
556 { "goto", RID_GOTO
, 0 },
558 { "inline", RID_INLINE
, D_EXT89
},
559 { "int", RID_INT
, 0 },
560 { "long", RID_LONG
, 0 },
561 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
562 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
563 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
564 { "noexcept", RID_NOEXCEPT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
565 { "nullptr", RID_NULLPTR
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
566 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
567 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
568 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
569 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
570 { "register", RID_REGISTER
, 0 },
571 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
572 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
573 { "return", RID_RETURN
, 0 },
574 { "short", RID_SHORT
, 0 },
575 { "signed", RID_SIGNED
, 0 },
576 { "sizeof", RID_SIZEOF
, 0 },
577 { "static", RID_STATIC
, 0 },
578 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
579 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
580 { "struct", RID_STRUCT
, 0 },
581 { "switch", RID_SWITCH
, 0 },
582 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
583 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
584 { "thread_local", RID_THREAD
, D_CXXONLY
| D_CXX11
| D_CXXWARN
},
585 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
586 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
587 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
588 { "typedef", RID_TYPEDEF
, 0 },
589 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
590 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
591 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
592 { "union", RID_UNION
, 0 },
593 { "unsigned", RID_UNSIGNED
, 0 },
594 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
595 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
596 { "void", RID_VOID
, 0 },
597 { "volatile", RID_VOLATILE
, 0 },
598 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
599 { "while", RID_WHILE
, 0 },
601 /* C++ transactional memory. */
602 { "synchronized", RID_SYNCHRONIZED
, D_CXX_OBJC
| D_TRANSMEM
},
603 { "atomic_noexcept", RID_ATOMIC_NOEXCEPT
, D_CXXONLY
| D_TRANSMEM
},
604 { "atomic_cancel", RID_ATOMIC_CANCEL
, D_CXXONLY
| D_TRANSMEM
},
605 { "atomic_commit", RID_TRANSACTION_ATOMIC
, D_CXXONLY
| D_TRANSMEM
},
607 /* Concepts-related keywords */
608 { "concept", RID_CONCEPT
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
609 { "requires", RID_REQUIRES
, D_CXX_CONCEPTS_FLAGS
| D_CXXWARN
},
611 /* These Objective-C keywords are recognized only immediately after
613 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
614 { "defs", RID_AT_DEFS
, D_OBJC
},
615 { "encode", RID_AT_ENCODE
, D_OBJC
},
616 { "end", RID_AT_END
, D_OBJC
},
617 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
618 { "interface", RID_AT_INTERFACE
, D_OBJC
},
619 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
620 { "selector", RID_AT_SELECTOR
, D_OBJC
},
621 { "finally", RID_AT_FINALLY
, D_OBJC
},
622 { "optional", RID_AT_OPTIONAL
, D_OBJC
},
623 { "required", RID_AT_REQUIRED
, D_OBJC
},
624 { "property", RID_AT_PROPERTY
, D_OBJC
},
625 { "package", RID_AT_PACKAGE
, D_OBJC
},
626 { "synthesize", RID_AT_SYNTHESIZE
, D_OBJC
},
627 { "dynamic", RID_AT_DYNAMIC
, D_OBJC
},
628 /* These are recognized only in protocol-qualifier context
630 { "bycopy", RID_BYCOPY
, D_OBJC
},
631 { "byref", RID_BYREF
, D_OBJC
},
632 { "in", RID_IN
, D_OBJC
},
633 { "inout", RID_INOUT
, D_OBJC
},
634 { "oneway", RID_ONEWAY
, D_OBJC
},
635 { "out", RID_OUT
, D_OBJC
},
636 /* These are recognized inside a property attribute list */
637 { "assign", RID_ASSIGN
, D_OBJC
},
638 { "copy", RID_COPY
, D_OBJC
},
639 { "getter", RID_GETTER
, D_OBJC
},
640 { "nonatomic", RID_NONATOMIC
, D_OBJC
},
641 { "readonly", RID_READONLY
, D_OBJC
},
642 { "readwrite", RID_READWRITE
, D_OBJC
},
643 { "retain", RID_RETAIN
, D_OBJC
},
644 { "setter", RID_SETTER
, D_OBJC
},
647 const unsigned int num_c_common_reswords
=
648 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
650 /* Table of machine-independent attributes common to all C-like languages.
652 All attributes referencing arguments should be additionally processed
653 in chkp_copy_function_type_adding_bounds for correct instrumentation
654 by Pointer Bounds Checker.
655 Current list of processed common attributes: nonnull. */
656 const struct attribute_spec c_common_attribute_table
[] =
658 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
659 affects_type_identity } */
660 { "packed", 0, 0, false, false, false,
661 handle_packed_attribute
, false},
662 { "nocommon", 0, 0, true, false, false,
663 handle_nocommon_attribute
, false},
664 { "common", 0, 0, true, false, false,
665 handle_common_attribute
, false },
666 /* FIXME: logically, noreturn attributes should be listed as
667 "false, true, true" and apply to function types. But implementing this
668 would require all the places in the compiler that use TREE_THIS_VOLATILE
669 on a decl to identify non-returning functions to be located and fixed
670 to check the function type instead. */
671 { "noreturn", 0, 0, true, false, false,
672 handle_noreturn_attribute
, false },
673 { "volatile", 0, 0, true, false, false,
674 handle_noreturn_attribute
, false },
675 { "stack_protect", 0, 0, true, false, false,
676 handle_stack_protect_attribute
, false },
677 { "noinline", 0, 0, true, false, false,
678 handle_noinline_attribute
, false },
679 { "noclone", 0, 0, true, false, false,
680 handle_noclone_attribute
, false },
681 { "no_icf", 0, 0, true, false, false,
682 handle_noicf_attribute
, false },
683 { "leaf", 0, 0, true, false, false,
684 handle_leaf_attribute
, false },
685 { "always_inline", 0, 0, true, false, false,
686 handle_always_inline_attribute
, false },
687 { "gnu_inline", 0, 0, true, false, false,
688 handle_gnu_inline_attribute
, false },
689 { "artificial", 0, 0, true, false, false,
690 handle_artificial_attribute
, false },
691 { "flatten", 0, 0, true, false, false,
692 handle_flatten_attribute
, false },
693 { "used", 0, 0, true, false, false,
694 handle_used_attribute
, false },
695 { "unused", 0, 0, false, false, false,
696 handle_unused_attribute
, false },
697 { "externally_visible", 0, 0, true, false, false,
698 handle_externally_visible_attribute
, false },
699 { "no_reorder", 0, 0, true, false, false,
700 handle_no_reorder_attribute
, false },
701 /* The same comments as for noreturn attributes apply to const ones. */
702 { "const", 0, 0, true, false, false,
703 handle_const_attribute
, false },
704 { "scalar_storage_order", 1, 1, false, false, false,
705 handle_scalar_storage_order_attribute
, false },
706 { "transparent_union", 0, 0, false, false, false,
707 handle_transparent_union_attribute
, false },
708 { "constructor", 0, 1, true, false, false,
709 handle_constructor_attribute
, false },
710 { "destructor", 0, 1, true, false, false,
711 handle_destructor_attribute
, false },
712 { "mode", 1, 1, false, true, false,
713 handle_mode_attribute
, false },
714 { "section", 1, 1, true, false, false,
715 handle_section_attribute
, false },
716 { "aligned", 0, 1, false, false, false,
717 handle_aligned_attribute
, false },
718 { "weak", 0, 0, true, false, false,
719 handle_weak_attribute
, false },
720 { "noplt", 0, 0, true, false, false,
721 handle_noplt_attribute
, false },
722 { "ifunc", 1, 1, true, false, false,
723 handle_ifunc_attribute
, false },
724 { "alias", 1, 1, true, false, false,
725 handle_alias_attribute
, false },
726 { "weakref", 0, 1, true, false, false,
727 handle_weakref_attribute
, false },
728 { "no_instrument_function", 0, 0, true, false, false,
729 handle_no_instrument_function_attribute
,
731 { "no_profile_instrument_function", 0, 0, true, false, false,
732 handle_no_profile_instrument_function_attribute
,
734 { "malloc", 0, 0, true, false, false,
735 handle_malloc_attribute
, false },
736 { "returns_twice", 0, 0, true, false, false,
737 handle_returns_twice_attribute
, false },
738 { "no_stack_limit", 0, 0, true, false, false,
739 handle_no_limit_stack_attribute
, false },
740 { "pure", 0, 0, true, false, false,
741 handle_pure_attribute
, false },
742 { "transaction_callable", 0, 0, false, true, false,
743 handle_tm_attribute
, false },
744 { "transaction_unsafe", 0, 0, false, true, false,
745 handle_tm_attribute
, true },
746 { "transaction_safe", 0, 0, false, true, false,
747 handle_tm_attribute
, true },
748 { "transaction_safe_dynamic", 0, 0, true, false, false,
749 handle_tm_attribute
, false },
750 { "transaction_may_cancel_outer", 0, 0, false, true, false,
751 handle_tm_attribute
, false },
752 /* ??? These two attributes didn't make the transition from the
753 Intel language document to the multi-vendor language document. */
754 { "transaction_pure", 0, 0, false, true, false,
755 handle_tm_attribute
, false },
756 { "transaction_wrap", 1, 1, true, false, false,
757 handle_tm_wrap_attribute
, false },
758 /* For internal use (marking of builtins) only. The name contains space
759 to prevent its usage in source code. */
760 { "no vops", 0, 0, true, false, false,
761 handle_novops_attribute
, false },
762 { "deprecated", 0, 1, false, false, false,
763 handle_deprecated_attribute
, false },
764 { "vector_size", 1, 1, false, true, false,
765 handle_vector_size_attribute
, true },
766 { "visibility", 1, 1, false, false, false,
767 handle_visibility_attribute
, false },
768 { "tls_model", 1, 1, true, false, false,
769 handle_tls_model_attribute
, false },
770 { "nonnull", 0, -1, false, true, true,
771 handle_nonnull_attribute
, false },
772 { "nothrow", 0, 0, true, false, false,
773 handle_nothrow_attribute
, false },
774 { "may_alias", 0, 0, false, true, false, NULL
, false },
775 { "cleanup", 1, 1, true, false, false,
776 handle_cleanup_attribute
, false },
777 { "warn_unused_result", 0, 0, false, true, true,
778 handle_warn_unused_result_attribute
, false },
779 { "sentinel", 0, 1, false, true, true,
780 handle_sentinel_attribute
, false },
781 /* For internal use (marking of builtins) only. The name contains space
782 to prevent its usage in source code. */
783 { "type generic", 0, 0, false, true, true,
784 handle_type_generic_attribute
, false },
785 { "alloc_size", 1, 2, false, true, true,
786 handle_alloc_size_attribute
, false },
787 { "cold", 0, 0, true, false, false,
788 handle_cold_attribute
, false },
789 { "hot", 0, 0, true, false, false,
790 handle_hot_attribute
, false },
791 { "no_address_safety_analysis",
792 0, 0, true, false, false,
793 handle_no_address_safety_analysis_attribute
,
795 { "no_sanitize_address", 0, 0, true, false, false,
796 handle_no_sanitize_address_attribute
,
798 { "no_sanitize_thread", 0, 0, true, false, false,
799 handle_no_sanitize_address_attribute
,
801 { "no_sanitize_undefined", 0, 0, true, false, false,
802 handle_no_sanitize_undefined_attribute
,
804 { "warning", 1, 1, true, false, false,
805 handle_error_attribute
, false },
806 { "error", 1, 1, true, false, false,
807 handle_error_attribute
, false },
808 { "target", 1, -1, true, false, false,
809 handle_target_attribute
, false },
810 { "target_clones", 1, -1, true, false, false,
811 handle_target_clones_attribute
, false },
812 { "optimize", 1, -1, true, false, false,
813 handle_optimize_attribute
, false },
814 /* For internal use only. The leading '*' both prevents its usage in
815 source code and signals that it may be overridden by machine tables. */
816 { "*tm regparm", 0, 0, false, true, true,
817 ignore_attribute
, false },
818 { "no_split_stack", 0, 0, true, false, false,
819 handle_no_split_stack_attribute
, false },
820 /* For internal use (marking of builtins and runtime functions) only.
821 The name contains space to prevent its usage in source code. */
822 { "fn spec", 1, 1, false, true, true,
823 handle_fnspec_attribute
, false },
824 { "warn_unused", 0, 0, false, false, false,
825 handle_warn_unused_attribute
, false },
826 { "returns_nonnull", 0, 0, false, true, true,
827 handle_returns_nonnull_attribute
, false },
828 { "omp declare simd", 0, -1, true, false, false,
829 handle_omp_declare_simd_attribute
, false },
830 { "cilk simd function", 0, -1, true, false, false,
831 handle_omp_declare_simd_attribute
, false },
832 { "simd", 0, 1, true, false, false,
833 handle_simd_attribute
, false },
834 { "omp declare target", 0, 0, true, false, false,
835 handle_omp_declare_target_attribute
, false },
836 { "omp declare target link", 0, 0, true, false, false,
837 handle_omp_declare_target_attribute
, false },
838 { "alloc_align", 1, 1, false, true, true,
839 handle_alloc_align_attribute
, false },
840 { "assume_aligned", 1, 2, false, true, true,
841 handle_assume_aligned_attribute
, false },
842 { "designated_init", 0, 0, false, true, false,
843 handle_designated_init_attribute
, false },
844 { "bnd_variable_size", 0, 0, true, false, false,
845 handle_bnd_variable_size_attribute
, false },
846 { "bnd_legacy", 0, 0, true, false, false,
847 handle_bnd_legacy
, false },
848 { "bnd_instrument", 0, 0, true, false, false,
849 handle_bnd_instrument
, false },
850 { NULL
, 0, 0, false, false, false, NULL
, false }
853 /* Give the specifications for the format attributes, used by C and all
856 All attributes referencing arguments should be additionally processed
857 in chkp_copy_function_type_adding_bounds for correct instrumentation
858 by Pointer Bounds Checker.
859 Current list of processed format attributes: format, format_arg. */
860 const struct attribute_spec c_common_format_attribute_table
[] =
862 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
863 affects_type_identity } */
864 { "format", 3, 3, false, true, true,
865 handle_format_attribute
, false },
866 { "format_arg", 1, 1, false, true, true,
867 handle_format_arg_attribute
, false },
868 { NULL
, 0, 0, false, false, false, NULL
, false }
871 /* Return identifier for address space AS. */
874 c_addr_space_name (addr_space_t as
)
876 int rid
= RID_FIRST_ADDR_SPACE
+ as
;
877 gcc_assert (ridpointers
[rid
]);
878 return IDENTIFIER_POINTER (ridpointers
[rid
]);
881 /* Push current bindings for the function name VAR_DECLS. */
884 start_fname_decls (void)
887 tree saved
= NULL_TREE
;
889 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
891 tree decl
= *fname_vars
[ix
].decl
;
895 saved
= tree_cons (decl
, build_int_cst (integer_type_node
, ix
),
897 *fname_vars
[ix
].decl
= NULL_TREE
;
900 if (saved
|| saved_function_name_decls
)
901 /* Normally they'll have been NULL, so only push if we've got a
902 stack, or they are non-NULL. */
903 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
904 saved_function_name_decls
);
907 /* Finish up the current bindings, adding them into the current function's
908 statement tree. This must be done _before_ finish_stmt_tree is called.
909 If there is no current function, we must be at file scope and no statements
910 are involved. Pop the previous bindings. */
913 finish_fname_decls (void)
916 tree stmts
= NULL_TREE
;
917 tree stack
= saved_function_name_decls
;
919 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
920 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
924 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
926 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
927 bodyp
= &BIND_EXPR_BODY (*bodyp
);
929 append_to_statement_list_force (*bodyp
, &stmts
);
933 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
934 *fname_vars
[ix
].decl
= NULL_TREE
;
938 /* We had saved values, restore them. */
941 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
943 tree decl
= TREE_PURPOSE (saved
);
944 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
946 *fname_vars
[ix
].decl
= decl
;
948 stack
= TREE_CHAIN (stack
);
950 saved_function_name_decls
= stack
;
953 /* Return the text name of the current function, suitably prettified
954 by PRETTY_P. Return string must be freed by caller. */
957 fname_as_string (int pretty_p
)
959 const char *name
= "top level";
962 cpp_string cstr
= { 0, 0 }, strname
;
970 if (current_function_decl
)
971 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
973 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
975 namep
= XNEWVEC (char, len
);
976 snprintf (namep
, len
, "\"%s\"", name
);
977 strname
.text
= (unsigned char *) namep
;
978 strname
.len
= len
- 1;
980 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
983 return (const char *) cstr
.text
;
989 /* Return the VAR_DECL for a const char array naming the current
990 function. If the VAR_DECL has not yet been created, create it
991 now. RID indicates how it should be formatted and IDENTIFIER_NODE
992 ID is its name (unfortunately C and C++ hold the RID values of
993 keywords in different places, so we can't derive RID from ID in
994 this language independent code. LOC is the location of the
998 fname_decl (location_t loc
, unsigned int rid
, tree id
)
1001 tree decl
= NULL_TREE
;
1003 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1004 if (fname_vars
[ix
].rid
== rid
)
1007 decl
= *fname_vars
[ix
].decl
;
1010 /* If a tree is built here, it would normally have the lineno of
1011 the current statement. Later this tree will be moved to the
1012 beginning of the function and this line number will be wrong.
1013 To avoid this problem set the lineno to 0 here; that prevents
1014 it from appearing in the RTL. */
1016 location_t saved_location
= input_location
;
1017 input_location
= UNKNOWN_LOCATION
;
1019 stmts
= push_stmt_list ();
1020 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
1021 stmts
= pop_stmt_list (stmts
);
1022 if (!IS_EMPTY_STMT (stmts
))
1023 saved_function_name_decls
1024 = tree_cons (decl
, stmts
, saved_function_name_decls
);
1025 *fname_vars
[ix
].decl
= decl
;
1026 input_location
= saved_location
;
1028 if (!ix
&& !current_function_decl
)
1029 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
1034 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1037 fix_string_type (tree value
)
1039 int length
= TREE_STRING_LENGTH (value
);
1041 tree e_type
, i_type
, a_type
;
1043 /* Compute the number of elements, for the array type. */
1044 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
1047 e_type
= char_type_node
;
1049 else if (TREE_TYPE (value
) == char16_array_type_node
)
1051 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
1052 e_type
= char16_type_node
;
1054 else if (TREE_TYPE (value
) == char32_array_type_node
)
1056 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
1057 e_type
= char32_type_node
;
1061 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
1062 e_type
= wchar_type_node
;
1065 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1066 limit in C++98 Annex B is very large (65536) and is not normative,
1067 so we do not diagnose it (warn_overlength_strings is forced off
1068 in c_common_post_options). */
1069 if (warn_overlength_strings
)
1071 const int nchars_max
= flag_isoc99
? 4095 : 509;
1072 const int relevant_std
= flag_isoc99
? 99 : 90;
1073 if (nchars
- 1 > nchars_max
)
1074 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1075 separate the %d from the 'C'. 'ISO' should not be
1076 translated, but it may be moved after 'C%d' in languages
1077 where modifiers follow nouns. */
1078 pedwarn (input_location
, OPT_Woverlength_strings
,
1079 "string length %qd is greater than the length %qd "
1080 "ISO C%d compilers are required to support",
1081 nchars
- 1, nchars_max
, relevant_std
);
1084 /* Create the array type for the string constant. The ISO C++
1085 standard says that a string literal has type `const char[N]' or
1086 `const wchar_t[N]'. We use the same logic when invoked as a C
1087 front-end with -Wwrite-strings.
1088 ??? We should change the type of an expression depending on the
1089 state of a warning flag. We should just be warning -- see how
1090 this is handled in the C++ front-end for the deprecated implicit
1091 conversion from string literals to `char*' or `wchar_t*'.
1093 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1094 array type being the unqualified version of that type.
1095 Therefore, if we are constructing an array of const char, we must
1096 construct the matching unqualified array type first. The C front
1097 end does not require this, but it does no harm, so we do it
1099 i_type
= build_index_type (size_int (nchars
- 1));
1100 a_type
= build_array_type (e_type
, i_type
);
1101 if (c_dialect_cxx() || warn_write_strings
)
1102 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
1104 TREE_TYPE (value
) = a_type
;
1105 TREE_CONSTANT (value
) = 1;
1106 TREE_READONLY (value
) = 1;
1107 TREE_STATIC (value
) = 1;
1111 /* Given a string of type STRING_TYPE, determine what kind of string
1112 token would give an equivalent execution encoding: CPP_STRING,
1113 CPP_STRING16, or CPP_STRING32. Return CPP_OTHER in case of error.
1114 This may not be exactly the string token type that initially created
1115 the string, since CPP_WSTRING is indistinguishable from the 16/32 bit
1116 string type at this point.
1118 This effectively reverses part of the logic in lex_string and
1121 static enum cpp_ttype
1122 get_cpp_ttype_from_string_type (tree string_type
)
1124 gcc_assert (string_type
);
1125 if (TREE_CODE (string_type
) != ARRAY_TYPE
)
1128 tree element_type
= TREE_TYPE (string_type
);
1129 if (TREE_CODE (element_type
) != INTEGER_TYPE
)
1132 int bits_per_character
= TYPE_PRECISION (element_type
);
1133 switch (bits_per_character
)
1136 return CPP_STRING
; /* It could have also been CPP_UTF8STRING. */
1138 return CPP_STRING16
;
1140 return CPP_STRING32
;
1146 /* The global record of string concatentations, for use in
1147 extracting locations within string literals. */
1149 GTY(()) string_concat_db
*g_string_concat_db
;
1151 /* Attempt to determine the source location of the substring.
1152 If successful, return NULL and write the source location to *OUT_LOC.
1153 Otherwise return an error message. Error messages are intended
1154 for GCC developers (to help debugging) rather than for end-users. */
1157 substring_loc::get_location (location_t
*out_loc
) const
1159 gcc_assert (out_loc
);
1161 enum cpp_ttype tok_type
= get_cpp_ttype_from_string_type (m_string_type
);
1162 if (tok_type
== CPP_OTHER
)
1163 return "unrecognized string type";
1165 return get_source_location_for_substring (parse_in
, g_string_concat_db
,
1166 m_fmt_string_loc
, tok_type
,
1167 m_caret_idx
, m_start_idx
, m_end_idx
,
1172 /* Fold X for consideration by one of the warning functions when checking
1173 whether an expression has a constant value. */
1176 fold_for_warn (tree x
)
1178 if (c_dialect_cxx ())
1179 return c_fully_fold (x
, /*for_init*/false, /*maybe_constp*/NULL
);
1181 /* The C front-end has already folded X appropriately. */
1185 /* Print a warning if a constant expression had overflow in folding.
1186 Invoke this function on every expression that the language
1187 requires to be a constant expression.
1188 Note the ANSI C standard says it is erroneous for a
1189 constant expression to overflow. */
1192 constant_expression_warning (tree value
)
1194 if (warn_overflow
&& pedantic
1195 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1196 || TREE_CODE (value
) == FIXED_CST
1197 || TREE_CODE (value
) == VECTOR_CST
1198 || TREE_CODE (value
) == COMPLEX_CST
)
1199 && TREE_OVERFLOW (value
))
1200 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1203 /* The same as above but print an unconditional error. */
1205 constant_expression_error (tree value
)
1207 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1208 || TREE_CODE (value
) == FIXED_CST
1209 || TREE_CODE (value
) == VECTOR_CST
1210 || TREE_CODE (value
) == COMPLEX_CST
)
1211 && TREE_OVERFLOW (value
))
1212 error ("overflow in constant expression");
1215 /* Print a warning if an expression had overflow in folding and its
1218 Invoke this function on every expression that
1219 (1) appears in the source code, and
1220 (2) is a constant expression that overflowed, and
1221 (3) is not already checked by convert_and_check;
1222 however, do not invoke this function on operands of explicit casts
1223 or when the expression is the result of an operator and any operand
1224 already overflowed. */
1227 overflow_warning (location_t loc
, tree value
)
1229 if (c_inhibit_evaluation_warnings
!= 0)
1232 switch (TREE_CODE (value
))
1235 warning_at (loc
, OPT_Woverflow
, "integer overflow in expression");
1239 warning_at (loc
, OPT_Woverflow
,
1240 "floating point overflow in expression");
1244 warning_at (loc
, OPT_Woverflow
, "fixed-point overflow in expression");
1248 warning_at (loc
, OPT_Woverflow
, "vector overflow in expression");
1252 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1253 warning_at (loc
, OPT_Woverflow
,
1254 "complex integer overflow in expression");
1255 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1256 warning_at (loc
, OPT_Woverflow
,
1257 "complex floating point overflow in expression");
1265 /* Warn about uses of logical || / && operator in a context where it
1266 is likely that the bitwise equivalent was intended by the
1267 programmer. We have seen an expression in which CODE is a binary
1268 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1269 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1271 warn_logical_operator (location_t location
, enum tree_code code
, tree type
,
1272 enum tree_code code_left
, tree op_left
,
1273 enum tree_code
ARG_UNUSED (code_right
), tree op_right
)
1275 int or_op
= (code
== TRUTH_ORIF_EXPR
|| code
== TRUTH_OR_EXPR
);
1276 int in0_p
, in1_p
, in_p
;
1277 tree low0
, low1
, low
, high0
, high1
, high
, lhs
, rhs
, tem
;
1278 bool strict_overflow_p
= false;
1280 if (code
!= TRUTH_ANDIF_EXPR
1281 && code
!= TRUTH_AND_EXPR
1282 && code
!= TRUTH_ORIF_EXPR
1283 && code
!= TRUTH_OR_EXPR
)
1286 /* We don't want to warn if either operand comes from a macro
1287 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1289 if (from_macro_expansion_at (EXPR_LOCATION (op_left
))
1290 || from_macro_expansion_at (EXPR_LOCATION (op_right
)))
1293 /* Warn if &&/|| are being used in a context where it is
1294 likely that the bitwise equivalent was intended by the
1295 programmer. That is, an expression such as op && MASK
1296 where op should not be any boolean expression, nor a
1297 constant, and mask seems to be a non-boolean integer constant. */
1298 if (TREE_CODE (op_right
) == CONST_DECL
)
1299 /* An enumerator counts as a constant. */
1300 op_right
= DECL_INITIAL (op_right
);
1301 if (!truth_value_p (code_left
)
1302 && INTEGRAL_TYPE_P (TREE_TYPE (op_left
))
1303 && !CONSTANT_CLASS_P (op_left
)
1304 && !TREE_NO_WARNING (op_left
)
1305 && TREE_CODE (op_right
) == INTEGER_CST
1306 && !integer_zerop (op_right
)
1307 && !integer_onep (op_right
))
1310 warning_at (location
, OPT_Wlogical_op
, "logical %<or%>"
1311 " applied to non-boolean constant");
1313 warning_at (location
, OPT_Wlogical_op
, "logical %<and%>"
1314 " applied to non-boolean constant");
1315 TREE_NO_WARNING (op_left
) = true;
1319 /* We do not warn for constants because they are typical of macro
1320 expansions that test for features. */
1321 if (CONSTANT_CLASS_P (fold_for_warn (op_left
))
1322 || CONSTANT_CLASS_P (fold_for_warn (op_right
)))
1325 /* This warning only makes sense with logical operands. */
1326 if (!(truth_value_p (TREE_CODE (op_left
))
1327 || INTEGRAL_TYPE_P (TREE_TYPE (op_left
)))
1328 || !(truth_value_p (TREE_CODE (op_right
))
1329 || INTEGRAL_TYPE_P (TREE_TYPE (op_right
))))
1332 /* The range computations only work with scalars. */
1333 if (VECTOR_TYPE_P (TREE_TYPE (op_left
))
1334 || VECTOR_TYPE_P (TREE_TYPE (op_right
)))
1337 /* We first test whether either side separately is trivially true
1338 (with OR) or trivially false (with AND). If so, do not warn.
1339 This is a common idiom for testing ranges of data types in
1341 lhs
= make_range (op_left
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
1344 if (TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
1345 lhs
= C_MAYBE_CONST_EXPR_EXPR (lhs
);
1347 /* If this is an OR operation, invert both sides; now, the result
1348 should be always false to get a warning. */
1352 tem
= build_range_check (UNKNOWN_LOCATION
, type
, lhs
, in0_p
, low0
, high0
);
1353 if (tem
&& integer_zerop (tem
))
1356 rhs
= make_range (op_right
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
1359 if (TREE_CODE (rhs
) == C_MAYBE_CONST_EXPR
)
1360 rhs
= C_MAYBE_CONST_EXPR_EXPR (rhs
);
1362 /* If this is an OR operation, invert both sides; now, the result
1363 should be always false to get a warning. */
1367 tem
= build_range_check (UNKNOWN_LOCATION
, type
, rhs
, in1_p
, low1
, high1
);
1368 if (tem
&& integer_zerop (tem
))
1371 /* If both expressions have the same operand, if we can merge the
1373 if (operand_equal_p (lhs
, rhs
, 0)
1374 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
1375 in1_p
, low1
, high1
))
1377 tem
= build_range_check (UNKNOWN_LOCATION
, type
, lhs
, in_p
, low
, high
);
1378 /* ... and if the range test is always false, then warn. */
1379 if (tem
&& integer_zerop (tem
))
1382 warning_at (location
, OPT_Wlogical_op
,
1383 "logical %<or%> of collectively exhaustive tests is "
1386 warning_at (location
, OPT_Wlogical_op
,
1387 "logical %<and%> of mutually exclusive tests is "
1390 /* Or warn if the operands have exactly the same range, e.g.
1392 else if (tree_int_cst_equal (low0
, low1
)
1393 && tree_int_cst_equal (high0
, high1
))
1396 warning_at (location
, OPT_Wlogical_op
,
1397 "logical %<or%> of equal expressions");
1399 warning_at (location
, OPT_Wlogical_op
,
1400 "logical %<and%> of equal expressions");
1405 /* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1406 with constant indices. */
1409 find_array_ref_with_const_idx_r (tree
*expr_p
, int *walk_subtrees
, void *data
)
1411 tree expr
= *expr_p
;
1413 if ((TREE_CODE (expr
) == ARRAY_REF
1414 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
1415 && TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
)
1417 *(bool *) data
= true;
1424 /* Warn if a self-comparison always evaluates to true or false. LOC
1425 is the location of the comparison with code CODE, LHS and RHS are
1426 operands of the comparison. */
1429 warn_tautological_cmp (location_t loc
, enum tree_code code
, tree lhs
, tree rhs
)
1431 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
1434 /* Don't warn for various macro expansions. */
1435 if (from_macro_expansion_at (loc
)
1436 || from_macro_expansion_at (EXPR_LOCATION (lhs
))
1437 || from_macro_expansion_at (EXPR_LOCATION (rhs
)))
1440 /* We do not warn for constants because they are typical of macro
1441 expansions that test for features, sizeof, and similar. */
1442 if (CONSTANT_CLASS_P (fold_for_warn (lhs
))
1443 || CONSTANT_CLASS_P (fold_for_warn (rhs
)))
1446 /* Don't warn for e.g.
1449 if (n == (long) n) ...
1451 if ((CONVERT_EXPR_P (lhs
) || TREE_CODE (lhs
) == NON_LVALUE_EXPR
)
1452 || (CONVERT_EXPR_P (rhs
) || TREE_CODE (rhs
) == NON_LVALUE_EXPR
))
1455 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1456 It could be a NaN, and NaN never compares equal to anything, even
1458 if (FLOAT_TYPE_P (TREE_TYPE (lhs
)) || FLOAT_TYPE_P (TREE_TYPE (rhs
)))
1461 if (operand_equal_p (lhs
, rhs
, 0))
1463 /* Don't warn about array references with constant indices;
1464 these are likely to come from a macro. */
1466 walk_tree_without_duplicates (&lhs
, find_array_ref_with_const_idx_r
,
1470 const bool always_true
= (code
== EQ_EXPR
|| code
== LE_EXPR
1471 || code
== GE_EXPR
|| code
== UNLE_EXPR
1472 || code
== UNGE_EXPR
|| code
== UNEQ_EXPR
);
1474 warning_at (loc
, OPT_Wtautological_compare
,
1475 "self-comparison always evaluates to true");
1477 warning_at (loc
, OPT_Wtautological_compare
,
1478 "self-comparison always evaluates to false");
1482 /* Warn about logical not used on the left hand side operand of a comparison.
1483 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1484 Do not warn if RHS is of a boolean type. */
1487 warn_logical_not_parentheses (location_t location
, enum tree_code code
,
1490 if (TREE_CODE_CLASS (code
) != tcc_comparison
1491 || TREE_TYPE (rhs
) == NULL_TREE
1492 || TREE_CODE (TREE_TYPE (rhs
)) == BOOLEAN_TYPE
)
1495 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1496 !(x == 0) or !(y != 0). */
1497 if ((code
== EQ_EXPR
|| code
== NE_EXPR
)
1498 && integer_zerop (rhs
))
1501 if (warning_at (location
, OPT_Wlogical_not_parentheses
,
1502 "logical not is only applied to the left hand side of "
1504 && EXPR_HAS_LOCATION (lhs
))
1506 location_t lhs_loc
= EXPR_LOCATION (lhs
);
1507 rich_location
richloc (line_table
, lhs_loc
);
1508 richloc
.add_fixit_insert (lhs_loc
, "(");
1509 location_t finish
= get_finish (lhs_loc
);
1511 = linemap_position_for_loc_and_offset (line_table
, finish
, 1);
1512 richloc
.add_fixit_insert (next_loc
, ")");
1513 inform_at_rich_loc (&richloc
, "add parentheses around left hand side "
1514 "expression to silence this warning");
1518 /* Warn if EXP contains any computations whose results are not used.
1519 Return true if a warning is printed; false otherwise. LOCUS is the
1520 (potential) location of the expression. */
1523 warn_if_unused_value (const_tree exp
, location_t locus
)
1526 if (TREE_USED (exp
) || TREE_NO_WARNING (exp
))
1529 /* Don't warn about void constructs. This includes casting to void,
1530 void function calls, and statement expressions with a final cast
1532 if (VOID_TYPE_P (TREE_TYPE (exp
)))
1535 if (EXPR_HAS_LOCATION (exp
))
1536 locus
= EXPR_LOCATION (exp
);
1538 switch (TREE_CODE (exp
))
1540 case PREINCREMENT_EXPR
:
1541 case POSTINCREMENT_EXPR
:
1542 case PREDECREMENT_EXPR
:
1543 case POSTDECREMENT_EXPR
:
1548 case TRY_CATCH_EXPR
:
1549 case WITH_CLEANUP_EXPR
:
1555 /* For a binding, warn if no side effect within it. */
1556 exp
= BIND_EXPR_BODY (exp
);
1560 case NON_LVALUE_EXPR
:
1562 exp
= TREE_OPERAND (exp
, 0);
1565 case TRUTH_ORIF_EXPR
:
1566 case TRUTH_ANDIF_EXPR
:
1567 /* In && or ||, warn if 2nd operand has no side effect. */
1568 exp
= TREE_OPERAND (exp
, 1);
1572 if (warn_if_unused_value (TREE_OPERAND (exp
, 0), locus
))
1574 /* Let people do `(foo (), 0)' without a warning. */
1575 if (TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
1577 exp
= TREE_OPERAND (exp
, 1);
1581 /* If this is an expression with side effects, don't warn; this
1582 case commonly appears in macro expansions. */
1583 if (TREE_SIDE_EFFECTS (exp
))
1588 /* Don't warn about automatic dereferencing of references, since
1589 the user cannot control it. */
1590 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
1592 exp
= TREE_OPERAND (exp
, 0);
1598 /* Referencing a volatile value is a side effect, so don't warn. */
1599 if ((DECL_P (exp
) || REFERENCE_CLASS_P (exp
))
1600 && TREE_THIS_VOLATILE (exp
))
1603 /* If this is an expression which has no operands, there is no value
1604 to be unused. There are no such language-independent codes,
1605 but front ends may define such. */
1606 if (EXPRESSION_CLASS_P (exp
) && TREE_OPERAND_LENGTH (exp
) == 0)
1610 return warning_at (locus
, OPT_Wunused_value
, "value computed is not used");
1615 /* Print a warning about casts that might indicate violation
1616 of strict aliasing rules if -Wstrict-aliasing is used and
1617 strict aliasing mode is in effect. OTYPE is the original
1618 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1621 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1623 /* Strip pointer conversion chains and get to the correct original type. */
1625 otype
= TREE_TYPE (expr
);
1627 if (!(flag_strict_aliasing
1628 && POINTER_TYPE_P (type
)
1629 && POINTER_TYPE_P (otype
)
1630 && !VOID_TYPE_P (TREE_TYPE (type
)))
1631 /* If the type we are casting to is a ref-all pointer
1632 dereferencing it is always valid. */
1633 || TYPE_REF_CAN_ALIAS_ALL (type
))
1636 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1637 && (DECL_P (TREE_OPERAND (expr
, 0))
1638 || handled_component_p (TREE_OPERAND (expr
, 0))))
1640 /* Casting the address of an object to non void pointer. Warn
1641 if the cast breaks type based aliasing. */
1642 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1644 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1645 "might break strict-aliasing rules");
1650 /* warn_strict_aliasing >= 3. This includes the default (3).
1651 Only warn if the cast is dereferenced immediately. */
1652 alias_set_type set1
=
1653 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1654 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1656 if (set1
!= set2
&& set2
!= 0
1658 || (!alias_set_subset_of (set2
, set1
)
1659 && !alias_sets_conflict_p (set1
, set2
))))
1661 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1662 "pointer will break strict-aliasing rules");
1665 else if (warn_strict_aliasing
== 2
1666 && !alias_sets_must_conflict_p (set1
, set2
))
1668 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1669 "pointer might break strict-aliasing rules");
1675 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1677 /* At this level, warn for any conversions, even if an address is
1678 not taken in the same statement. This will likely produce many
1679 false positives, but could be useful to pinpoint problems that
1680 are not revealed at higher levels. */
1681 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1682 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1683 if (!COMPLETE_TYPE_P (type
)
1684 || !alias_sets_must_conflict_p (set1
, set2
))
1686 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1687 "pointer might break strict-aliasing rules");
1695 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1696 sizeof as last operand of certain builtins. */
1699 sizeof_pointer_memaccess_warning (location_t
*sizeof_arg_loc
, tree callee
,
1700 vec
<tree
, va_gc
> *params
, tree
*sizeof_arg
,
1701 bool (*comp_types
) (tree
, tree
))
1703 tree type
, dest
= NULL_TREE
, src
= NULL_TREE
, tem
;
1704 bool strop
= false, cmp
= false;
1705 unsigned int idx
= ~0;
1708 if (TREE_CODE (callee
) != FUNCTION_DECL
1709 || DECL_BUILT_IN_CLASS (callee
) != BUILT_IN_NORMAL
1710 || vec_safe_length (params
) <= 1)
1713 switch (DECL_FUNCTION_CODE (callee
))
1715 case BUILT_IN_STRNCMP
:
1716 case BUILT_IN_STRNCASECMP
:
1719 case BUILT_IN_STRNCPY
:
1720 case BUILT_IN_STRNCPY_CHK
:
1721 case BUILT_IN_STRNCAT
:
1722 case BUILT_IN_STRNCAT_CHK
:
1723 case BUILT_IN_STPNCPY
:
1724 case BUILT_IN_STPNCPY_CHK
:
1727 case BUILT_IN_MEMCPY
:
1728 case BUILT_IN_MEMCPY_CHK
:
1729 case BUILT_IN_MEMMOVE
:
1730 case BUILT_IN_MEMMOVE_CHK
:
1731 if (params
->length () < 3)
1734 dest
= (*params
)[0];
1737 case BUILT_IN_BCOPY
:
1738 if (params
->length () < 3)
1741 dest
= (*params
)[1];
1744 case BUILT_IN_MEMCMP
:
1746 if (params
->length () < 3)
1749 dest
= (*params
)[0];
1753 case BUILT_IN_MEMSET
:
1754 case BUILT_IN_MEMSET_CHK
:
1755 if (params
->length () < 3)
1757 dest
= (*params
)[0];
1760 case BUILT_IN_BZERO
:
1761 dest
= (*params
)[0];
1764 case BUILT_IN_STRNDUP
:
1769 case BUILT_IN_MEMCHR
:
1770 if (params
->length () < 3)
1775 case BUILT_IN_SNPRINTF
:
1776 case BUILT_IN_SNPRINTF_CHK
:
1777 case BUILT_IN_VSNPRINTF
:
1778 case BUILT_IN_VSNPRINTF_CHK
:
1779 dest
= (*params
)[0];
1790 if (sizeof_arg
[idx
] == NULL
|| sizeof_arg
[idx
] == error_mark_node
)
1793 type
= TYPE_P (sizeof_arg
[idx
])
1794 ? sizeof_arg
[idx
] : TREE_TYPE (sizeof_arg
[idx
]);
1795 if (!POINTER_TYPE_P (type
))
1799 && (tem
= tree_strip_nop_conversions (dest
))
1800 && POINTER_TYPE_P (TREE_TYPE (tem
))
1801 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1805 && (tem
= tree_strip_nop_conversions (src
))
1806 && POINTER_TYPE_P (TREE_TYPE (tem
))
1807 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1810 loc
= sizeof_arg_loc
[idx
];
1814 if (!TYPE_P (sizeof_arg
[idx
])
1815 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1816 && comp_types (TREE_TYPE (dest
), type
))
1818 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1819 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1820 "argument to %<sizeof%> in %qD call is the same "
1821 "expression as the destination; did you mean to "
1822 "remove the addressof?", callee
);
1823 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1824 == TYPE_PRECISION (char_type_node
))
1826 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1827 "argument to %<sizeof%> in %qD call is the same "
1828 "expression as the destination; did you mean to "
1829 "provide an explicit length?", callee
);
1831 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1832 "argument to %<sizeof%> in %qD call is the same "
1833 "expression as the destination; did you mean to "
1834 "dereference it?", callee
);
1838 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1840 && comp_types (TREE_TYPE (dest
), type
)
1841 && !VOID_TYPE_P (TREE_TYPE (type
)))
1843 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1844 "argument to %<sizeof%> in %qD call is the same "
1845 "pointer type %qT as the destination; expected %qT "
1846 "or an explicit length", callee
, TREE_TYPE (dest
),
1847 TREE_TYPE (TREE_TYPE (dest
)));
1854 if (!TYPE_P (sizeof_arg
[idx
])
1855 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1856 && comp_types (TREE_TYPE (src
), type
))
1858 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1859 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1860 "argument to %<sizeof%> in %qD call is the same "
1861 "expression as the source; did you mean to "
1862 "remove the addressof?", callee
);
1863 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1864 == TYPE_PRECISION (char_type_node
))
1866 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1867 "argument to %<sizeof%> in %qD call is the same "
1868 "expression as the source; did you mean to "
1869 "provide an explicit length?", callee
);
1871 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1872 "argument to %<sizeof%> in %qD call is the same "
1873 "expression as the source; did you mean to "
1874 "dereference it?", callee
);
1878 if (POINTER_TYPE_P (TREE_TYPE (src
))
1880 && comp_types (TREE_TYPE (src
), type
)
1881 && !VOID_TYPE_P (TREE_TYPE (type
)))
1883 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1884 "argument to %<sizeof%> in %qD call is the same "
1885 "pointer type %qT as the source; expected %qT "
1886 "or an explicit length", callee
, TREE_TYPE (src
),
1887 TREE_TYPE (TREE_TYPE (src
)));
1894 if (!TYPE_P (sizeof_arg
[idx
])
1895 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1896 && comp_types (TREE_TYPE (dest
), type
))
1898 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1899 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1900 "argument to %<sizeof%> in %qD call is the same "
1901 "expression as the first source; did you mean to "
1902 "remove the addressof?", callee
);
1903 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1904 == TYPE_PRECISION (char_type_node
))
1906 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1907 "argument to %<sizeof%> in %qD call is the same "
1908 "expression as the first source; did you mean to "
1909 "provide an explicit length?", callee
);
1911 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1912 "argument to %<sizeof%> in %qD call is the same "
1913 "expression as the first source; did you mean to "
1914 "dereference it?", callee
);
1918 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1920 && comp_types (TREE_TYPE (dest
), type
)
1921 && !VOID_TYPE_P (TREE_TYPE (type
)))
1923 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1924 "argument to %<sizeof%> in %qD call is the same "
1925 "pointer type %qT as the first source; expected %qT "
1926 "or an explicit length", callee
, TREE_TYPE (dest
),
1927 TREE_TYPE (TREE_TYPE (dest
)));
1934 if (!TYPE_P (sizeof_arg
[idx
])
1935 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1936 && comp_types (TREE_TYPE (src
), type
))
1938 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1939 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1940 "argument to %<sizeof%> in %qD call is the same "
1941 "expression as the second source; did you mean to "
1942 "remove the addressof?", callee
);
1943 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1944 == TYPE_PRECISION (char_type_node
))
1946 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1947 "argument to %<sizeof%> in %qD call is the same "
1948 "expression as the second source; did you mean to "
1949 "provide an explicit length?", callee
);
1951 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1952 "argument to %<sizeof%> in %qD call is the same "
1953 "expression as the second source; did you mean to "
1954 "dereference it?", callee
);
1958 if (POINTER_TYPE_P (TREE_TYPE (src
))
1960 && comp_types (TREE_TYPE (src
), type
)
1961 && !VOID_TYPE_P (TREE_TYPE (type
)))
1963 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1964 "argument to %<sizeof%> in %qD call is the same "
1965 "pointer type %qT as the second source; expected %qT "
1966 "or an explicit length", callee
, TREE_TYPE (src
),
1967 TREE_TYPE (TREE_TYPE (src
)));
1974 /* Warn for unlikely, improbable, or stupid DECL declarations
1978 check_main_parameter_types (tree decl
)
1980 function_args_iterator iter
;
1984 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl
), type
, iter
)
1986 /* XXX void_type_node belies the abstraction. */
1987 if (type
== void_type_node
|| type
== error_mark_node
)
1991 if (TYPE_ATOMIC (t
))
1992 pedwarn (input_location
, OPT_Wmain
,
1993 "%<_Atomic%>-qualified parameter type %qT of %q+D",
1995 while (POINTER_TYPE_P (t
))
1998 if (TYPE_ATOMIC (t
))
1999 pedwarn (input_location
, OPT_Wmain
,
2000 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2008 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
2009 pedwarn (input_location
, OPT_Wmain
,
2010 "first argument of %q+D should be %<int%>", decl
);
2014 if (TREE_CODE (type
) != POINTER_TYPE
2015 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2016 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2018 pedwarn (input_location
, OPT_Wmain
,
2019 "second argument of %q+D should be %<char **%>", decl
);
2023 if (TREE_CODE (type
) != POINTER_TYPE
2024 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2025 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2027 pedwarn (input_location
, OPT_Wmain
,
2028 "third argument of %q+D should probably be "
2029 "%<char **%>", decl
);
2034 /* It is intentional that this message does not mention the third
2035 argument because it's only mentioned in an appendix of the
2037 if (argct
> 0 && (argct
< 2 || argct
> 3))
2038 pedwarn (input_location
, OPT_Wmain
,
2039 "%q+D takes only zero or two arguments", decl
);
2041 if (stdarg_p (TREE_TYPE (decl
)))
2042 pedwarn (input_location
, OPT_Wmain
,
2043 "%q+D declared as variadic function", decl
);
2046 /* vector_targets_convertible_p is used for vector pointer types. The
2047 callers perform various checks that the qualifiers are satisfactory,
2048 while OTOH vector_targets_convertible_p ignores the number of elements
2049 in the vectors. That's fine with vector pointers as we can consider,
2050 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2051 and that does not require and conversion of the pointer values.
2052 In contrast, vector_types_convertible_p and
2053 vector_types_compatible_elements_p are used for vector value types. */
2054 /* True if pointers to distinct types T1 and T2 can be converted to
2055 each other without an explicit cast. Only returns true for opaque
2058 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
2060 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
2061 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2062 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2068 /* vector_types_convertible_p is used for vector value types.
2069 It could in principle call vector_targets_convertible_p as a subroutine,
2070 but then the check for vector type would be duplicated with its callers,
2071 and also the purpose of vector_targets_convertible_p would become
2073 Where vector_types_convertible_p returns true, a conversion might still be
2074 needed to make the types match.
2075 In contrast, vector_targets_convertible_p is used for vector pointer
2076 values, and vector_types_compatible_elements_p is used specifically
2077 in the context for binary operators, as a check if use is possible without
2079 /* True if vector types T1 and T2 can be converted to each other
2080 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2081 can only be converted with -flax-vector-conversions yet that is not
2082 in effect, emit a note telling the user about that option if such
2083 a note has not previously been emitted. */
2085 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
2087 static bool emitted_lax_note
= false;
2088 bool convertible_lax
;
2090 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2091 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2095 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
2096 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
2097 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
2098 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
2099 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
2101 if (!convertible_lax
|| flag_lax_vector_conversions
)
2102 return convertible_lax
;
2104 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
2105 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2108 if (emit_lax_note
&& !emitted_lax_note
)
2110 emitted_lax_note
= true;
2111 inform (input_location
, "use -flax-vector-conversions to permit "
2112 "conversions between vectors with differing "
2113 "element types or numbers of subparts");
2119 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2120 and have vector types, V0 has the same type as V1, and the number of
2121 elements of V0, V1, MASK is the same.
2123 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2124 called with two arguments. In this case implementation passes the
2125 first argument twice in order to share the same tree code. This fact
2126 could enable the mask-values being twice the vector length. This is
2127 an implementation accident and this semantics is not guaranteed to
2130 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
2135 bool maybe_const
= false;
2136 bool two_arguments
= false;
2138 if (v1
== NULL_TREE
)
2140 two_arguments
= true;
2144 if (v0
== error_mark_node
|| v1
== error_mark_node
2145 || mask
== error_mark_node
)
2146 return error_mark_node
;
2148 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
2151 error_at (loc
, "__builtin_shuffle last argument must "
2152 "be an integer vector");
2153 return error_mark_node
;
2156 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
2157 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
2160 error_at (loc
, "__builtin_shuffle arguments must be vectors");
2161 return error_mark_node
;
2164 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
2167 error_at (loc
, "__builtin_shuffle argument vectors must be of "
2169 return error_mark_node
;
2172 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
2173 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
2174 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
2175 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
2178 error_at (loc
, "__builtin_shuffle number of elements of the "
2179 "argument vector(s) and the mask vector should "
2181 return error_mark_node
;
2184 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
2185 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
2188 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
2189 "must have the same size as inner type of the mask");
2190 return error_mark_node
;
2193 if (!c_dialect_cxx ())
2195 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2196 v0
= c_fully_fold (v0
, false, &maybe_const
);
2197 wrap
&= maybe_const
;
2200 v1
= v0
= save_expr (v0
);
2203 v1
= c_fully_fold (v1
, false, &maybe_const
);
2204 wrap
&= maybe_const
;
2207 mask
= c_fully_fold (mask
, false, &maybe_const
);
2208 wrap
&= maybe_const
;
2210 else if (two_arguments
)
2211 v1
= v0
= save_expr (v0
);
2213 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
2215 if (!c_dialect_cxx () && !wrap
)
2216 ret
= c_wrap_maybe_const (ret
, true);
2221 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2222 to integral type. */
2225 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
2227 op
= get_narrower (op
, unsignedp_ptr
);
2229 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
2230 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
2232 /* C++0x scoped enumerations don't implicitly convert to integral
2233 type; if we stripped an explicit conversion to a larger type we
2234 need to replace it so common_type will still work. */
2235 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
2236 TYPE_UNSIGNED (TREE_TYPE (op
)));
2237 op
= fold_convert (type
, op
);
2242 /* This is a helper function of build_binary_op.
2244 For certain operations if both args were extended from the same
2245 smaller type, do the arithmetic in that type and then extend.
2247 BITWISE indicates a bitwise operation.
2248 For them, this optimization is safe only if
2249 both args are zero-extended or both are sign-extended.
2250 Otherwise, we might change the result.
2251 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2252 but calculated in (unsigned short) it would be (unsigned short)-1.
2255 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
2257 int unsigned0
, unsigned1
;
2262 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2263 excessive narrowing when we call get_narrower below. For
2264 example, suppose that OP0 is of unsigned int extended
2265 from signed char and that RESULT_TYPE is long long int.
2266 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2269 (long long int) (unsigned int) signed_char
2271 which get_narrower would narrow down to
2273 (unsigned int) signed char
2275 If we do not cast OP0 first, get_narrower would return
2276 signed_char, which is inconsistent with the case of the
2278 op0
= convert (result_type
, op0
);
2279 op1
= convert (result_type
, op1
);
2281 arg0
= c_common_get_narrower (op0
, &unsigned0
);
2282 arg1
= c_common_get_narrower (op1
, &unsigned1
);
2284 /* UNS is 1 if the operation to be done is an unsigned one. */
2285 uns
= TYPE_UNSIGNED (result_type
);
2287 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2288 but it *requires* conversion to FINAL_TYPE. */
2290 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2291 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2292 && TREE_TYPE (op0
) != result_type
)
2293 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2294 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2295 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2296 && TREE_TYPE (op1
) != result_type
)
2297 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2299 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2301 /* For bitwise operations, signedness of nominal type
2302 does not matter. Consider only how operands were extended. */
2306 /* Note that in all three cases below we refrain from optimizing
2307 an unsigned operation on sign-extended args.
2308 That would not be valid. */
2310 /* Both args variable: if both extended in same way
2311 from same width, do it in that width.
2312 Do it unsigned if args were zero-extended. */
2313 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2314 < TYPE_PRECISION (result_type
))
2315 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2316 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2317 && unsigned0
== unsigned1
2318 && (unsigned0
|| !uns
))
2319 return c_common_signed_or_unsigned_type
2320 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2322 else if (TREE_CODE (arg0
) == INTEGER_CST
2323 && (unsigned1
|| !uns
)
2324 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2325 < TYPE_PRECISION (result_type
))
2327 = c_common_signed_or_unsigned_type (unsigned1
,
2329 && !POINTER_TYPE_P (type
)
2330 && int_fits_type_p (arg0
, type
))
2333 else if (TREE_CODE (arg1
) == INTEGER_CST
2334 && (unsigned0
|| !uns
)
2335 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2336 < TYPE_PRECISION (result_type
))
2338 = c_common_signed_or_unsigned_type (unsigned0
,
2340 && !POINTER_TYPE_P (type
)
2341 && int_fits_type_p (arg1
, type
))
2347 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2348 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2351 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
2353 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
2354 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
2355 REAL_VALUE_TYPE real_low_bound
=
2356 real_value_from_int_cst (0, type_low_bound
);
2357 REAL_VALUE_TYPE real_high_bound
=
2358 real_value_from_int_cst (0, type_high_bound
);
2360 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
2361 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
2364 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2365 to the complex/real/integer type TYPE. Function returns non-zero when:
2366 * EXPR is a constant which cannot be exactly converted to TYPE.
2367 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2368 for EXPR type and TYPE being both integers or both real, or both
2370 * EXPR is not a constant of complex type and TYPE is a real or
2372 * EXPR is not a constant of real type and TYPE is an integer.
2373 * EXPR is not a constant of integer type which cannot be
2374 exactly converted to real type.
2376 Function allows conversions between types of different signedness and
2377 can return SAFE_CONVERSION (zero) in that case. Function can produce
2378 signedness warnings if PRODUCE_WARNS is true.
2380 Function allows conversions from complex constants to non-complex types,
2381 provided that imaginary part is zero and real part can be safely converted
2384 enum conversion_safety
2385 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, bool produce_warns
)
2387 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
2388 tree expr_type
= TREE_TYPE (expr
);
2389 loc
= expansion_point_location_if_in_system_header (loc
);
2391 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
2393 /* If type is complex, we are interested in compatibility with
2395 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2396 type
= TREE_TYPE (type
);
2398 /* Warn for real constant that is not an exact integer converted
2400 if (TREE_CODE (expr_type
) == REAL_TYPE
2401 && TREE_CODE (type
) == INTEGER_TYPE
)
2403 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
2404 give_warning
= UNSAFE_REAL
;
2406 /* Warn for an integer constant that does not fit into integer type. */
2407 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2408 && TREE_CODE (type
) == INTEGER_TYPE
2409 && !int_fits_type_p (expr
, type
))
2411 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
2412 && tree_int_cst_sgn (expr
) < 0)
2415 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
2416 " implicitly converted to unsigned type");
2418 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
2421 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
2422 " constant value to negative integer");
2425 give_warning
= UNSAFE_OTHER
;
2427 else if (TREE_CODE (type
) == REAL_TYPE
)
2429 /* Warn for an integer constant that does not fit into real type. */
2430 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
2432 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
2433 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2434 give_warning
= UNSAFE_REAL
;
2436 /* Warn for a real constant that does not fit into a smaller
2438 else if (TREE_CODE (expr_type
) == REAL_TYPE
2439 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2441 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2442 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2443 give_warning
= UNSAFE_REAL
;
2448 else if (TREE_CODE (expr
) == COMPLEX_CST
)
2450 tree imag_part
= TREE_IMAGPART (expr
);
2451 /* Conversion from complex constant with zero imaginary part,
2452 perform check for conversion of real part. */
2453 if ((TREE_CODE (imag_part
) == REAL_CST
2454 && real_zerop (imag_part
))
2455 || (TREE_CODE (imag_part
) == INTEGER_CST
2456 && integer_zerop (imag_part
)))
2457 /* Note: in this branch we use recursive call to unsafe_conversion_p
2458 with different type of EXPR, but it is still safe, because when EXPR
2459 is a constant, it's type is not used in text of generated warnings
2460 (otherwise they could sound misleading). */
2461 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
2463 /* Conversion from complex constant with non-zero imaginary part. */
2466 /* Conversion to complex type.
2467 Perform checks for both real and imaginary parts. */
2468 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2470 /* Unfortunately, produce_warns must be false in two subsequent
2471 calls of unsafe_conversion_p, because otherwise we could
2472 produce strange "double" warnings, if both real and imaginary
2473 parts have conversion problems related to signedness.
2476 int32_t _Complex a = 0x80000000 + 0x80000000i;
2478 Possible solution: add a separate function for checking
2479 constants and combine result of two calls appropriately. */
2480 enum conversion_safety re_safety
=
2481 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), false);
2482 enum conversion_safety im_safety
=
2483 unsafe_conversion_p (loc
, type
, imag_part
, false);
2485 /* Merge the results into appropriate single warning. */
2487 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2488 if (re_safety
== im_safety
)
2489 give_warning
= re_safety
;
2490 else if (!re_safety
&& im_safety
)
2491 give_warning
= im_safety
;
2492 else if (re_safety
&& !im_safety
)
2493 give_warning
= re_safety
;
2495 give_warning
= UNSAFE_OTHER
;
2497 /* Warn about conversion from complex to real or integer type. */
2499 give_warning
= UNSAFE_IMAGINARY
;
2503 /* Checks for remaining case: EXPR is not constant. */
2506 /* Warn for real types converted to integer types. */
2507 if (TREE_CODE (expr_type
) == REAL_TYPE
2508 && TREE_CODE (type
) == INTEGER_TYPE
)
2509 give_warning
= UNSAFE_REAL
;
2511 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2512 && TREE_CODE (type
) == INTEGER_TYPE
)
2514 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2515 expr
= get_unwidened (expr
, 0);
2516 expr_type
= TREE_TYPE (expr
);
2518 /* Don't warn for short y; short x = ((int)y & 0xff); */
2519 if (TREE_CODE (expr
) == BIT_AND_EXPR
2520 || TREE_CODE (expr
) == BIT_IOR_EXPR
2521 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2523 /* If both args were extended from a shortest type,
2524 use that type if that is safe. */
2525 expr_type
= shorten_binary_op (expr_type
,
2526 TREE_OPERAND (expr
, 0),
2527 TREE_OPERAND (expr
, 1),
2530 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2532 tree op0
= TREE_OPERAND (expr
, 0);
2533 tree op1
= TREE_OPERAND (expr
, 1);
2534 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2535 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2537 /* If one of the operands is a non-negative constant
2538 that fits in the target type, then the type of the
2539 other operand does not matter. */
2540 if ((TREE_CODE (op0
) == INTEGER_CST
2541 && int_fits_type_p (op0
, c_common_signed_type (type
))
2542 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2543 || (TREE_CODE (op1
) == INTEGER_CST
2544 && int_fits_type_p (op1
, c_common_signed_type (type
))
2545 && int_fits_type_p (op1
,
2546 c_common_unsigned_type (type
))))
2547 return SAFE_CONVERSION
;
2548 /* If constant is unsigned and fits in the target
2549 type, then the result will also fit. */
2550 else if ((TREE_CODE (op0
) == INTEGER_CST
2552 && int_fits_type_p (op0
, type
))
2553 || (TREE_CODE (op1
) == INTEGER_CST
2555 && int_fits_type_p (op1
, type
)))
2556 return SAFE_CONVERSION
;
2559 /* Warn for integer types converted to smaller integer types. */
2560 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2561 give_warning
= UNSAFE_OTHER
;
2563 /* When they are the same width but different signedness,
2564 then the value may change. */
2565 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2566 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2567 /* Even when converted to a bigger type, if the type is
2568 unsigned but expr is signed, then negative values
2570 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2572 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
2573 "may change the sign of the result",
2577 /* Warn for integer types converted to real types if and only if
2578 all the range of values of the integer type cannot be
2579 represented by the real type. */
2580 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2581 && TREE_CODE (type
) == REAL_TYPE
)
2583 /* Don't warn about char y = 0xff; float x = (int) y; */
2584 expr
= get_unwidened (expr
, 0);
2585 expr_type
= TREE_TYPE (expr
);
2587 if (!int_safely_convertible_to_real_p (expr_type
, type
))
2588 give_warning
= UNSAFE_OTHER
;
2591 /* Warn for real types converted to smaller real types. */
2592 else if (TREE_CODE (expr_type
) == REAL_TYPE
2593 && TREE_CODE (type
) == REAL_TYPE
2594 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2595 give_warning
= UNSAFE_REAL
;
2597 /* Check conversion between two complex types. */
2598 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2599 && TREE_CODE (type
) == COMPLEX_TYPE
)
2601 /* Extract underlying types (i.e., type of real and imaginary
2602 parts) of expr_type and type. */
2603 tree from_type
= TREE_TYPE (expr_type
);
2604 tree to_type
= TREE_TYPE (type
);
2606 /* Warn for real types converted to integer types. */
2607 if (TREE_CODE (from_type
) == REAL_TYPE
2608 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2609 give_warning
= UNSAFE_REAL
;
2611 /* Warn for real types converted to smaller real types. */
2612 else if (TREE_CODE (from_type
) == REAL_TYPE
2613 && TREE_CODE (to_type
) == REAL_TYPE
2614 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2615 give_warning
= UNSAFE_REAL
;
2617 /* Check conversion for complex integer types. Here implementation
2618 is simpler than for real-domain integers because it does not
2619 involve sophisticated cases, such as bitmasks, casts, etc. */
2620 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2621 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2623 /* Warn for integer types converted to smaller integer types. */
2624 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2625 give_warning
= UNSAFE_OTHER
;
2627 /* Check for different signedness, see case for real-domain
2628 integers (above) for a more detailed comment. */
2629 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
2630 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
2631 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
2633 warning_at (loc
, OPT_Wsign_conversion
,
2634 "conversion to %qT from %qT "
2635 "may change the sign of the result",
2638 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2639 && TREE_CODE (to_type
) == REAL_TYPE
2640 && !int_safely_convertible_to_real_p (from_type
, to_type
))
2641 give_warning
= UNSAFE_OTHER
;
2644 /* Warn for complex types converted to real or integer types. */
2645 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2646 && TREE_CODE (type
) != COMPLEX_TYPE
)
2647 give_warning
= UNSAFE_IMAGINARY
;
2650 return give_warning
;
2653 /* Warns if the conversion of EXPR to TYPE may alter a value.
2654 This is a helper function for warnings_for_convert_and_check. */
2657 conversion_warning (location_t loc
, tree type
, tree expr
)
2659 tree expr_type
= TREE_TYPE (expr
);
2660 enum conversion_safety conversion_kind
;
2662 if (!warn_conversion
&& !warn_sign_conversion
&& !warn_float_conversion
)
2665 /* This may happen, because for LHS op= RHS we preevaluate
2666 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2667 means we could no longer see the code of the EXPR. */
2668 if (TREE_CODE (expr
) == C_MAYBE_CONST_EXPR
)
2669 expr
= C_MAYBE_CONST_EXPR_EXPR (expr
);
2670 if (TREE_CODE (expr
) == SAVE_EXPR
)
2671 expr
= TREE_OPERAND (expr
, 0);
2673 switch (TREE_CODE (expr
))
2681 case TRUTH_ANDIF_EXPR
:
2682 case TRUTH_ORIF_EXPR
:
2683 case TRUTH_AND_EXPR
:
2685 case TRUTH_XOR_EXPR
:
2686 case TRUTH_NOT_EXPR
:
2687 /* Conversion from boolean to a signed:1 bit-field (which only
2688 can hold the values 0 and -1) doesn't lose information - but
2689 it does change the value. */
2690 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2691 warning_at (loc
, OPT_Wconversion
,
2692 "conversion to %qT from boolean expression", type
);
2698 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2699 if (conversion_kind
== UNSAFE_REAL
)
2700 warning_at (loc
, OPT_Wfloat_conversion
,
2701 "conversion to %qT alters %qT constant value",
2703 else if (conversion_kind
)
2704 warning_at (loc
, OPT_Wconversion
,
2705 "conversion to %qT alters %qT constant value",
2711 /* In case of COND_EXPR, we do not care about the type of
2712 COND_EXPR, only about the conversion of each operand. */
2713 tree op1
= TREE_OPERAND (expr
, 1);
2714 tree op2
= TREE_OPERAND (expr
, 2);
2716 conversion_warning (loc
, type
, op1
);
2717 conversion_warning (loc
, type
, op2
);
2721 default: /* 'expr' is not a constant. */
2722 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2723 if (conversion_kind
== UNSAFE_REAL
)
2724 warning_at (loc
, OPT_Wfloat_conversion
,
2725 "conversion to %qT from %qT may alter its value",
2727 else if (conversion_kind
== UNSAFE_IMAGINARY
)
2728 warning_at (loc
, OPT_Wconversion
,
2729 "conversion to %qT from %qT discards imaginary component",
2731 else if (conversion_kind
)
2732 warning_at (loc
, OPT_Wconversion
,
2733 "conversion to %qT from %qT may alter its value",
2738 /* Produce warnings after a conversion. RESULT is the result of
2739 converting EXPR to TYPE. This is a helper function for
2740 convert_and_check and cp_convert_and_check. */
2743 warnings_for_convert_and_check (location_t loc
, tree type
, tree expr
,
2746 loc
= expansion_point_location_if_in_system_header (loc
);
2748 if (TREE_CODE (expr
) == INTEGER_CST
2749 && (TREE_CODE (type
) == INTEGER_TYPE
2750 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2751 && !int_fits_type_p (expr
, type
))
2753 /* Do not diagnose overflow in a constant expression merely
2754 because a conversion overflowed. */
2755 if (TREE_OVERFLOW (result
))
2756 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2758 if (TYPE_UNSIGNED (type
))
2760 /* This detects cases like converting -129 or 256 to
2762 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2763 warning_at (loc
, OPT_Woverflow
,
2764 "large integer implicitly truncated to unsigned type");
2766 conversion_warning (loc
, type
, expr
);
2768 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2769 warning_at (loc
, OPT_Woverflow
,
2770 "overflow in implicit constant conversion");
2771 /* No warning for converting 0x80000000 to int. */
2773 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2774 || TYPE_PRECISION (TREE_TYPE (expr
))
2775 != TYPE_PRECISION (type
)))
2776 warning_at (loc
, OPT_Woverflow
,
2777 "overflow in implicit constant conversion");
2780 conversion_warning (loc
, type
, expr
);
2782 else if ((TREE_CODE (result
) == INTEGER_CST
2783 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2784 warning_at (loc
, OPT_Woverflow
,
2785 "overflow in implicit constant conversion");
2787 conversion_warning (loc
, type
, expr
);
2791 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2792 Invoke this function on every expression that is converted implicitly,
2793 i.e. because of language rules and not because of an explicit cast. */
2796 convert_and_check (location_t loc
, tree type
, tree expr
)
2799 tree expr_for_warning
;
2801 /* Convert from a value with possible excess precision rather than
2802 via the semantic type, but do not warn about values not fitting
2803 exactly in the semantic type. */
2804 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2806 tree orig_type
= TREE_TYPE (expr
);
2807 expr
= TREE_OPERAND (expr
, 0);
2808 expr_for_warning
= convert (orig_type
, expr
);
2809 if (orig_type
== type
)
2810 return expr_for_warning
;
2813 expr_for_warning
= expr
;
2815 if (TREE_TYPE (expr
) == type
)
2818 result
= convert (type
, expr
);
2820 if (c_inhibit_evaluation_warnings
== 0
2821 && !TREE_OVERFLOW_P (expr
)
2822 && result
!= error_mark_node
)
2823 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
2828 /* A node in a list that describes references to variables (EXPR), which are
2829 either read accesses if WRITER is zero, or write accesses, in which case
2830 WRITER is the parent of EXPR. */
2837 /* Used to implement a cache the results of a call to verify_tree. We only
2838 use this for SAVE_EXPRs. */
2841 struct tlist_cache
*next
;
2842 struct tlist
*cache_before_sp
;
2843 struct tlist
*cache_after_sp
;
2847 /* Obstack to use when allocating tlist structures, and corresponding
2849 static struct obstack tlist_obstack
;
2850 static char *tlist_firstobj
= 0;
2852 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2854 static struct tlist
*warned_ids
;
2855 /* SAVE_EXPRs need special treatment. We process them only once and then
2856 cache the results. */
2857 static struct tlist_cache
*save_expr_cache
;
2859 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2860 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2861 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2862 static int warning_candidate_p (tree
);
2863 static bool candidate_equal_p (const_tree
, const_tree
);
2864 static void warn_for_collisions (struct tlist
*);
2865 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2866 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2868 /* Create a new struct tlist and fill in its fields. */
2869 static struct tlist
*
2870 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2873 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2880 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2881 is nonnull, we ignore any node we find which has a writer equal to it. */
2884 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2888 struct tlist
*next
= add
->next
;
2891 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2892 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2897 /* Merge the nodes of ADD into TO. This merging process is done so that for
2898 each variable that already exists in TO, no new node is added; however if
2899 there is a write access recorded in ADD, and an occurrence on TO is only
2900 a read access, then the occurrence in TO will be modified to record the
2904 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2906 struct tlist
**end
= to
;
2909 end
= &(*end
)->next
;
2915 struct tlist
*next
= add
->next
;
2917 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2918 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2922 tmp2
->writer
= add
->writer
;
2926 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
2927 end
= &(*end
)->next
;
2934 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2935 references in list LIST conflict with it, excluding reads if ONLY writers
2939 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2944 /* Avoid duplicate warnings. */
2945 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2946 if (candidate_equal_p (tmp
->expr
, written
))
2951 if (candidate_equal_p (list
->expr
, written
)
2952 && !candidate_equal_p (list
->writer
, writer
)
2953 && (!only_writes
|| list
->writer
))
2955 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2956 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
2957 OPT_Wsequence_point
, "operation on %qE may be undefined",
2964 /* Given a list LIST of references to variables, find whether any of these
2965 can cause conflicts due to missing sequence points. */
2968 warn_for_collisions (struct tlist
*list
)
2972 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
2975 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
2979 /* Return nonzero if X is a tree that can be verified by the sequence point
2982 warning_candidate_p (tree x
)
2984 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
2987 if (TREE_CODE (x
) == BLOCK
)
2990 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2991 (lvalue_p) crash on TRY/CATCH. */
2992 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
2998 /* No point to track non-const calls, they will never satisfy
3000 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
3003 if (TREE_CODE (x
) == STRING_CST
)
3009 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3011 candidate_equal_p (const_tree x
, const_tree y
)
3013 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
3016 /* Walk the tree X, and record accesses to variables. If X is written by the
3017 parent tree, WRITER is the parent.
3018 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3019 expression or its only operand forces a sequence point, then everything up
3020 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3022 Once we return, we will have emitted warnings if any subexpression before
3023 such a sequence point could be undefined. On a higher level, however, the
3024 sequence point may not be relevant, and we'll merge the two lists.
3026 Example: (b++, a) + b;
3027 The call that processes the COMPOUND_EXPR will store the increment of B
3028 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3029 processes the PLUS_EXPR will need to merge the two lists so that
3030 eventually, all accesses end up on the same list (and we'll warn about the
3031 unordered subexpressions b++ and b.
3033 A note on merging. If we modify the former example so that our expression
3036 care must be taken not simply to add all three expressions into the final
3037 PNO_SP list. The function merge_tlist takes care of that by merging the
3038 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3039 way, so that no more than one access to B is recorded. */
3042 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
3045 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
3046 enum tree_code code
;
3047 enum tree_code_class cl
;
3049 /* X may be NULL if it is the operand of an empty statement expression
3055 code
= TREE_CODE (x
);
3056 cl
= TREE_CODE_CLASS (code
);
3058 if (warning_candidate_p (x
))
3059 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
3068 case TRUTH_ANDIF_EXPR
:
3069 case TRUTH_ORIF_EXPR
:
3070 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
3071 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3072 warn_for_collisions (tmp_nosp
);
3073 merge_tlist (pbefore_sp
, tmp_before
, 0);
3074 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
3075 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3076 warn_for_collisions (tmp_list2
);
3077 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3078 merge_tlist (pno_sp
, tmp_list2
, 0);
3082 tmp_before
= tmp_list2
= 0;
3083 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
3084 warn_for_collisions (tmp_list2
);
3085 merge_tlist (pbefore_sp
, tmp_before
, 0);
3086 merge_tlist (pbefore_sp
, tmp_list2
, 0);
3088 tmp_list3
= tmp_nosp
= 0;
3089 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
3090 warn_for_collisions (tmp_nosp
);
3091 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3093 tmp_list3
= tmp_list2
= 0;
3094 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3095 warn_for_collisions (tmp_list2
);
3096 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3097 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3098 two first, to avoid warning for (a ? b++ : b++). */
3099 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
3100 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3103 case PREDECREMENT_EXPR
:
3104 case PREINCREMENT_EXPR
:
3105 case POSTDECREMENT_EXPR
:
3106 case POSTINCREMENT_EXPR
:
3107 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
3111 tmp_before
= tmp_nosp
= tmp_list3
= 0;
3112 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3113 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
3114 /* Expressions inside the LHS are not ordered wrt. the sequence points
3115 in the RHS. Example:
3117 Despite the fact that the modification of "a" is in the before_sp
3118 list (tmp_before), it conflicts with the use of "a" in the LHS.
3119 We can handle this by adding the contents of tmp_list3
3120 to those of tmp_before, and redoing the collision warnings for that
3122 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
3123 warn_for_collisions (tmp_before
);
3124 /* Exclude the LHS itself here; we first have to merge it into the
3125 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3126 didn't exclude the LHS, we'd get it twice, once as a read and once
3128 add_tlist (pno_sp
, tmp_list3
, x
, 0);
3129 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
3131 merge_tlist (pbefore_sp
, tmp_before
, 0);
3132 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
3133 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
3134 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
3138 /* We need to warn about conflicts among arguments and conflicts between
3139 args and the function address. Side effects of the function address,
3140 however, are not ordered by the sequence point of the call. */
3142 call_expr_arg_iterator iter
;
3144 tmp_before
= tmp_nosp
= 0;
3145 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3146 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
3148 tmp_list2
= tmp_list3
= 0;
3149 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
3150 merge_tlist (&tmp_list3
, tmp_list2
, 0);
3151 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
3153 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
3154 warn_for_collisions (tmp_before
);
3155 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
3160 /* Scan all the list, e.g. indices of multi dimensional array. */
3163 tmp_before
= tmp_nosp
= 0;
3164 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3165 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3166 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3173 struct tlist_cache
*t
;
3174 for (t
= save_expr_cache
; t
; t
= t
->next
)
3175 if (candidate_equal_p (t
->expr
, x
))
3180 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
3181 t
->next
= save_expr_cache
;
3183 save_expr_cache
= t
;
3185 tmp_before
= tmp_nosp
= 0;
3186 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3187 warn_for_collisions (tmp_nosp
);
3190 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
3191 t
->cache_before_sp
= tmp_before
;
3192 t
->cache_after_sp
= tmp_list3
;
3194 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
3195 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
3200 x
= TREE_OPERAND (x
, 0);
3207 /* For other expressions, simply recurse on their operands.
3208 Manual tail recursion for unary expressions.
3209 Other non-expressions need not be processed. */
3210 if (cl
== tcc_unary
)
3212 x
= TREE_OPERAND (x
, 0);
3216 else if (IS_EXPR_CODE_CLASS (cl
))
3219 int max
= TREE_OPERAND_LENGTH (x
);
3220 for (lp
= 0; lp
< max
; lp
++)
3222 tmp_before
= tmp_nosp
= 0;
3223 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
3224 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3225 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3232 /* Try to warn for undefined behavior in EXPR due to missing sequence
3236 verify_sequence_points (tree expr
)
3238 struct tlist
*before_sp
= 0, *after_sp
= 0;
3241 save_expr_cache
= 0;
3242 if (tlist_firstobj
== 0)
3244 gcc_obstack_init (&tlist_obstack
);
3245 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
3248 verify_tree (expr
, &before_sp
, &after_sp
, 0);
3249 warn_for_collisions (after_sp
);
3250 obstack_free (&tlist_obstack
, tlist_firstobj
);
3253 /* Validate the expression after `case' and apply default promotions. */
3256 check_case_value (location_t loc
, tree value
)
3258 if (value
== NULL_TREE
)
3261 if (TREE_CODE (value
) == INTEGER_CST
)
3262 /* Promote char or short to int. */
3263 value
= perform_integral_promotions (value
);
3264 else if (value
!= error_mark_node
)
3266 error_at (loc
, "case label does not reduce to an integer constant");
3267 value
= error_mark_node
;
3270 constant_expression_warning (value
);
3275 /* See if the case values LOW and HIGH are in the range of the original
3276 type (i.e. before the default conversion to int) of the switch testing
3278 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3279 the type before promoting it. CASE_LOW_P is a pointer to the lower
3280 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3281 if the case is not a case range.
3282 The caller has to make sure that we are not called with NULL for
3283 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3284 was a case value that doesn't fit into the range of the ORIG_TYPE.
3285 Returns true if the case label is in range of ORIG_TYPE (saturated or
3286 untouched) or false if the label is out of range. */
3289 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
3290 tree
*case_low_p
, tree
*case_high_p
,
3291 bool *outside_range_p
)
3293 tree min_value
, max_value
;
3294 tree case_low
= *case_low_p
;
3295 tree case_high
= case_high_p
? *case_high_p
: case_low
;
3297 /* If there was a problem with the original type, do nothing. */
3298 if (orig_type
== error_mark_node
)
3301 min_value
= TYPE_MIN_VALUE (orig_type
);
3302 max_value
= TYPE_MAX_VALUE (orig_type
);
3304 /* We'll really need integer constants here. */
3305 case_low
= fold (case_low
);
3306 case_high
= fold (case_high
);
3308 /* Case label is less than minimum for type. */
3309 if (tree_int_cst_compare (case_low
, min_value
) < 0
3310 && tree_int_cst_compare (case_high
, min_value
) < 0)
3312 warning_at (loc
, 0, "case label value is less than minimum value "
3314 *outside_range_p
= true;
3318 /* Case value is greater than maximum for type. */
3319 if (tree_int_cst_compare (case_low
, max_value
) > 0
3320 && tree_int_cst_compare (case_high
, max_value
) > 0)
3322 warning_at (loc
, 0, "case label value exceeds maximum value for type");
3323 *outside_range_p
= true;
3327 /* Saturate lower case label value to minimum. */
3328 if (tree_int_cst_compare (case_high
, min_value
) >= 0
3329 && tree_int_cst_compare (case_low
, min_value
) < 0)
3331 warning_at (loc
, 0, "lower value in case label range"
3332 " less than minimum value for type");
3333 *outside_range_p
= true;
3334 case_low
= min_value
;
3337 /* Saturate upper case label value to maximum. */
3338 if (tree_int_cst_compare (case_low
, max_value
) <= 0
3339 && tree_int_cst_compare (case_high
, max_value
) > 0)
3341 warning_at (loc
, 0, "upper value in case label range"
3342 " exceeds maximum value for type");
3343 *outside_range_p
= true;
3344 case_high
= max_value
;
3347 if (*case_low_p
!= case_low
)
3348 *case_low_p
= convert (type
, case_low
);
3349 if (case_high_p
&& *case_high_p
!= case_high
)
3350 *case_high_p
= convert (type
, case_high
);
3355 /* Return an integer type with BITS bits of precision,
3356 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3359 c_common_type_for_size (unsigned int bits
, int unsignedp
)
3363 if (bits
== TYPE_PRECISION (integer_type_node
))
3364 return unsignedp
? unsigned_type_node
: integer_type_node
;
3366 if (bits
== TYPE_PRECISION (signed_char_type_node
))
3367 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3369 if (bits
== TYPE_PRECISION (short_integer_type_node
))
3370 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3372 if (bits
== TYPE_PRECISION (long_integer_type_node
))
3373 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3375 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
3376 return (unsignedp
? long_long_unsigned_type_node
3377 : long_long_integer_type_node
);
3379 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3380 if (int_n_enabled_p
[i
]
3381 && bits
== int_n_data
[i
].bitsize
)
3382 return (unsignedp
? int_n_trees
[i
].unsigned_type
3383 : int_n_trees
[i
].signed_type
);
3385 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
3386 return (unsignedp
? widest_unsigned_literal_type_node
3387 : widest_integer_literal_type_node
);
3389 if (bits
<= TYPE_PRECISION (intQI_type_node
))
3390 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3392 if (bits
<= TYPE_PRECISION (intHI_type_node
))
3393 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3395 if (bits
<= TYPE_PRECISION (intSI_type_node
))
3396 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3398 if (bits
<= TYPE_PRECISION (intDI_type_node
))
3399 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3404 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3405 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3406 and saturating if SATP is nonzero, otherwise not saturating. */
3409 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
3410 int unsignedp
, int satp
)
3414 mode
= unsignedp
? UQQmode
: QQmode
;
3416 mode
= unsignedp
? UHAmode
: HAmode
;
3418 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
3419 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
3422 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
3424 sorry ("GCC cannot support operators with integer types and "
3425 "fixed-point types that have too many integral and "
3426 "fractional bits together");
3430 return c_common_type_for_mode (mode
, satp
);
3433 /* Used for communication between c_common_type_for_mode and
3434 c_register_builtin_type. */
3435 tree registered_builtin_types
;
3437 /* Return a data type that has machine mode MODE.
3438 If the mode is an integer,
3439 then UNSIGNEDP selects between signed and unsigned types.
3440 If the mode is a fixed-point mode,
3441 then UNSIGNEDP selects between saturating and nonsaturating types. */
3444 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
3449 if (mode
== TYPE_MODE (integer_type_node
))
3450 return unsignedp
? unsigned_type_node
: integer_type_node
;
3452 if (mode
== TYPE_MODE (signed_char_type_node
))
3453 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3455 if (mode
== TYPE_MODE (short_integer_type_node
))
3456 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3458 if (mode
== TYPE_MODE (long_integer_type_node
))
3459 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3461 if (mode
== TYPE_MODE (long_long_integer_type_node
))
3462 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3464 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3465 if (int_n_enabled_p
[i
]
3466 && mode
== int_n_data
[i
].m
)
3467 return (unsignedp
? int_n_trees
[i
].unsigned_type
3468 : int_n_trees
[i
].signed_type
);
3470 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
3471 return unsignedp
? widest_unsigned_literal_type_node
3472 : widest_integer_literal_type_node
;
3475 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3478 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3481 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3484 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3486 #if HOST_BITS_PER_WIDE_INT >= 64
3487 if (mode
== TYPE_MODE (intTI_type_node
))
3488 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3491 if (mode
== TYPE_MODE (float_type_node
))
3492 return float_type_node
;
3494 if (mode
== TYPE_MODE (double_type_node
))
3495 return double_type_node
;
3497 if (mode
== TYPE_MODE (long_double_type_node
))
3498 return long_double_type_node
;
3500 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3501 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3502 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
3503 return FLOATN_NX_TYPE_NODE (i
);
3505 if (mode
== TYPE_MODE (void_type_node
))
3506 return void_type_node
;
3508 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
3510 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3511 : make_signed_type (GET_MODE_PRECISION (mode
)));
3513 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
3515 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3516 : make_signed_type (GET_MODE_PRECISION (mode
)));
3518 if (COMPLEX_MODE_P (mode
))
3520 machine_mode inner_mode
;
3523 if (mode
== TYPE_MODE (complex_float_type_node
))
3524 return complex_float_type_node
;
3525 if (mode
== TYPE_MODE (complex_double_type_node
))
3526 return complex_double_type_node
;
3527 if (mode
== TYPE_MODE (complex_long_double_type_node
))
3528 return complex_long_double_type_node
;
3530 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3531 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3532 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
3533 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
3535 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
3536 return complex_integer_type_node
;
3538 inner_mode
= GET_MODE_INNER (mode
);
3539 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3540 if (inner_type
!= NULL_TREE
)
3541 return build_complex_type (inner_type
);
3543 else if (VECTOR_MODE_P (mode
))
3545 machine_mode inner_mode
= GET_MODE_INNER (mode
);
3546 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3547 if (inner_type
!= NULL_TREE
)
3548 return build_vector_type_for_mode (inner_type
, mode
);
3551 if (mode
== TYPE_MODE (dfloat32_type_node
))
3552 return dfloat32_type_node
;
3553 if (mode
== TYPE_MODE (dfloat64_type_node
))
3554 return dfloat64_type_node
;
3555 if (mode
== TYPE_MODE (dfloat128_type_node
))
3556 return dfloat128_type_node
;
3558 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
3560 if (mode
== TYPE_MODE (short_fract_type_node
))
3561 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
3562 if (mode
== TYPE_MODE (fract_type_node
))
3563 return unsignedp
? sat_fract_type_node
: fract_type_node
;
3564 if (mode
== TYPE_MODE (long_fract_type_node
))
3565 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
3566 if (mode
== TYPE_MODE (long_long_fract_type_node
))
3567 return unsignedp
? sat_long_long_fract_type_node
3568 : long_long_fract_type_node
;
3570 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
3571 return unsignedp
? sat_unsigned_short_fract_type_node
3572 : unsigned_short_fract_type_node
;
3573 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
3574 return unsignedp
? sat_unsigned_fract_type_node
3575 : unsigned_fract_type_node
;
3576 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
3577 return unsignedp
? sat_unsigned_long_fract_type_node
3578 : unsigned_long_fract_type_node
;
3579 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
3580 return unsignedp
? sat_unsigned_long_long_fract_type_node
3581 : unsigned_long_long_fract_type_node
;
3583 if (mode
== TYPE_MODE (short_accum_type_node
))
3584 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3585 if (mode
== TYPE_MODE (accum_type_node
))
3586 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3587 if (mode
== TYPE_MODE (long_accum_type_node
))
3588 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3589 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3590 return unsignedp
? sat_long_long_accum_type_node
3591 : long_long_accum_type_node
;
3593 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3594 return unsignedp
? sat_unsigned_short_accum_type_node
3595 : unsigned_short_accum_type_node
;
3596 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3597 return unsignedp
? sat_unsigned_accum_type_node
3598 : unsigned_accum_type_node
;
3599 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3600 return unsignedp
? sat_unsigned_long_accum_type_node
3601 : unsigned_long_accum_type_node
;
3602 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3603 return unsignedp
? sat_unsigned_long_long_accum_type_node
3604 : unsigned_long_long_accum_type_node
;
3607 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3609 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3611 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3613 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3615 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3617 if (mode
== UQQmode
)
3618 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3619 if (mode
== UHQmode
)
3620 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3621 if (mode
== USQmode
)
3622 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3623 if (mode
== UDQmode
)
3624 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3625 if (mode
== UTQmode
)
3626 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3629 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3631 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3633 return unsignedp
? sat_da_type_node
: da_type_node
;
3635 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3637 if (mode
== UHAmode
)
3638 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3639 if (mode
== USAmode
)
3640 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3641 if (mode
== UDAmode
)
3642 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3643 if (mode
== UTAmode
)
3644 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3647 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3648 if (TYPE_MODE (TREE_VALUE (t
)) == mode
3649 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
3650 return TREE_VALUE (t
);
3656 c_common_unsigned_type (tree type
)
3658 return c_common_signed_or_unsigned_type (1, type
);
3661 /* Return a signed type the same as TYPE in other respects. */
3664 c_common_signed_type (tree type
)
3666 return c_common_signed_or_unsigned_type (0, type
);
3669 /* Return a type the same as TYPE except unsigned or
3670 signed according to UNSIGNEDP. */
3673 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3678 /* This block of code emulates the behavior of the old
3679 c_common_unsigned_type. In particular, it returns
3680 long_unsigned_type_node if passed a long, even when a int would
3681 have the same size. This is necessary for warnings to work
3682 correctly in archs where sizeof(int) == sizeof(long) */
3684 type1
= TYPE_MAIN_VARIANT (type
);
3685 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3686 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3687 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3688 return unsignedp
? unsigned_type_node
: integer_type_node
;
3689 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3690 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3691 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3692 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3693 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3694 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3696 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3697 if (int_n_enabled_p
[i
]
3698 && (type1
== int_n_trees
[i
].unsigned_type
3699 || type1
== int_n_trees
[i
].signed_type
))
3700 return (unsignedp
? int_n_trees
[i
].unsigned_type
3701 : int_n_trees
[i
].signed_type
);
3703 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3704 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3705 #if HOST_BITS_PER_WIDE_INT >= 64
3706 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3707 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3709 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3710 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3711 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3712 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3713 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3714 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3715 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3716 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3718 #define C_COMMON_FIXED_TYPES(NAME) \
3719 if (type1 == short_ ## NAME ## _type_node \
3720 || type1 == unsigned_short_ ## NAME ## _type_node) \
3721 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3722 : short_ ## NAME ## _type_node; \
3723 if (type1 == NAME ## _type_node \
3724 || type1 == unsigned_ ## NAME ## _type_node) \
3725 return unsignedp ? unsigned_ ## NAME ## _type_node \
3726 : NAME ## _type_node; \
3727 if (type1 == long_ ## NAME ## _type_node \
3728 || type1 == unsigned_long_ ## NAME ## _type_node) \
3729 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3730 : long_ ## NAME ## _type_node; \
3731 if (type1 == long_long_ ## NAME ## _type_node \
3732 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3733 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3734 : long_long_ ## NAME ## _type_node;
3736 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3737 if (type1 == NAME ## _type_node \
3738 || type1 == u ## NAME ## _type_node) \
3739 return unsignedp ? u ## NAME ## _type_node \
3740 : NAME ## _type_node;
3742 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3743 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3744 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3745 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3746 : sat_ ## short_ ## NAME ## _type_node; \
3747 if (type1 == sat_ ## NAME ## _type_node \
3748 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3749 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3750 : sat_ ## NAME ## _type_node; \
3751 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3752 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3753 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3754 : sat_ ## long_ ## NAME ## _type_node; \
3755 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3756 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3757 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3758 : sat_ ## long_long_ ## NAME ## _type_node;
3760 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3761 if (type1 == sat_ ## NAME ## _type_node \
3762 || type1 == sat_ ## u ## NAME ## _type_node) \
3763 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3764 : sat_ ## NAME ## _type_node;
3766 C_COMMON_FIXED_TYPES (fract
);
3767 C_COMMON_FIXED_TYPES_SAT (fract
);
3768 C_COMMON_FIXED_TYPES (accum
);
3769 C_COMMON_FIXED_TYPES_SAT (accum
);
3771 C_COMMON_FIXED_MODE_TYPES (qq
);
3772 C_COMMON_FIXED_MODE_TYPES (hq
);
3773 C_COMMON_FIXED_MODE_TYPES (sq
);
3774 C_COMMON_FIXED_MODE_TYPES (dq
);
3775 C_COMMON_FIXED_MODE_TYPES (tq
);
3776 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3777 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3778 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3779 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3780 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3781 C_COMMON_FIXED_MODE_TYPES (ha
);
3782 C_COMMON_FIXED_MODE_TYPES (sa
);
3783 C_COMMON_FIXED_MODE_TYPES (da
);
3784 C_COMMON_FIXED_MODE_TYPES (ta
);
3785 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3786 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3787 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3788 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3790 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3791 the precision; they have precision set to match their range, but
3792 may use a wider mode to match an ABI. If we change modes, we may
3793 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3794 the precision as well, so as to yield correct results for
3795 bit-field types. C++ does not have these separate bit-field
3796 types, and producing a signed or unsigned variant of an
3797 ENUMERAL_TYPE may cause other problems as well. */
3799 if (!INTEGRAL_TYPE_P (type
)
3800 || TYPE_UNSIGNED (type
) == unsignedp
)
3803 #define TYPE_OK(node) \
3804 (TYPE_MODE (type) == TYPE_MODE (node) \
3805 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3806 if (TYPE_OK (signed_char_type_node
))
3807 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3808 if (TYPE_OK (integer_type_node
))
3809 return unsignedp
? unsigned_type_node
: integer_type_node
;
3810 if (TYPE_OK (short_integer_type_node
))
3811 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3812 if (TYPE_OK (long_integer_type_node
))
3813 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3814 if (TYPE_OK (long_long_integer_type_node
))
3815 return (unsignedp
? long_long_unsigned_type_node
3816 : long_long_integer_type_node
);
3818 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3819 if (int_n_enabled_p
[i
]
3820 && TYPE_MODE (type
) == int_n_data
[i
].m
3821 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
3822 return (unsignedp
? int_n_trees
[i
].unsigned_type
3823 : int_n_trees
[i
].signed_type
);
3825 if (TYPE_OK (widest_integer_literal_type_node
))
3826 return (unsignedp
? widest_unsigned_literal_type_node
3827 : widest_integer_literal_type_node
);
3829 #if HOST_BITS_PER_WIDE_INT >= 64
3830 if (TYPE_OK (intTI_type_node
))
3831 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3833 if (TYPE_OK (intDI_type_node
))
3834 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3835 if (TYPE_OK (intSI_type_node
))
3836 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3837 if (TYPE_OK (intHI_type_node
))
3838 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3839 if (TYPE_OK (intQI_type_node
))
3840 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3843 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3846 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3849 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3853 /* Extended integer types of the same width as a standard type have
3854 lesser rank, so those of the same width as int promote to int or
3855 unsigned int and are valid for printf formats expecting int or
3856 unsigned int. To avoid such special cases, avoid creating
3857 extended integer types for bit-fields if a standard integer type
3859 if (width
== TYPE_PRECISION (integer_type_node
))
3860 return unsignedp
? unsigned_type_node
: integer_type_node
;
3861 if (width
== TYPE_PRECISION (signed_char_type_node
))
3862 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3863 if (width
== TYPE_PRECISION (short_integer_type_node
))
3864 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3865 if (width
== TYPE_PRECISION (long_integer_type_node
))
3866 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3867 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3868 return (unsignedp
? long_long_unsigned_type_node
3869 : long_long_integer_type_node
);
3870 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3871 if (int_n_enabled_p
[i
]
3872 && width
== int_n_data
[i
].bitsize
)
3873 return (unsignedp
? int_n_trees
[i
].unsigned_type
3874 : int_n_trees
[i
].signed_type
);
3875 return build_nonstandard_integer_type (width
, unsignedp
);
3878 /* The C version of the register_builtin_type langhook. */
3881 c_register_builtin_type (tree type
, const char* name
)
3885 decl
= build_decl (UNKNOWN_LOCATION
,
3886 TYPE_DECL
, get_identifier (name
), type
);
3887 DECL_ARTIFICIAL (decl
) = 1;
3888 if (!TYPE_NAME (type
))
3889 TYPE_NAME (type
) = decl
;
3892 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3895 /* Print an error message for invalid operands to arith operation
3896 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3897 RICHLOC is a rich location for the message, containing either
3898 three separate locations for each of the operator and operands
3903 (C FE), or one location ranging over all over them
3911 binary_op_error (rich_location
*richloc
, enum tree_code code
,
3912 tree type0
, tree type1
)
3919 opname
= "+"; break;
3921 opname
= "-"; break;
3923 opname
= "*"; break;
3925 opname
= "max"; break;
3927 opname
= "min"; break;
3929 opname
= "=="; break;
3931 opname
= "!="; break;
3933 opname
= "<="; break;
3935 opname
= ">="; break;
3937 opname
= "<"; break;
3939 opname
= ">"; break;
3941 opname
= "<<"; break;
3943 opname
= ">>"; break;
3944 case TRUNC_MOD_EXPR
:
3945 case FLOOR_MOD_EXPR
:
3946 opname
= "%"; break;
3947 case TRUNC_DIV_EXPR
:
3948 case FLOOR_DIV_EXPR
:
3949 opname
= "/"; break;
3951 opname
= "&"; break;
3953 opname
= "|"; break;
3954 case TRUTH_ANDIF_EXPR
:
3955 opname
= "&&"; break;
3956 case TRUTH_ORIF_EXPR
:
3957 opname
= "||"; break;
3959 opname
= "^"; break;
3963 error_at_rich_loc (richloc
,
3964 "invalid operands to binary %s (have %qT and %qT)",
3965 opname
, type0
, type1
);
3968 /* Given an expression as a tree, return its original type. Do this
3969 by stripping any conversion that preserves the sign and precision. */
3971 expr_original_type (tree expr
)
3973 STRIP_SIGN_NOPS (expr
);
3974 return TREE_TYPE (expr
);
3977 /* Subroutine of build_binary_op, used for comparison operations.
3978 See if the operands have both been converted from subword integer types
3979 and, if so, perhaps change them both back to their original type.
3980 This function is also responsible for converting the two operands
3981 to the proper common type for comparison.
3983 The arguments of this function are all pointers to local variables
3984 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3985 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3987 LOC is the location of the comparison.
3989 If this function returns nonzero, it means that the comparison has
3990 a constant value. What this function returns is an expression for
3994 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
3995 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
3998 tree op0
= *op0_ptr
;
3999 tree op1
= *op1_ptr
;
4000 int unsignedp0
, unsignedp1
;
4002 tree primop0
, primop1
;
4003 enum tree_code code
= *rescode_ptr
;
4005 /* Throw away any conversions to wider types
4006 already present in the operands. */
4008 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
4009 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
4011 /* If primopN is first sign-extended from primopN's precision to opN's
4012 precision, then zero-extended from opN's precision to
4013 *restype_ptr precision, shortenings might be invalid. */
4014 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
4015 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
4017 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
4019 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
4020 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
4022 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
4025 /* Handle the case that OP0 does not *contain* a conversion
4026 but it *requires* conversion to FINAL_TYPE. */
4028 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
4029 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
4030 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
4031 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
4033 /* If one of the operands must be floated, we cannot optimize. */
4034 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
4035 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
4037 /* If first arg is constant, swap the args (changing operation
4038 so value is preserved), for canonicalization. Don't do this if
4039 the second arg is 0. */
4041 if (TREE_CONSTANT (primop0
)
4042 && !integer_zerop (primop1
) && !real_zerop (primop1
)
4043 && !fixed_zerop (primop1
))
4045 std::swap (primop0
, primop1
);
4046 std::swap (op0
, op1
);
4049 std::swap (unsignedp0
, unsignedp1
);
4050 std::swap (real1
, real2
);
4069 *rescode_ptr
= code
;
4072 /* If comparing an integer against a constant more bits wide,
4073 maybe we can deduce a value of 1 or 0 independent of the data.
4074 Or else truncate the constant now
4075 rather than extend the variable at run time.
4077 This is only interesting if the constant is the wider arg.
4078 Also, it is not safe if the constant is unsigned and the
4079 variable arg is signed, since in this case the variable
4080 would be sign-extended and then regarded as unsigned.
4081 Our technique fails in this case because the lowest/highest
4082 possible unsigned results don't follow naturally from the
4083 lowest/highest possible values of the variable operand.
4084 For just EQ_EXPR and NE_EXPR there is another technique that
4085 could be used: see if the constant can be faithfully represented
4086 in the other operand's type, by truncating it and reextending it
4087 and see if that preserves the constant's value. */
4089 if (!real1
&& !real2
4090 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
4091 && TREE_CODE (primop1
) == INTEGER_CST
4092 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
4094 int min_gt
, max_gt
, min_lt
, max_lt
;
4095 tree maxval
, minval
;
4096 /* 1 if comparison is nominally unsigned. */
4097 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
4100 type
= c_common_signed_or_unsigned_type (unsignedp0
,
4101 TREE_TYPE (primop0
));
4103 maxval
= TYPE_MAX_VALUE (type
);
4104 minval
= TYPE_MIN_VALUE (type
);
4106 if (unsignedp
&& !unsignedp0
)
4107 *restype_ptr
= c_common_signed_type (*restype_ptr
);
4109 if (TREE_TYPE (primop1
) != *restype_ptr
)
4111 /* Convert primop1 to target type, but do not introduce
4112 additional overflow. We know primop1 is an int_cst. */
4113 primop1
= force_fit_type (*restype_ptr
,
4116 TYPE_PRECISION (*restype_ptr
)),
4117 0, TREE_OVERFLOW (primop1
));
4119 if (type
!= *restype_ptr
)
4121 minval
= convert (*restype_ptr
, minval
);
4122 maxval
= convert (*restype_ptr
, maxval
);
4125 min_gt
= tree_int_cst_lt (primop1
, minval
);
4126 max_gt
= tree_int_cst_lt (primop1
, maxval
);
4127 min_lt
= tree_int_cst_lt (minval
, primop1
);
4128 max_lt
= tree_int_cst_lt (maxval
, primop1
);
4131 /* This used to be a switch, but Genix compiler can't handle that. */
4132 if (code
== NE_EXPR
)
4134 if (max_lt
|| min_gt
)
4135 val
= truthvalue_true_node
;
4137 else if (code
== EQ_EXPR
)
4139 if (max_lt
|| min_gt
)
4140 val
= truthvalue_false_node
;
4142 else if (code
== LT_EXPR
)
4145 val
= truthvalue_true_node
;
4147 val
= truthvalue_false_node
;
4149 else if (code
== GT_EXPR
)
4152 val
= truthvalue_true_node
;
4154 val
= truthvalue_false_node
;
4156 else if (code
== LE_EXPR
)
4159 val
= truthvalue_true_node
;
4161 val
= truthvalue_false_node
;
4163 else if (code
== GE_EXPR
)
4166 val
= truthvalue_true_node
;
4168 val
= truthvalue_false_node
;
4171 /* If primop0 was sign-extended and unsigned comparison specd,
4172 we did a signed comparison above using the signed type bounds.
4173 But the comparison we output must be unsigned.
4175 Also, for inequalities, VAL is no good; but if the signed
4176 comparison had *any* fixed result, it follows that the
4177 unsigned comparison just tests the sign in reverse
4178 (positive values are LE, negative ones GE).
4179 So we can generate an unsigned comparison
4180 against an extreme value of the signed type. */
4182 if (unsignedp
&& !unsignedp0
)
4189 primop1
= TYPE_MIN_VALUE (type
);
4195 primop1
= TYPE_MAX_VALUE (type
);
4202 type
= c_common_unsigned_type (type
);
4205 if (TREE_CODE (primop0
) != INTEGER_CST
4206 /* Don't warn if it's from a (non-system) macro. */
4207 && !(from_macro_expansion_at
4208 (expansion_point_location_if_in_system_header
4209 (EXPR_LOCATION (primop0
)))))
4211 if (val
== truthvalue_false_node
)
4212 warning_at (loc
, OPT_Wtype_limits
,
4213 "comparison is always false due to limited range of data type");
4214 if (val
== truthvalue_true_node
)
4215 warning_at (loc
, OPT_Wtype_limits
,
4216 "comparison is always true due to limited range of data type");
4221 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4222 if (TREE_SIDE_EFFECTS (primop0
))
4223 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
4227 /* Value is not predetermined, but do the comparison
4228 in the type of the operand that is not constant.
4229 TYPE is already properly set. */
4232 /* If either arg is decimal float and the other is float, find the
4233 proper common type to use for comparison. */
4234 else if (real1
&& real2
4235 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4236 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
4237 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4239 /* If either arg is decimal float and the other is float, fail. */
4240 else if (real1
&& real2
4241 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4242 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
4245 else if (real1
&& real2
4246 && (TYPE_PRECISION (TREE_TYPE (primop0
))
4247 == TYPE_PRECISION (TREE_TYPE (primop1
))))
4248 type
= TREE_TYPE (primop0
);
4250 /* If args' natural types are both narrower than nominal type
4251 and both extend in the same manner, compare them
4252 in the type of the wider arg.
4253 Otherwise must actually extend both to the nominal
4254 common type lest different ways of extending
4256 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4258 else if (unsignedp0
== unsignedp1
&& real1
== real2
4259 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
4260 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
4262 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4263 type
= c_common_signed_or_unsigned_type (unsignedp0
4264 || TYPE_UNSIGNED (*restype_ptr
),
4266 /* Make sure shorter operand is extended the right way
4267 to match the longer operand. */
4269 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
4270 TREE_TYPE (primop0
)),
4273 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
4274 TREE_TYPE (primop1
)),
4279 /* Here we must do the comparison on the nominal type
4280 using the args exactly as we received them. */
4281 type
= *restype_ptr
;
4285 if (!real1
&& !real2
&& integer_zerop (primop1
)
4286 && TYPE_UNSIGNED (*restype_ptr
))
4289 /* All unsigned values are >= 0, so we warn. However,
4290 if OP0 is a constant that is >= 0, the signedness of
4291 the comparison isn't an issue, so suppress the
4294 warn_type_limits
&& !in_system_header_at (loc
)
4295 && !(TREE_CODE (primop0
) == INTEGER_CST
4296 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
4298 /* Do not warn for enumeration types. */
4299 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
4305 warning_at (loc
, OPT_Wtype_limits
,
4306 "comparison of unsigned expression >= 0 is always true");
4307 value
= truthvalue_true_node
;
4312 warning_at (loc
, OPT_Wtype_limits
,
4313 "comparison of unsigned expression < 0 is always false");
4314 value
= truthvalue_false_node
;
4323 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4324 if (TREE_SIDE_EFFECTS (primop0
))
4325 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
4332 *op0_ptr
= convert (type
, primop0
);
4333 *op1_ptr
= convert (type
, primop1
);
4335 *restype_ptr
= truthvalue_type_node
;
4340 /* Return a tree for the sum or difference (RESULTCODE says which)
4341 of pointer PTROP and integer INTOP. */
4344 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
4345 tree ptrop
, tree intop
, bool complain
)
4349 /* The result is a pointer of the same type that is being added. */
4350 tree result_type
= TREE_TYPE (ptrop
);
4352 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
4354 if (complain
&& warn_pointer_arith
)
4355 pedwarn (loc
, OPT_Wpointer_arith
,
4356 "pointer of type %<void *%> used in arithmetic");
4358 return error_mark_node
;
4359 size_exp
= integer_one_node
;
4361 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
4363 if (complain
&& warn_pointer_arith
)
4364 pedwarn (loc
, OPT_Wpointer_arith
,
4365 "pointer to a function used in arithmetic");
4367 return error_mark_node
;
4368 size_exp
= integer_one_node
;
4371 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
4373 /* We are manipulating pointer values, so we don't need to warn
4374 about relying on undefined signed overflow. We disable the
4375 warning here because we use integer types so fold won't know that
4376 they are really pointers. */
4377 fold_defer_overflow_warnings ();
4379 /* If what we are about to multiply by the size of the elements
4380 contains a constant term, apply distributive law
4381 and multiply that constant term separately.
4382 This helps produce common subexpressions. */
4383 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
4384 && !TREE_CONSTANT (intop
)
4385 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
4386 && TREE_CONSTANT (size_exp
)
4387 /* If the constant comes from pointer subtraction,
4388 skip this optimization--it would cause an error. */
4389 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
4390 /* If the constant is unsigned, and smaller than the pointer size,
4391 then we must skip this optimization. This is because it could cause
4392 an overflow error if the constant is negative but INTOP is not. */
4393 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
4394 || (TYPE_PRECISION (TREE_TYPE (intop
))
4395 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
4397 enum tree_code subcode
= resultcode
;
4398 tree int_type
= TREE_TYPE (intop
);
4399 if (TREE_CODE (intop
) == MINUS_EXPR
)
4400 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
4401 /* Convert both subexpression types to the type of intop,
4402 because weird cases involving pointer arithmetic
4403 can result in a sum or difference with different type args. */
4404 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
4406 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
4407 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
4410 /* Convert the integer argument to a type the same size as sizetype
4411 so the multiply won't overflow spuriously. */
4412 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
4413 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
4414 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
4415 TYPE_UNSIGNED (sizetype
)), intop
);
4417 /* Replace the integer argument with a suitable product by the object size.
4418 Do this multiplication as signed, then convert to the appropriate type
4419 for the pointer operation and disregard an overflow that occurred only
4420 because of the sign-extension change in the latter conversion. */
4422 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
4423 convert (TREE_TYPE (intop
), size_exp
));
4424 intop
= convert (sizetype
, t
);
4425 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
4426 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
4429 /* Create the sum or difference. */
4430 if (resultcode
== MINUS_EXPR
)
4431 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
4433 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
4435 fold_undefer_and_ignore_overflow_warnings ();
4440 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4441 and if NON_CONST is known not to be permitted in an evaluated part
4442 of a constant expression. */
4445 c_wrap_maybe_const (tree expr
, bool non_const
)
4447 bool nowarning
= TREE_NO_WARNING (expr
);
4448 location_t loc
= EXPR_LOCATION (expr
);
4450 /* This should never be called for C++. */
4451 if (c_dialect_cxx ())
4454 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4455 STRIP_TYPE_NOPS (expr
);
4456 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
4457 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
4459 TREE_NO_WARNING (expr
) = 1;
4460 protected_set_expr_location (expr
, loc
);
4465 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4466 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4467 around the SAVE_EXPR if needed so that c_fully_fold does not need
4468 to look inside SAVE_EXPRs. */
4471 c_save_expr (tree expr
)
4473 bool maybe_const
= true;
4474 if (c_dialect_cxx ())
4475 return save_expr (expr
);
4476 expr
= c_fully_fold (expr
, false, &maybe_const
);
4477 expr
= save_expr (expr
);
4479 expr
= c_wrap_maybe_const (expr
, true);
4483 /* Return whether EXPR is a declaration whose address can never be
4487 decl_with_nonnull_addr_p (const_tree expr
)
4489 return (DECL_P (expr
)
4490 && (TREE_CODE (expr
) == PARM_DECL
4491 || TREE_CODE (expr
) == LABEL_DECL
4492 || !DECL_WEAK (expr
)));
4495 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4496 or for an `if' or `while' statement or ?..: exp. It should already
4497 have been validated to be of suitable type; otherwise, a bad
4498 diagnostic may result.
4500 The EXPR is located at LOCATION.
4502 This preparation consists of taking the ordinary
4503 representation of an expression expr and producing a valid tree
4504 boolean expression describing whether expr is nonzero. We could
4505 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4506 but we optimize comparisons, &&, ||, and !.
4508 The resulting type should always be `truthvalue_type_node'. */
4511 c_common_truthvalue_conversion (location_t location
, tree expr
)
4513 switch (TREE_CODE (expr
))
4515 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
4516 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
4517 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
4518 case ORDERED_EXPR
: case UNORDERED_EXPR
:
4519 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4521 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4522 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
4525 case TRUTH_ANDIF_EXPR
:
4526 case TRUTH_ORIF_EXPR
:
4527 case TRUTH_AND_EXPR
:
4529 case TRUTH_XOR_EXPR
:
4530 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4532 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4533 c_common_truthvalue_conversion (location
,
4534 TREE_OPERAND (expr
, 0)),
4535 c_common_truthvalue_conversion (location
,
4536 TREE_OPERAND (expr
, 1)));
4539 case TRUTH_NOT_EXPR
:
4540 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4542 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
4543 c_common_truthvalue_conversion (location
,
4544 TREE_OPERAND (expr
, 0)));
4551 return integer_zerop (expr
) ? truthvalue_false_node
4552 : truthvalue_true_node
;
4555 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
4556 ? truthvalue_true_node
4557 : truthvalue_false_node
;
4560 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
4561 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
4562 ? truthvalue_true_node
4563 : truthvalue_false_node
;
4566 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
4571 tree inner
= TREE_OPERAND (expr
, 0);
4572 if (decl_with_nonnull_addr_p (inner
))
4574 /* Common Ada/Pascal programmer's mistake. */
4575 warning_at (location
,
4577 "the address of %qD will always evaluate as %<true%>",
4579 return truthvalue_true_node
;
4585 expr
= build_binary_op (EXPR_LOCATION (expr
),
4586 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
4587 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4588 c_common_truthvalue_conversion (location
,
4589 TREE_OPERAND (expr
, 0)),
4590 c_common_truthvalue_conversion (location
,
4591 TREE_OPERAND (expr
, 1)),
4598 case EXCESS_PRECISION_EXPR
:
4599 /* These don't change whether an object is nonzero or zero. */
4600 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
4604 /* These don't change whether an object is zero or nonzero, but
4605 we can't ignore them if their second arg has side-effects. */
4606 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
4608 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
4609 TREE_OPERAND (expr
, 1),
4610 c_common_truthvalue_conversion
4611 (location
, TREE_OPERAND (expr
, 0)));
4615 return c_common_truthvalue_conversion (location
,
4616 TREE_OPERAND (expr
, 0));
4619 /* Distribute the conversion into the arms of a COND_EXPR. */
4620 if (c_dialect_cxx ())
4622 tree op1
= TREE_OPERAND (expr
, 1);
4623 tree op2
= TREE_OPERAND (expr
, 2);
4624 /* In C++ one of the arms might have void type if it is throw. */
4625 if (!VOID_TYPE_P (TREE_TYPE (op1
)))
4626 op1
= c_common_truthvalue_conversion (location
, op1
);
4627 if (!VOID_TYPE_P (TREE_TYPE (op2
)))
4628 op2
= c_common_truthvalue_conversion (location
, op2
);
4629 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4630 TREE_OPERAND (expr
, 0), op1
, op2
);
4635 /* Folding will happen later for C. */
4636 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4637 TREE_OPERAND (expr
, 0),
4638 c_common_truthvalue_conversion (location
,
4639 TREE_OPERAND (expr
, 1)),
4640 c_common_truthvalue_conversion (location
,
4641 TREE_OPERAND (expr
, 2)));
4647 tree totype
= TREE_TYPE (expr
);
4648 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
4650 if (POINTER_TYPE_P (totype
)
4651 && !c_inhibit_evaluation_warnings
4652 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4658 warning_at (location
,
4660 "the compiler can assume that the address of "
4661 "%qD will always evaluate to %<true%>",
4665 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4666 since that affects how `default_conversion' will behave. */
4667 if (TREE_CODE (totype
) == REFERENCE_TYPE
4668 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4670 /* Don't strip a conversion from C++0x scoped enum, since they
4671 don't implicitly convert to other types. */
4672 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
4673 && ENUM_IS_SCOPED (fromtype
))
4675 /* If this isn't narrowing the argument, we can ignore it. */
4676 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
4677 return c_common_truthvalue_conversion (location
,
4678 TREE_OPERAND (expr
, 0));
4683 if (!TREE_NO_WARNING (expr
)
4684 && warn_parentheses
)
4686 warning_at (location
, OPT_Wparentheses
,
4687 "suggest parentheses around assignment used as "
4689 TREE_NO_WARNING (expr
) = 1;
4697 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4699 tree t
= (in_late_binary_op
? save_expr (expr
) : c_save_expr (expr
));
4700 expr
= (build_binary_op
4701 (EXPR_LOCATION (expr
),
4702 (TREE_SIDE_EFFECTS (expr
)
4703 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4704 c_common_truthvalue_conversion
4706 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
4707 c_common_truthvalue_conversion
4709 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
4714 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4716 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4718 (TREE_TYPE (expr
))));
4719 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4722 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4725 protected_set_expr_location (expr
, location
);
4729 static void def_builtin_1 (enum built_in_function fncode
,
4731 enum built_in_class fnclass
,
4732 tree fntype
, tree libtype
,
4733 bool both_p
, bool fallback_p
, bool nonansi_p
,
4734 tree fnattrs
, bool implicit_p
);
4737 /* Apply the TYPE_QUALS to the new DECL. */
4740 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4742 tree type
= TREE_TYPE (decl
);
4744 if (type
== error_mark_node
)
4747 if ((type_quals
& TYPE_QUAL_CONST
)
4748 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4749 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4750 constructor can produce constant init, so rely on cp_finish_decl to
4751 clear TREE_READONLY if the variable has non-constant init. */
4752 TREE_READONLY (decl
) = 1;
4753 if (type_quals
& TYPE_QUAL_VOLATILE
)
4755 TREE_SIDE_EFFECTS (decl
) = 1;
4756 TREE_THIS_VOLATILE (decl
) = 1;
4758 if (type_quals
& TYPE_QUAL_RESTRICT
)
4760 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4761 /* Allow 'restrict' on arrays of pointers.
4762 FIXME currently we just ignore it. */
4763 type
= TREE_TYPE (type
);
4765 || !POINTER_TYPE_P (type
)
4766 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4767 error ("invalid use of %<restrict%>");
4771 struct c_type_hasher
: ggc_ptr_hash
<tree_node
>
4773 static hashval_t
hash (tree
);
4774 static bool equal (tree
, tree
);
4777 /* Hash function for the problem of multiple type definitions in
4778 different files. This must hash all types that will compare
4779 equal via comptypes to the same value. In practice it hashes
4780 on some of the simple stuff and leaves the details to comptypes. */
4783 c_type_hasher::hash (tree t
)
4788 switch (TREE_CODE (t
))
4790 /* For pointers, hash on pointee type plus some swizzling. */
4792 return hash (TREE_TYPE (t
)) ^ 0x3003003;
4793 /* Hash on number of elements and total size. */
4796 t2
= TYPE_VALUES (t
);
4800 t2
= TYPE_FIELDS (t
);
4802 case QUAL_UNION_TYPE
:
4804 t2
= TYPE_FIELDS (t
);
4808 t2
= TYPE_FIELDS (t
);
4813 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4814 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4815 n_elements
= list_length (t2
);
4816 /* We might have a VLA here. */
4817 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4820 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4821 return ((size
<< 24) | (n_elements
<< shift
));
4825 c_type_hasher::equal (tree t1
, tree t2
)
4827 return lang_hooks
.types_compatible_p (t1
, t2
);
4830 static GTY(()) hash_table
<c_type_hasher
> *type_hash_table
;
4832 /* Return the typed-based alias set for T, which may be an expression
4833 or a type. Return -1 if we don't do anything special. */
4836 c_common_get_alias_set (tree t
)
4838 /* For VLAs, use the alias set of the element type rather than the
4839 default of alias set 0 for types compared structurally. */
4840 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4842 if (TREE_CODE (t
) == ARRAY_TYPE
)
4843 return get_alias_set (TREE_TYPE (t
));
4847 /* That's all the expressions we handle specially. */
4851 /* The C standard guarantees that any object may be accessed via an
4852 lvalue that has character type. */
4853 if (t
== char_type_node
4854 || t
== signed_char_type_node
4855 || t
== unsigned_char_type_node
)
4858 /* The C standard specifically allows aliasing between signed and
4859 unsigned variants of the same type. We treat the signed
4860 variant as canonical. */
4861 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4863 tree t1
= c_common_signed_type (t
);
4865 /* t1 == t can happen for boolean nodes which are always unsigned. */
4867 return get_alias_set (t1
);
4870 /* Handle the case of multiple type nodes referring to "the same" type,
4871 which occurs with IMA. These share an alias set. FIXME: Currently only
4872 C90 is handled. (In C99 type compatibility is not transitive, which
4873 complicates things mightily. The alias set splay trees can theoretically
4874 represent this, but insertion is tricky when you consider all the
4875 different orders things might arrive in.) */
4877 if (c_language
!= clk_c
|| flag_isoc99
)
4880 /* Save time if there's only one input file. */
4881 if (num_in_fnames
== 1)
4884 /* Pointers need special handling if they point to any type that
4885 needs special handling (below). */
4886 if (TREE_CODE (t
) == POINTER_TYPE
)
4889 /* Find bottom type under any nested POINTERs. */
4890 for (t2
= TREE_TYPE (t
);
4891 TREE_CODE (t2
) == POINTER_TYPE
;
4892 t2
= TREE_TYPE (t2
))
4894 if (!RECORD_OR_UNION_TYPE_P (t2
)
4895 && TREE_CODE (t2
) != ENUMERAL_TYPE
)
4897 if (TYPE_SIZE (t2
) == 0)
4900 /* These are the only cases that need special handling. */
4901 if (!RECORD_OR_UNION_TYPE_P (t
)
4902 && TREE_CODE (t
) != ENUMERAL_TYPE
4903 && TREE_CODE (t
) != POINTER_TYPE
)
4906 if (TYPE_SIZE (t
) == 0)
4909 /* Look up t in hash table. Only one of the compatible types within each
4910 alias set is recorded in the table. */
4911 if (!type_hash_table
)
4912 type_hash_table
= hash_table
<c_type_hasher
>::create_ggc (1021);
4913 tree
*slot
= type_hash_table
->find_slot (t
, INSERT
);
4916 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4917 return TYPE_ALIAS_SET ((tree
)*slot
);
4920 /* Our caller will assign and record (in t) a new alias set; all we need
4921 to do is remember t in the hash table. */
4927 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4928 the IS_SIZEOF parameter indicates which operator is being applied.
4929 The COMPLAIN flag controls whether we should diagnose possibly
4930 ill-formed constructs or not. LOC is the location of the SIZEOF or
4931 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4932 a type in any context should be returned, rather than the normal
4933 alignment for that type. */
4936 c_sizeof_or_alignof_type (location_t loc
,
4937 tree type
, bool is_sizeof
, bool min_alignof
,
4940 const char *op_name
;
4942 enum tree_code type_code
= TREE_CODE (type
);
4944 op_name
= is_sizeof
? "sizeof" : "__alignof__";
4946 if (type_code
== FUNCTION_TYPE
)
4950 if (complain
&& warn_pointer_arith
)
4951 pedwarn (loc
, OPT_Wpointer_arith
,
4952 "invalid application of %<sizeof%> to a function type");
4954 return error_mark_node
;
4955 value
= size_one_node
;
4961 if (c_dialect_cxx ())
4962 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
4963 "%<alignof%> applied to a function type");
4965 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
4966 "%<_Alignof%> applied to a function type");
4968 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
4971 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
4973 if (type_code
== VOID_TYPE
4974 && complain
&& warn_pointer_arith
)
4975 pedwarn (loc
, OPT_Wpointer_arith
,
4976 "invalid application of %qs to a void type", op_name
);
4978 return error_mark_node
;
4979 value
= size_one_node
;
4981 else if (!COMPLETE_TYPE_P (type
)
4982 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
4985 error_at (loc
, "invalid application of %qs to incomplete type %qT",
4987 return error_mark_node
;
4989 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
4990 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
4993 error_at (loc
, "invalid application of %qs to array type %qT of "
4994 "incomplete element type", op_name
, type
);
4995 return error_mark_node
;
5000 /* Convert in case a char is more than one unit. */
5001 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
5002 size_int (TYPE_PRECISION (char_type_node
)
5004 else if (min_alignof
)
5005 value
= size_int (min_align_of_type (type
));
5007 value
= size_int (TYPE_ALIGN_UNIT (type
));
5010 /* VALUE will have the middle-end integer type sizetype.
5011 However, we should really return a value of type `size_t',
5012 which is just a typedef for an ordinary integer type. */
5013 value
= fold_convert_loc (loc
, size_type_node
, value
);
5018 /* Implement the __alignof keyword: Return the minimum required
5019 alignment of EXPR, measured in bytes. For VAR_DECLs,
5020 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5021 from an "aligned" __attribute__ specification). LOC is the
5022 location of the ALIGNOF operator. */
5025 c_alignof_expr (location_t loc
, tree expr
)
5029 if (VAR_OR_FUNCTION_DECL_P (expr
))
5030 t
= size_int (DECL_ALIGN_UNIT (expr
));
5032 else if (TREE_CODE (expr
) == COMPONENT_REF
5033 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
5035 error_at (loc
, "%<__alignof%> applied to a bit-field");
5038 else if (TREE_CODE (expr
) == COMPONENT_REF
5039 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
5040 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
5042 else if (INDIRECT_REF_P (expr
))
5044 tree t
= TREE_OPERAND (expr
, 0);
5046 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5048 while (CONVERT_EXPR_P (t
)
5049 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
5053 t
= TREE_OPERAND (t
, 0);
5054 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5055 if (thisalign
> bestalign
)
5056 best
= t
, bestalign
= thisalign
;
5058 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
5061 return c_alignof (loc
, TREE_TYPE (expr
));
5063 return fold_convert_loc (loc
, size_type_node
, t
);
5066 /* Handle C and C++ default attributes. */
5068 enum built_in_attribute
5070 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5071 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5072 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5073 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5074 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5075 #include "builtin-attrs.def"
5076 #undef DEF_ATTR_NULL_TREE
5078 #undef DEF_ATTR_STRING
5079 #undef DEF_ATTR_IDENT
5080 #undef DEF_ATTR_TREE_LIST
5084 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
5086 static void c_init_attributes (void);
5090 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5091 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5092 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5093 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5094 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5095 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5096 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5097 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5099 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5101 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5102 ARG6, ARG7, ARG8) NAME,
5103 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5104 ARG6, ARG7, ARG8, ARG9) NAME,
5105 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5106 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5107 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5108 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5109 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5110 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5111 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5112 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5113 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5114 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5116 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5118 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5120 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5121 #include "builtin-types.def"
5122 #undef DEF_PRIMITIVE_TYPE
5123 #undef DEF_FUNCTION_TYPE_0
5124 #undef DEF_FUNCTION_TYPE_1
5125 #undef DEF_FUNCTION_TYPE_2
5126 #undef DEF_FUNCTION_TYPE_3
5127 #undef DEF_FUNCTION_TYPE_4
5128 #undef DEF_FUNCTION_TYPE_5
5129 #undef DEF_FUNCTION_TYPE_6
5130 #undef DEF_FUNCTION_TYPE_7
5131 #undef DEF_FUNCTION_TYPE_8
5132 #undef DEF_FUNCTION_TYPE_9
5133 #undef DEF_FUNCTION_TYPE_10
5134 #undef DEF_FUNCTION_TYPE_11
5135 #undef DEF_FUNCTION_TYPE_VAR_0
5136 #undef DEF_FUNCTION_TYPE_VAR_1
5137 #undef DEF_FUNCTION_TYPE_VAR_2
5138 #undef DEF_FUNCTION_TYPE_VAR_3
5139 #undef DEF_FUNCTION_TYPE_VAR_4
5140 #undef DEF_FUNCTION_TYPE_VAR_5
5141 #undef DEF_FUNCTION_TYPE_VAR_6
5142 #undef DEF_FUNCTION_TYPE_VAR_7
5143 #undef DEF_POINTER_TYPE
5147 typedef enum c_builtin_type builtin_type
;
5149 /* A temporary array for c_common_nodes_and_builtins. Used in
5150 communication with def_fn_type. */
5151 static tree builtin_types
[(int) BT_LAST
+ 1];
5153 /* A helper function for c_common_nodes_and_builtins. Build function type
5154 for DEF with return type RET and N arguments. If VAR is true, then the
5155 function should be variadic after those N arguments.
5157 Takes special care not to ICE if any of the types involved are
5158 error_mark_node, which indicates that said type is not in fact available
5159 (see builtin_type_for_size). In which case the function type as a whole
5160 should be error_mark_node. */
5163 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
5166 tree
*args
= XALLOCAVEC (tree
, n
);
5171 for (i
= 0; i
< n
; ++i
)
5173 builtin_type a
= (builtin_type
) va_arg (list
, int);
5174 t
= builtin_types
[a
];
5175 if (t
== error_mark_node
)
5180 t
= builtin_types
[ret
];
5181 if (t
== error_mark_node
)
5184 t
= build_varargs_function_type_array (t
, n
, args
);
5186 t
= build_function_type_array (t
, n
, args
);
5189 builtin_types
[def
] = t
;
5193 /* Build builtin functions common to both C and C++ language
5197 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
5199 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5200 builtin_types[ENUM] = VALUE;
5201 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5202 def_fn_type (ENUM, RETURN, 0, 0);
5203 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5204 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5205 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5206 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5207 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5208 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5209 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5210 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5211 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5212 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5213 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5215 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5216 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5218 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5219 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5221 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5223 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5224 ARG6, ARG7, ARG8, ARG9) \
5225 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5227 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5228 ARG6, ARG7, ARG8, ARG9, ARG10) \
5229 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5230 ARG7, ARG8, ARG9, ARG10);
5231 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5232 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5233 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5234 ARG7, ARG8, ARG9, ARG10, ARG11);
5235 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5236 def_fn_type (ENUM, RETURN, 1, 0);
5237 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5238 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5239 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5240 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5241 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5242 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5243 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5244 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5245 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5246 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5247 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5249 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5250 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5252 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5253 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5254 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5256 #include "builtin-types.def"
5258 #undef DEF_PRIMITIVE_TYPE
5259 #undef DEF_FUNCTION_TYPE_0
5260 #undef DEF_FUNCTION_TYPE_1
5261 #undef DEF_FUNCTION_TYPE_2
5262 #undef DEF_FUNCTION_TYPE_3
5263 #undef DEF_FUNCTION_TYPE_4
5264 #undef DEF_FUNCTION_TYPE_5
5265 #undef DEF_FUNCTION_TYPE_6
5266 #undef DEF_FUNCTION_TYPE_7
5267 #undef DEF_FUNCTION_TYPE_8
5268 #undef DEF_FUNCTION_TYPE_9
5269 #undef DEF_FUNCTION_TYPE_10
5270 #undef DEF_FUNCTION_TYPE_11
5271 #undef DEF_FUNCTION_TYPE_VAR_0
5272 #undef DEF_FUNCTION_TYPE_VAR_1
5273 #undef DEF_FUNCTION_TYPE_VAR_2
5274 #undef DEF_FUNCTION_TYPE_VAR_3
5275 #undef DEF_FUNCTION_TYPE_VAR_4
5276 #undef DEF_FUNCTION_TYPE_VAR_5
5277 #undef DEF_FUNCTION_TYPE_VAR_6
5278 #undef DEF_FUNCTION_TYPE_VAR_7
5279 #undef DEF_POINTER_TYPE
5280 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
5282 c_init_attributes ();
5284 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5285 NONANSI_P, ATTRS, IMPLICIT, COND) \
5287 def_builtin_1 (ENUM, NAME, CLASS, \
5288 builtin_types[(int) TYPE], \
5289 builtin_types[(int) LIBTYPE], \
5290 BOTH_P, FALLBACK_P, NONANSI_P, \
5291 built_in_attributes[(int) ATTRS], IMPLICIT);
5292 #include "builtins.def"
5294 targetm
.init_builtins ();
5296 build_common_builtin_nodes ();
5299 cilk_init_builtins ();
5302 /* Like get_identifier, but avoid warnings about null arguments when
5303 the argument may be NULL for targets where GCC lacks stdint.h type
5307 c_get_ident (const char *id
)
5309 return get_identifier (id
);
5312 /* Build tree nodes and builtin functions common to both C and C++ language
5316 c_common_nodes_and_builtins (void)
5318 int char16_type_size
;
5319 int char32_type_size
;
5320 int wchar_type_size
;
5321 tree array_domain_type
;
5322 tree va_list_ref_type_node
;
5323 tree va_list_arg_type_node
;
5326 build_common_tree_nodes (flag_signed_char
);
5328 /* Define `int' and `char' first so that dbx will output them first. */
5329 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
5330 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5332 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5333 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5334 but not C. Are the conditionals here needed? */
5335 if (c_dialect_cxx ())
5336 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
5337 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5338 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5339 record_builtin_type (RID_MAX
, "long unsigned int",
5340 long_unsigned_type_node
);
5342 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
5346 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
5347 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
5348 int_n_trees
[i
].signed_type
);
5349 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
5350 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
5353 if (c_dialect_cxx ())
5354 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5355 record_builtin_type (RID_MAX
, "long long int",
5356 long_long_integer_type_node
);
5357 record_builtin_type (RID_MAX
, "long long unsigned int",
5358 long_long_unsigned_type_node
);
5359 if (c_dialect_cxx ())
5360 record_builtin_type (RID_MAX
, "long long unsigned",
5361 long_long_unsigned_type_node
);
5362 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5363 record_builtin_type (RID_MAX
, "short unsigned int",
5364 short_unsigned_type_node
);
5365 if (c_dialect_cxx ())
5366 record_builtin_type (RID_MAX
, "unsigned short",
5367 short_unsigned_type_node
);
5369 /* Define both `signed char' and `unsigned char'. */
5370 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5371 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5373 /* These are types that c_common_type_for_size and
5374 c_common_type_for_mode use. */
5375 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5376 TYPE_DECL
, NULL_TREE
,
5378 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5379 TYPE_DECL
, NULL_TREE
,
5381 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5382 TYPE_DECL
, NULL_TREE
,
5384 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5385 TYPE_DECL
, NULL_TREE
,
5387 #if HOST_BITS_PER_WIDE_INT >= 64
5388 /* Note that this is different than the __int128 type that's part of
5389 the generic __intN support. */
5390 if (targetm
.scalar_mode_supported_p (TImode
))
5391 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5393 get_identifier ("__int128_t"),
5396 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5397 TYPE_DECL
, NULL_TREE
,
5398 unsigned_intQI_type_node
));
5399 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5400 TYPE_DECL
, NULL_TREE
,
5401 unsigned_intHI_type_node
));
5402 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5403 TYPE_DECL
, NULL_TREE
,
5404 unsigned_intSI_type_node
));
5405 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5406 TYPE_DECL
, NULL_TREE
,
5407 unsigned_intDI_type_node
));
5408 #if HOST_BITS_PER_WIDE_INT >= 64
5409 if (targetm
.scalar_mode_supported_p (TImode
))
5410 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5412 get_identifier ("__uint128_t"),
5413 unsigned_intTI_type_node
));
5416 /* Create the widest literal types. */
5417 widest_integer_literal_type_node
5418 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
5419 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5420 TYPE_DECL
, NULL_TREE
,
5421 widest_integer_literal_type_node
));
5423 widest_unsigned_literal_type_node
5424 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
5425 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5426 TYPE_DECL
, NULL_TREE
,
5427 widest_unsigned_literal_type_node
));
5429 signed_size_type_node
= c_common_signed_type (size_type_node
);
5432 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
5434 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
5435 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
5436 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5438 if (!c_dialect_cxx ())
5439 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5440 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5441 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
5442 FLOATN_NX_TYPE_NODE (i
));
5444 /* Only supported decimal floating point extension if the target
5445 actually supports underlying modes. */
5446 if (targetm
.scalar_mode_supported_p (SDmode
)
5447 && targetm
.scalar_mode_supported_p (DDmode
)
5448 && targetm
.scalar_mode_supported_p (TDmode
))
5450 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
5451 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
5452 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
5455 if (targetm
.fixed_point_supported_p ())
5457 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
5458 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
5459 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
5460 record_builtin_type (RID_MAX
, "long long _Fract",
5461 long_long_fract_type_node
);
5462 record_builtin_type (RID_MAX
, "unsigned short _Fract",
5463 unsigned_short_fract_type_node
);
5464 record_builtin_type (RID_MAX
, "unsigned _Fract",
5465 unsigned_fract_type_node
);
5466 record_builtin_type (RID_MAX
, "unsigned long _Fract",
5467 unsigned_long_fract_type_node
);
5468 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
5469 unsigned_long_long_fract_type_node
);
5470 record_builtin_type (RID_MAX
, "_Sat short _Fract",
5471 sat_short_fract_type_node
);
5472 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
5473 record_builtin_type (RID_MAX
, "_Sat long _Fract",
5474 sat_long_fract_type_node
);
5475 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
5476 sat_long_long_fract_type_node
);
5477 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
5478 sat_unsigned_short_fract_type_node
);
5479 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
5480 sat_unsigned_fract_type_node
);
5481 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
5482 sat_unsigned_long_fract_type_node
);
5483 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
5484 sat_unsigned_long_long_fract_type_node
);
5485 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
5486 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
5487 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
5488 record_builtin_type (RID_MAX
, "long long _Accum",
5489 long_long_accum_type_node
);
5490 record_builtin_type (RID_MAX
, "unsigned short _Accum",
5491 unsigned_short_accum_type_node
);
5492 record_builtin_type (RID_MAX
, "unsigned _Accum",
5493 unsigned_accum_type_node
);
5494 record_builtin_type (RID_MAX
, "unsigned long _Accum",
5495 unsigned_long_accum_type_node
);
5496 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
5497 unsigned_long_long_accum_type_node
);
5498 record_builtin_type (RID_MAX
, "_Sat short _Accum",
5499 sat_short_accum_type_node
);
5500 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
5501 record_builtin_type (RID_MAX
, "_Sat long _Accum",
5502 sat_long_accum_type_node
);
5503 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
5504 sat_long_long_accum_type_node
);
5505 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
5506 sat_unsigned_short_accum_type_node
);
5507 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
5508 sat_unsigned_accum_type_node
);
5509 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
5510 sat_unsigned_long_accum_type_node
);
5511 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
5512 sat_unsigned_long_long_accum_type_node
);
5516 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5518 get_identifier ("complex int"),
5519 complex_integer_type_node
));
5520 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5522 get_identifier ("complex float"),
5523 complex_float_type_node
));
5524 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5526 get_identifier ("complex double"),
5527 complex_double_type_node
));
5528 lang_hooks
.decls
.pushdecl
5529 (build_decl (UNKNOWN_LOCATION
,
5530 TYPE_DECL
, get_identifier ("complex long double"),
5531 complex_long_double_type_node
));
5533 if (!c_dialect_cxx ())
5534 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5535 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5538 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
5539 floatn_nx_types
[i
].extended
? "x" : "");
5540 lang_hooks
.decls
.pushdecl
5541 (build_decl (UNKNOWN_LOCATION
,
5543 get_identifier (buf
),
5544 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
5547 if (c_dialect_cxx ())
5548 /* For C++, make fileptr_type_node a distinct void * type until
5549 FILE type is defined. */
5550 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
5552 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
5554 /* Set the TYPE_NAME for any variants that were built before
5555 record_builtin_type gave names to the built-in types. */
5557 tree void_name
= TYPE_NAME (void_type_node
);
5558 TYPE_NAME (void_type_node
) = NULL_TREE
;
5559 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
5561 TYPE_NAME (void_type_node
) = void_name
;
5564 void_list_node
= build_void_list_node ();
5566 /* Make a type to be the domain of a few array types
5567 whose domains don't really matter.
5568 200 is small enough that it always fits in size_t
5569 and large enough that it can hold most function names for the
5570 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5571 array_domain_type
= build_index_type (size_int (200));
5573 /* Make a type for arrays of characters.
5574 With luck nothing will ever really depend on the length of this
5576 char_array_type_node
5577 = build_array_type (char_type_node
, array_domain_type
);
5579 string_type_node
= build_pointer_type (char_type_node
);
5580 const_string_type_node
5581 = build_pointer_type (build_qualified_type
5582 (char_type_node
, TYPE_QUAL_CONST
));
5584 /* This is special for C++ so functions can be overloaded. */
5585 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
5586 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
5587 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
5588 underlying_wchar_type_node
= wchar_type_node
;
5589 if (c_dialect_cxx ())
5591 if (TYPE_UNSIGNED (wchar_type_node
))
5592 wchar_type_node
= make_unsigned_type (wchar_type_size
);
5594 wchar_type_node
= make_signed_type (wchar_type_size
);
5595 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
5598 /* This is for wide string constants. */
5599 wchar_array_type_node
5600 = build_array_type (wchar_type_node
, array_domain_type
);
5602 /* Define 'char16_t'. */
5603 char16_type_node
= get_identifier (CHAR16_TYPE
);
5604 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
5605 char16_type_size
= TYPE_PRECISION (char16_type_node
);
5606 if (c_dialect_cxx ())
5608 char16_type_node
= make_unsigned_type (char16_type_size
);
5610 if (cxx_dialect
>= cxx11
)
5611 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
5614 /* This is for UTF-16 string constants. */
5615 char16_array_type_node
5616 = build_array_type (char16_type_node
, array_domain_type
);
5618 /* Define 'char32_t'. */
5619 char32_type_node
= get_identifier (CHAR32_TYPE
);
5620 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
5621 char32_type_size
= TYPE_PRECISION (char32_type_node
);
5622 if (c_dialect_cxx ())
5624 char32_type_node
= make_unsigned_type (char32_type_size
);
5626 if (cxx_dialect
>= cxx11
)
5627 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
5630 /* This is for UTF-32 string constants. */
5631 char32_array_type_node
5632 = build_array_type (char32_type_node
, array_domain_type
);
5635 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
5638 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
5640 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
5642 if (SIG_ATOMIC_TYPE
)
5643 sig_atomic_type_node
=
5644 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
5647 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
5650 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
5653 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
5656 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
5659 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
5661 c_uint16_type_node
= uint16_type_node
=
5662 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
5664 c_uint32_type_node
= uint32_type_node
=
5665 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
5667 c_uint64_type_node
= uint64_type_node
=
5668 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
5669 if (INT_LEAST8_TYPE
)
5670 int_least8_type_node
=
5671 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
5672 if (INT_LEAST16_TYPE
)
5673 int_least16_type_node
=
5674 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
5675 if (INT_LEAST32_TYPE
)
5676 int_least32_type_node
=
5677 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
5678 if (INT_LEAST64_TYPE
)
5679 int_least64_type_node
=
5680 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
5681 if (UINT_LEAST8_TYPE
)
5682 uint_least8_type_node
=
5683 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
5684 if (UINT_LEAST16_TYPE
)
5685 uint_least16_type_node
=
5686 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
5687 if (UINT_LEAST32_TYPE
)
5688 uint_least32_type_node
=
5689 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
5690 if (UINT_LEAST64_TYPE
)
5691 uint_least64_type_node
=
5692 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
5694 int_fast8_type_node
=
5695 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
5696 if (INT_FAST16_TYPE
)
5697 int_fast16_type_node
=
5698 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
5699 if (INT_FAST32_TYPE
)
5700 int_fast32_type_node
=
5701 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
5702 if (INT_FAST64_TYPE
)
5703 int_fast64_type_node
=
5704 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
5705 if (UINT_FAST8_TYPE
)
5706 uint_fast8_type_node
=
5707 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
5708 if (UINT_FAST16_TYPE
)
5709 uint_fast16_type_node
=
5710 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
5711 if (UINT_FAST32_TYPE
)
5712 uint_fast32_type_node
=
5713 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5714 if (UINT_FAST64_TYPE
)
5715 uint_fast64_type_node
=
5716 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5719 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5722 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5724 default_function_type
5725 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
5727 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5728 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5730 lang_hooks
.decls
.pushdecl
5731 (build_decl (UNKNOWN_LOCATION
,
5732 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5733 va_list_type_node
));
5734 if (targetm
.enum_va_list_p
)
5740 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
5742 lang_hooks
.decls
.pushdecl
5743 (build_decl (UNKNOWN_LOCATION
,
5744 TYPE_DECL
, get_identifier (pname
),
5750 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5752 va_list_arg_type_node
= va_list_ref_type_node
=
5753 build_pointer_type (TREE_TYPE (va_list_type_node
));
5757 va_list_arg_type_node
= va_list_type_node
;
5758 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5761 if (!flag_preprocess_only
)
5762 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5764 main_identifier_node
= get_identifier ("main");
5766 /* Create the built-in __null node. It is important that this is
5768 null_node
= make_int_cst (1, 1);
5769 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5771 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5772 memset (builtin_types
, 0, sizeof (builtin_types
));
5775 /* The number of named compound-literals generated thus far. */
5776 static GTY(()) int compound_literal_number
;
5778 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5781 set_compound_literal_name (tree decl
)
5784 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5785 compound_literal_number
);
5786 compound_literal_number
++;
5787 DECL_NAME (decl
) = get_identifier (name
);
5790 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5791 TYPE and operand OP. */
5794 build_va_arg_1 (location_t loc
, tree type
, tree op
)
5796 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
5797 SET_EXPR_LOCATION (expr
, loc
);
5801 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5802 va_arg (EXPR, TYPE) at source location LOC. */
5805 build_va_arg (location_t loc
, tree expr
, tree type
)
5807 tree va_type
= TREE_TYPE (expr
);
5808 tree canon_va_type
= (va_type
== error_mark_node
5810 : targetm
.canonical_va_list_type (va_type
));
5812 if (va_type
== error_mark_node
5813 || canon_va_type
== NULL_TREE
)
5815 if (canon_va_type
== NULL_TREE
)
5816 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
5818 /* Let's handle things neutrallly, if expr:
5819 - has undeclared type, or
5820 - is not an va_list type. */
5821 return build_va_arg_1 (loc
, type
, error_mark_node
);
5824 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
5826 /* Case 1: Not an array type. */
5828 /* Take the address, to get '&ap'. */
5829 mark_addressable (expr
);
5830 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
5832 /* Verify that &ap is still recognized as having va_list type. */
5833 tree canon_expr_type
5834 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
5835 gcc_assert (canon_expr_type
!= NULL_TREE
);
5837 return build_va_arg_1 (loc
, type
, expr
);
5840 /* Case 2: Array type.
5844 For contrast, let's start with the simple case (case 1). If
5845 canon_va_type is not an array type, but say a char *, then when
5846 passing-by-value a va_list, the type of the va_list param decl is
5847 the same as for another va_list decl (all ap's are char *):
5850 D.1815 = VA_ARG (&ap, 0B, 1);
5856 __builtin_va_start (&ap, 0);
5859 __builtin_va_end (&ap);
5863 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5864 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5865 the same as for another va_list decl (case 2a, struct ap[1]).
5868 D.1844 = VA_ARG (ap, 0B, 0);
5873 __builtin_va_start (&ap, 0);
5875 __builtin_va_end (&ap);
5879 Case 2b is different because:
5880 - on the callee side, the parm decl has declared type va_list, but
5881 grokdeclarator changes the type of the parm decl to a pointer to the
5883 - on the caller side, the pass-by-value uses &ap.
5885 We unify these two cases (case 2a: va_list is array type,
5886 case 2b: va_list is pointer to array elem type), by adding '&' for the
5887 array type case, such that we have a pointer to array elem in both
5890 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
5892 /* Case 2a: va_list is array type. */
5894 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5896 mark_addressable (expr
);
5897 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
5900 /* Verify that &ap is still recognized as having va_list type. */
5901 tree canon_expr_type
5902 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
5903 gcc_assert (canon_expr_type
!= NULL_TREE
);
5907 /* Case 2b: va_list is pointer to array elem type. */
5908 gcc_assert (POINTER_TYPE_P (va_type
));
5910 /* Comparison as in std_canonical_va_list_type. */
5911 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
5912 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
5914 /* Don't take the address. We've already got '&ap'. */
5918 return build_va_arg_1 (loc
, type
, expr
);
5922 /* Linked list of disabled built-in functions. */
5924 struct disabled_builtin
5927 struct disabled_builtin
*next
;
5929 static disabled_builtin
*disabled_builtins
= NULL
;
5931 static bool builtin_function_disabled_p (const char *);
5933 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5934 begins with "__builtin_", give an error. */
5937 disable_builtin_function (const char *name
)
5939 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5940 error ("cannot disable built-in function %qs", name
);
5943 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5944 new_disabled_builtin
->name
= name
;
5945 new_disabled_builtin
->next
= disabled_builtins
;
5946 disabled_builtins
= new_disabled_builtin
;
5951 /* Return true if the built-in function NAME has been disabled, false
5955 builtin_function_disabled_p (const char *name
)
5957 disabled_builtin
*p
;
5958 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
5960 if (strcmp (name
, p
->name
) == 0)
5967 /* Worker for DEF_BUILTIN.
5968 Possibly define a builtin function with one or two names.
5969 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5970 nonansi_p and flag_no_nonansi_builtin. */
5973 def_builtin_1 (enum built_in_function fncode
,
5975 enum built_in_class fnclass
,
5976 tree fntype
, tree libtype
,
5977 bool both_p
, bool fallback_p
, bool nonansi_p
,
5978 tree fnattrs
, bool implicit_p
)
5981 const char *libname
;
5983 if (fntype
== error_mark_node
)
5986 gcc_assert ((!both_p
&& !fallback_p
)
5987 || !strncmp (name
, "__builtin_",
5988 strlen ("__builtin_")));
5990 libname
= name
+ strlen ("__builtin_");
5991 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
5992 (fallback_p
? libname
: NULL
),
5995 set_builtin_decl (fncode
, decl
, implicit_p
);
5998 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
5999 && !(nonansi_p
&& flag_no_nonansi_builtin
))
6000 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
6004 /* Nonzero if the type T promotes to int. This is (nearly) the
6005 integral promotions defined in ISO C99 6.3.1.1/2. */
6008 c_promoting_integer_type_p (const_tree t
)
6010 switch (TREE_CODE (t
))
6013 return (TYPE_MAIN_VARIANT (t
) == char_type_node
6014 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
6015 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
6016 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
6017 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
6018 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
6021 /* ??? Technically all enumerations not larger than an int
6022 promote to an int. But this is used along code paths
6023 that only want to notice a size change. */
6024 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
6034 /* Return 1 if PARMS specifies a fixed number of parameters
6035 and none of their types is affected by default promotions. */
6038 self_promoting_args_p (const_tree parms
)
6041 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
6043 tree type
= TREE_VALUE (t
);
6045 if (type
== error_mark_node
)
6048 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
6054 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
6057 if (c_promoting_integer_type_p (type
))
6063 /* Recursively remove any '*' or '&' operator from TYPE. */
6065 strip_pointer_operator (tree t
)
6067 while (POINTER_TYPE_P (t
))
6072 /* Recursively remove pointer or array type from TYPE. */
6074 strip_pointer_or_array_types (tree t
)
6076 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
6081 /* Used to compare case labels. K1 and K2 are actually tree nodes
6082 representing case labels, or NULL_TREE for a `default' label.
6083 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6084 K2, and 0 if K1 and K2 are equal. */
6087 case_compare (splay_tree_key k1
, splay_tree_key k2
)
6089 /* Consider a NULL key (such as arises with a `default' label) to be
6090 smaller than anything else. */
6096 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
6099 /* Process a case label, located at LOC, for the range LOW_VALUE
6100 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6101 then this case label is actually a `default' label. If only
6102 HIGH_VALUE is NULL_TREE, then case label was declared using the
6103 usual C/C++ syntax, rather than the GNU case range extension.
6104 CASES is a tree containing all the case ranges processed so far;
6105 COND is the condition for the switch-statement itself.
6106 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6107 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6108 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6111 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
6112 tree low_value
, tree high_value
, bool *outside_range_p
)
6117 splay_tree_node node
;
6119 /* Create the LABEL_DECL itself. */
6120 label
= create_artificial_label (loc
);
6122 /* If there was an error processing the switch condition, bail now
6123 before we get more confused. */
6124 if (!cond
|| cond
== error_mark_node
)
6127 if ((low_value
&& TREE_TYPE (low_value
)
6128 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
6129 || (high_value
&& TREE_TYPE (high_value
)
6130 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
6132 error_at (loc
, "pointers are not permitted as case values");
6136 /* Case ranges are a GNU extension. */
6138 pedwarn (loc
, OPT_Wpedantic
,
6139 "range expressions in switch statements are non-standard");
6141 type
= TREE_TYPE (cond
);
6144 low_value
= check_case_value (loc
, low_value
);
6145 low_value
= convert_and_check (loc
, type
, low_value
);
6146 if (low_value
== error_mark_node
)
6151 high_value
= check_case_value (loc
, high_value
);
6152 high_value
= convert_and_check (loc
, type
, high_value
);
6153 if (high_value
== error_mark_node
)
6157 if (low_value
&& high_value
)
6159 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6160 really a case range, even though it was written that way.
6161 Remove the HIGH_VALUE to simplify later processing. */
6162 if (tree_int_cst_equal (low_value
, high_value
))
6163 high_value
= NULL_TREE
;
6164 else if (!tree_int_cst_lt (low_value
, high_value
))
6165 warning_at (loc
, 0, "empty range specified");
6168 /* See if the case is in range of the type of the original testing
6169 expression. If both low_value and high_value are out of range,
6170 don't insert the case label and return NULL_TREE. */
6172 && !check_case_bounds (loc
, type
, orig_type
,
6173 &low_value
, high_value
? &high_value
: NULL
,
6177 /* Look up the LOW_VALUE in the table of case labels we already
6179 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
6180 /* If there was not an exact match, check for overlapping ranges.
6181 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6182 that's a `default' label and the only overlap is an exact match. */
6183 if (!node
&& (low_value
|| high_value
))
6185 splay_tree_node low_bound
;
6186 splay_tree_node high_bound
;
6188 /* Even though there wasn't an exact match, there might be an
6189 overlap between this case range and another case range.
6190 Since we've (inductively) not allowed any overlapping case
6191 ranges, we simply need to find the greatest low case label
6192 that is smaller that LOW_VALUE, and the smallest low case
6193 label that is greater than LOW_VALUE. If there is an overlap
6194 it will occur in one of these two ranges. */
6195 low_bound
= splay_tree_predecessor (cases
,
6196 (splay_tree_key
) low_value
);
6197 high_bound
= splay_tree_successor (cases
,
6198 (splay_tree_key
) low_value
);
6200 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6201 the LOW_VALUE, so there is no need to check unless the
6202 LOW_BOUND is in fact itself a case range. */
6204 && CASE_HIGH ((tree
) low_bound
->value
)
6205 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
6208 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6209 range is bigger than the low end of the current range, so we
6210 are only interested if the current range is a real range, and
6211 not an ordinary case label. */
6214 && (tree_int_cst_compare ((tree
) high_bound
->key
,
6219 /* If there was an overlap, issue an error. */
6222 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
6226 error_at (loc
, "duplicate (or overlapping) case value");
6227 error_at (DECL_SOURCE_LOCATION (duplicate
),
6228 "this is the first entry overlapping that value");
6232 error_at (loc
, "duplicate case value") ;
6233 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
6237 error_at (loc
, "multiple default labels in one switch");
6238 error_at (DECL_SOURCE_LOCATION (duplicate
),
6239 "this is the first default label");
6244 /* Add a CASE_LABEL to the statement-tree. */
6245 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
6246 /* Register this case label in the splay tree. */
6247 splay_tree_insert (cases
,
6248 (splay_tree_key
) low_value
,
6249 (splay_tree_value
) case_label
);
6254 /* Add a label so that the back-end doesn't think that the beginning of
6255 the switch is unreachable. Note that we do not add a case label, as
6256 that just leads to duplicates and thence to failure later on. */
6259 tree t
= create_artificial_label (loc
);
6260 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
6262 return error_mark_node
;
6265 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6266 Used to verify that case values match up with enumerator values. */
6269 match_case_to_enum_1 (tree key
, tree type
, tree label
)
6271 char buf
[WIDE_INT_PRINT_BUFFER_SIZE
];
6273 if (tree_fits_uhwi_p (key
))
6274 print_dec (key
, buf
, UNSIGNED
);
6275 else if (tree_fits_shwi_p (key
))
6276 print_dec (key
, buf
, SIGNED
);
6278 print_hex (key
, buf
);
6280 if (TYPE_NAME (type
) == 0)
6281 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6282 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6283 "case value %qs not in enumerated type",
6286 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6287 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6288 "case value %qs not in enumerated type %qT",
6292 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6293 Used to verify that case values match up with enumerator values. */
6296 match_case_to_enum (splay_tree_node node
, void *data
)
6298 tree label
= (tree
) node
->value
;
6299 tree type
= (tree
) data
;
6301 /* Skip default case. */
6302 if (!CASE_LOW (label
))
6305 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6306 when we did our enum->case scan. Reset our scratch bit after. */
6307 if (!CASE_LOW_SEEN (label
))
6308 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
6310 CASE_LOW_SEEN (label
) = 0;
6312 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6313 not set, that means that CASE_HIGH did not appear when we did our
6314 enum->case scan. Reset our scratch bit after. */
6315 if (CASE_HIGH (label
))
6317 if (!CASE_HIGH_SEEN (label
))
6318 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
6320 CASE_HIGH_SEEN (label
) = 0;
6326 /* Handle -Wswitch*. Called from the front end after parsing the
6327 switch construct. */
6328 /* ??? Should probably be somewhere generic, since other languages
6329 besides C and C++ would want this. At the moment, however, C/C++
6330 are the only tree-ssa languages that support enumerations at all,
6331 so the point is moot. */
6334 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
6335 tree type
, tree cond
, bool bool_cond_p
,
6336 bool outside_range_p
)
6338 splay_tree_node default_node
;
6339 splay_tree_node node
;
6342 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
6343 && !warn_switch_bool
)
6346 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
6348 warning_at (switch_location
, OPT_Wswitch_default
,
6349 "switch missing default case");
6351 /* There are certain cases where -Wswitch-bool warnings aren't
6358 so be careful here. */
6359 if (warn_switch_bool
&& bool_cond_p
)
6361 splay_tree_node min_node
;
6362 /* If there's a default node, it's also the value with the minimal
6363 key. So look at the penultimate key (if any). */
6365 min_node
= splay_tree_successor (cases
, (splay_tree_key
) NULL
);
6367 min_node
= splay_tree_min (cases
);
6368 tree min
= min_node
? (tree
) min_node
->key
: NULL_TREE
;
6370 splay_tree_node max_node
= splay_tree_max (cases
);
6371 /* This might be a case range, so look at the value with the
6372 maximal key and then check CASE_HIGH. */
6373 tree max
= max_node
? (tree
) max_node
->value
: NULL_TREE
;
6375 max
= CASE_HIGH (max
) ? CASE_HIGH (max
) : CASE_LOW (max
);
6377 /* If there's a case value > 1 or < 0, that is outside bool
6380 || (max
&& wi::gts_p (max
, 1))
6381 || (min
&& wi::lts_p (min
, 0))
6389 case, where we want to warn. */
6391 && max
&& wi::eq_p (max
, 1)
6392 && min
&& wi::eq_p (min
, 0)))
6393 warning_at (switch_location
, OPT_Wswitch_bool
,
6394 "switch condition has boolean value");
6397 /* From here on, we only care about enumerated types. */
6398 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
6401 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6402 if (!warn_switch_enum
&& !warn_switch
)
6405 /* Check the cases. Warn about case values which are not members of
6406 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6407 there is no default case, check that exactly all enumeration
6408 literals are covered by the cases. */
6410 /* Clearing COND if it is not an integer constant simplifies
6411 the tests inside the loop below. */
6412 if (TREE_CODE (cond
) != INTEGER_CST
)
6415 /* The time complexity here is O(N*lg(N)) worst case, but for the
6416 common case of monotonically increasing enumerators, it is
6417 O(N), since the nature of the splay tree will keep the next
6418 element adjacent to the root at all times. */
6420 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
6422 tree value
= TREE_VALUE (chain
);
6423 if (TREE_CODE (value
) == CONST_DECL
)
6424 value
= DECL_INITIAL (value
);
6425 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
6428 /* Mark the CASE_LOW part of the case entry as seen. */
6429 tree label
= (tree
) node
->value
;
6430 CASE_LOW_SEEN (label
) = 1;
6434 /* Even though there wasn't an exact match, there might be a
6435 case range which includes the enumerator's value. */
6436 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
6437 if (node
&& CASE_HIGH ((tree
) node
->value
))
6439 tree label
= (tree
) node
->value
;
6440 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
6443 /* If we match the upper bound exactly, mark the CASE_HIGH
6444 part of the case entry as seen. */
6446 CASE_HIGH_SEEN (label
) = 1;
6451 /* We've now determined that this enumerated literal isn't
6452 handled by the case labels of the switch statement. */
6454 /* If the switch expression is a constant, we only really care
6455 about whether that constant is handled by the switch. */
6456 if (cond
&& tree_int_cst_compare (cond
, value
))
6459 /* If there is a default_node, the only relevant option is
6460 Wswitch-enum. Otherwise, if both are enabled then we prefer
6461 to warn using -Wswitch because -Wswitch is enabled by -Wall
6462 while -Wswitch-enum is explicit. */
6463 warning_at (switch_location
,
6464 (default_node
|| !warn_switch
6467 "enumeration value %qE not handled in switch",
6468 TREE_PURPOSE (chain
));
6471 /* Warn if there are case expressions that don't correspond to
6472 enumerators. This can occur since C and C++ don't enforce
6473 type-checking of assignments to enumeration variables.
6475 The time complexity here is now always O(N) worst case, since
6476 we should have marked both the lower bound and upper bound of
6477 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6478 above. This scan also resets those fields. */
6480 splay_tree_foreach (cases
, match_case_to_enum
, type
);
6483 /* Finish an expression taking the address of LABEL (an
6484 IDENTIFIER_NODE). Returns an expression for the address.
6486 LOC is the location for the expression returned. */
6489 finish_label_address_expr (tree label
, location_t loc
)
6493 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
6495 if (label
== error_mark_node
)
6496 return error_mark_node
;
6498 label
= lookup_label (label
);
6499 if (label
== NULL_TREE
)
6500 result
= null_pointer_node
;
6503 TREE_USED (label
) = 1;
6504 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
6505 /* The current function is not necessarily uninlinable.
6506 Computed gotos are incompatible with inlining, but the value
6507 here could be used only in a diagnostic, for example. */
6508 protected_set_expr_location (result
, loc
);
6515 /* Given a boolean expression ARG, return a tree representing an increment
6516 or decrement (as indicated by CODE) of ARG. The front end must check for
6517 invalid cases (e.g., decrement in C++). */
6519 boolean_increment (enum tree_code code
, tree arg
)
6522 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
6524 arg
= stabilize_reference (arg
);
6527 case PREINCREMENT_EXPR
:
6528 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6530 case POSTINCREMENT_EXPR
:
6531 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6532 arg
= save_expr (arg
);
6533 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6534 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6536 case PREDECREMENT_EXPR
:
6537 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6538 invert_truthvalue_loc (input_location
, arg
));
6540 case POSTDECREMENT_EXPR
:
6541 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6542 invert_truthvalue_loc (input_location
, arg
));
6543 arg
= save_expr (arg
);
6544 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6545 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6550 TREE_SIDE_EFFECTS (val
) = 1;
6554 /* Built-in macros for stddef.h and stdint.h, that require macros
6555 defined in this file. */
6557 c_stddef_cpp_builtins(void)
6559 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
6560 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
6561 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
6562 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
6563 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
6564 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
6565 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
6566 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
6567 if (SIG_ATOMIC_TYPE
)
6568 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
6570 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
6572 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
6574 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
6576 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
6578 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
6580 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
6582 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
6584 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
6585 if (INT_LEAST8_TYPE
)
6586 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
6587 if (INT_LEAST16_TYPE
)
6588 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
6589 if (INT_LEAST32_TYPE
)
6590 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
6591 if (INT_LEAST64_TYPE
)
6592 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
6593 if (UINT_LEAST8_TYPE
)
6594 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
6595 if (UINT_LEAST16_TYPE
)
6596 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
6597 if (UINT_LEAST32_TYPE
)
6598 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
6599 if (UINT_LEAST64_TYPE
)
6600 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
6602 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
6603 if (INT_FAST16_TYPE
)
6604 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
6605 if (INT_FAST32_TYPE
)
6606 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
6607 if (INT_FAST64_TYPE
)
6608 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
6609 if (UINT_FAST8_TYPE
)
6610 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
6611 if (UINT_FAST16_TYPE
)
6612 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
6613 if (UINT_FAST32_TYPE
)
6614 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
6615 if (UINT_FAST64_TYPE
)
6616 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
6618 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
6620 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
6624 c_init_attributes (void)
6626 /* Fill in the built_in_attributes array. */
6627 #define DEF_ATTR_NULL_TREE(ENUM) \
6628 built_in_attributes[(int) ENUM] = NULL_TREE;
6629 #define DEF_ATTR_INT(ENUM, VALUE) \
6630 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6631 #define DEF_ATTR_STRING(ENUM, VALUE) \
6632 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6633 #define DEF_ATTR_IDENT(ENUM, STRING) \
6634 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6635 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6636 built_in_attributes[(int) ENUM] \
6637 = tree_cons (built_in_attributes[(int) PURPOSE], \
6638 built_in_attributes[(int) VALUE], \
6639 built_in_attributes[(int) CHAIN]);
6640 #include "builtin-attrs.def"
6641 #undef DEF_ATTR_NULL_TREE
6643 #undef DEF_ATTR_IDENT
6644 #undef DEF_ATTR_TREE_LIST
6647 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6648 identifier as an argument, so the front end shouldn't look it up. */
6651 attribute_takes_identifier_p (const_tree attr_id
)
6653 const struct attribute_spec
*spec
= lookup_attribute_spec (attr_id
);
6655 /* Unknown attribute that we'll end up ignoring, return true so we
6656 don't complain about an identifier argument. */
6658 else if (!strcmp ("mode", spec
->name
)
6659 || !strcmp ("format", spec
->name
)
6660 || !strcmp ("cleanup", spec
->name
))
6663 return targetm
.attribute_takes_identifier_p (attr_id
);
6666 /* Attribute handlers common to C front ends. */
6668 /* Handle a "packed" attribute; arguments as in
6669 struct attribute_spec.handler. */
6672 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6673 int flags
, bool *no_add_attrs
)
6677 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6678 *node
= build_variant_type_copy (*node
);
6679 TYPE_PACKED (*node
) = 1;
6681 else if (TREE_CODE (*node
) == FIELD_DECL
)
6683 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
6684 /* Still pack bitfields. */
6685 && ! DECL_INITIAL (*node
))
6686 warning (OPT_Wattributes
,
6687 "%qE attribute ignored for field of type %qT",
6688 name
, TREE_TYPE (*node
));
6690 DECL_PACKED (*node
) = 1;
6692 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6693 used for DECL_REGISTER. It wouldn't mean anything anyway.
6694 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6695 that changes what the typedef is typing. */
6698 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6699 *no_add_attrs
= true;
6705 /* Handle a "nocommon" attribute; arguments as in
6706 struct attribute_spec.handler. */
6709 handle_nocommon_attribute (tree
*node
, tree name
,
6710 tree
ARG_UNUSED (args
),
6711 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6714 DECL_COMMON (*node
) = 0;
6717 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6718 *no_add_attrs
= true;
6724 /* Handle a "common" attribute; arguments as in
6725 struct attribute_spec.handler. */
6728 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6729 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6732 DECL_COMMON (*node
) = 1;
6735 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6736 *no_add_attrs
= true;
6742 /* Handle a "noreturn" attribute; arguments as in
6743 struct attribute_spec.handler. */
6746 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6747 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6749 tree type
= TREE_TYPE (*node
);
6751 /* See FIXME comment in c_common_attribute_table. */
6752 if (TREE_CODE (*node
) == FUNCTION_DECL
6753 || objc_method_decl (TREE_CODE (*node
)))
6754 TREE_THIS_VOLATILE (*node
) = 1;
6755 else if (TREE_CODE (type
) == POINTER_TYPE
6756 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6758 = (build_qualified_type
6760 (build_type_variant (TREE_TYPE (type
),
6761 TYPE_READONLY (TREE_TYPE (type
)), 1)),
6762 TYPE_QUALS (type
)));
6765 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6766 *no_add_attrs
= true;
6772 /* Handle a "hot" and attribute; arguments as in
6773 struct attribute_spec.handler. */
6776 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6777 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6779 if (TREE_CODE (*node
) == FUNCTION_DECL
6780 || TREE_CODE (*node
) == LABEL_DECL
)
6782 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
6784 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6785 "with attribute %qs", name
, "cold");
6786 *no_add_attrs
= true;
6788 /* Most of the rest of the hot processing is done later with
6789 lookup_attribute. */
6793 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6794 *no_add_attrs
= true;
6800 /* Handle a "cold" and attribute; arguments as in
6801 struct attribute_spec.handler. */
6804 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6805 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6807 if (TREE_CODE (*node
) == FUNCTION_DECL
6808 || TREE_CODE (*node
) == LABEL_DECL
)
6810 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
6812 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6813 "with attribute %qs", name
, "hot");
6814 *no_add_attrs
= true;
6816 /* Most of the rest of the cold processing is done later with
6817 lookup_attribute. */
6821 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6822 *no_add_attrs
= true;
6828 /* Handle a "no_sanitize_address" attribute; arguments as in
6829 struct attribute_spec.handler. */
6832 handle_no_sanitize_address_attribute (tree
*node
, tree name
, tree
, int,
6835 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6837 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6838 *no_add_attrs
= true;
6844 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6845 struct attribute_spec.handler. */
6848 handle_no_address_safety_analysis_attribute (tree
*node
, tree name
, tree
, int,
6851 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6852 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6853 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node
)))
6854 DECL_ATTRIBUTES (*node
)
6855 = tree_cons (get_identifier ("no_sanitize_address"),
6856 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6857 *no_add_attrs
= true;
6861 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6862 struct attribute_spec.handler. */
6865 handle_no_sanitize_undefined_attribute (tree
*node
, tree name
, tree
, int,
6868 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6870 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6871 *no_add_attrs
= true;
6877 /* Handle a "stack_protect" attribute; arguments as in
6878 struct attribute_spec.handler. */
6880 handle_stack_protect_attribute (tree
*node
, tree name
, tree
, int,
6883 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6885 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6886 *no_add_attrs
= true;
6889 DECL_ATTRIBUTES (*node
)
6890 = tree_cons (get_identifier ("stack_protect"),
6891 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6896 /* Handle a "noinline" attribute; arguments as in
6897 struct attribute_spec.handler. */
6900 handle_noinline_attribute (tree
*node
, tree name
,
6901 tree
ARG_UNUSED (args
),
6902 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6904 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6906 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
6908 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6909 "with attribute %qs", name
, "always_inline");
6910 *no_add_attrs
= true;
6913 DECL_UNINLINABLE (*node
) = 1;
6917 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6918 *no_add_attrs
= true;
6924 /* Handle a "noclone" attribute; arguments as in
6925 struct attribute_spec.handler. */
6928 handle_noclone_attribute (tree
*node
, tree name
,
6929 tree
ARG_UNUSED (args
),
6930 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6932 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6934 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6935 *no_add_attrs
= true;
6941 /* Handle a "no_icf" attribute; arguments as in
6942 struct attribute_spec.handler. */
6945 handle_noicf_attribute (tree
*node
, tree name
,
6946 tree
ARG_UNUSED (args
),
6947 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6949 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6951 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6952 *no_add_attrs
= true;
6959 /* Handle a "always_inline" attribute; arguments as in
6960 struct attribute_spec.handler. */
6963 handle_always_inline_attribute (tree
*node
, tree name
,
6964 tree
ARG_UNUSED (args
),
6965 int ARG_UNUSED (flags
),
6968 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6970 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node
)))
6972 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6973 "with %qs attribute", name
, "noinline");
6974 *no_add_attrs
= true;
6976 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
6978 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6979 "with %qs attribute", name
, "target_clones");
6980 *no_add_attrs
= true;
6983 /* Set the attribute and mark it for disregarding inline
6985 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
6989 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6990 *no_add_attrs
= true;
6996 /* Handle a "gnu_inline" attribute; arguments as in
6997 struct attribute_spec.handler. */
7000 handle_gnu_inline_attribute (tree
*node
, tree name
,
7001 tree
ARG_UNUSED (args
),
7002 int ARG_UNUSED (flags
),
7005 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7007 /* Do nothing else, just set the attribute. We'll get at
7008 it later with lookup_attribute. */
7012 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7013 *no_add_attrs
= true;
7019 /* Handle a "leaf" attribute; arguments as in
7020 struct attribute_spec.handler. */
7023 handle_leaf_attribute (tree
*node
, tree name
,
7024 tree
ARG_UNUSED (args
),
7025 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7027 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7029 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7030 *no_add_attrs
= true;
7032 if (!TREE_PUBLIC (*node
))
7034 warning (OPT_Wattributes
, "%qE attribute has no effect on unit local functions", name
);
7035 *no_add_attrs
= true;
7041 /* Handle an "artificial" attribute; arguments as in
7042 struct attribute_spec.handler. */
7045 handle_artificial_attribute (tree
*node
, tree name
,
7046 tree
ARG_UNUSED (args
),
7047 int ARG_UNUSED (flags
),
7050 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7052 /* Do nothing else, just set the attribute. We'll get at
7053 it later with lookup_attribute. */
7057 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7058 *no_add_attrs
= true;
7064 /* Handle a "flatten" attribute; arguments as in
7065 struct attribute_spec.handler. */
7068 handle_flatten_attribute (tree
*node
, tree name
,
7069 tree args ATTRIBUTE_UNUSED
,
7070 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
7072 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7073 /* Do nothing else, just set the attribute. We'll get at
7074 it later with lookup_attribute. */
7078 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7079 *no_add_attrs
= true;
7085 /* Handle a "warning" or "error" attribute; arguments as in
7086 struct attribute_spec.handler. */
7089 handle_error_attribute (tree
*node
, tree name
, tree args
,
7090 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7092 if (TREE_CODE (*node
) == FUNCTION_DECL
7093 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
7094 /* Do nothing else, just set the attribute. We'll get at
7095 it later with lookup_attribute. */
7099 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7100 *no_add_attrs
= true;
7106 /* Handle a "used" attribute; arguments as in
7107 struct attribute_spec.handler. */
7110 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
7111 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7115 if (TREE_CODE (node
) == FUNCTION_DECL
7116 || (VAR_P (node
) && TREE_STATIC (node
))
7117 || (TREE_CODE (node
) == TYPE_DECL
))
7119 TREE_USED (node
) = 1;
7120 DECL_PRESERVE_P (node
) = 1;
7122 DECL_READ_P (node
) = 1;
7126 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7127 *no_add_attrs
= true;
7133 /* Handle a "unused" attribute; arguments as in
7134 struct attribute_spec.handler. */
7137 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7138 int flags
, bool *no_add_attrs
)
7144 if (TREE_CODE (decl
) == PARM_DECL
7145 || VAR_OR_FUNCTION_DECL_P (decl
)
7146 || TREE_CODE (decl
) == LABEL_DECL
7147 || TREE_CODE (decl
) == CONST_DECL
7148 || TREE_CODE (decl
) == TYPE_DECL
)
7150 TREE_USED (decl
) = 1;
7151 if (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
7152 DECL_READ_P (decl
) = 1;
7156 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7157 *no_add_attrs
= true;
7162 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7163 *node
= build_variant_type_copy (*node
);
7164 TREE_USED (*node
) = 1;
7170 /* Handle a "externally_visible" attribute; arguments as in
7171 struct attribute_spec.handler. */
7174 handle_externally_visible_attribute (tree
*pnode
, tree name
,
7175 tree
ARG_UNUSED (args
),
7176 int ARG_UNUSED (flags
),
7181 if (VAR_OR_FUNCTION_DECL_P (node
))
7183 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
7184 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
7186 warning (OPT_Wattributes
,
7187 "%qE attribute have effect only on public objects", name
);
7188 *no_add_attrs
= true;
7193 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7194 *no_add_attrs
= true;
7200 /* Handle the "no_reorder" attribute. Arguments as in
7201 struct attribute_spec.handler. */
7204 handle_no_reorder_attribute (tree
*pnode
,
7212 if (!VAR_OR_FUNCTION_DECL_P (node
)
7213 && !(TREE_STATIC (node
) || DECL_EXTERNAL (node
)))
7215 warning (OPT_Wattributes
,
7216 "%qE attribute only affects top level objects",
7218 *no_add_attrs
= true;
7224 /* Handle a "const" attribute; arguments as in
7225 struct attribute_spec.handler. */
7228 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7229 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7231 tree type
= TREE_TYPE (*node
);
7233 /* See FIXME comment on noreturn in c_common_attribute_table. */
7234 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7235 TREE_READONLY (*node
) = 1;
7236 else if (TREE_CODE (type
) == POINTER_TYPE
7237 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
7239 = (build_qualified_type
7241 (build_type_variant (TREE_TYPE (type
), 1,
7242 TREE_THIS_VOLATILE (TREE_TYPE (type
)))),
7243 TYPE_QUALS (type
)));
7246 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7247 *no_add_attrs
= true;
7253 /* Handle a "scalar_storage_order" attribute; arguments as in
7254 struct attribute_spec.handler. */
7257 handle_scalar_storage_order_attribute (tree
*node
, tree name
, tree args
,
7258 int flags
, bool *no_add_attrs
)
7260 tree id
= TREE_VALUE (args
);
7263 if (TREE_CODE (*node
) == TYPE_DECL
7264 && ! (flags
& ATTR_FLAG_CXX11
))
7265 node
= &TREE_TYPE (*node
);
7268 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
)
7270 error ("scalar_storage_order is not supported because endianness "
7275 if (RECORD_OR_UNION_TYPE_P (type
) && !c_dialect_cxx ())
7277 bool reverse
= false;
7279 if (TREE_CODE (id
) == STRING_CST
7280 && strcmp (TREE_STRING_POINTER (id
), "big-endian") == 0)
7281 reverse
= !BYTES_BIG_ENDIAN
;
7282 else if (TREE_CODE (id
) == STRING_CST
7283 && strcmp (TREE_STRING_POINTER (id
), "little-endian") == 0)
7284 reverse
= BYTES_BIG_ENDIAN
;
7287 error ("scalar_storage_order argument must be one of \"big-endian\""
7288 " or \"little-endian\"");
7292 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7295 /* A type variant isn't good enough, since we don't want a cast
7296 to such a type to be removed as a no-op. */
7297 *node
= type
= build_duplicate_type (type
);
7300 TYPE_REVERSE_STORAGE_ORDER (type
) = reverse
;
7304 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7305 *no_add_attrs
= true;
7309 /* Handle a "transparent_union" attribute; arguments as in
7310 struct attribute_spec.handler. */
7313 handle_transparent_union_attribute (tree
*node
, tree name
,
7314 tree
ARG_UNUSED (args
), int flags
,
7319 *no_add_attrs
= true;
7321 if (TREE_CODE (*node
) == TYPE_DECL
7322 && ! (flags
& ATTR_FLAG_CXX11
))
7323 node
= &TREE_TYPE (*node
);
7326 if (TREE_CODE (type
) == UNION_TYPE
)
7328 /* Make sure that the first field will work for a transparent union.
7329 If the type isn't complete yet, leave the check to the code in
7331 if (TYPE_SIZE (type
))
7333 tree first
= first_field (type
);
7334 if (first
== NULL_TREE
7335 || DECL_ARTIFICIAL (first
)
7336 || TYPE_MODE (type
) != DECL_MODE (first
))
7340 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7342 /* If the type isn't complete yet, setting the flag
7343 on a variant wouldn't ever be checked. */
7344 if (!TYPE_SIZE (type
))
7347 /* build_duplicate_type doesn't work for C++. */
7348 if (c_dialect_cxx ())
7351 /* A type variant isn't good enough, since we don't want a cast
7352 to such a type to be removed as a no-op. */
7353 *node
= type
= build_duplicate_type (type
);
7356 for (tree t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7357 TYPE_TRANSPARENT_AGGR (t
) = 1;
7362 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7366 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7367 get the requested priority for a constructor or destructor,
7368 possibly issuing diagnostics for invalid or reserved
7371 static priority_type
7372 get_priority (tree args
, bool is_destructor
)
7378 return DEFAULT_INIT_PRIORITY
;
7380 if (!SUPPORTS_INIT_PRIORITY
)
7383 error ("destructor priorities are not supported");
7385 error ("constructor priorities are not supported");
7386 return DEFAULT_INIT_PRIORITY
;
7389 arg
= TREE_VALUE (args
);
7390 if (TREE_CODE (arg
) == IDENTIFIER_NODE
)
7392 if (arg
== error_mark_node
)
7393 return DEFAULT_INIT_PRIORITY
;
7394 arg
= default_conversion (arg
);
7395 if (!tree_fits_shwi_p (arg
)
7396 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
7399 pri
= tree_to_shwi (arg
);
7400 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
7403 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
7407 "destructor priorities from 0 to %d are reserved "
7408 "for the implementation",
7409 MAX_RESERVED_INIT_PRIORITY
);
7412 "constructor priorities from 0 to %d are reserved "
7413 "for the implementation",
7414 MAX_RESERVED_INIT_PRIORITY
);
7420 error ("destructor priorities must be integers from 0 to %d inclusive",
7423 error ("constructor priorities must be integers from 0 to %d inclusive",
7425 return DEFAULT_INIT_PRIORITY
;
7428 /* Handle a "constructor" attribute; arguments as in
7429 struct attribute_spec.handler. */
7432 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
7433 int ARG_UNUSED (flags
),
7437 tree type
= TREE_TYPE (decl
);
7439 if (TREE_CODE (decl
) == FUNCTION_DECL
7440 && TREE_CODE (type
) == FUNCTION_TYPE
7441 && decl_function_context (decl
) == 0)
7443 priority_type priority
;
7444 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
7445 priority
= get_priority (args
, /*is_destructor=*/false);
7446 SET_DECL_INIT_PRIORITY (decl
, priority
);
7447 TREE_USED (decl
) = 1;
7451 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7452 *no_add_attrs
= true;
7458 /* Handle a "destructor" attribute; arguments as in
7459 struct attribute_spec.handler. */
7462 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
7463 int ARG_UNUSED (flags
),
7467 tree type
= TREE_TYPE (decl
);
7469 if (TREE_CODE (decl
) == FUNCTION_DECL
7470 && TREE_CODE (type
) == FUNCTION_TYPE
7471 && decl_function_context (decl
) == 0)
7473 priority_type priority
;
7474 DECL_STATIC_DESTRUCTOR (decl
) = 1;
7475 priority
= get_priority (args
, /*is_destructor=*/true);
7476 SET_DECL_FINI_PRIORITY (decl
, priority
);
7477 TREE_USED (decl
) = 1;
7481 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7482 *no_add_attrs
= true;
7488 /* Nonzero if the mode is a valid vector mode for this architecture.
7489 This returns nonzero even if there is no hardware support for the
7490 vector mode, but we can emulate with narrower modes. */
7493 vector_mode_valid_p (machine_mode mode
)
7495 enum mode_class mclass
= GET_MODE_CLASS (mode
);
7496 machine_mode innermode
;
7498 /* Doh! What's going on? */
7499 if (mclass
!= MODE_VECTOR_INT
7500 && mclass
!= MODE_VECTOR_FLOAT
7501 && mclass
!= MODE_VECTOR_FRACT
7502 && mclass
!= MODE_VECTOR_UFRACT
7503 && mclass
!= MODE_VECTOR_ACCUM
7504 && mclass
!= MODE_VECTOR_UACCUM
)
7507 /* Hardware support. Woo hoo! */
7508 if (targetm
.vector_mode_supported_p (mode
))
7511 innermode
= GET_MODE_INNER (mode
);
7513 /* We should probably return 1 if requesting V4DI and we have no DI,
7514 but we have V2DI, but this is probably very unlikely. */
7516 /* If we have support for the inner mode, we can safely emulate it.
7517 We may not have V2DI, but me can emulate with a pair of DIs. */
7518 return targetm
.scalar_mode_supported_p (innermode
);
7522 /* Handle a "mode" attribute; arguments as in
7523 struct attribute_spec.handler. */
7526 handle_mode_attribute (tree
*node
, tree name
, tree args
,
7527 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7530 tree ident
= TREE_VALUE (args
);
7532 *no_add_attrs
= true;
7534 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
7535 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7539 const char *p
= IDENTIFIER_POINTER (ident
);
7540 int len
= strlen (p
);
7541 machine_mode mode
= VOIDmode
;
7545 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
7546 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
7548 char *newp
= (char *) alloca (len
- 1);
7550 strcpy (newp
, &p
[2]);
7551 newp
[len
- 4] = '\0';
7555 /* Change this type to have a type with the specified mode.
7556 First check for the special modes. */
7557 if (!strcmp (p
, "byte"))
7559 else if (!strcmp (p
, "word"))
7561 else if (!strcmp (p
, "pointer"))
7563 else if (!strcmp (p
, "libgcc_cmp_return"))
7564 mode
= targetm
.libgcc_cmp_return_mode ();
7565 else if (!strcmp (p
, "libgcc_shift_count"))
7566 mode
= targetm
.libgcc_shift_count_mode ();
7567 else if (!strcmp (p
, "unwind_word"))
7568 mode
= targetm
.unwind_word_mode ();
7570 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
7571 if (!strcmp (p
, GET_MODE_NAME (j
)))
7573 mode
= (machine_mode
) j
;
7577 if (mode
== VOIDmode
)
7579 error ("unknown machine mode %qE", ident
);
7584 switch (GET_MODE_CLASS (mode
))
7587 case MODE_PARTIAL_INT
:
7589 case MODE_DECIMAL_FLOAT
:
7594 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
7597 case MODE_COMPLEX_INT
:
7598 case MODE_COMPLEX_FLOAT
:
7599 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
7602 case MODE_VECTOR_INT
:
7603 case MODE_VECTOR_FLOAT
:
7604 case MODE_VECTOR_FRACT
:
7605 case MODE_VECTOR_UFRACT
:
7606 case MODE_VECTOR_ACCUM
:
7607 case MODE_VECTOR_UACCUM
:
7608 warning (OPT_Wattributes
, "specifying vector types with "
7609 "__attribute__ ((mode)) is deprecated");
7610 warning (OPT_Wattributes
,
7611 "use __attribute__ ((vector_size)) instead");
7612 valid_mode
= vector_mode_valid_p (mode
);
7620 error ("unable to emulate %qs", p
);
7624 if (POINTER_TYPE_P (type
))
7626 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
7627 tree (*fn
)(tree
, machine_mode
, bool);
7629 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
7631 error ("invalid pointer mode %qs", p
);
7635 if (TREE_CODE (type
) == POINTER_TYPE
)
7636 fn
= build_pointer_type_for_mode
;
7638 fn
= build_reference_type_for_mode
;
7639 typefm
= fn (TREE_TYPE (type
), mode
, false);
7643 /* For fixed-point modes, we need to test if the signness of type
7644 and the machine mode are consistent. */
7645 if (ALL_FIXED_POINT_MODE_P (mode
)
7646 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
7648 error ("signedness of type and machine mode %qs don%'t match", p
);
7651 /* For fixed-point modes, we need to pass saturating info. */
7652 typefm
= lang_hooks
.types
.type_for_mode (mode
,
7653 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
7654 : TYPE_UNSIGNED (type
));
7657 if (typefm
== NULL_TREE
)
7659 error ("no data type for mode %qs", p
);
7662 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
7664 /* For enumeral types, copy the precision from the integer
7665 type returned above. If not an INTEGER_TYPE, we can't use
7666 this mode for this type. */
7667 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
7669 error ("cannot use mode %qs for enumeral types", p
);
7673 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
7675 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
7680 /* We cannot build a type variant, as there's code that assumes
7681 that TYPE_MAIN_VARIANT has the same mode. This includes the
7682 debug generators. Instead, create a subrange type. This
7683 results in all of the enumeral values being emitted only once
7684 in the original, and the subtype gets them by reference. */
7685 if (TYPE_UNSIGNED (type
))
7686 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
7688 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
7689 TREE_TYPE (typefm
) = type
;
7692 else if (VECTOR_MODE_P (mode
)
7693 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
7694 : TREE_CODE (type
) != TREE_CODE (typefm
))
7696 error ("mode %qs applied to inappropriate type", p
);
7706 /* Handle a "section" attribute; arguments as in
7707 struct attribute_spec.handler. */
7710 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7711 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7715 if (!targetm_common
.have_named_sections
)
7717 error_at (DECL_SOURCE_LOCATION (*node
),
7718 "section attributes are not supported for this target");
7722 user_defined_section_attribute
= true;
7724 if (!VAR_OR_FUNCTION_DECL_P (decl
))
7726 error ("section attribute not allowed for %q+D", *node
);
7730 if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7732 error ("section attribute argument not a string constant");
7737 && current_function_decl
!= NULL_TREE
7738 && !TREE_STATIC (decl
))
7740 error_at (DECL_SOURCE_LOCATION (decl
),
7741 "section attribute cannot be specified for local variables");
7745 /* The decl may have already been given a section attribute
7746 from a previous declaration. Ensure they match. */
7747 if (DECL_SECTION_NAME (decl
) != NULL
7748 && strcmp (DECL_SECTION_NAME (decl
),
7749 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
7751 error ("section of %q+D conflicts with previous declaration", *node
);
7756 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
7757 && DECL_THREAD_LOCAL_P (decl
))
7759 error ("section of %q+D cannot be overridden", *node
);
7763 set_decl_section_name (decl
, TREE_STRING_POINTER (TREE_VALUE (args
)));
7767 *no_add_attrs
= true;
7771 /* Check whether ALIGN is a valid user-specified alignment. If so,
7772 return its base-2 log; if not, output an error and return -1. If
7773 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7776 check_user_alignment (const_tree align
, bool allow_zero
)
7780 if (error_operand_p (align
))
7782 if (TREE_CODE (align
) != INTEGER_CST
7783 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
7785 error ("requested alignment is not an integer constant");
7788 else if (allow_zero
&& integer_zerop (align
))
7790 else if (tree_int_cst_sgn (align
) == -1
7791 || (i
= tree_log2 (align
)) == -1)
7793 error ("requested alignment is not a positive power of 2");
7796 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
7798 error ("requested alignment is too large");
7805 If in c++-11, check if the c++-11 alignment constraint with respect
7806 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7807 c++-11 mode, does nothing.
7811 [* if the constant expression evaluates to a fundamental alignment,
7812 the alignment requirement of the declared entity shall be the
7813 specified fundamental alignment.
7815 * if the constant expression evaluates to an extended alignment
7816 and the implementation supports that alignment in the context
7817 of the declaration, the alignment of the declared entity shall
7820 * if the constant expression evaluates to an extended alignment
7821 and the implementation does not support that alignment in the
7822 context of the declaration, the program is ill-formed]. */
7825 check_cxx_fundamental_alignment_constraints (tree node
,
7829 bool alignment_too_large_p
= false;
7830 unsigned requested_alignment
= 1U << align_log
;
7831 unsigned max_align
= 0;
7833 if ((!(flags
& ATTR_FLAG_CXX11
) && !warn_cxx_compat
)
7834 || (node
== NULL_TREE
|| node
== error_mark_node
))
7837 if (cxx_fundamental_alignment_p (requested_alignment
))
7842 if (TREE_STATIC (node
))
7844 /* For file scope variables and static members, the target
7845 supports alignments that are at most
7846 MAX_OFILE_ALIGNMENT. */
7847 if (requested_alignment
> (max_align
= MAX_OFILE_ALIGNMENT
))
7848 alignment_too_large_p
= true;
7852 #ifdef BIGGEST_FIELD_ALIGNMENT
7853 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7855 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7857 /* For non-static members, the target supports either
7858 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7859 if it is defined or BIGGEST_ALIGNMENT. */
7860 max_align
= MAX_TARGET_FIELD_ALIGNMENT
;
7861 if (TREE_CODE (node
) == FIELD_DECL
7862 && requested_alignment
> (max_align
= MAX_TARGET_FIELD_ALIGNMENT
))
7863 alignment_too_large_p
= true;
7864 #undef MAX_TARGET_FIELD_ALIGNMENT
7865 /* For stack variables, the target supports at most
7866 MAX_STACK_ALIGNMENT. */
7867 else if (decl_function_context (node
) != NULL
7868 && requested_alignment
> (max_align
= MAX_STACK_ALIGNMENT
))
7869 alignment_too_large_p
= true;
7872 else if (TYPE_P (node
))
7874 /* Let's be liberal for types. */
7875 if (requested_alignment
> (max_align
= BIGGEST_ALIGNMENT
))
7876 alignment_too_large_p
= true;
7879 if (alignment_too_large_p
)
7880 pedwarn (input_location
, OPT_Wattributes
,
7881 "requested alignment %d is larger than %d",
7882 requested_alignment
, max_align
);
7884 return !alignment_too_large_p
;
7887 /* Handle a "aligned" attribute; arguments as in
7888 struct attribute_spec.handler. */
7891 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7892 int flags
, bool *no_add_attrs
)
7894 tree decl
= NULL_TREE
;
7902 align_expr
= TREE_VALUE (args
);
7903 if (align_expr
&& TREE_CODE (align_expr
) != IDENTIFIER_NODE
7904 && TREE_CODE (align_expr
) != FUNCTION_DECL
)
7905 align_expr
= default_conversion (align_expr
);
7908 align_expr
= size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
);
7913 type
= &TREE_TYPE (decl
);
7914 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
7916 else if (TYPE_P (*node
))
7917 type
= node
, is_type
= 1;
7919 if ((i
= check_user_alignment (align_expr
, true)) == -1
7920 || !check_cxx_fundamental_alignment_constraints (*node
, i
, flags
))
7921 *no_add_attrs
= true;
7924 if ((flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7925 /* OK, modify the type in place. */;
7926 /* If we have a TYPE_DECL, then copy the type, so that we
7927 don't accidentally modify a builtin type. See pushdecl. */
7928 else if (decl
&& TREE_TYPE (decl
) != error_mark_node
7929 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
7931 tree tt
= TREE_TYPE (decl
);
7932 *type
= build_variant_type_copy (*type
);
7933 DECL_ORIGINAL_TYPE (decl
) = tt
;
7934 TYPE_NAME (*type
) = decl
;
7935 TREE_USED (*type
) = TREE_USED (decl
);
7936 TREE_TYPE (decl
) = *type
;
7939 *type
= build_variant_type_copy (*type
);
7941 SET_TYPE_ALIGN (*type
, (1U << i
) * BITS_PER_UNIT
);
7942 TYPE_USER_ALIGN (*type
) = 1;
7944 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
7945 && TREE_CODE (decl
) != FIELD_DECL
)
7947 error ("alignment may not be specified for %q+D", decl
);
7948 *no_add_attrs
= true;
7950 else if (DECL_USER_ALIGN (decl
)
7951 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
7952 /* C++-11 [dcl.align/4]:
7954 When multiple alignment-specifiers are specified for an
7955 entity, the alignment requirement shall be set to the
7956 strictest specified alignment.
7958 This formally comes from the c++11 specification but we are
7959 doing it for the GNU attribute syntax as well. */
7960 *no_add_attrs
= true;
7961 else if (TREE_CODE (decl
) == FUNCTION_DECL
7962 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
7964 if (DECL_USER_ALIGN (decl
))
7965 error ("alignment for %q+D was previously specified as %d "
7966 "and may not be decreased", decl
,
7967 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
7969 error ("alignment for %q+D must be at least %d", decl
,
7970 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
7971 *no_add_attrs
= true;
7975 SET_DECL_ALIGN (decl
, (1U << i
) * BITS_PER_UNIT
);
7976 DECL_USER_ALIGN (decl
) = 1;
7982 /* Handle a "weak" attribute; arguments as in
7983 struct attribute_spec.handler. */
7986 handle_weak_attribute (tree
*node
, tree name
,
7987 tree
ARG_UNUSED (args
),
7988 int ARG_UNUSED (flags
),
7989 bool * ARG_UNUSED (no_add_attrs
))
7991 if (TREE_CODE (*node
) == FUNCTION_DECL
7992 && DECL_DECLARED_INLINE_P (*node
))
7994 warning (OPT_Wattributes
, "inline function %q+D declared weak", *node
);
7995 *no_add_attrs
= true;
7997 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
7999 error ("indirect function %q+D cannot be declared weak", *node
);
8000 *no_add_attrs
= true;
8003 else if (VAR_OR_FUNCTION_DECL_P (*node
))
8004 declare_weak (*node
);
8006 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8011 /* Handle a "noplt" attribute; arguments as in
8012 struct attribute_spec.handler. */
8015 handle_noplt_attribute (tree
*node
, tree name
,
8016 tree
ARG_UNUSED (args
),
8017 int ARG_UNUSED (flags
),
8018 bool * ARG_UNUSED (no_add_attrs
))
8020 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8022 warning (OPT_Wattributes
,
8023 "%qE attribute is only applicable on functions", name
);
8024 *no_add_attrs
= true;
8030 /* Handle an "alias" or "ifunc" attribute; arguments as in
8031 struct attribute_spec.handler, except that IS_ALIAS tells us
8032 whether this is an alias as opposed to ifunc attribute. */
8035 handle_alias_ifunc_attribute (bool is_alias
, tree
*node
, tree name
, tree args
,
8040 if (TREE_CODE (decl
) != FUNCTION_DECL
8041 && (!is_alias
|| !VAR_P (decl
)))
8043 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8044 *no_add_attrs
= true;
8046 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
8047 || (TREE_CODE (decl
) != FUNCTION_DECL
8048 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
8049 /* A static variable declaration is always a tentative definition,
8050 but the alias is a non-tentative definition which overrides. */
8051 || (TREE_CODE (decl
) != FUNCTION_DECL
8052 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
8054 error ("%q+D defined both normally and as %qE attribute", decl
, name
);
8055 *no_add_attrs
= true;
8059 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl
))
8060 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))))
8062 error ("weak %q+D cannot be defined %qE", decl
, name
);
8063 *no_add_attrs
= true;
8067 /* Note that the very first time we process a nested declaration,
8068 decl_function_context will not be set. Indeed, *would* never
8069 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8070 we do below. After such frobbery, pushdecl would set the context.
8071 In any case, this is never what we want. */
8072 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
8076 id
= TREE_VALUE (args
);
8077 if (TREE_CODE (id
) != STRING_CST
)
8079 error ("attribute %qE argument not a string", name
);
8080 *no_add_attrs
= true;
8083 id
= get_identifier (TREE_STRING_POINTER (id
));
8084 /* This counts as a use of the object pointed to. */
8087 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8088 DECL_INITIAL (decl
) = error_mark_node
;
8090 TREE_STATIC (decl
) = 1;
8093 /* ifuncs are also aliases, so set that attribute too. */
8094 DECL_ATTRIBUTES (decl
)
8095 = tree_cons (get_identifier ("alias"), args
, DECL_ATTRIBUTES (decl
));
8099 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8100 *no_add_attrs
= true;
8103 if (decl_in_symtab_p (*node
))
8105 struct symtab_node
*n
= symtab_node::get (decl
);
8106 if (n
&& n
->refuse_visibility_changes
)
8109 error ("%+D declared alias after being used", decl
);
8111 error ("%+D declared ifunc after being used", decl
);
8119 /* Handle an "alias" or "ifunc" attribute; arguments as in
8120 struct attribute_spec.handler. */
8123 handle_ifunc_attribute (tree
*node
, tree name
, tree args
,
8124 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8126 return handle_alias_ifunc_attribute (false, node
, name
, args
, no_add_attrs
);
8129 /* Handle an "alias" or "ifunc" attribute; arguments as in
8130 struct attribute_spec.handler. */
8133 handle_alias_attribute (tree
*node
, tree name
, tree args
,
8134 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8136 return handle_alias_ifunc_attribute (true, node
, name
, args
, no_add_attrs
);
8139 /* Handle a "weakref" attribute; arguments as in struct
8140 attribute_spec.handler. */
8143 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8144 int flags
, bool *no_add_attrs
)
8146 tree attr
= NULL_TREE
;
8148 /* We must ignore the attribute when it is associated with
8149 local-scoped decls, since attribute alias is ignored and many
8150 such symbols do not even have a DECL_WEAK field. */
8151 if (decl_function_context (*node
)
8152 || current_function_decl
8153 || !VAR_OR_FUNCTION_DECL_P (*node
))
8155 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8156 *no_add_attrs
= true;
8160 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8162 error ("indirect function %q+D cannot be declared weakref", *node
);
8163 *no_add_attrs
= true;
8167 /* The idea here is that `weakref("name")' mutates into `weakref,
8168 alias("name")', and weakref without arguments, in turn,
8169 implicitly adds weak. */
8173 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
8174 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
8176 *no_add_attrs
= true;
8178 decl_attributes (node
, attr
, flags
);
8182 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
8183 error_at (DECL_SOURCE_LOCATION (*node
),
8184 "weakref attribute must appear before alias attribute");
8186 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8187 and that isn't supported; and because it wants to add it to
8188 the list of weak decls, which isn't helpful. */
8189 DECL_WEAK (*node
) = 1;
8192 if (decl_in_symtab_p (*node
))
8194 struct symtab_node
*n
= symtab_node::get (*node
);
8195 if (n
&& n
->refuse_visibility_changes
)
8196 error ("%+D declared weakref after being used", *node
);
8202 /* Handle an "visibility" attribute; arguments as in
8203 struct attribute_spec.handler. */
8206 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
8207 int ARG_UNUSED (flags
),
8208 bool *ARG_UNUSED (no_add_attrs
))
8211 tree id
= TREE_VALUE (args
);
8212 enum symbol_visibility vis
;
8216 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
8218 else if (!RECORD_OR_UNION_TYPE_P (*node
))
8220 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
8224 else if (TYPE_FIELDS (*node
))
8226 error ("%qE attribute ignored because %qT is already defined",
8231 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
8233 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8237 if (TREE_CODE (id
) != STRING_CST
)
8239 error ("visibility argument not a string");
8243 /* If this is a type, set the visibility on the type decl. */
8246 decl
= TYPE_NAME (decl
);
8249 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8251 warning (OPT_Wattributes
, "%qE attribute ignored on types",
8257 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
8258 vis
= VISIBILITY_DEFAULT
;
8259 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
8260 vis
= VISIBILITY_INTERNAL
;
8261 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
8262 vis
= VISIBILITY_HIDDEN
;
8263 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
8264 vis
= VISIBILITY_PROTECTED
;
8267 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8268 vis
= VISIBILITY_DEFAULT
;
8271 if (DECL_VISIBILITY_SPECIFIED (decl
)
8272 && vis
!= DECL_VISIBILITY (decl
))
8274 tree attributes
= (TYPE_P (*node
)
8275 ? TYPE_ATTRIBUTES (*node
)
8276 : DECL_ATTRIBUTES (decl
));
8277 if (lookup_attribute ("visibility", attributes
))
8278 error ("%qD redeclared with different visibility", decl
);
8279 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8280 && lookup_attribute ("dllimport", attributes
))
8281 error ("%qD was declared %qs which implies default visibility",
8283 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8284 && lookup_attribute ("dllexport", attributes
))
8285 error ("%qD was declared %qs which implies default visibility",
8289 DECL_VISIBILITY (decl
) = vis
;
8290 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
8292 /* Go ahead and attach the attribute to the node as well. This is needed
8293 so we can determine whether we have VISIBILITY_DEFAULT because the
8294 visibility was not specified, or because it was explicitly overridden
8295 from the containing scope. */
8300 /* Determine the ELF symbol visibility for DECL, which is either a
8301 variable or a function. It is an error to use this function if a
8302 definition of DECL is not available in this translation unit.
8303 Returns true if the final visibility has been determined by this
8304 function; false if the caller is free to make additional
8308 c_determine_visibility (tree decl
)
8310 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
8312 /* If the user explicitly specified the visibility with an
8313 attribute, honor that. DECL_VISIBILITY will have been set during
8314 the processing of the attribute. We check for an explicit
8315 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8316 to distinguish the use of an attribute from the use of a "#pragma
8317 GCC visibility push(...)"; in the latter case we still want other
8318 considerations to be able to overrule the #pragma. */
8319 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
8320 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8321 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
8322 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
8325 /* Set default visibility to whatever the user supplied with
8326 visibility_specified depending on #pragma GCC visibility. */
8327 if (!DECL_VISIBILITY_SPECIFIED (decl
))
8329 if (visibility_options
.inpragma
8330 || DECL_VISIBILITY (decl
) != default_visibility
)
8332 DECL_VISIBILITY (decl
) = default_visibility
;
8333 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
8334 /* If visibility changed and DECL already has DECL_RTL, ensure
8335 symbol flags are updated. */
8336 if (((VAR_P (decl
) && TREE_STATIC (decl
))
8337 || TREE_CODE (decl
) == FUNCTION_DECL
)
8338 && DECL_RTL_SET_P (decl
))
8339 make_decl_rtl (decl
);
8345 /* Handle an "tls_model" attribute; arguments as in
8346 struct attribute_spec.handler. */
8349 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
8350 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8354 enum tls_model kind
;
8356 *no_add_attrs
= true;
8358 if (!VAR_P (decl
) || !DECL_THREAD_LOCAL_P (decl
))
8360 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8364 kind
= DECL_TLS_MODEL (decl
);
8365 id
= TREE_VALUE (args
);
8366 if (TREE_CODE (id
) != STRING_CST
)
8368 error ("tls_model argument not a string");
8372 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
8373 kind
= TLS_MODEL_LOCAL_EXEC
;
8374 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
8375 kind
= TLS_MODEL_INITIAL_EXEC
;
8376 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
8377 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
8378 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
8379 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
8381 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8383 set_decl_tls_model (decl
, kind
);
8387 /* Handle a "no_instrument_function" attribute; arguments as in
8388 struct attribute_spec.handler. */
8391 handle_no_instrument_function_attribute (tree
*node
, tree name
,
8392 tree
ARG_UNUSED (args
),
8393 int ARG_UNUSED (flags
),
8398 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8400 error_at (DECL_SOURCE_LOCATION (decl
),
8401 "%qE attribute applies only to functions", name
);
8402 *no_add_attrs
= true;
8405 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
8410 /* Handle a "no_profile_instrument_function" attribute; arguments as in
8411 struct attribute_spec.handler. */
8414 handle_no_profile_instrument_function_attribute (tree
*node
, tree name
, tree
,
8415 int, bool *no_add_attrs
)
8417 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8419 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8420 *no_add_attrs
= true;
8426 /* Handle a "malloc" attribute; arguments as in
8427 struct attribute_spec.handler. */
8430 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8431 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8433 if (TREE_CODE (*node
) == FUNCTION_DECL
8434 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
8435 DECL_IS_MALLOC (*node
) = 1;
8438 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8439 *no_add_attrs
= true;
8445 /* Handle a "alloc_size" attribute; arguments as in
8446 struct attribute_spec.handler. */
8449 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8450 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8452 unsigned arg_count
= type_num_arguments (*node
);
8453 for (; args
; args
= TREE_CHAIN (args
))
8455 tree position
= TREE_VALUE (args
);
8456 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8457 && TREE_CODE (position
) != FUNCTION_DECL
)
8458 position
= default_conversion (position
);
8460 if (!tree_fits_uhwi_p (position
)
8462 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8464 warning (OPT_Wattributes
,
8465 "alloc_size parameter outside range");
8466 *no_add_attrs
= true;
8473 /* Handle a "alloc_align" attribute; arguments as in
8474 struct attribute_spec.handler. */
8477 handle_alloc_align_attribute (tree
*node
, tree
, tree args
, int,
8480 unsigned arg_count
= type_num_arguments (*node
);
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_align parameter outside range");
8492 *no_add_attrs
= true;
8498 /* Handle a "assume_aligned" attribute; arguments as in
8499 struct attribute_spec.handler. */
8502 handle_assume_aligned_attribute (tree
*, tree
, tree args
, int,
8505 for (; args
; args
= TREE_CHAIN (args
))
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_CODE (position
) != INTEGER_CST
)
8514 warning (OPT_Wattributes
,
8515 "assume_aligned parameter not integer constant");
8516 *no_add_attrs
= true;
8523 /* Handle a "fn spec" attribute; arguments as in
8524 struct attribute_spec.handler. */
8527 handle_fnspec_attribute (tree
*node ATTRIBUTE_UNUSED
, tree
ARG_UNUSED (name
),
8528 tree args
, int ARG_UNUSED (flags
),
8529 bool *no_add_attrs ATTRIBUTE_UNUSED
)
8532 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
8533 && !TREE_CHAIN (args
));
8537 /* Handle a "bnd_variable_size" attribute; arguments as in
8538 struct attribute_spec.handler. */
8541 handle_bnd_variable_size_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8542 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8544 if (TREE_CODE (*node
) != FIELD_DECL
)
8546 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8547 *no_add_attrs
= true;
8553 /* Handle a "bnd_legacy" attribute; arguments as in
8554 struct attribute_spec.handler. */
8557 handle_bnd_legacy (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8558 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8560 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8562 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8563 *no_add_attrs
= true;
8569 /* Handle a "bnd_instrument" attribute; arguments as in
8570 struct attribute_spec.handler. */
8573 handle_bnd_instrument (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8574 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8576 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8578 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8579 *no_add_attrs
= true;
8585 /* Handle a "warn_unused" attribute; arguments as in
8586 struct attribute_spec.handler. */
8589 handle_warn_unused_attribute (tree
*node
, tree name
,
8590 tree args ATTRIBUTE_UNUSED
,
8591 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
8594 /* Do nothing else, just set the attribute. We'll get at
8595 it later with lookup_attribute. */
8599 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8600 *no_add_attrs
= true;
8606 /* Handle an "omp declare simd" attribute; arguments as in
8607 struct attribute_spec.handler. */
8610 handle_omp_declare_simd_attribute (tree
*, tree
, tree
, int, bool *)
8615 /* Handle a "simd" attribute. */
8618 handle_simd_attribute (tree
*node
, tree name
, tree args
, int, bool *no_add_attrs
)
8620 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8622 if (lookup_attribute ("cilk simd function",
8623 DECL_ATTRIBUTES (*node
)) != NULL
)
8625 error_at (DECL_SOURCE_LOCATION (*node
),
8626 "%<__simd__%> attribute cannot be used in the same "
8627 "function marked as a Cilk Plus SIMD-enabled function");
8628 *no_add_attrs
= true;
8632 tree t
= get_identifier ("omp declare simd");
8633 tree attr
= NULL_TREE
;
8636 tree id
= TREE_VALUE (args
);
8638 if (TREE_CODE (id
) != STRING_CST
)
8640 error ("attribute %qE argument not a string", name
);
8641 *no_add_attrs
= true;
8645 if (strcmp (TREE_STRING_POINTER (id
), "notinbranch") == 0)
8646 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8647 OMP_CLAUSE_NOTINBRANCH
);
8649 if (strcmp (TREE_STRING_POINTER (id
), "inbranch") == 0)
8650 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8651 OMP_CLAUSE_INBRANCH
);
8654 error ("only %<inbranch%> and %<notinbranch%> flags are "
8655 "allowed for %<__simd__%> attribute");
8656 *no_add_attrs
= true;
8661 DECL_ATTRIBUTES (*node
) = tree_cons (t
,
8662 build_tree_list (NULL_TREE
,
8664 DECL_ATTRIBUTES (*node
));
8669 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8670 *no_add_attrs
= true;
8676 /* Handle an "omp declare target" attribute; arguments as in
8677 struct attribute_spec.handler. */
8680 handle_omp_declare_target_attribute (tree
*, tree
, tree
, int, bool *)
8685 /* Handle a "returns_twice" attribute; arguments as in
8686 struct attribute_spec.handler. */
8689 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8690 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8692 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8693 DECL_IS_RETURNS_TWICE (*node
) = 1;
8696 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8697 *no_add_attrs
= true;
8703 /* Handle a "no_limit_stack" attribute; arguments as in
8704 struct attribute_spec.handler. */
8707 handle_no_limit_stack_attribute (tree
*node
, tree name
,
8708 tree
ARG_UNUSED (args
),
8709 int ARG_UNUSED (flags
),
8714 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8716 error_at (DECL_SOURCE_LOCATION (decl
),
8717 "%qE attribute applies only to functions", name
);
8718 *no_add_attrs
= true;
8720 else if (DECL_INITIAL (decl
))
8722 error_at (DECL_SOURCE_LOCATION (decl
),
8723 "can%'t set %qE attribute after definition", name
);
8724 *no_add_attrs
= true;
8727 DECL_NO_LIMIT_STACK (decl
) = 1;
8732 /* Handle a "pure" attribute; arguments as in
8733 struct attribute_spec.handler. */
8736 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8737 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8739 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8740 DECL_PURE_P (*node
) = 1;
8741 /* ??? TODO: Support types. */
8744 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8745 *no_add_attrs
= true;
8751 /* Digest an attribute list destined for a transactional memory statement.
8752 ALLOWED is the set of attributes that are allowed for this statement;
8753 return the attribute we parsed. Multiple attributes are never allowed. */
8756 parse_tm_stmt_attr (tree attrs
, int allowed
)
8761 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
8763 tree a
= TREE_PURPOSE (attrs
);
8766 if (is_attribute_p ("outer", a
))
8767 m
= TM_STMT_ATTR_OUTER
;
8769 if ((m
& allowed
) == 0)
8771 warning (OPT_Wattributes
, "%qE attribute directive ignored", a
);
8780 else if (m_seen
== m
)
8781 warning (OPT_Wattributes
, "%qE attribute duplicated", a
);
8783 warning (OPT_Wattributes
, "%qE attribute follows %qE", a
, a_seen
);
8789 /* Transform a TM attribute name into a maskable integer and back.
8790 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8791 to how the lack of an attribute is treated. */
8794 tm_attr_to_mask (tree attr
)
8798 if (is_attribute_p ("transaction_safe", attr
))
8799 return TM_ATTR_SAFE
;
8800 if (is_attribute_p ("transaction_callable", attr
))
8801 return TM_ATTR_CALLABLE
;
8802 if (is_attribute_p ("transaction_pure", attr
))
8803 return TM_ATTR_PURE
;
8804 if (is_attribute_p ("transaction_unsafe", attr
))
8805 return TM_ATTR_IRREVOCABLE
;
8806 if (is_attribute_p ("transaction_may_cancel_outer", attr
))
8807 return TM_ATTR_MAY_CANCEL_OUTER
;
8812 tm_mask_to_attr (int mask
)
8818 str
= "transaction_safe";
8820 case TM_ATTR_CALLABLE
:
8821 str
= "transaction_callable";
8824 str
= "transaction_pure";
8826 case TM_ATTR_IRREVOCABLE
:
8827 str
= "transaction_unsafe";
8829 case TM_ATTR_MAY_CANCEL_OUTER
:
8830 str
= "transaction_may_cancel_outer";
8835 return get_identifier (str
);
8838 /* Return the first TM attribute seen in LIST. */
8841 find_tm_attribute (tree list
)
8843 for (; list
; list
= TREE_CHAIN (list
))
8845 tree name
= TREE_PURPOSE (list
);
8846 if (tm_attr_to_mask (name
) != 0)
8852 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8853 Here we accept only function types, and verify that none of the other
8854 function TM attributes are also applied. */
8855 /* ??? We need to accept class types for C++, but not C. This greatly
8856 complicates this function, since we can no longer rely on the extra
8857 processing given by function_type_required. */
8860 handle_tm_attribute (tree
*node
, tree name
, tree args
,
8861 int flags
, bool *no_add_attrs
)
8863 /* Only one path adds the attribute; others don't. */
8864 *no_add_attrs
= true;
8866 switch (TREE_CODE (*node
))
8870 /* Only tm_callable and tm_safe apply to classes. */
8871 if (tm_attr_to_mask (name
) & ~(TM_ATTR_SAFE
| TM_ATTR_CALLABLE
))
8878 tree old_name
= find_tm_attribute (TYPE_ATTRIBUTES (*node
));
8879 if (old_name
== name
)
8881 else if (old_name
!= NULL_TREE
)
8882 error ("type was previously declared %qE", old_name
);
8884 *no_add_attrs
= false;
8890 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8891 want to set transaction_safe on the type. */
8892 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name
));
8893 if (!TYPE_P (DECL_CONTEXT (*node
)))
8894 error_at (DECL_SOURCE_LOCATION (*node
),
8895 "%<transaction_safe_dynamic%> may only be specified for "
8896 "a virtual function");
8897 *no_add_attrs
= false;
8898 decl_attributes (&TREE_TYPE (*node
),
8899 build_tree_list (get_identifier ("transaction_safe"),
8907 enum tree_code subcode
= TREE_CODE (TREE_TYPE (*node
));
8908 if (subcode
== FUNCTION_TYPE
|| subcode
== METHOD_TYPE
)
8910 tree fn_tmp
= TREE_TYPE (*node
);
8911 decl_attributes (&fn_tmp
, tree_cons (name
, args
, NULL
), 0);
8912 *node
= build_pointer_type (fn_tmp
);
8919 /* If a function is next, pass it on to be tried next. */
8920 if (flags
& (int) ATTR_FLAG_FUNCTION_NEXT
)
8921 return tree_cons (name
, args
, NULL
);
8924 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8931 /* Handle the TM_WRAP attribute; arguments as in
8932 struct attribute_spec.handler. */
8935 handle_tm_wrap_attribute (tree
*node
, tree name
, tree args
,
8936 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8940 /* We don't need the attribute even on success, since we
8941 record the entry in an external table. */
8942 *no_add_attrs
= true;
8944 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8945 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8948 tree wrap_decl
= TREE_VALUE (args
);
8949 if (error_operand_p (wrap_decl
))
8951 else if (TREE_CODE (wrap_decl
) != IDENTIFIER_NODE
8952 && !VAR_OR_FUNCTION_DECL_P (wrap_decl
))
8953 error ("%qE argument not an identifier", name
);
8956 if (TREE_CODE (wrap_decl
) == IDENTIFIER_NODE
)
8957 wrap_decl
= lookup_name (wrap_decl
);
8958 if (wrap_decl
&& TREE_CODE (wrap_decl
) == FUNCTION_DECL
)
8960 if (lang_hooks
.types_compatible_p (TREE_TYPE (decl
),
8961 TREE_TYPE (wrap_decl
)))
8962 record_tm_replacement (wrap_decl
, decl
);
8964 error ("%qD is not compatible with %qD", wrap_decl
, decl
);
8967 error ("%qE argument is not a function", name
);
8974 /* Ignore the given attribute. Used when this attribute may be usefully
8975 overridden by the target, but is not used generically. */
8978 ignore_attribute (tree
* ARG_UNUSED (node
), tree
ARG_UNUSED (name
),
8979 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
8982 *no_add_attrs
= true;
8986 /* Handle a "no vops" attribute; arguments as in
8987 struct attribute_spec.handler. */
8990 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
8991 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
8992 bool *ARG_UNUSED (no_add_attrs
))
8994 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
8995 DECL_IS_NOVOPS (*node
) = 1;
8999 /* Handle a "deprecated" attribute; arguments as in
9000 struct attribute_spec.handler. */
9003 handle_deprecated_attribute (tree
*node
, tree name
,
9004 tree args
, int flags
,
9007 tree type
= NULL_TREE
;
9009 tree what
= NULL_TREE
;
9012 *no_add_attrs
= true;
9013 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
9015 error ("deprecated message is not a string");
9016 *no_add_attrs
= true;
9022 type
= TREE_TYPE (decl
);
9024 if (TREE_CODE (decl
) == TYPE_DECL
9025 || TREE_CODE (decl
) == PARM_DECL
9026 || VAR_OR_FUNCTION_DECL_P (decl
)
9027 || TREE_CODE (decl
) == FIELD_DECL
9028 || TREE_CODE (decl
) == CONST_DECL
9029 || objc_method_decl (TREE_CODE (decl
)))
9030 TREE_DEPRECATED (decl
) = 1;
9034 else if (TYPE_P (*node
))
9036 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
9037 *node
= build_variant_type_copy (*node
);
9038 TREE_DEPRECATED (*node
) = 1;
9046 *no_add_attrs
= true;
9047 if (type
&& TYPE_NAME (type
))
9049 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
9050 what
= TYPE_NAME (*node
);
9051 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
9052 && DECL_NAME (TYPE_NAME (type
)))
9053 what
= DECL_NAME (TYPE_NAME (type
));
9056 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
9058 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9064 /* Handle a "vector_size" attribute; arguments as in
9065 struct attribute_spec.handler. */
9068 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
9069 int ARG_UNUSED (flags
),
9072 unsigned HOST_WIDE_INT vecsize
, nunits
;
9073 machine_mode orig_mode
;
9074 tree type
= *node
, new_type
, size
;
9076 *no_add_attrs
= true;
9078 size
= TREE_VALUE (args
);
9079 if (size
&& TREE_CODE (size
) != IDENTIFIER_NODE
9080 && TREE_CODE (size
) != FUNCTION_DECL
)
9081 size
= default_conversion (size
);
9083 if (!tree_fits_uhwi_p (size
))
9085 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9089 /* Get the vector size (in bytes). */
9090 vecsize
= tree_to_uhwi (size
);
9092 /* We need to provide for vector pointers, vector arrays, and
9093 functions returning vectors. For example:
9095 __attribute__((vector_size(16))) short *foo;
9097 In this case, the mode is SI, but the type being modified is
9098 HI, so we need to look further. */
9100 while (POINTER_TYPE_P (type
)
9101 || TREE_CODE (type
) == FUNCTION_TYPE
9102 || TREE_CODE (type
) == METHOD_TYPE
9103 || TREE_CODE (type
) == ARRAY_TYPE
9104 || TREE_CODE (type
) == OFFSET_TYPE
)
9105 type
= TREE_TYPE (type
);
9107 /* Get the mode of the type being modified. */
9108 orig_mode
= TYPE_MODE (type
);
9110 if ((!INTEGRAL_TYPE_P (type
)
9111 && !SCALAR_FLOAT_TYPE_P (type
)
9112 && !FIXED_POINT_TYPE_P (type
))
9113 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
9114 && GET_MODE_CLASS (orig_mode
) != MODE_INT
9115 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
9116 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
))
9117 || TREE_CODE (type
) == BOOLEAN_TYPE
)
9119 error ("invalid vector type for attribute %qE", name
);
9123 if (vecsize
% tree_to_uhwi (TYPE_SIZE_UNIT (type
)))
9125 error ("vector size not an integral multiple of component size");
9131 error ("zero vector size");
9135 /* Calculate how many units fit in the vector. */
9136 nunits
= vecsize
/ tree_to_uhwi (TYPE_SIZE_UNIT (type
));
9137 if (nunits
& (nunits
- 1))
9139 error ("number of components of the vector not a power of two");
9143 new_type
= build_vector_type (type
, nunits
);
9145 /* Build back pointers if needed. */
9146 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
9151 /* Handle the "nonnull" attribute. */
9153 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9154 tree args
, int ARG_UNUSED (flags
),
9158 unsigned HOST_WIDE_INT attr_arg_num
;
9160 /* If no arguments are specified, all pointer arguments should be
9161 non-null. Verify a full prototype is given so that the arguments
9162 will have the correct types when we actually check them later.
9163 Avoid diagnosing type-generic built-ins since those have no
9167 if (!prototype_p (type
)
9168 && (!TYPE_ATTRIBUTES (type
)
9169 || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type
))))
9171 error ("nonnull attribute without arguments on a non-prototype");
9172 *no_add_attrs
= true;
9177 /* Argument list specified. Verify that each argument number references
9178 a pointer argument. */
9179 for (attr_arg_num
= 1; args
; attr_arg_num
++, args
= TREE_CHAIN (args
))
9181 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
9183 tree arg
= TREE_VALUE (args
);
9184 if (arg
&& TREE_CODE (arg
) != IDENTIFIER_NODE
9185 && TREE_CODE (arg
) != FUNCTION_DECL
)
9186 arg
= default_conversion (arg
);
9188 if (!get_nonnull_operand (arg
, &arg_num
))
9190 error ("nonnull argument has invalid operand number (argument %lu)",
9191 (unsigned long) attr_arg_num
);
9192 *no_add_attrs
= true;
9196 if (prototype_p (type
))
9198 function_args_iterator iter
;
9201 function_args_iter_init (&iter
, type
);
9202 for (ck_num
= 1; ; ck_num
++, function_args_iter_next (&iter
))
9204 argument
= function_args_iter_cond (&iter
);
9205 if (argument
== NULL_TREE
|| ck_num
== arg_num
)
9210 || TREE_CODE (argument
) == VOID_TYPE
)
9212 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
9213 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9214 *no_add_attrs
= true;
9218 if (TREE_CODE (argument
) != POINTER_TYPE
)
9220 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
9221 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9222 *no_add_attrs
= true;
9231 /* Check the argument list of a function call for null in argument slots
9232 that are marked as requiring a non-null pointer argument. The NARGS
9233 arguments are passed in the array ARGARRAY. */
9236 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
9241 attrs
= lookup_attribute ("nonnull", attrs
);
9242 if (attrs
== NULL_TREE
)
9246 /* See if any of the nonnull attributes has no arguments. If so,
9247 then every pointer argument is checked (in which case the check
9248 for pointer type is done in check_nonnull_arg). */
9249 if (TREE_VALUE (a
) != NULL_TREE
)
9251 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
9252 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
9255 for (i
= 0; i
< nargs
; i
++)
9256 check_function_arguments_recurse (check_nonnull_arg
, &loc
, argarray
[i
],
9260 /* Walk the argument list. If we encounter an argument number we
9261 should check for non-null, do it. */
9262 for (i
= 0; i
< nargs
; i
++)
9264 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
9266 a
= lookup_attribute ("nonnull", a
);
9267 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
9272 check_function_arguments_recurse (check_nonnull_arg
, &loc
,
9273 argarray
[i
], i
+ 1);
9278 /* Check that the Nth argument of a function call (counting backwards
9279 from the end) is a (pointer)0. The NARGS arguments are passed in the
9283 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
9285 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
9292 function_args_iterator iter
;
9295 /* Skip over the named arguments. */
9296 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
9303 if (TREE_VALUE (attr
))
9305 tree p
= TREE_VALUE (TREE_VALUE (attr
));
9306 pos
= TREE_INT_CST_LOW (p
);
9309 /* The sentinel must be one of the varargs, i.e.
9310 in position >= the number of fixed arguments. */
9311 if ((nargs
- 1 - pos
) < len
)
9313 warning (OPT_Wformat_
,
9314 "not enough variable arguments to fit a sentinel");
9318 /* Validate the sentinel. */
9319 sentinel
= argarray
[nargs
- 1 - pos
];
9320 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
9321 || !integer_zerop (sentinel
))
9322 /* Although __null (in C++) is only an integer we allow it
9323 nevertheless, as we are guaranteed that it's exactly
9324 as wide as a pointer, and we don't want to force
9325 users to cast the NULL they have written there.
9326 We warn with -Wstrict-null-sentinel, though. */
9327 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
9328 warning (OPT_Wformat_
, "missing sentinel in function call");
9332 /* Helper for check_function_nonnull; given a list of operands which
9333 must be non-null in ARGS, determine if operand PARAM_NUM should be
9337 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
9339 unsigned HOST_WIDE_INT arg_num
= 0;
9341 for (; args
; args
= TREE_CHAIN (args
))
9343 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
9347 if (arg_num
== param_num
)
9353 /* Check that the function argument PARAM (which is operand number
9354 PARAM_NUM) is non-null. This is called by check_function_nonnull
9355 via check_function_arguments_recurse. */
9358 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
9360 location_t
*ploc
= (location_t
*) ctx
;
9362 /* Just skip checking the argument if it's not a pointer. This can
9363 happen if the "nonnull" attribute was given without an operand
9364 list (which means to check every pointer argument). */
9366 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
9369 if (integer_zerop (param
))
9370 warning_at (*ploc
, OPT_Wnonnull
, "null argument where non-null required "
9371 "(argument %lu)", (unsigned long) param_num
);
9374 /* Helper for nonnull attribute handling; fetch the operand number
9375 from the attribute argument list. */
9378 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
9380 /* Verify the arg number is a small constant. */
9381 if (tree_fits_uhwi_p (arg_num_expr
))
9383 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
9390 /* Handle a "nothrow" attribute; arguments as in
9391 struct attribute_spec.handler. */
9394 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9395 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9397 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9398 TREE_NOTHROW (*node
) = 1;
9399 /* ??? TODO: Support types. */
9402 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9403 *no_add_attrs
= true;
9409 /* Handle a "cleanup" attribute; arguments as in
9410 struct attribute_spec.handler. */
9413 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
9414 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9417 tree cleanup_id
, cleanup_decl
;
9419 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9420 for global destructors in C++. This requires infrastructure that
9421 we don't have generically at the moment. It's also not a feature
9422 we'd be missing too much, since we do have attribute constructor. */
9423 if (!VAR_P (decl
) || TREE_STATIC (decl
))
9425 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9426 *no_add_attrs
= true;
9430 /* Verify that the argument is a function in scope. */
9431 /* ??? We could support pointers to functions here as well, if
9432 that was considered desirable. */
9433 cleanup_id
= TREE_VALUE (args
);
9434 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
9436 error ("cleanup argument not an identifier");
9437 *no_add_attrs
= true;
9440 cleanup_decl
= lookup_name (cleanup_id
);
9441 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
9443 error ("cleanup argument not a function");
9444 *no_add_attrs
= true;
9448 /* That the function has proper type is checked with the
9449 eventual call to build_function_call. */
9454 /* Handle a "warn_unused_result" attribute. No special handling. */
9457 handle_warn_unused_result_attribute (tree
*node
, tree name
,
9458 tree
ARG_UNUSED (args
),
9459 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9461 /* Ignore the attribute for functions not returning any value. */
9462 if (VOID_TYPE_P (TREE_TYPE (*node
)))
9464 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9465 *no_add_attrs
= true;
9471 /* Handle a "sentinel" attribute. */
9474 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
9475 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9477 if (!prototype_p (*node
))
9479 warning (OPT_Wattributes
,
9480 "%qE attribute requires prototypes with named arguments", name
);
9481 *no_add_attrs
= true;
9485 if (!stdarg_p (*node
))
9487 warning (OPT_Wattributes
,
9488 "%qE attribute only applies to variadic functions", name
);
9489 *no_add_attrs
= true;
9495 tree position
= TREE_VALUE (args
);
9496 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
9497 && TREE_CODE (position
) != FUNCTION_DECL
)
9498 position
= default_conversion (position
);
9500 if (TREE_CODE (position
) != INTEGER_CST
9501 || !INTEGRAL_TYPE_P (TREE_TYPE (position
)))
9503 warning (OPT_Wattributes
,
9504 "requested position is not an integer constant");
9505 *no_add_attrs
= true;
9509 if (tree_int_cst_lt (position
, integer_zero_node
))
9511 warning (OPT_Wattributes
,
9512 "requested position is less than zero");
9513 *no_add_attrs
= true;
9521 /* Handle a "type_generic" attribute. */
9524 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9525 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9526 bool * ARG_UNUSED (no_add_attrs
))
9528 /* Ensure we have a function type. */
9529 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
9531 /* Ensure we have a variadic function. */
9532 gcc_assert (!prototype_p (*node
) || stdarg_p (*node
));
9537 /* Handle a "target" attribute. */
9540 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
9543 /* Ensure we have a function type. */
9544 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9546 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9547 *no_add_attrs
= true;
9549 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
9551 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9552 "with %qs attribute", name
, "target_clones");
9553 *no_add_attrs
= true;
9555 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
9557 *no_add_attrs
= true;
9562 /* Handle a "target_clones" attribute. */
9565 handle_target_clones_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9566 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9568 /* Ensure we have a function type. */
9569 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9571 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
9573 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9574 "with %qs attribute", name
, "always_inline");
9575 *no_add_attrs
= true;
9577 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node
)))
9579 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9580 "with %qs attribute", name
, "target");
9581 *no_add_attrs
= true;
9584 /* Do not inline functions with multiple clone targets. */
9585 DECL_UNINLINABLE (*node
) = 1;
9589 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9590 *no_add_attrs
= true;
9595 /* Arguments being collected for optimization. */
9596 typedef const char *const_char_p
; /* For DEF_VEC_P. */
9597 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
9600 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9601 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9602 false for #pragma GCC optimize. */
9605 parse_optimize_options (tree args
, bool attr_p
)
9610 const char **opt_argv
;
9611 struct cl_decoded_option
*decoded_options
;
9612 unsigned int decoded_options_count
;
9615 /* Build up argv vector. Just in case the string is stored away, use garbage
9616 collected strings. */
9617 vec_safe_truncate (optimize_args
, 0);
9618 vec_safe_push (optimize_args
, (const char *) NULL
);
9620 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
9622 tree value
= TREE_VALUE (ap
);
9624 if (TREE_CODE (value
) == INTEGER_CST
)
9627 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
9628 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
9631 else if (TREE_CODE (value
) == STRING_CST
)
9633 /* Split string into multiple substrings. */
9634 size_t len
= TREE_STRING_LENGTH (value
);
9635 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
9636 char *end
= p
+ len
;
9640 while (next_p
!= NULL
)
9646 comma
= strchr (p
, ',');
9659 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
9661 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9663 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
9667 warning (OPT_Wattributes
,
9668 "bad option %qs to attribute %<optimize%>", p
);
9670 warning (OPT_Wpragmas
,
9671 "bad option %qs to pragma %<optimize%>", p
);
9679 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9680 itself is -Os, and any other switch begins with a -f. */
9681 if ((*p
>= '0' && *p
<= '9')
9682 || (p
[0] == 's' && p
[1] == '\0'))
9688 memcpy (r
, p
, len2
);
9690 vec_safe_push (optimize_args
, (const char *) q
);
9696 opt_argc
= optimize_args
->length ();
9697 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
9699 for (i
= 1; i
< opt_argc
; i
++)
9700 opt_argv
[i
] = (*optimize_args
)[i
];
9702 /* Now parse the options. */
9703 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
9705 &decoded_options_count
);
9706 /* Drop non-Optimization options. */
9708 for (i
= 1; i
< decoded_options_count
; ++i
)
9710 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
9714 warning (OPT_Wattributes
,
9715 "bad option %qs to attribute %<optimize%>",
9716 decoded_options
[i
].orig_option_with_args_text
);
9718 warning (OPT_Wpragmas
,
9719 "bad option %qs to pragma %<optimize%>",
9720 decoded_options
[i
].orig_option_with_args_text
);
9724 decoded_options
[j
] = decoded_options
[i
];
9727 decoded_options_count
= j
;
9728 /* And apply them. */
9729 decode_options (&global_options
, &global_options_set
,
9730 decoded_options
, decoded_options_count
,
9731 input_location
, global_dc
);
9733 targetm
.override_options_after_change();
9735 optimize_args
->truncate (0);
9739 /* For handling "optimize" attribute. arguments as in
9740 struct attribute_spec.handler. */
9743 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
9744 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9746 /* Ensure we have a function type. */
9747 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9749 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9750 *no_add_attrs
= true;
9754 struct cl_optimization cur_opts
;
9755 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
9757 /* Save current options. */
9758 cl_optimization_save (&cur_opts
, &global_options
);
9760 /* If we previously had some optimization options, use them as the
9763 cl_optimization_restore (&global_options
,
9764 TREE_OPTIMIZATION (old_opts
));
9766 /* Parse options, and update the vector. */
9767 parse_optimize_options (args
, true);
9768 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
9769 = build_optimization_node (&global_options
);
9771 /* Restore current options. */
9772 cl_optimization_restore (&global_options
, &cur_opts
);
9778 /* Handle a "no_split_stack" attribute. */
9781 handle_no_split_stack_attribute (tree
*node
, tree name
,
9782 tree
ARG_UNUSED (args
),
9783 int ARG_UNUSED (flags
),
9788 if (TREE_CODE (decl
) != FUNCTION_DECL
)
9790 error_at (DECL_SOURCE_LOCATION (decl
),
9791 "%qE attribute applies only to functions", name
);
9792 *no_add_attrs
= true;
9794 else if (DECL_INITIAL (decl
))
9796 error_at (DECL_SOURCE_LOCATION (decl
),
9797 "can%'t set %qE attribute after definition", name
);
9798 *no_add_attrs
= true;
9804 /* Handle a "returns_nonnull" attribute; arguments as in
9805 struct attribute_spec.handler. */
9808 handle_returns_nonnull_attribute (tree
*node
, tree
, tree
, int,
9811 // Even without a prototype we still have a return type we can check.
9812 if (TREE_CODE (TREE_TYPE (*node
)) != POINTER_TYPE
)
9814 error ("returns_nonnull attribute on a function not returning a pointer");
9815 *no_add_attrs
= true;
9820 /* Handle a "designated_init" attribute; arguments as in
9821 struct attribute_spec.handler. */
9824 handle_designated_init_attribute (tree
*node
, tree name
, tree
, int,
9827 if (TREE_CODE (*node
) != RECORD_TYPE
)
9829 error ("%qE attribute is only valid on %<struct%> type", name
);
9830 *no_add_attrs
= true;
9836 /* Check for valid arguments being passed to a function with FNTYPE.
9837 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9840 check_function_arguments (location_t loc
, const_tree fntype
, int nargs
,
9843 /* Check for null being passed in a pointer argument that must be
9844 non-null. We also need to do this if format checking is enabled. */
9847 check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9849 /* Check for errors in format strings. */
9851 if (warn_format
|| warn_suggest_attribute_format
)
9852 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9855 check_function_sentinel (fntype
, nargs
, argarray
);
9858 /* Generic argument checking recursion routine. PARAM is the argument to
9859 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9860 once the argument is resolved. CTX is context for the callback. */
9862 check_function_arguments_recurse (void (*callback
)
9863 (void *, tree
, unsigned HOST_WIDE_INT
),
9864 void *ctx
, tree param
,
9865 unsigned HOST_WIDE_INT param_num
)
9867 if (CONVERT_EXPR_P (param
)
9868 && (TYPE_PRECISION (TREE_TYPE (param
))
9869 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
9871 /* Strip coercion. */
9872 check_function_arguments_recurse (callback
, ctx
,
9873 TREE_OPERAND (param
, 0), param_num
);
9877 if (TREE_CODE (param
) == CALL_EXPR
)
9879 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
9881 bool found_format_arg
= false;
9883 /* See if this is a call to a known internationalization function
9884 that modifies a format arg. Such a function may have multiple
9885 format_arg attributes (for example, ngettext). */
9887 for (attrs
= TYPE_ATTRIBUTES (type
);
9889 attrs
= TREE_CHAIN (attrs
))
9890 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
9893 tree format_num_expr
;
9896 call_expr_arg_iterator iter
;
9898 /* Extract the argument number, which was previously checked
9900 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
9902 format_num
= tree_to_uhwi (format_num_expr
);
9904 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
9906 inner_arg
= next_call_expr_arg (&iter
), i
++)
9907 if (i
== format_num
)
9909 check_function_arguments_recurse (callback
, ctx
,
9910 inner_arg
, param_num
);
9911 found_format_arg
= true;
9916 /* If we found a format_arg attribute and did a recursive check,
9917 we are done with checking this argument. Otherwise, we continue
9918 and this will be considered a non-literal. */
9919 if (found_format_arg
)
9923 if (TREE_CODE (param
) == COND_EXPR
)
9925 /* Simplify to avoid warning for an impossible case. */
9926 param
= fold_for_warn (param
);
9927 if (TREE_CODE (param
) == COND_EXPR
)
9929 /* Check both halves of the conditional expression. */
9930 check_function_arguments_recurse (callback
, ctx
,
9931 TREE_OPERAND (param
, 1),
9933 check_function_arguments_recurse (callback
, ctx
,
9934 TREE_OPERAND (param
, 2),
9940 (*callback
) (ctx
, param
, param_num
);
9943 /* Checks for a builtin function FNDECL that the number of arguments
9944 NARGS against the required number REQUIRED and issues an error if
9945 there is a mismatch. Returns true if the number of arguments is
9946 correct, otherwise false. LOC is the location of FNDECL. */
9949 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
9952 if (nargs
< required
)
9954 error_at (loc
, "too few arguments to function %qE", fndecl
);
9957 else if (nargs
> required
)
9959 error_at (loc
, "too many arguments to function %qE", fndecl
);
9965 /* Helper macro for check_builtin_function_arguments. */
9966 #define ARG_LOCATION(N) \
9967 (arg_loc.is_empty () \
9968 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
9969 : expansion_point_location (arg_loc[(N)]))
9971 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
9972 Returns false if there was an error, otherwise true. LOC is the
9973 location of the function; ARG_LOC is a vector of locations of the
9977 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
9978 tree fndecl
, int nargs
, tree
*args
)
9980 if (!DECL_BUILT_IN (fndecl
)
9981 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
9984 switch (DECL_FUNCTION_CODE (fndecl
))
9986 case BUILT_IN_ALLOCA_WITH_ALIGN
:
9988 /* Get the requested alignment (in bits) if it's a constant
9989 integer expression. */
9990 unsigned HOST_WIDE_INT align
9991 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
9993 /* Determine if the requested alignment is a power of 2. */
9994 if ((align
& (align
- 1)))
9997 /* The maximum alignment in bits corresponding to the same
9998 maximum in bytes enforced in check_user_alignment(). */
9999 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
10001 /* Reject invalid alignments. */
10002 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
10004 error_at (ARG_LOCATION (1),
10005 "second argument to function %qE must be a constant "
10006 "integer power of 2 between %qi and %qu bits",
10007 fndecl
, BITS_PER_UNIT
, maxalign
);
10013 case BUILT_IN_CONSTANT_P
:
10014 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
10016 case BUILT_IN_ISFINITE
:
10017 case BUILT_IN_ISINF
:
10018 case BUILT_IN_ISINF_SIGN
:
10019 case BUILT_IN_ISNAN
:
10020 case BUILT_IN_ISNORMAL
:
10021 case BUILT_IN_SIGNBIT
:
10022 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
10024 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
10026 error_at (ARG_LOCATION (0), "non-floating-point argument in "
10027 "call to function %qE", fndecl
);
10034 case BUILT_IN_ISGREATER
:
10035 case BUILT_IN_ISGREATEREQUAL
:
10036 case BUILT_IN_ISLESS
:
10037 case BUILT_IN_ISLESSEQUAL
:
10038 case BUILT_IN_ISLESSGREATER
:
10039 case BUILT_IN_ISUNORDERED
:
10040 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
10042 enum tree_code code0
, code1
;
10043 code0
= TREE_CODE (TREE_TYPE (args
[0]));
10044 code1
= TREE_CODE (TREE_TYPE (args
[1]));
10045 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
10046 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
10047 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
10049 error_at (loc
, "non-floating-point arguments in call to "
10050 "function %qE", fndecl
);
10057 case BUILT_IN_FPCLASSIFY
:
10058 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
10060 for (unsigned int i
= 0; i
< 5; i
++)
10061 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
10063 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
10064 "call to function %qE", i
+ 1, fndecl
);
10068 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
10070 error_at (ARG_LOCATION (5), "non-floating-point argument in "
10071 "call to function %qE", fndecl
);
10078 case BUILT_IN_ASSUME_ALIGNED
:
10079 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
10081 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
10083 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
10084 "function %qE", fndecl
);
10091 case BUILT_IN_ADD_OVERFLOW
:
10092 case BUILT_IN_SUB_OVERFLOW
:
10093 case BUILT_IN_MUL_OVERFLOW
:
10094 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10097 for (i
= 0; i
< 2; i
++)
10098 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10100 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10101 "%qE does not have integral type", i
+ 1, fndecl
);
10104 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
10105 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
10107 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10108 "does not have pointer to integral type", fndecl
);
10111 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
10113 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10114 "has pointer to enumerated type", fndecl
);
10117 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
10119 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10120 "has pointer to boolean type", fndecl
);
10127 case BUILT_IN_ADD_OVERFLOW_P
:
10128 case BUILT_IN_SUB_OVERFLOW_P
:
10129 case BUILT_IN_MUL_OVERFLOW_P
:
10130 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10133 for (i
= 0; i
< 3; i
++)
10134 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10136 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10137 "%qE does not have integral type", i
+ 1, fndecl
);
10140 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
10142 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10143 "%qE has enumerated type", fndecl
);
10146 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
10148 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10149 "%qE has boolean type", fndecl
);
10161 /* Function to help qsort sort FIELD_DECLs by name order. */
10164 field_decl_cmp (const void *x_p
, const void *y_p
)
10166 const tree
*const x
= (const tree
*const) x_p
;
10167 const tree
*const y
= (const tree
*const) y_p
;
10169 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10170 /* A nontype is "greater" than a type. */
10171 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10172 if (DECL_NAME (*x
) == NULL_TREE
)
10174 if (DECL_NAME (*y
) == NULL_TREE
)
10176 if (DECL_NAME (*x
) < DECL_NAME (*y
))
10182 gt_pointer_operator new_value
;
10186 /* This routine compares two fields like field_decl_cmp but using the
10187 pointer operator in resort_data. */
10190 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
10192 const tree
*const x
= (const tree
*const) x_p
;
10193 const tree
*const y
= (const tree
*const) y_p
;
10195 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10196 /* A nontype is "greater" than a type. */
10197 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10198 if (DECL_NAME (*x
) == NULL_TREE
)
10200 if (DECL_NAME (*y
) == NULL_TREE
)
10203 tree d1
= DECL_NAME (*x
);
10204 tree d2
= DECL_NAME (*y
);
10205 resort_data
.new_value (&d1
, resort_data
.cookie
);
10206 resort_data
.new_value (&d2
, resort_data
.cookie
);
10213 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10216 resort_sorted_fields (void *obj
,
10217 void * ARG_UNUSED (orig_obj
),
10218 gt_pointer_operator new_value
,
10221 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
10222 resort_data
.new_value
= new_value
;
10223 resort_data
.cookie
= cookie
;
10224 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
10225 resort_field_decl_cmp
);
10228 /* Subroutine of c_parse_error.
10229 Return the result of concatenating LHS and RHS. RHS is really
10230 a string literal, its first character is indicated by RHS_START and
10231 RHS_SIZE is its length (including the terminating NUL character).
10233 The caller is responsible for deleting the returned pointer. */
10236 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
10238 const int lhs_size
= strlen (lhs
);
10239 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
10240 strncpy (result
, lhs
, lhs_size
);
10241 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
10245 /* Issue the error given by GMSGID, indicating that it occurred before
10246 TOKEN, which had the associated VALUE. */
10249 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
10250 tree value
, unsigned char token_flags
)
10252 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10254 char *message
= NULL
;
10256 if (token_type
== CPP_EOF
)
10257 message
= catenate_messages (gmsgid
, " at end of input");
10258 else if (token_type
== CPP_CHAR
10259 || token_type
== CPP_WCHAR
10260 || token_type
== CPP_CHAR16
10261 || token_type
== CPP_CHAR32
10262 || token_type
== CPP_UTF8CHAR
)
10264 unsigned int val
= TREE_INT_CST_LOW (value
);
10265 const char *prefix
;
10267 switch (token_type
)
10286 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
10287 message
= catenate_messages (gmsgid
, " before %s'%c'");
10289 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
10291 error (message
, prefix
, val
);
10295 else if (token_type
== CPP_CHAR_USERDEF
10296 || token_type
== CPP_WCHAR_USERDEF
10297 || token_type
== CPP_CHAR16_USERDEF
10298 || token_type
== CPP_CHAR32_USERDEF
10299 || token_type
== CPP_UTF8CHAR_USERDEF
)
10300 message
= catenate_messages (gmsgid
,
10301 " before user-defined character literal");
10302 else if (token_type
== CPP_STRING_USERDEF
10303 || token_type
== CPP_WSTRING_USERDEF
10304 || token_type
== CPP_STRING16_USERDEF
10305 || token_type
== CPP_STRING32_USERDEF
10306 || token_type
== CPP_UTF8STRING_USERDEF
)
10307 message
= catenate_messages (gmsgid
, " before user-defined string literal");
10308 else if (token_type
== CPP_STRING
10309 || token_type
== CPP_WSTRING
10310 || token_type
== CPP_STRING16
10311 || token_type
== CPP_STRING32
10312 || token_type
== CPP_UTF8STRING
)
10313 message
= catenate_messages (gmsgid
, " before string constant");
10314 else if (token_type
== CPP_NUMBER
)
10315 message
= catenate_messages (gmsgid
, " before numeric constant");
10316 else if (token_type
== CPP_NAME
)
10318 message
= catenate_messages (gmsgid
, " before %qE");
10319 error (message
, value
);
10323 else if (token_type
== CPP_PRAGMA
)
10324 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
10325 else if (token_type
== CPP_PRAGMA_EOL
)
10326 message
= catenate_messages (gmsgid
, " before end of line");
10327 else if (token_type
== CPP_DECLTYPE
)
10328 message
= catenate_messages (gmsgid
, " before %<decltype%>");
10329 else if (token_type
< N_TTYPES
)
10331 message
= catenate_messages (gmsgid
, " before %qs token");
10332 error (message
, cpp_type2name (token_type
, token_flags
));
10344 #undef catenate_messages
10347 /* Return the gcc option code associated with the reason for a cpp
10348 message, or 0 if none. */
10351 c_option_controlling_cpp_error (int reason
)
10353 const struct cpp_reason_option_codes_t
*entry
;
10355 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
10357 if (entry
->reason
== reason
)
10358 return entry
->option_code
;
10363 /* Callback from cpp_error for PFILE to print diagnostics from the
10364 preprocessor. The diagnostic is of type LEVEL, with REASON set
10365 to the reason code if LEVEL is represents a warning, at location
10366 RICHLOC unless this is after lexing and the compiler's location
10367 should be used instead; MSG is the translated message and AP
10368 the arguments. Returns true if a diagnostic was emitted, false
10372 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
10373 rich_location
*richloc
,
10374 const char *msg
, va_list *ap
)
10376 diagnostic_info diagnostic
;
10377 diagnostic_t dlevel
;
10378 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
10383 case CPP_DL_WARNING_SYSHDR
:
10384 if (flag_no_output
)
10386 global_dc
->dc_warn_system_headers
= 1;
10387 /* Fall through. */
10388 case CPP_DL_WARNING
:
10389 if (flag_no_output
)
10391 dlevel
= DK_WARNING
;
10393 case CPP_DL_PEDWARN
:
10394 if (flag_no_output
&& !flag_pedantic_errors
)
10396 dlevel
= DK_PEDWARN
;
10411 gcc_unreachable ();
10414 richloc
->set_range (line_table
, 0, input_location
, true);
10415 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
10417 diagnostic_override_option_index (&diagnostic
,
10418 c_option_controlling_cpp_error (reason
));
10419 ret
= report_diagnostic (&diagnostic
);
10420 if (level
== CPP_DL_WARNING_SYSHDR
)
10421 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
10425 /* Convert a character from the host to the target execution character
10426 set. cpplib handles this, mostly. */
10429 c_common_to_target_charset (HOST_WIDE_INT c
)
10431 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10432 zero-extended under -fno-signed-char. cpplib insists that characters
10433 and character constants are always unsigned. Hence we must convert
10435 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
10437 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
10439 if (flag_signed_char
)
10440 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
10441 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
10446 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10447 references with an INDIRECT_REF of a constant at the bottom; much like the
10448 traditional rendering of offsetof as a macro. Return the folded result. */
10451 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
10454 tree_code code
= TREE_CODE (expr
);
10461 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
10462 return error_mark_node
;
10466 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10467 return error_mark_node
;
10471 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
10473 error ("cannot apply %<offsetof%> to a non constant address");
10474 return error_mark_node
;
10476 return TREE_OPERAND (expr
, 0);
10478 case COMPONENT_REF
:
10479 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10480 if (base
== error_mark_node
)
10483 t
= TREE_OPERAND (expr
, 1);
10484 if (DECL_C_BIT_FIELD (t
))
10486 error ("attempt to take address of bit-field structure "
10488 return error_mark_node
;
10490 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
10491 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
10496 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10497 if (base
== error_mark_node
)
10500 t
= TREE_OPERAND (expr
, 1);
10502 /* Check if the offset goes beyond the upper bound of the array. */
10503 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
10505 tree upbound
= array_ref_up_bound (expr
);
10506 if (upbound
!= NULL_TREE
10507 && TREE_CODE (upbound
) == INTEGER_CST
10508 && !tree_int_cst_equal (upbound
,
10509 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
10511 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
10512 upbound
= size_binop (PLUS_EXPR
, upbound
,
10513 build_int_cst (TREE_TYPE (upbound
), 1));
10514 if (tree_int_cst_lt (upbound
, t
))
10518 for (v
= TREE_OPERAND (expr
, 0);
10519 TREE_CODE (v
) == COMPONENT_REF
;
10520 v
= TREE_OPERAND (v
, 0))
10521 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
10524 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
10525 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
10526 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
10532 /* Don't warn if the array might be considered a poor
10533 man's flexible array member with a very permissive
10534 definition thereof. */
10535 if (TREE_CODE (v
) == ARRAY_REF
10536 || TREE_CODE (v
) == COMPONENT_REF
)
10537 warning (OPT_Warray_bounds
,
10538 "index %E denotes an offset "
10539 "greater than size of %qT",
10540 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
10545 t
= convert (sizetype
, t
);
10546 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
10549 case COMPOUND_EXPR
:
10550 /* Handle static members of volatile structs. */
10551 t
= TREE_OPERAND (expr
, 1);
10552 gcc_assert (VAR_P (t
));
10553 return fold_offsetof_1 (t
);
10556 gcc_unreachable ();
10559 return fold_build_pointer_plus (base
, off
);
10562 /* Likewise, but convert it to the return type of offsetof. */
10565 fold_offsetof (tree expr
)
10567 return convert (size_type_node
, fold_offsetof_1 (expr
));
10570 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10571 expression, because B will always be true. */
10574 warn_for_omitted_condop (location_t location
, tree cond
)
10576 if (truth_value_p (TREE_CODE (cond
)))
10577 warning_at (location
, OPT_Wparentheses
,
10578 "the omitted middle operand in ?: will always be %<true%>, "
10579 "suggest explicit middle operand");
10582 /* Give an error for storing into ARG, which is 'const'. USE indicates
10583 how ARG was being used. */
10586 readonly_error (location_t loc
, tree arg
, enum lvalue_use use
)
10588 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
10590 /* Using this macro rather than (for example) arrays of messages
10591 ensures that all the format strings are checked at compile
10593 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10594 : (use == lv_increment ? (I) \
10595 : (use == lv_decrement ? (D) : (AS))))
10596 if (TREE_CODE (arg
) == COMPONENT_REF
)
10598 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
10599 error_at (loc
, READONLY_MSG (G_("assignment of member "
10600 "%qD in read-only object"),
10601 G_("increment of member "
10602 "%qD in read-only object"),
10603 G_("decrement of member "
10604 "%qD in read-only object"),
10605 G_("member %qD in read-only object "
10606 "used as %<asm%> output")),
10607 TREE_OPERAND (arg
, 1));
10609 error_at (loc
, READONLY_MSG (G_("assignment of read-only member %qD"),
10610 G_("increment of read-only member %qD"),
10611 G_("decrement of read-only member %qD"),
10612 G_("read-only member %qD used as %<asm%> output")),
10613 TREE_OPERAND (arg
, 1));
10615 else if (VAR_P (arg
))
10616 error_at (loc
, READONLY_MSG (G_("assignment of read-only variable %qD"),
10617 G_("increment of read-only variable %qD"),
10618 G_("decrement of read-only variable %qD"),
10619 G_("read-only variable %qD used as %<asm%> output")),
10621 else if (TREE_CODE (arg
) == PARM_DECL
)
10622 error_at (loc
, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10623 G_("increment of read-only parameter %qD"),
10624 G_("decrement of read-only parameter %qD"),
10625 G_("read-only parameter %qD use as %<asm%> output")),
10627 else if (TREE_CODE (arg
) == RESULT_DECL
)
10629 gcc_assert (c_dialect_cxx ());
10630 error_at (loc
, READONLY_MSG (G_("assignment of "
10631 "read-only named return value %qD"),
10633 "read-only named return value %qD"),
10635 "read-only named return value %qD"),
10636 G_("read-only named return value %qD "
10637 "used as %<asm%>output")),
10640 else if (TREE_CODE (arg
) == FUNCTION_DECL
)
10641 error_at (loc
, READONLY_MSG (G_("assignment of function %qD"),
10642 G_("increment of function %qD"),
10643 G_("decrement of function %qD"),
10644 G_("function %qD used as %<asm%> output")),
10647 error_at (loc
, READONLY_MSG (G_("assignment of read-only location %qE"),
10648 G_("increment of read-only location %qE"),
10649 G_("decrement of read-only location %qE"),
10650 G_("read-only location %qE used as %<asm%> output")),
10654 /* Print an error message for an invalid lvalue. USE says
10655 how the lvalue is being used and so selects the error message. LOC
10656 is the location for the error. */
10659 lvalue_error (location_t loc
, enum lvalue_use use
)
10664 error_at (loc
, "lvalue required as left operand of assignment");
10667 error_at (loc
, "lvalue required as increment operand");
10670 error_at (loc
, "lvalue required as decrement operand");
10673 error_at (loc
, "lvalue required as unary %<&%> operand");
10676 error_at (loc
, "lvalue required in asm statement");
10679 gcc_unreachable ();
10683 /* Print an error message for an invalid indirection of type TYPE.
10684 ERRSTRING is the name of the operator for the indirection. */
10687 invalid_indirection_error (location_t loc
, tree type
, ref_operator errstring
)
10692 gcc_assert (c_dialect_cxx ());
10693 error_at (loc
, "invalid type argument (have %qT)", type
);
10695 case RO_ARRAY_INDEXING
:
10697 "invalid type argument of array indexing (have %qT)",
10700 case RO_UNARY_STAR
:
10702 "invalid type argument of unary %<*%> (have %qT)",
10707 "invalid type argument of %<->%> (have %qT)",
10710 case RO_ARROW_STAR
:
10712 "invalid type argument of %<->*%> (have %qT)",
10715 case RO_IMPLICIT_CONVERSION
:
10717 "invalid type argument of implicit conversion (have %qT)",
10721 gcc_unreachable ();
10725 /* *PTYPE is an incomplete array. Complete it with a domain based on
10726 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10727 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10728 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10731 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
10733 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
10734 int failure
= 0, quals
;
10735 hashval_t hashcode
= 0;
10736 bool overflow_p
= false;
10738 maxindex
= size_zero_node
;
10741 if (TREE_CODE (initial_value
) == STRING_CST
)
10744 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
10745 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
10747 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
10749 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
10751 if (vec_safe_is_empty (v
))
10755 maxindex
= ssize_int (-1);
10760 unsigned HOST_WIDE_INT cnt
;
10761 constructor_elt
*ce
;
10762 bool fold_p
= false;
10765 maxindex
= (*v
)[0].index
, fold_p
= true;
10767 curindex
= maxindex
;
10769 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
10771 bool curfold_p
= false;
10773 curindex
= ce
->index
, curfold_p
= true;
10778 /* Since we treat size types now as ordinary
10779 unsigned types, we need an explicit overflow
10781 tree orig
= curindex
;
10782 curindex
= fold_convert (sizetype
, curindex
);
10783 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
10785 curindex
= size_binop (PLUS_EXPR
, curindex
,
10788 if (tree_int_cst_lt (maxindex
, curindex
))
10789 maxindex
= curindex
, fold_p
= curfold_p
;
10793 tree orig
= maxindex
;
10794 maxindex
= fold_convert (sizetype
, maxindex
);
10795 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
10801 /* Make an error message unless that happened already. */
10802 if (initial_value
!= error_mark_node
)
10814 elt
= TREE_TYPE (type
);
10815 quals
= TYPE_QUALS (strip_array_types (elt
));
10819 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
10821 /* Using build_distinct_type_copy and modifying things afterward instead
10822 of using build_array_type to create a new type preserves all of the
10823 TYPE_LANG_FLAG_? bits that the front end may have set. */
10824 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
10825 TREE_TYPE (main_type
) = unqual_elt
;
10826 TYPE_DOMAIN (main_type
)
10827 = build_range_type (TREE_TYPE (maxindex
),
10828 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
10829 layout_type (main_type
);
10831 /* Make sure we have the canonical MAIN_TYPE. */
10832 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
10833 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
10835 main_type
= type_hash_canon (hashcode
, main_type
);
10837 /* Fix the canonical type. */
10838 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
10839 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
10840 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
10841 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
10842 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
10843 != TYPE_DOMAIN (main_type
)))
10844 TYPE_CANONICAL (main_type
)
10845 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
10846 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
10848 TYPE_CANONICAL (main_type
) = main_type
;
10853 type
= c_build_qualified_type (main_type
, quals
);
10855 if (COMPLETE_TYPE_P (type
)
10856 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
10857 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
10859 error ("size of array is too large");
10860 /* If we proceed with the array type as it is, we'll eventually
10861 crash in tree_to_[su]hwi(). */
10862 type
= error_mark_node
;
10869 /* Like c_mark_addressable but don't check register qualifier. */
10871 c_common_mark_addressable_vec (tree t
)
10873 while (handled_component_p (t
))
10874 t
= TREE_OPERAND (t
, 0);
10875 if (!VAR_P (t
) && TREE_CODE (t
) != PARM_DECL
)
10877 TREE_ADDRESSABLE (t
) = 1;
10882 /* Used to help initialize the builtin-types.def table. When a type of
10883 the correct size doesn't exist, use error_mark_node instead of NULL.
10884 The later results in segfaults even when a decl using the type doesn't
10888 builtin_type_for_size (int size
, bool unsignedp
)
10890 tree type
= c_common_type_for_size (size
, unsignedp
);
10891 return type
? type
: error_mark_node
;
10894 /* A helper function for resolve_overloaded_builtin in resolving the
10895 overloaded __sync_ builtins. Returns a positive power of 2 if the
10896 first operand of PARAMS is a pointer to a supported data type.
10897 Returns 0 if an error is encountered.
10898 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10902 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
10904 /* Type of the argument. */
10906 /* Type the argument points to. */
10910 if (vec_safe_is_empty (params
))
10912 error ("too few arguments to function %qE", function
);
10916 argtype
= type
= TREE_TYPE ((*params
)[0]);
10917 if (TREE_CODE (type
) == ARRAY_TYPE
)
10919 /* Force array-to-pointer decay for C++. */
10920 gcc_assert (c_dialect_cxx());
10921 (*params
)[0] = default_conversion ((*params
)[0]);
10922 type
= TREE_TYPE ((*params
)[0]);
10924 if (TREE_CODE (type
) != POINTER_TYPE
)
10927 type
= TREE_TYPE (type
);
10928 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
10931 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
10934 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
10935 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
10939 /* Issue the diagnostic only if the argument is valid, otherwise
10940 it would be redundant at best and could be misleading. */
10941 if (argtype
!= error_mark_node
)
10942 error ("operand type %qT is incompatible with argument %d of %qE",
10943 argtype
, 1, function
);
10947 /* A helper function for resolve_overloaded_builtin. Adds casts to
10948 PARAMS to make arguments match up with those of FUNCTION. Drops
10949 the variadic arguments at the end. Returns false if some error
10950 was encountered; true on success. */
10953 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
10954 vec
<tree
, va_gc
> *params
, bool orig_format
)
10956 function_args_iterator iter
;
10958 unsigned int parmnum
;
10960 function_args_iter_init (&iter
, TREE_TYPE (function
));
10961 /* We've declared the implementation functions to use "volatile void *"
10962 as the pointer parameter, so we shouldn't get any complaints from the
10963 call to check_function_arguments what ever type the user used. */
10964 function_args_iter_next (&iter
);
10965 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
10966 ptype
= TYPE_MAIN_VARIANT (ptype
);
10968 /* For the rest of the values, we need to cast these to FTYPE, so that we
10969 don't get warnings for passing pointer types, etc. */
10973 tree val
, arg_type
;
10975 arg_type
= function_args_iter_cond (&iter
);
10976 /* XXX void_type_node belies the abstraction. */
10977 if (arg_type
== void_type_node
)
10981 if (params
->length () <= parmnum
)
10983 error_at (loc
, "too few arguments to function %qE", orig_function
);
10987 /* Only convert parameters if arg_type is unsigned integer type with
10988 new format sync routines, i.e. don't attempt to convert pointer
10989 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
10990 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
10992 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
10994 /* Ideally for the first conversion we'd use convert_for_assignment
10995 so that we get warnings for anything that doesn't match the pointer
10996 type. This isn't portable across the C and C++ front ends atm. */
10997 val
= (*params
)[parmnum
];
10998 val
= convert (ptype
, val
);
10999 val
= convert (arg_type
, val
);
11000 (*params
)[parmnum
] = val
;
11003 function_args_iter_next (&iter
);
11006 /* __atomic routines are not variadic. */
11007 if (!orig_format
&& params
->length () != parmnum
+ 1)
11009 error_at (loc
, "too many arguments to function %qE", orig_function
);
11013 /* The definition of these primitives is variadic, with the remaining
11014 being "an optional list of variables protected by the memory barrier".
11015 No clue what that's supposed to mean, precisely, but we consider all
11016 call-clobbered variables to be protected so we're safe. */
11017 params
->truncate (parmnum
+ 1);
11022 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11023 RESULT to make it match the type of the first pointer argument in
11027 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
11029 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
11030 tree rtype
= TREE_TYPE (result
);
11031 ptype
= TYPE_MAIN_VARIANT (ptype
);
11033 /* New format doesn't require casting unless the types are the same size. */
11034 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
11035 return convert (ptype
, result
);
11040 /* This function verifies the PARAMS to generic atomic FUNCTION.
11041 It returns the size if all the parameters are the same size, otherwise
11042 0 is returned if the parameters are invalid. */
11045 get_atomic_generic_size (location_t loc
, tree function
,
11046 vec
<tree
, va_gc
> *params
)
11048 unsigned int n_param
;
11049 unsigned int n_model
;
11054 /* Determine the parameter makeup. */
11055 switch (DECL_FUNCTION_CODE (function
))
11057 case BUILT_IN_ATOMIC_EXCHANGE
:
11061 case BUILT_IN_ATOMIC_LOAD
:
11062 case BUILT_IN_ATOMIC_STORE
:
11066 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11071 gcc_unreachable ();
11074 if (vec_safe_length (params
) != n_param
)
11076 error_at (loc
, "incorrect number of arguments to function %qE", function
);
11080 /* Get type of first parameter, and determine its size. */
11081 type_0
= TREE_TYPE ((*params
)[0]);
11082 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
11084 /* Force array-to-pointer decay for C++. */
11085 gcc_assert (c_dialect_cxx());
11086 (*params
)[0] = default_conversion ((*params
)[0]);
11087 type_0
= TREE_TYPE ((*params
)[0]);
11089 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
11091 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
11096 /* Types must be compile time constant sizes. */
11097 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
11100 "argument 1 of %qE must be a pointer to a constant size type",
11105 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
11107 /* Zero size objects are not allowed. */
11111 "argument 1 of %qE must be a pointer to a nonzero size object",
11116 /* Check each other parameter is a pointer and the same size. */
11117 for (x
= 0; x
< n_param
- n_model
; x
++)
11120 tree type
= TREE_TYPE ((*params
)[x
]);
11121 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11122 if (n_param
== 6 && x
== 3)
11124 if (!POINTER_TYPE_P (type
))
11126 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
11130 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
11131 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
11134 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
11135 "size type", x
+ 1, function
);
11138 else if (FUNCTION_POINTER_TYPE_P (type
))
11140 error_at (loc
, "argument %d of %qE must not be a pointer to a "
11141 "function", x
+ 1, function
);
11144 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
11145 size
= type_size
? tree_to_uhwi (type_size
) : 0;
11146 if (size
!= size_0
)
11148 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
11154 /* Check memory model parameters for validity. */
11155 for (x
= n_param
- n_model
; x
< n_param
; x
++)
11157 tree p
= (*params
)[x
];
11158 if (TREE_CODE (p
) == INTEGER_CST
)
11160 int i
= tree_to_uhwi (p
);
11161 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
11163 warning_at (loc
, OPT_Winvalid_memory_model
,
11164 "invalid memory model argument %d of %qE", x
+ 1,
11169 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
11171 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
11181 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11182 at the beginning of the parameter list PARAMS representing the size of the
11183 objects. This is to match the library ABI requirement. LOC is the location
11184 of the function call.
11185 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11186 returned to allow the external call to be constructed. */
11189 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
11190 vec
<tree
, va_gc
> *params
)
11194 /* Insert a SIZE_T parameter as the first param. If there isn't
11195 enough space, allocate a new vector and recursively re-build with that. */
11196 if (!params
->space (1))
11198 unsigned int z
, len
;
11199 vec
<tree
, va_gc
> *v
;
11202 len
= params
->length ();
11203 vec_alloc (v
, len
+ 1);
11204 v
->quick_push (build_int_cst (size_type_node
, n
));
11205 for (z
= 0; z
< len
; z
++)
11206 v
->quick_push ((*params
)[z
]);
11207 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
11212 /* Add the size parameter and leave as a function call for processing. */
11213 size_node
= build_int_cst (size_type_node
, n
);
11214 params
->quick_insert (0, size_node
);
11219 /* Return whether atomic operations for naturally aligned N-byte
11220 arguments are supported, whether inline or through libatomic. */
11222 atomic_size_supported_p (int n
)
11233 return targetm
.scalar_mode_supported_p (TImode
);
11240 /* This will process an __atomic_exchange function call, determine whether it
11241 needs to be mapped to the _N variation, or turned into a library call.
11242 LOC is the location of the builtin call.
11243 FUNCTION is the DECL that has been invoked;
11244 PARAMS is the argument list for the call. The return value is non-null
11245 TRUE is returned if it is translated into the proper format for a call to the
11246 external library, and NEW_RETURN is set the tree for that function.
11247 FALSE is returned if processing for the _N variation is required, and
11248 NEW_RETURN is set to the return value the result is copied into. */
11250 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
11251 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11253 tree p0
, p1
, p2
, p3
;
11254 tree I_type
, I_type_ptr
;
11255 int n
= get_atomic_generic_size (loc
, function
, params
);
11257 /* Size of 0 is an error condition. */
11260 *new_return
= error_mark_node
;
11264 /* If not a lock-free size, change to the library generic format. */
11265 if (!atomic_size_supported_p (n
))
11267 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11271 /* Otherwise there is a lockfree match, transform the call from:
11272 void fn(T* mem, T* desired, T* return, model)
11274 *return = (T) (fn (In* mem, (In) *desired, model)) */
11281 /* Create pointer to appropriate size. */
11282 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11283 I_type_ptr
= build_pointer_type (I_type
);
11285 /* Convert object pointer to required type. */
11286 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11288 /* Convert new value to required type, and dereference it. */
11289 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11290 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11293 /* Move memory model to the 3rd position, and end param list. */
11295 params
->truncate (3);
11297 /* Convert return pointer and dereference it for later assignment. */
11298 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11304 /* This will process an __atomic_compare_exchange function call, determine
11305 whether it needs to be mapped to the _N variation, or turned into a lib call.
11306 LOC is the location of the builtin call.
11307 FUNCTION is the DECL that has been invoked;
11308 PARAMS is the argument list for the call. The return value is non-null
11309 TRUE is returned if it is translated into the proper format for a call to the
11310 external library, and NEW_RETURN is set the tree for that function.
11311 FALSE is returned if processing for the _N variation is required. */
11314 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
11315 vec
<tree
, va_gc
> *params
,
11319 tree I_type
, I_type_ptr
;
11320 int n
= get_atomic_generic_size (loc
, function
, params
);
11322 /* Size of 0 is an error condition. */
11325 *new_return
= error_mark_node
;
11329 /* If not a lock-free size, change to the library generic format. */
11330 if (!atomic_size_supported_p (n
))
11332 /* The library generic format does not have the weak parameter, so
11333 remove it from the param list. Since a parameter has been removed,
11334 we can be sure that there is room for the SIZE_T parameter, meaning
11335 there will not be a recursive rebuilding of the parameter list, so
11336 there is no danger this will be done twice. */
11339 (*params
)[3] = (*params
)[4];
11340 (*params
)[4] = (*params
)[5];
11341 params
->truncate (5);
11343 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11347 /* Otherwise, there is a match, so the call needs to be transformed from:
11348 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11350 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11356 /* Create pointer to appropriate size. */
11357 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11358 I_type_ptr
= build_pointer_type (I_type
);
11360 /* Convert object pointer to required type. */
11361 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11364 /* Convert expected pointer to required type. */
11365 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
11368 /* Convert desired value to required type, and dereference it. */
11369 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11370 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
11373 /* The rest of the parameters are fine. NULL means no special return value
11375 *new_return
= NULL
;
11380 /* This will process an __atomic_load function call, determine whether it
11381 needs to be mapped to the _N variation, or turned into a library call.
11382 LOC is the location of the builtin call.
11383 FUNCTION is the DECL that has been invoked;
11384 PARAMS is the argument list for the call. The return value is non-null
11385 TRUE is returned if it is translated into the proper format for a call to the
11386 external library, and NEW_RETURN is set the tree for that function.
11387 FALSE is returned if processing for the _N variation is required, and
11388 NEW_RETURN is set to the return value the result is copied into. */
11391 resolve_overloaded_atomic_load (location_t loc
, tree function
,
11392 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11395 tree I_type
, I_type_ptr
;
11396 int n
= get_atomic_generic_size (loc
, function
, params
);
11398 /* Size of 0 is an error condition. */
11401 *new_return
= error_mark_node
;
11405 /* If not a lock-free size, change to the library generic format. */
11406 if (!atomic_size_supported_p (n
))
11408 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11412 /* Otherwise, there is a match, so the call needs to be transformed from:
11413 void fn(T* mem, T* return, model)
11415 *return = (T) (fn ((In *) mem, model)) */
11421 /* Create pointer to appropriate size. */
11422 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11423 I_type_ptr
= build_pointer_type (I_type
);
11425 /* Convert object pointer to required type. */
11426 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11429 /* Move memory model to the 2nd position, and end param list. */
11431 params
->truncate (2);
11433 /* Convert return pointer and dereference it for later assignment. */
11434 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11440 /* This will process an __atomic_store function call, determine whether it
11441 needs to be mapped to the _N variation, or turned into a library call.
11442 LOC is the location of the builtin call.
11443 FUNCTION is the DECL that has been invoked;
11444 PARAMS is the argument list for the call. The return value is non-null
11445 TRUE is returned if it is translated into the proper format for a call to the
11446 external library, and NEW_RETURN is set the tree for that function.
11447 FALSE is returned if processing for the _N variation is required, and
11448 NEW_RETURN is set to the return value the result is copied into. */
11451 resolve_overloaded_atomic_store (location_t loc
, tree function
,
11452 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11455 tree I_type
, I_type_ptr
;
11456 int n
= get_atomic_generic_size (loc
, function
, params
);
11458 /* Size of 0 is an error condition. */
11461 *new_return
= error_mark_node
;
11465 /* If not a lock-free size, change to the library generic format. */
11466 if (!atomic_size_supported_p (n
))
11468 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11472 /* Otherwise, there is a match, so the call needs to be transformed from:
11473 void fn(T* mem, T* value, model)
11475 fn ((In *) mem, (In) *value, model) */
11480 /* Create pointer to appropriate size. */
11481 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11482 I_type_ptr
= build_pointer_type (I_type
);
11484 /* Convert object pointer to required type. */
11485 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11488 /* Convert new value to required type, and dereference it. */
11489 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11490 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11493 /* The memory model is in the right spot already. Return is void. */
11494 *new_return
= NULL_TREE
;
11500 /* Some builtin functions are placeholders for other expressions. This
11501 function should be called immediately after parsing the call expression
11502 before surrounding code has committed to the type of the expression.
11504 LOC is the location of the builtin call.
11506 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11507 PARAMS is the argument list for the call. The return value is non-null
11508 when expansion is complete, and null if normal processing should
11512 resolve_overloaded_builtin (location_t loc
, tree function
,
11513 vec
<tree
, va_gc
> *params
)
11515 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
11517 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11518 Those are not valid to call with a pointer to _Bool (or C++ bool)
11519 and so must be rejected. */
11520 bool fetch_op
= true;
11521 bool orig_format
= true;
11522 tree new_return
= NULL_TREE
;
11524 switch (DECL_BUILT_IN_CLASS (function
))
11526 case BUILT_IN_NORMAL
:
11529 if (targetm
.resolve_overloaded_builtin
)
11530 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
11537 /* Handle BUILT_IN_NORMAL here. */
11540 case BUILT_IN_ATOMIC_EXCHANGE
:
11541 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11542 case BUILT_IN_ATOMIC_LOAD
:
11543 case BUILT_IN_ATOMIC_STORE
:
11545 /* Handle these 4 together so that they can fall through to the next
11546 case if the call is transformed to an _N variant. */
11549 case BUILT_IN_ATOMIC_EXCHANGE
:
11551 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
11554 /* Change to the _N variant. */
11555 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
11559 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11561 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
11565 /* Change to the _N variant. */
11566 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
11569 case BUILT_IN_ATOMIC_LOAD
:
11571 if (resolve_overloaded_atomic_load (loc
, function
, params
,
11574 /* Change to the _N variant. */
11575 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
11578 case BUILT_IN_ATOMIC_STORE
:
11580 if (resolve_overloaded_atomic_store (loc
, function
, params
,
11583 /* Change to the _N variant. */
11584 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
11588 gcc_unreachable ();
11590 /* Fallthrough to the normal processing. */
11592 case BUILT_IN_ATOMIC_EXCHANGE_N
:
11593 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
11594 case BUILT_IN_ATOMIC_LOAD_N
:
11595 case BUILT_IN_ATOMIC_STORE_N
:
11598 /* Fallthrough to further processing. */
11600 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
11601 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
11602 case BUILT_IN_ATOMIC_AND_FETCH_N
:
11603 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
11604 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
11605 case BUILT_IN_ATOMIC_OR_FETCH_N
:
11606 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
11607 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
11608 case BUILT_IN_ATOMIC_FETCH_AND_N
:
11609 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
11610 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
11611 case BUILT_IN_ATOMIC_FETCH_OR_N
:
11613 orig_format
= false;
11614 /* Fallthru for parameter processing. */
11616 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
11617 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
11618 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
11619 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
11620 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
11621 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
11622 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
11623 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
11624 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
11625 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
11626 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
11627 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
11628 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
11629 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
11630 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
11631 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
11633 /* The following are not _FETCH_OPs and must be accepted with
11634 pointers to _Bool (or C++ bool). */
11637 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11638 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11639 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11640 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
11642 int n
= sync_resolve_size (function
, params
, fetch_op
);
11643 tree new_function
, first_param
, result
;
11644 enum built_in_function fncode
;
11647 return error_mark_node
;
11649 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
11650 new_function
= builtin_decl_explicit (fncode
);
11651 if (!sync_resolve_params (loc
, function
, new_function
, params
,
11653 return error_mark_node
;
11655 first_param
= (*params
)[0];
11656 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
11658 if (result
== error_mark_node
)
11660 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11661 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
11662 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
11663 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
11664 result
= sync_resolve_return (first_param
, result
, orig_format
);
11667 /* Prevent -Wunused-value warning. */
11668 TREE_USED (result
) = true;
11670 /* If new_return is set, assign function to that expr and cast the
11671 result to void since the generic interface returned void. */
11674 /* Cast function result from I{1,2,4,8,16} to the required type. */
11675 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
11676 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
11678 TREE_SIDE_EFFECTS (result
) = 1;
11679 protected_set_expr_location (result
, loc
);
11680 result
= convert (void_type_node
, result
);
11690 /* vector_types_compatible_elements_p is used in type checks of vectors
11691 values used as operands of binary operators. Where it returns true, and
11692 the other checks of the caller succeed (being vector types in he first
11693 place, and matching number of elements), we can just treat the types
11694 as essentially the same.
11695 Contrast with vector_targets_convertible_p, which is used for vector
11696 pointer types, and vector_types_convertible_p, which will allow
11697 language-specific matches under the control of flag_lax_vector_conversions,
11698 and might still require a conversion. */
11699 /* True if vector types T1 and T2 can be inputs to the same binary
11700 operator without conversion.
11701 We don't check the overall vector size here because some of our callers
11702 want to give different error messages when the vectors are compatible
11703 except for the element count. */
11706 vector_types_compatible_elements_p (tree t1
, tree t2
)
11708 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
11709 t1
= TREE_TYPE (t1
);
11710 t2
= TREE_TYPE (t2
);
11712 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
11714 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
11715 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
11716 || c2
== FIXED_POINT_TYPE
));
11718 t1
= c_common_signed_type (t1
);
11719 t2
= c_common_signed_type (t2
);
11720 /* Equality works here because c_common_signed_type uses
11721 TYPE_MAIN_VARIANT. */
11724 if (opaque
&& c1
== c2
11725 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
11726 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
11731 /* Check for missing format attributes on function pointers. LTYPE is
11732 the new type or left-hand side type. RTYPE is the old type or
11733 right-hand side type. Returns TRUE if LTYPE is missing the desired
11737 check_missing_format_attribute (tree ltype
, tree rtype
)
11739 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
11742 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
11743 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
11748 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
11749 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
11757 /* Subscripting with type char is likely to lose on a machine where
11758 chars are signed. So warn on any machine, but optionally. Don't
11759 warn for unsigned char since that type is safe. Don't warn for
11760 signed char because anyone who uses that must have done so
11761 deliberately. Furthermore, we reduce the false positive load by
11762 warning only for non-constant value of type char. */
11765 warn_array_subscript_with_type_char (location_t loc
, tree index
)
11767 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
11768 && TREE_CODE (index
) != INTEGER_CST
)
11769 warning_at (loc
, OPT_Wchar_subscripts
,
11770 "array subscript has type %<char%>");
11773 /* Implement -Wparentheses for the unexpected C precedence rules, to
11774 cover cases like x + y << z which readers are likely to
11775 misinterpret. We have seen an expression in which CODE is a binary
11776 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11777 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11778 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11779 expression was not formed using a binary or unary operator, or it
11780 was enclosed in parentheses. */
11783 warn_about_parentheses (location_t loc
, enum tree_code code
,
11784 enum tree_code code_left
, tree arg_left
,
11785 enum tree_code code_right
, tree arg_right
)
11787 if (!warn_parentheses
)
11790 /* This macro tests that the expression ARG with original tree code
11791 CODE appears to be a boolean expression. or the result of folding a
11792 boolean expression. */
11793 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11794 (truth_value_p (TREE_CODE (ARG)) \
11795 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11796 /* Folding may create 0 or 1 integers from other expressions. */ \
11797 || ((CODE) != INTEGER_CST \
11798 && (integer_onep (ARG) || integer_zerop (ARG))))
11803 if (code_left
== PLUS_EXPR
)
11804 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11805 "suggest parentheses around %<+%> inside %<<<%>");
11806 else if (code_right
== PLUS_EXPR
)
11807 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11808 "suggest parentheses around %<+%> inside %<<<%>");
11809 else if (code_left
== MINUS_EXPR
)
11810 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11811 "suggest parentheses around %<-%> inside %<<<%>");
11812 else if (code_right
== MINUS_EXPR
)
11813 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11814 "suggest parentheses around %<-%> inside %<<<%>");
11818 if (code_left
== PLUS_EXPR
)
11819 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11820 "suggest parentheses around %<+%> inside %<>>%>");
11821 else if (code_right
== PLUS_EXPR
)
11822 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11823 "suggest parentheses around %<+%> inside %<>>%>");
11824 else if (code_left
== MINUS_EXPR
)
11825 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11826 "suggest parentheses around %<-%> inside %<>>%>");
11827 else if (code_right
== MINUS_EXPR
)
11828 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11829 "suggest parentheses around %<-%> inside %<>>%>");
11832 case TRUTH_ORIF_EXPR
:
11833 if (code_left
== TRUTH_ANDIF_EXPR
)
11834 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11835 "suggest parentheses around %<&&%> within %<||%>");
11836 else if (code_right
== TRUTH_ANDIF_EXPR
)
11837 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11838 "suggest parentheses around %<&&%> within %<||%>");
11842 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
11843 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11844 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11845 "suggest parentheses around arithmetic in operand of %<|%>");
11846 else if (code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
11847 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11848 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11849 "suggest parentheses around arithmetic in operand of %<|%>");
11850 /* Check cases like x|y==z */
11851 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11852 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11853 "suggest parentheses around comparison in operand of %<|%>");
11854 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11855 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11856 "suggest parentheses around comparison in operand of %<|%>");
11857 /* Check cases like !x | y */
11858 else if (code_left
== TRUTH_NOT_EXPR
11859 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11860 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11861 "suggest parentheses around operand of "
11862 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
11866 if (code_left
== BIT_AND_EXPR
11867 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11868 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11869 "suggest parentheses around arithmetic in operand of %<^%>");
11870 else if (code_right
== BIT_AND_EXPR
11871 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11872 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11873 "suggest parentheses around arithmetic in operand of %<^%>");
11874 /* Check cases like x^y==z */
11875 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11876 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11877 "suggest parentheses around comparison in operand of %<^%>");
11878 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11879 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11880 "suggest parentheses around comparison in operand of %<^%>");
11884 if (code_left
== PLUS_EXPR
)
11885 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11886 "suggest parentheses around %<+%> in operand of %<&%>");
11887 else if (code_right
== PLUS_EXPR
)
11888 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11889 "suggest parentheses around %<+%> in operand of %<&%>");
11890 else if (code_left
== MINUS_EXPR
)
11891 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11892 "suggest parentheses around %<-%> in operand of %<&%>");
11893 else if (code_right
== MINUS_EXPR
)
11894 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11895 "suggest parentheses around %<-%> in operand of %<&%>");
11896 /* Check cases like x&y==z */
11897 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11898 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11899 "suggest parentheses around comparison in operand of %<&%>");
11900 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11901 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11902 "suggest parentheses around comparison in operand of %<&%>");
11903 /* Check cases like !x & y */
11904 else if (code_left
== TRUTH_NOT_EXPR
11905 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11906 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11907 "suggest parentheses around operand of "
11908 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
11912 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11913 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11914 "suggest parentheses around comparison in operand of %<==%>");
11915 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11916 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11917 "suggest parentheses around comparison in operand of %<==%>");
11920 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11921 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11922 "suggest parentheses around comparison in operand of %<!=%>");
11923 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11924 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11925 "suggest parentheses around comparison in operand of %<!=%>");
11929 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
11931 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
11932 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
11933 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
11934 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11935 "comparisons like %<X<=Y<=Z%> do not "
11936 "have their mathematical meaning");
11937 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
11938 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
11939 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))
11940 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11941 "comparisons like %<X<=Y<=Z%> do not "
11942 "have their mathematical meaning");
11946 #undef NOT_A_BOOLEAN_EXPR_P
11949 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11952 warn_for_unused_label (tree label
)
11954 if (!TREE_USED (label
))
11956 if (DECL_INITIAL (label
))
11957 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
11959 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
11963 /* Warn for division by zero according to the value of DIVISOR. LOC
11964 is the location of the division operator. */
11967 warn_for_div_by_zero (location_t loc
, tree divisor
)
11969 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
11970 about division by zero. Do not issue a warning if DIVISOR has a
11971 floating-point type, since we consider 0.0/0.0 a valid way of
11972 generating a NaN. */
11973 if (c_inhibit_evaluation_warnings
== 0
11974 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
11975 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
11978 /* Warn for patterns where memset appears to be used incorrectly. The
11979 warning location should be LOC. ARG0, and ARG2 are the first and
11980 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
11981 each argument that was a literal zero. */
11984 warn_for_memset (location_t loc
, tree arg0
, tree arg2
,
11985 int literal_zero_mask
)
11987 if (warn_memset_transposed_args
11988 && integer_zerop (arg2
)
11989 && (literal_zero_mask
& (1 << 2)) != 0
11990 && (literal_zero_mask
& (1 << 1)) == 0)
11991 warning_at (loc
, OPT_Wmemset_transposed_args
,
11992 "%<memset%> used with constant zero length "
11993 "parameter; this could be due to transposed "
11996 if (warn_memset_elt_size
&& TREE_CODE (arg2
) == INTEGER_CST
)
11999 if (TREE_CODE (arg0
) == ADDR_EXPR
)
12000 arg0
= TREE_OPERAND (arg0
, 0);
12001 tree type
= TREE_TYPE (arg0
);
12002 if (type
!= NULL_TREE
&& TREE_CODE (type
) == ARRAY_TYPE
)
12004 tree elt_type
= TREE_TYPE (type
);
12005 tree domain
= TYPE_DOMAIN (type
);
12006 if (!integer_onep (TYPE_SIZE_UNIT (elt_type
))
12007 && domain
!= NULL_TREE
12008 && TYPE_MAXVAL (domain
)
12009 && TYPE_MINVAL (domain
)
12010 && integer_zerop (TYPE_MINVAL (domain
))
12011 && integer_onep (fold_build2 (MINUS_EXPR
, domain
,
12013 TYPE_MAXVAL (domain
))))
12014 warning_at (loc
, OPT_Wmemset_elt_size
,
12015 "%<memset%> used with length equal to "
12016 "number of elements without multiplication "
12017 "by element size");
12022 /* Subroutine of build_binary_op. Give warnings for comparisons
12023 between signed and unsigned quantities that may fail. Do the
12024 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
12025 so that casts will be considered, but default promotions won't
12028 LOCATION is the location of the comparison operator.
12030 The arguments of this function map directly to local variables
12031 of build_binary_op. */
12034 warn_for_sign_compare (location_t location
,
12035 tree orig_op0
, tree orig_op1
,
12036 tree op0
, tree op1
,
12037 tree result_type
, enum tree_code resultcode
)
12039 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
12040 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
12041 int unsignedp0
, unsignedp1
;
12043 /* In C++, check for comparison of different enum types. */
12044 if (c_dialect_cxx()
12045 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
12046 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
12047 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
12048 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
12050 warning_at (location
,
12051 OPT_Wsign_compare
, "comparison between types %qT and %qT",
12052 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
12055 /* Do not warn if the comparison is being done in a signed type,
12056 since the signed type will only be chosen if it can represent
12057 all the values of the unsigned type. */
12058 if (!TYPE_UNSIGNED (result_type
))
12060 /* Do not warn if both operands are unsigned. */
12061 else if (op0_signed
== op1_signed
)
12065 tree sop
, uop
, base_type
;
12069 sop
= orig_op0
, uop
= orig_op1
;
12071 sop
= orig_op1
, uop
= orig_op0
;
12073 STRIP_TYPE_NOPS (sop
);
12074 STRIP_TYPE_NOPS (uop
);
12075 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
12076 ? TREE_TYPE (result_type
) : result_type
);
12078 /* Do not warn if the signed quantity is an unsuffixed integer
12079 literal (or some static constant expression involving such
12080 literals or a conditional expression involving such literals)
12081 and it is non-negative. */
12082 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
12084 /* Do not warn if the comparison is an equality operation, the
12085 unsigned quantity is an integral constant, and it would fit
12086 in the result if the result were signed. */
12087 else if (TREE_CODE (uop
) == INTEGER_CST
12088 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
12089 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
12091 /* In C, do not warn if the unsigned quantity is an enumeration
12092 constant and its maximum value would fit in the result if the
12093 result were signed. */
12094 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
12095 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
12096 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
12097 c_common_signed_type (base_type
)))
12100 warning_at (location
,
12102 "comparison between signed and unsigned integer expressions");
12105 /* Warn if two unsigned values are being compared in a size larger
12106 than their original size, and one (and only one) is the result of
12107 a `~' operator. This comparison will always fail.
12109 Also warn if one operand is a constant, and the constant does not
12110 have all bits set that are set in the ~ operand when it is
12113 op0
= c_common_get_narrower (op0
, &unsignedp0
);
12114 op1
= c_common_get_narrower (op1
, &unsignedp1
);
12116 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
12117 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
12119 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
12120 op0
= c_common_get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
12121 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
12122 op1
= c_common_get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
12124 if (tree_fits_shwi_p (op0
) || tree_fits_shwi_p (op1
))
12127 HOST_WIDE_INT constant
, mask
;
12131 if (tree_fits_shwi_p (op0
))
12134 unsignedp
= unsignedp1
;
12135 constant
= tree_to_shwi (op0
);
12140 unsignedp
= unsignedp0
;
12141 constant
= tree_to_shwi (op1
);
12144 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
12145 if (bits
< TYPE_PRECISION (result_type
)
12146 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
12148 mask
= HOST_WIDE_INT_M1U
<< bits
;
12149 if ((mask
& constant
) != mask
)
12152 warning_at (location
, OPT_Wsign_compare
,
12153 "promoted ~unsigned is always non-zero");
12155 warning_at (location
, OPT_Wsign_compare
,
12156 "comparison of promoted ~unsigned with constant");
12160 else if (unsignedp0
&& unsignedp1
12161 && (TYPE_PRECISION (TREE_TYPE (op0
))
12162 < TYPE_PRECISION (result_type
))
12163 && (TYPE_PRECISION (TREE_TYPE (op1
))
12164 < TYPE_PRECISION (result_type
)))
12165 warning_at (location
, OPT_Wsign_compare
,
12166 "comparison of promoted ~unsigned with unsigned");
12170 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12171 type via c_common_type. If -Wdouble-promotion is in use, and the
12172 conditions for warning have been met, issue a warning. GMSGID is
12173 the warning message. It must have two %T specifiers for the type
12174 that was converted (generally "float") and the type to which it was
12175 converted (generally "double), respectively. LOC is the location
12176 to which the awrning should refer. */
12179 do_warn_double_promotion (tree result_type
, tree type1
, tree type2
,
12180 const char *gmsgid
, location_t loc
)
12184 if (!warn_double_promotion
)
12186 /* If the conversion will not occur at run-time, there is no need to
12188 if (c_inhibit_evaluation_warnings
)
12190 if (TYPE_MAIN_VARIANT (result_type
) != double_type_node
12191 && TYPE_MAIN_VARIANT (result_type
) != complex_double_type_node
)
12193 if (TYPE_MAIN_VARIANT (type1
) == float_type_node
12194 || TYPE_MAIN_VARIANT (type1
) == complex_float_type_node
)
12195 source_type
= type1
;
12196 else if (TYPE_MAIN_VARIANT (type2
) == float_type_node
12197 || TYPE_MAIN_VARIANT (type2
) == complex_float_type_node
)
12198 source_type
= type2
;
12201 warning_at (loc
, OPT_Wdouble_promotion
, gmsgid
, source_type
, result_type
);
12204 /* Possibly warn about unused parameters. */
12207 do_warn_unused_parameter (tree fn
)
12211 for (decl
= DECL_ARGUMENTS (fn
);
12212 decl
; decl
= DECL_CHAIN (decl
))
12213 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
12214 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
)
12215 && !TREE_NO_WARNING (decl
))
12216 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wunused_parameter
,
12217 "unused parameter %qD", decl
);
12221 /* Setup a TYPE_DECL node as a typedef representation.
12223 X is a TYPE_DECL for a typedef statement. Create a brand new
12224 ..._TYPE node (which will be just a variant of the existing
12225 ..._TYPE node with identical properties) and then install X
12226 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12228 The whole point here is to end up with a situation where each
12229 and every ..._TYPE node the compiler creates will be uniquely
12230 associated with AT MOST one node representing a typedef name.
12231 This way, even though the compiler substitutes corresponding
12232 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12233 early on, later parts of the compiler can always do the reverse
12234 translation and get back the corresponding typedef name. For
12237 typedef struct S MY_TYPE;
12240 Later parts of the compiler might only know that `object' was of
12241 type `struct S' if it were not for code just below. With this
12242 code however, later parts of the compiler see something like:
12244 struct S' == struct S
12245 typedef struct S' MY_TYPE;
12248 And they can then deduce (from the node for type struct S') that
12249 the original object declaration was:
12253 Being able to do this is important for proper support of protoize,
12254 and also for generating precise symbolic debugging information
12255 which takes full account of the programmer's (typedef) vocabulary.
12257 Obviously, we don't want to generate a duplicate ..._TYPE node if
12258 the TYPE_DECL node that we are now processing really represents a
12259 standard built-in type. */
12262 set_underlying_type (tree x
)
12264 if (x
== error_mark_node
)
12266 if (DECL_IS_BUILTIN (x
))
12268 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
12269 TYPE_NAME (TREE_TYPE (x
)) = x
;
12271 else if (TREE_TYPE (x
) != error_mark_node
12272 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
12274 tree tt
= TREE_TYPE (x
);
12275 DECL_ORIGINAL_TYPE (x
) = tt
;
12276 tt
= build_variant_type_copy (tt
);
12277 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
12278 TYPE_NAME (tt
) = x
;
12279 TREE_USED (tt
) = TREE_USED (x
);
12280 TREE_TYPE (x
) = tt
;
12284 /* Record the types used by the current global variable declaration
12285 being parsed, so that we can decide later to emit their debug info.
12286 Those types are in types_used_by_cur_var_decl, and we are going to
12287 store them in the types_used_by_vars_hash hash table.
12288 DECL is the declaration of the global variable that has been parsed. */
12291 record_types_used_by_current_var_decl (tree decl
)
12293 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
12295 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
12297 tree type
= types_used_by_cur_var_decl
->pop ();
12298 types_used_by_var_decl_insert (type
, decl
);
12302 /* If DECL is a typedef that is declared in the current function,
12303 record it for the purpose of -Wunused-local-typedefs. */
12306 record_locally_defined_typedef (tree decl
)
12308 struct c_language_function
*l
;
12310 if (!warn_unused_local_typedefs
12312 /* if this is not a locally defined typedef then we are not
12314 || !is_typedef_decl (decl
)
12315 || !decl_function_context (decl
))
12318 l
= (struct c_language_function
*) cfun
->language
;
12319 vec_safe_push (l
->local_typedefs
, decl
);
12322 /* If T is a TYPE_DECL declared locally, mark it as used. */
12325 maybe_record_typedef_use (tree t
)
12327 if (!is_typedef_decl (t
))
12330 TREE_USED (t
) = true;
12333 /* Warn if there are some unused locally defined typedefs in the
12334 current function. */
12337 maybe_warn_unused_local_typedefs (void)
12341 /* The number of times we have emitted -Wunused-local-typedefs
12342 warnings. If this is different from errorcount, that means some
12343 unrelated errors have been issued. In which case, we'll avoid
12344 emitting "unused-local-typedefs" warnings. */
12345 static int unused_local_typedefs_warn_count
;
12346 struct c_language_function
*l
;
12351 if ((l
= (struct c_language_function
*) cfun
->language
) == NULL
)
12354 if (warn_unused_local_typedefs
12355 && errorcount
== unused_local_typedefs_warn_count
)
12357 FOR_EACH_VEC_SAFE_ELT (l
->local_typedefs
, i
, decl
)
12358 if (!TREE_USED (decl
))
12359 warning_at (DECL_SOURCE_LOCATION (decl
),
12360 OPT_Wunused_local_typedefs
,
12361 "typedef %qD locally defined but not used", decl
);
12362 unused_local_typedefs_warn_count
= errorcount
;
12365 vec_free (l
->local_typedefs
);
12368 /* Warn about boolean expression compared with an integer value different
12369 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12370 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12371 are the operands of the comparison. The caller must ensure that
12372 either operand is a boolean expression. */
12375 maybe_warn_bool_compare (location_t loc
, enum tree_code code
, tree op0
,
12378 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
12382 if (f
= fold_for_warn (op0
),
12383 TREE_CODE (f
) == INTEGER_CST
)
12385 else if (f
= fold_for_warn (op1
),
12386 TREE_CODE (f
) == INTEGER_CST
)
12391 if (!integer_zerop (cst
) && !integer_onep (cst
))
12393 int sign
= (TREE_CODE (op0
) == INTEGER_CST
12394 ? tree_int_cst_sgn (cst
) : -tree_int_cst_sgn (cst
));
12395 if (code
== EQ_EXPR
12396 || ((code
== GT_EXPR
|| code
== GE_EXPR
) && sign
< 0)
12397 || ((code
== LT_EXPR
|| code
== LE_EXPR
) && sign
> 0))
12398 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12399 "with boolean expression is always false", cst
);
12401 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12402 "with boolean expression is always true", cst
);
12404 else if (integer_zerop (cst
) || integer_onep (cst
))
12406 /* If the non-constant operand isn't of a boolean type, we
12407 don't want to warn here. */
12408 tree noncst
= TREE_CODE (op0
) == INTEGER_CST
? op1
: op0
;
12409 /* Handle booleans promoted to integers. */
12410 if (CONVERT_EXPR_P (noncst
)
12411 && TREE_TYPE (noncst
) == integer_type_node
12412 && TREE_CODE (TREE_TYPE (TREE_OPERAND (noncst
, 0))) == BOOLEAN_TYPE
)
12414 else if (TREE_CODE (TREE_TYPE (noncst
)) != BOOLEAN_TYPE
12415 && !truth_value_p (TREE_CODE (noncst
)))
12417 /* Do some magic to get the right diagnostics. */
12418 bool flag
= TREE_CODE (op0
) == INTEGER_CST
;
12419 flag
= integer_zerop (cst
) ? flag
: !flag
;
12420 if ((code
== GE_EXPR
&& !flag
) || (code
== LE_EXPR
&& flag
))
12421 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12422 "with boolean expression is always true", cst
);
12423 else if ((code
== LT_EXPR
&& !flag
) || (code
== GT_EXPR
&& flag
))
12424 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12425 "with boolean expression is always false", cst
);
12429 /* Warn if signed left shift overflows. We don't warn
12430 about left-shifting 1 into the sign bit in C++14; cf.
12431 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12432 LOC is a location of the shift; OP0 and OP1 are the operands.
12433 Return true if an overflow is detected, false otherwise. */
12436 maybe_warn_shift_overflow (location_t loc
, tree op0
, tree op1
)
12438 if (TREE_CODE (op0
) != INTEGER_CST
12439 || TREE_CODE (op1
) != INTEGER_CST
)
12442 tree type0
= TREE_TYPE (op0
);
12443 unsigned int prec0
= TYPE_PRECISION (type0
);
12445 /* Left-hand operand must be signed. */
12446 if (TYPE_UNSIGNED (type0
))
12449 unsigned int min_prec
= (wi::min_precision (op0
, SIGNED
)
12450 + TREE_INT_CST_LOW (op1
));
12451 /* Handle the case of left-shifting 1 into the sign bit.
12452 * However, shifting 1 _out_ of the sign bit, as in
12453 * INT_MIN << 1, is considered an overflow.
12455 if (!tree_int_cst_sign_bit(op0
) && min_prec
== prec0
+ 1)
12457 /* Never warn for C++14 onwards. */
12458 if (cxx_dialect
>= cxx14
)
12460 /* Otherwise only if -Wshift-overflow=2. But return
12461 true to signal an overflow for the sake of integer
12462 constant expressions. */
12463 if (warn_shift_overflow
< 2)
12467 bool overflowed
= min_prec
> prec0
;
12468 if (overflowed
&& c_inhibit_evaluation_warnings
== 0)
12469 warning_at (loc
, OPT_Wshift_overflow_
,
12470 "result of %qE requires %u bits to represent, "
12471 "but %qT only has %u bits",
12472 build2_loc (loc
, LSHIFT_EXPR
, type0
, op0
, op1
),
12473 min_prec
, type0
, prec0
);
12478 /* The C and C++ parsers both use vectors to hold function arguments.
12479 For efficiency, we keep a cache of unused vectors. This is the
12482 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
12483 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
12485 /* Return a new vector from the cache. If the cache is empty,
12486 allocate a new vector. These vectors are GC'ed, so it is OK if the
12487 pointer is not released.. */
12490 make_tree_vector (void)
12492 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
12493 return tree_vector_cache
->pop ();
12496 /* Passing 0 to vec::alloc returns NULL, and our callers require
12497 that we always return a non-NULL value. The vector code uses
12498 4 when growing a NULL vector, so we do too. */
12499 vec
<tree
, va_gc
> *v
;
12505 /* Release a vector of trees back to the cache. */
12508 release_tree_vector (vec
<tree
, va_gc
> *vec
)
12513 vec_safe_push (tree_vector_cache
, vec
);
12517 /* Get a new tree vector holding a single tree. */
12520 make_tree_vector_single (tree t
)
12522 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12523 ret
->quick_push (t
);
12527 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12530 make_tree_vector_from_list (tree list
)
12532 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12533 for (; list
; list
= TREE_CHAIN (list
))
12534 vec_safe_push (ret
, TREE_VALUE (list
));
12538 /* Get a new tree vector which is a copy of an existing one. */
12541 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
12543 vec
<tree
, va_gc
> *ret
;
12547 ret
= make_tree_vector ();
12548 vec_safe_reserve (ret
, vec_safe_length (orig
));
12549 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
12550 ret
->quick_push (t
);
12554 /* Return true if KEYWORD starts a type specifier. */
12557 keyword_begins_type_specifier (enum rid keyword
)
12561 case RID_AUTO_TYPE
:
12571 CASE_RID_FLOATN_NX
:
12574 case RID_DFLOAT128
:
12590 if (keyword
>= RID_FIRST_INT_N
12591 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
12592 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
12598 /* Return true if KEYWORD names a type qualifier. */
12601 keyword_is_type_qualifier (enum rid keyword
)
12615 /* Return true if KEYWORD names a storage class specifier.
12617 RID_TYPEDEF is not included in this list despite `typedef' being
12618 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12619 such for syntactic convenience only. */
12622 keyword_is_storage_class_specifier (enum rid keyword
)
12638 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12641 keyword_is_function_specifier (enum rid keyword
)
12655 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12656 declaration-specifier (C99 6.7). */
12659 keyword_is_decl_specifier (enum rid keyword
)
12661 if (keyword_is_storage_class_specifier (keyword
)
12662 || keyword_is_type_qualifier (keyword
)
12663 || keyword_is_function_specifier (keyword
))
12670 case RID_CONSTEXPR
:
12677 /* Initialize language-specific-bits of tree_contains_struct. */
12680 c_common_init_ts (void)
12682 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
12683 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
12684 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
12687 /* Build a user-defined numeric literal out of an integer constant type VALUE
12688 with identifier SUFFIX. */
12691 build_userdef_literal (tree suffix_id
, tree value
,
12692 enum overflow_type overflow
, tree num_string
)
12694 tree literal
= make_node (USERDEF_LITERAL
);
12695 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
12696 USERDEF_LITERAL_VALUE (literal
) = value
;
12697 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
12698 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
12702 /* For vector[index], convert the vector to an array of the underlying type.
12703 Return true if the resulting ARRAY_REF should not be an lvalue. */
12706 convert_vector_to_array_for_subscript (location_t loc
,
12707 tree
*vecp
, tree index
)
12710 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
12712 tree type
= TREE_TYPE (*vecp
);
12714 ret
= !lvalue_p (*vecp
);
12716 if (TREE_CODE (index
) == INTEGER_CST
)
12717 if (!tree_fits_uhwi_p (index
)
12718 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
12719 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
12721 /* We are building an ARRAY_REF so mark the vector as addressable
12722 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12723 for function parameters. */
12724 c_common_mark_addressable_vec (*vecp
);
12726 *vecp
= build1 (VIEW_CONVERT_EXPR
,
12727 build_array_type_nelts (TREE_TYPE (type
),
12728 TYPE_VECTOR_SUBPARTS (type
)),
12734 /* Determine which of the operands, if any, is a scalar that needs to be
12735 converted to a vector, for the range of operations. */
12737 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
12740 tree type0
= TREE_TYPE (op0
);
12741 tree type1
= TREE_TYPE (op1
);
12742 bool integer_only_op
= false;
12743 enum stv_conv ret
= stv_firstarg
;
12745 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
12748 /* Most GENERIC binary expressions require homogeneous arguments.
12749 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12750 argument that is a vector and a second one that is a scalar, so
12751 we never return stv_secondarg for them. */
12754 if (TREE_CODE (type0
) == INTEGER_TYPE
12755 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12757 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12760 error_at (loc
, "conversion of scalar %qT to vector %qT "
12761 "involves truncation", type0
, type1
);
12765 return stv_firstarg
;
12772 integer_only_op
= true;
12775 case VEC_COND_EXPR
:
12780 case TRUNC_DIV_EXPR
:
12781 case CEIL_DIV_EXPR
:
12782 case FLOOR_DIV_EXPR
:
12783 case ROUND_DIV_EXPR
:
12784 case EXACT_DIV_EXPR
:
12785 case TRUNC_MOD_EXPR
:
12786 case FLOOR_MOD_EXPR
:
12794 /* What about UNLT_EXPR? */
12795 if (VECTOR_TYPE_P (type0
))
12797 ret
= stv_secondarg
;
12798 std::swap (type0
, type1
);
12799 std::swap (op0
, op1
);
12802 if (TREE_CODE (type0
) == INTEGER_TYPE
12803 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12805 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12808 error_at (loc
, "conversion of scalar %qT to vector %qT "
12809 "involves truncation", type0
, type1
);
12814 else if (!integer_only_op
12815 /* Allow integer --> real conversion if safe. */
12816 && (TREE_CODE (type0
) == REAL_TYPE
12817 || TREE_CODE (type0
) == INTEGER_TYPE
)
12818 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
12820 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12823 error_at (loc
, "conversion of scalar %qT to vector %qT "
12824 "involves truncation", type0
, type1
);
12833 return stv_nothing
;
12836 /* Return true iff ALIGN is an integral constant that is a fundamental
12837 alignment, as defined by [basic.align] in the c++-11
12842 [A fundamental alignment is represented by an alignment less than or
12843 equal to the greatest alignment supported by the implementation
12844 in all contexts, which is equal to
12845 alignof(max_align_t)]. */
12848 cxx_fundamental_alignment_p (unsigned align
)
12850 return (align
<= MAX (TYPE_ALIGN (long_long_integer_type_node
),
12851 TYPE_ALIGN (long_double_type_node
)));
12854 /* Return true if T is a pointer to a zero-sized aggregate. */
12857 pointer_to_zero_sized_aggr_p (tree t
)
12859 if (!POINTER_TYPE_P (t
))
12862 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
12865 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12866 with no library fallback or for an ADDR_EXPR whose operand is such type
12867 issues an error pointing to the location LOC.
12868 Returns true when the expression has been diagnosed and false
12871 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
12873 if (TREE_CODE (expr
) == ADDR_EXPR
)
12874 expr
= TREE_OPERAND (expr
, 0);
12876 if (TREE_TYPE (expr
)
12877 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
12878 && TREE_CODE (expr
) == FUNCTION_DECL
12879 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12880 false positives for user-declared built-ins such as abs or
12881 strlen, and for C++ operators new and delete.
12882 The c_decl_implicit() test avoids false positives for implicitly
12883 declared built-ins with library fallbacks (such as abs). */
12884 && DECL_BUILT_IN (expr
)
12885 && DECL_IS_BUILTIN (expr
)
12886 && !c_decl_implicit (expr
)
12887 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
12889 if (loc
== UNKNOWN_LOCATION
)
12890 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
12892 /* Reject arguments that are built-in functions with
12893 no library fallback. */
12894 error_at (loc
, "built-in function %qE must be directly called", expr
);
12902 /* If we're creating an if-else-if condition chain, first see if we
12903 already have this COND in the CHAIN. If so, warn and don't add COND
12904 into the vector, otherwise add the COND there. LOC is the location
12908 warn_duplicated_cond_add_or_warn (location_t loc
, tree cond
, vec
<tree
> **chain
)
12910 /* No chain has been created yet. Do nothing. */
12911 if (*chain
== NULL
)
12914 if (TREE_SIDE_EFFECTS (cond
))
12916 /* Uh-oh! This condition has a side-effect, thus invalidates
12917 the whole chain. */
12925 bool found
= false;
12926 FOR_EACH_VEC_ELT (**chain
, ix
, t
)
12927 if (operand_equal_p (cond
, t
, 0))
12929 if (warning_at (loc
, OPT_Wduplicated_cond
,
12930 "duplicated %<if%> condition"))
12931 inform (EXPR_LOCATION (t
), "previously used here");
12937 && !CONSTANT_CLASS_P (cond
)
12938 /* Don't infinitely grow the chain. */
12939 && (*chain
)->length () < 512)
12940 (*chain
)->safe_push (cond
);
12943 /* Check if array size calculations overflow or if the array covers more
12944 than half of the address space. Return true if the size of the array
12945 is valid, false otherwise. TYPE is the type of the array and NAME is
12946 the name of the array, or NULL_TREE for unnamed arrays. */
12949 valid_array_size_p (location_t loc
, tree type
, tree name
)
12951 if (type
!= error_mark_node
12952 && COMPLETE_TYPE_P (type
)
12953 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
12954 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
12957 error_at (loc
, "size of array %qE is too large", name
);
12959 error_at (loc
, "size of unnamed array is too large");
12965 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
12966 timestamp to replace embedded current dates to get reproducible
12967 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
12970 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
12972 char *source_date_epoch
;
12976 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
12977 if (!source_date_epoch
)
12978 return (time_t) -1;
12981 #if defined(INT64_T_IS_LONG)
12982 epoch
= strtol (source_date_epoch
, &endptr
, 10);
12984 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
12986 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
12987 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
12989 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
12990 "expand to a non-negative integer less than or equal to %wd",
12991 MAX_SOURCE_DATE_EPOCH
);
12992 return (time_t) -1;
12995 return (time_t) epoch
;
12998 /* Callback for libcpp for offering spelling suggestions for misspelled
12999 directives. GOAL is an unrecognized string; CANDIDATES is a
13000 NULL-terminated array of candidate strings. Return the closest
13001 match to GOAL within CANDIDATES, or NULL if none are good
13005 cb_get_suggestion (cpp_reader
*, const char *goal
,
13006 const char *const *candidates
)
13008 best_match
<const char *, const char *> bm (goal
);
13009 while (*candidates
)
13010 bm
.consider (*candidates
++);
13011 return bm
.get_best_meaningful_candidate ();
13014 /* Check and possibly warn if two declarations have contradictory
13015 attributes, such as always_inline vs. noinline. */
13018 diagnose_mismatched_attributes (tree olddecl
, tree newdecl
)
13020 bool warned
= false;
13022 tree a1
= lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl
));
13023 tree a2
= lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl
));
13024 /* An optimization attribute applied on a declaration after the
13025 definition is likely not what the user wanted. */
13026 if (a2
!= NULL_TREE
13027 && DECL_SAVED_TREE (olddecl
) != NULL_TREE
13028 && (a1
== NULL_TREE
|| !attribute_list_equal (a1
, a2
)))
13029 warned
|= warning (OPT_Wattributes
,
13030 "optimization attribute on %qD follows "
13031 "definition but the attribute doesn%'t match",
13034 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
13035 if (DECL_DECLARED_INLINE_P (newdecl
)
13036 && DECL_UNINLINABLE (olddecl
)
13037 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13038 warned
|= warning (OPT_Wattributes
, "inline declaration of %qD follows "
13039 "declaration with attribute noinline", newdecl
);
13040 else if (DECL_DECLARED_INLINE_P (olddecl
)
13041 && DECL_UNINLINABLE (newdecl
)
13042 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
13043 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13044 "noinline follows inline declaration ", newdecl
);
13045 else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
))
13046 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl
)))
13047 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13048 "%qs follows declaration with attribute %qs",
13049 newdecl
, "noinline", "always_inline");
13050 else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl
))
13051 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13052 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13053 "%qs follows declaration with attribute %qs",
13054 newdecl
, "always_inline", "noinline");
13055 else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl
))
13056 && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl
)))
13057 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13058 "%qs follows declaration with attribute %qs",
13059 newdecl
, "cold", "hot");
13060 else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl
))
13061 && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl
)))
13062 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13063 "%qs follows declaration with attribute %qs",
13064 newdecl
, "hot", "cold");
13068 #include "gt-c-family-c-common.h"