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
) == POINTER_TYPE
)
1126 string_type
= TREE_TYPE (string_type
);
1128 if (TREE_CODE (string_type
) != ARRAY_TYPE
)
1131 tree element_type
= TREE_TYPE (string_type
);
1132 if (TREE_CODE (element_type
) != INTEGER_TYPE
)
1135 int bits_per_character
= TYPE_PRECISION (element_type
);
1136 switch (bits_per_character
)
1139 return CPP_STRING
; /* It could have also been CPP_UTF8STRING. */
1141 return CPP_STRING16
;
1143 return CPP_STRING32
;
1149 /* The global record of string concatentations, for use in
1150 extracting locations within string literals. */
1152 GTY(()) string_concat_db
*g_string_concat_db
;
1154 /* Implementation of LANG_HOOKS_GET_SUBSTRING_LOCATION. */
1157 c_get_substring_location (const substring_loc
&substr_loc
,
1158 location_t
*out_loc
)
1160 enum cpp_ttype tok_type
1161 = get_cpp_ttype_from_string_type (substr_loc
.get_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 substr_loc
.get_fmt_string_loc (),
1168 substr_loc
.get_caret_idx (),
1169 substr_loc
.get_start_idx (),
1170 substr_loc
.get_end_idx (),
1175 /* Fold X for consideration by one of the warning functions when checking
1176 whether an expression has a constant value. */
1179 fold_for_warn (tree x
)
1181 if (c_dialect_cxx ())
1182 return c_fully_fold (x
, /*for_init*/false, /*maybe_constp*/NULL
);
1184 /* The C front-end has already folded X appropriately. */
1188 /* Print a warning if a constant expression had overflow in folding.
1189 Invoke this function on every expression that the language
1190 requires to be a constant expression.
1191 Note the ANSI C standard says it is erroneous for a
1192 constant expression to overflow. */
1195 constant_expression_warning (tree value
)
1197 if (warn_overflow
&& pedantic
1198 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1199 || TREE_CODE (value
) == FIXED_CST
1200 || TREE_CODE (value
) == VECTOR_CST
1201 || TREE_CODE (value
) == COMPLEX_CST
)
1202 && TREE_OVERFLOW (value
))
1203 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1206 /* The same as above but print an unconditional error. */
1208 constant_expression_error (tree value
)
1210 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1211 || TREE_CODE (value
) == FIXED_CST
1212 || TREE_CODE (value
) == VECTOR_CST
1213 || TREE_CODE (value
) == COMPLEX_CST
)
1214 && TREE_OVERFLOW (value
))
1215 error ("overflow in constant expression");
1218 /* Print a warning if an expression had overflow in folding and its
1221 Invoke this function on every expression that
1222 (1) appears in the source code, and
1223 (2) is a constant expression that overflowed, and
1224 (3) is not already checked by convert_and_check;
1225 however, do not invoke this function on operands of explicit casts
1226 or when the expression is the result of an operator and any operand
1227 already overflowed. */
1230 overflow_warning (location_t loc
, tree value
)
1232 if (c_inhibit_evaluation_warnings
!= 0)
1235 switch (TREE_CODE (value
))
1238 warning_at (loc
, OPT_Woverflow
, "integer overflow in expression");
1242 warning_at (loc
, OPT_Woverflow
,
1243 "floating point overflow in expression");
1247 warning_at (loc
, OPT_Woverflow
, "fixed-point overflow in expression");
1251 warning_at (loc
, OPT_Woverflow
, "vector overflow in expression");
1255 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1256 warning_at (loc
, OPT_Woverflow
,
1257 "complex integer overflow in expression");
1258 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1259 warning_at (loc
, OPT_Woverflow
,
1260 "complex floating point overflow in expression");
1268 /* Warn about uses of logical || / && operator in a context where it
1269 is likely that the bitwise equivalent was intended by the
1270 programmer. We have seen an expression in which CODE is a binary
1271 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1272 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1274 warn_logical_operator (location_t location
, enum tree_code code
, tree type
,
1275 enum tree_code code_left
, tree op_left
,
1276 enum tree_code
ARG_UNUSED (code_right
), tree op_right
)
1278 int or_op
= (code
== TRUTH_ORIF_EXPR
|| code
== TRUTH_OR_EXPR
);
1279 int in0_p
, in1_p
, in_p
;
1280 tree low0
, low1
, low
, high0
, high1
, high
, lhs
, rhs
, tem
;
1281 bool strict_overflow_p
= false;
1283 if (code
!= TRUTH_ANDIF_EXPR
1284 && code
!= TRUTH_AND_EXPR
1285 && code
!= TRUTH_ORIF_EXPR
1286 && code
!= TRUTH_OR_EXPR
)
1289 /* We don't want to warn if either operand comes from a macro
1290 expansion. ??? This doesn't work with e.g. NEGATE_EXPR yet;
1292 if (from_macro_expansion_at (EXPR_LOCATION (op_left
))
1293 || from_macro_expansion_at (EXPR_LOCATION (op_right
)))
1296 /* Warn if &&/|| are being used in a context where it is
1297 likely that the bitwise equivalent was intended by the
1298 programmer. That is, an expression such as op && MASK
1299 where op should not be any boolean expression, nor a
1300 constant, and mask seems to be a non-boolean integer constant. */
1301 if (TREE_CODE (op_right
) == CONST_DECL
)
1302 /* An enumerator counts as a constant. */
1303 op_right
= DECL_INITIAL (op_right
);
1304 if (!truth_value_p (code_left
)
1305 && INTEGRAL_TYPE_P (TREE_TYPE (op_left
))
1306 && !CONSTANT_CLASS_P (op_left
)
1307 && !TREE_NO_WARNING (op_left
)
1308 && TREE_CODE (op_right
) == INTEGER_CST
1309 && !integer_zerop (op_right
)
1310 && !integer_onep (op_right
))
1313 warning_at (location
, OPT_Wlogical_op
, "logical %<or%>"
1314 " applied to non-boolean constant");
1316 warning_at (location
, OPT_Wlogical_op
, "logical %<and%>"
1317 " applied to non-boolean constant");
1318 TREE_NO_WARNING (op_left
) = true;
1322 /* We do not warn for constants because they are typical of macro
1323 expansions that test for features. */
1324 if (CONSTANT_CLASS_P (fold_for_warn (op_left
))
1325 || CONSTANT_CLASS_P (fold_for_warn (op_right
)))
1328 /* This warning only makes sense with logical operands. */
1329 if (!(truth_value_p (TREE_CODE (op_left
))
1330 || INTEGRAL_TYPE_P (TREE_TYPE (op_left
)))
1331 || !(truth_value_p (TREE_CODE (op_right
))
1332 || INTEGRAL_TYPE_P (TREE_TYPE (op_right
))))
1335 /* The range computations only work with scalars. */
1336 if (VECTOR_TYPE_P (TREE_TYPE (op_left
))
1337 || VECTOR_TYPE_P (TREE_TYPE (op_right
)))
1340 /* We first test whether either side separately is trivially true
1341 (with OR) or trivially false (with AND). If so, do not warn.
1342 This is a common idiom for testing ranges of data types in
1344 lhs
= make_range (op_left
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
1347 if (TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
1348 lhs
= C_MAYBE_CONST_EXPR_EXPR (lhs
);
1350 /* If this is an OR operation, invert both sides; now, the result
1351 should be always false to get a warning. */
1355 tem
= build_range_check (UNKNOWN_LOCATION
, type
, lhs
, in0_p
, low0
, high0
);
1356 if (tem
&& integer_zerop (tem
))
1359 rhs
= make_range (op_right
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
1362 if (TREE_CODE (rhs
) == C_MAYBE_CONST_EXPR
)
1363 rhs
= C_MAYBE_CONST_EXPR_EXPR (rhs
);
1365 /* If this is an OR operation, invert both sides; now, the result
1366 should be always false to get a warning. */
1370 tem
= build_range_check (UNKNOWN_LOCATION
, type
, rhs
, in1_p
, low1
, high1
);
1371 if (tem
&& integer_zerop (tem
))
1374 /* If both expressions have the same operand, if we can merge the
1376 if (operand_equal_p (lhs
, rhs
, 0)
1377 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
1378 in1_p
, low1
, high1
))
1380 tem
= build_range_check (UNKNOWN_LOCATION
, type
, lhs
, in_p
, low
, high
);
1381 /* ... and if the range test is always false, then warn. */
1382 if (tem
&& integer_zerop (tem
))
1385 warning_at (location
, OPT_Wlogical_op
,
1386 "logical %<or%> of collectively exhaustive tests is "
1389 warning_at (location
, OPT_Wlogical_op
,
1390 "logical %<and%> of mutually exclusive tests is "
1393 /* Or warn if the operands have exactly the same range, e.g.
1395 else if (tree_int_cst_equal (low0
, low1
)
1396 && tree_int_cst_equal (high0
, high1
))
1399 warning_at (location
, OPT_Wlogical_op
,
1400 "logical %<or%> of equal expressions");
1402 warning_at (location
, OPT_Wlogical_op
,
1403 "logical %<and%> of equal expressions");
1408 /* Helper function for warn_tautological_cmp. Look for ARRAY_REFs
1409 with constant indices. */
1412 find_array_ref_with_const_idx_r (tree
*expr_p
, int *walk_subtrees
, void *data
)
1414 tree expr
= *expr_p
;
1416 if ((TREE_CODE (expr
) == ARRAY_REF
1417 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
1418 && TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
)
1420 *(bool *) data
= true;
1427 /* Warn if a self-comparison always evaluates to true or false. LOC
1428 is the location of the comparison with code CODE, LHS and RHS are
1429 operands of the comparison. */
1432 warn_tautological_cmp (location_t loc
, enum tree_code code
, tree lhs
, tree rhs
)
1434 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
1437 /* Don't warn for various macro expansions. */
1438 if (from_macro_expansion_at (loc
)
1439 || from_macro_expansion_at (EXPR_LOCATION (lhs
))
1440 || from_macro_expansion_at (EXPR_LOCATION (rhs
)))
1443 /* We do not warn for constants because they are typical of macro
1444 expansions that test for features, sizeof, and similar. */
1445 if (CONSTANT_CLASS_P (fold_for_warn (lhs
))
1446 || CONSTANT_CLASS_P (fold_for_warn (rhs
)))
1449 /* Don't warn for e.g.
1452 if (n == (long) n) ...
1454 if ((CONVERT_EXPR_P (lhs
) || TREE_CODE (lhs
) == NON_LVALUE_EXPR
)
1455 || (CONVERT_EXPR_P (rhs
) || TREE_CODE (rhs
) == NON_LVALUE_EXPR
))
1458 /* Don't warn if either LHS or RHS has an IEEE floating-point type.
1459 It could be a NaN, and NaN never compares equal to anything, even
1461 if (FLOAT_TYPE_P (TREE_TYPE (lhs
)) || FLOAT_TYPE_P (TREE_TYPE (rhs
)))
1464 if (operand_equal_p (lhs
, rhs
, 0))
1466 /* Don't warn about array references with constant indices;
1467 these are likely to come from a macro. */
1469 walk_tree_without_duplicates (&lhs
, find_array_ref_with_const_idx_r
,
1473 const bool always_true
= (code
== EQ_EXPR
|| code
== LE_EXPR
1474 || code
== GE_EXPR
|| code
== UNLE_EXPR
1475 || code
== UNGE_EXPR
|| code
== UNEQ_EXPR
);
1477 warning_at (loc
, OPT_Wtautological_compare
,
1478 "self-comparison always evaluates to true");
1480 warning_at (loc
, OPT_Wtautological_compare
,
1481 "self-comparison always evaluates to false");
1485 /* Return true iff T is a boolean promoted to int. */
1488 bool_promoted_to_int_p (tree t
)
1490 return (CONVERT_EXPR_P (t
)
1491 && TREE_TYPE (t
) == integer_type_node
1492 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == BOOLEAN_TYPE
);
1495 /* Return true iff EXPR only contains boolean operands, or comparisons. */
1498 expr_has_boolean_operands_p (tree expr
)
1502 if (CONVERT_EXPR_P (expr
))
1503 return bool_promoted_to_int_p (expr
);
1504 else if (UNARY_CLASS_P (expr
))
1505 return expr_has_boolean_operands_p (TREE_OPERAND (expr
, 0));
1506 else if (BINARY_CLASS_P (expr
))
1507 return (expr_has_boolean_operands_p (TREE_OPERAND (expr
, 0))
1508 && expr_has_boolean_operands_p (TREE_OPERAND (expr
, 1)));
1509 else if (COMPARISON_CLASS_P (expr
))
1515 /* Warn about logical not used on the left hand side operand of a comparison.
1516 This function assumes that the LHS is inside of TRUTH_NOT_EXPR.
1517 Do not warn if RHS is of a boolean type, a logical operator, or
1521 warn_logical_not_parentheses (location_t location
, enum tree_code code
,
1524 if (TREE_CODE_CLASS (code
) != tcc_comparison
1525 || TREE_TYPE (rhs
) == NULL_TREE
1526 || TREE_CODE (TREE_TYPE (rhs
)) == BOOLEAN_TYPE
1527 || truth_value_p (TREE_CODE (rhs
)))
1530 /* Don't warn for expression like !x == ~(bool1 | bool2). */
1531 if (expr_has_boolean_operands_p (rhs
))
1534 /* Don't warn for !x == 0 or !y != 0, those are equivalent to
1535 !(x == 0) or !(y != 0). */
1536 if ((code
== EQ_EXPR
|| code
== NE_EXPR
)
1537 && integer_zerop (rhs
))
1540 if (warning_at (location
, OPT_Wlogical_not_parentheses
,
1541 "logical not is only applied to the left hand side of "
1543 && EXPR_HAS_LOCATION (lhs
))
1545 location_t lhs_loc
= EXPR_LOCATION (lhs
);
1546 rich_location
richloc (line_table
, lhs_loc
);
1547 richloc
.add_fixit_insert (lhs_loc
, "(");
1548 location_t finish
= get_finish (lhs_loc
);
1550 = linemap_position_for_loc_and_offset (line_table
, finish
, 1);
1551 richloc
.add_fixit_insert (next_loc
, ")");
1552 inform_at_rich_loc (&richloc
, "add parentheses around left hand side "
1553 "expression to silence this warning");
1557 /* Warn if EXP contains any computations whose results are not used.
1558 Return true if a warning is printed; false otherwise. LOCUS is the
1559 (potential) location of the expression. */
1562 warn_if_unused_value (const_tree exp
, location_t locus
)
1565 if (TREE_USED (exp
) || TREE_NO_WARNING (exp
))
1568 /* Don't warn about void constructs. This includes casting to void,
1569 void function calls, and statement expressions with a final cast
1571 if (VOID_TYPE_P (TREE_TYPE (exp
)))
1574 if (EXPR_HAS_LOCATION (exp
))
1575 locus
= EXPR_LOCATION (exp
);
1577 switch (TREE_CODE (exp
))
1579 case PREINCREMENT_EXPR
:
1580 case POSTINCREMENT_EXPR
:
1581 case PREDECREMENT_EXPR
:
1582 case POSTDECREMENT_EXPR
:
1587 case TRY_CATCH_EXPR
:
1588 case WITH_CLEANUP_EXPR
:
1594 /* For a binding, warn if no side effect within it. */
1595 exp
= BIND_EXPR_BODY (exp
);
1599 case NON_LVALUE_EXPR
:
1601 exp
= TREE_OPERAND (exp
, 0);
1604 case TRUTH_ORIF_EXPR
:
1605 case TRUTH_ANDIF_EXPR
:
1606 /* In && or ||, warn if 2nd operand has no side effect. */
1607 exp
= TREE_OPERAND (exp
, 1);
1611 if (warn_if_unused_value (TREE_OPERAND (exp
, 0), locus
))
1613 /* Let people do `(foo (), 0)' without a warning. */
1614 if (TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
1616 exp
= TREE_OPERAND (exp
, 1);
1620 /* If this is an expression with side effects, don't warn; this
1621 case commonly appears in macro expansions. */
1622 if (TREE_SIDE_EFFECTS (exp
))
1627 /* Don't warn about automatic dereferencing of references, since
1628 the user cannot control it. */
1629 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
1631 exp
= TREE_OPERAND (exp
, 0);
1637 /* Referencing a volatile value is a side effect, so don't warn. */
1638 if ((DECL_P (exp
) || REFERENCE_CLASS_P (exp
))
1639 && TREE_THIS_VOLATILE (exp
))
1642 /* If this is an expression which has no operands, there is no value
1643 to be unused. There are no such language-independent codes,
1644 but front ends may define such. */
1645 if (EXPRESSION_CLASS_P (exp
) && TREE_OPERAND_LENGTH (exp
) == 0)
1649 return warning_at (locus
, OPT_Wunused_value
, "value computed is not used");
1654 /* Print a warning about casts that might indicate violation
1655 of strict aliasing rules if -Wstrict-aliasing is used and
1656 strict aliasing mode is in effect. OTYPE is the original
1657 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1660 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1662 /* Strip pointer conversion chains and get to the correct original type. */
1664 otype
= TREE_TYPE (expr
);
1666 if (!(flag_strict_aliasing
1667 && POINTER_TYPE_P (type
)
1668 && POINTER_TYPE_P (otype
)
1669 && !VOID_TYPE_P (TREE_TYPE (type
)))
1670 /* If the type we are casting to is a ref-all pointer
1671 dereferencing it is always valid. */
1672 || TYPE_REF_CAN_ALIAS_ALL (type
))
1675 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1676 && (DECL_P (TREE_OPERAND (expr
, 0))
1677 || handled_component_p (TREE_OPERAND (expr
, 0))))
1679 /* Casting the address of an object to non void pointer. Warn
1680 if the cast breaks type based aliasing. */
1681 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1683 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1684 "might break strict-aliasing rules");
1689 /* warn_strict_aliasing >= 3. This includes the default (3).
1690 Only warn if the cast is dereferenced immediately. */
1691 alias_set_type set1
=
1692 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1693 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1695 if (set1
!= set2
&& set2
!= 0
1697 || (!alias_set_subset_of (set2
, set1
)
1698 && !alias_sets_conflict_p (set1
, set2
))))
1700 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1701 "pointer will break strict-aliasing rules");
1704 else if (warn_strict_aliasing
== 2
1705 && !alias_sets_must_conflict_p (set1
, set2
))
1707 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1708 "pointer might break strict-aliasing rules");
1714 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1716 /* At this level, warn for any conversions, even if an address is
1717 not taken in the same statement. This will likely produce many
1718 false positives, but could be useful to pinpoint problems that
1719 are not revealed at higher levels. */
1720 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1721 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1722 if (!COMPLETE_TYPE_P (type
)
1723 || !alias_sets_must_conflict_p (set1
, set2
))
1725 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1726 "pointer might break strict-aliasing rules");
1734 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1735 sizeof as last operand of certain builtins. */
1738 sizeof_pointer_memaccess_warning (location_t
*sizeof_arg_loc
, tree callee
,
1739 vec
<tree
, va_gc
> *params
, tree
*sizeof_arg
,
1740 bool (*comp_types
) (tree
, tree
))
1742 tree type
, dest
= NULL_TREE
, src
= NULL_TREE
, tem
;
1743 bool strop
= false, cmp
= false;
1744 unsigned int idx
= ~0;
1747 if (TREE_CODE (callee
) != FUNCTION_DECL
1748 || DECL_BUILT_IN_CLASS (callee
) != BUILT_IN_NORMAL
1749 || vec_safe_length (params
) <= 1)
1752 switch (DECL_FUNCTION_CODE (callee
))
1754 case BUILT_IN_STRNCMP
:
1755 case BUILT_IN_STRNCASECMP
:
1758 case BUILT_IN_STRNCPY
:
1759 case BUILT_IN_STRNCPY_CHK
:
1760 case BUILT_IN_STRNCAT
:
1761 case BUILT_IN_STRNCAT_CHK
:
1762 case BUILT_IN_STPNCPY
:
1763 case BUILT_IN_STPNCPY_CHK
:
1766 case BUILT_IN_MEMCPY
:
1767 case BUILT_IN_MEMCPY_CHK
:
1768 case BUILT_IN_MEMMOVE
:
1769 case BUILT_IN_MEMMOVE_CHK
:
1770 if (params
->length () < 3)
1773 dest
= (*params
)[0];
1776 case BUILT_IN_BCOPY
:
1777 if (params
->length () < 3)
1780 dest
= (*params
)[1];
1783 case BUILT_IN_MEMCMP
:
1785 if (params
->length () < 3)
1788 dest
= (*params
)[0];
1792 case BUILT_IN_MEMSET
:
1793 case BUILT_IN_MEMSET_CHK
:
1794 if (params
->length () < 3)
1796 dest
= (*params
)[0];
1799 case BUILT_IN_BZERO
:
1800 dest
= (*params
)[0];
1803 case BUILT_IN_STRNDUP
:
1808 case BUILT_IN_MEMCHR
:
1809 if (params
->length () < 3)
1814 case BUILT_IN_SNPRINTF
:
1815 case BUILT_IN_SNPRINTF_CHK
:
1816 case BUILT_IN_VSNPRINTF
:
1817 case BUILT_IN_VSNPRINTF_CHK
:
1818 dest
= (*params
)[0];
1829 if (sizeof_arg
[idx
] == NULL
|| sizeof_arg
[idx
] == error_mark_node
)
1832 type
= TYPE_P (sizeof_arg
[idx
])
1833 ? sizeof_arg
[idx
] : TREE_TYPE (sizeof_arg
[idx
]);
1834 if (!POINTER_TYPE_P (type
))
1838 && (tem
= tree_strip_nop_conversions (dest
))
1839 && POINTER_TYPE_P (TREE_TYPE (tem
))
1840 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1844 && (tem
= tree_strip_nop_conversions (src
))
1845 && POINTER_TYPE_P (TREE_TYPE (tem
))
1846 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1849 loc
= sizeof_arg_loc
[idx
];
1853 if (!TYPE_P (sizeof_arg
[idx
])
1854 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1855 && comp_types (TREE_TYPE (dest
), type
))
1857 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1858 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1859 "argument to %<sizeof%> in %qD call is the same "
1860 "expression as the destination; did you mean to "
1861 "remove the addressof?", callee
);
1862 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1863 == TYPE_PRECISION (char_type_node
))
1865 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1866 "argument to %<sizeof%> in %qD call is the same "
1867 "expression as the destination; did you mean to "
1868 "provide an explicit length?", callee
);
1870 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1871 "argument to %<sizeof%> in %qD call is the same "
1872 "expression as the destination; did you mean to "
1873 "dereference it?", callee
);
1877 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1879 && comp_types (TREE_TYPE (dest
), type
)
1880 && !VOID_TYPE_P (TREE_TYPE (type
)))
1882 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1883 "argument to %<sizeof%> in %qD call is the same "
1884 "pointer type %qT as the destination; expected %qT "
1885 "or an explicit length", callee
, TREE_TYPE (dest
),
1886 TREE_TYPE (TREE_TYPE (dest
)));
1893 if (!TYPE_P (sizeof_arg
[idx
])
1894 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1895 && comp_types (TREE_TYPE (src
), type
))
1897 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1898 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1899 "argument to %<sizeof%> in %qD call is the same "
1900 "expression as the source; did you mean to "
1901 "remove the addressof?", callee
);
1902 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1903 == TYPE_PRECISION (char_type_node
))
1905 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1906 "argument to %<sizeof%> in %qD call is the same "
1907 "expression as the source; did you mean to "
1908 "provide an explicit length?", callee
);
1910 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1911 "argument to %<sizeof%> in %qD call is the same "
1912 "expression as the source; did you mean to "
1913 "dereference it?", callee
);
1917 if (POINTER_TYPE_P (TREE_TYPE (src
))
1919 && comp_types (TREE_TYPE (src
), type
)
1920 && !VOID_TYPE_P (TREE_TYPE (type
)))
1922 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1923 "argument to %<sizeof%> in %qD call is the same "
1924 "pointer type %qT as the source; expected %qT "
1925 "or an explicit length", callee
, TREE_TYPE (src
),
1926 TREE_TYPE (TREE_TYPE (src
)));
1933 if (!TYPE_P (sizeof_arg
[idx
])
1934 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1935 && comp_types (TREE_TYPE (dest
), type
))
1937 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1938 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1939 "argument to %<sizeof%> in %qD call is the same "
1940 "expression as the first source; did you mean to "
1941 "remove the addressof?", callee
);
1942 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1943 == TYPE_PRECISION (char_type_node
))
1945 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1946 "argument to %<sizeof%> in %qD call is the same "
1947 "expression as the first source; did you mean to "
1948 "provide an explicit length?", callee
);
1950 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1951 "argument to %<sizeof%> in %qD call is the same "
1952 "expression as the first source; did you mean to "
1953 "dereference it?", callee
);
1957 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1959 && comp_types (TREE_TYPE (dest
), type
)
1960 && !VOID_TYPE_P (TREE_TYPE (type
)))
1962 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1963 "argument to %<sizeof%> in %qD call is the same "
1964 "pointer type %qT as the first source; expected %qT "
1965 "or an explicit length", callee
, TREE_TYPE (dest
),
1966 TREE_TYPE (TREE_TYPE (dest
)));
1973 if (!TYPE_P (sizeof_arg
[idx
])
1974 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1975 && comp_types (TREE_TYPE (src
), type
))
1977 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1978 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1979 "argument to %<sizeof%> in %qD call is the same "
1980 "expression as the second source; did you mean to "
1981 "remove the addressof?", callee
);
1982 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1983 == TYPE_PRECISION (char_type_node
))
1985 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1986 "argument to %<sizeof%> in %qD call is the same "
1987 "expression as the second source; did you mean to "
1988 "provide an explicit length?", callee
);
1990 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1991 "argument to %<sizeof%> in %qD call is the same "
1992 "expression as the second source; did you mean to "
1993 "dereference it?", callee
);
1997 if (POINTER_TYPE_P (TREE_TYPE (src
))
1999 && comp_types (TREE_TYPE (src
), type
)
2000 && !VOID_TYPE_P (TREE_TYPE (type
)))
2002 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
2003 "argument to %<sizeof%> in %qD call is the same "
2004 "pointer type %qT as the second source; expected %qT "
2005 "or an explicit length", callee
, TREE_TYPE (src
),
2006 TREE_TYPE (TREE_TYPE (src
)));
2013 /* Warn for unlikely, improbable, or stupid DECL declarations
2017 check_main_parameter_types (tree decl
)
2019 function_args_iterator iter
;
2023 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl
), type
, iter
)
2025 /* XXX void_type_node belies the abstraction. */
2026 if (type
== void_type_node
|| type
== error_mark_node
)
2030 if (TYPE_ATOMIC (t
))
2031 pedwarn (input_location
, OPT_Wmain
,
2032 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2034 while (POINTER_TYPE_P (t
))
2037 if (TYPE_ATOMIC (t
))
2038 pedwarn (input_location
, OPT_Wmain
,
2039 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2047 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
2048 pedwarn (input_location
, OPT_Wmain
,
2049 "first argument of %q+D should be %<int%>", decl
);
2053 if (TREE_CODE (type
) != POINTER_TYPE
2054 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2055 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2057 pedwarn (input_location
, OPT_Wmain
,
2058 "second argument of %q+D should be %<char **%>", decl
);
2062 if (TREE_CODE (type
) != POINTER_TYPE
2063 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2064 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2066 pedwarn (input_location
, OPT_Wmain
,
2067 "third argument of %q+D should probably be "
2068 "%<char **%>", decl
);
2073 /* It is intentional that this message does not mention the third
2074 argument because it's only mentioned in an appendix of the
2076 if (argct
> 0 && (argct
< 2 || argct
> 3))
2077 pedwarn (input_location
, OPT_Wmain
,
2078 "%q+D takes only zero or two arguments", decl
);
2080 if (stdarg_p (TREE_TYPE (decl
)))
2081 pedwarn (input_location
, OPT_Wmain
,
2082 "%q+D declared as variadic function", decl
);
2085 /* vector_targets_convertible_p is used for vector pointer types. The
2086 callers perform various checks that the qualifiers are satisfactory,
2087 while OTOH vector_targets_convertible_p ignores the number of elements
2088 in the vectors. That's fine with vector pointers as we can consider,
2089 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2090 and that does not require and conversion of the pointer values.
2091 In contrast, vector_types_convertible_p and
2092 vector_types_compatible_elements_p are used for vector value types. */
2093 /* True if pointers to distinct types T1 and T2 can be converted to
2094 each other without an explicit cast. Only returns true for opaque
2097 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
2099 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
2100 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2101 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2107 /* vector_types_convertible_p is used for vector value types.
2108 It could in principle call vector_targets_convertible_p as a subroutine,
2109 but then the check for vector type would be duplicated with its callers,
2110 and also the purpose of vector_targets_convertible_p would become
2112 Where vector_types_convertible_p returns true, a conversion might still be
2113 needed to make the types match.
2114 In contrast, vector_targets_convertible_p is used for vector pointer
2115 values, and vector_types_compatible_elements_p is used specifically
2116 in the context for binary operators, as a check if use is possible without
2118 /* True if vector types T1 and T2 can be converted to each other
2119 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2120 can only be converted with -flax-vector-conversions yet that is not
2121 in effect, emit a note telling the user about that option if such
2122 a note has not previously been emitted. */
2124 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
2126 static bool emitted_lax_note
= false;
2127 bool convertible_lax
;
2129 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2130 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2134 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
2135 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
2136 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
2137 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
2138 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
2140 if (!convertible_lax
|| flag_lax_vector_conversions
)
2141 return convertible_lax
;
2143 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
2144 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2147 if (emit_lax_note
&& !emitted_lax_note
)
2149 emitted_lax_note
= true;
2150 inform (input_location
, "use -flax-vector-conversions to permit "
2151 "conversions between vectors with differing "
2152 "element types or numbers of subparts");
2158 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2159 and have vector types, V0 has the same type as V1, and the number of
2160 elements of V0, V1, MASK is the same.
2162 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2163 called with two arguments. In this case implementation passes the
2164 first argument twice in order to share the same tree code. This fact
2165 could enable the mask-values being twice the vector length. This is
2166 an implementation accident and this semantics is not guaranteed to
2169 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
2174 bool maybe_const
= false;
2175 bool two_arguments
= false;
2177 if (v1
== NULL_TREE
)
2179 two_arguments
= true;
2183 if (v0
== error_mark_node
|| v1
== error_mark_node
2184 || mask
== error_mark_node
)
2185 return error_mark_node
;
2187 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
2190 error_at (loc
, "__builtin_shuffle last argument must "
2191 "be an integer vector");
2192 return error_mark_node
;
2195 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
2196 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
2199 error_at (loc
, "__builtin_shuffle arguments must be vectors");
2200 return error_mark_node
;
2203 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
2206 error_at (loc
, "__builtin_shuffle argument vectors must be of "
2208 return error_mark_node
;
2211 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
2212 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
2213 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
2214 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
2217 error_at (loc
, "__builtin_shuffle number of elements of the "
2218 "argument vector(s) and the mask vector should "
2220 return error_mark_node
;
2223 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
2224 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
2227 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
2228 "must have the same size as inner type of the mask");
2229 return error_mark_node
;
2232 if (!c_dialect_cxx ())
2234 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2235 v0
= c_fully_fold (v0
, false, &maybe_const
);
2236 wrap
&= maybe_const
;
2239 v1
= v0
= save_expr (v0
);
2242 v1
= c_fully_fold (v1
, false, &maybe_const
);
2243 wrap
&= maybe_const
;
2246 mask
= c_fully_fold (mask
, false, &maybe_const
);
2247 wrap
&= maybe_const
;
2249 else if (two_arguments
)
2250 v1
= v0
= save_expr (v0
);
2252 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
2254 if (!c_dialect_cxx () && !wrap
)
2255 ret
= c_wrap_maybe_const (ret
, true);
2260 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2261 to integral type. */
2264 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
2266 op
= get_narrower (op
, unsignedp_ptr
);
2268 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
2269 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
2271 /* C++0x scoped enumerations don't implicitly convert to integral
2272 type; if we stripped an explicit conversion to a larger type we
2273 need to replace it so common_type will still work. */
2274 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
2275 TYPE_UNSIGNED (TREE_TYPE (op
)));
2276 op
= fold_convert (type
, op
);
2281 /* This is a helper function of build_binary_op.
2283 For certain operations if both args were extended from the same
2284 smaller type, do the arithmetic in that type and then extend.
2286 BITWISE indicates a bitwise operation.
2287 For them, this optimization is safe only if
2288 both args are zero-extended or both are sign-extended.
2289 Otherwise, we might change the result.
2290 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2291 but calculated in (unsigned short) it would be (unsigned short)-1.
2294 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
2296 int unsigned0
, unsigned1
;
2301 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2302 excessive narrowing when we call get_narrower below. For
2303 example, suppose that OP0 is of unsigned int extended
2304 from signed char and that RESULT_TYPE is long long int.
2305 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2308 (long long int) (unsigned int) signed_char
2310 which get_narrower would narrow down to
2312 (unsigned int) signed char
2314 If we do not cast OP0 first, get_narrower would return
2315 signed_char, which is inconsistent with the case of the
2317 op0
= convert (result_type
, op0
);
2318 op1
= convert (result_type
, op1
);
2320 arg0
= c_common_get_narrower (op0
, &unsigned0
);
2321 arg1
= c_common_get_narrower (op1
, &unsigned1
);
2323 /* UNS is 1 if the operation to be done is an unsigned one. */
2324 uns
= TYPE_UNSIGNED (result_type
);
2326 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2327 but it *requires* conversion to FINAL_TYPE. */
2329 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2330 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2331 && TREE_TYPE (op0
) != result_type
)
2332 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2333 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2334 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2335 && TREE_TYPE (op1
) != result_type
)
2336 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2338 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2340 /* For bitwise operations, signedness of nominal type
2341 does not matter. Consider only how operands were extended. */
2345 /* Note that in all three cases below we refrain from optimizing
2346 an unsigned operation on sign-extended args.
2347 That would not be valid. */
2349 /* Both args variable: if both extended in same way
2350 from same width, do it in that width.
2351 Do it unsigned if args were zero-extended. */
2352 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2353 < TYPE_PRECISION (result_type
))
2354 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2355 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2356 && unsigned0
== unsigned1
2357 && (unsigned0
|| !uns
))
2358 return c_common_signed_or_unsigned_type
2359 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2361 else if (TREE_CODE (arg0
) == INTEGER_CST
2362 && (unsigned1
|| !uns
)
2363 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2364 < TYPE_PRECISION (result_type
))
2366 = c_common_signed_or_unsigned_type (unsigned1
,
2368 && !POINTER_TYPE_P (type
)
2369 && int_fits_type_p (arg0
, type
))
2372 else if (TREE_CODE (arg1
) == INTEGER_CST
2373 && (unsigned0
|| !uns
)
2374 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2375 < TYPE_PRECISION (result_type
))
2377 = c_common_signed_or_unsigned_type (unsigned0
,
2379 && !POINTER_TYPE_P (type
)
2380 && int_fits_type_p (arg1
, type
))
2386 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2387 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2390 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
2392 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
2393 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
2394 REAL_VALUE_TYPE real_low_bound
=
2395 real_value_from_int_cst (0, type_low_bound
);
2396 REAL_VALUE_TYPE real_high_bound
=
2397 real_value_from_int_cst (0, type_high_bound
);
2399 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
2400 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
2403 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2404 to the complex/real/integer type TYPE. Function returns non-zero when:
2405 * EXPR is a constant which cannot be exactly converted to TYPE.
2406 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2407 for EXPR type and TYPE being both integers or both real, or both
2409 * EXPR is not a constant of complex type and TYPE is a real or
2411 * EXPR is not a constant of real type and TYPE is an integer.
2412 * EXPR is not a constant of integer type which cannot be
2413 exactly converted to real type.
2415 Function allows conversions between types of different signedness and
2416 can return SAFE_CONVERSION (zero) in that case. Function can produce
2417 signedness warnings if PRODUCE_WARNS is true.
2419 Function allows conversions from complex constants to non-complex types,
2420 provided that imaginary part is zero and real part can be safely converted
2423 enum conversion_safety
2424 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, bool produce_warns
)
2426 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
2427 tree expr_type
= TREE_TYPE (expr
);
2428 loc
= expansion_point_location_if_in_system_header (loc
);
2430 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
2432 /* If type is complex, we are interested in compatibility with
2434 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2435 type
= TREE_TYPE (type
);
2437 /* Warn for real constant that is not an exact integer converted
2439 if (TREE_CODE (expr_type
) == REAL_TYPE
2440 && TREE_CODE (type
) == INTEGER_TYPE
)
2442 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
2443 give_warning
= UNSAFE_REAL
;
2445 /* Warn for an integer constant that does not fit into integer type. */
2446 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2447 && TREE_CODE (type
) == INTEGER_TYPE
2448 && !int_fits_type_p (expr
, type
))
2450 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
2451 && tree_int_cst_sgn (expr
) < 0)
2454 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
2455 " implicitly converted to unsigned type");
2457 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
2460 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
2461 " constant value to negative integer");
2464 give_warning
= UNSAFE_OTHER
;
2466 else if (TREE_CODE (type
) == REAL_TYPE
)
2468 /* Warn for an integer constant that does not fit into real type. */
2469 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
2471 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
2472 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2473 give_warning
= UNSAFE_REAL
;
2475 /* Warn for a real constant that does not fit into a smaller
2477 else if (TREE_CODE (expr_type
) == REAL_TYPE
2478 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2480 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2481 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2482 give_warning
= UNSAFE_REAL
;
2487 else if (TREE_CODE (expr
) == COMPLEX_CST
)
2489 tree imag_part
= TREE_IMAGPART (expr
);
2490 /* Conversion from complex constant with zero imaginary part,
2491 perform check for conversion of real part. */
2492 if ((TREE_CODE (imag_part
) == REAL_CST
2493 && real_zerop (imag_part
))
2494 || (TREE_CODE (imag_part
) == INTEGER_CST
2495 && integer_zerop (imag_part
)))
2496 /* Note: in this branch we use recursive call to unsafe_conversion_p
2497 with different type of EXPR, but it is still safe, because when EXPR
2498 is a constant, it's type is not used in text of generated warnings
2499 (otherwise they could sound misleading). */
2500 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
2502 /* Conversion from complex constant with non-zero imaginary part. */
2505 /* Conversion to complex type.
2506 Perform checks for both real and imaginary parts. */
2507 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2509 /* Unfortunately, produce_warns must be false in two subsequent
2510 calls of unsafe_conversion_p, because otherwise we could
2511 produce strange "double" warnings, if both real and imaginary
2512 parts have conversion problems related to signedness.
2515 int32_t _Complex a = 0x80000000 + 0x80000000i;
2517 Possible solution: add a separate function for checking
2518 constants and combine result of two calls appropriately. */
2519 enum conversion_safety re_safety
=
2520 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), false);
2521 enum conversion_safety im_safety
=
2522 unsafe_conversion_p (loc
, type
, imag_part
, false);
2524 /* Merge the results into appropriate single warning. */
2526 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2527 if (re_safety
== im_safety
)
2528 give_warning
= re_safety
;
2529 else if (!re_safety
&& im_safety
)
2530 give_warning
= im_safety
;
2531 else if (re_safety
&& !im_safety
)
2532 give_warning
= re_safety
;
2534 give_warning
= UNSAFE_OTHER
;
2536 /* Warn about conversion from complex to real or integer type. */
2538 give_warning
= UNSAFE_IMAGINARY
;
2542 /* Checks for remaining case: EXPR is not constant. */
2545 /* Warn for real types converted to integer types. */
2546 if (TREE_CODE (expr_type
) == REAL_TYPE
2547 && TREE_CODE (type
) == INTEGER_TYPE
)
2548 give_warning
= UNSAFE_REAL
;
2550 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2551 && TREE_CODE (type
) == INTEGER_TYPE
)
2553 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2554 expr
= get_unwidened (expr
, 0);
2555 expr_type
= TREE_TYPE (expr
);
2557 /* Don't warn for short y; short x = ((int)y & 0xff); */
2558 if (TREE_CODE (expr
) == BIT_AND_EXPR
2559 || TREE_CODE (expr
) == BIT_IOR_EXPR
2560 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2562 /* If both args were extended from a shortest type,
2563 use that type if that is safe. */
2564 expr_type
= shorten_binary_op (expr_type
,
2565 TREE_OPERAND (expr
, 0),
2566 TREE_OPERAND (expr
, 1),
2569 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2571 tree op0
= TREE_OPERAND (expr
, 0);
2572 tree op1
= TREE_OPERAND (expr
, 1);
2573 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2574 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2576 /* If one of the operands is a non-negative constant
2577 that fits in the target type, then the type of the
2578 other operand does not matter. */
2579 if ((TREE_CODE (op0
) == INTEGER_CST
2580 && int_fits_type_p (op0
, c_common_signed_type (type
))
2581 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2582 || (TREE_CODE (op1
) == INTEGER_CST
2583 && int_fits_type_p (op1
, c_common_signed_type (type
))
2584 && int_fits_type_p (op1
,
2585 c_common_unsigned_type (type
))))
2586 return SAFE_CONVERSION
;
2587 /* If constant is unsigned and fits in the target
2588 type, then the result will also fit. */
2589 else if ((TREE_CODE (op0
) == INTEGER_CST
2591 && int_fits_type_p (op0
, type
))
2592 || (TREE_CODE (op1
) == INTEGER_CST
2594 && int_fits_type_p (op1
, type
)))
2595 return SAFE_CONVERSION
;
2598 /* Warn for integer types converted to smaller integer types. */
2599 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2600 give_warning
= UNSAFE_OTHER
;
2602 /* When they are the same width but different signedness,
2603 then the value may change. */
2604 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2605 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2606 /* Even when converted to a bigger type, if the type is
2607 unsigned but expr is signed, then negative values
2609 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2611 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
2612 "may change the sign of the result",
2616 /* Warn for integer types converted to real types if and only if
2617 all the range of values of the integer type cannot be
2618 represented by the real type. */
2619 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2620 && TREE_CODE (type
) == REAL_TYPE
)
2622 /* Don't warn about char y = 0xff; float x = (int) y; */
2623 expr
= get_unwidened (expr
, 0);
2624 expr_type
= TREE_TYPE (expr
);
2626 if (!int_safely_convertible_to_real_p (expr_type
, type
))
2627 give_warning
= UNSAFE_OTHER
;
2630 /* Warn for real types converted to smaller real types. */
2631 else if (TREE_CODE (expr_type
) == REAL_TYPE
2632 && TREE_CODE (type
) == REAL_TYPE
2633 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2634 give_warning
= UNSAFE_REAL
;
2636 /* Check conversion between two complex types. */
2637 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2638 && TREE_CODE (type
) == COMPLEX_TYPE
)
2640 /* Extract underlying types (i.e., type of real and imaginary
2641 parts) of expr_type and type. */
2642 tree from_type
= TREE_TYPE (expr_type
);
2643 tree to_type
= TREE_TYPE (type
);
2645 /* Warn for real types converted to integer types. */
2646 if (TREE_CODE (from_type
) == REAL_TYPE
2647 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2648 give_warning
= UNSAFE_REAL
;
2650 /* Warn for real types converted to smaller real types. */
2651 else if (TREE_CODE (from_type
) == REAL_TYPE
2652 && TREE_CODE (to_type
) == REAL_TYPE
2653 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2654 give_warning
= UNSAFE_REAL
;
2656 /* Check conversion for complex integer types. Here implementation
2657 is simpler than for real-domain integers because it does not
2658 involve sophisticated cases, such as bitmasks, casts, etc. */
2659 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2660 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2662 /* Warn for integer types converted to smaller integer types. */
2663 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2664 give_warning
= UNSAFE_OTHER
;
2666 /* Check for different signedness, see case for real-domain
2667 integers (above) for a more detailed comment. */
2668 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
2669 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
2670 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
2672 warning_at (loc
, OPT_Wsign_conversion
,
2673 "conversion to %qT from %qT "
2674 "may change the sign of the result",
2677 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2678 && TREE_CODE (to_type
) == REAL_TYPE
2679 && !int_safely_convertible_to_real_p (from_type
, to_type
))
2680 give_warning
= UNSAFE_OTHER
;
2683 /* Warn for complex types converted to real or integer types. */
2684 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2685 && TREE_CODE (type
) != COMPLEX_TYPE
)
2686 give_warning
= UNSAFE_IMAGINARY
;
2689 return give_warning
;
2692 /* Warns if the conversion of EXPR to TYPE may alter a value.
2693 This is a helper function for warnings_for_convert_and_check. */
2696 conversion_warning (location_t loc
, tree type
, tree expr
)
2698 tree expr_type
= TREE_TYPE (expr
);
2699 enum conversion_safety conversion_kind
;
2701 if (!warn_conversion
&& !warn_sign_conversion
&& !warn_float_conversion
)
2704 /* This may happen, because for LHS op= RHS we preevaluate
2705 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2706 means we could no longer see the code of the EXPR. */
2707 if (TREE_CODE (expr
) == C_MAYBE_CONST_EXPR
)
2708 expr
= C_MAYBE_CONST_EXPR_EXPR (expr
);
2709 if (TREE_CODE (expr
) == SAVE_EXPR
)
2710 expr
= TREE_OPERAND (expr
, 0);
2712 switch (TREE_CODE (expr
))
2720 case TRUTH_ANDIF_EXPR
:
2721 case TRUTH_ORIF_EXPR
:
2722 case TRUTH_AND_EXPR
:
2724 case TRUTH_XOR_EXPR
:
2725 case TRUTH_NOT_EXPR
:
2726 /* Conversion from boolean to a signed:1 bit-field (which only
2727 can hold the values 0 and -1) doesn't lose information - but
2728 it does change the value. */
2729 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2730 warning_at (loc
, OPT_Wconversion
,
2731 "conversion to %qT from boolean expression", type
);
2737 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2738 if (conversion_kind
== UNSAFE_REAL
)
2739 warning_at (loc
, OPT_Wfloat_conversion
,
2740 "conversion to %qT alters %qT constant value",
2742 else if (conversion_kind
)
2743 warning_at (loc
, OPT_Wconversion
,
2744 "conversion to %qT alters %qT constant value",
2750 /* In case of COND_EXPR, we do not care about the type of
2751 COND_EXPR, only about the conversion of each operand. */
2752 tree op1
= TREE_OPERAND (expr
, 1);
2753 tree op2
= TREE_OPERAND (expr
, 2);
2755 conversion_warning (loc
, type
, op1
);
2756 conversion_warning (loc
, type
, op2
);
2760 default: /* 'expr' is not a constant. */
2761 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2762 if (conversion_kind
== UNSAFE_REAL
)
2763 warning_at (loc
, OPT_Wfloat_conversion
,
2764 "conversion to %qT from %qT may alter its value",
2766 else if (conversion_kind
== UNSAFE_IMAGINARY
)
2767 warning_at (loc
, OPT_Wconversion
,
2768 "conversion to %qT from %qT discards imaginary component",
2770 else if (conversion_kind
)
2771 warning_at (loc
, OPT_Wconversion
,
2772 "conversion to %qT from %qT may alter its value",
2777 /* Produce warnings after a conversion. RESULT is the result of
2778 converting EXPR to TYPE. This is a helper function for
2779 convert_and_check and cp_convert_and_check. */
2782 warnings_for_convert_and_check (location_t loc
, tree type
, tree expr
,
2785 loc
= expansion_point_location_if_in_system_header (loc
);
2787 if (TREE_CODE (expr
) == INTEGER_CST
2788 && (TREE_CODE (type
) == INTEGER_TYPE
2789 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2790 && !int_fits_type_p (expr
, type
))
2792 /* Do not diagnose overflow in a constant expression merely
2793 because a conversion overflowed. */
2794 if (TREE_OVERFLOW (result
))
2795 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2797 if (TYPE_UNSIGNED (type
))
2799 /* This detects cases like converting -129 or 256 to
2801 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2802 warning_at (loc
, OPT_Woverflow
,
2803 "large integer implicitly truncated to unsigned type");
2805 conversion_warning (loc
, type
, expr
);
2807 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2808 warning_at (loc
, OPT_Woverflow
,
2809 "overflow in implicit constant conversion");
2810 /* No warning for converting 0x80000000 to int. */
2812 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2813 || TYPE_PRECISION (TREE_TYPE (expr
))
2814 != TYPE_PRECISION (type
)))
2815 warning_at (loc
, OPT_Woverflow
,
2816 "overflow in implicit constant conversion");
2819 conversion_warning (loc
, type
, expr
);
2821 else if ((TREE_CODE (result
) == INTEGER_CST
2822 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2823 warning_at (loc
, OPT_Woverflow
,
2824 "overflow in implicit constant conversion");
2826 conversion_warning (loc
, type
, expr
);
2830 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2831 Invoke this function on every expression that is converted implicitly,
2832 i.e. because of language rules and not because of an explicit cast. */
2835 convert_and_check (location_t loc
, tree type
, tree expr
)
2838 tree expr_for_warning
;
2840 /* Convert from a value with possible excess precision rather than
2841 via the semantic type, but do not warn about values not fitting
2842 exactly in the semantic type. */
2843 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2845 tree orig_type
= TREE_TYPE (expr
);
2846 expr
= TREE_OPERAND (expr
, 0);
2847 expr_for_warning
= convert (orig_type
, expr
);
2848 if (orig_type
== type
)
2849 return expr_for_warning
;
2852 expr_for_warning
= expr
;
2854 if (TREE_TYPE (expr
) == type
)
2857 result
= convert (type
, expr
);
2859 if (c_inhibit_evaluation_warnings
== 0
2860 && !TREE_OVERFLOW_P (expr
)
2861 && result
!= error_mark_node
)
2862 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
2867 /* A node in a list that describes references to variables (EXPR), which are
2868 either read accesses if WRITER is zero, or write accesses, in which case
2869 WRITER is the parent of EXPR. */
2876 /* Used to implement a cache the results of a call to verify_tree. We only
2877 use this for SAVE_EXPRs. */
2880 struct tlist_cache
*next
;
2881 struct tlist
*cache_before_sp
;
2882 struct tlist
*cache_after_sp
;
2886 /* Obstack to use when allocating tlist structures, and corresponding
2888 static struct obstack tlist_obstack
;
2889 static char *tlist_firstobj
= 0;
2891 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2893 static struct tlist
*warned_ids
;
2894 /* SAVE_EXPRs need special treatment. We process them only once and then
2895 cache the results. */
2896 static struct tlist_cache
*save_expr_cache
;
2898 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2899 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2900 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2901 static int warning_candidate_p (tree
);
2902 static bool candidate_equal_p (const_tree
, const_tree
);
2903 static void warn_for_collisions (struct tlist
*);
2904 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2905 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2907 /* Create a new struct tlist and fill in its fields. */
2908 static struct tlist
*
2909 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2912 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2919 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2920 is nonnull, we ignore any node we find which has a writer equal to it. */
2923 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2927 struct tlist
*next
= add
->next
;
2930 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2931 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2936 /* Merge the nodes of ADD into TO. This merging process is done so that for
2937 each variable that already exists in TO, no new node is added; however if
2938 there is a write access recorded in ADD, and an occurrence on TO is only
2939 a read access, then the occurrence in TO will be modified to record the
2943 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2945 struct tlist
**end
= to
;
2948 end
= &(*end
)->next
;
2954 struct tlist
*next
= add
->next
;
2956 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2957 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2961 tmp2
->writer
= add
->writer
;
2965 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
2966 end
= &(*end
)->next
;
2973 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2974 references in list LIST conflict with it, excluding reads if ONLY writers
2978 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2983 /* Avoid duplicate warnings. */
2984 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2985 if (candidate_equal_p (tmp
->expr
, written
))
2990 if (candidate_equal_p (list
->expr
, written
)
2991 && !candidate_equal_p (list
->writer
, writer
)
2992 && (!only_writes
|| list
->writer
))
2994 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2995 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
2996 OPT_Wsequence_point
, "operation on %qE may be undefined",
3003 /* Given a list LIST of references to variables, find whether any of these
3004 can cause conflicts due to missing sequence points. */
3007 warn_for_collisions (struct tlist
*list
)
3011 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
3014 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
3018 /* Return nonzero if X is a tree that can be verified by the sequence point
3021 warning_candidate_p (tree x
)
3023 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
3026 if (TREE_CODE (x
) == BLOCK
)
3029 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3030 (lvalue_p) crash on TRY/CATCH. */
3031 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
3037 /* No point to track non-const calls, they will never satisfy
3039 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
3042 if (TREE_CODE (x
) == STRING_CST
)
3048 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3050 candidate_equal_p (const_tree x
, const_tree y
)
3052 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
3055 /* Walk the tree X, and record accesses to variables. If X is written by the
3056 parent tree, WRITER is the parent.
3057 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3058 expression or its only operand forces a sequence point, then everything up
3059 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3061 Once we return, we will have emitted warnings if any subexpression before
3062 such a sequence point could be undefined. On a higher level, however, the
3063 sequence point may not be relevant, and we'll merge the two lists.
3065 Example: (b++, a) + b;
3066 The call that processes the COMPOUND_EXPR will store the increment of B
3067 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3068 processes the PLUS_EXPR will need to merge the two lists so that
3069 eventually, all accesses end up on the same list (and we'll warn about the
3070 unordered subexpressions b++ and b.
3072 A note on merging. If we modify the former example so that our expression
3075 care must be taken not simply to add all three expressions into the final
3076 PNO_SP list. The function merge_tlist takes care of that by merging the
3077 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3078 way, so that no more than one access to B is recorded. */
3081 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
3084 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
3085 enum tree_code code
;
3086 enum tree_code_class cl
;
3088 /* X may be NULL if it is the operand of an empty statement expression
3094 code
= TREE_CODE (x
);
3095 cl
= TREE_CODE_CLASS (code
);
3097 if (warning_candidate_p (x
))
3098 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
3107 case TRUTH_ANDIF_EXPR
:
3108 case TRUTH_ORIF_EXPR
:
3109 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
3110 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3111 warn_for_collisions (tmp_nosp
);
3112 merge_tlist (pbefore_sp
, tmp_before
, 0);
3113 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
3114 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3115 warn_for_collisions (tmp_list2
);
3116 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3117 merge_tlist (pno_sp
, tmp_list2
, 0);
3121 tmp_before
= tmp_list2
= 0;
3122 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
3123 warn_for_collisions (tmp_list2
);
3124 merge_tlist (pbefore_sp
, tmp_before
, 0);
3125 merge_tlist (pbefore_sp
, tmp_list2
, 0);
3127 tmp_list3
= tmp_nosp
= 0;
3128 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
3129 warn_for_collisions (tmp_nosp
);
3130 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3132 tmp_list3
= tmp_list2
= 0;
3133 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3134 warn_for_collisions (tmp_list2
);
3135 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3136 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3137 two first, to avoid warning for (a ? b++ : b++). */
3138 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
3139 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3142 case PREDECREMENT_EXPR
:
3143 case PREINCREMENT_EXPR
:
3144 case POSTDECREMENT_EXPR
:
3145 case POSTINCREMENT_EXPR
:
3146 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
3150 tmp_before
= tmp_nosp
= tmp_list3
= 0;
3151 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3152 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
3153 /* Expressions inside the LHS are not ordered wrt. the sequence points
3154 in the RHS. Example:
3156 Despite the fact that the modification of "a" is in the before_sp
3157 list (tmp_before), it conflicts with the use of "a" in the LHS.
3158 We can handle this by adding the contents of tmp_list3
3159 to those of tmp_before, and redoing the collision warnings for that
3161 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
3162 warn_for_collisions (tmp_before
);
3163 /* Exclude the LHS itself here; we first have to merge it into the
3164 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3165 didn't exclude the LHS, we'd get it twice, once as a read and once
3167 add_tlist (pno_sp
, tmp_list3
, x
, 0);
3168 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
3170 merge_tlist (pbefore_sp
, tmp_before
, 0);
3171 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
3172 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
3173 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
3177 /* We need to warn about conflicts among arguments and conflicts between
3178 args and the function address. Side effects of the function address,
3179 however, are not ordered by the sequence point of the call. */
3181 call_expr_arg_iterator iter
;
3183 tmp_before
= tmp_nosp
= 0;
3184 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3185 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
3187 tmp_list2
= tmp_list3
= 0;
3188 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
3189 merge_tlist (&tmp_list3
, tmp_list2
, 0);
3190 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
3192 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
3193 warn_for_collisions (tmp_before
);
3194 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
3199 /* Scan all the list, e.g. indices of multi dimensional array. */
3202 tmp_before
= tmp_nosp
= 0;
3203 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3204 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3205 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3212 struct tlist_cache
*t
;
3213 for (t
= save_expr_cache
; t
; t
= t
->next
)
3214 if (candidate_equal_p (t
->expr
, x
))
3219 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
3220 t
->next
= save_expr_cache
;
3222 save_expr_cache
= t
;
3224 tmp_before
= tmp_nosp
= 0;
3225 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3226 warn_for_collisions (tmp_nosp
);
3229 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
3230 t
->cache_before_sp
= tmp_before
;
3231 t
->cache_after_sp
= tmp_list3
;
3233 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
3234 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
3239 x
= TREE_OPERAND (x
, 0);
3246 /* For other expressions, simply recurse on their operands.
3247 Manual tail recursion for unary expressions.
3248 Other non-expressions need not be processed. */
3249 if (cl
== tcc_unary
)
3251 x
= TREE_OPERAND (x
, 0);
3255 else if (IS_EXPR_CODE_CLASS (cl
))
3258 int max
= TREE_OPERAND_LENGTH (x
);
3259 for (lp
= 0; lp
< max
; lp
++)
3261 tmp_before
= tmp_nosp
= 0;
3262 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
3263 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3264 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3271 /* Try to warn for undefined behavior in EXPR due to missing sequence
3275 verify_sequence_points (tree expr
)
3277 struct tlist
*before_sp
= 0, *after_sp
= 0;
3280 save_expr_cache
= 0;
3281 if (tlist_firstobj
== 0)
3283 gcc_obstack_init (&tlist_obstack
);
3284 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
3287 verify_tree (expr
, &before_sp
, &after_sp
, 0);
3288 warn_for_collisions (after_sp
);
3289 obstack_free (&tlist_obstack
, tlist_firstobj
);
3292 /* Validate the expression after `case' and apply default promotions. */
3295 check_case_value (location_t loc
, tree value
)
3297 if (value
== NULL_TREE
)
3300 if (TREE_CODE (value
) == INTEGER_CST
)
3301 /* Promote char or short to int. */
3302 value
= perform_integral_promotions (value
);
3303 else if (value
!= error_mark_node
)
3305 error_at (loc
, "case label does not reduce to an integer constant");
3306 value
= error_mark_node
;
3309 constant_expression_warning (value
);
3314 /* See if the case values LOW and HIGH are in the range of the original
3315 type (i.e. before the default conversion to int) of the switch testing
3317 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3318 the type before promoting it. CASE_LOW_P is a pointer to the lower
3319 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3320 if the case is not a case range.
3321 The caller has to make sure that we are not called with NULL for
3322 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3323 was a case value that doesn't fit into the range of the ORIG_TYPE.
3324 Returns true if the case label is in range of ORIG_TYPE (saturated or
3325 untouched) or false if the label is out of range. */
3328 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
3329 tree
*case_low_p
, tree
*case_high_p
,
3330 bool *outside_range_p
)
3332 tree min_value
, max_value
;
3333 tree case_low
= *case_low_p
;
3334 tree case_high
= case_high_p
? *case_high_p
: case_low
;
3336 /* If there was a problem with the original type, do nothing. */
3337 if (orig_type
== error_mark_node
)
3340 min_value
= TYPE_MIN_VALUE (orig_type
);
3341 max_value
= TYPE_MAX_VALUE (orig_type
);
3343 /* We'll really need integer constants here. */
3344 case_low
= fold (case_low
);
3345 case_high
= fold (case_high
);
3347 /* Case label is less than minimum for type. */
3348 if (tree_int_cst_compare (case_low
, min_value
) < 0
3349 && tree_int_cst_compare (case_high
, min_value
) < 0)
3351 warning_at (loc
, 0, "case label value is less than minimum value "
3353 *outside_range_p
= true;
3357 /* Case value is greater than maximum for type. */
3358 if (tree_int_cst_compare (case_low
, max_value
) > 0
3359 && tree_int_cst_compare (case_high
, max_value
) > 0)
3361 warning_at (loc
, 0, "case label value exceeds maximum value for type");
3362 *outside_range_p
= true;
3366 /* Saturate lower case label value to minimum. */
3367 if (tree_int_cst_compare (case_high
, min_value
) >= 0
3368 && tree_int_cst_compare (case_low
, min_value
) < 0)
3370 warning_at (loc
, 0, "lower value in case label range"
3371 " less than minimum value for type");
3372 *outside_range_p
= true;
3373 case_low
= min_value
;
3376 /* Saturate upper case label value to maximum. */
3377 if (tree_int_cst_compare (case_low
, max_value
) <= 0
3378 && tree_int_cst_compare (case_high
, max_value
) > 0)
3380 warning_at (loc
, 0, "upper value in case label range"
3381 " exceeds maximum value for type");
3382 *outside_range_p
= true;
3383 case_high
= max_value
;
3386 if (*case_low_p
!= case_low
)
3387 *case_low_p
= convert (type
, case_low
);
3388 if (case_high_p
&& *case_high_p
!= case_high
)
3389 *case_high_p
= convert (type
, case_high
);
3394 /* Return an integer type with BITS bits of precision,
3395 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3398 c_common_type_for_size (unsigned int bits
, int unsignedp
)
3402 if (bits
== TYPE_PRECISION (integer_type_node
))
3403 return unsignedp
? unsigned_type_node
: integer_type_node
;
3405 if (bits
== TYPE_PRECISION (signed_char_type_node
))
3406 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3408 if (bits
== TYPE_PRECISION (short_integer_type_node
))
3409 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3411 if (bits
== TYPE_PRECISION (long_integer_type_node
))
3412 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3414 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
3415 return (unsignedp
? long_long_unsigned_type_node
3416 : long_long_integer_type_node
);
3418 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3419 if (int_n_enabled_p
[i
]
3420 && bits
== int_n_data
[i
].bitsize
)
3421 return (unsignedp
? int_n_trees
[i
].unsigned_type
3422 : int_n_trees
[i
].signed_type
);
3424 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
3425 return (unsignedp
? widest_unsigned_literal_type_node
3426 : widest_integer_literal_type_node
);
3428 if (bits
<= TYPE_PRECISION (intQI_type_node
))
3429 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3431 if (bits
<= TYPE_PRECISION (intHI_type_node
))
3432 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3434 if (bits
<= TYPE_PRECISION (intSI_type_node
))
3435 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3437 if (bits
<= TYPE_PRECISION (intDI_type_node
))
3438 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3443 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3444 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3445 and saturating if SATP is nonzero, otherwise not saturating. */
3448 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
3449 int unsignedp
, int satp
)
3453 mode
= unsignedp
? UQQmode
: QQmode
;
3455 mode
= unsignedp
? UHAmode
: HAmode
;
3457 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
3458 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
3461 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
3463 sorry ("GCC cannot support operators with integer types and "
3464 "fixed-point types that have too many integral and "
3465 "fractional bits together");
3469 return c_common_type_for_mode (mode
, satp
);
3472 /* Used for communication between c_common_type_for_mode and
3473 c_register_builtin_type. */
3474 tree registered_builtin_types
;
3476 /* Return a data type that has machine mode MODE.
3477 If the mode is an integer,
3478 then UNSIGNEDP selects between signed and unsigned types.
3479 If the mode is a fixed-point mode,
3480 then UNSIGNEDP selects between saturating and nonsaturating types. */
3483 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
3488 if (mode
== TYPE_MODE (integer_type_node
))
3489 return unsignedp
? unsigned_type_node
: integer_type_node
;
3491 if (mode
== TYPE_MODE (signed_char_type_node
))
3492 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3494 if (mode
== TYPE_MODE (short_integer_type_node
))
3495 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3497 if (mode
== TYPE_MODE (long_integer_type_node
))
3498 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3500 if (mode
== TYPE_MODE (long_long_integer_type_node
))
3501 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3503 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3504 if (int_n_enabled_p
[i
]
3505 && mode
== int_n_data
[i
].m
)
3506 return (unsignedp
? int_n_trees
[i
].unsigned_type
3507 : int_n_trees
[i
].signed_type
);
3509 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
3510 return unsignedp
? widest_unsigned_literal_type_node
3511 : widest_integer_literal_type_node
;
3514 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3517 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3520 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3523 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3525 #if HOST_BITS_PER_WIDE_INT >= 64
3526 if (mode
== TYPE_MODE (intTI_type_node
))
3527 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3530 if (mode
== TYPE_MODE (float_type_node
))
3531 return float_type_node
;
3533 if (mode
== TYPE_MODE (double_type_node
))
3534 return double_type_node
;
3536 if (mode
== TYPE_MODE (long_double_type_node
))
3537 return long_double_type_node
;
3539 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3540 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3541 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
3542 return FLOATN_NX_TYPE_NODE (i
);
3544 if (mode
== TYPE_MODE (void_type_node
))
3545 return void_type_node
;
3547 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
3549 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3550 : make_signed_type (GET_MODE_PRECISION (mode
)));
3552 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
3554 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3555 : make_signed_type (GET_MODE_PRECISION (mode
)));
3557 if (COMPLEX_MODE_P (mode
))
3559 machine_mode inner_mode
;
3562 if (mode
== TYPE_MODE (complex_float_type_node
))
3563 return complex_float_type_node
;
3564 if (mode
== TYPE_MODE (complex_double_type_node
))
3565 return complex_double_type_node
;
3566 if (mode
== TYPE_MODE (complex_long_double_type_node
))
3567 return complex_long_double_type_node
;
3569 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3570 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3571 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
3572 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
3574 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
3575 return complex_integer_type_node
;
3577 inner_mode
= GET_MODE_INNER (mode
);
3578 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3579 if (inner_type
!= NULL_TREE
)
3580 return build_complex_type (inner_type
);
3582 else if (VECTOR_MODE_P (mode
))
3584 machine_mode inner_mode
= GET_MODE_INNER (mode
);
3585 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3586 if (inner_type
!= NULL_TREE
)
3587 return build_vector_type_for_mode (inner_type
, mode
);
3590 if (mode
== TYPE_MODE (dfloat32_type_node
))
3591 return dfloat32_type_node
;
3592 if (mode
== TYPE_MODE (dfloat64_type_node
))
3593 return dfloat64_type_node
;
3594 if (mode
== TYPE_MODE (dfloat128_type_node
))
3595 return dfloat128_type_node
;
3597 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
3599 if (mode
== TYPE_MODE (short_fract_type_node
))
3600 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
3601 if (mode
== TYPE_MODE (fract_type_node
))
3602 return unsignedp
? sat_fract_type_node
: fract_type_node
;
3603 if (mode
== TYPE_MODE (long_fract_type_node
))
3604 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
3605 if (mode
== TYPE_MODE (long_long_fract_type_node
))
3606 return unsignedp
? sat_long_long_fract_type_node
3607 : long_long_fract_type_node
;
3609 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
3610 return unsignedp
? sat_unsigned_short_fract_type_node
3611 : unsigned_short_fract_type_node
;
3612 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
3613 return unsignedp
? sat_unsigned_fract_type_node
3614 : unsigned_fract_type_node
;
3615 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
3616 return unsignedp
? sat_unsigned_long_fract_type_node
3617 : unsigned_long_fract_type_node
;
3618 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
3619 return unsignedp
? sat_unsigned_long_long_fract_type_node
3620 : unsigned_long_long_fract_type_node
;
3622 if (mode
== TYPE_MODE (short_accum_type_node
))
3623 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3624 if (mode
== TYPE_MODE (accum_type_node
))
3625 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3626 if (mode
== TYPE_MODE (long_accum_type_node
))
3627 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3628 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3629 return unsignedp
? sat_long_long_accum_type_node
3630 : long_long_accum_type_node
;
3632 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3633 return unsignedp
? sat_unsigned_short_accum_type_node
3634 : unsigned_short_accum_type_node
;
3635 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3636 return unsignedp
? sat_unsigned_accum_type_node
3637 : unsigned_accum_type_node
;
3638 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3639 return unsignedp
? sat_unsigned_long_accum_type_node
3640 : unsigned_long_accum_type_node
;
3641 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3642 return unsignedp
? sat_unsigned_long_long_accum_type_node
3643 : unsigned_long_long_accum_type_node
;
3646 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3648 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3650 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3652 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3654 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3656 if (mode
== UQQmode
)
3657 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3658 if (mode
== UHQmode
)
3659 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3660 if (mode
== USQmode
)
3661 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3662 if (mode
== UDQmode
)
3663 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3664 if (mode
== UTQmode
)
3665 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3668 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3670 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3672 return unsignedp
? sat_da_type_node
: da_type_node
;
3674 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3676 if (mode
== UHAmode
)
3677 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3678 if (mode
== USAmode
)
3679 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3680 if (mode
== UDAmode
)
3681 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3682 if (mode
== UTAmode
)
3683 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3686 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3687 if (TYPE_MODE (TREE_VALUE (t
)) == mode
3688 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
3689 return TREE_VALUE (t
);
3695 c_common_unsigned_type (tree type
)
3697 return c_common_signed_or_unsigned_type (1, type
);
3700 /* Return a signed type the same as TYPE in other respects. */
3703 c_common_signed_type (tree type
)
3705 return c_common_signed_or_unsigned_type (0, type
);
3708 /* Return a type the same as TYPE except unsigned or
3709 signed according to UNSIGNEDP. */
3712 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3717 /* This block of code emulates the behavior of the old
3718 c_common_unsigned_type. In particular, it returns
3719 long_unsigned_type_node if passed a long, even when a int would
3720 have the same size. This is necessary for warnings to work
3721 correctly in archs where sizeof(int) == sizeof(long) */
3723 type1
= TYPE_MAIN_VARIANT (type
);
3724 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3725 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3726 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3727 return unsignedp
? unsigned_type_node
: integer_type_node
;
3728 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3729 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3730 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3731 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3732 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3733 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3735 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3736 if (int_n_enabled_p
[i
]
3737 && (type1
== int_n_trees
[i
].unsigned_type
3738 || type1
== int_n_trees
[i
].signed_type
))
3739 return (unsignedp
? int_n_trees
[i
].unsigned_type
3740 : int_n_trees
[i
].signed_type
);
3742 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3743 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3744 #if HOST_BITS_PER_WIDE_INT >= 64
3745 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3746 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3748 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3749 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3750 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3751 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3752 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3753 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3754 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3755 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3757 #define C_COMMON_FIXED_TYPES(NAME) \
3758 if (type1 == short_ ## NAME ## _type_node \
3759 || type1 == unsigned_short_ ## NAME ## _type_node) \
3760 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3761 : short_ ## NAME ## _type_node; \
3762 if (type1 == NAME ## _type_node \
3763 || type1 == unsigned_ ## NAME ## _type_node) \
3764 return unsignedp ? unsigned_ ## NAME ## _type_node \
3765 : NAME ## _type_node; \
3766 if (type1 == long_ ## NAME ## _type_node \
3767 || type1 == unsigned_long_ ## NAME ## _type_node) \
3768 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3769 : long_ ## NAME ## _type_node; \
3770 if (type1 == long_long_ ## NAME ## _type_node \
3771 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3772 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3773 : long_long_ ## NAME ## _type_node;
3775 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3776 if (type1 == NAME ## _type_node \
3777 || type1 == u ## NAME ## _type_node) \
3778 return unsignedp ? u ## NAME ## _type_node \
3779 : NAME ## _type_node;
3781 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3782 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3783 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3784 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3785 : sat_ ## short_ ## NAME ## _type_node; \
3786 if (type1 == sat_ ## NAME ## _type_node \
3787 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3788 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3789 : sat_ ## NAME ## _type_node; \
3790 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3791 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3792 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3793 : sat_ ## long_ ## NAME ## _type_node; \
3794 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3795 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3796 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3797 : sat_ ## long_long_ ## NAME ## _type_node;
3799 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3800 if (type1 == sat_ ## NAME ## _type_node \
3801 || type1 == sat_ ## u ## NAME ## _type_node) \
3802 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3803 : sat_ ## NAME ## _type_node;
3805 C_COMMON_FIXED_TYPES (fract
);
3806 C_COMMON_FIXED_TYPES_SAT (fract
);
3807 C_COMMON_FIXED_TYPES (accum
);
3808 C_COMMON_FIXED_TYPES_SAT (accum
);
3810 C_COMMON_FIXED_MODE_TYPES (qq
);
3811 C_COMMON_FIXED_MODE_TYPES (hq
);
3812 C_COMMON_FIXED_MODE_TYPES (sq
);
3813 C_COMMON_FIXED_MODE_TYPES (dq
);
3814 C_COMMON_FIXED_MODE_TYPES (tq
);
3815 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3816 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3817 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3818 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3819 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3820 C_COMMON_FIXED_MODE_TYPES (ha
);
3821 C_COMMON_FIXED_MODE_TYPES (sa
);
3822 C_COMMON_FIXED_MODE_TYPES (da
);
3823 C_COMMON_FIXED_MODE_TYPES (ta
);
3824 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3825 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3826 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3827 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3829 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3830 the precision; they have precision set to match their range, but
3831 may use a wider mode to match an ABI. If we change modes, we may
3832 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3833 the precision as well, so as to yield correct results for
3834 bit-field types. C++ does not have these separate bit-field
3835 types, and producing a signed or unsigned variant of an
3836 ENUMERAL_TYPE may cause other problems as well. */
3838 if (!INTEGRAL_TYPE_P (type
)
3839 || TYPE_UNSIGNED (type
) == unsignedp
)
3842 #define TYPE_OK(node) \
3843 (TYPE_MODE (type) == TYPE_MODE (node) \
3844 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3845 if (TYPE_OK (signed_char_type_node
))
3846 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3847 if (TYPE_OK (integer_type_node
))
3848 return unsignedp
? unsigned_type_node
: integer_type_node
;
3849 if (TYPE_OK (short_integer_type_node
))
3850 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3851 if (TYPE_OK (long_integer_type_node
))
3852 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3853 if (TYPE_OK (long_long_integer_type_node
))
3854 return (unsignedp
? long_long_unsigned_type_node
3855 : long_long_integer_type_node
);
3857 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3858 if (int_n_enabled_p
[i
]
3859 && TYPE_MODE (type
) == int_n_data
[i
].m
3860 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
3861 return (unsignedp
? int_n_trees
[i
].unsigned_type
3862 : int_n_trees
[i
].signed_type
);
3864 if (TYPE_OK (widest_integer_literal_type_node
))
3865 return (unsignedp
? widest_unsigned_literal_type_node
3866 : widest_integer_literal_type_node
);
3868 #if HOST_BITS_PER_WIDE_INT >= 64
3869 if (TYPE_OK (intTI_type_node
))
3870 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3872 if (TYPE_OK (intDI_type_node
))
3873 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3874 if (TYPE_OK (intSI_type_node
))
3875 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3876 if (TYPE_OK (intHI_type_node
))
3877 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3878 if (TYPE_OK (intQI_type_node
))
3879 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3882 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3885 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3888 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3892 /* Extended integer types of the same width as a standard type have
3893 lesser rank, so those of the same width as int promote to int or
3894 unsigned int and are valid for printf formats expecting int or
3895 unsigned int. To avoid such special cases, avoid creating
3896 extended integer types for bit-fields if a standard integer type
3898 if (width
== TYPE_PRECISION (integer_type_node
))
3899 return unsignedp
? unsigned_type_node
: integer_type_node
;
3900 if (width
== TYPE_PRECISION (signed_char_type_node
))
3901 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3902 if (width
== TYPE_PRECISION (short_integer_type_node
))
3903 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3904 if (width
== TYPE_PRECISION (long_integer_type_node
))
3905 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3906 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3907 return (unsignedp
? long_long_unsigned_type_node
3908 : long_long_integer_type_node
);
3909 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3910 if (int_n_enabled_p
[i
]
3911 && width
== int_n_data
[i
].bitsize
)
3912 return (unsignedp
? int_n_trees
[i
].unsigned_type
3913 : int_n_trees
[i
].signed_type
);
3914 return build_nonstandard_integer_type (width
, unsignedp
);
3917 /* The C version of the register_builtin_type langhook. */
3920 c_register_builtin_type (tree type
, const char* name
)
3924 decl
= build_decl (UNKNOWN_LOCATION
,
3925 TYPE_DECL
, get_identifier (name
), type
);
3926 DECL_ARTIFICIAL (decl
) = 1;
3927 if (!TYPE_NAME (type
))
3928 TYPE_NAME (type
) = decl
;
3931 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3934 /* Print an error message for invalid operands to arith operation
3935 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3936 RICHLOC is a rich location for the message, containing either
3937 three separate locations for each of the operator and operands
3942 (C FE), or one location ranging over all over them
3950 binary_op_error (rich_location
*richloc
, enum tree_code code
,
3951 tree type0
, tree type1
)
3958 opname
= "+"; break;
3960 opname
= "-"; break;
3962 opname
= "*"; break;
3964 opname
= "max"; break;
3966 opname
= "min"; break;
3968 opname
= "=="; break;
3970 opname
= "!="; break;
3972 opname
= "<="; break;
3974 opname
= ">="; break;
3976 opname
= "<"; break;
3978 opname
= ">"; break;
3980 opname
= "<<"; break;
3982 opname
= ">>"; break;
3983 case TRUNC_MOD_EXPR
:
3984 case FLOOR_MOD_EXPR
:
3985 opname
= "%"; break;
3986 case TRUNC_DIV_EXPR
:
3987 case FLOOR_DIV_EXPR
:
3988 opname
= "/"; break;
3990 opname
= "&"; break;
3992 opname
= "|"; break;
3993 case TRUTH_ANDIF_EXPR
:
3994 opname
= "&&"; break;
3995 case TRUTH_ORIF_EXPR
:
3996 opname
= "||"; break;
3998 opname
= "^"; break;
4002 error_at_rich_loc (richloc
,
4003 "invalid operands to binary %s (have %qT and %qT)",
4004 opname
, type0
, type1
);
4007 /* Given an expression as a tree, return its original type. Do this
4008 by stripping any conversion that preserves the sign and precision. */
4010 expr_original_type (tree expr
)
4012 STRIP_SIGN_NOPS (expr
);
4013 return TREE_TYPE (expr
);
4016 /* Subroutine of build_binary_op, used for comparison operations.
4017 See if the operands have both been converted from subword integer types
4018 and, if so, perhaps change them both back to their original type.
4019 This function is also responsible for converting the two operands
4020 to the proper common type for comparison.
4022 The arguments of this function are all pointers to local variables
4023 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4024 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4026 LOC is the location of the comparison.
4028 If this function returns nonzero, it means that the comparison has
4029 a constant value. What this function returns is an expression for
4033 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
4034 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
4037 tree op0
= *op0_ptr
;
4038 tree op1
= *op1_ptr
;
4039 int unsignedp0
, unsignedp1
;
4041 tree primop0
, primop1
;
4042 enum tree_code code
= *rescode_ptr
;
4044 /* Throw away any conversions to wider types
4045 already present in the operands. */
4047 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
4048 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
4050 /* If primopN is first sign-extended from primopN's precision to opN's
4051 precision, then zero-extended from opN's precision to
4052 *restype_ptr precision, shortenings might be invalid. */
4053 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
4054 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
4056 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
4058 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
4059 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
4061 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
4064 /* Handle the case that OP0 does not *contain* a conversion
4065 but it *requires* conversion to FINAL_TYPE. */
4067 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
4068 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
4069 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
4070 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
4072 /* If one of the operands must be floated, we cannot optimize. */
4073 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
4074 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
4076 /* If first arg is constant, swap the args (changing operation
4077 so value is preserved), for canonicalization. Don't do this if
4078 the second arg is 0. */
4080 if (TREE_CONSTANT (primop0
)
4081 && !integer_zerop (primop1
) && !real_zerop (primop1
)
4082 && !fixed_zerop (primop1
))
4084 std::swap (primop0
, primop1
);
4085 std::swap (op0
, op1
);
4088 std::swap (unsignedp0
, unsignedp1
);
4089 std::swap (real1
, real2
);
4108 *rescode_ptr
= code
;
4111 /* If comparing an integer against a constant more bits wide,
4112 maybe we can deduce a value of 1 or 0 independent of the data.
4113 Or else truncate the constant now
4114 rather than extend the variable at run time.
4116 This is only interesting if the constant is the wider arg.
4117 Also, it is not safe if the constant is unsigned and the
4118 variable arg is signed, since in this case the variable
4119 would be sign-extended and then regarded as unsigned.
4120 Our technique fails in this case because the lowest/highest
4121 possible unsigned results don't follow naturally from the
4122 lowest/highest possible values of the variable operand.
4123 For just EQ_EXPR and NE_EXPR there is another technique that
4124 could be used: see if the constant can be faithfully represented
4125 in the other operand's type, by truncating it and reextending it
4126 and see if that preserves the constant's value. */
4128 if (!real1
&& !real2
4129 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
4130 && TREE_CODE (primop1
) == INTEGER_CST
4131 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
4133 int min_gt
, max_gt
, min_lt
, max_lt
;
4134 tree maxval
, minval
;
4135 /* 1 if comparison is nominally unsigned. */
4136 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
4139 type
= c_common_signed_or_unsigned_type (unsignedp0
,
4140 TREE_TYPE (primop0
));
4142 maxval
= TYPE_MAX_VALUE (type
);
4143 minval
= TYPE_MIN_VALUE (type
);
4145 if (unsignedp
&& !unsignedp0
)
4146 *restype_ptr
= c_common_signed_type (*restype_ptr
);
4148 if (TREE_TYPE (primop1
) != *restype_ptr
)
4150 /* Convert primop1 to target type, but do not introduce
4151 additional overflow. We know primop1 is an int_cst. */
4152 primop1
= force_fit_type (*restype_ptr
,
4155 TYPE_PRECISION (*restype_ptr
)),
4156 0, TREE_OVERFLOW (primop1
));
4158 if (type
!= *restype_ptr
)
4160 minval
= convert (*restype_ptr
, minval
);
4161 maxval
= convert (*restype_ptr
, maxval
);
4164 min_gt
= tree_int_cst_lt (primop1
, minval
);
4165 max_gt
= tree_int_cst_lt (primop1
, maxval
);
4166 min_lt
= tree_int_cst_lt (minval
, primop1
);
4167 max_lt
= tree_int_cst_lt (maxval
, primop1
);
4170 /* This used to be a switch, but Genix compiler can't handle that. */
4171 if (code
== NE_EXPR
)
4173 if (max_lt
|| min_gt
)
4174 val
= truthvalue_true_node
;
4176 else if (code
== EQ_EXPR
)
4178 if (max_lt
|| min_gt
)
4179 val
= truthvalue_false_node
;
4181 else if (code
== LT_EXPR
)
4184 val
= truthvalue_true_node
;
4186 val
= truthvalue_false_node
;
4188 else if (code
== GT_EXPR
)
4191 val
= truthvalue_true_node
;
4193 val
= truthvalue_false_node
;
4195 else if (code
== LE_EXPR
)
4198 val
= truthvalue_true_node
;
4200 val
= truthvalue_false_node
;
4202 else if (code
== GE_EXPR
)
4205 val
= truthvalue_true_node
;
4207 val
= truthvalue_false_node
;
4210 /* If primop0 was sign-extended and unsigned comparison specd,
4211 we did a signed comparison above using the signed type bounds.
4212 But the comparison we output must be unsigned.
4214 Also, for inequalities, VAL is no good; but if the signed
4215 comparison had *any* fixed result, it follows that the
4216 unsigned comparison just tests the sign in reverse
4217 (positive values are LE, negative ones GE).
4218 So we can generate an unsigned comparison
4219 against an extreme value of the signed type. */
4221 if (unsignedp
&& !unsignedp0
)
4228 primop1
= TYPE_MIN_VALUE (type
);
4234 primop1
= TYPE_MAX_VALUE (type
);
4241 type
= c_common_unsigned_type (type
);
4244 if (TREE_CODE (primop0
) != INTEGER_CST
4245 /* Don't warn if it's from a (non-system) macro. */
4246 && !(from_macro_expansion_at
4247 (expansion_point_location_if_in_system_header
4248 (EXPR_LOCATION (primop0
)))))
4250 if (val
== truthvalue_false_node
)
4251 warning_at (loc
, OPT_Wtype_limits
,
4252 "comparison is always false due to limited range of data type");
4253 if (val
== truthvalue_true_node
)
4254 warning_at (loc
, OPT_Wtype_limits
,
4255 "comparison is always true due to limited range of data type");
4260 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4261 if (TREE_SIDE_EFFECTS (primop0
))
4262 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
4266 /* Value is not predetermined, but do the comparison
4267 in the type of the operand that is not constant.
4268 TYPE is already properly set. */
4271 /* If either arg is decimal float and the other is float, find the
4272 proper common type to use for comparison. */
4273 else if (real1
&& real2
4274 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4275 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
4276 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4278 /* If either arg is decimal float and the other is float, fail. */
4279 else if (real1
&& real2
4280 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4281 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
4284 else if (real1
&& real2
4285 && (TYPE_PRECISION (TREE_TYPE (primop0
))
4286 == TYPE_PRECISION (TREE_TYPE (primop1
))))
4287 type
= TREE_TYPE (primop0
);
4289 /* If args' natural types are both narrower than nominal type
4290 and both extend in the same manner, compare them
4291 in the type of the wider arg.
4292 Otherwise must actually extend both to the nominal
4293 common type lest different ways of extending
4295 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4297 else if (unsignedp0
== unsignedp1
&& real1
== real2
4298 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
4299 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
4301 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4302 type
= c_common_signed_or_unsigned_type (unsignedp0
4303 || TYPE_UNSIGNED (*restype_ptr
),
4305 /* Make sure shorter operand is extended the right way
4306 to match the longer operand. */
4308 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
4309 TREE_TYPE (primop0
)),
4312 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
4313 TREE_TYPE (primop1
)),
4318 /* Here we must do the comparison on the nominal type
4319 using the args exactly as we received them. */
4320 type
= *restype_ptr
;
4324 if (!real1
&& !real2
&& integer_zerop (primop1
)
4325 && TYPE_UNSIGNED (*restype_ptr
))
4328 /* All unsigned values are >= 0, so we warn. However,
4329 if OP0 is a constant that is >= 0, the signedness of
4330 the comparison isn't an issue, so suppress the
4333 warn_type_limits
&& !in_system_header_at (loc
)
4334 && !(TREE_CODE (primop0
) == INTEGER_CST
4335 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
4337 /* Do not warn for enumeration types. */
4338 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
4344 warning_at (loc
, OPT_Wtype_limits
,
4345 "comparison of unsigned expression >= 0 is always true");
4346 value
= truthvalue_true_node
;
4351 warning_at (loc
, OPT_Wtype_limits
,
4352 "comparison of unsigned expression < 0 is always false");
4353 value
= truthvalue_false_node
;
4362 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4363 if (TREE_SIDE_EFFECTS (primop0
))
4364 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
4371 *op0_ptr
= convert (type
, primop0
);
4372 *op1_ptr
= convert (type
, primop1
);
4374 *restype_ptr
= truthvalue_type_node
;
4379 /* Return a tree for the sum or difference (RESULTCODE says which)
4380 of pointer PTROP and integer INTOP. */
4383 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
4384 tree ptrop
, tree intop
, bool complain
)
4388 /* The result is a pointer of the same type that is being added. */
4389 tree result_type
= TREE_TYPE (ptrop
);
4391 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
4393 if (complain
&& warn_pointer_arith
)
4394 pedwarn (loc
, OPT_Wpointer_arith
,
4395 "pointer of type %<void *%> used in arithmetic");
4397 return error_mark_node
;
4398 size_exp
= integer_one_node
;
4400 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
4402 if (complain
&& warn_pointer_arith
)
4403 pedwarn (loc
, OPT_Wpointer_arith
,
4404 "pointer to a function used in arithmetic");
4406 return error_mark_node
;
4407 size_exp
= integer_one_node
;
4410 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
4412 /* We are manipulating pointer values, so we don't need to warn
4413 about relying on undefined signed overflow. We disable the
4414 warning here because we use integer types so fold won't know that
4415 they are really pointers. */
4416 fold_defer_overflow_warnings ();
4418 /* If what we are about to multiply by the size of the elements
4419 contains a constant term, apply distributive law
4420 and multiply that constant term separately.
4421 This helps produce common subexpressions. */
4422 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
4423 && !TREE_CONSTANT (intop
)
4424 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
4425 && TREE_CONSTANT (size_exp
)
4426 /* If the constant comes from pointer subtraction,
4427 skip this optimization--it would cause an error. */
4428 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
4429 /* If the constant is unsigned, and smaller than the pointer size,
4430 then we must skip this optimization. This is because it could cause
4431 an overflow error if the constant is negative but INTOP is not. */
4432 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
4433 || (TYPE_PRECISION (TREE_TYPE (intop
))
4434 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
4436 enum tree_code subcode
= resultcode
;
4437 tree int_type
= TREE_TYPE (intop
);
4438 if (TREE_CODE (intop
) == MINUS_EXPR
)
4439 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
4440 /* Convert both subexpression types to the type of intop,
4441 because weird cases involving pointer arithmetic
4442 can result in a sum or difference with different type args. */
4443 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
4445 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
4446 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
4449 /* Convert the integer argument to a type the same size as sizetype
4450 so the multiply won't overflow spuriously. */
4451 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
4452 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
4453 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
4454 TYPE_UNSIGNED (sizetype
)), intop
);
4456 /* Replace the integer argument with a suitable product by the object size.
4457 Do this multiplication as signed, then convert to the appropriate type
4458 for the pointer operation and disregard an overflow that occurred only
4459 because of the sign-extension change in the latter conversion. */
4461 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
4462 convert (TREE_TYPE (intop
), size_exp
));
4463 intop
= convert (sizetype
, t
);
4464 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
4465 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
4468 /* Create the sum or difference. */
4469 if (resultcode
== MINUS_EXPR
)
4470 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
4472 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
4474 fold_undefer_and_ignore_overflow_warnings ();
4479 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4480 and if NON_CONST is known not to be permitted in an evaluated part
4481 of a constant expression. */
4484 c_wrap_maybe_const (tree expr
, bool non_const
)
4486 bool nowarning
= TREE_NO_WARNING (expr
);
4487 location_t loc
= EXPR_LOCATION (expr
);
4489 /* This should never be called for C++. */
4490 if (c_dialect_cxx ())
4493 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4494 STRIP_TYPE_NOPS (expr
);
4495 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
4496 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
4498 TREE_NO_WARNING (expr
) = 1;
4499 protected_set_expr_location (expr
, loc
);
4504 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4505 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4506 around the SAVE_EXPR if needed so that c_fully_fold does not need
4507 to look inside SAVE_EXPRs. */
4510 c_save_expr (tree expr
)
4512 bool maybe_const
= true;
4513 if (c_dialect_cxx ())
4514 return save_expr (expr
);
4515 expr
= c_fully_fold (expr
, false, &maybe_const
);
4516 expr
= save_expr (expr
);
4518 expr
= c_wrap_maybe_const (expr
, true);
4522 /* Return whether EXPR is a declaration whose address can never be
4526 decl_with_nonnull_addr_p (const_tree expr
)
4528 return (DECL_P (expr
)
4529 && (TREE_CODE (expr
) == PARM_DECL
4530 || TREE_CODE (expr
) == LABEL_DECL
4531 || !DECL_WEAK (expr
)));
4534 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4535 or for an `if' or `while' statement or ?..: exp. It should already
4536 have been validated to be of suitable type; otherwise, a bad
4537 diagnostic may result.
4539 The EXPR is located at LOCATION.
4541 This preparation consists of taking the ordinary
4542 representation of an expression expr and producing a valid tree
4543 boolean expression describing whether expr is nonzero. We could
4544 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4545 but we optimize comparisons, &&, ||, and !.
4547 The resulting type should always be `truthvalue_type_node'. */
4550 c_common_truthvalue_conversion (location_t location
, tree expr
)
4552 switch (TREE_CODE (expr
))
4554 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
4555 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
4556 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
4557 case ORDERED_EXPR
: case UNORDERED_EXPR
:
4558 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4560 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4561 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
4564 case TRUTH_ANDIF_EXPR
:
4565 case TRUTH_ORIF_EXPR
:
4566 case TRUTH_AND_EXPR
:
4568 case TRUTH_XOR_EXPR
:
4569 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4571 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4572 c_common_truthvalue_conversion (location
,
4573 TREE_OPERAND (expr
, 0)),
4574 c_common_truthvalue_conversion (location
,
4575 TREE_OPERAND (expr
, 1)));
4578 case TRUTH_NOT_EXPR
:
4579 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4581 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
4582 c_common_truthvalue_conversion (location
,
4583 TREE_OPERAND (expr
, 0)));
4590 return integer_zerop (expr
) ? truthvalue_false_node
4591 : truthvalue_true_node
;
4594 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
4595 ? truthvalue_true_node
4596 : truthvalue_false_node
;
4599 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
4600 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
4601 ? truthvalue_true_node
4602 : truthvalue_false_node
;
4605 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
4610 tree inner
= TREE_OPERAND (expr
, 0);
4611 if (decl_with_nonnull_addr_p (inner
))
4613 /* Common Ada/Pascal programmer's mistake. */
4614 warning_at (location
,
4616 "the address of %qD will always evaluate as %<true%>",
4618 return truthvalue_true_node
;
4624 expr
= build_binary_op (EXPR_LOCATION (expr
),
4625 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
4626 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4627 c_common_truthvalue_conversion (location
,
4628 TREE_OPERAND (expr
, 0)),
4629 c_common_truthvalue_conversion (location
,
4630 TREE_OPERAND (expr
, 1)),
4637 case EXCESS_PRECISION_EXPR
:
4638 /* These don't change whether an object is nonzero or zero. */
4639 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
4643 /* These don't change whether an object is zero or nonzero, but
4644 we can't ignore them if their second arg has side-effects. */
4645 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
4647 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
4648 TREE_OPERAND (expr
, 1),
4649 c_common_truthvalue_conversion
4650 (location
, TREE_OPERAND (expr
, 0)));
4654 return c_common_truthvalue_conversion (location
,
4655 TREE_OPERAND (expr
, 0));
4658 /* Distribute the conversion into the arms of a COND_EXPR. */
4659 if (c_dialect_cxx ())
4661 tree op1
= TREE_OPERAND (expr
, 1);
4662 tree op2
= TREE_OPERAND (expr
, 2);
4663 /* In C++ one of the arms might have void type if it is throw. */
4664 if (!VOID_TYPE_P (TREE_TYPE (op1
)))
4665 op1
= c_common_truthvalue_conversion (location
, op1
);
4666 if (!VOID_TYPE_P (TREE_TYPE (op2
)))
4667 op2
= c_common_truthvalue_conversion (location
, op2
);
4668 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4669 TREE_OPERAND (expr
, 0), op1
, op2
);
4674 /* Folding will happen later for C. */
4675 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4676 TREE_OPERAND (expr
, 0),
4677 c_common_truthvalue_conversion (location
,
4678 TREE_OPERAND (expr
, 1)),
4679 c_common_truthvalue_conversion (location
,
4680 TREE_OPERAND (expr
, 2)));
4686 tree totype
= TREE_TYPE (expr
);
4687 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
4689 if (POINTER_TYPE_P (totype
)
4690 && !c_inhibit_evaluation_warnings
4691 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4697 warning_at (location
,
4699 "the compiler can assume that the address of "
4700 "%qD will always evaluate to %<true%>",
4704 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4705 since that affects how `default_conversion' will behave. */
4706 if (TREE_CODE (totype
) == REFERENCE_TYPE
4707 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4709 /* Don't strip a conversion from C++0x scoped enum, since they
4710 don't implicitly convert to other types. */
4711 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
4712 && ENUM_IS_SCOPED (fromtype
))
4714 /* If this isn't narrowing the argument, we can ignore it. */
4715 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
4716 return c_common_truthvalue_conversion (location
,
4717 TREE_OPERAND (expr
, 0));
4722 if (!TREE_NO_WARNING (expr
)
4723 && warn_parentheses
)
4725 warning_at (location
, OPT_Wparentheses
,
4726 "suggest parentheses around assignment used as "
4728 TREE_NO_WARNING (expr
) = 1;
4736 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4738 tree t
= (in_late_binary_op
? save_expr (expr
) : c_save_expr (expr
));
4739 expr
= (build_binary_op
4740 (EXPR_LOCATION (expr
),
4741 (TREE_SIDE_EFFECTS (expr
)
4742 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4743 c_common_truthvalue_conversion
4745 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
4746 c_common_truthvalue_conversion
4748 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
4753 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4755 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4757 (TREE_TYPE (expr
))));
4758 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4761 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4764 protected_set_expr_location (expr
, location
);
4768 static void def_builtin_1 (enum built_in_function fncode
,
4770 enum built_in_class fnclass
,
4771 tree fntype
, tree libtype
,
4772 bool both_p
, bool fallback_p
, bool nonansi_p
,
4773 tree fnattrs
, bool implicit_p
);
4776 /* Apply the TYPE_QUALS to the new DECL. */
4779 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4781 tree type
= TREE_TYPE (decl
);
4783 if (type
== error_mark_node
)
4786 if ((type_quals
& TYPE_QUAL_CONST
)
4787 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4788 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4789 constructor can produce constant init, so rely on cp_finish_decl to
4790 clear TREE_READONLY if the variable has non-constant init. */
4791 TREE_READONLY (decl
) = 1;
4792 if (type_quals
& TYPE_QUAL_VOLATILE
)
4794 TREE_SIDE_EFFECTS (decl
) = 1;
4795 TREE_THIS_VOLATILE (decl
) = 1;
4797 if (type_quals
& TYPE_QUAL_RESTRICT
)
4799 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4800 /* Allow 'restrict' on arrays of pointers.
4801 FIXME currently we just ignore it. */
4802 type
= TREE_TYPE (type
);
4804 || !POINTER_TYPE_P (type
)
4805 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4806 error ("invalid use of %<restrict%>");
4810 struct c_type_hasher
: ggc_ptr_hash
<tree_node
>
4812 static hashval_t
hash (tree
);
4813 static bool equal (tree
, tree
);
4816 /* Hash function for the problem of multiple type definitions in
4817 different files. This must hash all types that will compare
4818 equal via comptypes to the same value. In practice it hashes
4819 on some of the simple stuff and leaves the details to comptypes. */
4822 c_type_hasher::hash (tree t
)
4827 switch (TREE_CODE (t
))
4829 /* For pointers, hash on pointee type plus some swizzling. */
4831 return hash (TREE_TYPE (t
)) ^ 0x3003003;
4832 /* Hash on number of elements and total size. */
4835 t2
= TYPE_VALUES (t
);
4839 t2
= TYPE_FIELDS (t
);
4841 case QUAL_UNION_TYPE
:
4843 t2
= TYPE_FIELDS (t
);
4847 t2
= TYPE_FIELDS (t
);
4852 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4853 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4854 n_elements
= list_length (t2
);
4855 /* We might have a VLA here. */
4856 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4859 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4860 return ((size
<< 24) | (n_elements
<< shift
));
4864 c_type_hasher::equal (tree t1
, tree t2
)
4866 return lang_hooks
.types_compatible_p (t1
, t2
);
4869 static GTY(()) hash_table
<c_type_hasher
> *type_hash_table
;
4871 /* Return the typed-based alias set for T, which may be an expression
4872 or a type. Return -1 if we don't do anything special. */
4875 c_common_get_alias_set (tree t
)
4877 /* For VLAs, use the alias set of the element type rather than the
4878 default of alias set 0 for types compared structurally. */
4879 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4881 if (TREE_CODE (t
) == ARRAY_TYPE
)
4882 return get_alias_set (TREE_TYPE (t
));
4886 /* That's all the expressions we handle specially. */
4890 /* The C standard guarantees that any object may be accessed via an
4891 lvalue that has character type. */
4892 if (t
== char_type_node
4893 || t
== signed_char_type_node
4894 || t
== unsigned_char_type_node
)
4897 /* The C standard specifically allows aliasing between signed and
4898 unsigned variants of the same type. We treat the signed
4899 variant as canonical. */
4900 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4902 tree t1
= c_common_signed_type (t
);
4904 /* t1 == t can happen for boolean nodes which are always unsigned. */
4906 return get_alias_set (t1
);
4909 /* Handle the case of multiple type nodes referring to "the same" type,
4910 which occurs with IMA. These share an alias set. FIXME: Currently only
4911 C90 is handled. (In C99 type compatibility is not transitive, which
4912 complicates things mightily. The alias set splay trees can theoretically
4913 represent this, but insertion is tricky when you consider all the
4914 different orders things might arrive in.) */
4916 if (c_language
!= clk_c
|| flag_isoc99
)
4919 /* Save time if there's only one input file. */
4920 if (num_in_fnames
== 1)
4923 /* Pointers need special handling if they point to any type that
4924 needs special handling (below). */
4925 if (TREE_CODE (t
) == POINTER_TYPE
)
4928 /* Find bottom type under any nested POINTERs. */
4929 for (t2
= TREE_TYPE (t
);
4930 TREE_CODE (t2
) == POINTER_TYPE
;
4931 t2
= TREE_TYPE (t2
))
4933 if (!RECORD_OR_UNION_TYPE_P (t2
)
4934 && TREE_CODE (t2
) != ENUMERAL_TYPE
)
4936 if (TYPE_SIZE (t2
) == 0)
4939 /* These are the only cases that need special handling. */
4940 if (!RECORD_OR_UNION_TYPE_P (t
)
4941 && TREE_CODE (t
) != ENUMERAL_TYPE
4942 && TREE_CODE (t
) != POINTER_TYPE
)
4945 if (TYPE_SIZE (t
) == 0)
4948 /* Look up t in hash table. Only one of the compatible types within each
4949 alias set is recorded in the table. */
4950 if (!type_hash_table
)
4951 type_hash_table
= hash_table
<c_type_hasher
>::create_ggc (1021);
4952 tree
*slot
= type_hash_table
->find_slot (t
, INSERT
);
4955 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4956 return TYPE_ALIAS_SET ((tree
)*slot
);
4959 /* Our caller will assign and record (in t) a new alias set; all we need
4960 to do is remember t in the hash table. */
4966 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4967 the IS_SIZEOF parameter indicates which operator is being applied.
4968 The COMPLAIN flag controls whether we should diagnose possibly
4969 ill-formed constructs or not. LOC is the location of the SIZEOF or
4970 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4971 a type in any context should be returned, rather than the normal
4972 alignment for that type. */
4975 c_sizeof_or_alignof_type (location_t loc
,
4976 tree type
, bool is_sizeof
, bool min_alignof
,
4979 const char *op_name
;
4981 enum tree_code type_code
= TREE_CODE (type
);
4983 op_name
= is_sizeof
? "sizeof" : "__alignof__";
4985 if (type_code
== FUNCTION_TYPE
)
4989 if (complain
&& warn_pointer_arith
)
4990 pedwarn (loc
, OPT_Wpointer_arith
,
4991 "invalid application of %<sizeof%> to a function type");
4993 return error_mark_node
;
4994 value
= size_one_node
;
5000 if (c_dialect_cxx ())
5001 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
5002 "%<alignof%> applied to a function type");
5004 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
5005 "%<_Alignof%> applied to a function type");
5007 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
5010 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
5012 if (type_code
== VOID_TYPE
5013 && complain
&& warn_pointer_arith
)
5014 pedwarn (loc
, OPT_Wpointer_arith
,
5015 "invalid application of %qs to a void type", op_name
);
5017 return error_mark_node
;
5018 value
= size_one_node
;
5020 else if (!COMPLETE_TYPE_P (type
)
5021 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
5024 error_at (loc
, "invalid application of %qs to incomplete type %qT",
5026 return error_mark_node
;
5028 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
5029 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
5032 error_at (loc
, "invalid application of %qs to array type %qT of "
5033 "incomplete element type", op_name
, type
);
5034 return error_mark_node
;
5039 /* Convert in case a char is more than one unit. */
5040 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
5041 size_int (TYPE_PRECISION (char_type_node
)
5043 else if (min_alignof
)
5044 value
= size_int (min_align_of_type (type
));
5046 value
= size_int (TYPE_ALIGN_UNIT (type
));
5049 /* VALUE will have the middle-end integer type sizetype.
5050 However, we should really return a value of type `size_t',
5051 which is just a typedef for an ordinary integer type. */
5052 value
= fold_convert_loc (loc
, size_type_node
, value
);
5057 /* Implement the __alignof keyword: Return the minimum required
5058 alignment of EXPR, measured in bytes. For VAR_DECLs,
5059 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5060 from an "aligned" __attribute__ specification). LOC is the
5061 location of the ALIGNOF operator. */
5064 c_alignof_expr (location_t loc
, tree expr
)
5068 if (VAR_OR_FUNCTION_DECL_P (expr
))
5069 t
= size_int (DECL_ALIGN_UNIT (expr
));
5071 else if (TREE_CODE (expr
) == COMPONENT_REF
5072 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
5074 error_at (loc
, "%<__alignof%> applied to a bit-field");
5077 else if (TREE_CODE (expr
) == COMPONENT_REF
5078 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
5079 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
5081 else if (INDIRECT_REF_P (expr
))
5083 tree t
= TREE_OPERAND (expr
, 0);
5085 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5087 while (CONVERT_EXPR_P (t
)
5088 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
5092 t
= TREE_OPERAND (t
, 0);
5093 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5094 if (thisalign
> bestalign
)
5095 best
= t
, bestalign
= thisalign
;
5097 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
5100 return c_alignof (loc
, TREE_TYPE (expr
));
5102 return fold_convert_loc (loc
, size_type_node
, t
);
5105 /* Handle C and C++ default attributes. */
5107 enum built_in_attribute
5109 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5110 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5111 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5112 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5113 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5114 #include "builtin-attrs.def"
5115 #undef DEF_ATTR_NULL_TREE
5117 #undef DEF_ATTR_STRING
5118 #undef DEF_ATTR_IDENT
5119 #undef DEF_ATTR_TREE_LIST
5123 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
5125 static void c_init_attributes (void);
5129 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5130 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5131 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5132 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5133 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5134 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5135 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5136 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5138 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5140 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5141 ARG6, ARG7, ARG8) NAME,
5142 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5143 ARG6, ARG7, ARG8, ARG9) NAME,
5144 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5145 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5146 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5147 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5148 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5149 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5150 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5151 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5152 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5153 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5155 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5157 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5159 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5160 #include "builtin-types.def"
5161 #undef DEF_PRIMITIVE_TYPE
5162 #undef DEF_FUNCTION_TYPE_0
5163 #undef DEF_FUNCTION_TYPE_1
5164 #undef DEF_FUNCTION_TYPE_2
5165 #undef DEF_FUNCTION_TYPE_3
5166 #undef DEF_FUNCTION_TYPE_4
5167 #undef DEF_FUNCTION_TYPE_5
5168 #undef DEF_FUNCTION_TYPE_6
5169 #undef DEF_FUNCTION_TYPE_7
5170 #undef DEF_FUNCTION_TYPE_8
5171 #undef DEF_FUNCTION_TYPE_9
5172 #undef DEF_FUNCTION_TYPE_10
5173 #undef DEF_FUNCTION_TYPE_11
5174 #undef DEF_FUNCTION_TYPE_VAR_0
5175 #undef DEF_FUNCTION_TYPE_VAR_1
5176 #undef DEF_FUNCTION_TYPE_VAR_2
5177 #undef DEF_FUNCTION_TYPE_VAR_3
5178 #undef DEF_FUNCTION_TYPE_VAR_4
5179 #undef DEF_FUNCTION_TYPE_VAR_5
5180 #undef DEF_FUNCTION_TYPE_VAR_6
5181 #undef DEF_FUNCTION_TYPE_VAR_7
5182 #undef DEF_POINTER_TYPE
5186 typedef enum c_builtin_type builtin_type
;
5188 /* A temporary array for c_common_nodes_and_builtins. Used in
5189 communication with def_fn_type. */
5190 static tree builtin_types
[(int) BT_LAST
+ 1];
5192 /* A helper function for c_common_nodes_and_builtins. Build function type
5193 for DEF with return type RET and N arguments. If VAR is true, then the
5194 function should be variadic after those N arguments.
5196 Takes special care not to ICE if any of the types involved are
5197 error_mark_node, which indicates that said type is not in fact available
5198 (see builtin_type_for_size). In which case the function type as a whole
5199 should be error_mark_node. */
5202 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
5205 tree
*args
= XALLOCAVEC (tree
, n
);
5210 for (i
= 0; i
< n
; ++i
)
5212 builtin_type a
= (builtin_type
) va_arg (list
, int);
5213 t
= builtin_types
[a
];
5214 if (t
== error_mark_node
)
5219 t
= builtin_types
[ret
];
5220 if (t
== error_mark_node
)
5223 t
= build_varargs_function_type_array (t
, n
, args
);
5225 t
= build_function_type_array (t
, n
, args
);
5228 builtin_types
[def
] = t
;
5232 /* Build builtin functions common to both C and C++ language
5236 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
5238 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5239 builtin_types[ENUM] = VALUE;
5240 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5241 def_fn_type (ENUM, RETURN, 0, 0);
5242 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5243 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5244 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5245 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5246 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5247 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5248 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5249 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5250 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5251 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5252 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5254 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5255 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5257 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5258 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5260 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5262 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5263 ARG6, ARG7, ARG8, ARG9) \
5264 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5266 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5267 ARG6, ARG7, ARG8, ARG9, ARG10) \
5268 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5269 ARG7, ARG8, ARG9, ARG10);
5270 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5271 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5272 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5273 ARG7, ARG8, ARG9, ARG10, ARG11);
5274 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5275 def_fn_type (ENUM, RETURN, 1, 0);
5276 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5277 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5278 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5279 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5280 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5281 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5282 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5283 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5284 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5285 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5286 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5288 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5289 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5291 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5292 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5293 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5295 #include "builtin-types.def"
5297 #undef DEF_PRIMITIVE_TYPE
5298 #undef DEF_FUNCTION_TYPE_0
5299 #undef DEF_FUNCTION_TYPE_1
5300 #undef DEF_FUNCTION_TYPE_2
5301 #undef DEF_FUNCTION_TYPE_3
5302 #undef DEF_FUNCTION_TYPE_4
5303 #undef DEF_FUNCTION_TYPE_5
5304 #undef DEF_FUNCTION_TYPE_6
5305 #undef DEF_FUNCTION_TYPE_7
5306 #undef DEF_FUNCTION_TYPE_8
5307 #undef DEF_FUNCTION_TYPE_9
5308 #undef DEF_FUNCTION_TYPE_10
5309 #undef DEF_FUNCTION_TYPE_11
5310 #undef DEF_FUNCTION_TYPE_VAR_0
5311 #undef DEF_FUNCTION_TYPE_VAR_1
5312 #undef DEF_FUNCTION_TYPE_VAR_2
5313 #undef DEF_FUNCTION_TYPE_VAR_3
5314 #undef DEF_FUNCTION_TYPE_VAR_4
5315 #undef DEF_FUNCTION_TYPE_VAR_5
5316 #undef DEF_FUNCTION_TYPE_VAR_6
5317 #undef DEF_FUNCTION_TYPE_VAR_7
5318 #undef DEF_POINTER_TYPE
5319 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
5321 c_init_attributes ();
5323 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5324 NONANSI_P, ATTRS, IMPLICIT, COND) \
5326 def_builtin_1 (ENUM, NAME, CLASS, \
5327 builtin_types[(int) TYPE], \
5328 builtin_types[(int) LIBTYPE], \
5329 BOTH_P, FALLBACK_P, NONANSI_P, \
5330 built_in_attributes[(int) ATTRS], IMPLICIT);
5331 #include "builtins.def"
5333 targetm
.init_builtins ();
5335 build_common_builtin_nodes ();
5338 cilk_init_builtins ();
5341 /* Like get_identifier, but avoid warnings about null arguments when
5342 the argument may be NULL for targets where GCC lacks stdint.h type
5346 c_get_ident (const char *id
)
5348 return get_identifier (id
);
5351 /* Build tree nodes and builtin functions common to both C and C++ language
5355 c_common_nodes_and_builtins (void)
5357 int char16_type_size
;
5358 int char32_type_size
;
5359 int wchar_type_size
;
5360 tree array_domain_type
;
5361 tree va_list_ref_type_node
;
5362 tree va_list_arg_type_node
;
5365 build_common_tree_nodes (flag_signed_char
);
5367 /* Define `int' and `char' first so that dbx will output them first. */
5368 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
5369 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5371 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5372 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5373 but not C. Are the conditionals here needed? */
5374 if (c_dialect_cxx ())
5375 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
5376 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5377 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5378 record_builtin_type (RID_MAX
, "long unsigned int",
5379 long_unsigned_type_node
);
5381 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
5385 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
5386 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
5387 int_n_trees
[i
].signed_type
);
5388 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
5389 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
5392 if (c_dialect_cxx ())
5393 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5394 record_builtin_type (RID_MAX
, "long long int",
5395 long_long_integer_type_node
);
5396 record_builtin_type (RID_MAX
, "long long unsigned int",
5397 long_long_unsigned_type_node
);
5398 if (c_dialect_cxx ())
5399 record_builtin_type (RID_MAX
, "long long unsigned",
5400 long_long_unsigned_type_node
);
5401 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5402 record_builtin_type (RID_MAX
, "short unsigned int",
5403 short_unsigned_type_node
);
5404 if (c_dialect_cxx ())
5405 record_builtin_type (RID_MAX
, "unsigned short",
5406 short_unsigned_type_node
);
5408 /* Define both `signed char' and `unsigned char'. */
5409 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5410 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5412 /* These are types that c_common_type_for_size and
5413 c_common_type_for_mode use. */
5414 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5415 TYPE_DECL
, NULL_TREE
,
5417 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5418 TYPE_DECL
, NULL_TREE
,
5420 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5421 TYPE_DECL
, NULL_TREE
,
5423 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5424 TYPE_DECL
, NULL_TREE
,
5426 #if HOST_BITS_PER_WIDE_INT >= 64
5427 /* Note that this is different than the __int128 type that's part of
5428 the generic __intN support. */
5429 if (targetm
.scalar_mode_supported_p (TImode
))
5430 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5432 get_identifier ("__int128_t"),
5435 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5436 TYPE_DECL
, NULL_TREE
,
5437 unsigned_intQI_type_node
));
5438 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5439 TYPE_DECL
, NULL_TREE
,
5440 unsigned_intHI_type_node
));
5441 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5442 TYPE_DECL
, NULL_TREE
,
5443 unsigned_intSI_type_node
));
5444 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5445 TYPE_DECL
, NULL_TREE
,
5446 unsigned_intDI_type_node
));
5447 #if HOST_BITS_PER_WIDE_INT >= 64
5448 if (targetm
.scalar_mode_supported_p (TImode
))
5449 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5451 get_identifier ("__uint128_t"),
5452 unsigned_intTI_type_node
));
5455 /* Create the widest literal types. */
5456 widest_integer_literal_type_node
5457 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
5458 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5459 TYPE_DECL
, NULL_TREE
,
5460 widest_integer_literal_type_node
));
5462 widest_unsigned_literal_type_node
5463 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
5464 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5465 TYPE_DECL
, NULL_TREE
,
5466 widest_unsigned_literal_type_node
));
5468 signed_size_type_node
= c_common_signed_type (size_type_node
);
5471 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
5473 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
5474 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
5475 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5477 if (!c_dialect_cxx ())
5478 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5479 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5480 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
5481 FLOATN_NX_TYPE_NODE (i
));
5483 /* Only supported decimal floating point extension if the target
5484 actually supports underlying modes. */
5485 if (targetm
.scalar_mode_supported_p (SDmode
)
5486 && targetm
.scalar_mode_supported_p (DDmode
)
5487 && targetm
.scalar_mode_supported_p (TDmode
))
5489 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
5490 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
5491 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
5494 if (targetm
.fixed_point_supported_p ())
5496 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
5497 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
5498 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
5499 record_builtin_type (RID_MAX
, "long long _Fract",
5500 long_long_fract_type_node
);
5501 record_builtin_type (RID_MAX
, "unsigned short _Fract",
5502 unsigned_short_fract_type_node
);
5503 record_builtin_type (RID_MAX
, "unsigned _Fract",
5504 unsigned_fract_type_node
);
5505 record_builtin_type (RID_MAX
, "unsigned long _Fract",
5506 unsigned_long_fract_type_node
);
5507 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
5508 unsigned_long_long_fract_type_node
);
5509 record_builtin_type (RID_MAX
, "_Sat short _Fract",
5510 sat_short_fract_type_node
);
5511 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
5512 record_builtin_type (RID_MAX
, "_Sat long _Fract",
5513 sat_long_fract_type_node
);
5514 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
5515 sat_long_long_fract_type_node
);
5516 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
5517 sat_unsigned_short_fract_type_node
);
5518 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
5519 sat_unsigned_fract_type_node
);
5520 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
5521 sat_unsigned_long_fract_type_node
);
5522 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
5523 sat_unsigned_long_long_fract_type_node
);
5524 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
5525 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
5526 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
5527 record_builtin_type (RID_MAX
, "long long _Accum",
5528 long_long_accum_type_node
);
5529 record_builtin_type (RID_MAX
, "unsigned short _Accum",
5530 unsigned_short_accum_type_node
);
5531 record_builtin_type (RID_MAX
, "unsigned _Accum",
5532 unsigned_accum_type_node
);
5533 record_builtin_type (RID_MAX
, "unsigned long _Accum",
5534 unsigned_long_accum_type_node
);
5535 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
5536 unsigned_long_long_accum_type_node
);
5537 record_builtin_type (RID_MAX
, "_Sat short _Accum",
5538 sat_short_accum_type_node
);
5539 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
5540 record_builtin_type (RID_MAX
, "_Sat long _Accum",
5541 sat_long_accum_type_node
);
5542 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
5543 sat_long_long_accum_type_node
);
5544 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
5545 sat_unsigned_short_accum_type_node
);
5546 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
5547 sat_unsigned_accum_type_node
);
5548 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
5549 sat_unsigned_long_accum_type_node
);
5550 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
5551 sat_unsigned_long_long_accum_type_node
);
5555 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5557 get_identifier ("complex int"),
5558 complex_integer_type_node
));
5559 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5561 get_identifier ("complex float"),
5562 complex_float_type_node
));
5563 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5565 get_identifier ("complex double"),
5566 complex_double_type_node
));
5567 lang_hooks
.decls
.pushdecl
5568 (build_decl (UNKNOWN_LOCATION
,
5569 TYPE_DECL
, get_identifier ("complex long double"),
5570 complex_long_double_type_node
));
5572 if (!c_dialect_cxx ())
5573 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5574 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5577 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
5578 floatn_nx_types
[i
].extended
? "x" : "");
5579 lang_hooks
.decls
.pushdecl
5580 (build_decl (UNKNOWN_LOCATION
,
5582 get_identifier (buf
),
5583 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
5586 if (c_dialect_cxx ())
5587 /* For C++, make fileptr_type_node a distinct void * type until
5588 FILE type is defined. */
5589 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
5591 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
5593 /* Set the TYPE_NAME for any variants that were built before
5594 record_builtin_type gave names to the built-in types. */
5596 tree void_name
= TYPE_NAME (void_type_node
);
5597 TYPE_NAME (void_type_node
) = NULL_TREE
;
5598 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
5600 TYPE_NAME (void_type_node
) = void_name
;
5603 void_list_node
= build_void_list_node ();
5605 /* Make a type to be the domain of a few array types
5606 whose domains don't really matter.
5607 200 is small enough that it always fits in size_t
5608 and large enough that it can hold most function names for the
5609 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5610 array_domain_type
= build_index_type (size_int (200));
5612 /* Make a type for arrays of characters.
5613 With luck nothing will ever really depend on the length of this
5615 char_array_type_node
5616 = build_array_type (char_type_node
, array_domain_type
);
5618 string_type_node
= build_pointer_type (char_type_node
);
5619 const_string_type_node
5620 = build_pointer_type (build_qualified_type
5621 (char_type_node
, TYPE_QUAL_CONST
));
5623 /* This is special for C++ so functions can be overloaded. */
5624 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
5625 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
5626 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
5627 underlying_wchar_type_node
= wchar_type_node
;
5628 if (c_dialect_cxx ())
5630 if (TYPE_UNSIGNED (wchar_type_node
))
5631 wchar_type_node
= make_unsigned_type (wchar_type_size
);
5633 wchar_type_node
= make_signed_type (wchar_type_size
);
5634 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
5637 /* This is for wide string constants. */
5638 wchar_array_type_node
5639 = build_array_type (wchar_type_node
, array_domain_type
);
5641 /* Define 'char16_t'. */
5642 char16_type_node
= get_identifier (CHAR16_TYPE
);
5643 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
5644 char16_type_size
= TYPE_PRECISION (char16_type_node
);
5645 if (c_dialect_cxx ())
5647 char16_type_node
= make_unsigned_type (char16_type_size
);
5649 if (cxx_dialect
>= cxx11
)
5650 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
5653 /* This is for UTF-16 string constants. */
5654 char16_array_type_node
5655 = build_array_type (char16_type_node
, array_domain_type
);
5657 /* Define 'char32_t'. */
5658 char32_type_node
= get_identifier (CHAR32_TYPE
);
5659 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
5660 char32_type_size
= TYPE_PRECISION (char32_type_node
);
5661 if (c_dialect_cxx ())
5663 char32_type_node
= make_unsigned_type (char32_type_size
);
5665 if (cxx_dialect
>= cxx11
)
5666 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
5669 /* This is for UTF-32 string constants. */
5670 char32_array_type_node
5671 = build_array_type (char32_type_node
, array_domain_type
);
5674 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
5677 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
5679 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
5681 if (SIG_ATOMIC_TYPE
)
5682 sig_atomic_type_node
=
5683 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
5686 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
5689 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
5692 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
5695 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
5698 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
5700 c_uint16_type_node
= uint16_type_node
=
5701 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
5703 c_uint32_type_node
= uint32_type_node
=
5704 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
5706 c_uint64_type_node
= uint64_type_node
=
5707 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
5708 if (INT_LEAST8_TYPE
)
5709 int_least8_type_node
=
5710 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
5711 if (INT_LEAST16_TYPE
)
5712 int_least16_type_node
=
5713 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
5714 if (INT_LEAST32_TYPE
)
5715 int_least32_type_node
=
5716 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
5717 if (INT_LEAST64_TYPE
)
5718 int_least64_type_node
=
5719 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
5720 if (UINT_LEAST8_TYPE
)
5721 uint_least8_type_node
=
5722 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
5723 if (UINT_LEAST16_TYPE
)
5724 uint_least16_type_node
=
5725 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
5726 if (UINT_LEAST32_TYPE
)
5727 uint_least32_type_node
=
5728 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
5729 if (UINT_LEAST64_TYPE
)
5730 uint_least64_type_node
=
5731 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
5733 int_fast8_type_node
=
5734 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
5735 if (INT_FAST16_TYPE
)
5736 int_fast16_type_node
=
5737 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
5738 if (INT_FAST32_TYPE
)
5739 int_fast32_type_node
=
5740 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
5741 if (INT_FAST64_TYPE
)
5742 int_fast64_type_node
=
5743 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
5744 if (UINT_FAST8_TYPE
)
5745 uint_fast8_type_node
=
5746 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
5747 if (UINT_FAST16_TYPE
)
5748 uint_fast16_type_node
=
5749 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
5750 if (UINT_FAST32_TYPE
)
5751 uint_fast32_type_node
=
5752 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5753 if (UINT_FAST64_TYPE
)
5754 uint_fast64_type_node
=
5755 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5758 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5761 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5763 default_function_type
5764 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
5766 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5767 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5769 lang_hooks
.decls
.pushdecl
5770 (build_decl (UNKNOWN_LOCATION
,
5771 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5772 va_list_type_node
));
5773 if (targetm
.enum_va_list_p
)
5779 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
5781 lang_hooks
.decls
.pushdecl
5782 (build_decl (UNKNOWN_LOCATION
,
5783 TYPE_DECL
, get_identifier (pname
),
5789 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5791 va_list_arg_type_node
= va_list_ref_type_node
=
5792 build_pointer_type (TREE_TYPE (va_list_type_node
));
5796 va_list_arg_type_node
= va_list_type_node
;
5797 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5800 if (!flag_preprocess_only
)
5801 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5803 main_identifier_node
= get_identifier ("main");
5805 /* Create the built-in __null node. It is important that this is
5807 null_node
= make_int_cst (1, 1);
5808 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5810 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5811 memset (builtin_types
, 0, sizeof (builtin_types
));
5814 /* The number of named compound-literals generated thus far. */
5815 static GTY(()) int compound_literal_number
;
5817 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5820 set_compound_literal_name (tree decl
)
5823 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5824 compound_literal_number
);
5825 compound_literal_number
++;
5826 DECL_NAME (decl
) = get_identifier (name
);
5829 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5830 TYPE and operand OP. */
5833 build_va_arg_1 (location_t loc
, tree type
, tree op
)
5835 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
5836 SET_EXPR_LOCATION (expr
, loc
);
5840 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5841 va_arg (EXPR, TYPE) at source location LOC. */
5844 build_va_arg (location_t loc
, tree expr
, tree type
)
5846 tree va_type
= TREE_TYPE (expr
);
5847 tree canon_va_type
= (va_type
== error_mark_node
5849 : targetm
.canonical_va_list_type (va_type
));
5851 if (va_type
== error_mark_node
5852 || canon_va_type
== NULL_TREE
)
5854 if (canon_va_type
== NULL_TREE
)
5855 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
5857 /* Let's handle things neutrallly, if expr:
5858 - has undeclared type, or
5859 - is not an va_list type. */
5860 return build_va_arg_1 (loc
, type
, error_mark_node
);
5863 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
5865 /* Case 1: Not an array type. */
5867 /* Take the address, to get '&ap'. */
5868 mark_addressable (expr
);
5869 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
5871 /* Verify that &ap is still recognized as having va_list type. */
5872 tree canon_expr_type
5873 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
5874 if (canon_expr_type
== NULL_TREE
)
5877 "first argument to %<va_arg%> not of type %<va_list%>");
5878 return error_mark_node
;
5881 return build_va_arg_1 (loc
, type
, expr
);
5884 /* Case 2: Array type.
5888 For contrast, let's start with the simple case (case 1). If
5889 canon_va_type is not an array type, but say a char *, then when
5890 passing-by-value a va_list, the type of the va_list param decl is
5891 the same as for another va_list decl (all ap's are char *):
5894 D.1815 = VA_ARG (&ap, 0B, 1);
5900 __builtin_va_start (&ap, 0);
5903 __builtin_va_end (&ap);
5907 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5908 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5909 the same as for another va_list decl (case 2a, struct ap[1]).
5912 D.1844 = VA_ARG (ap, 0B, 0);
5917 __builtin_va_start (&ap, 0);
5919 __builtin_va_end (&ap);
5923 Case 2b is different because:
5924 - on the callee side, the parm decl has declared type va_list, but
5925 grokdeclarator changes the type of the parm decl to a pointer to the
5927 - on the caller side, the pass-by-value uses &ap.
5929 We unify these two cases (case 2a: va_list is array type,
5930 case 2b: va_list is pointer to array elem type), by adding '&' for the
5931 array type case, such that we have a pointer to array elem in both
5934 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
5936 /* Case 2a: va_list is array type. */
5938 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5940 mark_addressable (expr
);
5941 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
5944 /* Verify that &ap is still recognized as having va_list type. */
5945 tree canon_expr_type
5946 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
5947 if (canon_expr_type
== NULL_TREE
)
5950 "first argument to %<va_arg%> not of type %<va_list%>");
5951 return error_mark_node
;
5956 /* Case 2b: va_list is pointer to array elem type. */
5957 gcc_assert (POINTER_TYPE_P (va_type
));
5959 /* Comparison as in std_canonical_va_list_type. */
5960 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
5961 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
5963 /* Don't take the address. We've already got '&ap'. */
5967 return build_va_arg_1 (loc
, type
, expr
);
5971 /* Linked list of disabled built-in functions. */
5973 struct disabled_builtin
5976 struct disabled_builtin
*next
;
5978 static disabled_builtin
*disabled_builtins
= NULL
;
5980 static bool builtin_function_disabled_p (const char *);
5982 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5983 begins with "__builtin_", give an error. */
5986 disable_builtin_function (const char *name
)
5988 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5989 error ("cannot disable built-in function %qs", name
);
5992 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5993 new_disabled_builtin
->name
= name
;
5994 new_disabled_builtin
->next
= disabled_builtins
;
5995 disabled_builtins
= new_disabled_builtin
;
6000 /* Return true if the built-in function NAME has been disabled, false
6004 builtin_function_disabled_p (const char *name
)
6006 disabled_builtin
*p
;
6007 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
6009 if (strcmp (name
, p
->name
) == 0)
6016 /* Worker for DEF_BUILTIN.
6017 Possibly define a builtin function with one or two names.
6018 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6019 nonansi_p and flag_no_nonansi_builtin. */
6022 def_builtin_1 (enum built_in_function fncode
,
6024 enum built_in_class fnclass
,
6025 tree fntype
, tree libtype
,
6026 bool both_p
, bool fallback_p
, bool nonansi_p
,
6027 tree fnattrs
, bool implicit_p
)
6030 const char *libname
;
6032 if (fntype
== error_mark_node
)
6035 gcc_assert ((!both_p
&& !fallback_p
)
6036 || !strncmp (name
, "__builtin_",
6037 strlen ("__builtin_")));
6039 libname
= name
+ strlen ("__builtin_");
6040 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
6041 (fallback_p
? libname
: NULL
),
6044 set_builtin_decl (fncode
, decl
, implicit_p
);
6047 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
6048 && !(nonansi_p
&& flag_no_nonansi_builtin
))
6049 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
6053 /* Nonzero if the type T promotes to int. This is (nearly) the
6054 integral promotions defined in ISO C99 6.3.1.1/2. */
6057 c_promoting_integer_type_p (const_tree t
)
6059 switch (TREE_CODE (t
))
6062 return (TYPE_MAIN_VARIANT (t
) == char_type_node
6063 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
6064 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
6065 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
6066 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
6067 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
6070 /* ??? Technically all enumerations not larger than an int
6071 promote to an int. But this is used along code paths
6072 that only want to notice a size change. */
6073 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
6083 /* Return 1 if PARMS specifies a fixed number of parameters
6084 and none of their types is affected by default promotions. */
6087 self_promoting_args_p (const_tree parms
)
6090 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
6092 tree type
= TREE_VALUE (t
);
6094 if (type
== error_mark_node
)
6097 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
6103 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
6106 if (c_promoting_integer_type_p (type
))
6112 /* Recursively remove any '*' or '&' operator from TYPE. */
6114 strip_pointer_operator (tree t
)
6116 while (POINTER_TYPE_P (t
))
6121 /* Recursively remove pointer or array type from TYPE. */
6123 strip_pointer_or_array_types (tree t
)
6125 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
6130 /* Used to compare case labels. K1 and K2 are actually tree nodes
6131 representing case labels, or NULL_TREE for a `default' label.
6132 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6133 K2, and 0 if K1 and K2 are equal. */
6136 case_compare (splay_tree_key k1
, splay_tree_key k2
)
6138 /* Consider a NULL key (such as arises with a `default' label) to be
6139 smaller than anything else. */
6145 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
6148 /* Process a case label, located at LOC, for the range LOW_VALUE
6149 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6150 then this case label is actually a `default' label. If only
6151 HIGH_VALUE is NULL_TREE, then case label was declared using the
6152 usual C/C++ syntax, rather than the GNU case range extension.
6153 CASES is a tree containing all the case ranges processed so far;
6154 COND is the condition for the switch-statement itself.
6155 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6156 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6157 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6160 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
6161 tree low_value
, tree high_value
, bool *outside_range_p
)
6166 splay_tree_node node
;
6168 /* Create the LABEL_DECL itself. */
6169 label
= create_artificial_label (loc
);
6171 /* If there was an error processing the switch condition, bail now
6172 before we get more confused. */
6173 if (!cond
|| cond
== error_mark_node
)
6176 if ((low_value
&& TREE_TYPE (low_value
)
6177 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
6178 || (high_value
&& TREE_TYPE (high_value
)
6179 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
6181 error_at (loc
, "pointers are not permitted as case values");
6185 /* Case ranges are a GNU extension. */
6187 pedwarn (loc
, OPT_Wpedantic
,
6188 "range expressions in switch statements are non-standard");
6190 type
= TREE_TYPE (cond
);
6193 low_value
= check_case_value (loc
, low_value
);
6194 low_value
= convert_and_check (loc
, type
, low_value
);
6195 if (low_value
== error_mark_node
)
6200 high_value
= check_case_value (loc
, high_value
);
6201 high_value
= convert_and_check (loc
, type
, high_value
);
6202 if (high_value
== error_mark_node
)
6206 if (low_value
&& high_value
)
6208 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6209 really a case range, even though it was written that way.
6210 Remove the HIGH_VALUE to simplify later processing. */
6211 if (tree_int_cst_equal (low_value
, high_value
))
6212 high_value
= NULL_TREE
;
6213 else if (!tree_int_cst_lt (low_value
, high_value
))
6214 warning_at (loc
, 0, "empty range specified");
6217 /* See if the case is in range of the type of the original testing
6218 expression. If both low_value and high_value are out of range,
6219 don't insert the case label and return NULL_TREE. */
6221 && !check_case_bounds (loc
, type
, orig_type
,
6222 &low_value
, high_value
? &high_value
: NULL
,
6226 /* Look up the LOW_VALUE in the table of case labels we already
6228 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
6229 /* If there was not an exact match, check for overlapping ranges.
6230 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6231 that's a `default' label and the only overlap is an exact match. */
6232 if (!node
&& (low_value
|| high_value
))
6234 splay_tree_node low_bound
;
6235 splay_tree_node high_bound
;
6237 /* Even though there wasn't an exact match, there might be an
6238 overlap between this case range and another case range.
6239 Since we've (inductively) not allowed any overlapping case
6240 ranges, we simply need to find the greatest low case label
6241 that is smaller that LOW_VALUE, and the smallest low case
6242 label that is greater than LOW_VALUE. If there is an overlap
6243 it will occur in one of these two ranges. */
6244 low_bound
= splay_tree_predecessor (cases
,
6245 (splay_tree_key
) low_value
);
6246 high_bound
= splay_tree_successor (cases
,
6247 (splay_tree_key
) low_value
);
6249 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6250 the LOW_VALUE, so there is no need to check unless the
6251 LOW_BOUND is in fact itself a case range. */
6253 && CASE_HIGH ((tree
) low_bound
->value
)
6254 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
6257 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6258 range is bigger than the low end of the current range, so we
6259 are only interested if the current range is a real range, and
6260 not an ordinary case label. */
6263 && (tree_int_cst_compare ((tree
) high_bound
->key
,
6268 /* If there was an overlap, issue an error. */
6271 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
6275 error_at (loc
, "duplicate (or overlapping) case value");
6276 error_at (DECL_SOURCE_LOCATION (duplicate
),
6277 "this is the first entry overlapping that value");
6281 error_at (loc
, "duplicate case value") ;
6282 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
6286 error_at (loc
, "multiple default labels in one switch");
6287 error_at (DECL_SOURCE_LOCATION (duplicate
),
6288 "this is the first default label");
6293 /* Add a CASE_LABEL to the statement-tree. */
6294 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
6295 /* Register this case label in the splay tree. */
6296 splay_tree_insert (cases
,
6297 (splay_tree_key
) low_value
,
6298 (splay_tree_value
) case_label
);
6303 /* Add a label so that the back-end doesn't think that the beginning of
6304 the switch is unreachable. Note that we do not add a case label, as
6305 that just leads to duplicates and thence to failure later on. */
6308 tree t
= create_artificial_label (loc
);
6309 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
6311 return error_mark_node
;
6314 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6315 Used to verify that case values match up with enumerator values. */
6318 match_case_to_enum_1 (tree key
, tree type
, tree label
)
6320 char buf
[WIDE_INT_PRINT_BUFFER_SIZE
];
6322 if (tree_fits_uhwi_p (key
))
6323 print_dec (key
, buf
, UNSIGNED
);
6324 else if (tree_fits_shwi_p (key
))
6325 print_dec (key
, buf
, SIGNED
);
6327 print_hex (key
, buf
);
6329 if (TYPE_NAME (type
) == 0)
6330 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6331 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6332 "case value %qs not in enumerated type",
6335 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6336 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6337 "case value %qs not in enumerated type %qT",
6341 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6342 Used to verify that case values match up with enumerator values. */
6345 match_case_to_enum (splay_tree_node node
, void *data
)
6347 tree label
= (tree
) node
->value
;
6348 tree type
= (tree
) data
;
6350 /* Skip default case. */
6351 if (!CASE_LOW (label
))
6354 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6355 when we did our enum->case scan. Reset our scratch bit after. */
6356 if (!CASE_LOW_SEEN (label
))
6357 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
6359 CASE_LOW_SEEN (label
) = 0;
6361 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6362 not set, that means that CASE_HIGH did not appear when we did our
6363 enum->case scan. Reset our scratch bit after. */
6364 if (CASE_HIGH (label
))
6366 if (!CASE_HIGH_SEEN (label
))
6367 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
6369 CASE_HIGH_SEEN (label
) = 0;
6375 /* Handle -Wswitch*. Called from the front end after parsing the
6376 switch construct. */
6377 /* ??? Should probably be somewhere generic, since other languages
6378 besides C and C++ would want this. At the moment, however, C/C++
6379 are the only tree-ssa languages that support enumerations at all,
6380 so the point is moot. */
6383 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
6384 tree type
, tree cond
, bool bool_cond_p
,
6385 bool outside_range_p
)
6387 splay_tree_node default_node
;
6388 splay_tree_node node
;
6391 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
6392 && !warn_switch_bool
)
6395 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
6397 warning_at (switch_location
, OPT_Wswitch_default
,
6398 "switch missing default case");
6400 /* There are certain cases where -Wswitch-bool warnings aren't
6407 so be careful here. */
6408 if (warn_switch_bool
&& bool_cond_p
)
6410 splay_tree_node min_node
;
6411 /* If there's a default node, it's also the value with the minimal
6412 key. So look at the penultimate key (if any). */
6414 min_node
= splay_tree_successor (cases
, (splay_tree_key
) NULL
);
6416 min_node
= splay_tree_min (cases
);
6417 tree min
= min_node
? (tree
) min_node
->key
: NULL_TREE
;
6419 splay_tree_node max_node
= splay_tree_max (cases
);
6420 /* This might be a case range, so look at the value with the
6421 maximal key and then check CASE_HIGH. */
6422 tree max
= max_node
? (tree
) max_node
->value
: NULL_TREE
;
6424 max
= CASE_HIGH (max
) ? CASE_HIGH (max
) : CASE_LOW (max
);
6426 /* If there's a case value > 1 or < 0, that is outside bool
6429 || (max
&& wi::gts_p (max
, 1))
6430 || (min
&& wi::lts_p (min
, 0))
6438 case, where we want to warn. */
6440 && max
&& wi::eq_p (max
, 1)
6441 && min
&& wi::eq_p (min
, 0)))
6442 warning_at (switch_location
, OPT_Wswitch_bool
,
6443 "switch condition has boolean value");
6446 /* From here on, we only care about enumerated types. */
6447 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
6450 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6451 if (!warn_switch_enum
&& !warn_switch
)
6454 /* Check the cases. Warn about case values which are not members of
6455 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6456 there is no default case, check that exactly all enumeration
6457 literals are covered by the cases. */
6459 /* Clearing COND if it is not an integer constant simplifies
6460 the tests inside the loop below. */
6461 if (TREE_CODE (cond
) != INTEGER_CST
)
6464 /* The time complexity here is O(N*lg(N)) worst case, but for the
6465 common case of monotonically increasing enumerators, it is
6466 O(N), since the nature of the splay tree will keep the next
6467 element adjacent to the root at all times. */
6469 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
6471 tree value
= TREE_VALUE (chain
);
6472 if (TREE_CODE (value
) == CONST_DECL
)
6473 value
= DECL_INITIAL (value
);
6474 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
6477 /* Mark the CASE_LOW part of the case entry as seen. */
6478 tree label
= (tree
) node
->value
;
6479 CASE_LOW_SEEN (label
) = 1;
6483 /* Even though there wasn't an exact match, there might be a
6484 case range which includes the enumerator's value. */
6485 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
6486 if (node
&& CASE_HIGH ((tree
) node
->value
))
6488 tree label
= (tree
) node
->value
;
6489 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
6492 /* If we match the upper bound exactly, mark the CASE_HIGH
6493 part of the case entry as seen. */
6495 CASE_HIGH_SEEN (label
) = 1;
6500 /* We've now determined that this enumerated literal isn't
6501 handled by the case labels of the switch statement. */
6503 /* If the switch expression is a constant, we only really care
6504 about whether that constant is handled by the switch. */
6505 if (cond
&& tree_int_cst_compare (cond
, value
))
6508 /* If there is a default_node, the only relevant option is
6509 Wswitch-enum. Otherwise, if both are enabled then we prefer
6510 to warn using -Wswitch because -Wswitch is enabled by -Wall
6511 while -Wswitch-enum is explicit. */
6512 warning_at (switch_location
,
6513 (default_node
|| !warn_switch
6516 "enumeration value %qE not handled in switch",
6517 TREE_PURPOSE (chain
));
6520 /* Warn if there are case expressions that don't correspond to
6521 enumerators. This can occur since C and C++ don't enforce
6522 type-checking of assignments to enumeration variables.
6524 The time complexity here is now always O(N) worst case, since
6525 we should have marked both the lower bound and upper bound of
6526 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6527 above. This scan also resets those fields. */
6529 splay_tree_foreach (cases
, match_case_to_enum
, type
);
6532 /* Finish an expression taking the address of LABEL (an
6533 IDENTIFIER_NODE). Returns an expression for the address.
6535 LOC is the location for the expression returned. */
6538 finish_label_address_expr (tree label
, location_t loc
)
6542 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
6544 if (label
== error_mark_node
)
6545 return error_mark_node
;
6547 label
= lookup_label (label
);
6548 if (label
== NULL_TREE
)
6549 result
= null_pointer_node
;
6552 TREE_USED (label
) = 1;
6553 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
6554 /* The current function is not necessarily uninlinable.
6555 Computed gotos are incompatible with inlining, but the value
6556 here could be used only in a diagnostic, for example. */
6557 protected_set_expr_location (result
, loc
);
6564 /* Given a boolean expression ARG, return a tree representing an increment
6565 or decrement (as indicated by CODE) of ARG. The front end must check for
6566 invalid cases (e.g., decrement in C++). */
6568 boolean_increment (enum tree_code code
, tree arg
)
6571 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
6573 arg
= stabilize_reference (arg
);
6576 case PREINCREMENT_EXPR
:
6577 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6579 case POSTINCREMENT_EXPR
:
6580 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6581 arg
= save_expr (arg
);
6582 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6583 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6585 case PREDECREMENT_EXPR
:
6586 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6587 invert_truthvalue_loc (input_location
, arg
));
6589 case POSTDECREMENT_EXPR
:
6590 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6591 invert_truthvalue_loc (input_location
, arg
));
6592 arg
= save_expr (arg
);
6593 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6594 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6599 TREE_SIDE_EFFECTS (val
) = 1;
6603 /* Built-in macros for stddef.h and stdint.h, that require macros
6604 defined in this file. */
6606 c_stddef_cpp_builtins(void)
6608 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
6609 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
6610 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
6611 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
6612 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
6613 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
6614 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
6615 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
6616 if (SIG_ATOMIC_TYPE
)
6617 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
6619 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
6621 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
6623 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
6625 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
6627 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
6629 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
6631 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
6633 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
6634 if (INT_LEAST8_TYPE
)
6635 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
6636 if (INT_LEAST16_TYPE
)
6637 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
6638 if (INT_LEAST32_TYPE
)
6639 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
6640 if (INT_LEAST64_TYPE
)
6641 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
6642 if (UINT_LEAST8_TYPE
)
6643 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
6644 if (UINT_LEAST16_TYPE
)
6645 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
6646 if (UINT_LEAST32_TYPE
)
6647 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
6648 if (UINT_LEAST64_TYPE
)
6649 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
6651 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
6652 if (INT_FAST16_TYPE
)
6653 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
6654 if (INT_FAST32_TYPE
)
6655 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
6656 if (INT_FAST64_TYPE
)
6657 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
6658 if (UINT_FAST8_TYPE
)
6659 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
6660 if (UINT_FAST16_TYPE
)
6661 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
6662 if (UINT_FAST32_TYPE
)
6663 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
6664 if (UINT_FAST64_TYPE
)
6665 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
6667 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
6669 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
6673 c_init_attributes (void)
6675 /* Fill in the built_in_attributes array. */
6676 #define DEF_ATTR_NULL_TREE(ENUM) \
6677 built_in_attributes[(int) ENUM] = NULL_TREE;
6678 #define DEF_ATTR_INT(ENUM, VALUE) \
6679 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6680 #define DEF_ATTR_STRING(ENUM, VALUE) \
6681 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6682 #define DEF_ATTR_IDENT(ENUM, STRING) \
6683 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6684 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6685 built_in_attributes[(int) ENUM] \
6686 = tree_cons (built_in_attributes[(int) PURPOSE], \
6687 built_in_attributes[(int) VALUE], \
6688 built_in_attributes[(int) CHAIN]);
6689 #include "builtin-attrs.def"
6690 #undef DEF_ATTR_NULL_TREE
6692 #undef DEF_ATTR_IDENT
6693 #undef DEF_ATTR_TREE_LIST
6696 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6697 identifier as an argument, so the front end shouldn't look it up. */
6700 attribute_takes_identifier_p (const_tree attr_id
)
6702 const struct attribute_spec
*spec
= lookup_attribute_spec (attr_id
);
6704 /* Unknown attribute that we'll end up ignoring, return true so we
6705 don't complain about an identifier argument. */
6707 else if (!strcmp ("mode", spec
->name
)
6708 || !strcmp ("format", spec
->name
)
6709 || !strcmp ("cleanup", spec
->name
))
6712 return targetm
.attribute_takes_identifier_p (attr_id
);
6715 /* Attribute handlers common to C front ends. */
6717 /* Handle a "packed" attribute; arguments as in
6718 struct attribute_spec.handler. */
6721 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6722 int flags
, bool *no_add_attrs
)
6726 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6727 *node
= build_variant_type_copy (*node
);
6728 TYPE_PACKED (*node
) = 1;
6730 else if (TREE_CODE (*node
) == FIELD_DECL
)
6732 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
6733 /* Still pack bitfields. */
6734 && ! DECL_INITIAL (*node
))
6735 warning (OPT_Wattributes
,
6736 "%qE attribute ignored for field of type %qT",
6737 name
, TREE_TYPE (*node
));
6739 DECL_PACKED (*node
) = 1;
6741 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6742 used for DECL_REGISTER. It wouldn't mean anything anyway.
6743 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6744 that changes what the typedef is typing. */
6747 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6748 *no_add_attrs
= true;
6754 /* Handle a "nocommon" attribute; arguments as in
6755 struct attribute_spec.handler. */
6758 handle_nocommon_attribute (tree
*node
, tree name
,
6759 tree
ARG_UNUSED (args
),
6760 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6763 DECL_COMMON (*node
) = 0;
6766 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6767 *no_add_attrs
= true;
6773 /* Handle a "common" attribute; arguments as in
6774 struct attribute_spec.handler. */
6777 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6778 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6781 DECL_COMMON (*node
) = 1;
6784 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6785 *no_add_attrs
= true;
6791 /* Handle a "noreturn" attribute; arguments as in
6792 struct attribute_spec.handler. */
6795 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6796 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6798 tree type
= TREE_TYPE (*node
);
6800 /* See FIXME comment in c_common_attribute_table. */
6801 if (TREE_CODE (*node
) == FUNCTION_DECL
6802 || objc_method_decl (TREE_CODE (*node
)))
6803 TREE_THIS_VOLATILE (*node
) = 1;
6804 else if (TREE_CODE (type
) == POINTER_TYPE
6805 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6807 = (build_qualified_type
6809 (build_type_variant (TREE_TYPE (type
),
6810 TYPE_READONLY (TREE_TYPE (type
)), 1)),
6811 TYPE_QUALS (type
)));
6814 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6815 *no_add_attrs
= true;
6821 /* Handle a "hot" and attribute; arguments as in
6822 struct attribute_spec.handler. */
6825 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6826 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6828 if (TREE_CODE (*node
) == FUNCTION_DECL
6829 || TREE_CODE (*node
) == LABEL_DECL
)
6831 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
6833 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6834 "with attribute %qs", name
, "cold");
6835 *no_add_attrs
= true;
6837 /* Most of the rest of the hot processing is done later with
6838 lookup_attribute. */
6842 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6843 *no_add_attrs
= true;
6849 /* Handle a "cold" and attribute; arguments as in
6850 struct attribute_spec.handler. */
6853 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6854 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6856 if (TREE_CODE (*node
) == FUNCTION_DECL
6857 || TREE_CODE (*node
) == LABEL_DECL
)
6859 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
6861 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6862 "with attribute %qs", name
, "hot");
6863 *no_add_attrs
= true;
6865 /* Most of the rest of the cold processing is done later with
6866 lookup_attribute. */
6870 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6871 *no_add_attrs
= true;
6877 /* Handle a "no_sanitize_address" attribute; arguments as in
6878 struct attribute_spec.handler. */
6881 handle_no_sanitize_address_attribute (tree
*node
, tree name
, tree
, int,
6884 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6886 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6887 *no_add_attrs
= true;
6893 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6894 struct attribute_spec.handler. */
6897 handle_no_address_safety_analysis_attribute (tree
*node
, tree name
, tree
, int,
6900 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6901 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6902 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node
)))
6903 DECL_ATTRIBUTES (*node
)
6904 = tree_cons (get_identifier ("no_sanitize_address"),
6905 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6906 *no_add_attrs
= true;
6910 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6911 struct attribute_spec.handler. */
6914 handle_no_sanitize_undefined_attribute (tree
*node
, tree name
, tree
, int,
6917 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6919 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6920 *no_add_attrs
= true;
6926 /* Handle a "stack_protect" attribute; arguments as in
6927 struct attribute_spec.handler. */
6929 handle_stack_protect_attribute (tree
*node
, tree name
, tree
, int,
6932 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6934 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6935 *no_add_attrs
= true;
6938 DECL_ATTRIBUTES (*node
)
6939 = tree_cons (get_identifier ("stack_protect"),
6940 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6945 /* Handle a "noinline" attribute; arguments as in
6946 struct attribute_spec.handler. */
6949 handle_noinline_attribute (tree
*node
, tree name
,
6950 tree
ARG_UNUSED (args
),
6951 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6953 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6955 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
6957 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6958 "with attribute %qs", name
, "always_inline");
6959 *no_add_attrs
= true;
6962 DECL_UNINLINABLE (*node
) = 1;
6966 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6967 *no_add_attrs
= true;
6973 /* Handle a "noclone" attribute; arguments as in
6974 struct attribute_spec.handler. */
6977 handle_noclone_attribute (tree
*node
, tree name
,
6978 tree
ARG_UNUSED (args
),
6979 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6981 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6983 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6984 *no_add_attrs
= true;
6990 /* Handle a "no_icf" attribute; arguments as in
6991 struct attribute_spec.handler. */
6994 handle_noicf_attribute (tree
*node
, tree name
,
6995 tree
ARG_UNUSED (args
),
6996 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6998 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7000 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7001 *no_add_attrs
= true;
7008 /* Handle a "always_inline" attribute; arguments as in
7009 struct attribute_spec.handler. */
7012 handle_always_inline_attribute (tree
*node
, tree name
,
7013 tree
ARG_UNUSED (args
),
7014 int ARG_UNUSED (flags
),
7017 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7019 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node
)))
7021 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
7022 "with %qs attribute", name
, "noinline");
7023 *no_add_attrs
= true;
7025 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
7027 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
7028 "with %qs attribute", name
, "target_clones");
7029 *no_add_attrs
= true;
7032 /* Set the attribute and mark it for disregarding inline
7034 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
7038 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7039 *no_add_attrs
= true;
7045 /* Handle a "gnu_inline" attribute; arguments as in
7046 struct attribute_spec.handler. */
7049 handle_gnu_inline_attribute (tree
*node
, tree name
,
7050 tree
ARG_UNUSED (args
),
7051 int ARG_UNUSED (flags
),
7054 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7056 /* Do nothing else, just set the attribute. We'll get at
7057 it later with lookup_attribute. */
7061 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7062 *no_add_attrs
= true;
7068 /* Handle a "leaf" attribute; arguments as in
7069 struct attribute_spec.handler. */
7072 handle_leaf_attribute (tree
*node
, tree name
,
7073 tree
ARG_UNUSED (args
),
7074 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7076 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7078 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7079 *no_add_attrs
= true;
7081 if (!TREE_PUBLIC (*node
))
7083 warning (OPT_Wattributes
, "%qE attribute has no effect on unit local functions", name
);
7084 *no_add_attrs
= true;
7090 /* Handle an "artificial" attribute; arguments as in
7091 struct attribute_spec.handler. */
7094 handle_artificial_attribute (tree
*node
, tree name
,
7095 tree
ARG_UNUSED (args
),
7096 int ARG_UNUSED (flags
),
7099 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7101 /* Do nothing else, just set the attribute. We'll get at
7102 it later with lookup_attribute. */
7106 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7107 *no_add_attrs
= true;
7113 /* Handle a "flatten" attribute; arguments as in
7114 struct attribute_spec.handler. */
7117 handle_flatten_attribute (tree
*node
, tree name
,
7118 tree args ATTRIBUTE_UNUSED
,
7119 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
7121 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7122 /* Do nothing else, just set the attribute. We'll get at
7123 it later with lookup_attribute. */
7127 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7128 *no_add_attrs
= true;
7134 /* Handle a "warning" or "error" attribute; arguments as in
7135 struct attribute_spec.handler. */
7138 handle_error_attribute (tree
*node
, tree name
, tree args
,
7139 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7141 if (TREE_CODE (*node
) == FUNCTION_DECL
7142 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
7143 /* Do nothing else, just set the attribute. We'll get at
7144 it later with lookup_attribute. */
7148 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7149 *no_add_attrs
= true;
7155 /* Handle a "used" attribute; arguments as in
7156 struct attribute_spec.handler. */
7159 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
7160 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7164 if (TREE_CODE (node
) == FUNCTION_DECL
7165 || (VAR_P (node
) && TREE_STATIC (node
))
7166 || (TREE_CODE (node
) == TYPE_DECL
))
7168 TREE_USED (node
) = 1;
7169 DECL_PRESERVE_P (node
) = 1;
7171 DECL_READ_P (node
) = 1;
7175 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7176 *no_add_attrs
= true;
7182 /* Handle a "unused" attribute; arguments as in
7183 struct attribute_spec.handler. */
7186 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7187 int flags
, bool *no_add_attrs
)
7193 if (TREE_CODE (decl
) == PARM_DECL
7194 || VAR_OR_FUNCTION_DECL_P (decl
)
7195 || TREE_CODE (decl
) == LABEL_DECL
7196 || TREE_CODE (decl
) == CONST_DECL
7197 || TREE_CODE (decl
) == TYPE_DECL
)
7199 TREE_USED (decl
) = 1;
7200 if (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
7201 DECL_READ_P (decl
) = 1;
7205 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7206 *no_add_attrs
= true;
7211 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7212 *node
= build_variant_type_copy (*node
);
7213 TREE_USED (*node
) = 1;
7219 /* Handle a "externally_visible" attribute; arguments as in
7220 struct attribute_spec.handler. */
7223 handle_externally_visible_attribute (tree
*pnode
, tree name
,
7224 tree
ARG_UNUSED (args
),
7225 int ARG_UNUSED (flags
),
7230 if (VAR_OR_FUNCTION_DECL_P (node
))
7232 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
7233 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
7235 warning (OPT_Wattributes
,
7236 "%qE attribute have effect only on public objects", name
);
7237 *no_add_attrs
= true;
7242 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7243 *no_add_attrs
= true;
7249 /* Handle the "no_reorder" attribute. Arguments as in
7250 struct attribute_spec.handler. */
7253 handle_no_reorder_attribute (tree
*pnode
,
7261 if (!VAR_OR_FUNCTION_DECL_P (node
)
7262 && !(TREE_STATIC (node
) || DECL_EXTERNAL (node
)))
7264 warning (OPT_Wattributes
,
7265 "%qE attribute only affects top level objects",
7267 *no_add_attrs
= true;
7273 /* Handle a "const" attribute; arguments as in
7274 struct attribute_spec.handler. */
7277 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7278 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7280 tree type
= TREE_TYPE (*node
);
7282 /* See FIXME comment on noreturn in c_common_attribute_table. */
7283 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7284 TREE_READONLY (*node
) = 1;
7285 else if (TREE_CODE (type
) == POINTER_TYPE
7286 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
7288 = (build_qualified_type
7290 (build_type_variant (TREE_TYPE (type
), 1,
7291 TREE_THIS_VOLATILE (TREE_TYPE (type
)))),
7292 TYPE_QUALS (type
)));
7295 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7296 *no_add_attrs
= true;
7302 /* Handle a "scalar_storage_order" attribute; arguments as in
7303 struct attribute_spec.handler. */
7306 handle_scalar_storage_order_attribute (tree
*node
, tree name
, tree args
,
7307 int flags
, bool *no_add_attrs
)
7309 tree id
= TREE_VALUE (args
);
7312 if (TREE_CODE (*node
) == TYPE_DECL
7313 && ! (flags
& ATTR_FLAG_CXX11
))
7314 node
= &TREE_TYPE (*node
);
7317 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
)
7319 error ("scalar_storage_order is not supported because endianness "
7324 if (RECORD_OR_UNION_TYPE_P (type
) && !c_dialect_cxx ())
7326 bool reverse
= false;
7328 if (TREE_CODE (id
) == STRING_CST
7329 && strcmp (TREE_STRING_POINTER (id
), "big-endian") == 0)
7330 reverse
= !BYTES_BIG_ENDIAN
;
7331 else if (TREE_CODE (id
) == STRING_CST
7332 && strcmp (TREE_STRING_POINTER (id
), "little-endian") == 0)
7333 reverse
= BYTES_BIG_ENDIAN
;
7336 error ("scalar_storage_order argument must be one of \"big-endian\""
7337 " or \"little-endian\"");
7341 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7344 /* A type variant isn't good enough, since we don't want a cast
7345 to such a type to be removed as a no-op. */
7346 *node
= type
= build_duplicate_type (type
);
7349 TYPE_REVERSE_STORAGE_ORDER (type
) = reverse
;
7353 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7354 *no_add_attrs
= true;
7358 /* Handle a "transparent_union" attribute; arguments as in
7359 struct attribute_spec.handler. */
7362 handle_transparent_union_attribute (tree
*node
, tree name
,
7363 tree
ARG_UNUSED (args
), int flags
,
7368 *no_add_attrs
= true;
7370 if (TREE_CODE (*node
) == TYPE_DECL
7371 && ! (flags
& ATTR_FLAG_CXX11
))
7372 node
= &TREE_TYPE (*node
);
7375 if (TREE_CODE (type
) == UNION_TYPE
)
7377 /* Make sure that the first field will work for a transparent union.
7378 If the type isn't complete yet, leave the check to the code in
7380 if (TYPE_SIZE (type
))
7382 tree first
= first_field (type
);
7383 if (first
== NULL_TREE
7384 || DECL_ARTIFICIAL (first
)
7385 || TYPE_MODE (type
) != DECL_MODE (first
))
7389 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7391 /* If the type isn't complete yet, setting the flag
7392 on a variant wouldn't ever be checked. */
7393 if (!TYPE_SIZE (type
))
7396 /* build_duplicate_type doesn't work for C++. */
7397 if (c_dialect_cxx ())
7400 /* A type variant isn't good enough, since we don't want a cast
7401 to such a type to be removed as a no-op. */
7402 *node
= type
= build_duplicate_type (type
);
7405 for (tree t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7406 TYPE_TRANSPARENT_AGGR (t
) = 1;
7411 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7415 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7416 get the requested priority for a constructor or destructor,
7417 possibly issuing diagnostics for invalid or reserved
7420 static priority_type
7421 get_priority (tree args
, bool is_destructor
)
7427 return DEFAULT_INIT_PRIORITY
;
7429 if (!SUPPORTS_INIT_PRIORITY
)
7432 error ("destructor priorities are not supported");
7434 error ("constructor priorities are not supported");
7435 return DEFAULT_INIT_PRIORITY
;
7438 arg
= TREE_VALUE (args
);
7439 if (TREE_CODE (arg
) == IDENTIFIER_NODE
)
7441 if (arg
== error_mark_node
)
7442 return DEFAULT_INIT_PRIORITY
;
7443 arg
= default_conversion (arg
);
7444 if (!tree_fits_shwi_p (arg
)
7445 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
7448 pri
= tree_to_shwi (arg
);
7449 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
7452 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
7456 "destructor priorities from 0 to %d are reserved "
7457 "for the implementation",
7458 MAX_RESERVED_INIT_PRIORITY
);
7461 "constructor priorities from 0 to %d are reserved "
7462 "for the implementation",
7463 MAX_RESERVED_INIT_PRIORITY
);
7469 error ("destructor priorities must be integers from 0 to %d inclusive",
7472 error ("constructor priorities must be integers from 0 to %d inclusive",
7474 return DEFAULT_INIT_PRIORITY
;
7477 /* Handle a "constructor" attribute; arguments as in
7478 struct attribute_spec.handler. */
7481 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
7482 int ARG_UNUSED (flags
),
7486 tree type
= TREE_TYPE (decl
);
7488 if (TREE_CODE (decl
) == FUNCTION_DECL
7489 && TREE_CODE (type
) == FUNCTION_TYPE
7490 && decl_function_context (decl
) == 0)
7492 priority_type priority
;
7493 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
7494 priority
= get_priority (args
, /*is_destructor=*/false);
7495 SET_DECL_INIT_PRIORITY (decl
, priority
);
7496 TREE_USED (decl
) = 1;
7500 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7501 *no_add_attrs
= true;
7507 /* Handle a "destructor" attribute; arguments as in
7508 struct attribute_spec.handler. */
7511 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
7512 int ARG_UNUSED (flags
),
7516 tree type
= TREE_TYPE (decl
);
7518 if (TREE_CODE (decl
) == FUNCTION_DECL
7519 && TREE_CODE (type
) == FUNCTION_TYPE
7520 && decl_function_context (decl
) == 0)
7522 priority_type priority
;
7523 DECL_STATIC_DESTRUCTOR (decl
) = 1;
7524 priority
= get_priority (args
, /*is_destructor=*/true);
7525 SET_DECL_FINI_PRIORITY (decl
, priority
);
7526 TREE_USED (decl
) = 1;
7530 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7531 *no_add_attrs
= true;
7537 /* Nonzero if the mode is a valid vector mode for this architecture.
7538 This returns nonzero even if there is no hardware support for the
7539 vector mode, but we can emulate with narrower modes. */
7542 vector_mode_valid_p (machine_mode mode
)
7544 enum mode_class mclass
= GET_MODE_CLASS (mode
);
7545 machine_mode innermode
;
7547 /* Doh! What's going on? */
7548 if (mclass
!= MODE_VECTOR_INT
7549 && mclass
!= MODE_VECTOR_FLOAT
7550 && mclass
!= MODE_VECTOR_FRACT
7551 && mclass
!= MODE_VECTOR_UFRACT
7552 && mclass
!= MODE_VECTOR_ACCUM
7553 && mclass
!= MODE_VECTOR_UACCUM
)
7556 /* Hardware support. Woo hoo! */
7557 if (targetm
.vector_mode_supported_p (mode
))
7560 innermode
= GET_MODE_INNER (mode
);
7562 /* We should probably return 1 if requesting V4DI and we have no DI,
7563 but we have V2DI, but this is probably very unlikely. */
7565 /* If we have support for the inner mode, we can safely emulate it.
7566 We may not have V2DI, but me can emulate with a pair of DIs. */
7567 return targetm
.scalar_mode_supported_p (innermode
);
7571 /* Handle a "mode" attribute; arguments as in
7572 struct attribute_spec.handler. */
7575 handle_mode_attribute (tree
*node
, tree name
, tree args
,
7576 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7579 tree ident
= TREE_VALUE (args
);
7581 *no_add_attrs
= true;
7583 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
7584 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7588 const char *p
= IDENTIFIER_POINTER (ident
);
7589 int len
= strlen (p
);
7590 machine_mode mode
= VOIDmode
;
7594 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
7595 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
7597 char *newp
= (char *) alloca (len
- 1);
7599 strcpy (newp
, &p
[2]);
7600 newp
[len
- 4] = '\0';
7604 /* Change this type to have a type with the specified mode.
7605 First check for the special modes. */
7606 if (!strcmp (p
, "byte"))
7608 else if (!strcmp (p
, "word"))
7610 else if (!strcmp (p
, "pointer"))
7612 else if (!strcmp (p
, "libgcc_cmp_return"))
7613 mode
= targetm
.libgcc_cmp_return_mode ();
7614 else if (!strcmp (p
, "libgcc_shift_count"))
7615 mode
= targetm
.libgcc_shift_count_mode ();
7616 else if (!strcmp (p
, "unwind_word"))
7617 mode
= targetm
.unwind_word_mode ();
7619 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
7620 if (!strcmp (p
, GET_MODE_NAME (j
)))
7622 mode
= (machine_mode
) j
;
7626 if (mode
== VOIDmode
)
7628 error ("unknown machine mode %qE", ident
);
7633 switch (GET_MODE_CLASS (mode
))
7636 case MODE_PARTIAL_INT
:
7638 case MODE_DECIMAL_FLOAT
:
7643 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
7646 case MODE_COMPLEX_INT
:
7647 case MODE_COMPLEX_FLOAT
:
7648 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
7651 case MODE_VECTOR_INT
:
7652 case MODE_VECTOR_FLOAT
:
7653 case MODE_VECTOR_FRACT
:
7654 case MODE_VECTOR_UFRACT
:
7655 case MODE_VECTOR_ACCUM
:
7656 case MODE_VECTOR_UACCUM
:
7657 warning (OPT_Wattributes
, "specifying vector types with "
7658 "__attribute__ ((mode)) is deprecated");
7659 warning (OPT_Wattributes
,
7660 "use __attribute__ ((vector_size)) instead");
7661 valid_mode
= vector_mode_valid_p (mode
);
7669 error ("unable to emulate %qs", p
);
7673 if (POINTER_TYPE_P (type
))
7675 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
7676 tree (*fn
)(tree
, machine_mode
, bool);
7678 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
7680 error ("invalid pointer mode %qs", p
);
7684 if (TREE_CODE (type
) == POINTER_TYPE
)
7685 fn
= build_pointer_type_for_mode
;
7687 fn
= build_reference_type_for_mode
;
7688 typefm
= fn (TREE_TYPE (type
), mode
, false);
7692 /* For fixed-point modes, we need to test if the signness of type
7693 and the machine mode are consistent. */
7694 if (ALL_FIXED_POINT_MODE_P (mode
)
7695 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
7697 error ("signedness of type and machine mode %qs don%'t match", p
);
7700 /* For fixed-point modes, we need to pass saturating info. */
7701 typefm
= lang_hooks
.types
.type_for_mode (mode
,
7702 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
7703 : TYPE_UNSIGNED (type
));
7706 if (typefm
== NULL_TREE
)
7708 error ("no data type for mode %qs", p
);
7711 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
7713 /* For enumeral types, copy the precision from the integer
7714 type returned above. If not an INTEGER_TYPE, we can't use
7715 this mode for this type. */
7716 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
7718 error ("cannot use mode %qs for enumeral types", p
);
7722 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
7724 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
7729 /* We cannot build a type variant, as there's code that assumes
7730 that TYPE_MAIN_VARIANT has the same mode. This includes the
7731 debug generators. Instead, create a subrange type. This
7732 results in all of the enumeral values being emitted only once
7733 in the original, and the subtype gets them by reference. */
7734 if (TYPE_UNSIGNED (type
))
7735 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
7737 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
7738 TREE_TYPE (typefm
) = type
;
7741 else if (VECTOR_MODE_P (mode
)
7742 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
7743 : TREE_CODE (type
) != TREE_CODE (typefm
))
7745 error ("mode %qs applied to inappropriate type", p
);
7755 /* Handle a "section" attribute; arguments as in
7756 struct attribute_spec.handler. */
7759 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7760 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7764 if (!targetm_common
.have_named_sections
)
7766 error_at (DECL_SOURCE_LOCATION (*node
),
7767 "section attributes are not supported for this target");
7771 user_defined_section_attribute
= true;
7773 if (!VAR_OR_FUNCTION_DECL_P (decl
))
7775 error ("section attribute not allowed for %q+D", *node
);
7779 if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7781 error ("section attribute argument not a string constant");
7786 && current_function_decl
!= NULL_TREE
7787 && !TREE_STATIC (decl
))
7789 error_at (DECL_SOURCE_LOCATION (decl
),
7790 "section attribute cannot be specified for local variables");
7794 /* The decl may have already been given a section attribute
7795 from a previous declaration. Ensure they match. */
7796 if (DECL_SECTION_NAME (decl
) != NULL
7797 && strcmp (DECL_SECTION_NAME (decl
),
7798 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
7800 error ("section of %q+D conflicts with previous declaration", *node
);
7805 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
7806 && DECL_THREAD_LOCAL_P (decl
))
7808 error ("section of %q+D cannot be overridden", *node
);
7812 set_decl_section_name (decl
, TREE_STRING_POINTER (TREE_VALUE (args
)));
7816 *no_add_attrs
= true;
7820 /* Check whether ALIGN is a valid user-specified alignment. If so,
7821 return its base-2 log; if not, output an error and return -1. If
7822 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7825 check_user_alignment (const_tree align
, bool allow_zero
)
7829 if (error_operand_p (align
))
7831 if (TREE_CODE (align
) != INTEGER_CST
7832 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
7834 error ("requested alignment is not an integer constant");
7837 else if (allow_zero
&& integer_zerop (align
))
7839 else if (tree_int_cst_sgn (align
) == -1
7840 || (i
= tree_log2 (align
)) == -1)
7842 error ("requested alignment is not a positive power of 2");
7845 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
7847 error ("requested alignment is too large");
7854 If in c++-11, check if the c++-11 alignment constraint with respect
7855 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7856 c++-11 mode, does nothing.
7860 [* if the constant expression evaluates to a fundamental alignment,
7861 the alignment requirement of the declared entity shall be the
7862 specified fundamental alignment.
7864 * if the constant expression evaluates to an extended alignment
7865 and the implementation supports that alignment in the context
7866 of the declaration, the alignment of the declared entity shall
7869 * if the constant expression evaluates to an extended alignment
7870 and the implementation does not support that alignment in the
7871 context of the declaration, the program is ill-formed]. */
7874 check_cxx_fundamental_alignment_constraints (tree node
,
7878 bool alignment_too_large_p
= false;
7879 unsigned requested_alignment
= 1U << align_log
;
7880 unsigned max_align
= 0;
7882 if ((!(flags
& ATTR_FLAG_CXX11
) && !warn_cxx_compat
)
7883 || (node
== NULL_TREE
|| node
== error_mark_node
))
7886 if (cxx_fundamental_alignment_p (requested_alignment
))
7891 if (TREE_STATIC (node
))
7893 /* For file scope variables and static members, the target
7894 supports alignments that are at most
7895 MAX_OFILE_ALIGNMENT. */
7896 if (requested_alignment
> (max_align
= MAX_OFILE_ALIGNMENT
))
7897 alignment_too_large_p
= true;
7901 #ifdef BIGGEST_FIELD_ALIGNMENT
7902 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7904 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7906 /* For non-static members, the target supports either
7907 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7908 if it is defined or BIGGEST_ALIGNMENT. */
7909 max_align
= MAX_TARGET_FIELD_ALIGNMENT
;
7910 if (TREE_CODE (node
) == FIELD_DECL
7911 && requested_alignment
> (max_align
= MAX_TARGET_FIELD_ALIGNMENT
))
7912 alignment_too_large_p
= true;
7913 #undef MAX_TARGET_FIELD_ALIGNMENT
7914 /* For stack variables, the target supports at most
7915 MAX_STACK_ALIGNMENT. */
7916 else if (decl_function_context (node
) != NULL
7917 && requested_alignment
> (max_align
= MAX_STACK_ALIGNMENT
))
7918 alignment_too_large_p
= true;
7921 else if (TYPE_P (node
))
7923 /* Let's be liberal for types. */
7924 if (requested_alignment
> (max_align
= BIGGEST_ALIGNMENT
))
7925 alignment_too_large_p
= true;
7928 if (alignment_too_large_p
)
7929 pedwarn (input_location
, OPT_Wattributes
,
7930 "requested alignment %d is larger than %d",
7931 requested_alignment
, max_align
);
7933 return !alignment_too_large_p
;
7936 /* Handle a "aligned" attribute; arguments as in
7937 struct attribute_spec.handler. */
7940 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7941 int flags
, bool *no_add_attrs
)
7943 tree decl
= NULL_TREE
;
7951 align_expr
= TREE_VALUE (args
);
7952 if (align_expr
&& TREE_CODE (align_expr
) != IDENTIFIER_NODE
7953 && TREE_CODE (align_expr
) != FUNCTION_DECL
)
7954 align_expr
= default_conversion (align_expr
);
7957 align_expr
= size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
);
7962 type
= &TREE_TYPE (decl
);
7963 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
7965 else if (TYPE_P (*node
))
7966 type
= node
, is_type
= 1;
7968 if ((i
= check_user_alignment (align_expr
, true)) == -1
7969 || !check_cxx_fundamental_alignment_constraints (*node
, i
, flags
))
7970 *no_add_attrs
= true;
7973 if ((flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7974 /* OK, modify the type in place. */;
7975 /* If we have a TYPE_DECL, then copy the type, so that we
7976 don't accidentally modify a builtin type. See pushdecl. */
7977 else if (decl
&& TREE_TYPE (decl
) != error_mark_node
7978 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
7980 tree tt
= TREE_TYPE (decl
);
7981 *type
= build_variant_type_copy (*type
);
7982 DECL_ORIGINAL_TYPE (decl
) = tt
;
7983 TYPE_NAME (*type
) = decl
;
7984 TREE_USED (*type
) = TREE_USED (decl
);
7985 TREE_TYPE (decl
) = *type
;
7988 *type
= build_variant_type_copy (*type
);
7990 SET_TYPE_ALIGN (*type
, (1U << i
) * BITS_PER_UNIT
);
7991 TYPE_USER_ALIGN (*type
) = 1;
7993 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
7994 && TREE_CODE (decl
) != FIELD_DECL
)
7996 error ("alignment may not be specified for %q+D", decl
);
7997 *no_add_attrs
= true;
7999 else if (DECL_USER_ALIGN (decl
)
8000 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
8001 /* C++-11 [dcl.align/4]:
8003 When multiple alignment-specifiers are specified for an
8004 entity, the alignment requirement shall be set to the
8005 strictest specified alignment.
8007 This formally comes from the c++11 specification but we are
8008 doing it for the GNU attribute syntax as well. */
8009 *no_add_attrs
= true;
8010 else if (TREE_CODE (decl
) == FUNCTION_DECL
8011 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
8013 if (DECL_USER_ALIGN (decl
))
8014 error ("alignment for %q+D was previously specified as %d "
8015 "and may not be decreased", decl
,
8016 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
8018 error ("alignment for %q+D must be at least %d", decl
,
8019 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
8020 *no_add_attrs
= true;
8024 SET_DECL_ALIGN (decl
, (1U << i
) * BITS_PER_UNIT
);
8025 DECL_USER_ALIGN (decl
) = 1;
8031 /* Handle a "weak" attribute; arguments as in
8032 struct attribute_spec.handler. */
8035 handle_weak_attribute (tree
*node
, tree name
,
8036 tree
ARG_UNUSED (args
),
8037 int ARG_UNUSED (flags
),
8038 bool * ARG_UNUSED (no_add_attrs
))
8040 if (TREE_CODE (*node
) == FUNCTION_DECL
8041 && DECL_DECLARED_INLINE_P (*node
))
8043 warning (OPT_Wattributes
, "inline function %q+D declared weak", *node
);
8044 *no_add_attrs
= true;
8046 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8048 error ("indirect function %q+D cannot be declared weak", *node
);
8049 *no_add_attrs
= true;
8052 else if (VAR_OR_FUNCTION_DECL_P (*node
))
8053 declare_weak (*node
);
8055 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8060 /* Handle a "noplt" attribute; arguments as in
8061 struct attribute_spec.handler. */
8064 handle_noplt_attribute (tree
*node
, tree name
,
8065 tree
ARG_UNUSED (args
),
8066 int ARG_UNUSED (flags
),
8067 bool * ARG_UNUSED (no_add_attrs
))
8069 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8071 warning (OPT_Wattributes
,
8072 "%qE attribute is only applicable on functions", name
);
8073 *no_add_attrs
= true;
8079 /* Handle an "alias" or "ifunc" attribute; arguments as in
8080 struct attribute_spec.handler, except that IS_ALIAS tells us
8081 whether this is an alias as opposed to ifunc attribute. */
8084 handle_alias_ifunc_attribute (bool is_alias
, tree
*node
, tree name
, tree args
,
8089 if (TREE_CODE (decl
) != FUNCTION_DECL
8090 && (!is_alias
|| !VAR_P (decl
)))
8092 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8093 *no_add_attrs
= true;
8095 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
8096 || (TREE_CODE (decl
) != FUNCTION_DECL
8097 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
8098 /* A static variable declaration is always a tentative definition,
8099 but the alias is a non-tentative definition which overrides. */
8100 || (TREE_CODE (decl
) != FUNCTION_DECL
8101 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
8103 error ("%q+D defined both normally and as %qE attribute", decl
, name
);
8104 *no_add_attrs
= true;
8108 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl
))
8109 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))))
8111 error ("weak %q+D cannot be defined %qE", decl
, name
);
8112 *no_add_attrs
= true;
8116 /* Note that the very first time we process a nested declaration,
8117 decl_function_context will not be set. Indeed, *would* never
8118 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8119 we do below. After such frobbery, pushdecl would set the context.
8120 In any case, this is never what we want. */
8121 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
8125 id
= TREE_VALUE (args
);
8126 if (TREE_CODE (id
) != STRING_CST
)
8128 error ("attribute %qE argument not a string", name
);
8129 *no_add_attrs
= true;
8132 id
= get_identifier (TREE_STRING_POINTER (id
));
8133 /* This counts as a use of the object pointed to. */
8136 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8137 DECL_INITIAL (decl
) = error_mark_node
;
8139 TREE_STATIC (decl
) = 1;
8142 /* ifuncs are also aliases, so set that attribute too. */
8143 DECL_ATTRIBUTES (decl
)
8144 = tree_cons (get_identifier ("alias"), args
, DECL_ATTRIBUTES (decl
));
8148 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8149 *no_add_attrs
= true;
8152 if (decl_in_symtab_p (*node
))
8154 struct symtab_node
*n
= symtab_node::get (decl
);
8155 if (n
&& n
->refuse_visibility_changes
)
8158 error ("%+D declared alias after being used", decl
);
8160 error ("%+D declared ifunc after being used", decl
);
8168 /* Handle an "alias" or "ifunc" attribute; arguments as in
8169 struct attribute_spec.handler. */
8172 handle_ifunc_attribute (tree
*node
, tree name
, tree args
,
8173 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8175 return handle_alias_ifunc_attribute (false, node
, name
, args
, no_add_attrs
);
8178 /* Handle an "alias" or "ifunc" attribute; arguments as in
8179 struct attribute_spec.handler. */
8182 handle_alias_attribute (tree
*node
, tree name
, tree args
,
8183 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8185 return handle_alias_ifunc_attribute (true, node
, name
, args
, no_add_attrs
);
8188 /* Handle a "weakref" attribute; arguments as in struct
8189 attribute_spec.handler. */
8192 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8193 int flags
, bool *no_add_attrs
)
8195 tree attr
= NULL_TREE
;
8197 /* We must ignore the attribute when it is associated with
8198 local-scoped decls, since attribute alias is ignored and many
8199 such symbols do not even have a DECL_WEAK field. */
8200 if (decl_function_context (*node
)
8201 || current_function_decl
8202 || !VAR_OR_FUNCTION_DECL_P (*node
))
8204 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8205 *no_add_attrs
= true;
8209 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8211 error ("indirect function %q+D cannot be declared weakref", *node
);
8212 *no_add_attrs
= true;
8216 /* The idea here is that `weakref("name")' mutates into `weakref,
8217 alias("name")', and weakref without arguments, in turn,
8218 implicitly adds weak. */
8222 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
8223 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
8225 *no_add_attrs
= true;
8227 decl_attributes (node
, attr
, flags
);
8231 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
8232 error_at (DECL_SOURCE_LOCATION (*node
),
8233 "weakref attribute must appear before alias attribute");
8235 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8236 and that isn't supported; and because it wants to add it to
8237 the list of weak decls, which isn't helpful. */
8238 DECL_WEAK (*node
) = 1;
8241 if (decl_in_symtab_p (*node
))
8243 struct symtab_node
*n
= symtab_node::get (*node
);
8244 if (n
&& n
->refuse_visibility_changes
)
8245 error ("%+D declared weakref after being used", *node
);
8251 /* Handle an "visibility" attribute; arguments as in
8252 struct attribute_spec.handler. */
8255 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
8256 int ARG_UNUSED (flags
),
8257 bool *ARG_UNUSED (no_add_attrs
))
8260 tree id
= TREE_VALUE (args
);
8261 enum symbol_visibility vis
;
8265 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
8267 else if (!RECORD_OR_UNION_TYPE_P (*node
))
8269 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
8273 else if (TYPE_FIELDS (*node
))
8275 error ("%qE attribute ignored because %qT is already defined",
8280 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
8282 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8286 if (TREE_CODE (id
) != STRING_CST
)
8288 error ("visibility argument not a string");
8292 /* If this is a type, set the visibility on the type decl. */
8295 decl
= TYPE_NAME (decl
);
8298 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8300 warning (OPT_Wattributes
, "%qE attribute ignored on types",
8306 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
8307 vis
= VISIBILITY_DEFAULT
;
8308 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
8309 vis
= VISIBILITY_INTERNAL
;
8310 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
8311 vis
= VISIBILITY_HIDDEN
;
8312 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
8313 vis
= VISIBILITY_PROTECTED
;
8316 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8317 vis
= VISIBILITY_DEFAULT
;
8320 if (DECL_VISIBILITY_SPECIFIED (decl
)
8321 && vis
!= DECL_VISIBILITY (decl
))
8323 tree attributes
= (TYPE_P (*node
)
8324 ? TYPE_ATTRIBUTES (*node
)
8325 : DECL_ATTRIBUTES (decl
));
8326 if (lookup_attribute ("visibility", attributes
))
8327 error ("%qD redeclared with different visibility", decl
);
8328 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8329 && lookup_attribute ("dllimport", attributes
))
8330 error ("%qD was declared %qs which implies default visibility",
8332 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8333 && lookup_attribute ("dllexport", attributes
))
8334 error ("%qD was declared %qs which implies default visibility",
8338 DECL_VISIBILITY (decl
) = vis
;
8339 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
8341 /* Go ahead and attach the attribute to the node as well. This is needed
8342 so we can determine whether we have VISIBILITY_DEFAULT because the
8343 visibility was not specified, or because it was explicitly overridden
8344 from the containing scope. */
8349 /* Determine the ELF symbol visibility for DECL, which is either a
8350 variable or a function. It is an error to use this function if a
8351 definition of DECL is not available in this translation unit.
8352 Returns true if the final visibility has been determined by this
8353 function; false if the caller is free to make additional
8357 c_determine_visibility (tree decl
)
8359 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
8361 /* If the user explicitly specified the visibility with an
8362 attribute, honor that. DECL_VISIBILITY will have been set during
8363 the processing of the attribute. We check for an explicit
8364 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8365 to distinguish the use of an attribute from the use of a "#pragma
8366 GCC visibility push(...)"; in the latter case we still want other
8367 considerations to be able to overrule the #pragma. */
8368 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
8369 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8370 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
8371 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
8374 /* Set default visibility to whatever the user supplied with
8375 visibility_specified depending on #pragma GCC visibility. */
8376 if (!DECL_VISIBILITY_SPECIFIED (decl
))
8378 if (visibility_options
.inpragma
8379 || DECL_VISIBILITY (decl
) != default_visibility
)
8381 DECL_VISIBILITY (decl
) = default_visibility
;
8382 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
8383 /* If visibility changed and DECL already has DECL_RTL, ensure
8384 symbol flags are updated. */
8385 if (((VAR_P (decl
) && TREE_STATIC (decl
))
8386 || TREE_CODE (decl
) == FUNCTION_DECL
)
8387 && DECL_RTL_SET_P (decl
))
8388 make_decl_rtl (decl
);
8394 /* Handle an "tls_model" attribute; arguments as in
8395 struct attribute_spec.handler. */
8398 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
8399 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8403 enum tls_model kind
;
8405 *no_add_attrs
= true;
8407 if (!VAR_P (decl
) || !DECL_THREAD_LOCAL_P (decl
))
8409 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8413 kind
= DECL_TLS_MODEL (decl
);
8414 id
= TREE_VALUE (args
);
8415 if (TREE_CODE (id
) != STRING_CST
)
8417 error ("tls_model argument not a string");
8421 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
8422 kind
= TLS_MODEL_LOCAL_EXEC
;
8423 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
8424 kind
= TLS_MODEL_INITIAL_EXEC
;
8425 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
8426 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
8427 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
8428 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
8430 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8432 set_decl_tls_model (decl
, kind
);
8436 /* Handle a "no_instrument_function" attribute; arguments as in
8437 struct attribute_spec.handler. */
8440 handle_no_instrument_function_attribute (tree
*node
, tree name
,
8441 tree
ARG_UNUSED (args
),
8442 int ARG_UNUSED (flags
),
8447 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8449 error_at (DECL_SOURCE_LOCATION (decl
),
8450 "%qE attribute applies only to functions", name
);
8451 *no_add_attrs
= true;
8454 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
8459 /* Handle a "no_profile_instrument_function" attribute; arguments as in
8460 struct attribute_spec.handler. */
8463 handle_no_profile_instrument_function_attribute (tree
*node
, tree name
, tree
,
8464 int, bool *no_add_attrs
)
8466 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8468 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8469 *no_add_attrs
= true;
8475 /* Handle a "malloc" attribute; arguments as in
8476 struct attribute_spec.handler. */
8479 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8480 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8482 if (TREE_CODE (*node
) == FUNCTION_DECL
8483 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
8484 DECL_IS_MALLOC (*node
) = 1;
8487 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8488 *no_add_attrs
= true;
8494 /* Handle a "alloc_size" attribute; arguments as in
8495 struct attribute_spec.handler. */
8498 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8499 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8501 unsigned arg_count
= type_num_arguments (*node
);
8502 for (; args
; args
= TREE_CHAIN (args
))
8504 tree position
= TREE_VALUE (args
);
8505 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8506 && TREE_CODE (position
) != FUNCTION_DECL
)
8507 position
= default_conversion (position
);
8509 if (!tree_fits_uhwi_p (position
)
8511 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8513 warning (OPT_Wattributes
,
8514 "alloc_size parameter outside range");
8515 *no_add_attrs
= true;
8522 /* Handle a "alloc_align" attribute; arguments as in
8523 struct attribute_spec.handler. */
8526 handle_alloc_align_attribute (tree
*node
, tree
, tree args
, int,
8529 unsigned arg_count
= type_num_arguments (*node
);
8530 tree position
= TREE_VALUE (args
);
8531 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8532 && TREE_CODE (position
) != FUNCTION_DECL
)
8533 position
= default_conversion (position
);
8535 if (!tree_fits_uhwi_p (position
)
8537 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8539 warning (OPT_Wattributes
,
8540 "alloc_align parameter outside range");
8541 *no_add_attrs
= true;
8547 /* Handle a "assume_aligned" attribute; arguments as in
8548 struct attribute_spec.handler. */
8551 handle_assume_aligned_attribute (tree
*, tree
, tree args
, int,
8554 for (; args
; args
= TREE_CHAIN (args
))
8556 tree position
= TREE_VALUE (args
);
8557 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8558 && TREE_CODE (position
) != FUNCTION_DECL
)
8559 position
= default_conversion (position
);
8561 if (TREE_CODE (position
) != INTEGER_CST
)
8563 warning (OPT_Wattributes
,
8564 "assume_aligned parameter not integer constant");
8565 *no_add_attrs
= true;
8572 /* Handle a "fn spec" attribute; arguments as in
8573 struct attribute_spec.handler. */
8576 handle_fnspec_attribute (tree
*node ATTRIBUTE_UNUSED
, tree
ARG_UNUSED (name
),
8577 tree args
, int ARG_UNUSED (flags
),
8578 bool *no_add_attrs ATTRIBUTE_UNUSED
)
8581 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
8582 && !TREE_CHAIN (args
));
8586 /* Handle a "bnd_variable_size" attribute; arguments as in
8587 struct attribute_spec.handler. */
8590 handle_bnd_variable_size_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8591 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8593 if (TREE_CODE (*node
) != FIELD_DECL
)
8595 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8596 *no_add_attrs
= true;
8602 /* Handle a "bnd_legacy" attribute; arguments as in
8603 struct attribute_spec.handler. */
8606 handle_bnd_legacy (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8607 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8609 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8611 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8612 *no_add_attrs
= true;
8618 /* Handle a "bnd_instrument" attribute; arguments as in
8619 struct attribute_spec.handler. */
8622 handle_bnd_instrument (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8623 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8625 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8627 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8628 *no_add_attrs
= true;
8634 /* Handle a "warn_unused" attribute; arguments as in
8635 struct attribute_spec.handler. */
8638 handle_warn_unused_attribute (tree
*node
, tree name
,
8639 tree args ATTRIBUTE_UNUSED
,
8640 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
8643 /* Do nothing else, just set the attribute. We'll get at
8644 it later with lookup_attribute. */
8648 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8649 *no_add_attrs
= true;
8655 /* Handle an "omp declare simd" attribute; arguments as in
8656 struct attribute_spec.handler. */
8659 handle_omp_declare_simd_attribute (tree
*, tree
, tree
, int, bool *)
8664 /* Handle a "simd" attribute. */
8667 handle_simd_attribute (tree
*node
, tree name
, tree args
, int, bool *no_add_attrs
)
8669 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8671 if (lookup_attribute ("cilk simd function",
8672 DECL_ATTRIBUTES (*node
)) != NULL
)
8674 error_at (DECL_SOURCE_LOCATION (*node
),
8675 "%<__simd__%> attribute cannot be used in the same "
8676 "function marked as a Cilk Plus SIMD-enabled function");
8677 *no_add_attrs
= true;
8681 tree t
= get_identifier ("omp declare simd");
8682 tree attr
= NULL_TREE
;
8685 tree id
= TREE_VALUE (args
);
8687 if (TREE_CODE (id
) != STRING_CST
)
8689 error ("attribute %qE argument not a string", name
);
8690 *no_add_attrs
= true;
8694 if (strcmp (TREE_STRING_POINTER (id
), "notinbranch") == 0)
8695 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8696 OMP_CLAUSE_NOTINBRANCH
);
8698 if (strcmp (TREE_STRING_POINTER (id
), "inbranch") == 0)
8699 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8700 OMP_CLAUSE_INBRANCH
);
8703 error ("only %<inbranch%> and %<notinbranch%> flags are "
8704 "allowed for %<__simd__%> attribute");
8705 *no_add_attrs
= true;
8710 DECL_ATTRIBUTES (*node
) = tree_cons (t
,
8711 build_tree_list (NULL_TREE
,
8713 DECL_ATTRIBUTES (*node
));
8718 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8719 *no_add_attrs
= true;
8725 /* Handle an "omp declare target" attribute; arguments as in
8726 struct attribute_spec.handler. */
8729 handle_omp_declare_target_attribute (tree
*, tree
, tree
, int, bool *)
8734 /* Handle a "returns_twice" attribute; arguments as in
8735 struct attribute_spec.handler. */
8738 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8739 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8741 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8742 DECL_IS_RETURNS_TWICE (*node
) = 1;
8745 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8746 *no_add_attrs
= true;
8752 /* Handle a "no_limit_stack" attribute; arguments as in
8753 struct attribute_spec.handler. */
8756 handle_no_limit_stack_attribute (tree
*node
, tree name
,
8757 tree
ARG_UNUSED (args
),
8758 int ARG_UNUSED (flags
),
8763 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8765 error_at (DECL_SOURCE_LOCATION (decl
),
8766 "%qE attribute applies only to functions", name
);
8767 *no_add_attrs
= true;
8769 else if (DECL_INITIAL (decl
))
8771 error_at (DECL_SOURCE_LOCATION (decl
),
8772 "can%'t set %qE attribute after definition", name
);
8773 *no_add_attrs
= true;
8776 DECL_NO_LIMIT_STACK (decl
) = 1;
8781 /* Handle a "pure" attribute; arguments as in
8782 struct attribute_spec.handler. */
8785 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8786 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8788 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8789 DECL_PURE_P (*node
) = 1;
8790 /* ??? TODO: Support types. */
8793 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8794 *no_add_attrs
= true;
8800 /* Digest an attribute list destined for a transactional memory statement.
8801 ALLOWED is the set of attributes that are allowed for this statement;
8802 return the attribute we parsed. Multiple attributes are never allowed. */
8805 parse_tm_stmt_attr (tree attrs
, int allowed
)
8810 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
8812 tree a
= TREE_PURPOSE (attrs
);
8815 if (is_attribute_p ("outer", a
))
8816 m
= TM_STMT_ATTR_OUTER
;
8818 if ((m
& allowed
) == 0)
8820 warning (OPT_Wattributes
, "%qE attribute directive ignored", a
);
8829 else if (m_seen
== m
)
8830 warning (OPT_Wattributes
, "%qE attribute duplicated", a
);
8832 warning (OPT_Wattributes
, "%qE attribute follows %qE", a
, a_seen
);
8838 /* Transform a TM attribute name into a maskable integer and back.
8839 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8840 to how the lack of an attribute is treated. */
8843 tm_attr_to_mask (tree attr
)
8847 if (is_attribute_p ("transaction_safe", attr
))
8848 return TM_ATTR_SAFE
;
8849 if (is_attribute_p ("transaction_callable", attr
))
8850 return TM_ATTR_CALLABLE
;
8851 if (is_attribute_p ("transaction_pure", attr
))
8852 return TM_ATTR_PURE
;
8853 if (is_attribute_p ("transaction_unsafe", attr
))
8854 return TM_ATTR_IRREVOCABLE
;
8855 if (is_attribute_p ("transaction_may_cancel_outer", attr
))
8856 return TM_ATTR_MAY_CANCEL_OUTER
;
8861 tm_mask_to_attr (int mask
)
8867 str
= "transaction_safe";
8869 case TM_ATTR_CALLABLE
:
8870 str
= "transaction_callable";
8873 str
= "transaction_pure";
8875 case TM_ATTR_IRREVOCABLE
:
8876 str
= "transaction_unsafe";
8878 case TM_ATTR_MAY_CANCEL_OUTER
:
8879 str
= "transaction_may_cancel_outer";
8884 return get_identifier (str
);
8887 /* Return the first TM attribute seen in LIST. */
8890 find_tm_attribute (tree list
)
8892 for (; list
; list
= TREE_CHAIN (list
))
8894 tree name
= TREE_PURPOSE (list
);
8895 if (tm_attr_to_mask (name
) != 0)
8901 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8902 Here we accept only function types, and verify that none of the other
8903 function TM attributes are also applied. */
8904 /* ??? We need to accept class types for C++, but not C. This greatly
8905 complicates this function, since we can no longer rely on the extra
8906 processing given by function_type_required. */
8909 handle_tm_attribute (tree
*node
, tree name
, tree args
,
8910 int flags
, bool *no_add_attrs
)
8912 /* Only one path adds the attribute; others don't. */
8913 *no_add_attrs
= true;
8915 switch (TREE_CODE (*node
))
8919 /* Only tm_callable and tm_safe apply to classes. */
8920 if (tm_attr_to_mask (name
) & ~(TM_ATTR_SAFE
| TM_ATTR_CALLABLE
))
8927 tree old_name
= find_tm_attribute (TYPE_ATTRIBUTES (*node
));
8928 if (old_name
== name
)
8930 else if (old_name
!= NULL_TREE
)
8931 error ("type was previously declared %qE", old_name
);
8933 *no_add_attrs
= false;
8939 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8940 want to set transaction_safe on the type. */
8941 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name
));
8942 if (!TYPE_P (DECL_CONTEXT (*node
)))
8943 error_at (DECL_SOURCE_LOCATION (*node
),
8944 "%<transaction_safe_dynamic%> may only be specified for "
8945 "a virtual function");
8946 *no_add_attrs
= false;
8947 decl_attributes (&TREE_TYPE (*node
),
8948 build_tree_list (get_identifier ("transaction_safe"),
8956 enum tree_code subcode
= TREE_CODE (TREE_TYPE (*node
));
8957 if (subcode
== FUNCTION_TYPE
|| subcode
== METHOD_TYPE
)
8959 tree fn_tmp
= TREE_TYPE (*node
);
8960 decl_attributes (&fn_tmp
, tree_cons (name
, args
, NULL
), 0);
8961 *node
= build_pointer_type (fn_tmp
);
8968 /* If a function is next, pass it on to be tried next. */
8969 if (flags
& (int) ATTR_FLAG_FUNCTION_NEXT
)
8970 return tree_cons (name
, args
, NULL
);
8973 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8980 /* Handle the TM_WRAP attribute; arguments as in
8981 struct attribute_spec.handler. */
8984 handle_tm_wrap_attribute (tree
*node
, tree name
, tree args
,
8985 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8989 /* We don't need the attribute even on success, since we
8990 record the entry in an external table. */
8991 *no_add_attrs
= true;
8993 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8994 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8997 tree wrap_decl
= TREE_VALUE (args
);
8998 if (error_operand_p (wrap_decl
))
9000 else if (TREE_CODE (wrap_decl
) != IDENTIFIER_NODE
9001 && !VAR_OR_FUNCTION_DECL_P (wrap_decl
))
9002 error ("%qE argument not an identifier", name
);
9005 if (TREE_CODE (wrap_decl
) == IDENTIFIER_NODE
)
9006 wrap_decl
= lookup_name (wrap_decl
);
9007 if (wrap_decl
&& TREE_CODE (wrap_decl
) == FUNCTION_DECL
)
9009 if (lang_hooks
.types_compatible_p (TREE_TYPE (decl
),
9010 TREE_TYPE (wrap_decl
)))
9011 record_tm_replacement (wrap_decl
, decl
);
9013 error ("%qD is not compatible with %qD", wrap_decl
, decl
);
9016 error ("%qE argument is not a function", name
);
9023 /* Ignore the given attribute. Used when this attribute may be usefully
9024 overridden by the target, but is not used generically. */
9027 ignore_attribute (tree
* ARG_UNUSED (node
), tree
ARG_UNUSED (name
),
9028 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9031 *no_add_attrs
= true;
9035 /* Handle a "no vops" attribute; arguments as in
9036 struct attribute_spec.handler. */
9039 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9040 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9041 bool *ARG_UNUSED (no_add_attrs
))
9043 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
9044 DECL_IS_NOVOPS (*node
) = 1;
9048 /* Handle a "deprecated" attribute; arguments as in
9049 struct attribute_spec.handler. */
9052 handle_deprecated_attribute (tree
*node
, tree name
,
9053 tree args
, int flags
,
9056 tree type
= NULL_TREE
;
9058 tree what
= NULL_TREE
;
9061 *no_add_attrs
= true;
9062 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
9064 error ("deprecated message is not a string");
9065 *no_add_attrs
= true;
9071 type
= TREE_TYPE (decl
);
9073 if (TREE_CODE (decl
) == TYPE_DECL
9074 || TREE_CODE (decl
) == PARM_DECL
9075 || VAR_OR_FUNCTION_DECL_P (decl
)
9076 || TREE_CODE (decl
) == FIELD_DECL
9077 || TREE_CODE (decl
) == CONST_DECL
9078 || objc_method_decl (TREE_CODE (decl
)))
9079 TREE_DEPRECATED (decl
) = 1;
9083 else if (TYPE_P (*node
))
9085 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
9086 *node
= build_variant_type_copy (*node
);
9087 TREE_DEPRECATED (*node
) = 1;
9095 *no_add_attrs
= true;
9096 if (type
&& TYPE_NAME (type
))
9098 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
9099 what
= TYPE_NAME (*node
);
9100 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
9101 && DECL_NAME (TYPE_NAME (type
)))
9102 what
= DECL_NAME (TYPE_NAME (type
));
9105 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
9107 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9113 /* Handle a "vector_size" attribute; arguments as in
9114 struct attribute_spec.handler. */
9117 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
9118 int ARG_UNUSED (flags
),
9121 unsigned HOST_WIDE_INT vecsize
, nunits
;
9122 machine_mode orig_mode
;
9123 tree type
= *node
, new_type
, size
;
9125 *no_add_attrs
= true;
9127 size
= TREE_VALUE (args
);
9128 if (size
&& TREE_CODE (size
) != IDENTIFIER_NODE
9129 && TREE_CODE (size
) != FUNCTION_DECL
)
9130 size
= default_conversion (size
);
9132 if (!tree_fits_uhwi_p (size
))
9134 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9138 /* Get the vector size (in bytes). */
9139 vecsize
= tree_to_uhwi (size
);
9141 /* We need to provide for vector pointers, vector arrays, and
9142 functions returning vectors. For example:
9144 __attribute__((vector_size(16))) short *foo;
9146 In this case, the mode is SI, but the type being modified is
9147 HI, so we need to look further. */
9149 while (POINTER_TYPE_P (type
)
9150 || TREE_CODE (type
) == FUNCTION_TYPE
9151 || TREE_CODE (type
) == METHOD_TYPE
9152 || TREE_CODE (type
) == ARRAY_TYPE
9153 || TREE_CODE (type
) == OFFSET_TYPE
)
9154 type
= TREE_TYPE (type
);
9156 /* Get the mode of the type being modified. */
9157 orig_mode
= TYPE_MODE (type
);
9159 if ((!INTEGRAL_TYPE_P (type
)
9160 && !SCALAR_FLOAT_TYPE_P (type
)
9161 && !FIXED_POINT_TYPE_P (type
))
9162 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
9163 && GET_MODE_CLASS (orig_mode
) != MODE_INT
9164 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
9165 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
))
9166 || TREE_CODE (type
) == BOOLEAN_TYPE
)
9168 error ("invalid vector type for attribute %qE", name
);
9172 if (vecsize
% tree_to_uhwi (TYPE_SIZE_UNIT (type
)))
9174 error ("vector size not an integral multiple of component size");
9180 error ("zero vector size");
9184 /* Calculate how many units fit in the vector. */
9185 nunits
= vecsize
/ tree_to_uhwi (TYPE_SIZE_UNIT (type
));
9186 if (nunits
& (nunits
- 1))
9188 error ("number of components of the vector not a power of two");
9192 new_type
= build_vector_type (type
, nunits
);
9194 /* Build back pointers if needed. */
9195 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
9200 /* Handle the "nonnull" attribute. */
9202 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9203 tree args
, int ARG_UNUSED (flags
),
9207 unsigned HOST_WIDE_INT attr_arg_num
;
9209 /* If no arguments are specified, all pointer arguments should be
9210 non-null. Verify a full prototype is given so that the arguments
9211 will have the correct types when we actually check them later.
9212 Avoid diagnosing type-generic built-ins since those have no
9216 if (!prototype_p (type
)
9217 && (!TYPE_ATTRIBUTES (type
)
9218 || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type
))))
9220 error ("nonnull attribute without arguments on a non-prototype");
9221 *no_add_attrs
= true;
9226 /* Argument list specified. Verify that each argument number references
9227 a pointer argument. */
9228 for (attr_arg_num
= 1; args
; attr_arg_num
++, args
= TREE_CHAIN (args
))
9230 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
9232 tree arg
= TREE_VALUE (args
);
9233 if (arg
&& TREE_CODE (arg
) != IDENTIFIER_NODE
9234 && TREE_CODE (arg
) != FUNCTION_DECL
)
9235 arg
= default_conversion (arg
);
9237 if (!get_nonnull_operand (arg
, &arg_num
))
9239 error ("nonnull argument has invalid operand number (argument %lu)",
9240 (unsigned long) attr_arg_num
);
9241 *no_add_attrs
= true;
9245 if (prototype_p (type
))
9247 function_args_iterator iter
;
9250 function_args_iter_init (&iter
, type
);
9251 for (ck_num
= 1; ; ck_num
++, function_args_iter_next (&iter
))
9253 argument
= function_args_iter_cond (&iter
);
9254 if (argument
== NULL_TREE
|| ck_num
== arg_num
)
9259 || TREE_CODE (argument
) == VOID_TYPE
)
9261 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
9262 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9263 *no_add_attrs
= true;
9267 if (TREE_CODE (argument
) != POINTER_TYPE
)
9269 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
9270 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9271 *no_add_attrs
= true;
9280 /* Check the argument list of a function call for null in argument slots
9281 that are marked as requiring a non-null pointer argument. The NARGS
9282 arguments are passed in the array ARGARRAY. */
9285 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
9290 attrs
= lookup_attribute ("nonnull", attrs
);
9291 if (attrs
== NULL_TREE
)
9295 /* See if any of the nonnull attributes has no arguments. If so,
9296 then every pointer argument is checked (in which case the check
9297 for pointer type is done in check_nonnull_arg). */
9298 if (TREE_VALUE (a
) != NULL_TREE
)
9300 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
9301 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
9304 for (i
= 0; i
< nargs
; i
++)
9305 check_function_arguments_recurse (check_nonnull_arg
, &loc
, argarray
[i
],
9309 /* Walk the argument list. If we encounter an argument number we
9310 should check for non-null, do it. */
9311 for (i
= 0; i
< nargs
; i
++)
9313 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
9315 a
= lookup_attribute ("nonnull", a
);
9316 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
9321 check_function_arguments_recurse (check_nonnull_arg
, &loc
,
9322 argarray
[i
], i
+ 1);
9327 /* Check that the Nth argument of a function call (counting backwards
9328 from the end) is a (pointer)0. The NARGS arguments are passed in the
9332 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
9334 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
9341 function_args_iterator iter
;
9344 /* Skip over the named arguments. */
9345 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
9352 if (TREE_VALUE (attr
))
9354 tree p
= TREE_VALUE (TREE_VALUE (attr
));
9355 pos
= TREE_INT_CST_LOW (p
);
9358 /* The sentinel must be one of the varargs, i.e.
9359 in position >= the number of fixed arguments. */
9360 if ((nargs
- 1 - pos
) < len
)
9362 warning (OPT_Wformat_
,
9363 "not enough variable arguments to fit a sentinel");
9367 /* Validate the sentinel. */
9368 sentinel
= argarray
[nargs
- 1 - pos
];
9369 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
9370 || !integer_zerop (sentinel
))
9371 /* Although __null (in C++) is only an integer we allow it
9372 nevertheless, as we are guaranteed that it's exactly
9373 as wide as a pointer, and we don't want to force
9374 users to cast the NULL they have written there.
9375 We warn with -Wstrict-null-sentinel, though. */
9376 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
9377 warning (OPT_Wformat_
, "missing sentinel in function call");
9381 /* Helper for check_function_nonnull; given a list of operands which
9382 must be non-null in ARGS, determine if operand PARAM_NUM should be
9386 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
9388 unsigned HOST_WIDE_INT arg_num
= 0;
9390 for (; args
; args
= TREE_CHAIN (args
))
9392 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
9396 if (arg_num
== param_num
)
9402 /* Check that the function argument PARAM (which is operand number
9403 PARAM_NUM) is non-null. This is called by check_function_nonnull
9404 via check_function_arguments_recurse. */
9407 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
9409 location_t
*ploc
= (location_t
*) ctx
;
9411 /* Just skip checking the argument if it's not a pointer. This can
9412 happen if the "nonnull" attribute was given without an operand
9413 list (which means to check every pointer argument). */
9415 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
9418 if (integer_zerop (param
))
9419 warning_at (*ploc
, OPT_Wnonnull
, "null argument where non-null required "
9420 "(argument %lu)", (unsigned long) param_num
);
9423 /* Helper for nonnull attribute handling; fetch the operand number
9424 from the attribute argument list. */
9427 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
9429 /* Verify the arg number is a small constant. */
9430 if (tree_fits_uhwi_p (arg_num_expr
))
9432 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
9439 /* Handle a "nothrow" attribute; arguments as in
9440 struct attribute_spec.handler. */
9443 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9444 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9446 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9447 TREE_NOTHROW (*node
) = 1;
9448 /* ??? TODO: Support types. */
9451 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9452 *no_add_attrs
= true;
9458 /* Handle a "cleanup" attribute; arguments as in
9459 struct attribute_spec.handler. */
9462 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
9463 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9466 tree cleanup_id
, cleanup_decl
;
9468 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9469 for global destructors in C++. This requires infrastructure that
9470 we don't have generically at the moment. It's also not a feature
9471 we'd be missing too much, since we do have attribute constructor. */
9472 if (!VAR_P (decl
) || TREE_STATIC (decl
))
9474 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9475 *no_add_attrs
= true;
9479 /* Verify that the argument is a function in scope. */
9480 /* ??? We could support pointers to functions here as well, if
9481 that was considered desirable. */
9482 cleanup_id
= TREE_VALUE (args
);
9483 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
9485 error ("cleanup argument not an identifier");
9486 *no_add_attrs
= true;
9489 cleanup_decl
= lookup_name (cleanup_id
);
9490 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
9492 error ("cleanup argument not a function");
9493 *no_add_attrs
= true;
9497 /* That the function has proper type is checked with the
9498 eventual call to build_function_call. */
9503 /* Handle a "warn_unused_result" attribute. No special handling. */
9506 handle_warn_unused_result_attribute (tree
*node
, tree name
,
9507 tree
ARG_UNUSED (args
),
9508 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9510 /* Ignore the attribute for functions not returning any value. */
9511 if (VOID_TYPE_P (TREE_TYPE (*node
)))
9513 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9514 *no_add_attrs
= true;
9520 /* Handle a "sentinel" attribute. */
9523 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
9524 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9526 if (!prototype_p (*node
))
9528 warning (OPT_Wattributes
,
9529 "%qE attribute requires prototypes with named arguments", name
);
9530 *no_add_attrs
= true;
9534 if (!stdarg_p (*node
))
9536 warning (OPT_Wattributes
,
9537 "%qE attribute only applies to variadic functions", name
);
9538 *no_add_attrs
= true;
9544 tree position
= TREE_VALUE (args
);
9545 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
9546 && TREE_CODE (position
) != FUNCTION_DECL
)
9547 position
= default_conversion (position
);
9549 if (TREE_CODE (position
) != INTEGER_CST
9550 || !INTEGRAL_TYPE_P (TREE_TYPE (position
)))
9552 warning (OPT_Wattributes
,
9553 "requested position is not an integer constant");
9554 *no_add_attrs
= true;
9558 if (tree_int_cst_lt (position
, integer_zero_node
))
9560 warning (OPT_Wattributes
,
9561 "requested position is less than zero");
9562 *no_add_attrs
= true;
9570 /* Handle a "type_generic" attribute. */
9573 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9574 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9575 bool * ARG_UNUSED (no_add_attrs
))
9577 /* Ensure we have a function type. */
9578 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
9580 /* Ensure we have a variadic function. */
9581 gcc_assert (!prototype_p (*node
) || stdarg_p (*node
));
9586 /* Handle a "target" attribute. */
9589 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
9592 /* Ensure we have a function type. */
9593 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9595 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9596 *no_add_attrs
= true;
9598 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
9600 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9601 "with %qs attribute", name
, "target_clones");
9602 *no_add_attrs
= true;
9604 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
9606 *no_add_attrs
= true;
9611 /* Handle a "target_clones" attribute. */
9614 handle_target_clones_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9615 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9617 /* Ensure we have a function type. */
9618 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9620 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
9622 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9623 "with %qs attribute", name
, "always_inline");
9624 *no_add_attrs
= true;
9626 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node
)))
9628 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9629 "with %qs attribute", name
, "target");
9630 *no_add_attrs
= true;
9633 /* Do not inline functions with multiple clone targets. */
9634 DECL_UNINLINABLE (*node
) = 1;
9638 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9639 *no_add_attrs
= true;
9644 /* Arguments being collected for optimization. */
9645 typedef const char *const_char_p
; /* For DEF_VEC_P. */
9646 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
9649 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9650 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9651 false for #pragma GCC optimize. */
9654 parse_optimize_options (tree args
, bool attr_p
)
9659 const char **opt_argv
;
9660 struct cl_decoded_option
*decoded_options
;
9661 unsigned int decoded_options_count
;
9664 /* Build up argv vector. Just in case the string is stored away, use garbage
9665 collected strings. */
9666 vec_safe_truncate (optimize_args
, 0);
9667 vec_safe_push (optimize_args
, (const char *) NULL
);
9669 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
9671 tree value
= TREE_VALUE (ap
);
9673 if (TREE_CODE (value
) == INTEGER_CST
)
9676 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
9677 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
9680 else if (TREE_CODE (value
) == STRING_CST
)
9682 /* Split string into multiple substrings. */
9683 size_t len
= TREE_STRING_LENGTH (value
);
9684 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
9685 char *end
= p
+ len
;
9689 while (next_p
!= NULL
)
9695 comma
= strchr (p
, ',');
9708 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
9710 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9712 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
9716 warning (OPT_Wattributes
,
9717 "bad option %qs to attribute %<optimize%>", p
);
9719 warning (OPT_Wpragmas
,
9720 "bad option %qs to pragma %<optimize%>", p
);
9728 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9729 itself is -Os, and any other switch begins with a -f. */
9730 if ((*p
>= '0' && *p
<= '9')
9731 || (p
[0] == 's' && p
[1] == '\0'))
9737 memcpy (r
, p
, len2
);
9739 vec_safe_push (optimize_args
, (const char *) q
);
9745 opt_argc
= optimize_args
->length ();
9746 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
9748 for (i
= 1; i
< opt_argc
; i
++)
9749 opt_argv
[i
] = (*optimize_args
)[i
];
9751 /* Now parse the options. */
9752 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
9754 &decoded_options_count
);
9755 /* Drop non-Optimization options. */
9757 for (i
= 1; i
< decoded_options_count
; ++i
)
9759 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
9763 warning (OPT_Wattributes
,
9764 "bad option %qs to attribute %<optimize%>",
9765 decoded_options
[i
].orig_option_with_args_text
);
9767 warning (OPT_Wpragmas
,
9768 "bad option %qs to pragma %<optimize%>",
9769 decoded_options
[i
].orig_option_with_args_text
);
9773 decoded_options
[j
] = decoded_options
[i
];
9776 decoded_options_count
= j
;
9777 /* And apply them. */
9778 decode_options (&global_options
, &global_options_set
,
9779 decoded_options
, decoded_options_count
,
9780 input_location
, global_dc
);
9782 targetm
.override_options_after_change();
9784 optimize_args
->truncate (0);
9788 /* For handling "optimize" attribute. arguments as in
9789 struct attribute_spec.handler. */
9792 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
9793 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9795 /* Ensure we have a function type. */
9796 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9798 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9799 *no_add_attrs
= true;
9803 struct cl_optimization cur_opts
;
9804 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
9806 /* Save current options. */
9807 cl_optimization_save (&cur_opts
, &global_options
);
9809 /* If we previously had some optimization options, use them as the
9812 cl_optimization_restore (&global_options
,
9813 TREE_OPTIMIZATION (old_opts
));
9815 /* Parse options, and update the vector. */
9816 parse_optimize_options (args
, true);
9817 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
9818 = build_optimization_node (&global_options
);
9820 /* Restore current options. */
9821 cl_optimization_restore (&global_options
, &cur_opts
);
9827 /* Handle a "no_split_stack" attribute. */
9830 handle_no_split_stack_attribute (tree
*node
, tree name
,
9831 tree
ARG_UNUSED (args
),
9832 int ARG_UNUSED (flags
),
9837 if (TREE_CODE (decl
) != FUNCTION_DECL
)
9839 error_at (DECL_SOURCE_LOCATION (decl
),
9840 "%qE attribute applies only to functions", name
);
9841 *no_add_attrs
= true;
9843 else if (DECL_INITIAL (decl
))
9845 error_at (DECL_SOURCE_LOCATION (decl
),
9846 "can%'t set %qE attribute after definition", name
);
9847 *no_add_attrs
= true;
9853 /* Handle a "returns_nonnull" attribute; arguments as in
9854 struct attribute_spec.handler. */
9857 handle_returns_nonnull_attribute (tree
*node
, tree
, tree
, int,
9860 // Even without a prototype we still have a return type we can check.
9861 if (TREE_CODE (TREE_TYPE (*node
)) != POINTER_TYPE
)
9863 error ("returns_nonnull attribute on a function not returning a pointer");
9864 *no_add_attrs
= true;
9869 /* Handle a "designated_init" attribute; arguments as in
9870 struct attribute_spec.handler. */
9873 handle_designated_init_attribute (tree
*node
, tree name
, tree
, int,
9876 if (TREE_CODE (*node
) != RECORD_TYPE
)
9878 error ("%qE attribute is only valid on %<struct%> type", name
);
9879 *no_add_attrs
= true;
9885 /* Check for valid arguments being passed to a function with FNTYPE.
9886 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9889 check_function_arguments (location_t loc
, const_tree fntype
, int nargs
,
9892 /* Check for null being passed in a pointer argument that must be
9893 non-null. We also need to do this if format checking is enabled. */
9896 check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9898 /* Check for errors in format strings. */
9900 if (warn_format
|| warn_suggest_attribute_format
)
9901 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9904 check_function_sentinel (fntype
, nargs
, argarray
);
9907 /* Generic argument checking recursion routine. PARAM is the argument to
9908 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9909 once the argument is resolved. CTX is context for the callback. */
9911 check_function_arguments_recurse (void (*callback
)
9912 (void *, tree
, unsigned HOST_WIDE_INT
),
9913 void *ctx
, tree param
,
9914 unsigned HOST_WIDE_INT param_num
)
9916 if (CONVERT_EXPR_P (param
)
9917 && (TYPE_PRECISION (TREE_TYPE (param
))
9918 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
9920 /* Strip coercion. */
9921 check_function_arguments_recurse (callback
, ctx
,
9922 TREE_OPERAND (param
, 0), param_num
);
9926 if (TREE_CODE (param
) == CALL_EXPR
)
9928 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
9930 bool found_format_arg
= false;
9932 /* See if this is a call to a known internationalization function
9933 that modifies a format arg. Such a function may have multiple
9934 format_arg attributes (for example, ngettext). */
9936 for (attrs
= TYPE_ATTRIBUTES (type
);
9938 attrs
= TREE_CHAIN (attrs
))
9939 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
9942 tree format_num_expr
;
9945 call_expr_arg_iterator iter
;
9947 /* Extract the argument number, which was previously checked
9949 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
9951 format_num
= tree_to_uhwi (format_num_expr
);
9953 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
9955 inner_arg
= next_call_expr_arg (&iter
), i
++)
9956 if (i
== format_num
)
9958 check_function_arguments_recurse (callback
, ctx
,
9959 inner_arg
, param_num
);
9960 found_format_arg
= true;
9965 /* If we found a format_arg attribute and did a recursive check,
9966 we are done with checking this argument. Otherwise, we continue
9967 and this will be considered a non-literal. */
9968 if (found_format_arg
)
9972 if (TREE_CODE (param
) == COND_EXPR
)
9974 /* Simplify to avoid warning for an impossible case. */
9975 param
= fold_for_warn (param
);
9976 if (TREE_CODE (param
) == COND_EXPR
)
9978 /* Check both halves of the conditional expression. */
9979 check_function_arguments_recurse (callback
, ctx
,
9980 TREE_OPERAND (param
, 1),
9982 check_function_arguments_recurse (callback
, ctx
,
9983 TREE_OPERAND (param
, 2),
9989 (*callback
) (ctx
, param
, param_num
);
9992 /* Checks for a builtin function FNDECL that the number of arguments
9993 NARGS against the required number REQUIRED and issues an error if
9994 there is a mismatch. Returns true if the number of arguments is
9995 correct, otherwise false. LOC is the location of FNDECL. */
9998 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
10001 if (nargs
< required
)
10003 error_at (loc
, "too few arguments to function %qE", fndecl
);
10006 else if (nargs
> required
)
10008 error_at (loc
, "too many arguments to function %qE", fndecl
);
10014 /* Helper macro for check_builtin_function_arguments. */
10015 #define ARG_LOCATION(N) \
10016 (arg_loc.is_empty () \
10017 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
10018 : expansion_point_location (arg_loc[(N)]))
10020 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
10021 Returns false if there was an error, otherwise true. LOC is the
10022 location of the function; ARG_LOC is a vector of locations of the
10026 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
10027 tree fndecl
, int nargs
, tree
*args
)
10029 if (!DECL_BUILT_IN (fndecl
)
10030 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
10033 switch (DECL_FUNCTION_CODE (fndecl
))
10035 case BUILT_IN_ALLOCA_WITH_ALIGN
:
10037 /* Get the requested alignment (in bits) if it's a constant
10038 integer expression. */
10039 unsigned HOST_WIDE_INT align
10040 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
10042 /* Determine if the requested alignment is a power of 2. */
10043 if ((align
& (align
- 1)))
10046 /* The maximum alignment in bits corresponding to the same
10047 maximum in bytes enforced in check_user_alignment(). */
10048 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
10050 /* Reject invalid alignments. */
10051 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
10053 error_at (ARG_LOCATION (1),
10054 "second argument to function %qE must be a constant "
10055 "integer power of 2 between %qi and %qu bits",
10056 fndecl
, BITS_PER_UNIT
, maxalign
);
10062 case BUILT_IN_CONSTANT_P
:
10063 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
10065 case BUILT_IN_ISFINITE
:
10066 case BUILT_IN_ISINF
:
10067 case BUILT_IN_ISINF_SIGN
:
10068 case BUILT_IN_ISNAN
:
10069 case BUILT_IN_ISNORMAL
:
10070 case BUILT_IN_SIGNBIT
:
10071 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
10073 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
10075 error_at (ARG_LOCATION (0), "non-floating-point argument in "
10076 "call to function %qE", fndecl
);
10083 case BUILT_IN_ISGREATER
:
10084 case BUILT_IN_ISGREATEREQUAL
:
10085 case BUILT_IN_ISLESS
:
10086 case BUILT_IN_ISLESSEQUAL
:
10087 case BUILT_IN_ISLESSGREATER
:
10088 case BUILT_IN_ISUNORDERED
:
10089 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
10091 enum tree_code code0
, code1
;
10092 code0
= TREE_CODE (TREE_TYPE (args
[0]));
10093 code1
= TREE_CODE (TREE_TYPE (args
[1]));
10094 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
10095 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
10096 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
10098 error_at (loc
, "non-floating-point arguments in call to "
10099 "function %qE", fndecl
);
10106 case BUILT_IN_FPCLASSIFY
:
10107 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
10109 for (unsigned int i
= 0; i
< 5; i
++)
10110 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
10112 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
10113 "call to function %qE", i
+ 1, fndecl
);
10117 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
10119 error_at (ARG_LOCATION (5), "non-floating-point argument in "
10120 "call to function %qE", fndecl
);
10127 case BUILT_IN_ASSUME_ALIGNED
:
10128 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
10130 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
10132 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
10133 "function %qE", fndecl
);
10140 case BUILT_IN_ADD_OVERFLOW
:
10141 case BUILT_IN_SUB_OVERFLOW
:
10142 case BUILT_IN_MUL_OVERFLOW
:
10143 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10146 for (i
= 0; i
< 2; i
++)
10147 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10149 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10150 "%qE does not have integral type", i
+ 1, fndecl
);
10153 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
10154 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
10156 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10157 "does not have pointer to integral type", fndecl
);
10160 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
10162 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10163 "has pointer to enumerated type", fndecl
);
10166 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
10168 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10169 "has pointer to boolean type", fndecl
);
10176 case BUILT_IN_ADD_OVERFLOW_P
:
10177 case BUILT_IN_SUB_OVERFLOW_P
:
10178 case BUILT_IN_MUL_OVERFLOW_P
:
10179 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10182 for (i
= 0; i
< 3; i
++)
10183 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10185 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10186 "%qE does not have integral type", i
+ 1, fndecl
);
10189 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
10191 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10192 "%qE has enumerated type", fndecl
);
10195 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
10197 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10198 "%qE has boolean type", fndecl
);
10210 /* Function to help qsort sort FIELD_DECLs by name order. */
10213 field_decl_cmp (const void *x_p
, const void *y_p
)
10215 const tree
*const x
= (const tree
*const) x_p
;
10216 const tree
*const y
= (const tree
*const) y_p
;
10218 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10219 /* A nontype is "greater" than a type. */
10220 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10221 if (DECL_NAME (*x
) == NULL_TREE
)
10223 if (DECL_NAME (*y
) == NULL_TREE
)
10225 if (DECL_NAME (*x
) < DECL_NAME (*y
))
10231 gt_pointer_operator new_value
;
10235 /* This routine compares two fields like field_decl_cmp but using the
10236 pointer operator in resort_data. */
10239 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
10241 const tree
*const x
= (const tree
*const) x_p
;
10242 const tree
*const y
= (const tree
*const) y_p
;
10244 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10245 /* A nontype is "greater" than a type. */
10246 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10247 if (DECL_NAME (*x
) == NULL_TREE
)
10249 if (DECL_NAME (*y
) == NULL_TREE
)
10252 tree d1
= DECL_NAME (*x
);
10253 tree d2
= DECL_NAME (*y
);
10254 resort_data
.new_value (&d1
, resort_data
.cookie
);
10255 resort_data
.new_value (&d2
, resort_data
.cookie
);
10262 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10265 resort_sorted_fields (void *obj
,
10266 void * ARG_UNUSED (orig_obj
),
10267 gt_pointer_operator new_value
,
10270 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
10271 resort_data
.new_value
= new_value
;
10272 resort_data
.cookie
= cookie
;
10273 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
10274 resort_field_decl_cmp
);
10277 /* Subroutine of c_parse_error.
10278 Return the result of concatenating LHS and RHS. RHS is really
10279 a string literal, its first character is indicated by RHS_START and
10280 RHS_SIZE is its length (including the terminating NUL character).
10282 The caller is responsible for deleting the returned pointer. */
10285 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
10287 const int lhs_size
= strlen (lhs
);
10288 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
10289 strncpy (result
, lhs
, lhs_size
);
10290 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
10294 /* Issue the error given by GMSGID, indicating that it occurred before
10295 TOKEN, which had the associated VALUE. */
10298 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
10299 tree value
, unsigned char token_flags
)
10301 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10303 char *message
= NULL
;
10305 if (token_type
== CPP_EOF
)
10306 message
= catenate_messages (gmsgid
, " at end of input");
10307 else if (token_type
== CPP_CHAR
10308 || token_type
== CPP_WCHAR
10309 || token_type
== CPP_CHAR16
10310 || token_type
== CPP_CHAR32
10311 || token_type
== CPP_UTF8CHAR
)
10313 unsigned int val
= TREE_INT_CST_LOW (value
);
10314 const char *prefix
;
10316 switch (token_type
)
10335 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
10336 message
= catenate_messages (gmsgid
, " before %s'%c'");
10338 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
10340 error (message
, prefix
, val
);
10344 else if (token_type
== CPP_CHAR_USERDEF
10345 || token_type
== CPP_WCHAR_USERDEF
10346 || token_type
== CPP_CHAR16_USERDEF
10347 || token_type
== CPP_CHAR32_USERDEF
10348 || token_type
== CPP_UTF8CHAR_USERDEF
)
10349 message
= catenate_messages (gmsgid
,
10350 " before user-defined character literal");
10351 else if (token_type
== CPP_STRING_USERDEF
10352 || token_type
== CPP_WSTRING_USERDEF
10353 || token_type
== CPP_STRING16_USERDEF
10354 || token_type
== CPP_STRING32_USERDEF
10355 || token_type
== CPP_UTF8STRING_USERDEF
)
10356 message
= catenate_messages (gmsgid
, " before user-defined string literal");
10357 else if (token_type
== CPP_STRING
10358 || token_type
== CPP_WSTRING
10359 || token_type
== CPP_STRING16
10360 || token_type
== CPP_STRING32
10361 || token_type
== CPP_UTF8STRING
)
10362 message
= catenate_messages (gmsgid
, " before string constant");
10363 else if (token_type
== CPP_NUMBER
)
10364 message
= catenate_messages (gmsgid
, " before numeric constant");
10365 else if (token_type
== CPP_NAME
)
10367 message
= catenate_messages (gmsgid
, " before %qE");
10368 error (message
, value
);
10372 else if (token_type
== CPP_PRAGMA
)
10373 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
10374 else if (token_type
== CPP_PRAGMA_EOL
)
10375 message
= catenate_messages (gmsgid
, " before end of line");
10376 else if (token_type
== CPP_DECLTYPE
)
10377 message
= catenate_messages (gmsgid
, " before %<decltype%>");
10378 else if (token_type
< N_TTYPES
)
10380 message
= catenate_messages (gmsgid
, " before %qs token");
10381 error (message
, cpp_type2name (token_type
, token_flags
));
10393 #undef catenate_messages
10396 /* Return the gcc option code associated with the reason for a cpp
10397 message, or 0 if none. */
10400 c_option_controlling_cpp_error (int reason
)
10402 const struct cpp_reason_option_codes_t
*entry
;
10404 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
10406 if (entry
->reason
== reason
)
10407 return entry
->option_code
;
10412 /* Callback from cpp_error for PFILE to print diagnostics from the
10413 preprocessor. The diagnostic is of type LEVEL, with REASON set
10414 to the reason code if LEVEL is represents a warning, at location
10415 RICHLOC unless this is after lexing and the compiler's location
10416 should be used instead; MSG is the translated message and AP
10417 the arguments. Returns true if a diagnostic was emitted, false
10421 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
10422 rich_location
*richloc
,
10423 const char *msg
, va_list *ap
)
10425 diagnostic_info diagnostic
;
10426 diagnostic_t dlevel
;
10427 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
10432 case CPP_DL_WARNING_SYSHDR
:
10433 if (flag_no_output
)
10435 global_dc
->dc_warn_system_headers
= 1;
10436 /* Fall through. */
10437 case CPP_DL_WARNING
:
10438 if (flag_no_output
)
10440 dlevel
= DK_WARNING
;
10442 case CPP_DL_PEDWARN
:
10443 if (flag_no_output
&& !flag_pedantic_errors
)
10445 dlevel
= DK_PEDWARN
;
10460 gcc_unreachable ();
10463 richloc
->set_range (line_table
, 0, input_location
, true);
10464 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
10466 diagnostic_override_option_index (&diagnostic
,
10467 c_option_controlling_cpp_error (reason
));
10468 ret
= report_diagnostic (&diagnostic
);
10469 if (level
== CPP_DL_WARNING_SYSHDR
)
10470 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
10474 /* Convert a character from the host to the target execution character
10475 set. cpplib handles this, mostly. */
10478 c_common_to_target_charset (HOST_WIDE_INT c
)
10480 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10481 zero-extended under -fno-signed-char. cpplib insists that characters
10482 and character constants are always unsigned. Hence we must convert
10484 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
10486 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
10488 if (flag_signed_char
)
10489 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
10490 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
10495 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10496 references with an INDIRECT_REF of a constant at the bottom; much like the
10497 traditional rendering of offsetof as a macro. Return the folded result. */
10500 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
10503 tree_code code
= TREE_CODE (expr
);
10510 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
10511 return error_mark_node
;
10515 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10516 return error_mark_node
;
10520 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
10522 error ("cannot apply %<offsetof%> to a non constant address");
10523 return error_mark_node
;
10525 return TREE_OPERAND (expr
, 0);
10527 case COMPONENT_REF
:
10528 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10529 if (base
== error_mark_node
)
10532 t
= TREE_OPERAND (expr
, 1);
10533 if (DECL_C_BIT_FIELD (t
))
10535 error ("attempt to take address of bit-field structure "
10537 return error_mark_node
;
10539 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
10540 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
10545 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10546 if (base
== error_mark_node
)
10549 t
= TREE_OPERAND (expr
, 1);
10551 /* Check if the offset goes beyond the upper bound of the array. */
10552 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
10554 tree upbound
= array_ref_up_bound (expr
);
10555 if (upbound
!= NULL_TREE
10556 && TREE_CODE (upbound
) == INTEGER_CST
10557 && !tree_int_cst_equal (upbound
,
10558 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
10560 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
10561 upbound
= size_binop (PLUS_EXPR
, upbound
,
10562 build_int_cst (TREE_TYPE (upbound
), 1));
10563 if (tree_int_cst_lt (upbound
, t
))
10567 for (v
= TREE_OPERAND (expr
, 0);
10568 TREE_CODE (v
) == COMPONENT_REF
;
10569 v
= TREE_OPERAND (v
, 0))
10570 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
10573 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
10574 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
10575 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
10581 /* Don't warn if the array might be considered a poor
10582 man's flexible array member with a very permissive
10583 definition thereof. */
10584 if (TREE_CODE (v
) == ARRAY_REF
10585 || TREE_CODE (v
) == COMPONENT_REF
)
10586 warning (OPT_Warray_bounds
,
10587 "index %E denotes an offset "
10588 "greater than size of %qT",
10589 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
10594 t
= convert (sizetype
, t
);
10595 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
10598 case COMPOUND_EXPR
:
10599 /* Handle static members of volatile structs. */
10600 t
= TREE_OPERAND (expr
, 1);
10601 gcc_assert (VAR_P (t
));
10602 return fold_offsetof_1 (t
);
10605 gcc_unreachable ();
10608 return fold_build_pointer_plus (base
, off
);
10611 /* Likewise, but convert it to the return type of offsetof. */
10614 fold_offsetof (tree expr
)
10616 return convert (size_type_node
, fold_offsetof_1 (expr
));
10619 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10620 expression, because B will always be true. */
10623 warn_for_omitted_condop (location_t location
, tree cond
)
10625 if (truth_value_p (TREE_CODE (cond
)))
10626 warning_at (location
, OPT_Wparentheses
,
10627 "the omitted middle operand in ?: will always be %<true%>, "
10628 "suggest explicit middle operand");
10631 /* Give an error for storing into ARG, which is 'const'. USE indicates
10632 how ARG was being used. */
10635 readonly_error (location_t loc
, tree arg
, enum lvalue_use use
)
10637 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
10639 /* Using this macro rather than (for example) arrays of messages
10640 ensures that all the format strings are checked at compile
10642 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10643 : (use == lv_increment ? (I) \
10644 : (use == lv_decrement ? (D) : (AS))))
10645 if (TREE_CODE (arg
) == COMPONENT_REF
)
10647 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
10648 error_at (loc
, READONLY_MSG (G_("assignment of member "
10649 "%qD in read-only object"),
10650 G_("increment of member "
10651 "%qD in read-only object"),
10652 G_("decrement of member "
10653 "%qD in read-only object"),
10654 G_("member %qD in read-only object "
10655 "used as %<asm%> output")),
10656 TREE_OPERAND (arg
, 1));
10658 error_at (loc
, READONLY_MSG (G_("assignment of read-only member %qD"),
10659 G_("increment of read-only member %qD"),
10660 G_("decrement of read-only member %qD"),
10661 G_("read-only member %qD used as %<asm%> output")),
10662 TREE_OPERAND (arg
, 1));
10664 else if (VAR_P (arg
))
10665 error_at (loc
, READONLY_MSG (G_("assignment of read-only variable %qD"),
10666 G_("increment of read-only variable %qD"),
10667 G_("decrement of read-only variable %qD"),
10668 G_("read-only variable %qD used as %<asm%> output")),
10670 else if (TREE_CODE (arg
) == PARM_DECL
)
10671 error_at (loc
, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10672 G_("increment of read-only parameter %qD"),
10673 G_("decrement of read-only parameter %qD"),
10674 G_("read-only parameter %qD use as %<asm%> output")),
10676 else if (TREE_CODE (arg
) == RESULT_DECL
)
10678 gcc_assert (c_dialect_cxx ());
10679 error_at (loc
, READONLY_MSG (G_("assignment of "
10680 "read-only named return value %qD"),
10682 "read-only named return value %qD"),
10684 "read-only named return value %qD"),
10685 G_("read-only named return value %qD "
10686 "used as %<asm%>output")),
10689 else if (TREE_CODE (arg
) == FUNCTION_DECL
)
10690 error_at (loc
, READONLY_MSG (G_("assignment of function %qD"),
10691 G_("increment of function %qD"),
10692 G_("decrement of function %qD"),
10693 G_("function %qD used as %<asm%> output")),
10696 error_at (loc
, READONLY_MSG (G_("assignment of read-only location %qE"),
10697 G_("increment of read-only location %qE"),
10698 G_("decrement of read-only location %qE"),
10699 G_("read-only location %qE used as %<asm%> output")),
10703 /* Print an error message for an invalid lvalue. USE says
10704 how the lvalue is being used and so selects the error message. LOC
10705 is the location for the error. */
10708 lvalue_error (location_t loc
, enum lvalue_use use
)
10713 error_at (loc
, "lvalue required as left operand of assignment");
10716 error_at (loc
, "lvalue required as increment operand");
10719 error_at (loc
, "lvalue required as decrement operand");
10722 error_at (loc
, "lvalue required as unary %<&%> operand");
10725 error_at (loc
, "lvalue required in asm statement");
10728 gcc_unreachable ();
10732 /* Print an error message for an invalid indirection of type TYPE.
10733 ERRSTRING is the name of the operator for the indirection. */
10736 invalid_indirection_error (location_t loc
, tree type
, ref_operator errstring
)
10741 gcc_assert (c_dialect_cxx ());
10742 error_at (loc
, "invalid type argument (have %qT)", type
);
10744 case RO_ARRAY_INDEXING
:
10746 "invalid type argument of array indexing (have %qT)",
10749 case RO_UNARY_STAR
:
10751 "invalid type argument of unary %<*%> (have %qT)",
10756 "invalid type argument of %<->%> (have %qT)",
10759 case RO_ARROW_STAR
:
10761 "invalid type argument of %<->*%> (have %qT)",
10764 case RO_IMPLICIT_CONVERSION
:
10766 "invalid type argument of implicit conversion (have %qT)",
10770 gcc_unreachable ();
10774 /* *PTYPE is an incomplete array. Complete it with a domain based on
10775 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10776 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10777 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10780 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
10782 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
10783 int failure
= 0, quals
;
10784 hashval_t hashcode
= 0;
10785 bool overflow_p
= false;
10787 maxindex
= size_zero_node
;
10790 if (TREE_CODE (initial_value
) == STRING_CST
)
10793 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
10794 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
10796 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
10798 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
10800 if (vec_safe_is_empty (v
))
10804 maxindex
= ssize_int (-1);
10809 unsigned HOST_WIDE_INT cnt
;
10810 constructor_elt
*ce
;
10811 bool fold_p
= false;
10814 maxindex
= (*v
)[0].index
, fold_p
= true;
10816 curindex
= maxindex
;
10818 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
10820 bool curfold_p
= false;
10822 curindex
= ce
->index
, curfold_p
= true;
10827 /* Since we treat size types now as ordinary
10828 unsigned types, we need an explicit overflow
10830 tree orig
= curindex
;
10831 curindex
= fold_convert (sizetype
, curindex
);
10832 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
10834 curindex
= size_binop (PLUS_EXPR
, curindex
,
10837 if (tree_int_cst_lt (maxindex
, curindex
))
10838 maxindex
= curindex
, fold_p
= curfold_p
;
10842 tree orig
= maxindex
;
10843 maxindex
= fold_convert (sizetype
, maxindex
);
10844 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
10850 /* Make an error message unless that happened already. */
10851 if (initial_value
!= error_mark_node
)
10863 elt
= TREE_TYPE (type
);
10864 quals
= TYPE_QUALS (strip_array_types (elt
));
10868 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
10870 /* Using build_distinct_type_copy and modifying things afterward instead
10871 of using build_array_type to create a new type preserves all of the
10872 TYPE_LANG_FLAG_? bits that the front end may have set. */
10873 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
10874 TREE_TYPE (main_type
) = unqual_elt
;
10875 TYPE_DOMAIN (main_type
)
10876 = build_range_type (TREE_TYPE (maxindex
),
10877 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
10878 layout_type (main_type
);
10880 /* Make sure we have the canonical MAIN_TYPE. */
10881 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
10882 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
10884 main_type
= type_hash_canon (hashcode
, main_type
);
10886 /* Fix the canonical type. */
10887 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
10888 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
10889 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
10890 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
10891 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
10892 != TYPE_DOMAIN (main_type
)))
10893 TYPE_CANONICAL (main_type
)
10894 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
10895 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
10897 TYPE_CANONICAL (main_type
) = main_type
;
10902 type
= c_build_qualified_type (main_type
, quals
);
10904 if (COMPLETE_TYPE_P (type
)
10905 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
10906 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
10908 error ("size of array is too large");
10909 /* If we proceed with the array type as it is, we'll eventually
10910 crash in tree_to_[su]hwi(). */
10911 type
= error_mark_node
;
10918 /* Like c_mark_addressable but don't check register qualifier. */
10920 c_common_mark_addressable_vec (tree t
)
10922 while (handled_component_p (t
))
10923 t
= TREE_OPERAND (t
, 0);
10925 && TREE_CODE (t
) != PARM_DECL
10926 && TREE_CODE (t
) != COMPOUND_LITERAL_EXPR
)
10928 TREE_ADDRESSABLE (t
) = 1;
10933 /* Used to help initialize the builtin-types.def table. When a type of
10934 the correct size doesn't exist, use error_mark_node instead of NULL.
10935 The later results in segfaults even when a decl using the type doesn't
10939 builtin_type_for_size (int size
, bool unsignedp
)
10941 tree type
= c_common_type_for_size (size
, unsignedp
);
10942 return type
? type
: error_mark_node
;
10945 /* A helper function for resolve_overloaded_builtin in resolving the
10946 overloaded __sync_ builtins. Returns a positive power of 2 if the
10947 first operand of PARAMS is a pointer to a supported data type.
10948 Returns 0 if an error is encountered.
10949 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10953 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
10955 /* Type of the argument. */
10957 /* Type the argument points to. */
10961 if (vec_safe_is_empty (params
))
10963 error ("too few arguments to function %qE", function
);
10967 argtype
= type
= TREE_TYPE ((*params
)[0]);
10968 if (TREE_CODE (type
) == ARRAY_TYPE
)
10970 /* Force array-to-pointer decay for C++. */
10971 gcc_assert (c_dialect_cxx());
10972 (*params
)[0] = default_conversion ((*params
)[0]);
10973 type
= TREE_TYPE ((*params
)[0]);
10975 if (TREE_CODE (type
) != POINTER_TYPE
)
10978 type
= TREE_TYPE (type
);
10979 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
10982 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
10985 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
10986 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
10990 /* Issue the diagnostic only if the argument is valid, otherwise
10991 it would be redundant at best and could be misleading. */
10992 if (argtype
!= error_mark_node
)
10993 error ("operand type %qT is incompatible with argument %d of %qE",
10994 argtype
, 1, function
);
10998 /* A helper function for resolve_overloaded_builtin. Adds casts to
10999 PARAMS to make arguments match up with those of FUNCTION. Drops
11000 the variadic arguments at the end. Returns false if some error
11001 was encountered; true on success. */
11004 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
11005 vec
<tree
, va_gc
> *params
, bool orig_format
)
11007 function_args_iterator iter
;
11009 unsigned int parmnum
;
11011 function_args_iter_init (&iter
, TREE_TYPE (function
));
11012 /* We've declared the implementation functions to use "volatile void *"
11013 as the pointer parameter, so we shouldn't get any complaints from the
11014 call to check_function_arguments what ever type the user used. */
11015 function_args_iter_next (&iter
);
11016 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
11017 ptype
= TYPE_MAIN_VARIANT (ptype
);
11019 /* For the rest of the values, we need to cast these to FTYPE, so that we
11020 don't get warnings for passing pointer types, etc. */
11024 tree val
, arg_type
;
11026 arg_type
= function_args_iter_cond (&iter
);
11027 /* XXX void_type_node belies the abstraction. */
11028 if (arg_type
== void_type_node
)
11032 if (params
->length () <= parmnum
)
11034 error_at (loc
, "too few arguments to function %qE", orig_function
);
11038 /* Only convert parameters if arg_type is unsigned integer type with
11039 new format sync routines, i.e. don't attempt to convert pointer
11040 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
11041 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
11043 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
11045 /* Ideally for the first conversion we'd use convert_for_assignment
11046 so that we get warnings for anything that doesn't match the pointer
11047 type. This isn't portable across the C and C++ front ends atm. */
11048 val
= (*params
)[parmnum
];
11049 val
= convert (ptype
, val
);
11050 val
= convert (arg_type
, val
);
11051 (*params
)[parmnum
] = val
;
11054 function_args_iter_next (&iter
);
11057 /* __atomic routines are not variadic. */
11058 if (!orig_format
&& params
->length () != parmnum
+ 1)
11060 error_at (loc
, "too many arguments to function %qE", orig_function
);
11064 /* The definition of these primitives is variadic, with the remaining
11065 being "an optional list of variables protected by the memory barrier".
11066 No clue what that's supposed to mean, precisely, but we consider all
11067 call-clobbered variables to be protected so we're safe. */
11068 params
->truncate (parmnum
+ 1);
11073 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11074 RESULT to make it match the type of the first pointer argument in
11078 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
11080 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
11081 tree rtype
= TREE_TYPE (result
);
11082 ptype
= TYPE_MAIN_VARIANT (ptype
);
11084 /* New format doesn't require casting unless the types are the same size. */
11085 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
11086 return convert (ptype
, result
);
11091 /* This function verifies the PARAMS to generic atomic FUNCTION.
11092 It returns the size if all the parameters are the same size, otherwise
11093 0 is returned if the parameters are invalid. */
11096 get_atomic_generic_size (location_t loc
, tree function
,
11097 vec
<tree
, va_gc
> *params
)
11099 unsigned int n_param
;
11100 unsigned int n_model
;
11105 /* Determine the parameter makeup. */
11106 switch (DECL_FUNCTION_CODE (function
))
11108 case BUILT_IN_ATOMIC_EXCHANGE
:
11112 case BUILT_IN_ATOMIC_LOAD
:
11113 case BUILT_IN_ATOMIC_STORE
:
11117 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11122 gcc_unreachable ();
11125 if (vec_safe_length (params
) != n_param
)
11127 error_at (loc
, "incorrect number of arguments to function %qE", function
);
11131 /* Get type of first parameter, and determine its size. */
11132 type_0
= TREE_TYPE ((*params
)[0]);
11133 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
11135 /* Force array-to-pointer decay for C++. */
11136 gcc_assert (c_dialect_cxx());
11137 (*params
)[0] = default_conversion ((*params
)[0]);
11138 type_0
= TREE_TYPE ((*params
)[0]);
11140 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
11142 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
11147 /* Types must be compile time constant sizes. */
11148 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
11151 "argument 1 of %qE must be a pointer to a constant size type",
11156 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
11158 /* Zero size objects are not allowed. */
11162 "argument 1 of %qE must be a pointer to a nonzero size object",
11167 /* Check each other parameter is a pointer and the same size. */
11168 for (x
= 0; x
< n_param
- n_model
; x
++)
11171 tree type
= TREE_TYPE ((*params
)[x
]);
11172 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11173 if (n_param
== 6 && x
== 3)
11175 if (!POINTER_TYPE_P (type
))
11177 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
11181 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
11182 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
11185 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
11186 "size type", x
+ 1, function
);
11189 else if (FUNCTION_POINTER_TYPE_P (type
))
11191 error_at (loc
, "argument %d of %qE must not be a pointer to a "
11192 "function", x
+ 1, function
);
11195 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
11196 size
= type_size
? tree_to_uhwi (type_size
) : 0;
11197 if (size
!= size_0
)
11199 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
11205 /* Check memory model parameters for validity. */
11206 for (x
= n_param
- n_model
; x
< n_param
; x
++)
11208 tree p
= (*params
)[x
];
11209 if (TREE_CODE (p
) == INTEGER_CST
)
11211 int i
= tree_to_uhwi (p
);
11212 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
11214 warning_at (loc
, OPT_Winvalid_memory_model
,
11215 "invalid memory model argument %d of %qE", x
+ 1,
11220 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
11222 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
11232 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11233 at the beginning of the parameter list PARAMS representing the size of the
11234 objects. This is to match the library ABI requirement. LOC is the location
11235 of the function call.
11236 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11237 returned to allow the external call to be constructed. */
11240 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
11241 vec
<tree
, va_gc
> *params
)
11245 /* Insert a SIZE_T parameter as the first param. If there isn't
11246 enough space, allocate a new vector and recursively re-build with that. */
11247 if (!params
->space (1))
11249 unsigned int z
, len
;
11250 vec
<tree
, va_gc
> *v
;
11253 len
= params
->length ();
11254 vec_alloc (v
, len
+ 1);
11255 v
->quick_push (build_int_cst (size_type_node
, n
));
11256 for (z
= 0; z
< len
; z
++)
11257 v
->quick_push ((*params
)[z
]);
11258 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
11263 /* Add the size parameter and leave as a function call for processing. */
11264 size_node
= build_int_cst (size_type_node
, n
);
11265 params
->quick_insert (0, size_node
);
11270 /* Return whether atomic operations for naturally aligned N-byte
11271 arguments are supported, whether inline or through libatomic. */
11273 atomic_size_supported_p (int n
)
11284 return targetm
.scalar_mode_supported_p (TImode
);
11291 /* This will process an __atomic_exchange function call, determine whether it
11292 needs to be mapped to the _N variation, or turned into a library call.
11293 LOC is the location of the builtin call.
11294 FUNCTION is the DECL that has been invoked;
11295 PARAMS is the argument list for the call. The return value is non-null
11296 TRUE is returned if it is translated into the proper format for a call to the
11297 external library, and NEW_RETURN is set the tree for that function.
11298 FALSE is returned if processing for the _N variation is required, and
11299 NEW_RETURN is set to the return value the result is copied into. */
11301 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
11302 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11304 tree p0
, p1
, p2
, p3
;
11305 tree I_type
, I_type_ptr
;
11306 int n
= get_atomic_generic_size (loc
, function
, params
);
11308 /* Size of 0 is an error condition. */
11311 *new_return
= error_mark_node
;
11315 /* If not a lock-free size, change to the library generic format. */
11316 if (!atomic_size_supported_p (n
))
11318 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11322 /* Otherwise there is a lockfree match, transform the call from:
11323 void fn(T* mem, T* desired, T* return, model)
11325 *return = (T) (fn (In* mem, (In) *desired, model)) */
11332 /* Create pointer to appropriate size. */
11333 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11334 I_type_ptr
= build_pointer_type (I_type
);
11336 /* Convert object pointer to required type. */
11337 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11339 /* Convert new value to required type, and dereference it. */
11340 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11341 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11344 /* Move memory model to the 3rd position, and end param list. */
11346 params
->truncate (3);
11348 /* Convert return pointer and dereference it for later assignment. */
11349 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11355 /* This will process an __atomic_compare_exchange function call, determine
11356 whether it needs to be mapped to the _N variation, or turned into a lib call.
11357 LOC is the location of the builtin call.
11358 FUNCTION is the DECL that has been invoked;
11359 PARAMS is the argument list for the call. The return value is non-null
11360 TRUE is returned if it is translated into the proper format for a call to the
11361 external library, and NEW_RETURN is set the tree for that function.
11362 FALSE is returned if processing for the _N variation is required. */
11365 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
11366 vec
<tree
, va_gc
> *params
,
11370 tree I_type
, I_type_ptr
;
11371 int n
= get_atomic_generic_size (loc
, function
, params
);
11373 /* Size of 0 is an error condition. */
11376 *new_return
= error_mark_node
;
11380 /* If not a lock-free size, change to the library generic format. */
11381 if (!atomic_size_supported_p (n
))
11383 /* The library generic format does not have the weak parameter, so
11384 remove it from the param list. Since a parameter has been removed,
11385 we can be sure that there is room for the SIZE_T parameter, meaning
11386 there will not be a recursive rebuilding of the parameter list, so
11387 there is no danger this will be done twice. */
11390 (*params
)[3] = (*params
)[4];
11391 (*params
)[4] = (*params
)[5];
11392 params
->truncate (5);
11394 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11398 /* Otherwise, there is a match, so the call needs to be transformed from:
11399 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11401 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11407 /* Create pointer to appropriate size. */
11408 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11409 I_type_ptr
= build_pointer_type (I_type
);
11411 /* Convert object pointer to required type. */
11412 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11415 /* Convert expected pointer to required type. */
11416 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
11419 /* Convert desired value to required type, and dereference it. */
11420 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11421 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
11424 /* The rest of the parameters are fine. NULL means no special return value
11426 *new_return
= NULL
;
11431 /* This will process an __atomic_load function call, determine whether it
11432 needs to be mapped to the _N variation, or turned into a library call.
11433 LOC is the location of the builtin call.
11434 FUNCTION is the DECL that has been invoked;
11435 PARAMS is the argument list for the call. The return value is non-null
11436 TRUE is returned if it is translated into the proper format for a call to the
11437 external library, and NEW_RETURN is set the tree for that function.
11438 FALSE is returned if processing for the _N variation is required, and
11439 NEW_RETURN is set to the return value the result is copied into. */
11442 resolve_overloaded_atomic_load (location_t loc
, tree function
,
11443 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11446 tree I_type
, I_type_ptr
;
11447 int n
= get_atomic_generic_size (loc
, function
, params
);
11449 /* Size of 0 is an error condition. */
11452 *new_return
= error_mark_node
;
11456 /* If not a lock-free size, change to the library generic format. */
11457 if (!atomic_size_supported_p (n
))
11459 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11463 /* Otherwise, there is a match, so the call needs to be transformed from:
11464 void fn(T* mem, T* return, model)
11466 *return = (T) (fn ((In *) mem, model)) */
11472 /* Create pointer to appropriate size. */
11473 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11474 I_type_ptr
= build_pointer_type (I_type
);
11476 /* Convert object pointer to required type. */
11477 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11480 /* Move memory model to the 2nd position, and end param list. */
11482 params
->truncate (2);
11484 /* Convert return pointer and dereference it for later assignment. */
11485 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11491 /* This will process an __atomic_store function call, determine whether it
11492 needs to be mapped to the _N variation, or turned into a library call.
11493 LOC is the location of the builtin call.
11494 FUNCTION is the DECL that has been invoked;
11495 PARAMS is the argument list for the call. The return value is non-null
11496 TRUE is returned if it is translated into the proper format for a call to the
11497 external library, and NEW_RETURN is set the tree for that function.
11498 FALSE is returned if processing for the _N variation is required, and
11499 NEW_RETURN is set to the return value the result is copied into. */
11502 resolve_overloaded_atomic_store (location_t loc
, tree function
,
11503 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11506 tree I_type
, I_type_ptr
;
11507 int n
= get_atomic_generic_size (loc
, function
, params
);
11509 /* Size of 0 is an error condition. */
11512 *new_return
= error_mark_node
;
11516 /* If not a lock-free size, change to the library generic format. */
11517 if (!atomic_size_supported_p (n
))
11519 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11523 /* Otherwise, there is a match, so the call needs to be transformed from:
11524 void fn(T* mem, T* value, model)
11526 fn ((In *) mem, (In) *value, model) */
11531 /* Create pointer to appropriate size. */
11532 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11533 I_type_ptr
= build_pointer_type (I_type
);
11535 /* Convert object pointer to required type. */
11536 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11539 /* Convert new value to required type, and dereference it. */
11540 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11541 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11544 /* The memory model is in the right spot already. Return is void. */
11545 *new_return
= NULL_TREE
;
11551 /* Some builtin functions are placeholders for other expressions. This
11552 function should be called immediately after parsing the call expression
11553 before surrounding code has committed to the type of the expression.
11555 LOC is the location of the builtin call.
11557 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11558 PARAMS is the argument list for the call. The return value is non-null
11559 when expansion is complete, and null if normal processing should
11563 resolve_overloaded_builtin (location_t loc
, tree function
,
11564 vec
<tree
, va_gc
> *params
)
11566 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
11568 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11569 Those are not valid to call with a pointer to _Bool (or C++ bool)
11570 and so must be rejected. */
11571 bool fetch_op
= true;
11572 bool orig_format
= true;
11573 tree new_return
= NULL_TREE
;
11575 switch (DECL_BUILT_IN_CLASS (function
))
11577 case BUILT_IN_NORMAL
:
11580 if (targetm
.resolve_overloaded_builtin
)
11581 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
11588 /* Handle BUILT_IN_NORMAL here. */
11591 case BUILT_IN_ATOMIC_EXCHANGE
:
11592 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11593 case BUILT_IN_ATOMIC_LOAD
:
11594 case BUILT_IN_ATOMIC_STORE
:
11596 /* Handle these 4 together so that they can fall through to the next
11597 case if the call is transformed to an _N variant. */
11600 case BUILT_IN_ATOMIC_EXCHANGE
:
11602 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
11605 /* Change to the _N variant. */
11606 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
11610 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11612 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
11616 /* Change to the _N variant. */
11617 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
11620 case BUILT_IN_ATOMIC_LOAD
:
11622 if (resolve_overloaded_atomic_load (loc
, function
, params
,
11625 /* Change to the _N variant. */
11626 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
11629 case BUILT_IN_ATOMIC_STORE
:
11631 if (resolve_overloaded_atomic_store (loc
, function
, params
,
11634 /* Change to the _N variant. */
11635 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
11639 gcc_unreachable ();
11643 case BUILT_IN_ATOMIC_EXCHANGE_N
:
11644 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
11645 case BUILT_IN_ATOMIC_LOAD_N
:
11646 case BUILT_IN_ATOMIC_STORE_N
:
11649 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
11650 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
11651 case BUILT_IN_ATOMIC_AND_FETCH_N
:
11652 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
11653 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
11654 case BUILT_IN_ATOMIC_OR_FETCH_N
:
11655 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
11656 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
11657 case BUILT_IN_ATOMIC_FETCH_AND_N
:
11658 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
11659 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
11660 case BUILT_IN_ATOMIC_FETCH_OR_N
:
11661 orig_format
= false;
11663 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
11664 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
11665 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
11666 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
11667 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
11668 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
11669 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
11670 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
11671 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
11672 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
11673 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
11674 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
11675 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
11676 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
11677 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
11678 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
11680 /* The following are not _FETCH_OPs and must be accepted with
11681 pointers to _Bool (or C++ bool). */
11684 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11685 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11686 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11687 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
11689 int n
= sync_resolve_size (function
, params
, fetch_op
);
11690 tree new_function
, first_param
, result
;
11691 enum built_in_function fncode
;
11694 return error_mark_node
;
11696 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
11697 new_function
= builtin_decl_explicit (fncode
);
11698 if (!sync_resolve_params (loc
, function
, new_function
, params
,
11700 return error_mark_node
;
11702 first_param
= (*params
)[0];
11703 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
11705 if (result
== error_mark_node
)
11707 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11708 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
11709 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
11710 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
11711 result
= sync_resolve_return (first_param
, result
, orig_format
);
11714 /* Prevent -Wunused-value warning. */
11715 TREE_USED (result
) = true;
11717 /* If new_return is set, assign function to that expr and cast the
11718 result to void since the generic interface returned void. */
11721 /* Cast function result from I{1,2,4,8,16} to the required type. */
11722 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
11723 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
11725 TREE_SIDE_EFFECTS (result
) = 1;
11726 protected_set_expr_location (result
, loc
);
11727 result
= convert (void_type_node
, result
);
11737 /* vector_types_compatible_elements_p is used in type checks of vectors
11738 values used as operands of binary operators. Where it returns true, and
11739 the other checks of the caller succeed (being vector types in he first
11740 place, and matching number of elements), we can just treat the types
11741 as essentially the same.
11742 Contrast with vector_targets_convertible_p, which is used for vector
11743 pointer types, and vector_types_convertible_p, which will allow
11744 language-specific matches under the control of flag_lax_vector_conversions,
11745 and might still require a conversion. */
11746 /* True if vector types T1 and T2 can be inputs to the same binary
11747 operator without conversion.
11748 We don't check the overall vector size here because some of our callers
11749 want to give different error messages when the vectors are compatible
11750 except for the element count. */
11753 vector_types_compatible_elements_p (tree t1
, tree t2
)
11755 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
11756 t1
= TREE_TYPE (t1
);
11757 t2
= TREE_TYPE (t2
);
11759 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
11761 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
11762 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
11763 || c2
== FIXED_POINT_TYPE
));
11765 t1
= c_common_signed_type (t1
);
11766 t2
= c_common_signed_type (t2
);
11767 /* Equality works here because c_common_signed_type uses
11768 TYPE_MAIN_VARIANT. */
11771 if (opaque
&& c1
== c2
11772 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
11773 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
11778 /* Check for missing format attributes on function pointers. LTYPE is
11779 the new type or left-hand side type. RTYPE is the old type or
11780 right-hand side type. Returns TRUE if LTYPE is missing the desired
11784 check_missing_format_attribute (tree ltype
, tree rtype
)
11786 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
11789 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
11790 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
11795 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
11796 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
11804 /* Subscripting with type char is likely to lose on a machine where
11805 chars are signed. So warn on any machine, but optionally. Don't
11806 warn for unsigned char since that type is safe. Don't warn for
11807 signed char because anyone who uses that must have done so
11808 deliberately. Furthermore, we reduce the false positive load by
11809 warning only for non-constant value of type char. */
11812 warn_array_subscript_with_type_char (location_t loc
, tree index
)
11814 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
11815 && TREE_CODE (index
) != INTEGER_CST
)
11816 warning_at (loc
, OPT_Wchar_subscripts
,
11817 "array subscript has type %<char%>");
11820 /* Implement -Wparentheses for the unexpected C precedence rules, to
11821 cover cases like x + y << z which readers are likely to
11822 misinterpret. We have seen an expression in which CODE is a binary
11823 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11824 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11825 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11826 expression was not formed using a binary or unary operator, or it
11827 was enclosed in parentheses. */
11830 warn_about_parentheses (location_t loc
, enum tree_code code
,
11831 enum tree_code code_left
, tree arg_left
,
11832 enum tree_code code_right
, tree arg_right
)
11834 if (!warn_parentheses
)
11837 /* This macro tests that the expression ARG with original tree code
11838 CODE appears to be a boolean expression. or the result of folding a
11839 boolean expression. */
11840 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11841 (truth_value_p (TREE_CODE (ARG)) \
11842 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11843 /* Folding may create 0 or 1 integers from other expressions. */ \
11844 || ((CODE) != INTEGER_CST \
11845 && (integer_onep (ARG) || integer_zerop (ARG))))
11850 if (code_left
== PLUS_EXPR
)
11851 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11852 "suggest parentheses around %<+%> inside %<<<%>");
11853 else if (code_right
== PLUS_EXPR
)
11854 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11855 "suggest parentheses around %<+%> inside %<<<%>");
11856 else if (code_left
== MINUS_EXPR
)
11857 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11858 "suggest parentheses around %<-%> inside %<<<%>");
11859 else if (code_right
== MINUS_EXPR
)
11860 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11861 "suggest parentheses around %<-%> inside %<<<%>");
11865 if (code_left
== PLUS_EXPR
)
11866 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11867 "suggest parentheses around %<+%> inside %<>>%>");
11868 else if (code_right
== PLUS_EXPR
)
11869 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11870 "suggest parentheses around %<+%> inside %<>>%>");
11871 else if (code_left
== MINUS_EXPR
)
11872 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11873 "suggest parentheses around %<-%> inside %<>>%>");
11874 else if (code_right
== MINUS_EXPR
)
11875 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11876 "suggest parentheses around %<-%> inside %<>>%>");
11879 case TRUTH_ORIF_EXPR
:
11880 if (code_left
== TRUTH_ANDIF_EXPR
)
11881 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11882 "suggest parentheses around %<&&%> within %<||%>");
11883 else if (code_right
== TRUTH_ANDIF_EXPR
)
11884 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11885 "suggest parentheses around %<&&%> within %<||%>");
11889 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
11890 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11891 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11892 "suggest parentheses around arithmetic in operand of %<|%>");
11893 else if (code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
11894 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11895 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11896 "suggest parentheses around arithmetic in operand of %<|%>");
11897 /* Check cases like x|y==z */
11898 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11899 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11900 "suggest parentheses around comparison in operand of %<|%>");
11901 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11902 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11903 "suggest parentheses around comparison in operand of %<|%>");
11904 /* Check cases like !x | y */
11905 else if (code_left
== TRUTH_NOT_EXPR
11906 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11907 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11908 "suggest parentheses around operand of "
11909 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
11913 if (code_left
== BIT_AND_EXPR
11914 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11915 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11916 "suggest parentheses around arithmetic in operand of %<^%>");
11917 else if (code_right
== BIT_AND_EXPR
11918 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11919 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11920 "suggest parentheses around arithmetic in operand of %<^%>");
11921 /* Check cases like x^y==z */
11922 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11923 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11924 "suggest parentheses around comparison in operand of %<^%>");
11925 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11926 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11927 "suggest parentheses around comparison in operand of %<^%>");
11931 if (code_left
== PLUS_EXPR
)
11932 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11933 "suggest parentheses around %<+%> in operand of %<&%>");
11934 else if (code_right
== PLUS_EXPR
)
11935 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11936 "suggest parentheses around %<+%> in operand of %<&%>");
11937 else if (code_left
== MINUS_EXPR
)
11938 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11939 "suggest parentheses around %<-%> in operand of %<&%>");
11940 else if (code_right
== MINUS_EXPR
)
11941 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11942 "suggest parentheses around %<-%> in operand of %<&%>");
11943 /* Check cases like x&y==z */
11944 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11945 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11946 "suggest parentheses around comparison in operand of %<&%>");
11947 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11948 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11949 "suggest parentheses around comparison in operand of %<&%>");
11950 /* Check cases like !x & y */
11951 else if (code_left
== TRUTH_NOT_EXPR
11952 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11953 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11954 "suggest parentheses around operand of "
11955 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
11959 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11960 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11961 "suggest parentheses around comparison in operand of %<==%>");
11962 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11963 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11964 "suggest parentheses around comparison in operand of %<==%>");
11967 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11968 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11969 "suggest parentheses around comparison in operand of %<!=%>");
11970 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11971 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11972 "suggest parentheses around comparison in operand of %<!=%>");
11976 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
11978 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
11979 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
11980 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
11981 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11982 "comparisons like %<X<=Y<=Z%> do not "
11983 "have their mathematical meaning");
11984 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
11985 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
11986 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))
11987 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11988 "comparisons like %<X<=Y<=Z%> do not "
11989 "have their mathematical meaning");
11993 #undef NOT_A_BOOLEAN_EXPR_P
11996 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11999 warn_for_unused_label (tree label
)
12001 if (!TREE_USED (label
))
12003 if (DECL_INITIAL (label
))
12004 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
12006 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
12010 /* Warn for division by zero according to the value of DIVISOR. LOC
12011 is the location of the division operator. */
12014 warn_for_div_by_zero (location_t loc
, tree divisor
)
12016 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
12017 about division by zero. Do not issue a warning if DIVISOR has a
12018 floating-point type, since we consider 0.0/0.0 a valid way of
12019 generating a NaN. */
12020 if (c_inhibit_evaluation_warnings
== 0
12021 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
12022 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
12025 /* Warn for patterns where memset appears to be used incorrectly. The
12026 warning location should be LOC. ARG0, and ARG2 are the first and
12027 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
12028 each argument that was a literal zero. */
12031 warn_for_memset (location_t loc
, tree arg0
, tree arg2
,
12032 int literal_zero_mask
)
12034 if (warn_memset_transposed_args
12035 && integer_zerop (arg2
)
12036 && (literal_zero_mask
& (1 << 2)) != 0
12037 && (literal_zero_mask
& (1 << 1)) == 0)
12038 warning_at (loc
, OPT_Wmemset_transposed_args
,
12039 "%<memset%> used with constant zero length "
12040 "parameter; this could be due to transposed "
12043 if (warn_memset_elt_size
&& TREE_CODE (arg2
) == INTEGER_CST
)
12046 if (TREE_CODE (arg0
) == ADDR_EXPR
)
12047 arg0
= TREE_OPERAND (arg0
, 0);
12048 tree type
= TREE_TYPE (arg0
);
12049 if (type
!= NULL_TREE
&& TREE_CODE (type
) == ARRAY_TYPE
)
12051 tree elt_type
= TREE_TYPE (type
);
12052 tree domain
= TYPE_DOMAIN (type
);
12053 if (!integer_onep (TYPE_SIZE_UNIT (elt_type
))
12054 && domain
!= NULL_TREE
12055 && TYPE_MAXVAL (domain
)
12056 && TYPE_MINVAL (domain
)
12057 && integer_zerop (TYPE_MINVAL (domain
))
12058 && integer_onep (fold_build2 (MINUS_EXPR
, domain
,
12060 TYPE_MAXVAL (domain
))))
12061 warning_at (loc
, OPT_Wmemset_elt_size
,
12062 "%<memset%> used with length equal to "
12063 "number of elements without multiplication "
12064 "by element size");
12069 /* Subroutine of build_binary_op. Give warnings for comparisons
12070 between signed and unsigned quantities that may fail. Do the
12071 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
12072 so that casts will be considered, but default promotions won't
12075 LOCATION is the location of the comparison operator.
12077 The arguments of this function map directly to local variables
12078 of build_binary_op. */
12081 warn_for_sign_compare (location_t location
,
12082 tree orig_op0
, tree orig_op1
,
12083 tree op0
, tree op1
,
12084 tree result_type
, enum tree_code resultcode
)
12086 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
12087 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
12088 int unsignedp0
, unsignedp1
;
12090 /* In C++, check for comparison of different enum types. */
12091 if (c_dialect_cxx()
12092 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
12093 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
12094 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
12095 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
12097 warning_at (location
,
12098 OPT_Wsign_compare
, "comparison between types %qT and %qT",
12099 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
12102 /* Do not warn if the comparison is being done in a signed type,
12103 since the signed type will only be chosen if it can represent
12104 all the values of the unsigned type. */
12105 if (!TYPE_UNSIGNED (result_type
))
12107 /* Do not warn if both operands are unsigned. */
12108 else if (op0_signed
== op1_signed
)
12112 tree sop
, uop
, base_type
;
12116 sop
= orig_op0
, uop
= orig_op1
;
12118 sop
= orig_op1
, uop
= orig_op0
;
12120 STRIP_TYPE_NOPS (sop
);
12121 STRIP_TYPE_NOPS (uop
);
12122 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
12123 ? TREE_TYPE (result_type
) : result_type
);
12125 /* Do not warn if the signed quantity is an unsuffixed integer
12126 literal (or some static constant expression involving such
12127 literals or a conditional expression involving such literals)
12128 and it is non-negative. */
12129 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
12131 /* Do not warn if the comparison is an equality operation, the
12132 unsigned quantity is an integral constant, and it would fit
12133 in the result if the result were signed. */
12134 else if (TREE_CODE (uop
) == INTEGER_CST
12135 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
12136 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
12138 /* In C, do not warn if the unsigned quantity is an enumeration
12139 constant and its maximum value would fit in the result if the
12140 result were signed. */
12141 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
12142 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
12143 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
12144 c_common_signed_type (base_type
)))
12147 warning_at (location
,
12149 "comparison between signed and unsigned integer expressions");
12152 /* Warn if two unsigned values are being compared in a size larger
12153 than their original size, and one (and only one) is the result of
12154 a `~' operator. This comparison will always fail.
12156 Also warn if one operand is a constant, and the constant does not
12157 have all bits set that are set in the ~ operand when it is
12160 op0
= c_common_get_narrower (op0
, &unsignedp0
);
12161 op1
= c_common_get_narrower (op1
, &unsignedp1
);
12163 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
12164 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
12166 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
12167 op0
= c_common_get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
12168 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
12169 op1
= c_common_get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
12171 if (tree_fits_shwi_p (op0
) || tree_fits_shwi_p (op1
))
12174 HOST_WIDE_INT constant
, mask
;
12178 if (tree_fits_shwi_p (op0
))
12181 unsignedp
= unsignedp1
;
12182 constant
= tree_to_shwi (op0
);
12187 unsignedp
= unsignedp0
;
12188 constant
= tree_to_shwi (op1
);
12191 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
12192 if (bits
< TYPE_PRECISION (result_type
)
12193 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
12195 mask
= HOST_WIDE_INT_M1U
<< bits
;
12196 if ((mask
& constant
) != mask
)
12199 warning_at (location
, OPT_Wsign_compare
,
12200 "promoted ~unsigned is always non-zero");
12202 warning_at (location
, OPT_Wsign_compare
,
12203 "comparison of promoted ~unsigned with constant");
12207 else if (unsignedp0
&& unsignedp1
12208 && (TYPE_PRECISION (TREE_TYPE (op0
))
12209 < TYPE_PRECISION (result_type
))
12210 && (TYPE_PRECISION (TREE_TYPE (op1
))
12211 < TYPE_PRECISION (result_type
)))
12212 warning_at (location
, OPT_Wsign_compare
,
12213 "comparison of promoted ~unsigned with unsigned");
12217 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12218 type via c_common_type. If -Wdouble-promotion is in use, and the
12219 conditions for warning have been met, issue a warning. GMSGID is
12220 the warning message. It must have two %T specifiers for the type
12221 that was converted (generally "float") and the type to which it was
12222 converted (generally "double), respectively. LOC is the location
12223 to which the awrning should refer. */
12226 do_warn_double_promotion (tree result_type
, tree type1
, tree type2
,
12227 const char *gmsgid
, location_t loc
)
12231 if (!warn_double_promotion
)
12233 /* If the conversion will not occur at run-time, there is no need to
12235 if (c_inhibit_evaluation_warnings
)
12237 if (TYPE_MAIN_VARIANT (result_type
) != double_type_node
12238 && TYPE_MAIN_VARIANT (result_type
) != complex_double_type_node
)
12240 if (TYPE_MAIN_VARIANT (type1
) == float_type_node
12241 || TYPE_MAIN_VARIANT (type1
) == complex_float_type_node
)
12242 source_type
= type1
;
12243 else if (TYPE_MAIN_VARIANT (type2
) == float_type_node
12244 || TYPE_MAIN_VARIANT (type2
) == complex_float_type_node
)
12245 source_type
= type2
;
12248 warning_at (loc
, OPT_Wdouble_promotion
, gmsgid
, source_type
, result_type
);
12251 /* Possibly warn about unused parameters. */
12254 do_warn_unused_parameter (tree fn
)
12258 for (decl
= DECL_ARGUMENTS (fn
);
12259 decl
; decl
= DECL_CHAIN (decl
))
12260 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
12261 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
)
12262 && !TREE_NO_WARNING (decl
))
12263 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wunused_parameter
,
12264 "unused parameter %qD", decl
);
12268 /* Setup a TYPE_DECL node as a typedef representation.
12270 X is a TYPE_DECL for a typedef statement. Create a brand new
12271 ..._TYPE node (which will be just a variant of the existing
12272 ..._TYPE node with identical properties) and then install X
12273 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12275 The whole point here is to end up with a situation where each
12276 and every ..._TYPE node the compiler creates will be uniquely
12277 associated with AT MOST one node representing a typedef name.
12278 This way, even though the compiler substitutes corresponding
12279 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12280 early on, later parts of the compiler can always do the reverse
12281 translation and get back the corresponding typedef name. For
12284 typedef struct S MY_TYPE;
12287 Later parts of the compiler might only know that `object' was of
12288 type `struct S' if it were not for code just below. With this
12289 code however, later parts of the compiler see something like:
12291 struct S' == struct S
12292 typedef struct S' MY_TYPE;
12295 And they can then deduce (from the node for type struct S') that
12296 the original object declaration was:
12300 Being able to do this is important for proper support of protoize,
12301 and also for generating precise symbolic debugging information
12302 which takes full account of the programmer's (typedef) vocabulary.
12304 Obviously, we don't want to generate a duplicate ..._TYPE node if
12305 the TYPE_DECL node that we are now processing really represents a
12306 standard built-in type. */
12309 set_underlying_type (tree x
)
12311 if (x
== error_mark_node
)
12313 if (DECL_IS_BUILTIN (x
))
12315 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
12316 TYPE_NAME (TREE_TYPE (x
)) = x
;
12318 else if (TREE_TYPE (x
) != error_mark_node
12319 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
12321 tree tt
= TREE_TYPE (x
);
12322 DECL_ORIGINAL_TYPE (x
) = tt
;
12323 tt
= build_variant_type_copy (tt
);
12324 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
12325 TYPE_NAME (tt
) = x
;
12326 TREE_USED (tt
) = TREE_USED (x
);
12327 TREE_TYPE (x
) = tt
;
12331 /* Record the types used by the current global variable declaration
12332 being parsed, so that we can decide later to emit their debug info.
12333 Those types are in types_used_by_cur_var_decl, and we are going to
12334 store them in the types_used_by_vars_hash hash table.
12335 DECL is the declaration of the global variable that has been parsed. */
12338 record_types_used_by_current_var_decl (tree decl
)
12340 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
12342 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
12344 tree type
= types_used_by_cur_var_decl
->pop ();
12345 types_used_by_var_decl_insert (type
, decl
);
12349 /* If DECL is a typedef that is declared in the current function,
12350 record it for the purpose of -Wunused-local-typedefs. */
12353 record_locally_defined_typedef (tree decl
)
12355 struct c_language_function
*l
;
12357 if (!warn_unused_local_typedefs
12359 /* if this is not a locally defined typedef then we are not
12361 || !is_typedef_decl (decl
)
12362 || !decl_function_context (decl
))
12365 l
= (struct c_language_function
*) cfun
->language
;
12366 vec_safe_push (l
->local_typedefs
, decl
);
12369 /* If T is a TYPE_DECL declared locally, mark it as used. */
12372 maybe_record_typedef_use (tree t
)
12374 if (!is_typedef_decl (t
))
12377 TREE_USED (t
) = true;
12380 /* Warn if there are some unused locally defined typedefs in the
12381 current function. */
12384 maybe_warn_unused_local_typedefs (void)
12388 /* The number of times we have emitted -Wunused-local-typedefs
12389 warnings. If this is different from errorcount, that means some
12390 unrelated errors have been issued. In which case, we'll avoid
12391 emitting "unused-local-typedefs" warnings. */
12392 static int unused_local_typedefs_warn_count
;
12393 struct c_language_function
*l
;
12398 if ((l
= (struct c_language_function
*) cfun
->language
) == NULL
)
12401 if (warn_unused_local_typedefs
12402 && errorcount
== unused_local_typedefs_warn_count
)
12404 FOR_EACH_VEC_SAFE_ELT (l
->local_typedefs
, i
, decl
)
12405 if (!TREE_USED (decl
))
12406 warning_at (DECL_SOURCE_LOCATION (decl
),
12407 OPT_Wunused_local_typedefs
,
12408 "typedef %qD locally defined but not used", decl
);
12409 unused_local_typedefs_warn_count
= errorcount
;
12412 vec_free (l
->local_typedefs
);
12415 /* Warn about boolean expression compared with an integer value different
12416 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12417 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12418 are the operands of the comparison. The caller must ensure that
12419 either operand is a boolean expression. */
12422 maybe_warn_bool_compare (location_t loc
, enum tree_code code
, tree op0
,
12425 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
12429 if (f
= fold_for_warn (op0
),
12430 TREE_CODE (f
) == INTEGER_CST
)
12432 else if (f
= fold_for_warn (op1
),
12433 TREE_CODE (f
) == INTEGER_CST
)
12438 if (!integer_zerop (cst
) && !integer_onep (cst
))
12440 int sign
= (TREE_CODE (op0
) == INTEGER_CST
12441 ? tree_int_cst_sgn (cst
) : -tree_int_cst_sgn (cst
));
12442 if (code
== EQ_EXPR
12443 || ((code
== GT_EXPR
|| code
== GE_EXPR
) && sign
< 0)
12444 || ((code
== LT_EXPR
|| code
== LE_EXPR
) && sign
> 0))
12445 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12446 "with boolean expression is always false", cst
);
12448 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12449 "with boolean expression is always true", cst
);
12451 else if (integer_zerop (cst
) || integer_onep (cst
))
12453 /* If the non-constant operand isn't of a boolean type, we
12454 don't want to warn here. */
12455 tree noncst
= TREE_CODE (op0
) == INTEGER_CST
? op1
: op0
;
12456 /* Handle booleans promoted to integers. */
12457 if (bool_promoted_to_int_p (noncst
))
12459 else if (TREE_CODE (TREE_TYPE (noncst
)) != BOOLEAN_TYPE
12460 && !truth_value_p (TREE_CODE (noncst
)))
12462 /* Do some magic to get the right diagnostics. */
12463 bool flag
= TREE_CODE (op0
) == INTEGER_CST
;
12464 flag
= integer_zerop (cst
) ? flag
: !flag
;
12465 if ((code
== GE_EXPR
&& !flag
) || (code
== LE_EXPR
&& flag
))
12466 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12467 "with boolean expression is always true", cst
);
12468 else if ((code
== LT_EXPR
&& !flag
) || (code
== GT_EXPR
&& flag
))
12469 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12470 "with boolean expression is always false", cst
);
12474 /* Warn if signed left shift overflows. We don't warn
12475 about left-shifting 1 into the sign bit in C++14; cf.
12476 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12477 LOC is a location of the shift; OP0 and OP1 are the operands.
12478 Return true if an overflow is detected, false otherwise. */
12481 maybe_warn_shift_overflow (location_t loc
, tree op0
, tree op1
)
12483 if (TREE_CODE (op0
) != INTEGER_CST
12484 || TREE_CODE (op1
) != INTEGER_CST
)
12487 tree type0
= TREE_TYPE (op0
);
12488 unsigned int prec0
= TYPE_PRECISION (type0
);
12490 /* Left-hand operand must be signed. */
12491 if (TYPE_UNSIGNED (type0
))
12494 unsigned int min_prec
= (wi::min_precision (op0
, SIGNED
)
12495 + TREE_INT_CST_LOW (op1
));
12496 /* Handle the case of left-shifting 1 into the sign bit.
12497 * However, shifting 1 _out_ of the sign bit, as in
12498 * INT_MIN << 1, is considered an overflow.
12500 if (!tree_int_cst_sign_bit(op0
) && min_prec
== prec0
+ 1)
12502 /* Never warn for C++14 onwards. */
12503 if (cxx_dialect
>= cxx14
)
12505 /* Otherwise only if -Wshift-overflow=2. But return
12506 true to signal an overflow for the sake of integer
12507 constant expressions. */
12508 if (warn_shift_overflow
< 2)
12512 bool overflowed
= min_prec
> prec0
;
12513 if (overflowed
&& c_inhibit_evaluation_warnings
== 0)
12514 warning_at (loc
, OPT_Wshift_overflow_
,
12515 "result of %qE requires %u bits to represent, "
12516 "but %qT only has %u bits",
12517 build2_loc (loc
, LSHIFT_EXPR
, type0
, op0
, op1
),
12518 min_prec
, type0
, prec0
);
12523 /* The C and C++ parsers both use vectors to hold function arguments.
12524 For efficiency, we keep a cache of unused vectors. This is the
12527 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
12528 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
12530 /* Return a new vector from the cache. If the cache is empty,
12531 allocate a new vector. These vectors are GC'ed, so it is OK if the
12532 pointer is not released.. */
12535 make_tree_vector (void)
12537 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
12538 return tree_vector_cache
->pop ();
12541 /* Passing 0 to vec::alloc returns NULL, and our callers require
12542 that we always return a non-NULL value. The vector code uses
12543 4 when growing a NULL vector, so we do too. */
12544 vec
<tree
, va_gc
> *v
;
12550 /* Release a vector of trees back to the cache. */
12553 release_tree_vector (vec
<tree
, va_gc
> *vec
)
12558 vec_safe_push (tree_vector_cache
, vec
);
12562 /* Get a new tree vector holding a single tree. */
12565 make_tree_vector_single (tree t
)
12567 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12568 ret
->quick_push (t
);
12572 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12575 make_tree_vector_from_list (tree list
)
12577 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12578 for (; list
; list
= TREE_CHAIN (list
))
12579 vec_safe_push (ret
, TREE_VALUE (list
));
12583 /* Get a new tree vector which is a copy of an existing one. */
12586 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
12588 vec
<tree
, va_gc
> *ret
;
12592 ret
= make_tree_vector ();
12593 vec_safe_reserve (ret
, vec_safe_length (orig
));
12594 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
12595 ret
->quick_push (t
);
12599 /* Return true if KEYWORD starts a type specifier. */
12602 keyword_begins_type_specifier (enum rid keyword
)
12606 case RID_AUTO_TYPE
:
12616 CASE_RID_FLOATN_NX
:
12619 case RID_DFLOAT128
:
12635 if (keyword
>= RID_FIRST_INT_N
12636 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
12637 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
12643 /* Return true if KEYWORD names a type qualifier. */
12646 keyword_is_type_qualifier (enum rid keyword
)
12660 /* Return true if KEYWORD names a storage class specifier.
12662 RID_TYPEDEF is not included in this list despite `typedef' being
12663 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12664 such for syntactic convenience only. */
12667 keyword_is_storage_class_specifier (enum rid keyword
)
12683 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12686 keyword_is_function_specifier (enum rid keyword
)
12700 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12701 declaration-specifier (C99 6.7). */
12704 keyword_is_decl_specifier (enum rid keyword
)
12706 if (keyword_is_storage_class_specifier (keyword
)
12707 || keyword_is_type_qualifier (keyword
)
12708 || keyword_is_function_specifier (keyword
))
12715 case RID_CONSTEXPR
:
12722 /* Initialize language-specific-bits of tree_contains_struct. */
12725 c_common_init_ts (void)
12727 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
12728 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
12729 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
12732 /* Build a user-defined numeric literal out of an integer constant type VALUE
12733 with identifier SUFFIX. */
12736 build_userdef_literal (tree suffix_id
, tree value
,
12737 enum overflow_type overflow
, tree num_string
)
12739 tree literal
= make_node (USERDEF_LITERAL
);
12740 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
12741 USERDEF_LITERAL_VALUE (literal
) = value
;
12742 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
12743 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
12747 /* For vector[index], convert the vector to an array of the underlying type.
12748 Return true if the resulting ARRAY_REF should not be an lvalue. */
12751 convert_vector_to_array_for_subscript (location_t loc
,
12752 tree
*vecp
, tree index
)
12755 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
12757 tree type
= TREE_TYPE (*vecp
);
12759 ret
= !lvalue_p (*vecp
);
12761 if (TREE_CODE (index
) == INTEGER_CST
)
12762 if (!tree_fits_uhwi_p (index
)
12763 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
12764 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
12766 /* We are building an ARRAY_REF so mark the vector as addressable
12767 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12768 for function parameters. */
12769 c_common_mark_addressable_vec (*vecp
);
12771 *vecp
= build1 (VIEW_CONVERT_EXPR
,
12772 build_array_type_nelts (TREE_TYPE (type
),
12773 TYPE_VECTOR_SUBPARTS (type
)),
12779 /* Determine which of the operands, if any, is a scalar that needs to be
12780 converted to a vector, for the range of operations. */
12782 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
12785 tree type0
= TREE_TYPE (op0
);
12786 tree type1
= TREE_TYPE (op1
);
12787 bool integer_only_op
= false;
12788 enum stv_conv ret
= stv_firstarg
;
12790 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
12793 /* Most GENERIC binary expressions require homogeneous arguments.
12794 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12795 argument that is a vector and a second one that is a scalar, so
12796 we never return stv_secondarg for them. */
12799 if (TREE_CODE (type0
) == INTEGER_TYPE
12800 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12802 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12805 error_at (loc
, "conversion of scalar %qT to vector %qT "
12806 "involves truncation", type0
, type1
);
12810 return stv_firstarg
;
12817 integer_only_op
= true;
12820 case VEC_COND_EXPR
:
12825 case TRUNC_DIV_EXPR
:
12826 case CEIL_DIV_EXPR
:
12827 case FLOOR_DIV_EXPR
:
12828 case ROUND_DIV_EXPR
:
12829 case EXACT_DIV_EXPR
:
12830 case TRUNC_MOD_EXPR
:
12831 case FLOOR_MOD_EXPR
:
12839 /* What about UNLT_EXPR? */
12840 if (VECTOR_TYPE_P (type0
))
12842 ret
= stv_secondarg
;
12843 std::swap (type0
, type1
);
12844 std::swap (op0
, op1
);
12847 if (TREE_CODE (type0
) == INTEGER_TYPE
12848 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12850 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12853 error_at (loc
, "conversion of scalar %qT to vector %qT "
12854 "involves truncation", type0
, type1
);
12859 else if (!integer_only_op
12860 /* Allow integer --> real conversion if safe. */
12861 && (TREE_CODE (type0
) == REAL_TYPE
12862 || TREE_CODE (type0
) == INTEGER_TYPE
)
12863 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
12865 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12868 error_at (loc
, "conversion of scalar %qT to vector %qT "
12869 "involves truncation", type0
, type1
);
12878 return stv_nothing
;
12881 /* Return the alignment of std::max_align_t.
12883 [support.types.layout] The type max_align_t is a POD type whose alignment
12884 requirement is at least as great as that of every scalar type, and whose
12885 alignment requirement is supported in every context. */
12888 max_align_t_align ()
12890 return MAX (TYPE_ALIGN (long_long_integer_type_node
),
12891 TYPE_ALIGN (long_double_type_node
));
12894 /* Return true iff ALIGN is an integral constant that is a fundamental
12895 alignment, as defined by [basic.align] in the c++-11
12900 [A fundamental alignment is represented by an alignment less than or
12901 equal to the greatest alignment supported by the implementation
12902 in all contexts, which is equal to alignof(max_align_t)]. */
12905 cxx_fundamental_alignment_p (unsigned align
)
12907 return (align
<= max_align_t_align ());
12910 /* Return true if T is a pointer to a zero-sized aggregate. */
12913 pointer_to_zero_sized_aggr_p (tree t
)
12915 if (!POINTER_TYPE_P (t
))
12918 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
12921 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12922 with no library fallback or for an ADDR_EXPR whose operand is such type
12923 issues an error pointing to the location LOC.
12924 Returns true when the expression has been diagnosed and false
12927 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
12929 if (TREE_CODE (expr
) == ADDR_EXPR
)
12930 expr
= TREE_OPERAND (expr
, 0);
12932 if (TREE_TYPE (expr
)
12933 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
12934 && TREE_CODE (expr
) == FUNCTION_DECL
12935 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12936 false positives for user-declared built-ins such as abs or
12937 strlen, and for C++ operators new and delete.
12938 The c_decl_implicit() test avoids false positives for implicitly
12939 declared built-ins with library fallbacks (such as abs). */
12940 && DECL_BUILT_IN (expr
)
12941 && DECL_IS_BUILTIN (expr
)
12942 && !c_decl_implicit (expr
)
12943 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
12945 if (loc
== UNKNOWN_LOCATION
)
12946 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
12948 /* Reject arguments that are built-in functions with
12949 no library fallback. */
12950 error_at (loc
, "built-in function %qE must be directly called", expr
);
12958 /* If we're creating an if-else-if condition chain, first see if we
12959 already have this COND in the CHAIN. If so, warn and don't add COND
12960 into the vector, otherwise add the COND there. LOC is the location
12964 warn_duplicated_cond_add_or_warn (location_t loc
, tree cond
, vec
<tree
> **chain
)
12966 /* No chain has been created yet. Do nothing. */
12967 if (*chain
== NULL
)
12970 if (TREE_SIDE_EFFECTS (cond
))
12972 /* Uh-oh! This condition has a side-effect, thus invalidates
12973 the whole chain. */
12981 bool found
= false;
12982 FOR_EACH_VEC_ELT (**chain
, ix
, t
)
12983 if (operand_equal_p (cond
, t
, 0))
12985 if (warning_at (loc
, OPT_Wduplicated_cond
,
12986 "duplicated %<if%> condition"))
12987 inform (EXPR_LOCATION (t
), "previously used here");
12993 && !CONSTANT_CLASS_P (cond
)
12994 /* Don't infinitely grow the chain. */
12995 && (*chain
)->length () < 512)
12996 (*chain
)->safe_push (cond
);
12999 /* Check if array size calculations overflow or if the array covers more
13000 than half of the address space. Return true if the size of the array
13001 is valid, false otherwise. TYPE is the type of the array and NAME is
13002 the name of the array, or NULL_TREE for unnamed arrays. */
13005 valid_array_size_p (location_t loc
, tree type
, tree name
)
13007 if (type
!= error_mark_node
13008 && COMPLETE_TYPE_P (type
)
13009 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
13010 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
13013 error_at (loc
, "size of array %qE is too large", name
);
13015 error_at (loc
, "size of unnamed array is too large");
13021 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
13022 timestamp to replace embedded current dates to get reproducible
13023 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
13026 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
13028 char *source_date_epoch
;
13032 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
13033 if (!source_date_epoch
)
13034 return (time_t) -1;
13037 #if defined(INT64_T_IS_LONG)
13038 epoch
= strtol (source_date_epoch
, &endptr
, 10);
13040 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
13042 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
13043 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
13045 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
13046 "expand to a non-negative integer less than or equal to %wd",
13047 MAX_SOURCE_DATE_EPOCH
);
13048 return (time_t) -1;
13051 return (time_t) epoch
;
13054 /* Callback for libcpp for offering spelling suggestions for misspelled
13055 directives. GOAL is an unrecognized string; CANDIDATES is a
13056 NULL-terminated array of candidate strings. Return the closest
13057 match to GOAL within CANDIDATES, or NULL if none are good
13061 cb_get_suggestion (cpp_reader
*, const char *goal
,
13062 const char *const *candidates
)
13064 best_match
<const char *, const char *> bm (goal
);
13065 while (*candidates
)
13066 bm
.consider (*candidates
++);
13067 return bm
.get_best_meaningful_candidate ();
13070 /* Check and possibly warn if two declarations have contradictory
13071 attributes, such as always_inline vs. noinline. */
13074 diagnose_mismatched_attributes (tree olddecl
, tree newdecl
)
13076 bool warned
= false;
13078 tree a1
= lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl
));
13079 tree a2
= lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl
));
13080 /* An optimization attribute applied on a declaration after the
13081 definition is likely not what the user wanted. */
13082 if (a2
!= NULL_TREE
13083 && DECL_SAVED_TREE (olddecl
) != NULL_TREE
13084 && (a1
== NULL_TREE
|| !attribute_list_equal (a1
, a2
)))
13085 warned
|= warning (OPT_Wattributes
,
13086 "optimization attribute on %qD follows "
13087 "definition but the attribute doesn%'t match",
13090 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
13091 if (DECL_DECLARED_INLINE_P (newdecl
)
13092 && DECL_UNINLINABLE (olddecl
)
13093 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13094 warned
|= warning (OPT_Wattributes
, "inline declaration of %qD follows "
13095 "declaration with attribute noinline", newdecl
);
13096 else if (DECL_DECLARED_INLINE_P (olddecl
)
13097 && DECL_UNINLINABLE (newdecl
)
13098 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
13099 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13100 "noinline follows inline declaration ", newdecl
);
13101 else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
))
13102 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl
)))
13103 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13104 "%qs follows declaration with attribute %qs",
13105 newdecl
, "noinline", "always_inline");
13106 else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl
))
13107 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13108 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13109 "%qs follows declaration with attribute %qs",
13110 newdecl
, "always_inline", "noinline");
13111 else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl
))
13112 && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl
)))
13113 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13114 "%qs follows declaration with attribute %qs",
13115 newdecl
, "cold", "hot");
13116 else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl
))
13117 && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl
)))
13118 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13119 "%qs follows declaration with attribute %qs",
13120 newdecl
, "hot", "cold");
13124 #include "gt-c-family-c-common.h"