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_before (lhs_loc
, "(");
1548 richloc
.add_fixit_insert_after (lhs_loc
, ")");
1549 inform_at_rich_loc (&richloc
, "add parentheses around left hand side "
1550 "expression to silence this warning");
1554 /* Warn if EXP contains any computations whose results are not used.
1555 Return true if a warning is printed; false otherwise. LOCUS is the
1556 (potential) location of the expression. */
1559 warn_if_unused_value (const_tree exp
, location_t locus
)
1562 if (TREE_USED (exp
) || TREE_NO_WARNING (exp
))
1565 /* Don't warn about void constructs. This includes casting to void,
1566 void function calls, and statement expressions with a final cast
1568 if (VOID_TYPE_P (TREE_TYPE (exp
)))
1571 if (EXPR_HAS_LOCATION (exp
))
1572 locus
= EXPR_LOCATION (exp
);
1574 switch (TREE_CODE (exp
))
1576 case PREINCREMENT_EXPR
:
1577 case POSTINCREMENT_EXPR
:
1578 case PREDECREMENT_EXPR
:
1579 case POSTDECREMENT_EXPR
:
1584 case TRY_CATCH_EXPR
:
1585 case WITH_CLEANUP_EXPR
:
1591 /* For a binding, warn if no side effect within it. */
1592 exp
= BIND_EXPR_BODY (exp
);
1596 case NON_LVALUE_EXPR
:
1598 exp
= TREE_OPERAND (exp
, 0);
1601 case TRUTH_ORIF_EXPR
:
1602 case TRUTH_ANDIF_EXPR
:
1603 /* In && or ||, warn if 2nd operand has no side effect. */
1604 exp
= TREE_OPERAND (exp
, 1);
1608 if (warn_if_unused_value (TREE_OPERAND (exp
, 0), locus
))
1610 /* Let people do `(foo (), 0)' without a warning. */
1611 if (TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
1613 exp
= TREE_OPERAND (exp
, 1);
1617 /* If this is an expression with side effects, don't warn; this
1618 case commonly appears in macro expansions. */
1619 if (TREE_SIDE_EFFECTS (exp
))
1624 /* Don't warn about automatic dereferencing of references, since
1625 the user cannot control it. */
1626 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
1628 exp
= TREE_OPERAND (exp
, 0);
1634 /* Referencing a volatile value is a side effect, so don't warn. */
1635 if ((DECL_P (exp
) || REFERENCE_CLASS_P (exp
))
1636 && TREE_THIS_VOLATILE (exp
))
1639 /* If this is an expression which has no operands, there is no value
1640 to be unused. There are no such language-independent codes,
1641 but front ends may define such. */
1642 if (EXPRESSION_CLASS_P (exp
) && TREE_OPERAND_LENGTH (exp
) == 0)
1646 return warning_at (locus
, OPT_Wunused_value
, "value computed is not used");
1651 /* Print a warning about casts that might indicate violation
1652 of strict aliasing rules if -Wstrict-aliasing is used and
1653 strict aliasing mode is in effect. OTYPE is the original
1654 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1657 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1659 /* Strip pointer conversion chains and get to the correct original type. */
1661 otype
= TREE_TYPE (expr
);
1663 if (!(flag_strict_aliasing
1664 && POINTER_TYPE_P (type
)
1665 && POINTER_TYPE_P (otype
)
1666 && !VOID_TYPE_P (TREE_TYPE (type
)))
1667 /* If the type we are casting to is a ref-all pointer
1668 dereferencing it is always valid. */
1669 || TYPE_REF_CAN_ALIAS_ALL (type
))
1672 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1673 && (DECL_P (TREE_OPERAND (expr
, 0))
1674 || handled_component_p (TREE_OPERAND (expr
, 0))))
1676 /* Casting the address of an object to non void pointer. Warn
1677 if the cast breaks type based aliasing. */
1678 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1680 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1681 "might break strict-aliasing rules");
1686 /* warn_strict_aliasing >= 3. This includes the default (3).
1687 Only warn if the cast is dereferenced immediately. */
1688 alias_set_type set1
=
1689 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1690 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1692 if (set1
!= set2
&& set2
!= 0
1694 || (!alias_set_subset_of (set2
, set1
)
1695 && !alias_sets_conflict_p (set1
, set2
))))
1697 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1698 "pointer will break strict-aliasing rules");
1701 else if (warn_strict_aliasing
== 2
1702 && !alias_sets_must_conflict_p (set1
, set2
))
1704 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1705 "pointer might break strict-aliasing rules");
1711 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1713 /* At this level, warn for any conversions, even if an address is
1714 not taken in the same statement. This will likely produce many
1715 false positives, but could be useful to pinpoint problems that
1716 are not revealed at higher levels. */
1717 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1718 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1719 if (!COMPLETE_TYPE_P (type
)
1720 || !alias_sets_must_conflict_p (set1
, set2
))
1722 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1723 "pointer might break strict-aliasing rules");
1731 /* Warn about memset (&a, 0, sizeof (&a)); and similar mistakes with
1732 sizeof as last operand of certain builtins. */
1735 sizeof_pointer_memaccess_warning (location_t
*sizeof_arg_loc
, tree callee
,
1736 vec
<tree
, va_gc
> *params
, tree
*sizeof_arg
,
1737 bool (*comp_types
) (tree
, tree
))
1739 tree type
, dest
= NULL_TREE
, src
= NULL_TREE
, tem
;
1740 bool strop
= false, cmp
= false;
1741 unsigned int idx
= ~0;
1744 if (TREE_CODE (callee
) != FUNCTION_DECL
1745 || DECL_BUILT_IN_CLASS (callee
) != BUILT_IN_NORMAL
1746 || vec_safe_length (params
) <= 1)
1749 switch (DECL_FUNCTION_CODE (callee
))
1751 case BUILT_IN_STRNCMP
:
1752 case BUILT_IN_STRNCASECMP
:
1755 case BUILT_IN_STRNCPY
:
1756 case BUILT_IN_STRNCPY_CHK
:
1757 case BUILT_IN_STRNCAT
:
1758 case BUILT_IN_STRNCAT_CHK
:
1759 case BUILT_IN_STPNCPY
:
1760 case BUILT_IN_STPNCPY_CHK
:
1763 case BUILT_IN_MEMCPY
:
1764 case BUILT_IN_MEMCPY_CHK
:
1765 case BUILT_IN_MEMMOVE
:
1766 case BUILT_IN_MEMMOVE_CHK
:
1767 if (params
->length () < 3)
1770 dest
= (*params
)[0];
1773 case BUILT_IN_BCOPY
:
1774 if (params
->length () < 3)
1777 dest
= (*params
)[1];
1780 case BUILT_IN_MEMCMP
:
1782 if (params
->length () < 3)
1785 dest
= (*params
)[0];
1789 case BUILT_IN_MEMSET
:
1790 case BUILT_IN_MEMSET_CHK
:
1791 if (params
->length () < 3)
1793 dest
= (*params
)[0];
1796 case BUILT_IN_BZERO
:
1797 dest
= (*params
)[0];
1800 case BUILT_IN_STRNDUP
:
1805 case BUILT_IN_MEMCHR
:
1806 if (params
->length () < 3)
1811 case BUILT_IN_SNPRINTF
:
1812 case BUILT_IN_SNPRINTF_CHK
:
1813 case BUILT_IN_VSNPRINTF
:
1814 case BUILT_IN_VSNPRINTF_CHK
:
1815 dest
= (*params
)[0];
1826 if (sizeof_arg
[idx
] == NULL
|| sizeof_arg
[idx
] == error_mark_node
)
1829 type
= TYPE_P (sizeof_arg
[idx
])
1830 ? sizeof_arg
[idx
] : TREE_TYPE (sizeof_arg
[idx
]);
1831 if (!POINTER_TYPE_P (type
))
1835 && (tem
= tree_strip_nop_conversions (dest
))
1836 && POINTER_TYPE_P (TREE_TYPE (tem
))
1837 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1841 && (tem
= tree_strip_nop_conversions (src
))
1842 && POINTER_TYPE_P (TREE_TYPE (tem
))
1843 && comp_types (TREE_TYPE (TREE_TYPE (tem
)), type
))
1846 loc
= sizeof_arg_loc
[idx
];
1850 if (!TYPE_P (sizeof_arg
[idx
])
1851 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1852 && comp_types (TREE_TYPE (dest
), type
))
1854 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1855 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1856 "argument to %<sizeof%> in %qD call is the same "
1857 "expression as the destination; did you mean to "
1858 "remove the addressof?", callee
);
1859 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1860 == TYPE_PRECISION (char_type_node
))
1862 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1863 "argument to %<sizeof%> in %qD call is the same "
1864 "expression as the destination; did you mean to "
1865 "provide an explicit length?", callee
);
1867 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1868 "argument to %<sizeof%> in %qD call is the same "
1869 "expression as the destination; did you mean to "
1870 "dereference it?", callee
);
1874 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1876 && comp_types (TREE_TYPE (dest
), type
)
1877 && !VOID_TYPE_P (TREE_TYPE (type
)))
1879 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1880 "argument to %<sizeof%> in %qD call is the same "
1881 "pointer type %qT as the destination; expected %qT "
1882 "or an explicit length", callee
, TREE_TYPE (dest
),
1883 TREE_TYPE (TREE_TYPE (dest
)));
1890 if (!TYPE_P (sizeof_arg
[idx
])
1891 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1892 && comp_types (TREE_TYPE (src
), type
))
1894 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1895 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1896 "argument to %<sizeof%> in %qD call is the same "
1897 "expression as the source; did you mean to "
1898 "remove the addressof?", callee
);
1899 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1900 == TYPE_PRECISION (char_type_node
))
1902 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1903 "argument to %<sizeof%> in %qD call is the same "
1904 "expression as the source; did you mean to "
1905 "provide an explicit length?", callee
);
1907 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1908 "argument to %<sizeof%> in %qD call is the same "
1909 "expression as the source; did you mean to "
1910 "dereference it?", callee
);
1914 if (POINTER_TYPE_P (TREE_TYPE (src
))
1916 && comp_types (TREE_TYPE (src
), type
)
1917 && !VOID_TYPE_P (TREE_TYPE (type
)))
1919 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1920 "argument to %<sizeof%> in %qD call is the same "
1921 "pointer type %qT as the source; expected %qT "
1922 "or an explicit length", callee
, TREE_TYPE (src
),
1923 TREE_TYPE (TREE_TYPE (src
)));
1930 if (!TYPE_P (sizeof_arg
[idx
])
1931 && operand_equal_p (dest
, sizeof_arg
[idx
], 0)
1932 && comp_types (TREE_TYPE (dest
), type
))
1934 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1935 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1936 "argument to %<sizeof%> in %qD call is the same "
1937 "expression as the first source; did you mean to "
1938 "remove the addressof?", callee
);
1939 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1940 == TYPE_PRECISION (char_type_node
))
1942 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1943 "argument to %<sizeof%> in %qD call is the same "
1944 "expression as the first source; did you mean to "
1945 "provide an explicit length?", callee
);
1947 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1948 "argument to %<sizeof%> in %qD call is the same "
1949 "expression as the first source; did you mean to "
1950 "dereference it?", callee
);
1954 if (POINTER_TYPE_P (TREE_TYPE (dest
))
1956 && comp_types (TREE_TYPE (dest
), type
)
1957 && !VOID_TYPE_P (TREE_TYPE (type
)))
1959 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1960 "argument to %<sizeof%> in %qD call is the same "
1961 "pointer type %qT as the first source; expected %qT "
1962 "or an explicit length", callee
, TREE_TYPE (dest
),
1963 TREE_TYPE (TREE_TYPE (dest
)));
1970 if (!TYPE_P (sizeof_arg
[idx
])
1971 && operand_equal_p (src
, sizeof_arg
[idx
], 0)
1972 && comp_types (TREE_TYPE (src
), type
))
1974 if (TREE_CODE (sizeof_arg
[idx
]) == ADDR_EXPR
&& !strop
)
1975 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1976 "argument to %<sizeof%> in %qD call is the same "
1977 "expression as the second source; did you mean to "
1978 "remove the addressof?", callee
);
1979 else if ((TYPE_PRECISION (TREE_TYPE (type
))
1980 == TYPE_PRECISION (char_type_node
))
1982 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1983 "argument to %<sizeof%> in %qD call is the same "
1984 "expression as the second source; did you mean to "
1985 "provide an explicit length?", callee
);
1987 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
1988 "argument to %<sizeof%> in %qD call is the same "
1989 "expression as the second source; did you mean to "
1990 "dereference it?", callee
);
1994 if (POINTER_TYPE_P (TREE_TYPE (src
))
1996 && comp_types (TREE_TYPE (src
), type
)
1997 && !VOID_TYPE_P (TREE_TYPE (type
)))
1999 warning_at (loc
, OPT_Wsizeof_pointer_memaccess
,
2000 "argument to %<sizeof%> in %qD call is the same "
2001 "pointer type %qT as the second source; expected %qT "
2002 "or an explicit length", callee
, TREE_TYPE (src
),
2003 TREE_TYPE (TREE_TYPE (src
)));
2010 /* Warn for unlikely, improbable, or stupid DECL declarations
2014 check_main_parameter_types (tree decl
)
2016 function_args_iterator iter
;
2020 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl
), type
, iter
)
2022 /* XXX void_type_node belies the abstraction. */
2023 if (type
== void_type_node
|| type
== error_mark_node
)
2027 if (TYPE_ATOMIC (t
))
2028 pedwarn (input_location
, OPT_Wmain
,
2029 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2031 while (POINTER_TYPE_P (t
))
2034 if (TYPE_ATOMIC (t
))
2035 pedwarn (input_location
, OPT_Wmain
,
2036 "%<_Atomic%>-qualified parameter type %qT of %q+D",
2044 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
2045 pedwarn (input_location
, OPT_Wmain
,
2046 "first argument of %q+D should be %<int%>", decl
);
2050 if (TREE_CODE (type
) != POINTER_TYPE
2051 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2052 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2054 pedwarn (input_location
, OPT_Wmain
,
2055 "second argument of %q+D should be %<char **%>", decl
);
2059 if (TREE_CODE (type
) != POINTER_TYPE
2060 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
2061 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
2063 pedwarn (input_location
, OPT_Wmain
,
2064 "third argument of %q+D should probably be "
2065 "%<char **%>", decl
);
2070 /* It is intentional that this message does not mention the third
2071 argument because it's only mentioned in an appendix of the
2073 if (argct
> 0 && (argct
< 2 || argct
> 3))
2074 pedwarn (input_location
, OPT_Wmain
,
2075 "%q+D takes only zero or two arguments", decl
);
2077 if (stdarg_p (TREE_TYPE (decl
)))
2078 pedwarn (input_location
, OPT_Wmain
,
2079 "%q+D declared as variadic function", decl
);
2082 /* vector_targets_convertible_p is used for vector pointer types. The
2083 callers perform various checks that the qualifiers are satisfactory,
2084 while OTOH vector_targets_convertible_p ignores the number of elements
2085 in the vectors. That's fine with vector pointers as we can consider,
2086 say, a vector of 8 elements as two consecutive vectors of 4 elements,
2087 and that does not require and conversion of the pointer values.
2088 In contrast, vector_types_convertible_p and
2089 vector_types_compatible_elements_p are used for vector value types. */
2090 /* True if pointers to distinct types T1 and T2 can be converted to
2091 each other without an explicit cast. Only returns true for opaque
2094 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
2096 if (VECTOR_TYPE_P (t1
) && VECTOR_TYPE_P (t2
)
2097 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2098 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2104 /* vector_types_convertible_p is used for vector value types.
2105 It could in principle call vector_targets_convertible_p as a subroutine,
2106 but then the check for vector type would be duplicated with its callers,
2107 and also the purpose of vector_targets_convertible_p would become
2109 Where vector_types_convertible_p returns true, a conversion might still be
2110 needed to make the types match.
2111 In contrast, vector_targets_convertible_p is used for vector pointer
2112 values, and vector_types_compatible_elements_p is used specifically
2113 in the context for binary operators, as a check if use is possible without
2115 /* True if vector types T1 and T2 can be converted to each other
2116 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
2117 can only be converted with -flax-vector-conversions yet that is not
2118 in effect, emit a note telling the user about that option if such
2119 a note has not previously been emitted. */
2121 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
2123 static bool emitted_lax_note
= false;
2124 bool convertible_lax
;
2126 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
2127 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
2131 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
2132 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
2133 TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
))
2134 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
2135 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
2137 if (!convertible_lax
|| flag_lax_vector_conversions
)
2138 return convertible_lax
;
2140 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
2141 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
2144 if (emit_lax_note
&& !emitted_lax_note
)
2146 emitted_lax_note
= true;
2147 inform (input_location
, "use -flax-vector-conversions to permit "
2148 "conversions between vectors with differing "
2149 "element types or numbers of subparts");
2155 /* Build a VEC_PERM_EXPR if V0, V1 and MASK are not error_mark_nodes
2156 and have vector types, V0 has the same type as V1, and the number of
2157 elements of V0, V1, MASK is the same.
2159 In case V1 is a NULL_TREE it is assumed that __builtin_shuffle was
2160 called with two arguments. In this case implementation passes the
2161 first argument twice in order to share the same tree code. This fact
2162 could enable the mask-values being twice the vector length. This is
2163 an implementation accident and this semantics is not guaranteed to
2166 c_build_vec_perm_expr (location_t loc
, tree v0
, tree v1
, tree mask
,
2171 bool maybe_const
= false;
2172 bool two_arguments
= false;
2174 if (v1
== NULL_TREE
)
2176 two_arguments
= true;
2180 if (v0
== error_mark_node
|| v1
== error_mark_node
2181 || mask
== error_mark_node
)
2182 return error_mark_node
;
2184 if (!VECTOR_INTEGER_TYPE_P (TREE_TYPE (mask
)))
2187 error_at (loc
, "__builtin_shuffle last argument must "
2188 "be an integer vector");
2189 return error_mark_node
;
2192 if (!VECTOR_TYPE_P (TREE_TYPE (v0
))
2193 || !VECTOR_TYPE_P (TREE_TYPE (v1
)))
2196 error_at (loc
, "__builtin_shuffle arguments must be vectors");
2197 return error_mark_node
;
2200 if (TYPE_MAIN_VARIANT (TREE_TYPE (v0
)) != TYPE_MAIN_VARIANT (TREE_TYPE (v1
)))
2203 error_at (loc
, "__builtin_shuffle argument vectors must be of "
2205 return error_mark_node
;
2208 if (TYPE_VECTOR_SUBPARTS (TREE_TYPE (v0
))
2209 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
))
2210 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (v1
))
2211 != TYPE_VECTOR_SUBPARTS (TREE_TYPE (mask
)))
2214 error_at (loc
, "__builtin_shuffle number of elements of the "
2215 "argument vector(s) and the mask vector should "
2217 return error_mark_node
;
2220 if (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (v0
))))
2221 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_TYPE (mask
)))))
2224 error_at (loc
, "__builtin_shuffle argument vector(s) inner type "
2225 "must have the same size as inner type of the mask");
2226 return error_mark_node
;
2229 if (!c_dialect_cxx ())
2231 /* Avoid C_MAYBE_CONST_EXPRs inside VEC_PERM_EXPR. */
2232 v0
= c_fully_fold (v0
, false, &maybe_const
);
2233 wrap
&= maybe_const
;
2236 v1
= v0
= save_expr (v0
);
2239 v1
= c_fully_fold (v1
, false, &maybe_const
);
2240 wrap
&= maybe_const
;
2243 mask
= c_fully_fold (mask
, false, &maybe_const
);
2244 wrap
&= maybe_const
;
2246 else if (two_arguments
)
2247 v1
= v0
= save_expr (v0
);
2249 ret
= build3_loc (loc
, VEC_PERM_EXPR
, TREE_TYPE (v0
), v0
, v1
, mask
);
2251 if (!c_dialect_cxx () && !wrap
)
2252 ret
= c_wrap_maybe_const (ret
, true);
2257 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
2258 to integral type. */
2261 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
2263 op
= get_narrower (op
, unsignedp_ptr
);
2265 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
2266 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
2268 /* C++0x scoped enumerations don't implicitly convert to integral
2269 type; if we stripped an explicit conversion to a larger type we
2270 need to replace it so common_type will still work. */
2271 tree type
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op
)),
2272 TYPE_UNSIGNED (TREE_TYPE (op
)));
2273 op
= fold_convert (type
, op
);
2278 /* This is a helper function of build_binary_op.
2280 For certain operations if both args were extended from the same
2281 smaller type, do the arithmetic in that type and then extend.
2283 BITWISE indicates a bitwise operation.
2284 For them, this optimization is safe only if
2285 both args are zero-extended or both are sign-extended.
2286 Otherwise, we might change the result.
2287 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2288 but calculated in (unsigned short) it would be (unsigned short)-1.
2291 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
2293 int unsigned0
, unsigned1
;
2298 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
2299 excessive narrowing when we call get_narrower below. For
2300 example, suppose that OP0 is of unsigned int extended
2301 from signed char and that RESULT_TYPE is long long int.
2302 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
2305 (long long int) (unsigned int) signed_char
2307 which get_narrower would narrow down to
2309 (unsigned int) signed char
2311 If we do not cast OP0 first, get_narrower would return
2312 signed_char, which is inconsistent with the case of the
2314 op0
= convert (result_type
, op0
);
2315 op1
= convert (result_type
, op1
);
2317 arg0
= c_common_get_narrower (op0
, &unsigned0
);
2318 arg1
= c_common_get_narrower (op1
, &unsigned1
);
2320 /* UNS is 1 if the operation to be done is an unsigned one. */
2321 uns
= TYPE_UNSIGNED (result_type
);
2323 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2324 but it *requires* conversion to FINAL_TYPE. */
2326 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2327 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2328 && TREE_TYPE (op0
) != result_type
)
2329 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2330 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2331 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2332 && TREE_TYPE (op1
) != result_type
)
2333 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2335 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2337 /* For bitwise operations, signedness of nominal type
2338 does not matter. Consider only how operands were extended. */
2342 /* Note that in all three cases below we refrain from optimizing
2343 an unsigned operation on sign-extended args.
2344 That would not be valid. */
2346 /* Both args variable: if both extended in same way
2347 from same width, do it in that width.
2348 Do it unsigned if args were zero-extended. */
2349 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2350 < TYPE_PRECISION (result_type
))
2351 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2352 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2353 && unsigned0
== unsigned1
2354 && (unsigned0
|| !uns
))
2355 return c_common_signed_or_unsigned_type
2356 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2358 else if (TREE_CODE (arg0
) == INTEGER_CST
2359 && (unsigned1
|| !uns
)
2360 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2361 < TYPE_PRECISION (result_type
))
2363 = c_common_signed_or_unsigned_type (unsigned1
,
2365 && !POINTER_TYPE_P (type
)
2366 && int_fits_type_p (arg0
, type
))
2369 else if (TREE_CODE (arg1
) == INTEGER_CST
2370 && (unsigned0
|| !uns
)
2371 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2372 < TYPE_PRECISION (result_type
))
2374 = c_common_signed_or_unsigned_type (unsigned0
,
2376 && !POINTER_TYPE_P (type
)
2377 && int_fits_type_p (arg1
, type
))
2383 /* Returns true iff any integer value of type FROM_TYPE can be represented as
2384 real of type TO_TYPE. This is a helper function for unsafe_conversion_p. */
2387 int_safely_convertible_to_real_p (const_tree from_type
, const_tree to_type
)
2389 tree type_low_bound
= TYPE_MIN_VALUE (from_type
);
2390 tree type_high_bound
= TYPE_MAX_VALUE (from_type
);
2391 REAL_VALUE_TYPE real_low_bound
=
2392 real_value_from_int_cst (0, type_low_bound
);
2393 REAL_VALUE_TYPE real_high_bound
=
2394 real_value_from_int_cst (0, type_high_bound
);
2396 return exact_real_truncate (TYPE_MODE (to_type
), &real_low_bound
)
2397 && exact_real_truncate (TYPE_MODE (to_type
), &real_high_bound
);
2400 /* Checks if expression EXPR of complex/real/integer type cannot be converted
2401 to the complex/real/integer type TYPE. Function returns non-zero when:
2402 * EXPR is a constant which cannot be exactly converted to TYPE.
2403 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
2404 for EXPR type and TYPE being both integers or both real, or both
2406 * EXPR is not a constant of complex type and TYPE is a real or
2408 * EXPR is not a constant of real type and TYPE is an integer.
2409 * EXPR is not a constant of integer type which cannot be
2410 exactly converted to real type.
2412 Function allows conversions between types of different signedness and
2413 can return SAFE_CONVERSION (zero) in that case. Function can produce
2414 signedness warnings if PRODUCE_WARNS is true.
2416 Function allows conversions from complex constants to non-complex types,
2417 provided that imaginary part is zero and real part can be safely converted
2420 enum conversion_safety
2421 unsafe_conversion_p (location_t loc
, tree type
, tree expr
, bool produce_warns
)
2423 enum conversion_safety give_warning
= SAFE_CONVERSION
; /* is 0 or false */
2424 tree expr_type
= TREE_TYPE (expr
);
2425 loc
= expansion_point_location_if_in_system_header (loc
);
2427 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
2429 /* If type is complex, we are interested in compatibility with
2431 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2432 type
= TREE_TYPE (type
);
2434 /* Warn for real constant that is not an exact integer converted
2436 if (TREE_CODE (expr_type
) == REAL_TYPE
2437 && TREE_CODE (type
) == INTEGER_TYPE
)
2439 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
2440 give_warning
= UNSAFE_REAL
;
2442 /* Warn for an integer constant that does not fit into integer type. */
2443 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2444 && TREE_CODE (type
) == INTEGER_TYPE
2445 && !int_fits_type_p (expr
, type
))
2447 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
2448 && tree_int_cst_sgn (expr
) < 0)
2451 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
2452 " implicitly converted to unsigned type");
2454 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
2457 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
2458 " constant value to negative integer");
2461 give_warning
= UNSAFE_OTHER
;
2463 else if (TREE_CODE (type
) == REAL_TYPE
)
2465 /* Warn for an integer constant that does not fit into real type. */
2466 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
2468 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
2469 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2470 give_warning
= UNSAFE_REAL
;
2472 /* Warn for a real constant that does not fit into a smaller
2474 else if (TREE_CODE (expr_type
) == REAL_TYPE
2475 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2477 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2478 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2479 give_warning
= UNSAFE_REAL
;
2484 else if (TREE_CODE (expr
) == COMPLEX_CST
)
2486 tree imag_part
= TREE_IMAGPART (expr
);
2487 /* Conversion from complex constant with zero imaginary part,
2488 perform check for conversion of real part. */
2489 if ((TREE_CODE (imag_part
) == REAL_CST
2490 && real_zerop (imag_part
))
2491 || (TREE_CODE (imag_part
) == INTEGER_CST
2492 && integer_zerop (imag_part
)))
2493 /* Note: in this branch we use recursive call to unsafe_conversion_p
2494 with different type of EXPR, but it is still safe, because when EXPR
2495 is a constant, it's type is not used in text of generated warnings
2496 (otherwise they could sound misleading). */
2497 return unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
),
2499 /* Conversion from complex constant with non-zero imaginary part. */
2502 /* Conversion to complex type.
2503 Perform checks for both real and imaginary parts. */
2504 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2506 /* Unfortunately, produce_warns must be false in two subsequent
2507 calls of unsafe_conversion_p, because otherwise we could
2508 produce strange "double" warnings, if both real and imaginary
2509 parts have conversion problems related to signedness.
2512 int32_t _Complex a = 0x80000000 + 0x80000000i;
2514 Possible solution: add a separate function for checking
2515 constants and combine result of two calls appropriately. */
2516 enum conversion_safety re_safety
=
2517 unsafe_conversion_p (loc
, type
, TREE_REALPART (expr
), false);
2518 enum conversion_safety im_safety
=
2519 unsafe_conversion_p (loc
, type
, imag_part
, false);
2521 /* Merge the results into appropriate single warning. */
2523 /* Note: this case includes SAFE_CONVERSION, i.e. success. */
2524 if (re_safety
== im_safety
)
2525 give_warning
= re_safety
;
2526 else if (!re_safety
&& im_safety
)
2527 give_warning
= im_safety
;
2528 else if (re_safety
&& !im_safety
)
2529 give_warning
= re_safety
;
2531 give_warning
= UNSAFE_OTHER
;
2533 /* Warn about conversion from complex to real or integer type. */
2535 give_warning
= UNSAFE_IMAGINARY
;
2539 /* Checks for remaining case: EXPR is not constant. */
2542 /* Warn for real types converted to integer types. */
2543 if (TREE_CODE (expr_type
) == REAL_TYPE
2544 && TREE_CODE (type
) == INTEGER_TYPE
)
2545 give_warning
= UNSAFE_REAL
;
2547 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2548 && TREE_CODE (type
) == INTEGER_TYPE
)
2550 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2551 expr
= get_unwidened (expr
, 0);
2552 expr_type
= TREE_TYPE (expr
);
2554 /* Don't warn for short y; short x = ((int)y & 0xff); */
2555 if (TREE_CODE (expr
) == BIT_AND_EXPR
2556 || TREE_CODE (expr
) == BIT_IOR_EXPR
2557 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2559 /* If both args were extended from a shortest type,
2560 use that type if that is safe. */
2561 expr_type
= shorten_binary_op (expr_type
,
2562 TREE_OPERAND (expr
, 0),
2563 TREE_OPERAND (expr
, 1),
2566 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2568 tree op0
= TREE_OPERAND (expr
, 0);
2569 tree op1
= TREE_OPERAND (expr
, 1);
2570 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2571 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2573 /* If one of the operands is a non-negative constant
2574 that fits in the target type, then the type of the
2575 other operand does not matter. */
2576 if ((TREE_CODE (op0
) == INTEGER_CST
2577 && int_fits_type_p (op0
, c_common_signed_type (type
))
2578 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2579 || (TREE_CODE (op1
) == INTEGER_CST
2580 && int_fits_type_p (op1
, c_common_signed_type (type
))
2581 && int_fits_type_p (op1
,
2582 c_common_unsigned_type (type
))))
2583 return SAFE_CONVERSION
;
2584 /* If constant is unsigned and fits in the target
2585 type, then the result will also fit. */
2586 else if ((TREE_CODE (op0
) == INTEGER_CST
2588 && int_fits_type_p (op0
, type
))
2589 || (TREE_CODE (op1
) == INTEGER_CST
2591 && int_fits_type_p (op1
, type
)))
2592 return SAFE_CONVERSION
;
2595 /* Warn for integer types converted to smaller integer types. */
2596 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2597 give_warning
= UNSAFE_OTHER
;
2599 /* When they are the same width but different signedness,
2600 then the value may change. */
2601 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2602 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2603 /* Even when converted to a bigger type, if the type is
2604 unsigned but expr is signed, then negative values
2606 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2608 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
2609 "may change the sign of the result",
2613 /* Warn for integer types converted to real types if and only if
2614 all the range of values of the integer type cannot be
2615 represented by the real type. */
2616 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2617 && TREE_CODE (type
) == REAL_TYPE
)
2619 /* Don't warn about char y = 0xff; float x = (int) y; */
2620 expr
= get_unwidened (expr
, 0);
2621 expr_type
= TREE_TYPE (expr
);
2623 if (!int_safely_convertible_to_real_p (expr_type
, type
))
2624 give_warning
= UNSAFE_OTHER
;
2627 /* Warn for real types converted to smaller real types. */
2628 else if (TREE_CODE (expr_type
) == REAL_TYPE
2629 && TREE_CODE (type
) == REAL_TYPE
2630 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2631 give_warning
= UNSAFE_REAL
;
2633 /* Check conversion between two complex types. */
2634 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2635 && TREE_CODE (type
) == COMPLEX_TYPE
)
2637 /* Extract underlying types (i.e., type of real and imaginary
2638 parts) of expr_type and type. */
2639 tree from_type
= TREE_TYPE (expr_type
);
2640 tree to_type
= TREE_TYPE (type
);
2642 /* Warn for real types converted to integer types. */
2643 if (TREE_CODE (from_type
) == REAL_TYPE
2644 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2645 give_warning
= UNSAFE_REAL
;
2647 /* Warn for real types converted to smaller real types. */
2648 else if (TREE_CODE (from_type
) == REAL_TYPE
2649 && TREE_CODE (to_type
) == REAL_TYPE
2650 && TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2651 give_warning
= UNSAFE_REAL
;
2653 /* Check conversion for complex integer types. Here implementation
2654 is simpler than for real-domain integers because it does not
2655 involve sophisticated cases, such as bitmasks, casts, etc. */
2656 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2657 && TREE_CODE (to_type
) == INTEGER_TYPE
)
2659 /* Warn for integer types converted to smaller integer types. */
2660 if (TYPE_PRECISION (to_type
) < TYPE_PRECISION (from_type
))
2661 give_warning
= UNSAFE_OTHER
;
2663 /* Check for different signedness, see case for real-domain
2664 integers (above) for a more detailed comment. */
2665 else if (((TYPE_PRECISION (to_type
) == TYPE_PRECISION (from_type
)
2666 && TYPE_UNSIGNED (to_type
) != TYPE_UNSIGNED (from_type
))
2667 || (TYPE_UNSIGNED (to_type
) && !TYPE_UNSIGNED (from_type
)))
2669 warning_at (loc
, OPT_Wsign_conversion
,
2670 "conversion to %qT from %qT "
2671 "may change the sign of the result",
2674 else if (TREE_CODE (from_type
) == INTEGER_TYPE
2675 && TREE_CODE (to_type
) == REAL_TYPE
2676 && !int_safely_convertible_to_real_p (from_type
, to_type
))
2677 give_warning
= UNSAFE_OTHER
;
2680 /* Warn for complex types converted to real or integer types. */
2681 else if (TREE_CODE (expr_type
) == COMPLEX_TYPE
2682 && TREE_CODE (type
) != COMPLEX_TYPE
)
2683 give_warning
= UNSAFE_IMAGINARY
;
2686 return give_warning
;
2689 /* Warns if the conversion of EXPR to TYPE may alter a value.
2690 This is a helper function for warnings_for_convert_and_check. */
2693 conversion_warning (location_t loc
, tree type
, tree expr
)
2695 tree expr_type
= TREE_TYPE (expr
);
2696 enum conversion_safety conversion_kind
;
2698 if (!warn_conversion
&& !warn_sign_conversion
&& !warn_float_conversion
)
2701 /* This may happen, because for LHS op= RHS we preevaluate
2702 RHS and create C_MAYBE_CONST_EXPR <SAVE_EXPR <RHS>>, which
2703 means we could no longer see the code of the EXPR. */
2704 if (TREE_CODE (expr
) == C_MAYBE_CONST_EXPR
)
2705 expr
= C_MAYBE_CONST_EXPR_EXPR (expr
);
2706 if (TREE_CODE (expr
) == SAVE_EXPR
)
2707 expr
= TREE_OPERAND (expr
, 0);
2709 switch (TREE_CODE (expr
))
2717 case TRUTH_ANDIF_EXPR
:
2718 case TRUTH_ORIF_EXPR
:
2719 case TRUTH_AND_EXPR
:
2721 case TRUTH_XOR_EXPR
:
2722 case TRUTH_NOT_EXPR
:
2723 /* Conversion from boolean to a signed:1 bit-field (which only
2724 can hold the values 0 and -1) doesn't lose information - but
2725 it does change the value. */
2726 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2727 warning_at (loc
, OPT_Wconversion
,
2728 "conversion to %qT from boolean expression", type
);
2734 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2735 if (conversion_kind
== UNSAFE_REAL
)
2736 warning_at (loc
, OPT_Wfloat_conversion
,
2737 "conversion to %qT alters %qT constant value",
2739 else if (conversion_kind
)
2740 warning_at (loc
, OPT_Wconversion
,
2741 "conversion to %qT alters %qT constant value",
2747 /* In case of COND_EXPR, we do not care about the type of
2748 COND_EXPR, only about the conversion of each operand. */
2749 tree op1
= TREE_OPERAND (expr
, 1);
2750 tree op2
= TREE_OPERAND (expr
, 2);
2752 conversion_warning (loc
, type
, op1
);
2753 conversion_warning (loc
, type
, op2
);
2757 default: /* 'expr' is not a constant. */
2758 conversion_kind
= unsafe_conversion_p (loc
, type
, expr
, true);
2759 if (conversion_kind
== UNSAFE_REAL
)
2760 warning_at (loc
, OPT_Wfloat_conversion
,
2761 "conversion to %qT from %qT may alter its value",
2763 else if (conversion_kind
== UNSAFE_IMAGINARY
)
2764 warning_at (loc
, OPT_Wconversion
,
2765 "conversion to %qT from %qT discards imaginary component",
2767 else if (conversion_kind
)
2768 warning_at (loc
, OPT_Wconversion
,
2769 "conversion to %qT from %qT may alter its value",
2774 /* Produce warnings after a conversion. RESULT is the result of
2775 converting EXPR to TYPE. This is a helper function for
2776 convert_and_check and cp_convert_and_check. */
2779 warnings_for_convert_and_check (location_t loc
, tree type
, tree expr
,
2782 loc
= expansion_point_location_if_in_system_header (loc
);
2784 if (TREE_CODE (expr
) == INTEGER_CST
2785 && (TREE_CODE (type
) == INTEGER_TYPE
2786 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2787 && !int_fits_type_p (expr
, type
))
2789 /* Do not diagnose overflow in a constant expression merely
2790 because a conversion overflowed. */
2791 if (TREE_OVERFLOW (result
))
2792 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2794 if (TYPE_UNSIGNED (type
))
2796 /* This detects cases like converting -129 or 256 to
2798 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2799 warning_at (loc
, OPT_Woverflow
,
2800 "large integer implicitly truncated to unsigned type");
2802 conversion_warning (loc
, type
, expr
);
2804 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2805 warning_at (loc
, OPT_Woverflow
,
2806 "overflow in implicit constant conversion");
2807 /* No warning for converting 0x80000000 to int. */
2809 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2810 || TYPE_PRECISION (TREE_TYPE (expr
))
2811 != TYPE_PRECISION (type
)))
2812 warning_at (loc
, OPT_Woverflow
,
2813 "overflow in implicit constant conversion");
2816 conversion_warning (loc
, type
, expr
);
2818 else if ((TREE_CODE (result
) == INTEGER_CST
2819 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2820 warning_at (loc
, OPT_Woverflow
,
2821 "overflow in implicit constant conversion");
2823 conversion_warning (loc
, type
, expr
);
2827 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2828 Invoke this function on every expression that is converted implicitly,
2829 i.e. because of language rules and not because of an explicit cast. */
2832 convert_and_check (location_t loc
, tree type
, tree expr
)
2835 tree expr_for_warning
;
2837 /* Convert from a value with possible excess precision rather than
2838 via the semantic type, but do not warn about values not fitting
2839 exactly in the semantic type. */
2840 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2842 tree orig_type
= TREE_TYPE (expr
);
2843 expr
= TREE_OPERAND (expr
, 0);
2844 expr_for_warning
= convert (orig_type
, expr
);
2845 if (orig_type
== type
)
2846 return expr_for_warning
;
2849 expr_for_warning
= expr
;
2851 if (TREE_TYPE (expr
) == type
)
2854 result
= convert (type
, expr
);
2856 if (c_inhibit_evaluation_warnings
== 0
2857 && !TREE_OVERFLOW_P (expr
)
2858 && result
!= error_mark_node
)
2859 warnings_for_convert_and_check (loc
, type
, expr_for_warning
, result
);
2864 /* A node in a list that describes references to variables (EXPR), which are
2865 either read accesses if WRITER is zero, or write accesses, in which case
2866 WRITER is the parent of EXPR. */
2873 /* Used to implement a cache the results of a call to verify_tree. We only
2874 use this for SAVE_EXPRs. */
2877 struct tlist_cache
*next
;
2878 struct tlist
*cache_before_sp
;
2879 struct tlist
*cache_after_sp
;
2883 /* Obstack to use when allocating tlist structures, and corresponding
2885 static struct obstack tlist_obstack
;
2886 static char *tlist_firstobj
= 0;
2888 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2890 static struct tlist
*warned_ids
;
2891 /* SAVE_EXPRs need special treatment. We process them only once and then
2892 cache the results. */
2893 static struct tlist_cache
*save_expr_cache
;
2895 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2896 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2897 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2898 static int warning_candidate_p (tree
);
2899 static bool candidate_equal_p (const_tree
, const_tree
);
2900 static void warn_for_collisions (struct tlist
*);
2901 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2902 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2904 /* Create a new struct tlist and fill in its fields. */
2905 static struct tlist
*
2906 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2909 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2916 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2917 is nonnull, we ignore any node we find which has a writer equal to it. */
2920 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2924 struct tlist
*next
= add
->next
;
2927 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2928 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2933 /* Merge the nodes of ADD into TO. This merging process is done so that for
2934 each variable that already exists in TO, no new node is added; however if
2935 there is a write access recorded in ADD, and an occurrence on TO is only
2936 a read access, then the occurrence in TO will be modified to record the
2940 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2942 struct tlist
**end
= to
;
2945 end
= &(*end
)->next
;
2951 struct tlist
*next
= add
->next
;
2953 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2954 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2958 tmp2
->writer
= add
->writer
;
2962 *end
= copy
? new_tlist (NULL
, add
->expr
, add
->writer
) : add
;
2963 end
= &(*end
)->next
;
2970 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2971 references in list LIST conflict with it, excluding reads if ONLY writers
2975 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2980 /* Avoid duplicate warnings. */
2981 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2982 if (candidate_equal_p (tmp
->expr
, written
))
2987 if (candidate_equal_p (list
->expr
, written
)
2988 && !candidate_equal_p (list
->writer
, writer
)
2989 && (!only_writes
|| list
->writer
))
2991 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2992 warning_at (EXPR_LOC_OR_LOC (writer
, input_location
),
2993 OPT_Wsequence_point
, "operation on %qE may be undefined",
3000 /* Given a list LIST of references to variables, find whether any of these
3001 can cause conflicts due to missing sequence points. */
3004 warn_for_collisions (struct tlist
*list
)
3008 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
3011 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
3015 /* Return nonzero if X is a tree that can be verified by the sequence point
3018 warning_candidate_p (tree x
)
3020 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
3023 if (TREE_CODE (x
) == BLOCK
)
3026 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
3027 (lvalue_p) crash on TRY/CATCH. */
3028 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
3034 /* No point to track non-const calls, they will never satisfy
3036 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
3039 if (TREE_CODE (x
) == STRING_CST
)
3045 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
3047 candidate_equal_p (const_tree x
, const_tree y
)
3049 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
3052 /* Walk the tree X, and record accesses to variables. If X is written by the
3053 parent tree, WRITER is the parent.
3054 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
3055 expression or its only operand forces a sequence point, then everything up
3056 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
3058 Once we return, we will have emitted warnings if any subexpression before
3059 such a sequence point could be undefined. On a higher level, however, the
3060 sequence point may not be relevant, and we'll merge the two lists.
3062 Example: (b++, a) + b;
3063 The call that processes the COMPOUND_EXPR will store the increment of B
3064 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
3065 processes the PLUS_EXPR will need to merge the two lists so that
3066 eventually, all accesses end up on the same list (and we'll warn about the
3067 unordered subexpressions b++ and b.
3069 A note on merging. If we modify the former example so that our expression
3072 care must be taken not simply to add all three expressions into the final
3073 PNO_SP list. The function merge_tlist takes care of that by merging the
3074 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
3075 way, so that no more than one access to B is recorded. */
3078 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
3081 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
3082 enum tree_code code
;
3083 enum tree_code_class cl
;
3085 /* X may be NULL if it is the operand of an empty statement expression
3091 code
= TREE_CODE (x
);
3092 cl
= TREE_CODE_CLASS (code
);
3094 if (warning_candidate_p (x
))
3095 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
3104 case TRUTH_ANDIF_EXPR
:
3105 case TRUTH_ORIF_EXPR
:
3106 tmp_before
= tmp_nosp
= tmp_list2
= tmp_list3
= 0;
3107 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3108 warn_for_collisions (tmp_nosp
);
3109 merge_tlist (pbefore_sp
, tmp_before
, 0);
3110 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
3111 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3112 warn_for_collisions (tmp_list2
);
3113 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3114 merge_tlist (pno_sp
, tmp_list2
, 0);
3118 tmp_before
= tmp_list2
= 0;
3119 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
3120 warn_for_collisions (tmp_list2
);
3121 merge_tlist (pbefore_sp
, tmp_before
, 0);
3122 merge_tlist (pbefore_sp
, tmp_list2
, 0);
3124 tmp_list3
= tmp_nosp
= 0;
3125 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
3126 warn_for_collisions (tmp_nosp
);
3127 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3129 tmp_list3
= tmp_list2
= 0;
3130 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
3131 warn_for_collisions (tmp_list2
);
3132 merge_tlist (pbefore_sp
, tmp_list3
, 0);
3133 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
3134 two first, to avoid warning for (a ? b++ : b++). */
3135 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
3136 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3139 case PREDECREMENT_EXPR
:
3140 case PREINCREMENT_EXPR
:
3141 case POSTDECREMENT_EXPR
:
3142 case POSTINCREMENT_EXPR
:
3143 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
3147 tmp_before
= tmp_nosp
= tmp_list3
= 0;
3148 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3149 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
3150 /* Expressions inside the LHS are not ordered wrt. the sequence points
3151 in the RHS. Example:
3153 Despite the fact that the modification of "a" is in the before_sp
3154 list (tmp_before), it conflicts with the use of "a" in the LHS.
3155 We can handle this by adding the contents of tmp_list3
3156 to those of tmp_before, and redoing the collision warnings for that
3158 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
3159 warn_for_collisions (tmp_before
);
3160 /* Exclude the LHS itself here; we first have to merge it into the
3161 tmp_nosp list. This is done to avoid warning for "a = a"; if we
3162 didn't exclude the LHS, we'd get it twice, once as a read and once
3164 add_tlist (pno_sp
, tmp_list3
, x
, 0);
3165 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
3167 merge_tlist (pbefore_sp
, tmp_before
, 0);
3168 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
3169 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
3170 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
3174 /* We need to warn about conflicts among arguments and conflicts between
3175 args and the function address. Side effects of the function address,
3176 however, are not ordered by the sequence point of the call. */
3178 call_expr_arg_iterator iter
;
3180 tmp_before
= tmp_nosp
= 0;
3181 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3182 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
3184 tmp_list2
= tmp_list3
= 0;
3185 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
3186 merge_tlist (&tmp_list3
, tmp_list2
, 0);
3187 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
3189 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
3190 warn_for_collisions (tmp_before
);
3191 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
3196 /* Scan all the list, e.g. indices of multi dimensional array. */
3199 tmp_before
= tmp_nosp
= 0;
3200 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3201 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3202 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3209 struct tlist_cache
*t
;
3210 for (t
= save_expr_cache
; t
; t
= t
->next
)
3211 if (candidate_equal_p (t
->expr
, x
))
3216 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
3217 t
->next
= save_expr_cache
;
3219 save_expr_cache
= t
;
3221 tmp_before
= tmp_nosp
= 0;
3222 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
3223 warn_for_collisions (tmp_nosp
);
3226 merge_tlist (&tmp_list3
, tmp_nosp
, 0);
3227 t
->cache_before_sp
= tmp_before
;
3228 t
->cache_after_sp
= tmp_list3
;
3230 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
3231 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
3236 x
= TREE_OPERAND (x
, 0);
3243 /* For other expressions, simply recurse on their operands.
3244 Manual tail recursion for unary expressions.
3245 Other non-expressions need not be processed. */
3246 if (cl
== tcc_unary
)
3248 x
= TREE_OPERAND (x
, 0);
3252 else if (IS_EXPR_CODE_CLASS (cl
))
3255 int max
= TREE_OPERAND_LENGTH (x
);
3256 for (lp
= 0; lp
< max
; lp
++)
3258 tmp_before
= tmp_nosp
= 0;
3259 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
3260 merge_tlist (&tmp_nosp
, tmp_before
, 0);
3261 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
3268 /* Try to warn for undefined behavior in EXPR due to missing sequence
3272 verify_sequence_points (tree expr
)
3274 struct tlist
*before_sp
= 0, *after_sp
= 0;
3277 save_expr_cache
= 0;
3278 if (tlist_firstobj
== 0)
3280 gcc_obstack_init (&tlist_obstack
);
3281 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
3284 verify_tree (expr
, &before_sp
, &after_sp
, 0);
3285 warn_for_collisions (after_sp
);
3286 obstack_free (&tlist_obstack
, tlist_firstobj
);
3289 /* Validate the expression after `case' and apply default promotions. */
3292 check_case_value (location_t loc
, tree value
)
3294 if (value
== NULL_TREE
)
3297 if (TREE_CODE (value
) == INTEGER_CST
)
3298 /* Promote char or short to int. */
3299 value
= perform_integral_promotions (value
);
3300 else if (value
!= error_mark_node
)
3302 error_at (loc
, "case label does not reduce to an integer constant");
3303 value
= error_mark_node
;
3306 constant_expression_warning (value
);
3311 /* See if the case values LOW and HIGH are in the range of the original
3312 type (i.e. before the default conversion to int) of the switch testing
3314 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
3315 the type before promoting it. CASE_LOW_P is a pointer to the lower
3316 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
3317 if the case is not a case range.
3318 The caller has to make sure that we are not called with NULL for
3319 CASE_LOW_P (i.e. the default case). OUTSIDE_RANGE_P says whether there
3320 was a case value that doesn't fit into the range of the ORIG_TYPE.
3321 Returns true if the case label is in range of ORIG_TYPE (saturated or
3322 untouched) or false if the label is out of range. */
3325 check_case_bounds (location_t loc
, tree type
, tree orig_type
,
3326 tree
*case_low_p
, tree
*case_high_p
,
3327 bool *outside_range_p
)
3329 tree min_value
, max_value
;
3330 tree case_low
= *case_low_p
;
3331 tree case_high
= case_high_p
? *case_high_p
: case_low
;
3333 /* If there was a problem with the original type, do nothing. */
3334 if (orig_type
== error_mark_node
)
3337 min_value
= TYPE_MIN_VALUE (orig_type
);
3338 max_value
= TYPE_MAX_VALUE (orig_type
);
3340 /* We'll really need integer constants here. */
3341 case_low
= fold (case_low
);
3342 case_high
= fold (case_high
);
3344 /* Case label is less than minimum for type. */
3345 if (tree_int_cst_compare (case_low
, min_value
) < 0
3346 && tree_int_cst_compare (case_high
, min_value
) < 0)
3348 warning_at (loc
, 0, "case label value is less than minimum value "
3350 *outside_range_p
= true;
3354 /* Case value is greater than maximum for type. */
3355 if (tree_int_cst_compare (case_low
, max_value
) > 0
3356 && tree_int_cst_compare (case_high
, max_value
) > 0)
3358 warning_at (loc
, 0, "case label value exceeds maximum value for type");
3359 *outside_range_p
= true;
3363 /* Saturate lower case label value to minimum. */
3364 if (tree_int_cst_compare (case_high
, min_value
) >= 0
3365 && tree_int_cst_compare (case_low
, min_value
) < 0)
3367 warning_at (loc
, 0, "lower value in case label range"
3368 " less than minimum value for type");
3369 *outside_range_p
= true;
3370 case_low
= min_value
;
3373 /* Saturate upper case label value to maximum. */
3374 if (tree_int_cst_compare (case_low
, max_value
) <= 0
3375 && tree_int_cst_compare (case_high
, max_value
) > 0)
3377 warning_at (loc
, 0, "upper value in case label range"
3378 " exceeds maximum value for type");
3379 *outside_range_p
= true;
3380 case_high
= max_value
;
3383 if (*case_low_p
!= case_low
)
3384 *case_low_p
= convert (type
, case_low
);
3385 if (case_high_p
&& *case_high_p
!= case_high
)
3386 *case_high_p
= convert (type
, case_high
);
3391 /* Return an integer type with BITS bits of precision,
3392 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
3395 c_common_type_for_size (unsigned int bits
, int unsignedp
)
3399 if (bits
== TYPE_PRECISION (integer_type_node
))
3400 return unsignedp
? unsigned_type_node
: integer_type_node
;
3402 if (bits
== TYPE_PRECISION (signed_char_type_node
))
3403 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3405 if (bits
== TYPE_PRECISION (short_integer_type_node
))
3406 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3408 if (bits
== TYPE_PRECISION (long_integer_type_node
))
3409 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3411 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
3412 return (unsignedp
? long_long_unsigned_type_node
3413 : long_long_integer_type_node
);
3415 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3416 if (int_n_enabled_p
[i
]
3417 && bits
== int_n_data
[i
].bitsize
)
3418 return (unsignedp
? int_n_trees
[i
].unsigned_type
3419 : int_n_trees
[i
].signed_type
);
3421 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
3422 return (unsignedp
? widest_unsigned_literal_type_node
3423 : widest_integer_literal_type_node
);
3425 if (bits
<= TYPE_PRECISION (intQI_type_node
))
3426 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3428 if (bits
<= TYPE_PRECISION (intHI_type_node
))
3429 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3431 if (bits
<= TYPE_PRECISION (intSI_type_node
))
3432 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3434 if (bits
<= TYPE_PRECISION (intDI_type_node
))
3435 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3440 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
3441 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
3442 and saturating if SATP is nonzero, otherwise not saturating. */
3445 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
3446 int unsignedp
, int satp
)
3450 mode
= unsignedp
? UQQmode
: QQmode
;
3452 mode
= unsignedp
? UHAmode
: HAmode
;
3454 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
3455 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
3458 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
3460 sorry ("GCC cannot support operators with integer types and "
3461 "fixed-point types that have too many integral and "
3462 "fractional bits together");
3466 return c_common_type_for_mode (mode
, satp
);
3469 /* Used for communication between c_common_type_for_mode and
3470 c_register_builtin_type. */
3471 tree registered_builtin_types
;
3473 /* Return a data type that has machine mode MODE.
3474 If the mode is an integer,
3475 then UNSIGNEDP selects between signed and unsigned types.
3476 If the mode is a fixed-point mode,
3477 then UNSIGNEDP selects between saturating and nonsaturating types. */
3480 c_common_type_for_mode (machine_mode mode
, int unsignedp
)
3485 if (mode
== TYPE_MODE (integer_type_node
))
3486 return unsignedp
? unsigned_type_node
: integer_type_node
;
3488 if (mode
== TYPE_MODE (signed_char_type_node
))
3489 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3491 if (mode
== TYPE_MODE (short_integer_type_node
))
3492 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3494 if (mode
== TYPE_MODE (long_integer_type_node
))
3495 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3497 if (mode
== TYPE_MODE (long_long_integer_type_node
))
3498 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3500 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3501 if (int_n_enabled_p
[i
]
3502 && mode
== int_n_data
[i
].m
)
3503 return (unsignedp
? int_n_trees
[i
].unsigned_type
3504 : int_n_trees
[i
].signed_type
);
3506 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
3507 return unsignedp
? widest_unsigned_literal_type_node
3508 : widest_integer_literal_type_node
;
3511 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3514 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3517 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3520 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3522 #if HOST_BITS_PER_WIDE_INT >= 64
3523 if (mode
== TYPE_MODE (intTI_type_node
))
3524 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3527 if (mode
== TYPE_MODE (float_type_node
))
3528 return float_type_node
;
3530 if (mode
== TYPE_MODE (double_type_node
))
3531 return double_type_node
;
3533 if (mode
== TYPE_MODE (long_double_type_node
))
3534 return long_double_type_node
;
3536 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3537 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3538 && mode
== TYPE_MODE (FLOATN_NX_TYPE_NODE (i
)))
3539 return FLOATN_NX_TYPE_NODE (i
);
3541 if (mode
== TYPE_MODE (void_type_node
))
3542 return void_type_node
;
3544 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
3546 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3547 : make_signed_type (GET_MODE_PRECISION (mode
)));
3549 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
3551 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
3552 : make_signed_type (GET_MODE_PRECISION (mode
)));
3554 if (COMPLEX_MODE_P (mode
))
3556 machine_mode inner_mode
;
3559 if (mode
== TYPE_MODE (complex_float_type_node
))
3560 return complex_float_type_node
;
3561 if (mode
== TYPE_MODE (complex_double_type_node
))
3562 return complex_double_type_node
;
3563 if (mode
== TYPE_MODE (complex_long_double_type_node
))
3564 return complex_long_double_type_node
;
3566 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
3567 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
3568 && mode
== TYPE_MODE (COMPLEX_FLOATN_NX_TYPE_NODE (i
)))
3569 return COMPLEX_FLOATN_NX_TYPE_NODE (i
);
3571 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
3572 return complex_integer_type_node
;
3574 inner_mode
= GET_MODE_INNER (mode
);
3575 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3576 if (inner_type
!= NULL_TREE
)
3577 return build_complex_type (inner_type
);
3579 else if (VECTOR_MODE_P (mode
))
3581 machine_mode inner_mode
= GET_MODE_INNER (mode
);
3582 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3583 if (inner_type
!= NULL_TREE
)
3584 return build_vector_type_for_mode (inner_type
, mode
);
3587 if (mode
== TYPE_MODE (dfloat32_type_node
))
3588 return dfloat32_type_node
;
3589 if (mode
== TYPE_MODE (dfloat64_type_node
))
3590 return dfloat64_type_node
;
3591 if (mode
== TYPE_MODE (dfloat128_type_node
))
3592 return dfloat128_type_node
;
3594 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
3596 if (mode
== TYPE_MODE (short_fract_type_node
))
3597 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
3598 if (mode
== TYPE_MODE (fract_type_node
))
3599 return unsignedp
? sat_fract_type_node
: fract_type_node
;
3600 if (mode
== TYPE_MODE (long_fract_type_node
))
3601 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
3602 if (mode
== TYPE_MODE (long_long_fract_type_node
))
3603 return unsignedp
? sat_long_long_fract_type_node
3604 : long_long_fract_type_node
;
3606 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
3607 return unsignedp
? sat_unsigned_short_fract_type_node
3608 : unsigned_short_fract_type_node
;
3609 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
3610 return unsignedp
? sat_unsigned_fract_type_node
3611 : unsigned_fract_type_node
;
3612 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
3613 return unsignedp
? sat_unsigned_long_fract_type_node
3614 : unsigned_long_fract_type_node
;
3615 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
3616 return unsignedp
? sat_unsigned_long_long_fract_type_node
3617 : unsigned_long_long_fract_type_node
;
3619 if (mode
== TYPE_MODE (short_accum_type_node
))
3620 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3621 if (mode
== TYPE_MODE (accum_type_node
))
3622 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3623 if (mode
== TYPE_MODE (long_accum_type_node
))
3624 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3625 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3626 return unsignedp
? sat_long_long_accum_type_node
3627 : long_long_accum_type_node
;
3629 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3630 return unsignedp
? sat_unsigned_short_accum_type_node
3631 : unsigned_short_accum_type_node
;
3632 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3633 return unsignedp
? sat_unsigned_accum_type_node
3634 : unsigned_accum_type_node
;
3635 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3636 return unsignedp
? sat_unsigned_long_accum_type_node
3637 : unsigned_long_accum_type_node
;
3638 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3639 return unsignedp
? sat_unsigned_long_long_accum_type_node
3640 : unsigned_long_long_accum_type_node
;
3643 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3645 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3647 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3649 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3651 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3653 if (mode
== UQQmode
)
3654 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3655 if (mode
== UHQmode
)
3656 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3657 if (mode
== USQmode
)
3658 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3659 if (mode
== UDQmode
)
3660 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3661 if (mode
== UTQmode
)
3662 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3665 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3667 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3669 return unsignedp
? sat_da_type_node
: da_type_node
;
3671 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3673 if (mode
== UHAmode
)
3674 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3675 if (mode
== USAmode
)
3676 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3677 if (mode
== UDAmode
)
3678 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3679 if (mode
== UTAmode
)
3680 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3683 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3684 if (TYPE_MODE (TREE_VALUE (t
)) == mode
3685 && !!unsignedp
== !!TYPE_UNSIGNED (TREE_VALUE (t
)))
3686 return TREE_VALUE (t
);
3692 c_common_unsigned_type (tree type
)
3694 return c_common_signed_or_unsigned_type (1, type
);
3697 /* Return a signed type the same as TYPE in other respects. */
3700 c_common_signed_type (tree type
)
3702 return c_common_signed_or_unsigned_type (0, type
);
3705 /* Return a type the same as TYPE except unsigned or
3706 signed according to UNSIGNEDP. */
3709 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3714 /* This block of code emulates the behavior of the old
3715 c_common_unsigned_type. In particular, it returns
3716 long_unsigned_type_node if passed a long, even when a int would
3717 have the same size. This is necessary for warnings to work
3718 correctly in archs where sizeof(int) == sizeof(long) */
3720 type1
= TYPE_MAIN_VARIANT (type
);
3721 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3722 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3723 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3724 return unsignedp
? unsigned_type_node
: integer_type_node
;
3725 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3726 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3727 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3728 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3729 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3730 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3732 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3733 if (int_n_enabled_p
[i
]
3734 && (type1
== int_n_trees
[i
].unsigned_type
3735 || type1
== int_n_trees
[i
].signed_type
))
3736 return (unsignedp
? int_n_trees
[i
].unsigned_type
3737 : int_n_trees
[i
].signed_type
);
3739 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3740 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3741 #if HOST_BITS_PER_WIDE_INT >= 64
3742 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3743 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3745 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3746 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3747 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3748 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3749 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3750 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3751 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3752 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3754 #define C_COMMON_FIXED_TYPES(NAME) \
3755 if (type1 == short_ ## NAME ## _type_node \
3756 || type1 == unsigned_short_ ## NAME ## _type_node) \
3757 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3758 : short_ ## NAME ## _type_node; \
3759 if (type1 == NAME ## _type_node \
3760 || type1 == unsigned_ ## NAME ## _type_node) \
3761 return unsignedp ? unsigned_ ## NAME ## _type_node \
3762 : NAME ## _type_node; \
3763 if (type1 == long_ ## NAME ## _type_node \
3764 || type1 == unsigned_long_ ## NAME ## _type_node) \
3765 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3766 : long_ ## NAME ## _type_node; \
3767 if (type1 == long_long_ ## NAME ## _type_node \
3768 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3769 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3770 : long_long_ ## NAME ## _type_node;
3772 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3773 if (type1 == NAME ## _type_node \
3774 || type1 == u ## NAME ## _type_node) \
3775 return unsignedp ? u ## NAME ## _type_node \
3776 : NAME ## _type_node;
3778 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3779 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3780 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3781 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3782 : sat_ ## short_ ## NAME ## _type_node; \
3783 if (type1 == sat_ ## NAME ## _type_node \
3784 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3785 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3786 : sat_ ## NAME ## _type_node; \
3787 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3788 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3789 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3790 : sat_ ## long_ ## NAME ## _type_node; \
3791 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3792 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3793 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3794 : sat_ ## long_long_ ## NAME ## _type_node;
3796 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3797 if (type1 == sat_ ## NAME ## _type_node \
3798 || type1 == sat_ ## u ## NAME ## _type_node) \
3799 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3800 : sat_ ## NAME ## _type_node;
3802 C_COMMON_FIXED_TYPES (fract
);
3803 C_COMMON_FIXED_TYPES_SAT (fract
);
3804 C_COMMON_FIXED_TYPES (accum
);
3805 C_COMMON_FIXED_TYPES_SAT (accum
);
3807 C_COMMON_FIXED_MODE_TYPES (qq
);
3808 C_COMMON_FIXED_MODE_TYPES (hq
);
3809 C_COMMON_FIXED_MODE_TYPES (sq
);
3810 C_COMMON_FIXED_MODE_TYPES (dq
);
3811 C_COMMON_FIXED_MODE_TYPES (tq
);
3812 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3813 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3814 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3815 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3816 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3817 C_COMMON_FIXED_MODE_TYPES (ha
);
3818 C_COMMON_FIXED_MODE_TYPES (sa
);
3819 C_COMMON_FIXED_MODE_TYPES (da
);
3820 C_COMMON_FIXED_MODE_TYPES (ta
);
3821 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3822 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3823 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3824 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3826 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3827 the precision; they have precision set to match their range, but
3828 may use a wider mode to match an ABI. If we change modes, we may
3829 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3830 the precision as well, so as to yield correct results for
3831 bit-field types. C++ does not have these separate bit-field
3832 types, and producing a signed or unsigned variant of an
3833 ENUMERAL_TYPE may cause other problems as well. */
3835 if (!INTEGRAL_TYPE_P (type
)
3836 || TYPE_UNSIGNED (type
) == unsignedp
)
3839 #define TYPE_OK(node) \
3840 (TYPE_MODE (type) == TYPE_MODE (node) \
3841 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3842 if (TYPE_OK (signed_char_type_node
))
3843 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3844 if (TYPE_OK (integer_type_node
))
3845 return unsignedp
? unsigned_type_node
: integer_type_node
;
3846 if (TYPE_OK (short_integer_type_node
))
3847 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3848 if (TYPE_OK (long_integer_type_node
))
3849 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3850 if (TYPE_OK (long_long_integer_type_node
))
3851 return (unsignedp
? long_long_unsigned_type_node
3852 : long_long_integer_type_node
);
3854 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3855 if (int_n_enabled_p
[i
]
3856 && TYPE_MODE (type
) == int_n_data
[i
].m
3857 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
3858 return (unsignedp
? int_n_trees
[i
].unsigned_type
3859 : int_n_trees
[i
].signed_type
);
3861 if (TYPE_OK (widest_integer_literal_type_node
))
3862 return (unsignedp
? widest_unsigned_literal_type_node
3863 : widest_integer_literal_type_node
);
3865 #if HOST_BITS_PER_WIDE_INT >= 64
3866 if (TYPE_OK (intTI_type_node
))
3867 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3869 if (TYPE_OK (intDI_type_node
))
3870 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3871 if (TYPE_OK (intSI_type_node
))
3872 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3873 if (TYPE_OK (intHI_type_node
))
3874 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3875 if (TYPE_OK (intQI_type_node
))
3876 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3879 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3882 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3885 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3889 /* Extended integer types of the same width as a standard type have
3890 lesser rank, so those of the same width as int promote to int or
3891 unsigned int and are valid for printf formats expecting int or
3892 unsigned int. To avoid such special cases, avoid creating
3893 extended integer types for bit-fields if a standard integer type
3895 if (width
== TYPE_PRECISION (integer_type_node
))
3896 return unsignedp
? unsigned_type_node
: integer_type_node
;
3897 if (width
== TYPE_PRECISION (signed_char_type_node
))
3898 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3899 if (width
== TYPE_PRECISION (short_integer_type_node
))
3900 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3901 if (width
== TYPE_PRECISION (long_integer_type_node
))
3902 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3903 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3904 return (unsignedp
? long_long_unsigned_type_node
3905 : long_long_integer_type_node
);
3906 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
3907 if (int_n_enabled_p
[i
]
3908 && width
== int_n_data
[i
].bitsize
)
3909 return (unsignedp
? int_n_trees
[i
].unsigned_type
3910 : int_n_trees
[i
].signed_type
);
3911 return build_nonstandard_integer_type (width
, unsignedp
);
3914 /* The C version of the register_builtin_type langhook. */
3917 c_register_builtin_type (tree type
, const char* name
)
3921 decl
= build_decl (UNKNOWN_LOCATION
,
3922 TYPE_DECL
, get_identifier (name
), type
);
3923 DECL_ARTIFICIAL (decl
) = 1;
3924 if (!TYPE_NAME (type
))
3925 TYPE_NAME (type
) = decl
;
3928 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3931 /* Print an error message for invalid operands to arith operation
3932 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3933 RICHLOC is a rich location for the message, containing either
3934 three separate locations for each of the operator and operands
3939 (C FE), or one location ranging over all over them
3947 binary_op_error (rich_location
*richloc
, enum tree_code code
,
3948 tree type0
, tree type1
)
3955 opname
= "+"; break;
3957 opname
= "-"; break;
3959 opname
= "*"; break;
3961 opname
= "max"; break;
3963 opname
= "min"; break;
3965 opname
= "=="; break;
3967 opname
= "!="; break;
3969 opname
= "<="; break;
3971 opname
= ">="; break;
3973 opname
= "<"; break;
3975 opname
= ">"; break;
3977 opname
= "<<"; break;
3979 opname
= ">>"; break;
3980 case TRUNC_MOD_EXPR
:
3981 case FLOOR_MOD_EXPR
:
3982 opname
= "%"; break;
3983 case TRUNC_DIV_EXPR
:
3984 case FLOOR_DIV_EXPR
:
3985 opname
= "/"; break;
3987 opname
= "&"; break;
3989 opname
= "|"; break;
3990 case TRUTH_ANDIF_EXPR
:
3991 opname
= "&&"; break;
3992 case TRUTH_ORIF_EXPR
:
3993 opname
= "||"; break;
3995 opname
= "^"; break;
3999 error_at_rich_loc (richloc
,
4000 "invalid operands to binary %s (have %qT and %qT)",
4001 opname
, type0
, type1
);
4004 /* Given an expression as a tree, return its original type. Do this
4005 by stripping any conversion that preserves the sign and precision. */
4007 expr_original_type (tree expr
)
4009 STRIP_SIGN_NOPS (expr
);
4010 return TREE_TYPE (expr
);
4013 /* Subroutine of build_binary_op, used for comparison operations.
4014 See if the operands have both been converted from subword integer types
4015 and, if so, perhaps change them both back to their original type.
4016 This function is also responsible for converting the two operands
4017 to the proper common type for comparison.
4019 The arguments of this function are all pointers to local variables
4020 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
4021 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
4023 LOC is the location of the comparison.
4025 If this function returns nonzero, it means that the comparison has
4026 a constant value. What this function returns is an expression for
4030 shorten_compare (location_t loc
, tree
*op0_ptr
, tree
*op1_ptr
,
4031 tree
*restype_ptr
, enum tree_code
*rescode_ptr
)
4034 tree op0
= *op0_ptr
;
4035 tree op1
= *op1_ptr
;
4036 int unsignedp0
, unsignedp1
;
4038 tree primop0
, primop1
;
4039 enum tree_code code
= *rescode_ptr
;
4041 /* Throw away any conversions to wider types
4042 already present in the operands. */
4044 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
4045 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
4047 /* If primopN is first sign-extended from primopN's precision to opN's
4048 precision, then zero-extended from opN's precision to
4049 *restype_ptr precision, shortenings might be invalid. */
4050 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
4051 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
4053 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
4055 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
4056 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
4058 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
4061 /* Handle the case that OP0 does not *contain* a conversion
4062 but it *requires* conversion to FINAL_TYPE. */
4064 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
4065 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
4066 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
4067 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
4069 /* If one of the operands must be floated, we cannot optimize. */
4070 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
4071 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
4073 /* If first arg is constant, swap the args (changing operation
4074 so value is preserved), for canonicalization. Don't do this if
4075 the second arg is 0. */
4077 if (TREE_CONSTANT (primop0
)
4078 && !integer_zerop (primop1
) && !real_zerop (primop1
)
4079 && !fixed_zerop (primop1
))
4081 std::swap (primop0
, primop1
);
4082 std::swap (op0
, op1
);
4085 std::swap (unsignedp0
, unsignedp1
);
4086 std::swap (real1
, real2
);
4105 *rescode_ptr
= code
;
4108 /* If comparing an integer against a constant more bits wide,
4109 maybe we can deduce a value of 1 or 0 independent of the data.
4110 Or else truncate the constant now
4111 rather than extend the variable at run time.
4113 This is only interesting if the constant is the wider arg.
4114 Also, it is not safe if the constant is unsigned and the
4115 variable arg is signed, since in this case the variable
4116 would be sign-extended and then regarded as unsigned.
4117 Our technique fails in this case because the lowest/highest
4118 possible unsigned results don't follow naturally from the
4119 lowest/highest possible values of the variable operand.
4120 For just EQ_EXPR and NE_EXPR there is another technique that
4121 could be used: see if the constant can be faithfully represented
4122 in the other operand's type, by truncating it and reextending it
4123 and see if that preserves the constant's value. */
4125 if (!real1
&& !real2
4126 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
4127 && TREE_CODE (primop1
) == INTEGER_CST
4128 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
4130 int min_gt
, max_gt
, min_lt
, max_lt
;
4131 tree maxval
, minval
;
4132 /* 1 if comparison is nominally unsigned. */
4133 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
4136 type
= c_common_signed_or_unsigned_type (unsignedp0
,
4137 TREE_TYPE (primop0
));
4139 maxval
= TYPE_MAX_VALUE (type
);
4140 minval
= TYPE_MIN_VALUE (type
);
4142 if (unsignedp
&& !unsignedp0
)
4143 *restype_ptr
= c_common_signed_type (*restype_ptr
);
4145 if (TREE_TYPE (primop1
) != *restype_ptr
)
4147 /* Convert primop1 to target type, but do not introduce
4148 additional overflow. We know primop1 is an int_cst. */
4149 primop1
= force_fit_type (*restype_ptr
,
4152 TYPE_PRECISION (*restype_ptr
)),
4153 0, TREE_OVERFLOW (primop1
));
4155 if (type
!= *restype_ptr
)
4157 minval
= convert (*restype_ptr
, minval
);
4158 maxval
= convert (*restype_ptr
, maxval
);
4161 min_gt
= tree_int_cst_lt (primop1
, minval
);
4162 max_gt
= tree_int_cst_lt (primop1
, maxval
);
4163 min_lt
= tree_int_cst_lt (minval
, primop1
);
4164 max_lt
= tree_int_cst_lt (maxval
, primop1
);
4167 /* This used to be a switch, but Genix compiler can't handle that. */
4168 if (code
== NE_EXPR
)
4170 if (max_lt
|| min_gt
)
4171 val
= truthvalue_true_node
;
4173 else if (code
== EQ_EXPR
)
4175 if (max_lt
|| min_gt
)
4176 val
= truthvalue_false_node
;
4178 else if (code
== LT_EXPR
)
4181 val
= truthvalue_true_node
;
4183 val
= truthvalue_false_node
;
4185 else if (code
== GT_EXPR
)
4188 val
= truthvalue_true_node
;
4190 val
= truthvalue_false_node
;
4192 else if (code
== LE_EXPR
)
4195 val
= truthvalue_true_node
;
4197 val
= truthvalue_false_node
;
4199 else if (code
== GE_EXPR
)
4202 val
= truthvalue_true_node
;
4204 val
= truthvalue_false_node
;
4207 /* If primop0 was sign-extended and unsigned comparison specd,
4208 we did a signed comparison above using the signed type bounds.
4209 But the comparison we output must be unsigned.
4211 Also, for inequalities, VAL is no good; but if the signed
4212 comparison had *any* fixed result, it follows that the
4213 unsigned comparison just tests the sign in reverse
4214 (positive values are LE, negative ones GE).
4215 So we can generate an unsigned comparison
4216 against an extreme value of the signed type. */
4218 if (unsignedp
&& !unsignedp0
)
4225 primop1
= TYPE_MIN_VALUE (type
);
4231 primop1
= TYPE_MAX_VALUE (type
);
4238 type
= c_common_unsigned_type (type
);
4241 if (TREE_CODE (primop0
) != INTEGER_CST
4242 /* Don't warn if it's from a (non-system) macro. */
4243 && !(from_macro_expansion_at
4244 (expansion_point_location_if_in_system_header
4245 (EXPR_LOCATION (primop0
)))))
4247 if (val
== truthvalue_false_node
)
4248 warning_at (loc
, OPT_Wtype_limits
,
4249 "comparison is always false due to limited range of data type");
4250 if (val
== truthvalue_true_node
)
4251 warning_at (loc
, OPT_Wtype_limits
,
4252 "comparison is always true due to limited range of data type");
4257 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4258 if (TREE_SIDE_EFFECTS (primop0
))
4259 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
4263 /* Value is not predetermined, but do the comparison
4264 in the type of the operand that is not constant.
4265 TYPE is already properly set. */
4268 /* If either arg is decimal float and the other is float, find the
4269 proper common type to use for comparison. */
4270 else if (real1
&& real2
4271 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4272 && DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
))))
4273 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4275 /* If either arg is decimal float and the other is float, fail. */
4276 else if (real1
&& real2
4277 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
4278 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
4281 else if (real1
&& real2
4282 && (TYPE_PRECISION (TREE_TYPE (primop0
))
4283 == TYPE_PRECISION (TREE_TYPE (primop1
))))
4284 type
= TREE_TYPE (primop0
);
4286 /* If args' natural types are both narrower than nominal type
4287 and both extend in the same manner, compare them
4288 in the type of the wider arg.
4289 Otherwise must actually extend both to the nominal
4290 common type lest different ways of extending
4292 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
4294 else if (unsignedp0
== unsignedp1
&& real1
== real2
4295 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
4296 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
4298 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
4299 type
= c_common_signed_or_unsigned_type (unsignedp0
4300 || TYPE_UNSIGNED (*restype_ptr
),
4302 /* Make sure shorter operand is extended the right way
4303 to match the longer operand. */
4305 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
4306 TREE_TYPE (primop0
)),
4309 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
4310 TREE_TYPE (primop1
)),
4315 /* Here we must do the comparison on the nominal type
4316 using the args exactly as we received them. */
4317 type
= *restype_ptr
;
4321 if (!real1
&& !real2
&& integer_zerop (primop1
)
4322 && TYPE_UNSIGNED (*restype_ptr
))
4325 /* All unsigned values are >= 0, so we warn. However,
4326 if OP0 is a constant that is >= 0, the signedness of
4327 the comparison isn't an issue, so suppress the
4330 warn_type_limits
&& !in_system_header_at (loc
)
4331 && !(TREE_CODE (primop0
) == INTEGER_CST
4332 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
4334 /* Do not warn for enumeration types. */
4335 && (TREE_CODE (expr_original_type (primop0
)) != ENUMERAL_TYPE
);
4341 warning_at (loc
, OPT_Wtype_limits
,
4342 "comparison of unsigned expression >= 0 is always true");
4343 value
= truthvalue_true_node
;
4348 warning_at (loc
, OPT_Wtype_limits
,
4349 "comparison of unsigned expression < 0 is always false");
4350 value
= truthvalue_false_node
;
4359 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
4360 if (TREE_SIDE_EFFECTS (primop0
))
4361 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
4368 *op0_ptr
= convert (type
, primop0
);
4369 *op1_ptr
= convert (type
, primop1
);
4371 *restype_ptr
= truthvalue_type_node
;
4376 /* Return a tree for the sum or difference (RESULTCODE says which)
4377 of pointer PTROP and integer INTOP. */
4380 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
4381 tree ptrop
, tree intop
, bool complain
)
4385 /* The result is a pointer of the same type that is being added. */
4386 tree result_type
= TREE_TYPE (ptrop
);
4388 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
4390 if (complain
&& warn_pointer_arith
)
4391 pedwarn (loc
, OPT_Wpointer_arith
,
4392 "pointer of type %<void *%> used in arithmetic");
4394 return error_mark_node
;
4395 size_exp
= integer_one_node
;
4397 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
4399 if (complain
&& warn_pointer_arith
)
4400 pedwarn (loc
, OPT_Wpointer_arith
,
4401 "pointer to a function used in arithmetic");
4403 return error_mark_node
;
4404 size_exp
= integer_one_node
;
4407 size_exp
= size_in_bytes_loc (loc
, TREE_TYPE (result_type
));
4409 /* We are manipulating pointer values, so we don't need to warn
4410 about relying on undefined signed overflow. We disable the
4411 warning here because we use integer types so fold won't know that
4412 they are really pointers. */
4413 fold_defer_overflow_warnings ();
4415 /* If what we are about to multiply by the size of the elements
4416 contains a constant term, apply distributive law
4417 and multiply that constant term separately.
4418 This helps produce common subexpressions. */
4419 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
4420 && !TREE_CONSTANT (intop
)
4421 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
4422 && TREE_CONSTANT (size_exp
)
4423 /* If the constant comes from pointer subtraction,
4424 skip this optimization--it would cause an error. */
4425 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
4426 /* If the constant is unsigned, and smaller than the pointer size,
4427 then we must skip this optimization. This is because it could cause
4428 an overflow error if the constant is negative but INTOP is not. */
4429 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
4430 || (TYPE_PRECISION (TREE_TYPE (intop
))
4431 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
4433 enum tree_code subcode
= resultcode
;
4434 tree int_type
= TREE_TYPE (intop
);
4435 if (TREE_CODE (intop
) == MINUS_EXPR
)
4436 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
4437 /* Convert both subexpression types to the type of intop,
4438 because weird cases involving pointer arithmetic
4439 can result in a sum or difference with different type args. */
4440 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
4442 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
4443 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
4446 /* Convert the integer argument to a type the same size as sizetype
4447 so the multiply won't overflow spuriously. */
4448 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
4449 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
4450 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
4451 TYPE_UNSIGNED (sizetype
)), intop
);
4453 /* Replace the integer argument with a suitable product by the object size.
4454 Do this multiplication as signed, then convert to the appropriate type
4455 for the pointer operation and disregard an overflow that occurred only
4456 because of the sign-extension change in the latter conversion. */
4458 tree t
= fold_build2_loc (loc
, MULT_EXPR
, TREE_TYPE (intop
), intop
,
4459 convert (TREE_TYPE (intop
), size_exp
));
4460 intop
= convert (sizetype
, t
);
4461 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
4462 intop
= wide_int_to_tree (TREE_TYPE (intop
), intop
);
4465 /* Create the sum or difference. */
4466 if (resultcode
== MINUS_EXPR
)
4467 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
4469 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
4471 fold_undefer_and_ignore_overflow_warnings ();
4476 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
4477 and if NON_CONST is known not to be permitted in an evaluated part
4478 of a constant expression. */
4481 c_wrap_maybe_const (tree expr
, bool non_const
)
4483 bool nowarning
= TREE_NO_WARNING (expr
);
4484 location_t loc
= EXPR_LOCATION (expr
);
4486 /* This should never be called for C++. */
4487 if (c_dialect_cxx ())
4490 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
4491 STRIP_TYPE_NOPS (expr
);
4492 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
4493 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
4495 TREE_NO_WARNING (expr
) = 1;
4496 protected_set_expr_location (expr
, loc
);
4501 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
4502 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
4503 around the SAVE_EXPR if needed so that c_fully_fold does not need
4504 to look inside SAVE_EXPRs. */
4507 c_save_expr (tree expr
)
4509 bool maybe_const
= true;
4510 if (c_dialect_cxx ())
4511 return save_expr (expr
);
4512 expr
= c_fully_fold (expr
, false, &maybe_const
);
4513 expr
= save_expr (expr
);
4515 expr
= c_wrap_maybe_const (expr
, true);
4519 /* Return whether EXPR is a declaration whose address can never be
4523 decl_with_nonnull_addr_p (const_tree expr
)
4525 return (DECL_P (expr
)
4526 && (TREE_CODE (expr
) == PARM_DECL
4527 || TREE_CODE (expr
) == LABEL_DECL
4528 || !DECL_WEAK (expr
)));
4531 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
4532 or for an `if' or `while' statement or ?..: exp. It should already
4533 have been validated to be of suitable type; otherwise, a bad
4534 diagnostic may result.
4536 The EXPR is located at LOCATION.
4538 This preparation consists of taking the ordinary
4539 representation of an expression expr and producing a valid tree
4540 boolean expression describing whether expr is nonzero. We could
4541 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
4542 but we optimize comparisons, &&, ||, and !.
4544 The resulting type should always be `truthvalue_type_node'. */
4547 c_common_truthvalue_conversion (location_t location
, tree expr
)
4549 switch (TREE_CODE (expr
))
4551 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
4552 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
4553 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
4554 case ORDERED_EXPR
: case UNORDERED_EXPR
:
4555 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4557 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4558 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
4561 case TRUTH_ANDIF_EXPR
:
4562 case TRUTH_ORIF_EXPR
:
4563 case TRUTH_AND_EXPR
:
4565 case TRUTH_XOR_EXPR
:
4566 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4568 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
4569 c_common_truthvalue_conversion (location
,
4570 TREE_OPERAND (expr
, 0)),
4571 c_common_truthvalue_conversion (location
,
4572 TREE_OPERAND (expr
, 1)));
4575 case TRUTH_NOT_EXPR
:
4576 if (TREE_TYPE (expr
) == truthvalue_type_node
)
4578 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
4579 c_common_truthvalue_conversion (location
,
4580 TREE_OPERAND (expr
, 0)));
4587 return integer_zerop (expr
) ? truthvalue_false_node
4588 : truthvalue_true_node
;
4591 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
4592 ? truthvalue_true_node
4593 : truthvalue_false_node
;
4596 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
4597 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
4598 ? truthvalue_true_node
4599 : truthvalue_false_node
;
4602 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
4607 tree inner
= TREE_OPERAND (expr
, 0);
4608 if (decl_with_nonnull_addr_p (inner
))
4610 /* Common Ada/Pascal programmer's mistake. */
4611 warning_at (location
,
4613 "the address of %qD will always evaluate as %<true%>",
4615 return truthvalue_true_node
;
4621 expr
= build_binary_op (EXPR_LOCATION (expr
),
4622 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
4623 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4624 c_common_truthvalue_conversion (location
,
4625 TREE_OPERAND (expr
, 0)),
4626 c_common_truthvalue_conversion (location
,
4627 TREE_OPERAND (expr
, 1)),
4634 case EXCESS_PRECISION_EXPR
:
4635 /* These don't change whether an object is nonzero or zero. */
4636 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
4640 /* These don't change whether an object is zero or nonzero, but
4641 we can't ignore them if their second arg has side-effects. */
4642 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
4644 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
4645 TREE_OPERAND (expr
, 1),
4646 c_common_truthvalue_conversion
4647 (location
, TREE_OPERAND (expr
, 0)));
4651 return c_common_truthvalue_conversion (location
,
4652 TREE_OPERAND (expr
, 0));
4655 /* Distribute the conversion into the arms of a COND_EXPR. */
4656 if (c_dialect_cxx ())
4658 tree op1
= TREE_OPERAND (expr
, 1);
4659 tree op2
= TREE_OPERAND (expr
, 2);
4660 /* In C++ one of the arms might have void type if it is throw. */
4661 if (!VOID_TYPE_P (TREE_TYPE (op1
)))
4662 op1
= c_common_truthvalue_conversion (location
, op1
);
4663 if (!VOID_TYPE_P (TREE_TYPE (op2
)))
4664 op2
= c_common_truthvalue_conversion (location
, op2
);
4665 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4666 TREE_OPERAND (expr
, 0), op1
, op2
);
4671 /* Folding will happen later for C. */
4672 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4673 TREE_OPERAND (expr
, 0),
4674 c_common_truthvalue_conversion (location
,
4675 TREE_OPERAND (expr
, 1)),
4676 c_common_truthvalue_conversion (location
,
4677 TREE_OPERAND (expr
, 2)));
4683 tree totype
= TREE_TYPE (expr
);
4684 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
4686 if (POINTER_TYPE_P (totype
)
4687 && !c_inhibit_evaluation_warnings
4688 && TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4694 warning_at (location
,
4696 "the compiler can assume that the address of "
4697 "%qD will always evaluate to %<true%>",
4701 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4702 since that affects how `default_conversion' will behave. */
4703 if (TREE_CODE (totype
) == REFERENCE_TYPE
4704 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4706 /* Don't strip a conversion from C++0x scoped enum, since they
4707 don't implicitly convert to other types. */
4708 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
4709 && ENUM_IS_SCOPED (fromtype
))
4711 /* If this isn't narrowing the argument, we can ignore it. */
4712 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
4713 return c_common_truthvalue_conversion (location
,
4714 TREE_OPERAND (expr
, 0));
4719 if (!TREE_NO_WARNING (expr
)
4720 && warn_parentheses
)
4722 warning_at (location
, OPT_Wparentheses
,
4723 "suggest parentheses around assignment used as "
4725 TREE_NO_WARNING (expr
) = 1;
4733 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4735 tree t
= (in_late_binary_op
? save_expr (expr
) : c_save_expr (expr
));
4736 expr
= (build_binary_op
4737 (EXPR_LOCATION (expr
),
4738 (TREE_SIDE_EFFECTS (expr
)
4739 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4740 c_common_truthvalue_conversion
4742 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
4743 c_common_truthvalue_conversion
4745 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
4750 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4752 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4754 (TREE_TYPE (expr
))));
4755 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4758 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4761 protected_set_expr_location (expr
, location
);
4765 static void def_builtin_1 (enum built_in_function fncode
,
4767 enum built_in_class fnclass
,
4768 tree fntype
, tree libtype
,
4769 bool both_p
, bool fallback_p
, bool nonansi_p
,
4770 tree fnattrs
, bool implicit_p
);
4773 /* Apply the TYPE_QUALS to the new DECL. */
4776 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4778 tree type
= TREE_TYPE (decl
);
4780 if (type
== error_mark_node
)
4783 if ((type_quals
& TYPE_QUAL_CONST
)
4784 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4785 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4786 constructor can produce constant init, so rely on cp_finish_decl to
4787 clear TREE_READONLY if the variable has non-constant init. */
4788 TREE_READONLY (decl
) = 1;
4789 if (type_quals
& TYPE_QUAL_VOLATILE
)
4791 TREE_SIDE_EFFECTS (decl
) = 1;
4792 TREE_THIS_VOLATILE (decl
) = 1;
4794 if (type_quals
& TYPE_QUAL_RESTRICT
)
4796 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4797 /* Allow 'restrict' on arrays of pointers.
4798 FIXME currently we just ignore it. */
4799 type
= TREE_TYPE (type
);
4801 || !POINTER_TYPE_P (type
)
4802 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4803 error ("invalid use of %<restrict%>");
4807 struct c_type_hasher
: ggc_ptr_hash
<tree_node
>
4809 static hashval_t
hash (tree
);
4810 static bool equal (tree
, tree
);
4813 /* Hash function for the problem of multiple type definitions in
4814 different files. This must hash all types that will compare
4815 equal via comptypes to the same value. In practice it hashes
4816 on some of the simple stuff and leaves the details to comptypes. */
4819 c_type_hasher::hash (tree t
)
4824 switch (TREE_CODE (t
))
4826 /* For pointers, hash on pointee type plus some swizzling. */
4828 return hash (TREE_TYPE (t
)) ^ 0x3003003;
4829 /* Hash on number of elements and total size. */
4832 t2
= TYPE_VALUES (t
);
4836 t2
= TYPE_FIELDS (t
);
4838 case QUAL_UNION_TYPE
:
4840 t2
= TYPE_FIELDS (t
);
4844 t2
= TYPE_FIELDS (t
);
4849 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4850 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4851 n_elements
= list_length (t2
);
4852 /* We might have a VLA here. */
4853 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4856 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4857 return ((size
<< 24) | (n_elements
<< shift
));
4861 c_type_hasher::equal (tree t1
, tree t2
)
4863 return lang_hooks
.types_compatible_p (t1
, t2
);
4866 static GTY(()) hash_table
<c_type_hasher
> *type_hash_table
;
4868 /* Return the typed-based alias set for T, which may be an expression
4869 or a type. Return -1 if we don't do anything special. */
4872 c_common_get_alias_set (tree t
)
4874 /* For VLAs, use the alias set of the element type rather than the
4875 default of alias set 0 for types compared structurally. */
4876 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4878 if (TREE_CODE (t
) == ARRAY_TYPE
)
4879 return get_alias_set (TREE_TYPE (t
));
4883 /* That's all the expressions we handle specially. */
4887 /* The C standard guarantees that any object may be accessed via an
4888 lvalue that has character type. */
4889 if (t
== char_type_node
4890 || t
== signed_char_type_node
4891 || t
== unsigned_char_type_node
)
4894 /* The C standard specifically allows aliasing between signed and
4895 unsigned variants of the same type. We treat the signed
4896 variant as canonical. */
4897 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4899 tree t1
= c_common_signed_type (t
);
4901 /* t1 == t can happen for boolean nodes which are always unsigned. */
4903 return get_alias_set (t1
);
4906 /* Handle the case of multiple type nodes referring to "the same" type,
4907 which occurs with IMA. These share an alias set. FIXME: Currently only
4908 C90 is handled. (In C99 type compatibility is not transitive, which
4909 complicates things mightily. The alias set splay trees can theoretically
4910 represent this, but insertion is tricky when you consider all the
4911 different orders things might arrive in.) */
4913 if (c_language
!= clk_c
|| flag_isoc99
)
4916 /* Save time if there's only one input file. */
4917 if (num_in_fnames
== 1)
4920 /* Pointers need special handling if they point to any type that
4921 needs special handling (below). */
4922 if (TREE_CODE (t
) == POINTER_TYPE
)
4925 /* Find bottom type under any nested POINTERs. */
4926 for (t2
= TREE_TYPE (t
);
4927 TREE_CODE (t2
) == POINTER_TYPE
;
4928 t2
= TREE_TYPE (t2
))
4930 if (!RECORD_OR_UNION_TYPE_P (t2
)
4931 && TREE_CODE (t2
) != ENUMERAL_TYPE
)
4933 if (TYPE_SIZE (t2
) == 0)
4936 /* These are the only cases that need special handling. */
4937 if (!RECORD_OR_UNION_TYPE_P (t
)
4938 && TREE_CODE (t
) != ENUMERAL_TYPE
4939 && TREE_CODE (t
) != POINTER_TYPE
)
4942 if (TYPE_SIZE (t
) == 0)
4945 /* Look up t in hash table. Only one of the compatible types within each
4946 alias set is recorded in the table. */
4947 if (!type_hash_table
)
4948 type_hash_table
= hash_table
<c_type_hasher
>::create_ggc (1021);
4949 tree
*slot
= type_hash_table
->find_slot (t
, INSERT
);
4952 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4953 return TYPE_ALIAS_SET ((tree
)*slot
);
4956 /* Our caller will assign and record (in t) a new alias set; all we need
4957 to do is remember t in the hash table. */
4963 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4964 the IS_SIZEOF parameter indicates which operator is being applied.
4965 The COMPLAIN flag controls whether we should diagnose possibly
4966 ill-formed constructs or not. LOC is the location of the SIZEOF or
4967 TYPEOF operator. If MIN_ALIGNOF, the least alignment required for
4968 a type in any context should be returned, rather than the normal
4969 alignment for that type. */
4972 c_sizeof_or_alignof_type (location_t loc
,
4973 tree type
, bool is_sizeof
, bool min_alignof
,
4976 const char *op_name
;
4978 enum tree_code type_code
= TREE_CODE (type
);
4980 op_name
= is_sizeof
? "sizeof" : "__alignof__";
4982 if (type_code
== FUNCTION_TYPE
)
4986 if (complain
&& warn_pointer_arith
)
4987 pedwarn (loc
, OPT_Wpointer_arith
,
4988 "invalid application of %<sizeof%> to a function type");
4990 return error_mark_node
;
4991 value
= size_one_node
;
4997 if (c_dialect_cxx ())
4998 pedwarn (loc
, OPT_Wpedantic
, "ISO C++ does not permit "
4999 "%<alignof%> applied to a function type");
5001 pedwarn (loc
, OPT_Wpedantic
, "ISO C does not permit "
5002 "%<_Alignof%> applied to a function type");
5004 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
5007 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
5009 if (type_code
== VOID_TYPE
5010 && complain
&& warn_pointer_arith
)
5011 pedwarn (loc
, OPT_Wpointer_arith
,
5012 "invalid application of %qs to a void type", op_name
);
5014 return error_mark_node
;
5015 value
= size_one_node
;
5017 else if (!COMPLETE_TYPE_P (type
)
5018 && (!c_dialect_cxx () || is_sizeof
|| type_code
!= ARRAY_TYPE
))
5021 error_at (loc
, "invalid application of %qs to incomplete type %qT",
5023 return error_mark_node
;
5025 else if (c_dialect_cxx () && type_code
== ARRAY_TYPE
5026 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
5029 error_at (loc
, "invalid application of %qs to array type %qT of "
5030 "incomplete element type", op_name
, type
);
5031 return error_mark_node
;
5036 /* Convert in case a char is more than one unit. */
5037 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
5038 size_int (TYPE_PRECISION (char_type_node
)
5040 else if (min_alignof
)
5041 value
= size_int (min_align_of_type (type
));
5043 value
= size_int (TYPE_ALIGN_UNIT (type
));
5046 /* VALUE will have the middle-end integer type sizetype.
5047 However, we should really return a value of type `size_t',
5048 which is just a typedef for an ordinary integer type. */
5049 value
= fold_convert_loc (loc
, size_type_node
, value
);
5054 /* Implement the __alignof keyword: Return the minimum required
5055 alignment of EXPR, measured in bytes. For VAR_DECLs,
5056 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
5057 from an "aligned" __attribute__ specification). LOC is the
5058 location of the ALIGNOF operator. */
5061 c_alignof_expr (location_t loc
, tree expr
)
5065 if (VAR_OR_FUNCTION_DECL_P (expr
))
5066 t
= size_int (DECL_ALIGN_UNIT (expr
));
5068 else if (TREE_CODE (expr
) == COMPONENT_REF
5069 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
5071 error_at (loc
, "%<__alignof%> applied to a bit-field");
5074 else if (TREE_CODE (expr
) == COMPONENT_REF
5075 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
5076 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
5078 else if (INDIRECT_REF_P (expr
))
5080 tree t
= TREE_OPERAND (expr
, 0);
5082 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5084 while (CONVERT_EXPR_P (t
)
5085 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
5089 t
= TREE_OPERAND (t
, 0);
5090 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
5091 if (thisalign
> bestalign
)
5092 best
= t
, bestalign
= thisalign
;
5094 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
5097 return c_alignof (loc
, TREE_TYPE (expr
));
5099 return fold_convert_loc (loc
, size_type_node
, t
);
5102 /* Handle C and C++ default attributes. */
5104 enum built_in_attribute
5106 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
5107 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
5108 #define DEF_ATTR_STRING(ENUM, VALUE) ENUM,
5109 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
5110 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
5111 #include "builtin-attrs.def"
5112 #undef DEF_ATTR_NULL_TREE
5114 #undef DEF_ATTR_STRING
5115 #undef DEF_ATTR_IDENT
5116 #undef DEF_ATTR_TREE_LIST
5120 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
5122 static void c_init_attributes (void);
5126 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
5127 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
5128 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
5129 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
5130 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5131 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5132 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
5133 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5135 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5137 #define DEF_FUNCTION_TYPE_8(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5138 ARG6, ARG7, ARG8) NAME,
5139 #define DEF_FUNCTION_TYPE_9(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5140 ARG6, ARG7, ARG8, ARG9) NAME,
5141 #define DEF_FUNCTION_TYPE_10(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5142 ARG6, ARG7, ARG8, ARG9, ARG10) NAME,
5143 #define DEF_FUNCTION_TYPE_11(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5144 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) NAME,
5145 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
5146 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
5147 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
5148 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
5149 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
5150 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5152 #define DEF_FUNCTION_TYPE_VAR_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5154 #define DEF_FUNCTION_TYPE_VAR_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5156 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
5157 #include "builtin-types.def"
5158 #undef DEF_PRIMITIVE_TYPE
5159 #undef DEF_FUNCTION_TYPE_0
5160 #undef DEF_FUNCTION_TYPE_1
5161 #undef DEF_FUNCTION_TYPE_2
5162 #undef DEF_FUNCTION_TYPE_3
5163 #undef DEF_FUNCTION_TYPE_4
5164 #undef DEF_FUNCTION_TYPE_5
5165 #undef DEF_FUNCTION_TYPE_6
5166 #undef DEF_FUNCTION_TYPE_7
5167 #undef DEF_FUNCTION_TYPE_8
5168 #undef DEF_FUNCTION_TYPE_9
5169 #undef DEF_FUNCTION_TYPE_10
5170 #undef DEF_FUNCTION_TYPE_11
5171 #undef DEF_FUNCTION_TYPE_VAR_0
5172 #undef DEF_FUNCTION_TYPE_VAR_1
5173 #undef DEF_FUNCTION_TYPE_VAR_2
5174 #undef DEF_FUNCTION_TYPE_VAR_3
5175 #undef DEF_FUNCTION_TYPE_VAR_4
5176 #undef DEF_FUNCTION_TYPE_VAR_5
5177 #undef DEF_FUNCTION_TYPE_VAR_6
5178 #undef DEF_FUNCTION_TYPE_VAR_7
5179 #undef DEF_POINTER_TYPE
5183 typedef enum c_builtin_type builtin_type
;
5185 /* A temporary array for c_common_nodes_and_builtins. Used in
5186 communication with def_fn_type. */
5187 static tree builtin_types
[(int) BT_LAST
+ 1];
5189 /* A helper function for c_common_nodes_and_builtins. Build function type
5190 for DEF with return type RET and N arguments. If VAR is true, then the
5191 function should be variadic after those N arguments.
5193 Takes special care not to ICE if any of the types involved are
5194 error_mark_node, which indicates that said type is not in fact available
5195 (see builtin_type_for_size). In which case the function type as a whole
5196 should be error_mark_node. */
5199 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
5202 tree
*args
= XALLOCAVEC (tree
, n
);
5207 for (i
= 0; i
< n
; ++i
)
5209 builtin_type a
= (builtin_type
) va_arg (list
, int);
5210 t
= builtin_types
[a
];
5211 if (t
== error_mark_node
)
5216 t
= builtin_types
[ret
];
5217 if (t
== error_mark_node
)
5220 t
= build_varargs_function_type_array (t
, n
, args
);
5222 t
= build_function_type_array (t
, n
, args
);
5225 builtin_types
[def
] = t
;
5229 /* Build builtin functions common to both C and C++ language
5233 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
5235 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
5236 builtin_types[ENUM] = VALUE;
5237 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
5238 def_fn_type (ENUM, RETURN, 0, 0);
5239 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
5240 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
5241 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
5242 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
5243 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5244 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
5245 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5246 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
5247 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5248 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5249 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5251 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5252 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5254 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5255 #define DEF_FUNCTION_TYPE_8(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5257 def_fn_type (ENUM, RETURN, 0, 8, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5259 #define DEF_FUNCTION_TYPE_9(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5260 ARG6, ARG7, ARG8, ARG9) \
5261 def_fn_type (ENUM, RETURN, 0, 9, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5263 #define DEF_FUNCTION_TYPE_10(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5264 ARG6, ARG7, ARG8, ARG9, ARG10) \
5265 def_fn_type (ENUM, RETURN, 0, 10, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5266 ARG7, ARG8, ARG9, ARG10);
5267 #define DEF_FUNCTION_TYPE_11(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5268 ARG6, ARG7, ARG8, ARG9, ARG10, ARG11) \
5269 def_fn_type (ENUM, RETURN, 0, 11, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, \
5270 ARG7, ARG8, ARG9, ARG10, ARG11);
5271 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
5272 def_fn_type (ENUM, RETURN, 1, 0);
5273 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
5274 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
5275 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
5276 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
5277 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
5278 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
5279 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
5280 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
5281 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
5282 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
5283 #define DEF_FUNCTION_TYPE_VAR_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5285 def_fn_type (ENUM, RETURN, 1, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
5286 #define DEF_FUNCTION_TYPE_VAR_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
5288 def_fn_type (ENUM, RETURN, 1, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
5289 #define DEF_POINTER_TYPE(ENUM, TYPE) \
5290 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
5292 #include "builtin-types.def"
5294 #undef DEF_PRIMITIVE_TYPE
5295 #undef DEF_FUNCTION_TYPE_0
5296 #undef DEF_FUNCTION_TYPE_1
5297 #undef DEF_FUNCTION_TYPE_2
5298 #undef DEF_FUNCTION_TYPE_3
5299 #undef DEF_FUNCTION_TYPE_4
5300 #undef DEF_FUNCTION_TYPE_5
5301 #undef DEF_FUNCTION_TYPE_6
5302 #undef DEF_FUNCTION_TYPE_7
5303 #undef DEF_FUNCTION_TYPE_8
5304 #undef DEF_FUNCTION_TYPE_9
5305 #undef DEF_FUNCTION_TYPE_10
5306 #undef DEF_FUNCTION_TYPE_11
5307 #undef DEF_FUNCTION_TYPE_VAR_0
5308 #undef DEF_FUNCTION_TYPE_VAR_1
5309 #undef DEF_FUNCTION_TYPE_VAR_2
5310 #undef DEF_FUNCTION_TYPE_VAR_3
5311 #undef DEF_FUNCTION_TYPE_VAR_4
5312 #undef DEF_FUNCTION_TYPE_VAR_5
5313 #undef DEF_FUNCTION_TYPE_VAR_6
5314 #undef DEF_FUNCTION_TYPE_VAR_7
5315 #undef DEF_POINTER_TYPE
5316 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
5318 c_init_attributes ();
5320 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
5321 NONANSI_P, ATTRS, IMPLICIT, COND) \
5323 def_builtin_1 (ENUM, NAME, CLASS, \
5324 builtin_types[(int) TYPE], \
5325 builtin_types[(int) LIBTYPE], \
5326 BOTH_P, FALLBACK_P, NONANSI_P, \
5327 built_in_attributes[(int) ATTRS], IMPLICIT);
5328 #include "builtins.def"
5330 targetm
.init_builtins ();
5332 build_common_builtin_nodes ();
5335 cilk_init_builtins ();
5338 /* Like get_identifier, but avoid warnings about null arguments when
5339 the argument may be NULL for targets where GCC lacks stdint.h type
5343 c_get_ident (const char *id
)
5345 return get_identifier (id
);
5348 /* Build tree nodes and builtin functions common to both C and C++ language
5352 c_common_nodes_and_builtins (void)
5354 int char16_type_size
;
5355 int char32_type_size
;
5356 int wchar_type_size
;
5357 tree array_domain_type
;
5358 tree va_list_ref_type_node
;
5359 tree va_list_arg_type_node
;
5362 build_common_tree_nodes (flag_signed_char
);
5364 /* Define `int' and `char' first so that dbx will output them first. */
5365 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
5366 record_builtin_type (RID_CHAR
, "char", char_type_node
);
5368 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
5369 "unsigned long", "long long unsigned" and "unsigned short" were in C++
5370 but not C. Are the conditionals here needed? */
5371 if (c_dialect_cxx ())
5372 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
5373 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
5374 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
5375 record_builtin_type (RID_MAX
, "long unsigned int",
5376 long_unsigned_type_node
);
5378 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
5382 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
5383 record_builtin_type ((enum rid
)(RID_FIRST_INT_N
+ i
), name
,
5384 int_n_trees
[i
].signed_type
);
5385 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
5386 record_builtin_type (RID_MAX
, name
, int_n_trees
[i
].unsigned_type
);
5389 if (c_dialect_cxx ())
5390 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
5391 record_builtin_type (RID_MAX
, "long long int",
5392 long_long_integer_type_node
);
5393 record_builtin_type (RID_MAX
, "long long unsigned int",
5394 long_long_unsigned_type_node
);
5395 if (c_dialect_cxx ())
5396 record_builtin_type (RID_MAX
, "long long unsigned",
5397 long_long_unsigned_type_node
);
5398 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
5399 record_builtin_type (RID_MAX
, "short unsigned int",
5400 short_unsigned_type_node
);
5401 if (c_dialect_cxx ())
5402 record_builtin_type (RID_MAX
, "unsigned short",
5403 short_unsigned_type_node
);
5405 /* Define both `signed char' and `unsigned char'. */
5406 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
5407 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
5409 /* These are types that c_common_type_for_size and
5410 c_common_type_for_mode use. */
5411 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5412 TYPE_DECL
, NULL_TREE
,
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 #if HOST_BITS_PER_WIDE_INT >= 64
5424 /* Note that this is different than the __int128 type that's part of
5425 the generic __intN support. */
5426 if (targetm
.scalar_mode_supported_p (TImode
))
5427 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5429 get_identifier ("__int128_t"),
5432 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5433 TYPE_DECL
, NULL_TREE
,
5434 unsigned_intQI_type_node
));
5435 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5436 TYPE_DECL
, NULL_TREE
,
5437 unsigned_intHI_type_node
));
5438 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5439 TYPE_DECL
, NULL_TREE
,
5440 unsigned_intSI_type_node
));
5441 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5442 TYPE_DECL
, NULL_TREE
,
5443 unsigned_intDI_type_node
));
5444 #if HOST_BITS_PER_WIDE_INT >= 64
5445 if (targetm
.scalar_mode_supported_p (TImode
))
5446 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5448 get_identifier ("__uint128_t"),
5449 unsigned_intTI_type_node
));
5452 /* Create the widest literal types. */
5453 widest_integer_literal_type_node
5454 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
5455 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5456 TYPE_DECL
, NULL_TREE
,
5457 widest_integer_literal_type_node
));
5459 widest_unsigned_literal_type_node
5460 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
5461 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5462 TYPE_DECL
, NULL_TREE
,
5463 widest_unsigned_literal_type_node
));
5465 signed_size_type_node
= c_common_signed_type (size_type_node
);
5468 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
5470 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
5471 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
5472 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
5474 if (!c_dialect_cxx ())
5475 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5476 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5477 record_builtin_type ((enum rid
) (RID_FLOATN_NX_FIRST
+ i
), NULL
,
5478 FLOATN_NX_TYPE_NODE (i
));
5480 /* Only supported decimal floating point extension if the target
5481 actually supports underlying modes. */
5482 if (targetm
.scalar_mode_supported_p (SDmode
)
5483 && targetm
.scalar_mode_supported_p (DDmode
)
5484 && targetm
.scalar_mode_supported_p (TDmode
))
5486 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
5487 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
5488 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
5491 if (targetm
.fixed_point_supported_p ())
5493 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
5494 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
5495 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
5496 record_builtin_type (RID_MAX
, "long long _Fract",
5497 long_long_fract_type_node
);
5498 record_builtin_type (RID_MAX
, "unsigned short _Fract",
5499 unsigned_short_fract_type_node
);
5500 record_builtin_type (RID_MAX
, "unsigned _Fract",
5501 unsigned_fract_type_node
);
5502 record_builtin_type (RID_MAX
, "unsigned long _Fract",
5503 unsigned_long_fract_type_node
);
5504 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
5505 unsigned_long_long_fract_type_node
);
5506 record_builtin_type (RID_MAX
, "_Sat short _Fract",
5507 sat_short_fract_type_node
);
5508 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
5509 record_builtin_type (RID_MAX
, "_Sat long _Fract",
5510 sat_long_fract_type_node
);
5511 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
5512 sat_long_long_fract_type_node
);
5513 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
5514 sat_unsigned_short_fract_type_node
);
5515 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
5516 sat_unsigned_fract_type_node
);
5517 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
5518 sat_unsigned_long_fract_type_node
);
5519 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
5520 sat_unsigned_long_long_fract_type_node
);
5521 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
5522 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
5523 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
5524 record_builtin_type (RID_MAX
, "long long _Accum",
5525 long_long_accum_type_node
);
5526 record_builtin_type (RID_MAX
, "unsigned short _Accum",
5527 unsigned_short_accum_type_node
);
5528 record_builtin_type (RID_MAX
, "unsigned _Accum",
5529 unsigned_accum_type_node
);
5530 record_builtin_type (RID_MAX
, "unsigned long _Accum",
5531 unsigned_long_accum_type_node
);
5532 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
5533 unsigned_long_long_accum_type_node
);
5534 record_builtin_type (RID_MAX
, "_Sat short _Accum",
5535 sat_short_accum_type_node
);
5536 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
5537 record_builtin_type (RID_MAX
, "_Sat long _Accum",
5538 sat_long_accum_type_node
);
5539 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
5540 sat_long_long_accum_type_node
);
5541 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
5542 sat_unsigned_short_accum_type_node
);
5543 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
5544 sat_unsigned_accum_type_node
);
5545 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
5546 sat_unsigned_long_accum_type_node
);
5547 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
5548 sat_unsigned_long_long_accum_type_node
);
5552 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5554 get_identifier ("complex int"),
5555 complex_integer_type_node
));
5556 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5558 get_identifier ("complex float"),
5559 complex_float_type_node
));
5560 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
5562 get_identifier ("complex double"),
5563 complex_double_type_node
));
5564 lang_hooks
.decls
.pushdecl
5565 (build_decl (UNKNOWN_LOCATION
,
5566 TYPE_DECL
, get_identifier ("complex long double"),
5567 complex_long_double_type_node
));
5569 if (!c_dialect_cxx ())
5570 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
5571 if (COMPLEX_FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
5574 sprintf (buf
, "complex _Float%d%s", floatn_nx_types
[i
].n
,
5575 floatn_nx_types
[i
].extended
? "x" : "");
5576 lang_hooks
.decls
.pushdecl
5577 (build_decl (UNKNOWN_LOCATION
,
5579 get_identifier (buf
),
5580 COMPLEX_FLOATN_NX_TYPE_NODE (i
)));
5583 if (c_dialect_cxx ())
5584 /* For C++, make fileptr_type_node a distinct void * type until
5585 FILE type is defined. */
5586 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
5588 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
5590 /* Set the TYPE_NAME for any variants that were built before
5591 record_builtin_type gave names to the built-in types. */
5593 tree void_name
= TYPE_NAME (void_type_node
);
5594 TYPE_NAME (void_type_node
) = NULL_TREE
;
5595 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
5597 TYPE_NAME (void_type_node
) = void_name
;
5600 void_list_node
= build_void_list_node ();
5602 /* Make a type to be the domain of a few array types
5603 whose domains don't really matter.
5604 200 is small enough that it always fits in size_t
5605 and large enough that it can hold most function names for the
5606 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
5607 array_domain_type
= build_index_type (size_int (200));
5609 /* Make a type for arrays of characters.
5610 With luck nothing will ever really depend on the length of this
5612 char_array_type_node
5613 = build_array_type (char_type_node
, array_domain_type
);
5615 string_type_node
= build_pointer_type (char_type_node
);
5616 const_string_type_node
5617 = build_pointer_type (build_qualified_type
5618 (char_type_node
, TYPE_QUAL_CONST
));
5620 /* This is special for C++ so functions can be overloaded. */
5621 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
5622 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
5623 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
5624 underlying_wchar_type_node
= wchar_type_node
;
5625 if (c_dialect_cxx ())
5627 if (TYPE_UNSIGNED (wchar_type_node
))
5628 wchar_type_node
= make_unsigned_type (wchar_type_size
);
5630 wchar_type_node
= make_signed_type (wchar_type_size
);
5631 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
5634 /* This is for wide string constants. */
5635 wchar_array_type_node
5636 = build_array_type (wchar_type_node
, array_domain_type
);
5638 /* Define 'char16_t'. */
5639 char16_type_node
= get_identifier (CHAR16_TYPE
);
5640 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
5641 char16_type_size
= TYPE_PRECISION (char16_type_node
);
5642 if (c_dialect_cxx ())
5644 char16_type_node
= make_unsigned_type (char16_type_size
);
5646 if (cxx_dialect
>= cxx11
)
5647 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
5650 /* This is for UTF-16 string constants. */
5651 char16_array_type_node
5652 = build_array_type (char16_type_node
, array_domain_type
);
5654 /* Define 'char32_t'. */
5655 char32_type_node
= get_identifier (CHAR32_TYPE
);
5656 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
5657 char32_type_size
= TYPE_PRECISION (char32_type_node
);
5658 if (c_dialect_cxx ())
5660 char32_type_node
= make_unsigned_type (char32_type_size
);
5662 if (cxx_dialect
>= cxx11
)
5663 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
5666 /* This is for UTF-32 string constants. */
5667 char32_array_type_node
5668 = build_array_type (char32_type_node
, array_domain_type
);
5671 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
5674 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
5676 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
5678 if (SIG_ATOMIC_TYPE
)
5679 sig_atomic_type_node
=
5680 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
5683 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
5686 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
5689 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
5692 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
5695 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
5697 c_uint16_type_node
= uint16_type_node
=
5698 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
5700 c_uint32_type_node
= uint32_type_node
=
5701 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
5703 c_uint64_type_node
= uint64_type_node
=
5704 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
5705 if (INT_LEAST8_TYPE
)
5706 int_least8_type_node
=
5707 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
5708 if (INT_LEAST16_TYPE
)
5709 int_least16_type_node
=
5710 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
5711 if (INT_LEAST32_TYPE
)
5712 int_least32_type_node
=
5713 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
5714 if (INT_LEAST64_TYPE
)
5715 int_least64_type_node
=
5716 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
5717 if (UINT_LEAST8_TYPE
)
5718 uint_least8_type_node
=
5719 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
5720 if (UINT_LEAST16_TYPE
)
5721 uint_least16_type_node
=
5722 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
5723 if (UINT_LEAST32_TYPE
)
5724 uint_least32_type_node
=
5725 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
5726 if (UINT_LEAST64_TYPE
)
5727 uint_least64_type_node
=
5728 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
5730 int_fast8_type_node
=
5731 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
5732 if (INT_FAST16_TYPE
)
5733 int_fast16_type_node
=
5734 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
5735 if (INT_FAST32_TYPE
)
5736 int_fast32_type_node
=
5737 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
5738 if (INT_FAST64_TYPE
)
5739 int_fast64_type_node
=
5740 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
5741 if (UINT_FAST8_TYPE
)
5742 uint_fast8_type_node
=
5743 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
5744 if (UINT_FAST16_TYPE
)
5745 uint_fast16_type_node
=
5746 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
5747 if (UINT_FAST32_TYPE
)
5748 uint_fast32_type_node
=
5749 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5750 if (UINT_FAST64_TYPE
)
5751 uint_fast64_type_node
=
5752 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5755 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5758 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5760 default_function_type
5761 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
5763 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5764 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5766 lang_hooks
.decls
.pushdecl
5767 (build_decl (UNKNOWN_LOCATION
,
5768 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5769 va_list_type_node
));
5770 if (targetm
.enum_va_list_p
)
5776 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
5778 lang_hooks
.decls
.pushdecl
5779 (build_decl (UNKNOWN_LOCATION
,
5780 TYPE_DECL
, get_identifier (pname
),
5786 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5788 va_list_arg_type_node
= va_list_ref_type_node
=
5789 build_pointer_type (TREE_TYPE (va_list_type_node
));
5793 va_list_arg_type_node
= va_list_type_node
;
5794 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5797 if (!flag_preprocess_only
)
5798 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5800 main_identifier_node
= get_identifier ("main");
5802 /* Create the built-in __null node. It is important that this is
5804 null_node
= make_int_cst (1, 1);
5805 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5807 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5808 memset (builtin_types
, 0, sizeof (builtin_types
));
5811 /* The number of named compound-literals generated thus far. */
5812 static GTY(()) int compound_literal_number
;
5814 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5817 set_compound_literal_name (tree decl
)
5820 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5821 compound_literal_number
);
5822 compound_literal_number
++;
5823 DECL_NAME (decl
) = get_identifier (name
);
5826 /* build_va_arg helper function. Return a VA_ARG_EXPR with location LOC, type
5827 TYPE and operand OP. */
5830 build_va_arg_1 (location_t loc
, tree type
, tree op
)
5832 tree expr
= build1 (VA_ARG_EXPR
, type
, op
);
5833 SET_EXPR_LOCATION (expr
, loc
);
5837 /* Return a VA_ARG_EXPR corresponding to a source-level expression
5838 va_arg (EXPR, TYPE) at source location LOC. */
5841 build_va_arg (location_t loc
, tree expr
, tree type
)
5843 tree va_type
= TREE_TYPE (expr
);
5844 tree canon_va_type
= (va_type
== error_mark_node
5846 : targetm
.canonical_va_list_type (va_type
));
5848 if (va_type
== error_mark_node
5849 || canon_va_type
== NULL_TREE
)
5851 if (canon_va_type
== NULL_TREE
)
5852 error_at (loc
, "first argument to %<va_arg%> not of type %<va_list%>");
5854 /* Let's handle things neutrallly, if expr:
5855 - has undeclared type, or
5856 - is not an va_list type. */
5857 return build_va_arg_1 (loc
, type
, error_mark_node
);
5860 if (TREE_CODE (canon_va_type
) != ARRAY_TYPE
)
5862 /* Case 1: Not an array type. */
5864 /* Take the address, to get '&ap'. Note that &ap is not a va_list
5866 mark_addressable (expr
);
5867 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (expr
)), expr
);
5869 return build_va_arg_1 (loc
, type
, expr
);
5872 /* Case 2: Array type.
5876 For contrast, let's start with the simple case (case 1). If
5877 canon_va_type is not an array type, but say a char *, then when
5878 passing-by-value a va_list, the type of the va_list param decl is
5879 the same as for another va_list decl (all ap's are char *):
5882 D.1815 = VA_ARG (&ap, 0B, 1);
5888 __builtin_va_start (&ap, 0);
5891 __builtin_va_end (&ap);
5895 However, if canon_va_type is ARRAY_TYPE, then when passing-by-value a
5896 va_list the type of the va_list param decl (case 2b, struct * ap) is not
5897 the same as for another va_list decl (case 2a, struct ap[1]).
5900 D.1844 = VA_ARG (ap, 0B, 0);
5905 __builtin_va_start (&ap, 0);
5907 __builtin_va_end (&ap);
5911 Case 2b is different because:
5912 - on the callee side, the parm decl has declared type va_list, but
5913 grokdeclarator changes the type of the parm decl to a pointer to the
5915 - on the caller side, the pass-by-value uses &ap.
5917 We unify these two cases (case 2a: va_list is array type,
5918 case 2b: va_list is pointer to array elem type), by adding '&' for the
5919 array type case, such that we have a pointer to array elem in both
5922 if (TREE_CODE (va_type
) == ARRAY_TYPE
)
5924 /* Case 2a: va_list is array type. */
5926 /* Take the address, to get '&ap'. Make sure it's a pointer to array
5928 mark_addressable (expr
);
5929 expr
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (canon_va_type
)),
5932 /* Verify that &ap is still recognized as having va_list type. */
5933 tree canon_expr_type
5934 = targetm
.canonical_va_list_type (TREE_TYPE (expr
));
5935 gcc_assert (canon_expr_type
!= NULL_TREE
);
5939 /* Case 2b: va_list is pointer to array elem type. */
5940 gcc_assert (POINTER_TYPE_P (va_type
));
5942 /* Comparison as in std_canonical_va_list_type. */
5943 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (va_type
))
5944 == TYPE_MAIN_VARIANT (TREE_TYPE (canon_va_type
)));
5946 /* Don't take the address. We've already got '&ap'. */
5950 return build_va_arg_1 (loc
, type
, expr
);
5954 /* Linked list of disabled built-in functions. */
5956 struct disabled_builtin
5959 struct disabled_builtin
*next
;
5961 static disabled_builtin
*disabled_builtins
= NULL
;
5963 static bool builtin_function_disabled_p (const char *);
5965 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5966 begins with "__builtin_", give an error. */
5969 disable_builtin_function (const char *name
)
5971 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5972 error ("cannot disable built-in function %qs", name
);
5975 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5976 new_disabled_builtin
->name
= name
;
5977 new_disabled_builtin
->next
= disabled_builtins
;
5978 disabled_builtins
= new_disabled_builtin
;
5983 /* Return true if the built-in function NAME has been disabled, false
5987 builtin_function_disabled_p (const char *name
)
5989 disabled_builtin
*p
;
5990 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
5992 if (strcmp (name
, p
->name
) == 0)
5999 /* Worker for DEF_BUILTIN.
6000 Possibly define a builtin function with one or two names.
6001 Does not declare a non-__builtin_ function if flag_no_builtin, or if
6002 nonansi_p and flag_no_nonansi_builtin. */
6005 def_builtin_1 (enum built_in_function fncode
,
6007 enum built_in_class fnclass
,
6008 tree fntype
, tree libtype
,
6009 bool both_p
, bool fallback_p
, bool nonansi_p
,
6010 tree fnattrs
, bool implicit_p
)
6013 const char *libname
;
6015 if (fntype
== error_mark_node
)
6018 gcc_assert ((!both_p
&& !fallback_p
)
6019 || !strncmp (name
, "__builtin_",
6020 strlen ("__builtin_")));
6022 libname
= name
+ strlen ("__builtin_");
6023 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
6024 (fallback_p
? libname
: NULL
),
6027 set_builtin_decl (fncode
, decl
, implicit_p
);
6030 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
6031 && !(nonansi_p
&& flag_no_nonansi_builtin
))
6032 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
6036 /* Nonzero if the type T promotes to int. This is (nearly) the
6037 integral promotions defined in ISO C99 6.3.1.1/2. */
6040 c_promoting_integer_type_p (const_tree t
)
6042 switch (TREE_CODE (t
))
6045 return (TYPE_MAIN_VARIANT (t
) == char_type_node
6046 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
6047 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
6048 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
6049 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
6050 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
6053 /* ??? Technically all enumerations not larger than an int
6054 promote to an int. But this is used along code paths
6055 that only want to notice a size change. */
6056 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
6066 /* Return 1 if PARMS specifies a fixed number of parameters
6067 and none of their types is affected by default promotions. */
6070 self_promoting_args_p (const_tree parms
)
6073 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
6075 tree type
= TREE_VALUE (t
);
6077 if (type
== error_mark_node
)
6080 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
6086 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
6089 if (c_promoting_integer_type_p (type
))
6095 /* Recursively remove any '*' or '&' operator from TYPE. */
6097 strip_pointer_operator (tree t
)
6099 while (POINTER_TYPE_P (t
))
6104 /* Recursively remove pointer or array type from TYPE. */
6106 strip_pointer_or_array_types (tree t
)
6108 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
6113 /* Used to compare case labels. K1 and K2 are actually tree nodes
6114 representing case labels, or NULL_TREE for a `default' label.
6115 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
6116 K2, and 0 if K1 and K2 are equal. */
6119 case_compare (splay_tree_key k1
, splay_tree_key k2
)
6121 /* Consider a NULL key (such as arises with a `default' label) to be
6122 smaller than anything else. */
6128 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
6131 /* Process a case label, located at LOC, for the range LOW_VALUE
6132 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
6133 then this case label is actually a `default' label. If only
6134 HIGH_VALUE is NULL_TREE, then case label was declared using the
6135 usual C/C++ syntax, rather than the GNU case range extension.
6136 CASES is a tree containing all the case ranges processed so far;
6137 COND is the condition for the switch-statement itself.
6138 OUTSIDE_RANGE_P says whether there was a case value that doesn't
6139 fit into the range of the ORIG_TYPE. Returns the CASE_LABEL_EXPR
6140 created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
6143 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
6144 tree low_value
, tree high_value
, bool *outside_range_p
)
6149 splay_tree_node node
;
6151 /* Create the LABEL_DECL itself. */
6152 label
= create_artificial_label (loc
);
6154 /* If there was an error processing the switch condition, bail now
6155 before we get more confused. */
6156 if (!cond
|| cond
== error_mark_node
)
6159 if ((low_value
&& TREE_TYPE (low_value
)
6160 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
6161 || (high_value
&& TREE_TYPE (high_value
)
6162 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
6164 error_at (loc
, "pointers are not permitted as case values");
6168 /* Case ranges are a GNU extension. */
6170 pedwarn (loc
, OPT_Wpedantic
,
6171 "range expressions in switch statements are non-standard");
6173 type
= TREE_TYPE (cond
);
6176 low_value
= check_case_value (loc
, low_value
);
6177 low_value
= convert_and_check (loc
, type
, low_value
);
6178 if (low_value
== error_mark_node
)
6183 high_value
= check_case_value (loc
, high_value
);
6184 high_value
= convert_and_check (loc
, type
, high_value
);
6185 if (high_value
== error_mark_node
)
6189 if (low_value
&& high_value
)
6191 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
6192 really a case range, even though it was written that way.
6193 Remove the HIGH_VALUE to simplify later processing. */
6194 if (tree_int_cst_equal (low_value
, high_value
))
6195 high_value
= NULL_TREE
;
6196 else if (!tree_int_cst_lt (low_value
, high_value
))
6197 warning_at (loc
, 0, "empty range specified");
6200 /* See if the case is in range of the type of the original testing
6201 expression. If both low_value and high_value are out of range,
6202 don't insert the case label and return NULL_TREE. */
6204 && !check_case_bounds (loc
, type
, orig_type
,
6205 &low_value
, high_value
? &high_value
: NULL
,
6209 /* Look up the LOW_VALUE in the table of case labels we already
6211 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
6212 /* If there was not an exact match, check for overlapping ranges.
6213 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
6214 that's a `default' label and the only overlap is an exact match. */
6215 if (!node
&& (low_value
|| high_value
))
6217 splay_tree_node low_bound
;
6218 splay_tree_node high_bound
;
6220 /* Even though there wasn't an exact match, there might be an
6221 overlap between this case range and another case range.
6222 Since we've (inductively) not allowed any overlapping case
6223 ranges, we simply need to find the greatest low case label
6224 that is smaller that LOW_VALUE, and the smallest low case
6225 label that is greater than LOW_VALUE. If there is an overlap
6226 it will occur in one of these two ranges. */
6227 low_bound
= splay_tree_predecessor (cases
,
6228 (splay_tree_key
) low_value
);
6229 high_bound
= splay_tree_successor (cases
,
6230 (splay_tree_key
) low_value
);
6232 /* Check to see if the LOW_BOUND overlaps. It is smaller than
6233 the LOW_VALUE, so there is no need to check unless the
6234 LOW_BOUND is in fact itself a case range. */
6236 && CASE_HIGH ((tree
) low_bound
->value
)
6237 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
6240 /* Check to see if the HIGH_BOUND overlaps. The low end of that
6241 range is bigger than the low end of the current range, so we
6242 are only interested if the current range is a real range, and
6243 not an ordinary case label. */
6246 && (tree_int_cst_compare ((tree
) high_bound
->key
,
6251 /* If there was an overlap, issue an error. */
6254 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
6258 error_at (loc
, "duplicate (or overlapping) case value");
6259 error_at (DECL_SOURCE_LOCATION (duplicate
),
6260 "this is the first entry overlapping that value");
6264 error_at (loc
, "duplicate case value") ;
6265 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
6269 error_at (loc
, "multiple default labels in one switch");
6270 error_at (DECL_SOURCE_LOCATION (duplicate
),
6271 "this is the first default label");
6276 /* Add a CASE_LABEL to the statement-tree. */
6277 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
6278 /* Register this case label in the splay tree. */
6279 splay_tree_insert (cases
,
6280 (splay_tree_key
) low_value
,
6281 (splay_tree_value
) case_label
);
6286 /* Add a label so that the back-end doesn't think that the beginning of
6287 the switch is unreachable. Note that we do not add a case label, as
6288 that just leads to duplicates and thence to failure later on. */
6291 tree t
= create_artificial_label (loc
);
6292 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
6294 return error_mark_node
;
6297 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
6298 Used to verify that case values match up with enumerator values. */
6301 match_case_to_enum_1 (tree key
, tree type
, tree label
)
6303 char buf
[WIDE_INT_PRINT_BUFFER_SIZE
];
6305 if (tree_fits_uhwi_p (key
))
6306 print_dec (key
, buf
, UNSIGNED
);
6307 else if (tree_fits_shwi_p (key
))
6308 print_dec (key
, buf
, SIGNED
);
6310 print_hex (key
, buf
);
6312 if (TYPE_NAME (type
) == 0)
6313 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6314 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6315 "case value %qs not in enumerated type",
6318 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
6319 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
6320 "case value %qs not in enumerated type %qT",
6324 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
6325 Used to verify that case values match up with enumerator values. */
6328 match_case_to_enum (splay_tree_node node
, void *data
)
6330 tree label
= (tree
) node
->value
;
6331 tree type
= (tree
) data
;
6333 /* Skip default case. */
6334 if (!CASE_LOW (label
))
6337 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
6338 when we did our enum->case scan. Reset our scratch bit after. */
6339 if (!CASE_LOW_SEEN (label
))
6340 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
6342 CASE_LOW_SEEN (label
) = 0;
6344 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
6345 not set, that means that CASE_HIGH did not appear when we did our
6346 enum->case scan. Reset our scratch bit after. */
6347 if (CASE_HIGH (label
))
6349 if (!CASE_HIGH_SEEN (label
))
6350 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
6352 CASE_HIGH_SEEN (label
) = 0;
6358 /* Handle -Wswitch*. Called from the front end after parsing the
6359 switch construct. */
6360 /* ??? Should probably be somewhere generic, since other languages
6361 besides C and C++ would want this. At the moment, however, C/C++
6362 are the only tree-ssa languages that support enumerations at all,
6363 so the point is moot. */
6366 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
6367 tree type
, tree cond
, bool bool_cond_p
,
6368 bool outside_range_p
)
6370 splay_tree_node default_node
;
6371 splay_tree_node node
;
6374 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
6375 && !warn_switch_bool
)
6378 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
6380 warning_at (switch_location
, OPT_Wswitch_default
,
6381 "switch missing default case");
6383 /* There are certain cases where -Wswitch-bool warnings aren't
6390 so be careful here. */
6391 if (warn_switch_bool
&& bool_cond_p
)
6393 splay_tree_node min_node
;
6394 /* If there's a default node, it's also the value with the minimal
6395 key. So look at the penultimate key (if any). */
6397 min_node
= splay_tree_successor (cases
, (splay_tree_key
) NULL
);
6399 min_node
= splay_tree_min (cases
);
6400 tree min
= min_node
? (tree
) min_node
->key
: NULL_TREE
;
6402 splay_tree_node max_node
= splay_tree_max (cases
);
6403 /* This might be a case range, so look at the value with the
6404 maximal key and then check CASE_HIGH. */
6405 tree max
= max_node
? (tree
) max_node
->value
: NULL_TREE
;
6407 max
= CASE_HIGH (max
) ? CASE_HIGH (max
) : CASE_LOW (max
);
6409 /* If there's a case value > 1 or < 0, that is outside bool
6412 || (max
&& wi::gts_p (max
, 1))
6413 || (min
&& wi::lts_p (min
, 0))
6421 case, where we want to warn. */
6423 && max
&& wi::eq_p (max
, 1)
6424 && min
&& wi::eq_p (min
, 0)))
6425 warning_at (switch_location
, OPT_Wswitch_bool
,
6426 "switch condition has boolean value");
6429 /* From here on, we only care about enumerated types. */
6430 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
6433 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
6434 if (!warn_switch_enum
&& !warn_switch
)
6437 /* Check the cases. Warn about case values which are not members of
6438 the enumerated type. For -Wswitch-enum, or for -Wswitch when
6439 there is no default case, check that exactly all enumeration
6440 literals are covered by the cases. */
6442 /* Clearing COND if it is not an integer constant simplifies
6443 the tests inside the loop below. */
6444 if (TREE_CODE (cond
) != INTEGER_CST
)
6447 /* The time complexity here is O(N*lg(N)) worst case, but for the
6448 common case of monotonically increasing enumerators, it is
6449 O(N), since the nature of the splay tree will keep the next
6450 element adjacent to the root at all times. */
6452 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
6454 tree value
= TREE_VALUE (chain
);
6455 if (TREE_CODE (value
) == CONST_DECL
)
6456 value
= DECL_INITIAL (value
);
6457 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
6460 /* Mark the CASE_LOW part of the case entry as seen. */
6461 tree label
= (tree
) node
->value
;
6462 CASE_LOW_SEEN (label
) = 1;
6466 /* Even though there wasn't an exact match, there might be a
6467 case range which includes the enumerator's value. */
6468 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
6469 if (node
&& CASE_HIGH ((tree
) node
->value
))
6471 tree label
= (tree
) node
->value
;
6472 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
6475 /* If we match the upper bound exactly, mark the CASE_HIGH
6476 part of the case entry as seen. */
6478 CASE_HIGH_SEEN (label
) = 1;
6483 /* We've now determined that this enumerated literal isn't
6484 handled by the case labels of the switch statement. */
6486 /* If the switch expression is a constant, we only really care
6487 about whether that constant is handled by the switch. */
6488 if (cond
&& tree_int_cst_compare (cond
, value
))
6491 /* If there is a default_node, the only relevant option is
6492 Wswitch-enum. Otherwise, if both are enabled then we prefer
6493 to warn using -Wswitch because -Wswitch is enabled by -Wall
6494 while -Wswitch-enum is explicit. */
6495 warning_at (switch_location
,
6496 (default_node
|| !warn_switch
6499 "enumeration value %qE not handled in switch",
6500 TREE_PURPOSE (chain
));
6503 /* Warn if there are case expressions that don't correspond to
6504 enumerators. This can occur since C and C++ don't enforce
6505 type-checking of assignments to enumeration variables.
6507 The time complexity here is now always O(N) worst case, since
6508 we should have marked both the lower bound and upper bound of
6509 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
6510 above. This scan also resets those fields. */
6512 splay_tree_foreach (cases
, match_case_to_enum
, type
);
6515 /* Finish an expression taking the address of LABEL (an
6516 IDENTIFIER_NODE). Returns an expression for the address.
6518 LOC is the location for the expression returned. */
6521 finish_label_address_expr (tree label
, location_t loc
)
6525 pedwarn (input_location
, OPT_Wpedantic
, "taking the address of a label is non-standard");
6527 if (label
== error_mark_node
)
6528 return error_mark_node
;
6530 label
= lookup_label (label
);
6531 if (label
== NULL_TREE
)
6532 result
= null_pointer_node
;
6535 TREE_USED (label
) = 1;
6536 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
6537 /* The current function is not necessarily uninlinable.
6538 Computed gotos are incompatible with inlining, but the value
6539 here could be used only in a diagnostic, for example. */
6540 protected_set_expr_location (result
, loc
);
6547 /* Given a boolean expression ARG, return a tree representing an increment
6548 or decrement (as indicated by CODE) of ARG. The front end must check for
6549 invalid cases (e.g., decrement in C++). */
6551 boolean_increment (enum tree_code code
, tree arg
)
6554 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
6556 arg
= stabilize_reference (arg
);
6559 case PREINCREMENT_EXPR
:
6560 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6562 case POSTINCREMENT_EXPR
:
6563 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
6564 arg
= save_expr (arg
);
6565 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6566 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6568 case PREDECREMENT_EXPR
:
6569 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6570 invert_truthvalue_loc (input_location
, arg
));
6572 case POSTDECREMENT_EXPR
:
6573 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
6574 invert_truthvalue_loc (input_location
, arg
));
6575 arg
= save_expr (arg
);
6576 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
6577 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
6582 TREE_SIDE_EFFECTS (val
) = 1;
6586 /* Built-in macros for stddef.h and stdint.h, that require macros
6587 defined in this file. */
6589 c_stddef_cpp_builtins(void)
6591 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
6592 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
6593 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
6594 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
6595 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
6596 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
6597 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
6598 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
6599 if (SIG_ATOMIC_TYPE
)
6600 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
6602 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
6604 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
6606 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
6608 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
6610 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
6612 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
6614 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
6616 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
6617 if (INT_LEAST8_TYPE
)
6618 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
6619 if (INT_LEAST16_TYPE
)
6620 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
6621 if (INT_LEAST32_TYPE
)
6622 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
6623 if (INT_LEAST64_TYPE
)
6624 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
6625 if (UINT_LEAST8_TYPE
)
6626 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
6627 if (UINT_LEAST16_TYPE
)
6628 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
6629 if (UINT_LEAST32_TYPE
)
6630 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
6631 if (UINT_LEAST64_TYPE
)
6632 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
6634 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
6635 if (INT_FAST16_TYPE
)
6636 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
6637 if (INT_FAST32_TYPE
)
6638 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
6639 if (INT_FAST64_TYPE
)
6640 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
6641 if (UINT_FAST8_TYPE
)
6642 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
6643 if (UINT_FAST16_TYPE
)
6644 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
6645 if (UINT_FAST32_TYPE
)
6646 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
6647 if (UINT_FAST64_TYPE
)
6648 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
6650 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
6652 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
6656 c_init_attributes (void)
6658 /* Fill in the built_in_attributes array. */
6659 #define DEF_ATTR_NULL_TREE(ENUM) \
6660 built_in_attributes[(int) ENUM] = NULL_TREE;
6661 #define DEF_ATTR_INT(ENUM, VALUE) \
6662 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
6663 #define DEF_ATTR_STRING(ENUM, VALUE) \
6664 built_in_attributes[(int) ENUM] = build_string (strlen (VALUE), VALUE);
6665 #define DEF_ATTR_IDENT(ENUM, STRING) \
6666 built_in_attributes[(int) ENUM] = get_identifier (STRING);
6667 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
6668 built_in_attributes[(int) ENUM] \
6669 = tree_cons (built_in_attributes[(int) PURPOSE], \
6670 built_in_attributes[(int) VALUE], \
6671 built_in_attributes[(int) CHAIN]);
6672 #include "builtin-attrs.def"
6673 #undef DEF_ATTR_NULL_TREE
6675 #undef DEF_ATTR_IDENT
6676 #undef DEF_ATTR_TREE_LIST
6679 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
6680 identifier as an argument, so the front end shouldn't look it up. */
6683 attribute_takes_identifier_p (const_tree attr_id
)
6685 const struct attribute_spec
*spec
= lookup_attribute_spec (attr_id
);
6687 /* Unknown attribute that we'll end up ignoring, return true so we
6688 don't complain about an identifier argument. */
6690 else if (!strcmp ("mode", spec
->name
)
6691 || !strcmp ("format", spec
->name
)
6692 || !strcmp ("cleanup", spec
->name
))
6695 return targetm
.attribute_takes_identifier_p (attr_id
);
6698 /* Attribute handlers common to C front ends. */
6700 /* Handle a "packed" attribute; arguments as in
6701 struct attribute_spec.handler. */
6704 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6705 int flags
, bool *no_add_attrs
)
6709 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6710 *node
= build_variant_type_copy (*node
);
6711 TYPE_PACKED (*node
) = 1;
6713 else if (TREE_CODE (*node
) == FIELD_DECL
)
6715 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
6716 /* Still pack bitfields. */
6717 && ! DECL_INITIAL (*node
))
6718 warning (OPT_Wattributes
,
6719 "%qE attribute ignored for field of type %qT",
6720 name
, TREE_TYPE (*node
));
6722 DECL_PACKED (*node
) = 1;
6724 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
6725 used for DECL_REGISTER. It wouldn't mean anything anyway.
6726 We can't set DECL_PACKED on the type of a TYPE_DECL, because
6727 that changes what the typedef is typing. */
6730 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6731 *no_add_attrs
= true;
6737 /* Handle a "nocommon" attribute; arguments as in
6738 struct attribute_spec.handler. */
6741 handle_nocommon_attribute (tree
*node
, tree name
,
6742 tree
ARG_UNUSED (args
),
6743 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6746 DECL_COMMON (*node
) = 0;
6749 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6750 *no_add_attrs
= true;
6756 /* Handle a "common" attribute; arguments as in
6757 struct attribute_spec.handler. */
6760 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6761 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6764 DECL_COMMON (*node
) = 1;
6767 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6768 *no_add_attrs
= true;
6774 /* Handle a "noreturn" attribute; arguments as in
6775 struct attribute_spec.handler. */
6778 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6779 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6781 tree type
= TREE_TYPE (*node
);
6783 /* See FIXME comment in c_common_attribute_table. */
6784 if (TREE_CODE (*node
) == FUNCTION_DECL
6785 || objc_method_decl (TREE_CODE (*node
)))
6786 TREE_THIS_VOLATILE (*node
) = 1;
6787 else if (TREE_CODE (type
) == POINTER_TYPE
6788 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6790 = (build_qualified_type
6792 (build_type_variant (TREE_TYPE (type
),
6793 TYPE_READONLY (TREE_TYPE (type
)), 1)),
6794 TYPE_QUALS (type
)));
6797 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6798 *no_add_attrs
= true;
6804 /* Handle a "hot" and attribute; arguments as in
6805 struct attribute_spec.handler. */
6808 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6809 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6811 if (TREE_CODE (*node
) == FUNCTION_DECL
6812 || TREE_CODE (*node
) == LABEL_DECL
)
6814 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
6816 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6817 "with attribute %qs", name
, "cold");
6818 *no_add_attrs
= true;
6820 /* Most of the rest of the hot processing is done later with
6821 lookup_attribute. */
6825 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6826 *no_add_attrs
= true;
6832 /* Handle a "cold" and attribute; arguments as in
6833 struct attribute_spec.handler. */
6836 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6837 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6839 if (TREE_CODE (*node
) == FUNCTION_DECL
6840 || TREE_CODE (*node
) == LABEL_DECL
)
6842 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
6844 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6845 "with attribute %qs", name
, "hot");
6846 *no_add_attrs
= true;
6848 /* Most of the rest of the cold processing is done later with
6849 lookup_attribute. */
6853 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6854 *no_add_attrs
= true;
6860 /* Handle a "no_sanitize_address" attribute; arguments as in
6861 struct attribute_spec.handler. */
6864 handle_no_sanitize_address_attribute (tree
*node
, tree name
, tree
, int,
6867 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6869 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6870 *no_add_attrs
= true;
6876 /* Handle a "no_address_safety_analysis" attribute; arguments as in
6877 struct attribute_spec.handler. */
6880 handle_no_address_safety_analysis_attribute (tree
*node
, tree name
, tree
, int,
6883 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6884 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6885 else if (!lookup_attribute ("no_sanitize_address", DECL_ATTRIBUTES (*node
)))
6886 DECL_ATTRIBUTES (*node
)
6887 = tree_cons (get_identifier ("no_sanitize_address"),
6888 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6889 *no_add_attrs
= true;
6893 /* Handle a "no_sanitize_undefined" attribute; arguments as in
6894 struct attribute_spec.handler. */
6897 handle_no_sanitize_undefined_attribute (tree
*node
, tree name
, tree
, int,
6900 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6902 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6903 *no_add_attrs
= true;
6909 /* Handle a "stack_protect" attribute; arguments as in
6910 struct attribute_spec.handler. */
6912 handle_stack_protect_attribute (tree
*node
, tree name
, tree
, int,
6915 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6917 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6918 *no_add_attrs
= true;
6921 DECL_ATTRIBUTES (*node
)
6922 = tree_cons (get_identifier ("stack_protect"),
6923 NULL_TREE
, DECL_ATTRIBUTES (*node
));
6928 /* Handle a "noinline" attribute; arguments as in
6929 struct attribute_spec.handler. */
6932 handle_noinline_attribute (tree
*node
, tree name
,
6933 tree
ARG_UNUSED (args
),
6934 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6936 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6938 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
6940 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
6941 "with attribute %qs", name
, "always_inline");
6942 *no_add_attrs
= true;
6945 DECL_UNINLINABLE (*node
) = 1;
6949 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6950 *no_add_attrs
= true;
6956 /* Handle a "noclone" attribute; arguments as in
6957 struct attribute_spec.handler. */
6960 handle_noclone_attribute (tree
*node
, tree name
,
6961 tree
ARG_UNUSED (args
),
6962 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6964 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6966 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6967 *no_add_attrs
= true;
6973 /* Handle a "no_icf" attribute; arguments as in
6974 struct attribute_spec.handler. */
6977 handle_noicf_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;
6991 /* Handle a "always_inline" attribute; arguments as in
6992 struct attribute_spec.handler. */
6995 handle_always_inline_attribute (tree
*node
, tree name
,
6996 tree
ARG_UNUSED (args
),
6997 int ARG_UNUSED (flags
),
7000 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7002 if (lookup_attribute ("noinline", DECL_ATTRIBUTES (*node
)))
7004 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
7005 "with %qs attribute", name
, "noinline");
7006 *no_add_attrs
= true;
7008 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
7010 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
7011 "with %qs attribute", name
, "target_clones");
7012 *no_add_attrs
= true;
7015 /* Set the attribute and mark it for disregarding inline
7017 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
7021 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7022 *no_add_attrs
= true;
7028 /* Handle a "gnu_inline" attribute; arguments as in
7029 struct attribute_spec.handler. */
7032 handle_gnu_inline_attribute (tree
*node
, tree name
,
7033 tree
ARG_UNUSED (args
),
7034 int ARG_UNUSED (flags
),
7037 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7039 /* Do nothing else, just set the attribute. We'll get at
7040 it later with lookup_attribute. */
7044 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7045 *no_add_attrs
= true;
7051 /* Handle a "leaf" attribute; arguments as in
7052 struct attribute_spec.handler. */
7055 handle_leaf_attribute (tree
*node
, tree name
,
7056 tree
ARG_UNUSED (args
),
7057 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7059 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7061 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7062 *no_add_attrs
= true;
7064 if (!TREE_PUBLIC (*node
))
7066 warning (OPT_Wattributes
, "%qE attribute has no effect on unit local functions", name
);
7067 *no_add_attrs
= true;
7073 /* Handle an "artificial" attribute; arguments as in
7074 struct attribute_spec.handler. */
7077 handle_artificial_attribute (tree
*node
, tree name
,
7078 tree
ARG_UNUSED (args
),
7079 int ARG_UNUSED (flags
),
7082 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
7084 /* Do nothing else, just set the attribute. We'll get at
7085 it later with lookup_attribute. */
7089 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7090 *no_add_attrs
= true;
7096 /* Handle a "flatten" attribute; arguments as in
7097 struct attribute_spec.handler. */
7100 handle_flatten_attribute (tree
*node
, tree name
,
7101 tree args ATTRIBUTE_UNUSED
,
7102 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
7104 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7105 /* Do nothing else, just set the attribute. We'll get at
7106 it later with lookup_attribute. */
7110 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7111 *no_add_attrs
= true;
7117 /* Handle a "warning" or "error" attribute; arguments as in
7118 struct attribute_spec.handler. */
7121 handle_error_attribute (tree
*node
, tree name
, tree args
,
7122 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7124 if (TREE_CODE (*node
) == FUNCTION_DECL
7125 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
7126 /* Do nothing else, just set the attribute. We'll get at
7127 it later with lookup_attribute. */
7131 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7132 *no_add_attrs
= true;
7138 /* Handle a "used" attribute; arguments as in
7139 struct attribute_spec.handler. */
7142 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
7143 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7147 if (TREE_CODE (node
) == FUNCTION_DECL
7148 || (VAR_P (node
) && TREE_STATIC (node
))
7149 || (TREE_CODE (node
) == TYPE_DECL
))
7151 TREE_USED (node
) = 1;
7152 DECL_PRESERVE_P (node
) = 1;
7154 DECL_READ_P (node
) = 1;
7158 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7159 *no_add_attrs
= true;
7165 /* Handle a "unused" attribute; arguments as in
7166 struct attribute_spec.handler. */
7169 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7170 int flags
, bool *no_add_attrs
)
7176 if (TREE_CODE (decl
) == PARM_DECL
7177 || VAR_OR_FUNCTION_DECL_P (decl
)
7178 || TREE_CODE (decl
) == LABEL_DECL
7179 || TREE_CODE (decl
) == CONST_DECL
7180 || TREE_CODE (decl
) == TYPE_DECL
)
7182 TREE_USED (decl
) = 1;
7183 if (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
)
7184 DECL_READ_P (decl
) = 1;
7188 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7189 *no_add_attrs
= true;
7194 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7195 *node
= build_variant_type_copy (*node
);
7196 TREE_USED (*node
) = 1;
7202 /* Handle a "externally_visible" attribute; arguments as in
7203 struct attribute_spec.handler. */
7206 handle_externally_visible_attribute (tree
*pnode
, tree name
,
7207 tree
ARG_UNUSED (args
),
7208 int ARG_UNUSED (flags
),
7213 if (VAR_OR_FUNCTION_DECL_P (node
))
7215 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
7216 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
7218 warning (OPT_Wattributes
,
7219 "%qE attribute have effect only on public objects", name
);
7220 *no_add_attrs
= true;
7225 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7226 *no_add_attrs
= true;
7232 /* Handle the "no_reorder" attribute. Arguments as in
7233 struct attribute_spec.handler. */
7236 handle_no_reorder_attribute (tree
*pnode
,
7244 if (!VAR_OR_FUNCTION_DECL_P (node
)
7245 && !(TREE_STATIC (node
) || DECL_EXTERNAL (node
)))
7247 warning (OPT_Wattributes
,
7248 "%qE attribute only affects top level objects",
7250 *no_add_attrs
= true;
7256 /* Handle a "const" attribute; arguments as in
7257 struct attribute_spec.handler. */
7260 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7261 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7263 tree type
= TREE_TYPE (*node
);
7265 /* See FIXME comment on noreturn in c_common_attribute_table. */
7266 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7267 TREE_READONLY (*node
) = 1;
7268 else if (TREE_CODE (type
) == POINTER_TYPE
7269 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
7271 = (build_qualified_type
7273 (build_type_variant (TREE_TYPE (type
), 1,
7274 TREE_THIS_VOLATILE (TREE_TYPE (type
)))),
7275 TYPE_QUALS (type
)));
7278 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7279 *no_add_attrs
= true;
7285 /* Handle a "scalar_storage_order" attribute; arguments as in
7286 struct attribute_spec.handler. */
7289 handle_scalar_storage_order_attribute (tree
*node
, tree name
, tree args
,
7290 int flags
, bool *no_add_attrs
)
7292 tree id
= TREE_VALUE (args
);
7295 if (TREE_CODE (*node
) == TYPE_DECL
7296 && ! (flags
& ATTR_FLAG_CXX11
))
7297 node
= &TREE_TYPE (*node
);
7300 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
)
7302 error ("scalar_storage_order is not supported because endianness "
7307 if (RECORD_OR_UNION_TYPE_P (type
) && !c_dialect_cxx ())
7309 bool reverse
= false;
7311 if (TREE_CODE (id
) == STRING_CST
7312 && strcmp (TREE_STRING_POINTER (id
), "big-endian") == 0)
7313 reverse
= !BYTES_BIG_ENDIAN
;
7314 else if (TREE_CODE (id
) == STRING_CST
7315 && strcmp (TREE_STRING_POINTER (id
), "little-endian") == 0)
7316 reverse
= BYTES_BIG_ENDIAN
;
7319 error ("scalar_storage_order argument must be one of \"big-endian\""
7320 " or \"little-endian\"");
7324 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7327 /* A type variant isn't good enough, since we don't want a cast
7328 to such a type to be removed as a no-op. */
7329 *node
= type
= build_duplicate_type (type
);
7332 TYPE_REVERSE_STORAGE_ORDER (type
) = reverse
;
7336 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7337 *no_add_attrs
= true;
7341 /* Handle a "transparent_union" attribute; arguments as in
7342 struct attribute_spec.handler. */
7345 handle_transparent_union_attribute (tree
*node
, tree name
,
7346 tree
ARG_UNUSED (args
), int flags
,
7351 *no_add_attrs
= true;
7353 if (TREE_CODE (*node
) == TYPE_DECL
7354 && ! (flags
& ATTR_FLAG_CXX11
))
7355 node
= &TREE_TYPE (*node
);
7358 if (TREE_CODE (type
) == UNION_TYPE
)
7360 /* Make sure that the first field will work for a transparent union.
7361 If the type isn't complete yet, leave the check to the code in
7363 if (TYPE_SIZE (type
))
7365 tree first
= first_field (type
);
7366 if (first
== NULL_TREE
7367 || DECL_ARTIFICIAL (first
)
7368 || TYPE_MODE (type
) != DECL_MODE (first
))
7372 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7374 /* If the type isn't complete yet, setting the flag
7375 on a variant wouldn't ever be checked. */
7376 if (!TYPE_SIZE (type
))
7379 /* build_duplicate_type doesn't work for C++. */
7380 if (c_dialect_cxx ())
7383 /* A type variant isn't good enough, since we don't want a cast
7384 to such a type to be removed as a no-op. */
7385 *node
= type
= build_duplicate_type (type
);
7388 for (tree t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
7389 TYPE_TRANSPARENT_AGGR (t
) = 1;
7394 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7398 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
7399 get the requested priority for a constructor or destructor,
7400 possibly issuing diagnostics for invalid or reserved
7403 static priority_type
7404 get_priority (tree args
, bool is_destructor
)
7410 return DEFAULT_INIT_PRIORITY
;
7412 if (!SUPPORTS_INIT_PRIORITY
)
7415 error ("destructor priorities are not supported");
7417 error ("constructor priorities are not supported");
7418 return DEFAULT_INIT_PRIORITY
;
7421 arg
= TREE_VALUE (args
);
7422 if (TREE_CODE (arg
) == IDENTIFIER_NODE
)
7424 if (arg
== error_mark_node
)
7425 return DEFAULT_INIT_PRIORITY
;
7426 arg
= default_conversion (arg
);
7427 if (!tree_fits_shwi_p (arg
)
7428 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
7431 pri
= tree_to_shwi (arg
);
7432 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
7435 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
7439 "destructor priorities from 0 to %d are reserved "
7440 "for the implementation",
7441 MAX_RESERVED_INIT_PRIORITY
);
7444 "constructor priorities from 0 to %d are reserved "
7445 "for the implementation",
7446 MAX_RESERVED_INIT_PRIORITY
);
7452 error ("destructor priorities must be integers from 0 to %d inclusive",
7455 error ("constructor priorities must be integers from 0 to %d inclusive",
7457 return DEFAULT_INIT_PRIORITY
;
7460 /* Handle a "constructor" attribute; arguments as in
7461 struct attribute_spec.handler. */
7464 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
7465 int ARG_UNUSED (flags
),
7469 tree type
= TREE_TYPE (decl
);
7471 if (TREE_CODE (decl
) == FUNCTION_DECL
7472 && TREE_CODE (type
) == FUNCTION_TYPE
7473 && decl_function_context (decl
) == 0)
7475 priority_type priority
;
7476 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
7477 priority
= get_priority (args
, /*is_destructor=*/false);
7478 SET_DECL_INIT_PRIORITY (decl
, priority
);
7479 TREE_USED (decl
) = 1;
7483 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7484 *no_add_attrs
= true;
7490 /* Handle a "destructor" attribute; arguments as in
7491 struct attribute_spec.handler. */
7494 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
7495 int ARG_UNUSED (flags
),
7499 tree type
= TREE_TYPE (decl
);
7501 if (TREE_CODE (decl
) == FUNCTION_DECL
7502 && TREE_CODE (type
) == FUNCTION_TYPE
7503 && decl_function_context (decl
) == 0)
7505 priority_type priority
;
7506 DECL_STATIC_DESTRUCTOR (decl
) = 1;
7507 priority
= get_priority (args
, /*is_destructor=*/true);
7508 SET_DECL_FINI_PRIORITY (decl
, priority
);
7509 TREE_USED (decl
) = 1;
7513 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7514 *no_add_attrs
= true;
7520 /* Nonzero if the mode is a valid vector mode for this architecture.
7521 This returns nonzero even if there is no hardware support for the
7522 vector mode, but we can emulate with narrower modes. */
7525 vector_mode_valid_p (machine_mode mode
)
7527 enum mode_class mclass
= GET_MODE_CLASS (mode
);
7528 machine_mode innermode
;
7530 /* Doh! What's going on? */
7531 if (mclass
!= MODE_VECTOR_INT
7532 && mclass
!= MODE_VECTOR_FLOAT
7533 && mclass
!= MODE_VECTOR_FRACT
7534 && mclass
!= MODE_VECTOR_UFRACT
7535 && mclass
!= MODE_VECTOR_ACCUM
7536 && mclass
!= MODE_VECTOR_UACCUM
)
7539 /* Hardware support. Woo hoo! */
7540 if (targetm
.vector_mode_supported_p (mode
))
7543 innermode
= GET_MODE_INNER (mode
);
7545 /* We should probably return 1 if requesting V4DI and we have no DI,
7546 but we have V2DI, but this is probably very unlikely. */
7548 /* If we have support for the inner mode, we can safely emulate it.
7549 We may not have V2DI, but me can emulate with a pair of DIs. */
7550 return targetm
.scalar_mode_supported_p (innermode
);
7554 /* Handle a "mode" attribute; arguments as in
7555 struct attribute_spec.handler. */
7558 handle_mode_attribute (tree
*node
, tree name
, tree args
,
7559 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7562 tree ident
= TREE_VALUE (args
);
7564 *no_add_attrs
= true;
7566 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
7567 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7571 const char *p
= IDENTIFIER_POINTER (ident
);
7572 int len
= strlen (p
);
7573 machine_mode mode
= VOIDmode
;
7577 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
7578 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
7580 char *newp
= (char *) alloca (len
- 1);
7582 strcpy (newp
, &p
[2]);
7583 newp
[len
- 4] = '\0';
7587 /* Change this type to have a type with the specified mode.
7588 First check for the special modes. */
7589 if (!strcmp (p
, "byte"))
7591 else if (!strcmp (p
, "word"))
7593 else if (!strcmp (p
, "pointer"))
7595 else if (!strcmp (p
, "libgcc_cmp_return"))
7596 mode
= targetm
.libgcc_cmp_return_mode ();
7597 else if (!strcmp (p
, "libgcc_shift_count"))
7598 mode
= targetm
.libgcc_shift_count_mode ();
7599 else if (!strcmp (p
, "unwind_word"))
7600 mode
= targetm
.unwind_word_mode ();
7602 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
7603 if (!strcmp (p
, GET_MODE_NAME (j
)))
7605 mode
= (machine_mode
) j
;
7609 if (mode
== VOIDmode
)
7611 error ("unknown machine mode %qE", ident
);
7616 switch (GET_MODE_CLASS (mode
))
7619 case MODE_PARTIAL_INT
:
7621 case MODE_DECIMAL_FLOAT
:
7626 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
7629 case MODE_COMPLEX_INT
:
7630 case MODE_COMPLEX_FLOAT
:
7631 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
7634 case MODE_VECTOR_INT
:
7635 case MODE_VECTOR_FLOAT
:
7636 case MODE_VECTOR_FRACT
:
7637 case MODE_VECTOR_UFRACT
:
7638 case MODE_VECTOR_ACCUM
:
7639 case MODE_VECTOR_UACCUM
:
7640 warning (OPT_Wattributes
, "specifying vector types with "
7641 "__attribute__ ((mode)) is deprecated");
7642 warning (OPT_Wattributes
,
7643 "use __attribute__ ((vector_size)) instead");
7644 valid_mode
= vector_mode_valid_p (mode
);
7652 error ("unable to emulate %qs", p
);
7656 if (POINTER_TYPE_P (type
))
7658 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
7659 tree (*fn
)(tree
, machine_mode
, bool);
7661 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
7663 error ("invalid pointer mode %qs", p
);
7667 if (TREE_CODE (type
) == POINTER_TYPE
)
7668 fn
= build_pointer_type_for_mode
;
7670 fn
= build_reference_type_for_mode
;
7671 typefm
= fn (TREE_TYPE (type
), mode
, false);
7675 /* For fixed-point modes, we need to test if the signness of type
7676 and the machine mode are consistent. */
7677 if (ALL_FIXED_POINT_MODE_P (mode
)
7678 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
7680 error ("signedness of type and machine mode %qs don%'t match", p
);
7683 /* For fixed-point modes, we need to pass saturating info. */
7684 typefm
= lang_hooks
.types
.type_for_mode (mode
,
7685 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
7686 : TYPE_UNSIGNED (type
));
7689 if (typefm
== NULL_TREE
)
7691 error ("no data type for mode %qs", p
);
7694 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
7696 /* For enumeral types, copy the precision from the integer
7697 type returned above. If not an INTEGER_TYPE, we can't use
7698 this mode for this type. */
7699 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
7701 error ("cannot use mode %qs for enumeral types", p
);
7705 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
7707 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
7712 /* We cannot build a type variant, as there's code that assumes
7713 that TYPE_MAIN_VARIANT has the same mode. This includes the
7714 debug generators. Instead, create a subrange type. This
7715 results in all of the enumeral values being emitted only once
7716 in the original, and the subtype gets them by reference. */
7717 if (TYPE_UNSIGNED (type
))
7718 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
7720 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
7721 TREE_TYPE (typefm
) = type
;
7724 else if (VECTOR_MODE_P (mode
)
7725 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
7726 : TREE_CODE (type
) != TREE_CODE (typefm
))
7728 error ("mode %qs applied to inappropriate type", p
);
7738 /* Handle a "section" attribute; arguments as in
7739 struct attribute_spec.handler. */
7742 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7743 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7747 if (!targetm_common
.have_named_sections
)
7749 error_at (DECL_SOURCE_LOCATION (*node
),
7750 "section attributes are not supported for this target");
7754 user_defined_section_attribute
= true;
7756 if (!VAR_OR_FUNCTION_DECL_P (decl
))
7758 error ("section attribute not allowed for %q+D", *node
);
7762 if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7764 error ("section attribute argument not a string constant");
7769 && current_function_decl
!= NULL_TREE
7770 && !TREE_STATIC (decl
))
7772 error_at (DECL_SOURCE_LOCATION (decl
),
7773 "section attribute cannot be specified for local variables");
7777 /* The decl may have already been given a section attribute
7778 from a previous declaration. Ensure they match. */
7779 if (DECL_SECTION_NAME (decl
) != NULL
7780 && strcmp (DECL_SECTION_NAME (decl
),
7781 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
7783 error ("section of %q+D conflicts with previous declaration", *node
);
7788 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
7789 && DECL_THREAD_LOCAL_P (decl
))
7791 error ("section of %q+D cannot be overridden", *node
);
7795 set_decl_section_name (decl
, TREE_STRING_POINTER (TREE_VALUE (args
)));
7799 *no_add_attrs
= true;
7803 /* Check whether ALIGN is a valid user-specified alignment. If so,
7804 return its base-2 log; if not, output an error and return -1. If
7805 ALLOW_ZERO then 0 is valid and should result in a return of -1 with
7808 check_user_alignment (const_tree align
, bool allow_zero
)
7812 if (error_operand_p (align
))
7814 if (TREE_CODE (align
) != INTEGER_CST
7815 || !INTEGRAL_TYPE_P (TREE_TYPE (align
)))
7817 error ("requested alignment is not an integer constant");
7820 else if (allow_zero
&& integer_zerop (align
))
7822 else if (tree_int_cst_sgn (align
) == -1
7823 || (i
= tree_log2 (align
)) == -1)
7825 error ("requested alignment is not a positive power of 2");
7828 else if (i
>= HOST_BITS_PER_INT
- LOG2_BITS_PER_UNIT
)
7830 error ("requested alignment is too large");
7836 /* If in c++-11, check if the c++-11 alignment constraint with respect
7837 to fundamental alignment (in [dcl.align]) are satisfied. If not in
7838 c++-11 mode, does nothing.
7842 [* if the constant expression evaluates to a fundamental alignment,
7843 the alignment requirement of the declared entity shall be the
7844 specified fundamental alignment.
7846 * if the constant expression evaluates to an extended alignment
7847 and the implementation supports that alignment in the context
7848 of the declaration, the alignment of the declared entity shall
7851 * if the constant expression evaluates to an extended alignment
7852 and the implementation does not support that alignment in the
7853 context of the declaration, the program is ill-formed]. */
7856 check_cxx_fundamental_alignment_constraints (tree node
,
7860 bool alignment_too_large_p
= false;
7861 unsigned requested_alignment
= (1U << align_log
) * BITS_PER_UNIT
;
7862 unsigned max_align
= 0;
7864 if ((!(flags
& ATTR_FLAG_CXX11
) && !warn_cxx_compat
)
7865 || (node
== NULL_TREE
|| node
== error_mark_node
))
7868 if (cxx_fundamental_alignment_p (requested_alignment
))
7873 if (TREE_STATIC (node
))
7875 /* For file scope variables and static members, the target
7876 supports alignments that are at most
7877 MAX_OFILE_ALIGNMENT. */
7878 if (requested_alignment
> (max_align
= MAX_OFILE_ALIGNMENT
))
7879 alignment_too_large_p
= true;
7883 #ifdef BIGGEST_FIELD_ALIGNMENT
7884 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_FIELD_ALIGNMENT
7886 #define MAX_TARGET_FIELD_ALIGNMENT BIGGEST_ALIGNMENT
7888 /* For non-static members, the target supports either
7889 alignments that at most either BIGGEST_FIELD_ALIGNMENT
7890 if it is defined or BIGGEST_ALIGNMENT. */
7891 max_align
= MAX_TARGET_FIELD_ALIGNMENT
;
7892 if (TREE_CODE (node
) == FIELD_DECL
7893 && requested_alignment
> (max_align
= MAX_TARGET_FIELD_ALIGNMENT
))
7894 alignment_too_large_p
= true;
7895 #undef MAX_TARGET_FIELD_ALIGNMENT
7896 /* For stack variables, the target supports at most
7897 MAX_STACK_ALIGNMENT. */
7898 else if (decl_function_context (node
) != NULL
7899 && requested_alignment
> (max_align
= MAX_STACK_ALIGNMENT
))
7900 alignment_too_large_p
= true;
7903 else if (TYPE_P (node
))
7905 /* Let's be liberal for types; don't limit their alignment any more than
7906 check_user_alignment already did. */
7909 if (alignment_too_large_p
)
7910 pedwarn (input_location
, OPT_Wattributes
,
7911 "requested alignment %d is larger than %d",
7912 requested_alignment
/ BITS_PER_UNIT
, max_align
/ BITS_PER_UNIT
);
7914 return !alignment_too_large_p
;
7917 /* Handle a "aligned" attribute; arguments as in
7918 struct attribute_spec.handler. */
7921 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7922 int flags
, bool *no_add_attrs
)
7924 tree decl
= NULL_TREE
;
7932 align_expr
= TREE_VALUE (args
);
7933 if (align_expr
&& TREE_CODE (align_expr
) != IDENTIFIER_NODE
7934 && TREE_CODE (align_expr
) != FUNCTION_DECL
)
7935 align_expr
= default_conversion (align_expr
);
7938 align_expr
= size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
);
7943 type
= &TREE_TYPE (decl
);
7944 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
7946 else if (TYPE_P (*node
))
7947 type
= node
, is_type
= 1;
7949 if ((i
= check_user_alignment (align_expr
, true)) == -1
7950 || !check_cxx_fundamental_alignment_constraints (*node
, i
, flags
))
7951 *no_add_attrs
= true;
7954 if ((flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7955 /* OK, modify the type in place. */;
7956 /* If we have a TYPE_DECL, then copy the type, so that we
7957 don't accidentally modify a builtin type. See pushdecl. */
7958 else if (decl
&& TREE_TYPE (decl
) != error_mark_node
7959 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
7961 tree tt
= TREE_TYPE (decl
);
7962 *type
= build_variant_type_copy (*type
);
7963 DECL_ORIGINAL_TYPE (decl
) = tt
;
7964 TYPE_NAME (*type
) = decl
;
7965 TREE_USED (*type
) = TREE_USED (decl
);
7966 TREE_TYPE (decl
) = *type
;
7969 *type
= build_variant_type_copy (*type
);
7971 SET_TYPE_ALIGN (*type
, (1U << i
) * BITS_PER_UNIT
);
7972 TYPE_USER_ALIGN (*type
) = 1;
7974 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
7975 && TREE_CODE (decl
) != FIELD_DECL
)
7977 error ("alignment may not be specified for %q+D", decl
);
7978 *no_add_attrs
= true;
7980 else if (DECL_USER_ALIGN (decl
)
7981 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
7982 /* C++-11 [dcl.align/4]:
7984 When multiple alignment-specifiers are specified for an
7985 entity, the alignment requirement shall be set to the
7986 strictest specified alignment.
7988 This formally comes from the c++11 specification but we are
7989 doing it for the GNU attribute syntax as well. */
7990 *no_add_attrs
= true;
7991 else if (TREE_CODE (decl
) == FUNCTION_DECL
7992 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
7994 if (DECL_USER_ALIGN (decl
))
7995 error ("alignment for %q+D was previously specified as %d "
7996 "and may not be decreased", decl
,
7997 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
7999 error ("alignment for %q+D must be at least %d", decl
,
8000 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
8001 *no_add_attrs
= true;
8005 SET_DECL_ALIGN (decl
, (1U << i
) * BITS_PER_UNIT
);
8006 DECL_USER_ALIGN (decl
) = 1;
8012 /* Handle a "weak" attribute; arguments as in
8013 struct attribute_spec.handler. */
8016 handle_weak_attribute (tree
*node
, tree name
,
8017 tree
ARG_UNUSED (args
),
8018 int ARG_UNUSED (flags
),
8019 bool * ARG_UNUSED (no_add_attrs
))
8021 if (TREE_CODE (*node
) == FUNCTION_DECL
8022 && DECL_DECLARED_INLINE_P (*node
))
8024 warning (OPT_Wattributes
, "inline function %q+D declared weak", *node
);
8025 *no_add_attrs
= true;
8027 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8029 error ("indirect function %q+D cannot be declared weak", *node
);
8030 *no_add_attrs
= true;
8033 else if (VAR_OR_FUNCTION_DECL_P (*node
))
8034 declare_weak (*node
);
8036 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8041 /* Handle a "noplt" attribute; arguments as in
8042 struct attribute_spec.handler. */
8045 handle_noplt_attribute (tree
*node
, tree name
,
8046 tree
ARG_UNUSED (args
),
8047 int ARG_UNUSED (flags
),
8048 bool * ARG_UNUSED (no_add_attrs
))
8050 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8052 warning (OPT_Wattributes
,
8053 "%qE attribute is only applicable on functions", name
);
8054 *no_add_attrs
= true;
8060 /* Handle an "alias" or "ifunc" attribute; arguments as in
8061 struct attribute_spec.handler, except that IS_ALIAS tells us
8062 whether this is an alias as opposed to ifunc attribute. */
8065 handle_alias_ifunc_attribute (bool is_alias
, tree
*node
, tree name
, tree args
,
8070 if (TREE_CODE (decl
) != FUNCTION_DECL
8071 && (!is_alias
|| !VAR_P (decl
)))
8073 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8074 *no_add_attrs
= true;
8076 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
8077 || (TREE_CODE (decl
) != FUNCTION_DECL
8078 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
8079 /* A static variable declaration is always a tentative definition,
8080 but the alias is a non-tentative definition which overrides. */
8081 || (TREE_CODE (decl
) != FUNCTION_DECL
8082 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
8084 error ("%q+D defined both normally and as %qE attribute", decl
, name
);
8085 *no_add_attrs
= true;
8089 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl
))
8090 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))))
8092 error ("weak %q+D cannot be defined %qE", decl
, name
);
8093 *no_add_attrs
= true;
8097 /* Note that the very first time we process a nested declaration,
8098 decl_function_context will not be set. Indeed, *would* never
8099 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
8100 we do below. After such frobbery, pushdecl would set the context.
8101 In any case, this is never what we want. */
8102 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
8106 id
= TREE_VALUE (args
);
8107 if (TREE_CODE (id
) != STRING_CST
)
8109 error ("attribute %qE argument not a string", name
);
8110 *no_add_attrs
= true;
8113 id
= get_identifier (TREE_STRING_POINTER (id
));
8114 /* This counts as a use of the object pointed to. */
8117 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8118 DECL_INITIAL (decl
) = error_mark_node
;
8120 TREE_STATIC (decl
) = 1;
8123 /* ifuncs are also aliases, so set that attribute too. */
8124 DECL_ATTRIBUTES (decl
)
8125 = tree_cons (get_identifier ("alias"), args
, DECL_ATTRIBUTES (decl
));
8129 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8130 *no_add_attrs
= true;
8133 if (decl_in_symtab_p (*node
))
8135 struct symtab_node
*n
= symtab_node::get (decl
);
8136 if (n
&& n
->refuse_visibility_changes
)
8139 error ("%+D declared alias after being used", decl
);
8141 error ("%+D declared ifunc after being used", decl
);
8149 /* Handle an "alias" or "ifunc" attribute; arguments as in
8150 struct attribute_spec.handler. */
8153 handle_ifunc_attribute (tree
*node
, tree name
, tree args
,
8154 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8156 return handle_alias_ifunc_attribute (false, node
, name
, args
, no_add_attrs
);
8159 /* Handle an "alias" or "ifunc" attribute; arguments as in
8160 struct attribute_spec.handler. */
8163 handle_alias_attribute (tree
*node
, tree name
, tree args
,
8164 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8166 return handle_alias_ifunc_attribute (true, node
, name
, args
, no_add_attrs
);
8169 /* Handle a "weakref" attribute; arguments as in struct
8170 attribute_spec.handler. */
8173 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8174 int flags
, bool *no_add_attrs
)
8176 tree attr
= NULL_TREE
;
8178 /* We must ignore the attribute when it is associated with
8179 local-scoped decls, since attribute alias is ignored and many
8180 such symbols do not even have a DECL_WEAK field. */
8181 if (decl_function_context (*node
)
8182 || current_function_decl
8183 || !VAR_OR_FUNCTION_DECL_P (*node
))
8185 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8186 *no_add_attrs
= true;
8190 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
8192 error ("indirect function %q+D cannot be declared weakref", *node
);
8193 *no_add_attrs
= true;
8197 /* The idea here is that `weakref("name")' mutates into `weakref,
8198 alias("name")', and weakref without arguments, in turn,
8199 implicitly adds weak. */
8203 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
8204 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
8206 *no_add_attrs
= true;
8208 decl_attributes (node
, attr
, flags
);
8212 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
8213 error_at (DECL_SOURCE_LOCATION (*node
),
8214 "weakref attribute must appear before alias attribute");
8216 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
8217 and that isn't supported; and because it wants to add it to
8218 the list of weak decls, which isn't helpful. */
8219 DECL_WEAK (*node
) = 1;
8222 if (decl_in_symtab_p (*node
))
8224 struct symtab_node
*n
= symtab_node::get (*node
);
8225 if (n
&& n
->refuse_visibility_changes
)
8226 error ("%+D declared weakref after being used", *node
);
8232 /* Handle an "visibility" attribute; arguments as in
8233 struct attribute_spec.handler. */
8236 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
8237 int ARG_UNUSED (flags
),
8238 bool *ARG_UNUSED (no_add_attrs
))
8241 tree id
= TREE_VALUE (args
);
8242 enum symbol_visibility vis
;
8246 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
8248 else if (!RECORD_OR_UNION_TYPE_P (*node
))
8250 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
8254 else if (TYPE_FIELDS (*node
))
8256 error ("%qE attribute ignored because %qT is already defined",
8261 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
8263 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8267 if (TREE_CODE (id
) != STRING_CST
)
8269 error ("visibility argument not a string");
8273 /* If this is a type, set the visibility on the type decl. */
8276 decl
= TYPE_NAME (decl
);
8279 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
8281 warning (OPT_Wattributes
, "%qE attribute ignored on types",
8287 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
8288 vis
= VISIBILITY_DEFAULT
;
8289 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
8290 vis
= VISIBILITY_INTERNAL
;
8291 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
8292 vis
= VISIBILITY_HIDDEN
;
8293 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
8294 vis
= VISIBILITY_PROTECTED
;
8297 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
8298 vis
= VISIBILITY_DEFAULT
;
8301 if (DECL_VISIBILITY_SPECIFIED (decl
)
8302 && vis
!= DECL_VISIBILITY (decl
))
8304 tree attributes
= (TYPE_P (*node
)
8305 ? TYPE_ATTRIBUTES (*node
)
8306 : DECL_ATTRIBUTES (decl
));
8307 if (lookup_attribute ("visibility", attributes
))
8308 error ("%qD redeclared with different visibility", decl
);
8309 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8310 && lookup_attribute ("dllimport", attributes
))
8311 error ("%qD was declared %qs which implies default visibility",
8313 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8314 && lookup_attribute ("dllexport", attributes
))
8315 error ("%qD was declared %qs which implies default visibility",
8319 DECL_VISIBILITY (decl
) = vis
;
8320 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
8322 /* Go ahead and attach the attribute to the node as well. This is needed
8323 so we can determine whether we have VISIBILITY_DEFAULT because the
8324 visibility was not specified, or because it was explicitly overridden
8325 from the containing scope. */
8330 /* Determine the ELF symbol visibility for DECL, which is either a
8331 variable or a function. It is an error to use this function if a
8332 definition of DECL is not available in this translation unit.
8333 Returns true if the final visibility has been determined by this
8334 function; false if the caller is free to make additional
8338 c_determine_visibility (tree decl
)
8340 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
8342 /* If the user explicitly specified the visibility with an
8343 attribute, honor that. DECL_VISIBILITY will have been set during
8344 the processing of the attribute. We check for an explicit
8345 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
8346 to distinguish the use of an attribute from the use of a "#pragma
8347 GCC visibility push(...)"; in the latter case we still want other
8348 considerations to be able to overrule the #pragma. */
8349 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
8350 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
8351 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
8352 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
8355 /* Set default visibility to whatever the user supplied with
8356 visibility_specified depending on #pragma GCC visibility. */
8357 if (!DECL_VISIBILITY_SPECIFIED (decl
))
8359 if (visibility_options
.inpragma
8360 || DECL_VISIBILITY (decl
) != default_visibility
)
8362 DECL_VISIBILITY (decl
) = default_visibility
;
8363 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
8364 /* If visibility changed and DECL already has DECL_RTL, ensure
8365 symbol flags are updated. */
8366 if (((VAR_P (decl
) && TREE_STATIC (decl
))
8367 || TREE_CODE (decl
) == FUNCTION_DECL
)
8368 && DECL_RTL_SET_P (decl
))
8369 make_decl_rtl (decl
);
8375 /* Handle an "tls_model" attribute; arguments as in
8376 struct attribute_spec.handler. */
8379 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
8380 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8384 enum tls_model kind
;
8386 *no_add_attrs
= true;
8388 if (!VAR_P (decl
) || !DECL_THREAD_LOCAL_P (decl
))
8390 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8394 kind
= DECL_TLS_MODEL (decl
);
8395 id
= TREE_VALUE (args
);
8396 if (TREE_CODE (id
) != STRING_CST
)
8398 error ("tls_model argument not a string");
8402 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
8403 kind
= TLS_MODEL_LOCAL_EXEC
;
8404 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
8405 kind
= TLS_MODEL_INITIAL_EXEC
;
8406 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
8407 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
8408 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
8409 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
8411 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
8413 set_decl_tls_model (decl
, kind
);
8417 /* Handle a "no_instrument_function" attribute; arguments as in
8418 struct attribute_spec.handler. */
8421 handle_no_instrument_function_attribute (tree
*node
, tree name
,
8422 tree
ARG_UNUSED (args
),
8423 int ARG_UNUSED (flags
),
8428 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8430 error_at (DECL_SOURCE_LOCATION (decl
),
8431 "%qE attribute applies only to functions", name
);
8432 *no_add_attrs
= true;
8435 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
8440 /* Handle a "no_profile_instrument_function" attribute; arguments as in
8441 struct attribute_spec.handler. */
8444 handle_no_profile_instrument_function_attribute (tree
*node
, tree name
, tree
,
8445 int, bool *no_add_attrs
)
8447 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8449 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8450 *no_add_attrs
= true;
8456 /* Handle a "malloc" attribute; arguments as in
8457 struct attribute_spec.handler. */
8460 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8461 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8463 if (TREE_CODE (*node
) == FUNCTION_DECL
8464 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
8465 DECL_IS_MALLOC (*node
) = 1;
8468 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8469 *no_add_attrs
= true;
8475 /* Handle a "alloc_size" attribute; arguments as in
8476 struct attribute_spec.handler. */
8479 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
8480 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8482 unsigned arg_count
= type_num_arguments (*node
);
8483 for (; args
; args
= TREE_CHAIN (args
))
8485 tree position
= TREE_VALUE (args
);
8486 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8487 && TREE_CODE (position
) != FUNCTION_DECL
)
8488 position
= default_conversion (position
);
8490 if (!tree_fits_uhwi_p (position
)
8492 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8494 warning (OPT_Wattributes
,
8495 "alloc_size parameter outside range");
8496 *no_add_attrs
= true;
8503 /* Handle a "alloc_align" attribute; arguments as in
8504 struct attribute_spec.handler. */
8507 handle_alloc_align_attribute (tree
*node
, tree
, tree args
, int,
8510 unsigned arg_count
= type_num_arguments (*node
);
8511 tree position
= TREE_VALUE (args
);
8512 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8513 && TREE_CODE (position
) != FUNCTION_DECL
)
8514 position
= default_conversion (position
);
8516 if (!tree_fits_uhwi_p (position
)
8518 || !IN_RANGE (tree_to_uhwi (position
), 1, arg_count
))
8520 warning (OPT_Wattributes
,
8521 "alloc_align parameter outside range");
8522 *no_add_attrs
= true;
8528 /* Handle a "assume_aligned" attribute; arguments as in
8529 struct attribute_spec.handler. */
8532 handle_assume_aligned_attribute (tree
*, tree
, tree args
, int,
8535 for (; args
; args
= TREE_CHAIN (args
))
8537 tree position
= TREE_VALUE (args
);
8538 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
8539 && TREE_CODE (position
) != FUNCTION_DECL
)
8540 position
= default_conversion (position
);
8542 if (TREE_CODE (position
) != INTEGER_CST
)
8544 warning (OPT_Wattributes
,
8545 "assume_aligned parameter not integer constant");
8546 *no_add_attrs
= true;
8553 /* Handle a "fn spec" attribute; arguments as in
8554 struct attribute_spec.handler. */
8557 handle_fnspec_attribute (tree
*node ATTRIBUTE_UNUSED
, tree
ARG_UNUSED (name
),
8558 tree args
, int ARG_UNUSED (flags
),
8559 bool *no_add_attrs ATTRIBUTE_UNUSED
)
8562 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
8563 && !TREE_CHAIN (args
));
8567 /* Handle a "bnd_variable_size" attribute; arguments as in
8568 struct attribute_spec.handler. */
8571 handle_bnd_variable_size_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8572 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8574 if (TREE_CODE (*node
) != FIELD_DECL
)
8576 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8577 *no_add_attrs
= true;
8583 /* Handle a "bnd_legacy" attribute; arguments as in
8584 struct attribute_spec.handler. */
8587 handle_bnd_legacy (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8588 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8590 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8592 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8593 *no_add_attrs
= true;
8599 /* Handle a "bnd_instrument" attribute; arguments as in
8600 struct attribute_spec.handler. */
8603 handle_bnd_instrument (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8604 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8606 if (TREE_CODE (*node
) != FUNCTION_DECL
)
8608 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8609 *no_add_attrs
= true;
8615 /* Handle a "warn_unused" attribute; arguments as in
8616 struct attribute_spec.handler. */
8619 handle_warn_unused_attribute (tree
*node
, tree name
,
8620 tree args ATTRIBUTE_UNUSED
,
8621 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
8624 /* Do nothing else, just set the attribute. We'll get at
8625 it later with lookup_attribute. */
8629 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8630 *no_add_attrs
= true;
8636 /* Handle an "omp declare simd" attribute; arguments as in
8637 struct attribute_spec.handler. */
8640 handle_omp_declare_simd_attribute (tree
*, tree
, tree
, int, bool *)
8645 /* Handle a "simd" attribute. */
8648 handle_simd_attribute (tree
*node
, tree name
, tree args
, int, bool *no_add_attrs
)
8650 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8652 if (lookup_attribute ("cilk simd function",
8653 DECL_ATTRIBUTES (*node
)) != NULL
)
8655 error_at (DECL_SOURCE_LOCATION (*node
),
8656 "%<__simd__%> attribute cannot be used in the same "
8657 "function marked as a Cilk Plus SIMD-enabled function");
8658 *no_add_attrs
= true;
8662 tree t
= get_identifier ("omp declare simd");
8663 tree attr
= NULL_TREE
;
8666 tree id
= TREE_VALUE (args
);
8668 if (TREE_CODE (id
) != STRING_CST
)
8670 error ("attribute %qE argument not a string", name
);
8671 *no_add_attrs
= true;
8675 if (strcmp (TREE_STRING_POINTER (id
), "notinbranch") == 0)
8676 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8677 OMP_CLAUSE_NOTINBRANCH
);
8679 if (strcmp (TREE_STRING_POINTER (id
), "inbranch") == 0)
8680 attr
= build_omp_clause (DECL_SOURCE_LOCATION (*node
),
8681 OMP_CLAUSE_INBRANCH
);
8684 error ("only %<inbranch%> and %<notinbranch%> flags are "
8685 "allowed for %<__simd__%> attribute");
8686 *no_add_attrs
= true;
8691 DECL_ATTRIBUTES (*node
) = tree_cons (t
,
8692 build_tree_list (NULL_TREE
,
8694 DECL_ATTRIBUTES (*node
));
8699 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8700 *no_add_attrs
= true;
8706 /* Handle an "omp declare target" attribute; arguments as in
8707 struct attribute_spec.handler. */
8710 handle_omp_declare_target_attribute (tree
*, tree
, tree
, int, bool *)
8715 /* Handle a "returns_twice" attribute; arguments as in
8716 struct attribute_spec.handler. */
8719 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8720 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8722 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8723 DECL_IS_RETURNS_TWICE (*node
) = 1;
8726 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8727 *no_add_attrs
= true;
8733 /* Handle a "no_limit_stack" attribute; arguments as in
8734 struct attribute_spec.handler. */
8737 handle_no_limit_stack_attribute (tree
*node
, tree name
,
8738 tree
ARG_UNUSED (args
),
8739 int ARG_UNUSED (flags
),
8744 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8746 error_at (DECL_SOURCE_LOCATION (decl
),
8747 "%qE attribute applies only to functions", name
);
8748 *no_add_attrs
= true;
8750 else if (DECL_INITIAL (decl
))
8752 error_at (DECL_SOURCE_LOCATION (decl
),
8753 "can%'t set %qE attribute after definition", name
);
8754 *no_add_attrs
= true;
8757 DECL_NO_LIMIT_STACK (decl
) = 1;
8762 /* Handle a "pure" attribute; arguments as in
8763 struct attribute_spec.handler. */
8766 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
8767 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8769 if (TREE_CODE (*node
) == FUNCTION_DECL
)
8770 DECL_PURE_P (*node
) = 1;
8771 /* ??? TODO: Support types. */
8774 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8775 *no_add_attrs
= true;
8781 /* Digest an attribute list destined for a transactional memory statement.
8782 ALLOWED is the set of attributes that are allowed for this statement;
8783 return the attribute we parsed. Multiple attributes are never allowed. */
8786 parse_tm_stmt_attr (tree attrs
, int allowed
)
8791 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
8793 tree a
= TREE_PURPOSE (attrs
);
8796 if (is_attribute_p ("outer", a
))
8797 m
= TM_STMT_ATTR_OUTER
;
8799 if ((m
& allowed
) == 0)
8801 warning (OPT_Wattributes
, "%qE attribute directive ignored", a
);
8810 else if (m_seen
== m
)
8811 warning (OPT_Wattributes
, "%qE attribute duplicated", a
);
8813 warning (OPT_Wattributes
, "%qE attribute follows %qE", a
, a_seen
);
8819 /* Transform a TM attribute name into a maskable integer and back.
8820 Note that NULL (i.e. no attribute) is mapped to UNKNOWN, corresponding
8821 to how the lack of an attribute is treated. */
8824 tm_attr_to_mask (tree attr
)
8828 if (is_attribute_p ("transaction_safe", attr
))
8829 return TM_ATTR_SAFE
;
8830 if (is_attribute_p ("transaction_callable", attr
))
8831 return TM_ATTR_CALLABLE
;
8832 if (is_attribute_p ("transaction_pure", attr
))
8833 return TM_ATTR_PURE
;
8834 if (is_attribute_p ("transaction_unsafe", attr
))
8835 return TM_ATTR_IRREVOCABLE
;
8836 if (is_attribute_p ("transaction_may_cancel_outer", attr
))
8837 return TM_ATTR_MAY_CANCEL_OUTER
;
8842 tm_mask_to_attr (int mask
)
8848 str
= "transaction_safe";
8850 case TM_ATTR_CALLABLE
:
8851 str
= "transaction_callable";
8854 str
= "transaction_pure";
8856 case TM_ATTR_IRREVOCABLE
:
8857 str
= "transaction_unsafe";
8859 case TM_ATTR_MAY_CANCEL_OUTER
:
8860 str
= "transaction_may_cancel_outer";
8865 return get_identifier (str
);
8868 /* Return the first TM attribute seen in LIST. */
8871 find_tm_attribute (tree list
)
8873 for (; list
; list
= TREE_CHAIN (list
))
8875 tree name
= TREE_PURPOSE (list
);
8876 if (tm_attr_to_mask (name
) != 0)
8882 /* Handle the TM attributes; arguments as in struct attribute_spec.handler.
8883 Here we accept only function types, and verify that none of the other
8884 function TM attributes are also applied. */
8885 /* ??? We need to accept class types for C++, but not C. This greatly
8886 complicates this function, since we can no longer rely on the extra
8887 processing given by function_type_required. */
8890 handle_tm_attribute (tree
*node
, tree name
, tree args
,
8891 int flags
, bool *no_add_attrs
)
8893 /* Only one path adds the attribute; others don't. */
8894 *no_add_attrs
= true;
8896 switch (TREE_CODE (*node
))
8900 /* Only tm_callable and tm_safe apply to classes. */
8901 if (tm_attr_to_mask (name
) & ~(TM_ATTR_SAFE
| TM_ATTR_CALLABLE
))
8908 tree old_name
= find_tm_attribute (TYPE_ATTRIBUTES (*node
));
8909 if (old_name
== name
)
8911 else if (old_name
!= NULL_TREE
)
8912 error ("type was previously declared %qE", old_name
);
8914 *no_add_attrs
= false;
8920 /* transaction_safe_dynamic goes on the FUNCTION_DECL, but we also
8921 want to set transaction_safe on the type. */
8922 gcc_assert (is_attribute_p ("transaction_safe_dynamic", name
));
8923 if (!TYPE_P (DECL_CONTEXT (*node
)))
8924 error_at (DECL_SOURCE_LOCATION (*node
),
8925 "%<transaction_safe_dynamic%> may only be specified for "
8926 "a virtual function");
8927 *no_add_attrs
= false;
8928 decl_attributes (&TREE_TYPE (*node
),
8929 build_tree_list (get_identifier ("transaction_safe"),
8937 enum tree_code subcode
= TREE_CODE (TREE_TYPE (*node
));
8938 if (subcode
== FUNCTION_TYPE
|| subcode
== METHOD_TYPE
)
8940 tree fn_tmp
= TREE_TYPE (*node
);
8941 decl_attributes (&fn_tmp
, tree_cons (name
, args
, NULL
), 0);
8942 *node
= build_pointer_type (fn_tmp
);
8949 /* If a function is next, pass it on to be tried next. */
8950 if (flags
& (int) ATTR_FLAG_FUNCTION_NEXT
)
8951 return tree_cons (name
, args
, NULL
);
8954 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8961 /* Handle the TM_WRAP attribute; arguments as in
8962 struct attribute_spec.handler. */
8965 handle_tm_wrap_attribute (tree
*node
, tree name
, tree args
,
8966 int ARG_UNUSED (flags
), bool *no_add_attrs
)
8970 /* We don't need the attribute even on success, since we
8971 record the entry in an external table. */
8972 *no_add_attrs
= true;
8974 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8975 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
8978 tree wrap_decl
= TREE_VALUE (args
);
8979 if (error_operand_p (wrap_decl
))
8981 else if (TREE_CODE (wrap_decl
) != IDENTIFIER_NODE
8982 && !VAR_OR_FUNCTION_DECL_P (wrap_decl
))
8983 error ("%qE argument not an identifier", name
);
8986 if (TREE_CODE (wrap_decl
) == IDENTIFIER_NODE
)
8987 wrap_decl
= lookup_name (wrap_decl
);
8988 if (wrap_decl
&& TREE_CODE (wrap_decl
) == FUNCTION_DECL
)
8990 if (lang_hooks
.types_compatible_p (TREE_TYPE (decl
),
8991 TREE_TYPE (wrap_decl
)))
8992 record_tm_replacement (wrap_decl
, decl
);
8994 error ("%qD is not compatible with %qD", wrap_decl
, decl
);
8997 error ("%qE argument is not a function", name
);
9004 /* Ignore the given attribute. Used when this attribute may be usefully
9005 overridden by the target, but is not used generically. */
9008 ignore_attribute (tree
* ARG_UNUSED (node
), tree
ARG_UNUSED (name
),
9009 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9012 *no_add_attrs
= true;
9016 /* Handle a "no vops" attribute; arguments as in
9017 struct attribute_spec.handler. */
9020 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9021 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9022 bool *ARG_UNUSED (no_add_attrs
))
9024 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
9025 DECL_IS_NOVOPS (*node
) = 1;
9029 /* Handle a "deprecated" attribute; arguments as in
9030 struct attribute_spec.handler. */
9033 handle_deprecated_attribute (tree
*node
, tree name
,
9034 tree args
, int flags
,
9037 tree type
= NULL_TREE
;
9039 tree what
= NULL_TREE
;
9042 *no_add_attrs
= true;
9043 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
9045 error ("deprecated message is not a string");
9046 *no_add_attrs
= true;
9052 type
= TREE_TYPE (decl
);
9054 if (TREE_CODE (decl
) == TYPE_DECL
9055 || TREE_CODE (decl
) == PARM_DECL
9056 || VAR_OR_FUNCTION_DECL_P (decl
)
9057 || TREE_CODE (decl
) == FIELD_DECL
9058 || TREE_CODE (decl
) == CONST_DECL
9059 || objc_method_decl (TREE_CODE (decl
)))
9060 TREE_DEPRECATED (decl
) = 1;
9064 else if (TYPE_P (*node
))
9066 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
9067 *node
= build_variant_type_copy (*node
);
9068 TREE_DEPRECATED (*node
) = 1;
9076 *no_add_attrs
= true;
9077 if (type
&& TYPE_NAME (type
))
9079 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
9080 what
= TYPE_NAME (*node
);
9081 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
9082 && DECL_NAME (TYPE_NAME (type
)))
9083 what
= DECL_NAME (TYPE_NAME (type
));
9086 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
9088 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9094 /* Handle a "vector_size" attribute; arguments as in
9095 struct attribute_spec.handler. */
9098 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
9099 int ARG_UNUSED (flags
),
9102 unsigned HOST_WIDE_INT vecsize
, nunits
;
9103 machine_mode orig_mode
;
9104 tree type
= *node
, new_type
, size
;
9106 *no_add_attrs
= true;
9108 size
= TREE_VALUE (args
);
9109 if (size
&& TREE_CODE (size
) != IDENTIFIER_NODE
9110 && TREE_CODE (size
) != FUNCTION_DECL
)
9111 size
= default_conversion (size
);
9113 if (!tree_fits_uhwi_p (size
))
9115 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9119 /* Get the vector size (in bytes). */
9120 vecsize
= tree_to_uhwi (size
);
9122 /* We need to provide for vector pointers, vector arrays, and
9123 functions returning vectors. For example:
9125 __attribute__((vector_size(16))) short *foo;
9127 In this case, the mode is SI, but the type being modified is
9128 HI, so we need to look further. */
9130 while (POINTER_TYPE_P (type
)
9131 || TREE_CODE (type
) == FUNCTION_TYPE
9132 || TREE_CODE (type
) == METHOD_TYPE
9133 || TREE_CODE (type
) == ARRAY_TYPE
9134 || TREE_CODE (type
) == OFFSET_TYPE
)
9135 type
= TREE_TYPE (type
);
9137 /* Get the mode of the type being modified. */
9138 orig_mode
= TYPE_MODE (type
);
9140 if ((!INTEGRAL_TYPE_P (type
)
9141 && !SCALAR_FLOAT_TYPE_P (type
)
9142 && !FIXED_POINT_TYPE_P (type
))
9143 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
9144 && GET_MODE_CLASS (orig_mode
) != MODE_INT
9145 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
9146 || !tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
))
9147 || TREE_CODE (type
) == BOOLEAN_TYPE
)
9149 error ("invalid vector type for attribute %qE", name
);
9153 if (vecsize
% tree_to_uhwi (TYPE_SIZE_UNIT (type
)))
9155 error ("vector size not an integral multiple of component size");
9161 error ("zero vector size");
9165 /* Calculate how many units fit in the vector. */
9166 nunits
= vecsize
/ tree_to_uhwi (TYPE_SIZE_UNIT (type
));
9167 if (nunits
& (nunits
- 1))
9169 error ("number of components of the vector not a power of two");
9173 new_type
= build_vector_type (type
, nunits
);
9175 /* Build back pointers if needed. */
9176 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
9181 /* Handle the "nonnull" attribute. */
9183 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9184 tree args
, int ARG_UNUSED (flags
),
9188 unsigned HOST_WIDE_INT attr_arg_num
;
9190 /* If no arguments are specified, all pointer arguments should be
9191 non-null. Verify a full prototype is given so that the arguments
9192 will have the correct types when we actually check them later.
9193 Avoid diagnosing type-generic built-ins since those have no
9197 if (!prototype_p (type
)
9198 && (!TYPE_ATTRIBUTES (type
)
9199 || !lookup_attribute ("type generic", TYPE_ATTRIBUTES (type
))))
9201 error ("nonnull attribute without arguments on a non-prototype");
9202 *no_add_attrs
= true;
9207 /* Argument list specified. Verify that each argument number references
9208 a pointer argument. */
9209 for (attr_arg_num
= 1; args
; attr_arg_num
++, args
= TREE_CHAIN (args
))
9211 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
9213 tree arg
= TREE_VALUE (args
);
9214 if (arg
&& TREE_CODE (arg
) != IDENTIFIER_NODE
9215 && TREE_CODE (arg
) != FUNCTION_DECL
)
9216 arg
= default_conversion (arg
);
9218 if (!get_nonnull_operand (arg
, &arg_num
))
9220 error ("nonnull argument has invalid operand number (argument %lu)",
9221 (unsigned long) attr_arg_num
);
9222 *no_add_attrs
= true;
9226 if (prototype_p (type
))
9228 function_args_iterator iter
;
9231 function_args_iter_init (&iter
, type
);
9232 for (ck_num
= 1; ; ck_num
++, function_args_iter_next (&iter
))
9234 argument
= function_args_iter_cond (&iter
);
9235 if (argument
== NULL_TREE
|| ck_num
== arg_num
)
9240 || TREE_CODE (argument
) == VOID_TYPE
)
9242 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
9243 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9244 *no_add_attrs
= true;
9248 if (TREE_CODE (argument
) != POINTER_TYPE
)
9250 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
9251 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
9252 *no_add_attrs
= true;
9261 /* Check the argument list of a function call for null in argument slots
9262 that are marked as requiring a non-null pointer argument. The NARGS
9263 arguments are passed in the array ARGARRAY. */
9266 check_function_nonnull (location_t loc
, tree attrs
, int nargs
, tree
*argarray
)
9271 attrs
= lookup_attribute ("nonnull", attrs
);
9272 if (attrs
== NULL_TREE
)
9276 /* See if any of the nonnull attributes has no arguments. If so,
9277 then every pointer argument is checked (in which case the check
9278 for pointer type is done in check_nonnull_arg). */
9279 if (TREE_VALUE (a
) != NULL_TREE
)
9281 a
= lookup_attribute ("nonnull", TREE_CHAIN (a
));
9282 while (a
!= NULL_TREE
&& TREE_VALUE (a
) != NULL_TREE
);
9285 for (i
= 0; i
< nargs
; i
++)
9286 check_function_arguments_recurse (check_nonnull_arg
, &loc
, argarray
[i
],
9290 /* Walk the argument list. If we encounter an argument number we
9291 should check for non-null, do it. */
9292 for (i
= 0; i
< nargs
; i
++)
9294 for (a
= attrs
; ; a
= TREE_CHAIN (a
))
9296 a
= lookup_attribute ("nonnull", a
);
9297 if (a
== NULL_TREE
|| nonnull_check_p (TREE_VALUE (a
), i
+ 1))
9302 check_function_arguments_recurse (check_nonnull_arg
, &loc
,
9303 argarray
[i
], i
+ 1);
9308 /* Check that the Nth argument of a function call (counting backwards
9309 from the end) is a (pointer)0. The NARGS arguments are passed in the
9313 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
9315 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
9322 function_args_iterator iter
;
9325 /* Skip over the named arguments. */
9326 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
9333 if (TREE_VALUE (attr
))
9335 tree p
= TREE_VALUE (TREE_VALUE (attr
));
9336 pos
= TREE_INT_CST_LOW (p
);
9339 /* The sentinel must be one of the varargs, i.e.
9340 in position >= the number of fixed arguments. */
9341 if ((nargs
- 1 - pos
) < len
)
9343 warning (OPT_Wformat_
,
9344 "not enough variable arguments to fit a sentinel");
9348 /* Validate the sentinel. */
9349 sentinel
= argarray
[nargs
- 1 - pos
];
9350 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
9351 || !integer_zerop (sentinel
))
9352 /* Although __null (in C++) is only an integer we allow it
9353 nevertheless, as we are guaranteed that it's exactly
9354 as wide as a pointer, and we don't want to force
9355 users to cast the NULL they have written there.
9356 We warn with -Wstrict-null-sentinel, though. */
9357 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
9358 warning (OPT_Wformat_
, "missing sentinel in function call");
9362 /* Helper for check_function_nonnull; given a list of operands which
9363 must be non-null in ARGS, determine if operand PARAM_NUM should be
9367 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
9369 unsigned HOST_WIDE_INT arg_num
= 0;
9371 for (; args
; args
= TREE_CHAIN (args
))
9373 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
9377 if (arg_num
== param_num
)
9383 /* Check that the function argument PARAM (which is operand number
9384 PARAM_NUM) is non-null. This is called by check_function_nonnull
9385 via check_function_arguments_recurse. */
9388 check_nonnull_arg (void *ctx
, tree param
, unsigned HOST_WIDE_INT param_num
)
9390 location_t
*ploc
= (location_t
*) ctx
;
9392 /* Just skip checking the argument if it's not a pointer. This can
9393 happen if the "nonnull" attribute was given without an operand
9394 list (which means to check every pointer argument). */
9396 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
9399 if (integer_zerop (param
))
9400 warning_at (*ploc
, OPT_Wnonnull
, "null argument where non-null required "
9401 "(argument %lu)", (unsigned long) param_num
);
9404 /* Helper for nonnull attribute handling; fetch the operand number
9405 from the attribute argument list. */
9408 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
9410 /* Verify the arg number is a small constant. */
9411 if (tree_fits_uhwi_p (arg_num_expr
))
9413 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
9420 /* Handle a "nothrow" attribute; arguments as in
9421 struct attribute_spec.handler. */
9424 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9425 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9427 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9428 TREE_NOTHROW (*node
) = 1;
9429 /* ??? TODO: Support types. */
9432 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9433 *no_add_attrs
= true;
9439 /* Handle a "cleanup" attribute; arguments as in
9440 struct attribute_spec.handler. */
9443 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
9444 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9447 tree cleanup_id
, cleanup_decl
;
9449 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
9450 for global destructors in C++. This requires infrastructure that
9451 we don't have generically at the moment. It's also not a feature
9452 we'd be missing too much, since we do have attribute constructor. */
9453 if (!VAR_P (decl
) || TREE_STATIC (decl
))
9455 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9456 *no_add_attrs
= true;
9460 /* Verify that the argument is a function in scope. */
9461 /* ??? We could support pointers to functions here as well, if
9462 that was considered desirable. */
9463 cleanup_id
= TREE_VALUE (args
);
9464 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
9466 error ("cleanup argument not an identifier");
9467 *no_add_attrs
= true;
9470 cleanup_decl
= lookup_name (cleanup_id
);
9471 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
9473 error ("cleanup argument not a function");
9474 *no_add_attrs
= true;
9478 /* That the function has proper type is checked with the
9479 eventual call to build_function_call. */
9484 /* Handle a "warn_unused_result" attribute. No special handling. */
9487 handle_warn_unused_result_attribute (tree
*node
, tree name
,
9488 tree
ARG_UNUSED (args
),
9489 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9491 /* Ignore the attribute for functions not returning any value. */
9492 if (VOID_TYPE_P (TREE_TYPE (*node
)))
9494 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9495 *no_add_attrs
= true;
9501 /* Handle a "sentinel" attribute. */
9504 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
9505 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9507 if (!prototype_p (*node
))
9509 warning (OPT_Wattributes
,
9510 "%qE attribute requires prototypes with named arguments", name
);
9511 *no_add_attrs
= true;
9515 if (!stdarg_p (*node
))
9517 warning (OPT_Wattributes
,
9518 "%qE attribute only applies to variadic functions", name
);
9519 *no_add_attrs
= true;
9525 tree position
= TREE_VALUE (args
);
9526 if (position
&& TREE_CODE (position
) != IDENTIFIER_NODE
9527 && TREE_CODE (position
) != FUNCTION_DECL
)
9528 position
= default_conversion (position
);
9530 if (TREE_CODE (position
) != INTEGER_CST
9531 || !INTEGRAL_TYPE_P (TREE_TYPE (position
)))
9533 warning (OPT_Wattributes
,
9534 "requested position is not an integer constant");
9535 *no_add_attrs
= true;
9539 if (tree_int_cst_lt (position
, integer_zero_node
))
9541 warning (OPT_Wattributes
,
9542 "requested position is less than zero");
9543 *no_add_attrs
= true;
9551 /* Handle a "type_generic" attribute. */
9554 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
9555 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
9556 bool * ARG_UNUSED (no_add_attrs
))
9558 /* Ensure we have a function type. */
9559 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
9561 /* Ensure we have a variadic function. */
9562 gcc_assert (!prototype_p (*node
) || stdarg_p (*node
));
9567 /* Handle a "target" attribute. */
9570 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
9573 /* Ensure we have a function type. */
9574 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9576 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9577 *no_add_attrs
= true;
9579 else if (lookup_attribute ("target_clones", DECL_ATTRIBUTES (*node
)))
9581 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9582 "with %qs attribute", name
, "target_clones");
9583 *no_add_attrs
= true;
9585 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
9587 *no_add_attrs
= true;
9592 /* Handle a "target_clones" attribute. */
9595 handle_target_clones_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
9596 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9598 /* Ensure we have a function type. */
9599 if (TREE_CODE (*node
) == FUNCTION_DECL
)
9601 if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (*node
)))
9603 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9604 "with %qs attribute", name
, "always_inline");
9605 *no_add_attrs
= true;
9607 else if (lookup_attribute ("target", DECL_ATTRIBUTES (*node
)))
9609 warning (OPT_Wattributes
, "%qE attribute ignored due to conflict "
9610 "with %qs attribute", name
, "target");
9611 *no_add_attrs
= true;
9614 /* Do not inline functions with multiple clone targets. */
9615 DECL_UNINLINABLE (*node
) = 1;
9619 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9620 *no_add_attrs
= true;
9625 /* Arguments being collected for optimization. */
9626 typedef const char *const_char_p
; /* For DEF_VEC_P. */
9627 static GTY(()) vec
<const_char_p
, va_gc
> *optimize_args
;
9630 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
9631 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
9632 false for #pragma GCC optimize. */
9635 parse_optimize_options (tree args
, bool attr_p
)
9640 const char **opt_argv
;
9641 struct cl_decoded_option
*decoded_options
;
9642 unsigned int decoded_options_count
;
9645 /* Build up argv vector. Just in case the string is stored away, use garbage
9646 collected strings. */
9647 vec_safe_truncate (optimize_args
, 0);
9648 vec_safe_push (optimize_args
, (const char *) NULL
);
9650 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
9652 tree value
= TREE_VALUE (ap
);
9654 if (TREE_CODE (value
) == INTEGER_CST
)
9657 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
9658 vec_safe_push (optimize_args
, ggc_strdup (buffer
));
9661 else if (TREE_CODE (value
) == STRING_CST
)
9663 /* Split string into multiple substrings. */
9664 size_t len
= TREE_STRING_LENGTH (value
);
9665 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
9666 char *end
= p
+ len
;
9670 while (next_p
!= NULL
)
9676 comma
= strchr (p
, ',');
9689 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
9691 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
9693 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
9697 warning (OPT_Wattributes
,
9698 "bad option %qs to attribute %<optimize%>", p
);
9700 warning (OPT_Wpragmas
,
9701 "bad option %qs to pragma %<optimize%>", p
);
9709 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
9710 itself is -Os, and any other switch begins with a -f. */
9711 if ((*p
>= '0' && *p
<= '9')
9712 || (p
[0] == 's' && p
[1] == '\0'))
9718 memcpy (r
, p
, len2
);
9720 vec_safe_push (optimize_args
, (const char *) q
);
9726 opt_argc
= optimize_args
->length ();
9727 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
9729 for (i
= 1; i
< opt_argc
; i
++)
9730 opt_argv
[i
] = (*optimize_args
)[i
];
9732 /* Now parse the options. */
9733 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
9735 &decoded_options_count
);
9736 /* Drop non-Optimization options. */
9738 for (i
= 1; i
< decoded_options_count
; ++i
)
9740 if (! (cl_options
[decoded_options
[i
].opt_index
].flags
& CL_OPTIMIZATION
))
9744 warning (OPT_Wattributes
,
9745 "bad option %qs to attribute %<optimize%>",
9746 decoded_options
[i
].orig_option_with_args_text
);
9748 warning (OPT_Wpragmas
,
9749 "bad option %qs to pragma %<optimize%>",
9750 decoded_options
[i
].orig_option_with_args_text
);
9754 decoded_options
[j
] = decoded_options
[i
];
9757 decoded_options_count
= j
;
9758 /* And apply them. */
9759 decode_options (&global_options
, &global_options_set
,
9760 decoded_options
, decoded_options_count
,
9761 input_location
, global_dc
);
9763 targetm
.override_options_after_change();
9765 optimize_args
->truncate (0);
9769 /* For handling "optimize" attribute. arguments as in
9770 struct attribute_spec.handler. */
9773 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
9774 int ARG_UNUSED (flags
), bool *no_add_attrs
)
9776 /* Ensure we have a function type. */
9777 if (TREE_CODE (*node
) != FUNCTION_DECL
)
9779 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
9780 *no_add_attrs
= true;
9784 struct cl_optimization cur_opts
;
9785 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
9787 /* Save current options. */
9788 cl_optimization_save (&cur_opts
, &global_options
);
9790 /* If we previously had some optimization options, use them as the
9793 cl_optimization_restore (&global_options
,
9794 TREE_OPTIMIZATION (old_opts
));
9796 /* Parse options, and update the vector. */
9797 parse_optimize_options (args
, true);
9798 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
9799 = build_optimization_node (&global_options
);
9801 /* Restore current options. */
9802 cl_optimization_restore (&global_options
, &cur_opts
);
9808 /* Handle a "no_split_stack" attribute. */
9811 handle_no_split_stack_attribute (tree
*node
, tree name
,
9812 tree
ARG_UNUSED (args
),
9813 int ARG_UNUSED (flags
),
9818 if (TREE_CODE (decl
) != FUNCTION_DECL
)
9820 error_at (DECL_SOURCE_LOCATION (decl
),
9821 "%qE attribute applies only to functions", name
);
9822 *no_add_attrs
= true;
9824 else if (DECL_INITIAL (decl
))
9826 error_at (DECL_SOURCE_LOCATION (decl
),
9827 "can%'t set %qE attribute after definition", name
);
9828 *no_add_attrs
= true;
9834 /* Handle a "returns_nonnull" attribute; arguments as in
9835 struct attribute_spec.handler. */
9838 handle_returns_nonnull_attribute (tree
*node
, tree
, tree
, int,
9841 // Even without a prototype we still have a return type we can check.
9842 if (TREE_CODE (TREE_TYPE (*node
)) != POINTER_TYPE
)
9844 error ("returns_nonnull attribute on a function not returning a pointer");
9845 *no_add_attrs
= true;
9850 /* Handle a "designated_init" attribute; arguments as in
9851 struct attribute_spec.handler. */
9854 handle_designated_init_attribute (tree
*node
, tree name
, tree
, int,
9857 if (TREE_CODE (*node
) != RECORD_TYPE
)
9859 error ("%qE attribute is only valid on %<struct%> type", name
);
9860 *no_add_attrs
= true;
9866 /* Check for valid arguments being passed to a function with FNTYPE.
9867 There are NARGS arguments in the array ARGARRAY. LOC should be used for
9870 check_function_arguments (location_t loc
, const_tree fntype
, int nargs
,
9873 /* Check for null being passed in a pointer argument that must be
9874 non-null. We also need to do this if format checking is enabled. */
9877 check_function_nonnull (loc
, TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9879 /* Check for errors in format strings. */
9881 if (warn_format
|| warn_suggest_attribute_format
)
9882 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
9885 check_function_sentinel (fntype
, nargs
, argarray
);
9888 /* Generic argument checking recursion routine. PARAM is the argument to
9889 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
9890 once the argument is resolved. CTX is context for the callback. */
9892 check_function_arguments_recurse (void (*callback
)
9893 (void *, tree
, unsigned HOST_WIDE_INT
),
9894 void *ctx
, tree param
,
9895 unsigned HOST_WIDE_INT param_num
)
9897 if (CONVERT_EXPR_P (param
)
9898 && (TYPE_PRECISION (TREE_TYPE (param
))
9899 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
9901 /* Strip coercion. */
9902 check_function_arguments_recurse (callback
, ctx
,
9903 TREE_OPERAND (param
, 0), param_num
);
9907 if (TREE_CODE (param
) == CALL_EXPR
)
9909 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
9911 bool found_format_arg
= false;
9913 /* See if this is a call to a known internationalization function
9914 that modifies a format arg. Such a function may have multiple
9915 format_arg attributes (for example, ngettext). */
9917 for (attrs
= TYPE_ATTRIBUTES (type
);
9919 attrs
= TREE_CHAIN (attrs
))
9920 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
9923 tree format_num_expr
;
9926 call_expr_arg_iterator iter
;
9928 /* Extract the argument number, which was previously checked
9930 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
9932 format_num
= tree_to_uhwi (format_num_expr
);
9934 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
9936 inner_arg
= next_call_expr_arg (&iter
), i
++)
9937 if (i
== format_num
)
9939 check_function_arguments_recurse (callback
, ctx
,
9940 inner_arg
, param_num
);
9941 found_format_arg
= true;
9946 /* If we found a format_arg attribute and did a recursive check,
9947 we are done with checking this argument. Otherwise, we continue
9948 and this will be considered a non-literal. */
9949 if (found_format_arg
)
9953 if (TREE_CODE (param
) == COND_EXPR
)
9955 /* Simplify to avoid warning for an impossible case. */
9956 param
= fold_for_warn (param
);
9957 if (TREE_CODE (param
) == COND_EXPR
)
9959 /* Check both halves of the conditional expression. */
9960 check_function_arguments_recurse (callback
, ctx
,
9961 TREE_OPERAND (param
, 1),
9963 check_function_arguments_recurse (callback
, ctx
,
9964 TREE_OPERAND (param
, 2),
9970 (*callback
) (ctx
, param
, param_num
);
9973 /* Checks for a builtin function FNDECL that the number of arguments
9974 NARGS against the required number REQUIRED and issues an error if
9975 there is a mismatch. Returns true if the number of arguments is
9976 correct, otherwise false. LOC is the location of FNDECL. */
9979 builtin_function_validate_nargs (location_t loc
, tree fndecl
, int nargs
,
9982 if (nargs
< required
)
9984 error_at (loc
, "too few arguments to function %qE", fndecl
);
9987 else if (nargs
> required
)
9989 error_at (loc
, "too many arguments to function %qE", fndecl
);
9995 /* Helper macro for check_builtin_function_arguments. */
9996 #define ARG_LOCATION(N) \
9997 (arg_loc.is_empty () \
9998 ? EXPR_LOC_OR_LOC (args[(N)], input_location) \
9999 : expansion_point_location (arg_loc[(N)]))
10001 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
10002 Returns false if there was an error, otherwise true. LOC is the
10003 location of the function; ARG_LOC is a vector of locations of the
10007 check_builtin_function_arguments (location_t loc
, vec
<location_t
> arg_loc
,
10008 tree fndecl
, int nargs
, tree
*args
)
10010 if (!DECL_BUILT_IN (fndecl
)
10011 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
10014 switch (DECL_FUNCTION_CODE (fndecl
))
10016 case BUILT_IN_ALLOCA_WITH_ALIGN
:
10018 /* Get the requested alignment (in bits) if it's a constant
10019 integer expression. */
10020 unsigned HOST_WIDE_INT align
10021 = tree_fits_uhwi_p (args
[1]) ? tree_to_uhwi (args
[1]) : 0;
10023 /* Determine if the requested alignment is a power of 2. */
10024 if ((align
& (align
- 1)))
10027 /* The maximum alignment in bits corresponding to the same
10028 maximum in bytes enforced in check_user_alignment(). */
10029 unsigned maxalign
= (UINT_MAX
>> 1) + 1;
10031 /* Reject invalid alignments. */
10032 if (align
< BITS_PER_UNIT
|| maxalign
< align
)
10034 error_at (ARG_LOCATION (1),
10035 "second argument to function %qE must be a constant "
10036 "integer power of 2 between %qi and %qu bits",
10037 fndecl
, BITS_PER_UNIT
, maxalign
);
10043 case BUILT_IN_CONSTANT_P
:
10044 return builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1);
10046 case BUILT_IN_ISFINITE
:
10047 case BUILT_IN_ISINF
:
10048 case BUILT_IN_ISINF_SIGN
:
10049 case BUILT_IN_ISNAN
:
10050 case BUILT_IN_ISNORMAL
:
10051 case BUILT_IN_SIGNBIT
:
10052 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 1))
10054 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
10056 error_at (ARG_LOCATION (0), "non-floating-point argument in "
10057 "call to function %qE", fndecl
);
10064 case BUILT_IN_ISGREATER
:
10065 case BUILT_IN_ISGREATEREQUAL
:
10066 case BUILT_IN_ISLESS
:
10067 case BUILT_IN_ISLESSEQUAL
:
10068 case BUILT_IN_ISLESSGREATER
:
10069 case BUILT_IN_ISUNORDERED
:
10070 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2))
10072 enum tree_code code0
, code1
;
10073 code0
= TREE_CODE (TREE_TYPE (args
[0]));
10074 code1
= TREE_CODE (TREE_TYPE (args
[1]));
10075 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
10076 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
10077 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
10079 error_at (loc
, "non-floating-point arguments in call to "
10080 "function %qE", fndecl
);
10087 case BUILT_IN_FPCLASSIFY
:
10088 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 6))
10090 for (unsigned int i
= 0; i
< 5; i
++)
10091 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
10093 error_at (ARG_LOCATION (i
), "non-const integer argument %u in "
10094 "call to function %qE", i
+ 1, fndecl
);
10098 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
10100 error_at (ARG_LOCATION (5), "non-floating-point argument in "
10101 "call to function %qE", fndecl
);
10108 case BUILT_IN_ASSUME_ALIGNED
:
10109 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 2 + (nargs
> 2)))
10111 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
10113 error_at (ARG_LOCATION (2), "non-integer argument 3 in call to "
10114 "function %qE", fndecl
);
10121 case BUILT_IN_ADD_OVERFLOW
:
10122 case BUILT_IN_SUB_OVERFLOW
:
10123 case BUILT_IN_MUL_OVERFLOW
:
10124 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10127 for (i
= 0; i
< 2; i
++)
10128 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10130 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10131 "%qE does not have integral type", i
+ 1, fndecl
);
10134 if (TREE_CODE (TREE_TYPE (args
[2])) != POINTER_TYPE
10135 || !INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (args
[2]))))
10137 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10138 "does not have pointer to integral type", fndecl
);
10141 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == ENUMERAL_TYPE
)
10143 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10144 "has pointer to enumerated type", fndecl
);
10147 else if (TREE_CODE (TREE_TYPE (TREE_TYPE (args
[2]))) == BOOLEAN_TYPE
)
10149 error_at (ARG_LOCATION (2), "argument 3 in call to function %qE "
10150 "has pointer to boolean type", fndecl
);
10157 case BUILT_IN_ADD_OVERFLOW_P
:
10158 case BUILT_IN_SUB_OVERFLOW_P
:
10159 case BUILT_IN_MUL_OVERFLOW_P
:
10160 if (builtin_function_validate_nargs (loc
, fndecl
, nargs
, 3))
10163 for (i
= 0; i
< 3; i
++)
10164 if (!INTEGRAL_TYPE_P (TREE_TYPE (args
[i
])))
10166 error_at (ARG_LOCATION (i
), "argument %u in call to function "
10167 "%qE does not have integral type", i
+ 1, fndecl
);
10170 if (TREE_CODE (TREE_TYPE (args
[2])) == ENUMERAL_TYPE
)
10172 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10173 "%qE has enumerated type", fndecl
);
10176 else if (TREE_CODE (TREE_TYPE (args
[2])) == BOOLEAN_TYPE
)
10178 error_at (ARG_LOCATION (2), "argument 3 in call to function "
10179 "%qE has boolean type", fndecl
);
10191 /* Function to help qsort sort FIELD_DECLs by name order. */
10194 field_decl_cmp (const void *x_p
, const void *y_p
)
10196 const tree
*const x
= (const tree
*const) x_p
;
10197 const tree
*const y
= (const tree
*const) y_p
;
10199 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10200 /* A nontype is "greater" than a type. */
10201 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10202 if (DECL_NAME (*x
) == NULL_TREE
)
10204 if (DECL_NAME (*y
) == NULL_TREE
)
10206 if (DECL_NAME (*x
) < DECL_NAME (*y
))
10212 gt_pointer_operator new_value
;
10216 /* This routine compares two fields like field_decl_cmp but using the
10217 pointer operator in resort_data. */
10220 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
10222 const tree
*const x
= (const tree
*const) x_p
;
10223 const tree
*const y
= (const tree
*const) y_p
;
10225 if (DECL_NAME (*x
) == DECL_NAME (*y
))
10226 /* A nontype is "greater" than a type. */
10227 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
10228 if (DECL_NAME (*x
) == NULL_TREE
)
10230 if (DECL_NAME (*y
) == NULL_TREE
)
10233 tree d1
= DECL_NAME (*x
);
10234 tree d2
= DECL_NAME (*y
);
10235 resort_data
.new_value (&d1
, resort_data
.cookie
);
10236 resort_data
.new_value (&d2
, resort_data
.cookie
);
10243 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
10246 resort_sorted_fields (void *obj
,
10247 void * ARG_UNUSED (orig_obj
),
10248 gt_pointer_operator new_value
,
10251 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
10252 resort_data
.new_value
= new_value
;
10253 resort_data
.cookie
= cookie
;
10254 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
10255 resort_field_decl_cmp
);
10258 /* Subroutine of c_parse_error.
10259 Return the result of concatenating LHS and RHS. RHS is really
10260 a string literal, its first character is indicated by RHS_START and
10261 RHS_SIZE is its length (including the terminating NUL character).
10263 The caller is responsible for deleting the returned pointer. */
10266 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
10268 const int lhs_size
= strlen (lhs
);
10269 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
10270 strncpy (result
, lhs
, lhs_size
);
10271 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
10275 /* Issue the error given by GMSGID, indicating that it occurred before
10276 TOKEN, which had the associated VALUE. */
10279 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
10280 tree value
, unsigned char token_flags
)
10282 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
10284 char *message
= NULL
;
10286 if (token_type
== CPP_EOF
)
10287 message
= catenate_messages (gmsgid
, " at end of input");
10288 else if (token_type
== CPP_CHAR
10289 || token_type
== CPP_WCHAR
10290 || token_type
== CPP_CHAR16
10291 || token_type
== CPP_CHAR32
10292 || token_type
== CPP_UTF8CHAR
)
10294 unsigned int val
= TREE_INT_CST_LOW (value
);
10295 const char *prefix
;
10297 switch (token_type
)
10316 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
10317 message
= catenate_messages (gmsgid
, " before %s'%c'");
10319 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
10321 error (message
, prefix
, val
);
10325 else if (token_type
== CPP_CHAR_USERDEF
10326 || token_type
== CPP_WCHAR_USERDEF
10327 || token_type
== CPP_CHAR16_USERDEF
10328 || token_type
== CPP_CHAR32_USERDEF
10329 || token_type
== CPP_UTF8CHAR_USERDEF
)
10330 message
= catenate_messages (gmsgid
,
10331 " before user-defined character literal");
10332 else if (token_type
== CPP_STRING_USERDEF
10333 || token_type
== CPP_WSTRING_USERDEF
10334 || token_type
== CPP_STRING16_USERDEF
10335 || token_type
== CPP_STRING32_USERDEF
10336 || token_type
== CPP_UTF8STRING_USERDEF
)
10337 message
= catenate_messages (gmsgid
, " before user-defined string literal");
10338 else if (token_type
== CPP_STRING
10339 || token_type
== CPP_WSTRING
10340 || token_type
== CPP_STRING16
10341 || token_type
== CPP_STRING32
10342 || token_type
== CPP_UTF8STRING
)
10343 message
= catenate_messages (gmsgid
, " before string constant");
10344 else if (token_type
== CPP_NUMBER
)
10345 message
= catenate_messages (gmsgid
, " before numeric constant");
10346 else if (token_type
== CPP_NAME
)
10348 message
= catenate_messages (gmsgid
, " before %qE");
10349 error (message
, value
);
10353 else if (token_type
== CPP_PRAGMA
)
10354 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
10355 else if (token_type
== CPP_PRAGMA_EOL
)
10356 message
= catenate_messages (gmsgid
, " before end of line");
10357 else if (token_type
== CPP_DECLTYPE
)
10358 message
= catenate_messages (gmsgid
, " before %<decltype%>");
10359 else if (token_type
< N_TTYPES
)
10361 message
= catenate_messages (gmsgid
, " before %qs token");
10362 error (message
, cpp_type2name (token_type
, token_flags
));
10374 #undef catenate_messages
10377 /* Return the gcc option code associated with the reason for a cpp
10378 message, or 0 if none. */
10381 c_option_controlling_cpp_error (int reason
)
10383 const struct cpp_reason_option_codes_t
*entry
;
10385 for (entry
= cpp_reason_option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
10387 if (entry
->reason
== reason
)
10388 return entry
->option_code
;
10393 /* Callback from cpp_error for PFILE to print diagnostics from the
10394 preprocessor. The diagnostic is of type LEVEL, with REASON set
10395 to the reason code if LEVEL is represents a warning, at location
10396 RICHLOC unless this is after lexing and the compiler's location
10397 should be used instead; MSG is the translated message and AP
10398 the arguments. Returns true if a diagnostic was emitted, false
10402 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
10403 rich_location
*richloc
,
10404 const char *msg
, va_list *ap
)
10406 diagnostic_info diagnostic
;
10407 diagnostic_t dlevel
;
10408 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
10413 case CPP_DL_WARNING_SYSHDR
:
10414 if (flag_no_output
)
10416 global_dc
->dc_warn_system_headers
= 1;
10417 /* Fall through. */
10418 case CPP_DL_WARNING
:
10419 if (flag_no_output
)
10421 dlevel
= DK_WARNING
;
10423 case CPP_DL_PEDWARN
:
10424 if (flag_no_output
&& !flag_pedantic_errors
)
10426 dlevel
= DK_PEDWARN
;
10441 gcc_unreachable ();
10444 richloc
->set_range (line_table
, 0, input_location
, true);
10445 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
10447 diagnostic_override_option_index (&diagnostic
,
10448 c_option_controlling_cpp_error (reason
));
10449 ret
= report_diagnostic (&diagnostic
);
10450 if (level
== CPP_DL_WARNING_SYSHDR
)
10451 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
10455 /* Convert a character from the host to the target execution character
10456 set. cpplib handles this, mostly. */
10459 c_common_to_target_charset (HOST_WIDE_INT c
)
10461 /* Character constants in GCC proper are sign-extended under -fsigned-char,
10462 zero-extended under -fno-signed-char. cpplib insists that characters
10463 and character constants are always unsigned. Hence we must convert
10465 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
10467 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
10469 if (flag_signed_char
)
10470 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
10471 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
10476 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
10477 references with an INDIRECT_REF of a constant at the bottom; much like the
10478 traditional rendering of offsetof as a macro. Return the folded result. */
10481 fold_offsetof_1 (tree expr
, enum tree_code ctx
)
10484 tree_code code
= TREE_CODE (expr
);
10491 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
10492 return error_mark_node
;
10496 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
10497 return error_mark_node
;
10501 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
10503 error ("cannot apply %<offsetof%> to a non constant address");
10504 return error_mark_node
;
10506 return TREE_OPERAND (expr
, 0);
10508 case COMPONENT_REF
:
10509 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10510 if (base
== error_mark_node
)
10513 t
= TREE_OPERAND (expr
, 1);
10514 if (DECL_C_BIT_FIELD (t
))
10516 error ("attempt to take address of bit-field structure "
10518 return error_mark_node
;
10520 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
10521 size_int (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (t
))
10526 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), code
);
10527 if (base
== error_mark_node
)
10530 t
= TREE_OPERAND (expr
, 1);
10532 /* Check if the offset goes beyond the upper bound of the array. */
10533 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
10535 tree upbound
= array_ref_up_bound (expr
);
10536 if (upbound
!= NULL_TREE
10537 && TREE_CODE (upbound
) == INTEGER_CST
10538 && !tree_int_cst_equal (upbound
,
10539 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
10541 if (ctx
!= ARRAY_REF
&& ctx
!= COMPONENT_REF
)
10542 upbound
= size_binop (PLUS_EXPR
, upbound
,
10543 build_int_cst (TREE_TYPE (upbound
), 1));
10544 if (tree_int_cst_lt (upbound
, t
))
10548 for (v
= TREE_OPERAND (expr
, 0);
10549 TREE_CODE (v
) == COMPONENT_REF
;
10550 v
= TREE_OPERAND (v
, 0))
10551 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
10554 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
10555 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
10556 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
10562 /* Don't warn if the array might be considered a poor
10563 man's flexible array member with a very permissive
10564 definition thereof. */
10565 if (TREE_CODE (v
) == ARRAY_REF
10566 || TREE_CODE (v
) == COMPONENT_REF
)
10567 warning (OPT_Warray_bounds
,
10568 "index %E denotes an offset "
10569 "greater than size of %qT",
10570 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
10575 t
= convert (sizetype
, t
);
10576 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
10579 case COMPOUND_EXPR
:
10580 /* Handle static members of volatile structs. */
10581 t
= TREE_OPERAND (expr
, 1);
10582 gcc_assert (VAR_P (t
));
10583 return fold_offsetof_1 (t
);
10586 gcc_unreachable ();
10589 return fold_build_pointer_plus (base
, off
);
10592 /* Likewise, but convert it to the return type of offsetof. */
10595 fold_offsetof (tree expr
)
10597 return convert (size_type_node
, fold_offsetof_1 (expr
));
10600 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
10601 expression, because B will always be true. */
10604 warn_for_omitted_condop (location_t location
, tree cond
)
10606 /* In C++ template declarations it can happen that the type is dependent
10607 and not yet known, thus TREE_TYPE (cond) == NULL_TREE. */
10608 if (truth_value_p (TREE_CODE (cond
))
10609 || (TREE_TYPE (cond
) != NULL_TREE
10610 && TREE_CODE (TREE_TYPE (cond
)) == BOOLEAN_TYPE
))
10611 warning_at (location
, OPT_Wparentheses
,
10612 "the omitted middle operand in ?: will always be %<true%>, "
10613 "suggest explicit middle operand");
10616 /* Give an error for storing into ARG, which is 'const'. USE indicates
10617 how ARG was being used. */
10620 readonly_error (location_t loc
, tree arg
, enum lvalue_use use
)
10622 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
10624 /* Using this macro rather than (for example) arrays of messages
10625 ensures that all the format strings are checked at compile
10627 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
10628 : (use == lv_increment ? (I) \
10629 : (use == lv_decrement ? (D) : (AS))))
10630 if (TREE_CODE (arg
) == COMPONENT_REF
)
10632 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
10633 error_at (loc
, READONLY_MSG (G_("assignment of member "
10634 "%qD in read-only object"),
10635 G_("increment of member "
10636 "%qD in read-only object"),
10637 G_("decrement of member "
10638 "%qD in read-only object"),
10639 G_("member %qD in read-only object "
10640 "used as %<asm%> output")),
10641 TREE_OPERAND (arg
, 1));
10643 error_at (loc
, READONLY_MSG (G_("assignment of read-only member %qD"),
10644 G_("increment of read-only member %qD"),
10645 G_("decrement of read-only member %qD"),
10646 G_("read-only member %qD used as %<asm%> output")),
10647 TREE_OPERAND (arg
, 1));
10649 else if (VAR_P (arg
))
10650 error_at (loc
, READONLY_MSG (G_("assignment of read-only variable %qD"),
10651 G_("increment of read-only variable %qD"),
10652 G_("decrement of read-only variable %qD"),
10653 G_("read-only variable %qD used as %<asm%> output")),
10655 else if (TREE_CODE (arg
) == PARM_DECL
)
10656 error_at (loc
, READONLY_MSG (G_("assignment of read-only parameter %qD"),
10657 G_("increment of read-only parameter %qD"),
10658 G_("decrement of read-only parameter %qD"),
10659 G_("read-only parameter %qD use as %<asm%> output")),
10661 else if (TREE_CODE (arg
) == RESULT_DECL
)
10663 gcc_assert (c_dialect_cxx ());
10664 error_at (loc
, READONLY_MSG (G_("assignment of "
10665 "read-only named return value %qD"),
10667 "read-only named return value %qD"),
10669 "read-only named return value %qD"),
10670 G_("read-only named return value %qD "
10671 "used as %<asm%>output")),
10674 else if (TREE_CODE (arg
) == FUNCTION_DECL
)
10675 error_at (loc
, READONLY_MSG (G_("assignment of function %qD"),
10676 G_("increment of function %qD"),
10677 G_("decrement of function %qD"),
10678 G_("function %qD used as %<asm%> output")),
10681 error_at (loc
, READONLY_MSG (G_("assignment of read-only location %qE"),
10682 G_("increment of read-only location %qE"),
10683 G_("decrement of read-only location %qE"),
10684 G_("read-only location %qE used as %<asm%> output")),
10688 /* Print an error message for an invalid lvalue. USE says
10689 how the lvalue is being used and so selects the error message. LOC
10690 is the location for the error. */
10693 lvalue_error (location_t loc
, enum lvalue_use use
)
10698 error_at (loc
, "lvalue required as left operand of assignment");
10701 error_at (loc
, "lvalue required as increment operand");
10704 error_at (loc
, "lvalue required as decrement operand");
10707 error_at (loc
, "lvalue required as unary %<&%> operand");
10710 error_at (loc
, "lvalue required in asm statement");
10713 gcc_unreachable ();
10717 /* Print an error message for an invalid indirection of type TYPE.
10718 ERRSTRING is the name of the operator for the indirection. */
10721 invalid_indirection_error (location_t loc
, tree type
, ref_operator errstring
)
10726 gcc_assert (c_dialect_cxx ());
10727 error_at (loc
, "invalid type argument (have %qT)", type
);
10729 case RO_ARRAY_INDEXING
:
10731 "invalid type argument of array indexing (have %qT)",
10734 case RO_UNARY_STAR
:
10736 "invalid type argument of unary %<*%> (have %qT)",
10741 "invalid type argument of %<->%> (have %qT)",
10744 case RO_ARROW_STAR
:
10746 "invalid type argument of %<->*%> (have %qT)",
10749 case RO_IMPLICIT_CONVERSION
:
10751 "invalid type argument of implicit conversion (have %qT)",
10755 gcc_unreachable ();
10759 /* *PTYPE is an incomplete array. Complete it with a domain based on
10760 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
10761 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
10762 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
10765 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
10767 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
10768 int failure
= 0, quals
;
10769 hashval_t hashcode
= 0;
10770 bool overflow_p
= false;
10772 maxindex
= size_zero_node
;
10775 if (TREE_CODE (initial_value
) == STRING_CST
)
10778 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
10779 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
10781 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
10783 vec
<constructor_elt
, va_gc
> *v
= CONSTRUCTOR_ELTS (initial_value
);
10785 if (vec_safe_is_empty (v
))
10789 maxindex
= ssize_int (-1);
10794 unsigned HOST_WIDE_INT cnt
;
10795 constructor_elt
*ce
;
10796 bool fold_p
= false;
10799 maxindex
= (*v
)[0].index
, fold_p
= true;
10801 curindex
= maxindex
;
10803 for (cnt
= 1; vec_safe_iterate (v
, cnt
, &ce
); cnt
++)
10805 bool curfold_p
= false;
10807 curindex
= ce
->index
, curfold_p
= true;
10812 /* Since we treat size types now as ordinary
10813 unsigned types, we need an explicit overflow
10815 tree orig
= curindex
;
10816 curindex
= fold_convert (sizetype
, curindex
);
10817 overflow_p
|= tree_int_cst_lt (curindex
, orig
);
10819 curindex
= size_binop (PLUS_EXPR
, curindex
,
10822 if (tree_int_cst_lt (maxindex
, curindex
))
10823 maxindex
= curindex
, fold_p
= curfold_p
;
10827 tree orig
= maxindex
;
10828 maxindex
= fold_convert (sizetype
, maxindex
);
10829 overflow_p
|= tree_int_cst_lt (maxindex
, orig
);
10835 /* Make an error message unless that happened already. */
10836 if (initial_value
!= error_mark_node
)
10848 elt
= TREE_TYPE (type
);
10849 quals
= TYPE_QUALS (strip_array_types (elt
));
10853 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
10855 /* Using build_distinct_type_copy and modifying things afterward instead
10856 of using build_array_type to create a new type preserves all of the
10857 TYPE_LANG_FLAG_? bits that the front end may have set. */
10858 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
10859 TREE_TYPE (main_type
) = unqual_elt
;
10860 TYPE_DOMAIN (main_type
)
10861 = build_range_type (TREE_TYPE (maxindex
),
10862 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
10863 layout_type (main_type
);
10865 /* Make sure we have the canonical MAIN_TYPE. */
10866 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
10867 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
10869 main_type
= type_hash_canon (hashcode
, main_type
);
10871 /* Fix the canonical type. */
10872 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
10873 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
10874 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
10875 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
10876 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
10877 != TYPE_DOMAIN (main_type
)))
10878 TYPE_CANONICAL (main_type
)
10879 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
10880 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
10882 TYPE_CANONICAL (main_type
) = main_type
;
10887 type
= c_build_qualified_type (main_type
, quals
);
10889 if (COMPLETE_TYPE_P (type
)
10890 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
10891 && (overflow_p
|| TREE_OVERFLOW (TYPE_SIZE_UNIT (type
))))
10893 error ("size of array is too large");
10894 /* If we proceed with the array type as it is, we'll eventually
10895 crash in tree_to_[su]hwi(). */
10896 type
= error_mark_node
;
10903 /* Like c_mark_addressable but don't check register qualifier. */
10905 c_common_mark_addressable_vec (tree t
)
10907 while (handled_component_p (t
))
10908 t
= TREE_OPERAND (t
, 0);
10910 && TREE_CODE (t
) != PARM_DECL
10911 && TREE_CODE (t
) != COMPOUND_LITERAL_EXPR
)
10913 TREE_ADDRESSABLE (t
) = 1;
10918 /* Used to help initialize the builtin-types.def table. When a type of
10919 the correct size doesn't exist, use error_mark_node instead of NULL.
10920 The later results in segfaults even when a decl using the type doesn't
10924 builtin_type_for_size (int size
, bool unsignedp
)
10926 tree type
= c_common_type_for_size (size
, unsignedp
);
10927 return type
? type
: error_mark_node
;
10930 /* A helper function for resolve_overloaded_builtin in resolving the
10931 overloaded __sync_ builtins. Returns a positive power of 2 if the
10932 first operand of PARAMS is a pointer to a supported data type.
10933 Returns 0 if an error is encountered.
10934 FETCH is true when FUNCTION is one of the _FETCH_OP_ or _OP_FETCH_
10938 sync_resolve_size (tree function
, vec
<tree
, va_gc
> *params
, bool fetch
)
10940 /* Type of the argument. */
10942 /* Type the argument points to. */
10946 if (vec_safe_is_empty (params
))
10948 error ("too few arguments to function %qE", function
);
10952 argtype
= type
= TREE_TYPE ((*params
)[0]);
10953 if (TREE_CODE (type
) == ARRAY_TYPE
)
10955 /* Force array-to-pointer decay for C++. */
10956 gcc_assert (c_dialect_cxx());
10957 (*params
)[0] = default_conversion ((*params
)[0]);
10958 type
= TREE_TYPE ((*params
)[0]);
10960 if (TREE_CODE (type
) != POINTER_TYPE
)
10963 type
= TREE_TYPE (type
);
10964 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
10967 if (fetch
&& TREE_CODE (type
) == BOOLEAN_TYPE
)
10970 size
= tree_to_uhwi (TYPE_SIZE_UNIT (type
));
10971 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
10975 /* Issue the diagnostic only if the argument is valid, otherwise
10976 it would be redundant at best and could be misleading. */
10977 if (argtype
!= error_mark_node
)
10978 error ("operand type %qT is incompatible with argument %d of %qE",
10979 argtype
, 1, function
);
10983 /* A helper function for resolve_overloaded_builtin. Adds casts to
10984 PARAMS to make arguments match up with those of FUNCTION. Drops
10985 the variadic arguments at the end. Returns false if some error
10986 was encountered; true on success. */
10989 sync_resolve_params (location_t loc
, tree orig_function
, tree function
,
10990 vec
<tree
, va_gc
> *params
, bool orig_format
)
10992 function_args_iterator iter
;
10994 unsigned int parmnum
;
10996 function_args_iter_init (&iter
, TREE_TYPE (function
));
10997 /* We've declared the implementation functions to use "volatile void *"
10998 as the pointer parameter, so we shouldn't get any complaints from the
10999 call to check_function_arguments what ever type the user used. */
11000 function_args_iter_next (&iter
);
11001 ptype
= TREE_TYPE (TREE_TYPE ((*params
)[0]));
11002 ptype
= TYPE_MAIN_VARIANT (ptype
);
11004 /* For the rest of the values, we need to cast these to FTYPE, so that we
11005 don't get warnings for passing pointer types, etc. */
11009 tree val
, arg_type
;
11011 arg_type
= function_args_iter_cond (&iter
);
11012 /* XXX void_type_node belies the abstraction. */
11013 if (arg_type
== void_type_node
)
11017 if (params
->length () <= parmnum
)
11019 error_at (loc
, "too few arguments to function %qE", orig_function
);
11023 /* Only convert parameters if arg_type is unsigned integer type with
11024 new format sync routines, i.e. don't attempt to convert pointer
11025 arguments (e.g. EXPECTED argument of __atomic_compare_exchange_n),
11026 bool arguments (e.g. WEAK argument) or signed int arguments (memmodel
11028 if (TREE_CODE (arg_type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (arg_type
))
11030 /* Ideally for the first conversion we'd use convert_for_assignment
11031 so that we get warnings for anything that doesn't match the pointer
11032 type. This isn't portable across the C and C++ front ends atm. */
11033 val
= (*params
)[parmnum
];
11034 val
= convert (ptype
, val
);
11035 val
= convert (arg_type
, val
);
11036 (*params
)[parmnum
] = val
;
11039 function_args_iter_next (&iter
);
11042 /* __atomic routines are not variadic. */
11043 if (!orig_format
&& params
->length () != parmnum
+ 1)
11045 error_at (loc
, "too many arguments to function %qE", orig_function
);
11049 /* The definition of these primitives is variadic, with the remaining
11050 being "an optional list of variables protected by the memory barrier".
11051 No clue what that's supposed to mean, precisely, but we consider all
11052 call-clobbered variables to be protected so we're safe. */
11053 params
->truncate (parmnum
+ 1);
11058 /* A helper function for resolve_overloaded_builtin. Adds a cast to
11059 RESULT to make it match the type of the first pointer argument in
11063 sync_resolve_return (tree first_param
, tree result
, bool orig_format
)
11065 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
11066 tree rtype
= TREE_TYPE (result
);
11067 ptype
= TYPE_MAIN_VARIANT (ptype
);
11069 /* New format doesn't require casting unless the types are the same size. */
11070 if (orig_format
|| tree_int_cst_equal (TYPE_SIZE (ptype
), TYPE_SIZE (rtype
)))
11071 return convert (ptype
, result
);
11076 /* This function verifies the PARAMS to generic atomic FUNCTION.
11077 It returns the size if all the parameters are the same size, otherwise
11078 0 is returned if the parameters are invalid. */
11081 get_atomic_generic_size (location_t loc
, tree function
,
11082 vec
<tree
, va_gc
> *params
)
11084 unsigned int n_param
;
11085 unsigned int n_model
;
11090 /* Determine the parameter makeup. */
11091 switch (DECL_FUNCTION_CODE (function
))
11093 case BUILT_IN_ATOMIC_EXCHANGE
:
11097 case BUILT_IN_ATOMIC_LOAD
:
11098 case BUILT_IN_ATOMIC_STORE
:
11102 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11107 gcc_unreachable ();
11110 if (vec_safe_length (params
) != n_param
)
11112 error_at (loc
, "incorrect number of arguments to function %qE", function
);
11116 /* Get type of first parameter, and determine its size. */
11117 type_0
= TREE_TYPE ((*params
)[0]);
11118 if (TREE_CODE (type_0
) == ARRAY_TYPE
)
11120 /* Force array-to-pointer decay for C++. */
11121 gcc_assert (c_dialect_cxx());
11122 (*params
)[0] = default_conversion ((*params
)[0]);
11123 type_0
= TREE_TYPE ((*params
)[0]);
11125 if (TREE_CODE (type_0
) != POINTER_TYPE
|| VOID_TYPE_P (TREE_TYPE (type_0
)))
11127 error_at (loc
, "argument 1 of %qE must be a non-void pointer type",
11132 /* Types must be compile time constant sizes. */
11133 if (TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type_0
)))) != INTEGER_CST
)
11136 "argument 1 of %qE must be a pointer to a constant size type",
11141 size_0
= tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (type_0
)));
11143 /* Zero size objects are not allowed. */
11147 "argument 1 of %qE must be a pointer to a nonzero size object",
11152 /* Check each other parameter is a pointer and the same size. */
11153 for (x
= 0; x
< n_param
- n_model
; x
++)
11156 tree type
= TREE_TYPE ((*params
)[x
]);
11157 /* __atomic_compare_exchange has a bool in the 4th position, skip it. */
11158 if (n_param
== 6 && x
== 3)
11160 if (!POINTER_TYPE_P (type
))
11162 error_at (loc
, "argument %d of %qE must be a pointer type", x
+ 1,
11166 else if (TYPE_SIZE_UNIT (TREE_TYPE (type
))
11167 && TREE_CODE ((TYPE_SIZE_UNIT (TREE_TYPE (type
))))
11170 error_at (loc
, "argument %d of %qE must be a pointer to a constant "
11171 "size type", x
+ 1, function
);
11174 else if (FUNCTION_POINTER_TYPE_P (type
))
11176 error_at (loc
, "argument %d of %qE must not be a pointer to a "
11177 "function", x
+ 1, function
);
11180 tree type_size
= TYPE_SIZE_UNIT (TREE_TYPE (type
));
11181 size
= type_size
? tree_to_uhwi (type_size
) : 0;
11182 if (size
!= size_0
)
11184 error_at (loc
, "size mismatch in argument %d of %qE", x
+ 1,
11190 /* Check memory model parameters for validity. */
11191 for (x
= n_param
- n_model
; x
< n_param
; x
++)
11193 tree p
= (*params
)[x
];
11194 if (TREE_CODE (p
) == INTEGER_CST
)
11196 int i
= tree_to_uhwi (p
);
11197 if (i
< 0 || (memmodel_base (i
) >= MEMMODEL_LAST
))
11199 warning_at (loc
, OPT_Winvalid_memory_model
,
11200 "invalid memory model argument %d of %qE", x
+ 1,
11205 if (!INTEGRAL_TYPE_P (TREE_TYPE (p
)))
11207 error_at (loc
, "non-integer memory model argument %d of %qE", x
+ 1,
11217 /* This will take an __atomic_ generic FUNCTION call, and add a size parameter N
11218 at the beginning of the parameter list PARAMS representing the size of the
11219 objects. This is to match the library ABI requirement. LOC is the location
11220 of the function call.
11221 The new function is returned if it needed rebuilding, otherwise NULL_TREE is
11222 returned to allow the external call to be constructed. */
11225 add_atomic_size_parameter (unsigned n
, location_t loc
, tree function
,
11226 vec
<tree
, va_gc
> *params
)
11230 /* Insert a SIZE_T parameter as the first param. If there isn't
11231 enough space, allocate a new vector and recursively re-build with that. */
11232 if (!params
->space (1))
11234 unsigned int z
, len
;
11235 vec
<tree
, va_gc
> *v
;
11238 len
= params
->length ();
11239 vec_alloc (v
, len
+ 1);
11240 v
->quick_push (build_int_cst (size_type_node
, n
));
11241 for (z
= 0; z
< len
; z
++)
11242 v
->quick_push ((*params
)[z
]);
11243 f
= build_function_call_vec (loc
, vNULL
, function
, v
, NULL
);
11248 /* Add the size parameter and leave as a function call for processing. */
11249 size_node
= build_int_cst (size_type_node
, n
);
11250 params
->quick_insert (0, size_node
);
11255 /* Return whether atomic operations for naturally aligned N-byte
11256 arguments are supported, whether inline or through libatomic. */
11258 atomic_size_supported_p (int n
)
11269 return targetm
.scalar_mode_supported_p (TImode
);
11276 /* This will process an __atomic_exchange function call, determine whether it
11277 needs to be mapped to the _N variation, or turned into a library call.
11278 LOC is the location of the builtin call.
11279 FUNCTION is the DECL that has been invoked;
11280 PARAMS is the argument list for the call. The return value is non-null
11281 TRUE is returned if it is translated into the proper format for a call to the
11282 external library, and NEW_RETURN is set the tree for that function.
11283 FALSE is returned if processing for the _N variation is required, and
11284 NEW_RETURN is set to the return value the result is copied into. */
11286 resolve_overloaded_atomic_exchange (location_t loc
, tree function
,
11287 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11289 tree p0
, p1
, p2
, p3
;
11290 tree I_type
, I_type_ptr
;
11291 int n
= get_atomic_generic_size (loc
, function
, params
);
11293 /* Size of 0 is an error condition. */
11296 *new_return
= error_mark_node
;
11300 /* If not a lock-free size, change to the library generic format. */
11301 if (!atomic_size_supported_p (n
))
11303 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11307 /* Otherwise there is a lockfree match, transform the call from:
11308 void fn(T* mem, T* desired, T* return, model)
11310 *return = (T) (fn (In* mem, (In) *desired, model)) */
11317 /* Create pointer to appropriate size. */
11318 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11319 I_type_ptr
= build_pointer_type (I_type
);
11321 /* Convert object pointer to required type. */
11322 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11324 /* Convert new value to required type, and dereference it. */
11325 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11326 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11329 /* Move memory model to the 3rd position, and end param list. */
11331 params
->truncate (3);
11333 /* Convert return pointer and dereference it for later assignment. */
11334 *new_return
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11340 /* This will process an __atomic_compare_exchange function call, determine
11341 whether it needs to be mapped to the _N variation, or turned into a lib call.
11342 LOC is the location of the builtin call.
11343 FUNCTION is the DECL that has been invoked;
11344 PARAMS is the argument list for the call. The return value is non-null
11345 TRUE is returned if it is translated into the proper format for a call to the
11346 external library, and NEW_RETURN is set the tree for that function.
11347 FALSE is returned if processing for the _N variation is required. */
11350 resolve_overloaded_atomic_compare_exchange (location_t loc
, tree function
,
11351 vec
<tree
, va_gc
> *params
,
11355 tree I_type
, I_type_ptr
;
11356 int n
= get_atomic_generic_size (loc
, function
, params
);
11358 /* Size of 0 is an error condition. */
11361 *new_return
= error_mark_node
;
11365 /* If not a lock-free size, change to the library generic format. */
11366 if (!atomic_size_supported_p (n
))
11368 /* The library generic format does not have the weak parameter, so
11369 remove it from the param list. Since a parameter has been removed,
11370 we can be sure that there is room for the SIZE_T parameter, meaning
11371 there will not be a recursive rebuilding of the parameter list, so
11372 there is no danger this will be done twice. */
11375 (*params
)[3] = (*params
)[4];
11376 (*params
)[4] = (*params
)[5];
11377 params
->truncate (5);
11379 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11383 /* Otherwise, there is a match, so the call needs to be transformed from:
11384 bool fn(T* mem, T* desired, T* return, weak, success, failure)
11386 bool fn ((In *)mem, (In *)expected, (In) *desired, weak, succ, fail) */
11392 /* Create pointer to appropriate size. */
11393 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11394 I_type_ptr
= build_pointer_type (I_type
);
11396 /* Convert object pointer to required type. */
11397 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11400 /* Convert expected pointer to required type. */
11401 p1
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p1
);
11404 /* Convert desired value to required type, and dereference it. */
11405 p2
= build_indirect_ref (loc
, p2
, RO_UNARY_STAR
);
11406 p2
= build1 (VIEW_CONVERT_EXPR
, I_type
, p2
);
11409 /* The rest of the parameters are fine. NULL means no special return value
11411 *new_return
= NULL
;
11416 /* This will process an __atomic_load function call, determine whether it
11417 needs to be mapped to the _N variation, or turned into a library call.
11418 LOC is the location of the builtin call.
11419 FUNCTION is the DECL that has been invoked;
11420 PARAMS is the argument list for the call. The return value is non-null
11421 TRUE is returned if it is translated into the proper format for a call to the
11422 external library, and NEW_RETURN is set the tree for that function.
11423 FALSE is returned if processing for the _N variation is required, and
11424 NEW_RETURN is set to the return value the result is copied into. */
11427 resolve_overloaded_atomic_load (location_t loc
, tree function
,
11428 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11431 tree I_type
, I_type_ptr
;
11432 int n
= get_atomic_generic_size (loc
, function
, params
);
11434 /* Size of 0 is an error condition. */
11437 *new_return
= error_mark_node
;
11441 /* If not a lock-free size, change to the library generic format. */
11442 if (!atomic_size_supported_p (n
))
11444 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11448 /* Otherwise, there is a match, so the call needs to be transformed from:
11449 void fn(T* mem, T* return, model)
11451 *return = (T) (fn ((In *) mem, model)) */
11457 /* Create pointer to appropriate size. */
11458 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11459 I_type_ptr
= build_pointer_type (I_type
);
11461 /* Convert object pointer to required type. */
11462 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11465 /* Move memory model to the 2nd position, and end param list. */
11467 params
->truncate (2);
11469 /* Convert return pointer and dereference it for later assignment. */
11470 *new_return
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11476 /* This will process an __atomic_store function call, determine whether it
11477 needs to be mapped to the _N variation, or turned into a library call.
11478 LOC is the location of the builtin call.
11479 FUNCTION is the DECL that has been invoked;
11480 PARAMS is the argument list for the call. The return value is non-null
11481 TRUE is returned if it is translated into the proper format for a call to the
11482 external library, and NEW_RETURN is set the tree for that function.
11483 FALSE is returned if processing for the _N variation is required, and
11484 NEW_RETURN is set to the return value the result is copied into. */
11487 resolve_overloaded_atomic_store (location_t loc
, tree function
,
11488 vec
<tree
, va_gc
> *params
, tree
*new_return
)
11491 tree I_type
, I_type_ptr
;
11492 int n
= get_atomic_generic_size (loc
, function
, params
);
11494 /* Size of 0 is an error condition. */
11497 *new_return
= error_mark_node
;
11501 /* If not a lock-free size, change to the library generic format. */
11502 if (!atomic_size_supported_p (n
))
11504 *new_return
= add_atomic_size_parameter (n
, loc
, function
, params
);
11508 /* Otherwise, there is a match, so the call needs to be transformed from:
11509 void fn(T* mem, T* value, model)
11511 fn ((In *) mem, (In) *value, model) */
11516 /* Create pointer to appropriate size. */
11517 I_type
= builtin_type_for_size (BITS_PER_UNIT
* n
, 1);
11518 I_type_ptr
= build_pointer_type (I_type
);
11520 /* Convert object pointer to required type. */
11521 p0
= build1 (VIEW_CONVERT_EXPR
, I_type_ptr
, p0
);
11524 /* Convert new value to required type, and dereference it. */
11525 p1
= build_indirect_ref (loc
, p1
, RO_UNARY_STAR
);
11526 p1
= build1 (VIEW_CONVERT_EXPR
, I_type
, p1
);
11529 /* The memory model is in the right spot already. Return is void. */
11530 *new_return
= NULL_TREE
;
11536 /* Some builtin functions are placeholders for other expressions. This
11537 function should be called immediately after parsing the call expression
11538 before surrounding code has committed to the type of the expression.
11540 LOC is the location of the builtin call.
11542 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
11543 PARAMS is the argument list for the call. The return value is non-null
11544 when expansion is complete, and null if normal processing should
11548 resolve_overloaded_builtin (location_t loc
, tree function
,
11549 vec
<tree
, va_gc
> *params
)
11551 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
11553 /* Is function one of the _FETCH_OP_ or _OP_FETCH_ built-ins?
11554 Those are not valid to call with a pointer to _Bool (or C++ bool)
11555 and so must be rejected. */
11556 bool fetch_op
= true;
11557 bool orig_format
= true;
11558 tree new_return
= NULL_TREE
;
11560 switch (DECL_BUILT_IN_CLASS (function
))
11562 case BUILT_IN_NORMAL
:
11565 if (targetm
.resolve_overloaded_builtin
)
11566 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
11573 /* Handle BUILT_IN_NORMAL here. */
11576 case BUILT_IN_ATOMIC_EXCHANGE
:
11577 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11578 case BUILT_IN_ATOMIC_LOAD
:
11579 case BUILT_IN_ATOMIC_STORE
:
11581 /* Handle these 4 together so that they can fall through to the next
11582 case if the call is transformed to an _N variant. */
11585 case BUILT_IN_ATOMIC_EXCHANGE
:
11587 if (resolve_overloaded_atomic_exchange (loc
, function
, params
,
11590 /* Change to the _N variant. */
11591 orig_code
= BUILT_IN_ATOMIC_EXCHANGE_N
;
11595 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE
:
11597 if (resolve_overloaded_atomic_compare_exchange (loc
, function
,
11601 /* Change to the _N variant. */
11602 orig_code
= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
;
11605 case BUILT_IN_ATOMIC_LOAD
:
11607 if (resolve_overloaded_atomic_load (loc
, function
, params
,
11610 /* Change to the _N variant. */
11611 orig_code
= BUILT_IN_ATOMIC_LOAD_N
;
11614 case BUILT_IN_ATOMIC_STORE
:
11616 if (resolve_overloaded_atomic_store (loc
, function
, params
,
11619 /* Change to the _N variant. */
11620 orig_code
= BUILT_IN_ATOMIC_STORE_N
;
11624 gcc_unreachable ();
11628 case BUILT_IN_ATOMIC_EXCHANGE_N
:
11629 case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
:
11630 case BUILT_IN_ATOMIC_LOAD_N
:
11631 case BUILT_IN_ATOMIC_STORE_N
:
11634 case BUILT_IN_ATOMIC_ADD_FETCH_N
:
11635 case BUILT_IN_ATOMIC_SUB_FETCH_N
:
11636 case BUILT_IN_ATOMIC_AND_FETCH_N
:
11637 case BUILT_IN_ATOMIC_NAND_FETCH_N
:
11638 case BUILT_IN_ATOMIC_XOR_FETCH_N
:
11639 case BUILT_IN_ATOMIC_OR_FETCH_N
:
11640 case BUILT_IN_ATOMIC_FETCH_ADD_N
:
11641 case BUILT_IN_ATOMIC_FETCH_SUB_N
:
11642 case BUILT_IN_ATOMIC_FETCH_AND_N
:
11643 case BUILT_IN_ATOMIC_FETCH_NAND_N
:
11644 case BUILT_IN_ATOMIC_FETCH_XOR_N
:
11645 case BUILT_IN_ATOMIC_FETCH_OR_N
:
11646 orig_format
= false;
11648 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
11649 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
11650 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
11651 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
11652 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
11653 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
11654 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
11655 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
11656 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
11657 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
11658 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
11659 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
11660 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
11661 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
11662 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
11663 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
11665 /* The following are not _FETCH_OPs and must be accepted with
11666 pointers to _Bool (or C++ bool). */
11669 (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11670 && orig_code
!= BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
11671 && orig_code
!= BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
11672 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
);
11674 int n
= sync_resolve_size (function
, params
, fetch_op
);
11675 tree new_function
, first_param
, result
;
11676 enum built_in_function fncode
;
11679 return error_mark_node
;
11681 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
11682 new_function
= builtin_decl_explicit (fncode
);
11683 if (!sync_resolve_params (loc
, function
, new_function
, params
,
11685 return error_mark_node
;
11687 first_param
= (*params
)[0];
11688 result
= build_function_call_vec (loc
, vNULL
, new_function
, params
,
11690 if (result
== error_mark_node
)
11692 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
11693 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
11694 && orig_code
!= BUILT_IN_ATOMIC_STORE_N
11695 && orig_code
!= BUILT_IN_ATOMIC_COMPARE_EXCHANGE_N
)
11696 result
= sync_resolve_return (first_param
, result
, orig_format
);
11699 /* Prevent -Wunused-value warning. */
11700 TREE_USED (result
) = true;
11702 /* If new_return is set, assign function to that expr and cast the
11703 result to void since the generic interface returned void. */
11706 /* Cast function result from I{1,2,4,8,16} to the required type. */
11707 result
= build1 (VIEW_CONVERT_EXPR
, TREE_TYPE (new_return
), result
);
11708 result
= build2 (MODIFY_EXPR
, TREE_TYPE (new_return
), new_return
,
11710 TREE_SIDE_EFFECTS (result
) = 1;
11711 protected_set_expr_location (result
, loc
);
11712 result
= convert (void_type_node
, result
);
11722 /* vector_types_compatible_elements_p is used in type checks of vectors
11723 values used as operands of binary operators. Where it returns true, and
11724 the other checks of the caller succeed (being vector types in he first
11725 place, and matching number of elements), we can just treat the types
11726 as essentially the same.
11727 Contrast with vector_targets_convertible_p, which is used for vector
11728 pointer types, and vector_types_convertible_p, which will allow
11729 language-specific matches under the control of flag_lax_vector_conversions,
11730 and might still require a conversion. */
11731 /* True if vector types T1 and T2 can be inputs to the same binary
11732 operator without conversion.
11733 We don't check the overall vector size here because some of our callers
11734 want to give different error messages when the vectors are compatible
11735 except for the element count. */
11738 vector_types_compatible_elements_p (tree t1
, tree t2
)
11740 bool opaque
= TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
);
11741 t1
= TREE_TYPE (t1
);
11742 t2
= TREE_TYPE (t2
);
11744 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
11746 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
11747 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
11748 || c2
== FIXED_POINT_TYPE
));
11750 t1
= c_common_signed_type (t1
);
11751 t2
= c_common_signed_type (t2
);
11752 /* Equality works here because c_common_signed_type uses
11753 TYPE_MAIN_VARIANT. */
11756 if (opaque
&& c1
== c2
11757 && (c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
11758 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
11763 /* Check for missing format attributes on function pointers. LTYPE is
11764 the new type or left-hand side type. RTYPE is the old type or
11765 right-hand side type. Returns TRUE if LTYPE is missing the desired
11769 check_missing_format_attribute (tree ltype
, tree rtype
)
11771 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
11774 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
11775 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
11780 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
11781 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
11789 /* Subscripting with type char is likely to lose on a machine where
11790 chars are signed. So warn on any machine, but optionally. Don't
11791 warn for unsigned char since that type is safe. Don't warn for
11792 signed char because anyone who uses that must have done so
11793 deliberately. Furthermore, we reduce the false positive load by
11794 warning only for non-constant value of type char. */
11797 warn_array_subscript_with_type_char (location_t loc
, tree index
)
11799 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
11800 && TREE_CODE (index
) != INTEGER_CST
)
11801 warning_at (loc
, OPT_Wchar_subscripts
,
11802 "array subscript has type %<char%>");
11805 /* Implement -Wparentheses for the unexpected C precedence rules, to
11806 cover cases like x + y << z which readers are likely to
11807 misinterpret. We have seen an expression in which CODE is a binary
11808 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
11809 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
11810 CODE_RIGHT may be ERROR_MARK, which means that that side of the
11811 expression was not formed using a binary or unary operator, or it
11812 was enclosed in parentheses. */
11815 warn_about_parentheses (location_t loc
, enum tree_code code
,
11816 enum tree_code code_left
, tree arg_left
,
11817 enum tree_code code_right
, tree arg_right
)
11819 if (!warn_parentheses
)
11822 /* This macro tests that the expression ARG with original tree code
11823 CODE appears to be a boolean expression. or the result of folding a
11824 boolean expression. */
11825 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
11826 (truth_value_p (TREE_CODE (ARG)) \
11827 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
11828 /* Folding may create 0 or 1 integers from other expressions. */ \
11829 || ((CODE) != INTEGER_CST \
11830 && (integer_onep (ARG) || integer_zerop (ARG))))
11835 if (code_left
== PLUS_EXPR
)
11836 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11837 "suggest parentheses around %<+%> inside %<<<%>");
11838 else if (code_right
== PLUS_EXPR
)
11839 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11840 "suggest parentheses around %<+%> inside %<<<%>");
11841 else if (code_left
== MINUS_EXPR
)
11842 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11843 "suggest parentheses around %<-%> inside %<<<%>");
11844 else if (code_right
== MINUS_EXPR
)
11845 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11846 "suggest parentheses around %<-%> inside %<<<%>");
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 %<>>%>");
11864 case TRUTH_ORIF_EXPR
:
11865 if (code_left
== TRUTH_ANDIF_EXPR
)
11866 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11867 "suggest parentheses around %<&&%> within %<||%>");
11868 else if (code_right
== TRUTH_ANDIF_EXPR
)
11869 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11870 "suggest parentheses around %<&&%> within %<||%>");
11874 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
11875 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11876 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11877 "suggest parentheses around arithmetic in operand of %<|%>");
11878 else if (code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
11879 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11880 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11881 "suggest parentheses around arithmetic in operand of %<|%>");
11882 /* Check cases like x|y==z */
11883 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11884 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11885 "suggest parentheses around comparison in operand of %<|%>");
11886 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11887 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11888 "suggest parentheses around comparison in operand of %<|%>");
11889 /* Check cases like !x | y */
11890 else if (code_left
== TRUTH_NOT_EXPR
11891 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11892 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11893 "suggest parentheses around operand of "
11894 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
11898 if (code_left
== BIT_AND_EXPR
11899 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
)
11900 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11901 "suggest parentheses around arithmetic in operand of %<^%>");
11902 else if (code_right
== BIT_AND_EXPR
11903 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
11904 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11905 "suggest parentheses around arithmetic in operand of %<^%>");
11906 /* Check cases like x^y==z */
11907 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11908 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11909 "suggest parentheses around comparison in operand of %<^%>");
11910 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11911 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11912 "suggest parentheses around comparison in operand of %<^%>");
11916 if (code_left
== PLUS_EXPR
)
11917 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11918 "suggest parentheses around %<+%> in operand of %<&%>");
11919 else if (code_right
== PLUS_EXPR
)
11920 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11921 "suggest parentheses around %<+%> in operand of %<&%>");
11922 else if (code_left
== MINUS_EXPR
)
11923 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11924 "suggest parentheses around %<-%> in operand of %<&%>");
11925 else if (code_right
== MINUS_EXPR
)
11926 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11927 "suggest parentheses around %<-%> in operand of %<&%>");
11928 /* Check cases like x&y==z */
11929 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11930 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11931 "suggest parentheses around comparison in operand of %<&%>");
11932 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11933 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11934 "suggest parentheses around comparison in operand of %<&%>");
11935 /* Check cases like !x & y */
11936 else if (code_left
== TRUTH_NOT_EXPR
11937 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
11938 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11939 "suggest parentheses around operand of "
11940 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
11944 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 %<==%>");
11952 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
)
11953 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11954 "suggest parentheses around comparison in operand of %<!=%>");
11955 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
)
11956 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11957 "suggest parentheses around comparison in operand of %<!=%>");
11961 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
11963 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
11964 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
11965 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
11966 warning_at (EXPR_LOC_OR_LOC (arg_left
, loc
), OPT_Wparentheses
,
11967 "comparisons like %<X<=Y<=Z%> do not "
11968 "have their mathematical meaning");
11969 else if (TREE_CODE_CLASS (code_right
) == tcc_comparison
11970 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
11971 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))
11972 warning_at (EXPR_LOC_OR_LOC (arg_right
, loc
), OPT_Wparentheses
,
11973 "comparisons like %<X<=Y<=Z%> do not "
11974 "have their mathematical meaning");
11978 #undef NOT_A_BOOLEAN_EXPR_P
11981 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
11984 warn_for_unused_label (tree label
)
11986 if (!TREE_USED (label
))
11988 if (DECL_INITIAL (label
))
11989 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
11991 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
11995 /* Warn for division by zero according to the value of DIVISOR. LOC
11996 is the location of the division operator. */
11999 warn_for_div_by_zero (location_t loc
, tree divisor
)
12001 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
12002 about division by zero. Do not issue a warning if DIVISOR has a
12003 floating-point type, since we consider 0.0/0.0 a valid way of
12004 generating a NaN. */
12005 if (c_inhibit_evaluation_warnings
== 0
12006 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
12007 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
12010 /* Warn for patterns where memset appears to be used incorrectly. The
12011 warning location should be LOC. ARG0, and ARG2 are the first and
12012 last arguments to the call, while LITERAL_ZERO_MASK has a 1 bit for
12013 each argument that was a literal zero. */
12016 warn_for_memset (location_t loc
, tree arg0
, tree arg2
,
12017 int literal_zero_mask
)
12019 if (warn_memset_transposed_args
12020 && integer_zerop (arg2
)
12021 && (literal_zero_mask
& (1 << 2)) != 0
12022 && (literal_zero_mask
& (1 << 1)) == 0)
12023 warning_at (loc
, OPT_Wmemset_transposed_args
,
12024 "%<memset%> used with constant zero length "
12025 "parameter; this could be due to transposed "
12028 if (warn_memset_elt_size
&& TREE_CODE (arg2
) == INTEGER_CST
)
12031 if (TREE_CODE (arg0
) == ADDR_EXPR
)
12032 arg0
= TREE_OPERAND (arg0
, 0);
12033 tree type
= TREE_TYPE (arg0
);
12034 if (type
!= NULL_TREE
&& TREE_CODE (type
) == ARRAY_TYPE
)
12036 tree elt_type
= TREE_TYPE (type
);
12037 tree domain
= TYPE_DOMAIN (type
);
12038 if (!integer_onep (TYPE_SIZE_UNIT (elt_type
))
12039 && domain
!= NULL_TREE
12040 && TYPE_MAXVAL (domain
)
12041 && TYPE_MINVAL (domain
)
12042 && integer_zerop (TYPE_MINVAL (domain
))
12043 && integer_onep (fold_build2 (MINUS_EXPR
, domain
,
12045 TYPE_MAXVAL (domain
))))
12046 warning_at (loc
, OPT_Wmemset_elt_size
,
12047 "%<memset%> used with length equal to "
12048 "number of elements without multiplication "
12049 "by element size");
12054 /* Subroutine of build_binary_op. Give warnings for comparisons
12055 between signed and unsigned quantities that may fail. Do the
12056 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
12057 so that casts will be considered, but default promotions won't
12060 LOCATION is the location of the comparison operator.
12062 The arguments of this function map directly to local variables
12063 of build_binary_op. */
12066 warn_for_sign_compare (location_t location
,
12067 tree orig_op0
, tree orig_op1
,
12068 tree op0
, tree op1
,
12069 tree result_type
, enum tree_code resultcode
)
12071 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
12072 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
12073 int unsignedp0
, unsignedp1
;
12075 /* In C++, check for comparison of different enum types. */
12076 if (c_dialect_cxx()
12077 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
12078 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
12079 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
12080 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
12082 warning_at (location
,
12083 OPT_Wsign_compare
, "comparison between types %qT and %qT",
12084 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
12087 /* Do not warn if the comparison is being done in a signed type,
12088 since the signed type will only be chosen if it can represent
12089 all the values of the unsigned type. */
12090 if (!TYPE_UNSIGNED (result_type
))
12092 /* Do not warn if both operands are unsigned. */
12093 else if (op0_signed
== op1_signed
)
12097 tree sop
, uop
, base_type
;
12101 sop
= orig_op0
, uop
= orig_op1
;
12103 sop
= orig_op1
, uop
= orig_op0
;
12105 STRIP_TYPE_NOPS (sop
);
12106 STRIP_TYPE_NOPS (uop
);
12107 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
12108 ? TREE_TYPE (result_type
) : result_type
);
12110 /* Do not warn if the signed quantity is an unsuffixed integer
12111 literal (or some static constant expression involving such
12112 literals or a conditional expression involving such literals)
12113 and it is non-negative. */
12114 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
12116 /* Do not warn if the comparison is an equality operation, the
12117 unsigned quantity is an integral constant, and it would fit
12118 in the result if the result were signed. */
12119 else if (TREE_CODE (uop
) == INTEGER_CST
12120 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
12121 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
12123 /* In C, do not warn if the unsigned quantity is an enumeration
12124 constant and its maximum value would fit in the result if the
12125 result were signed. */
12126 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
12127 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
12128 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
12129 c_common_signed_type (base_type
)))
12132 warning_at (location
,
12134 "comparison between signed and unsigned integer expressions");
12137 /* Warn if two unsigned values are being compared in a size larger
12138 than their original size, and one (and only one) is the result of
12139 a `~' operator. This comparison will always fail.
12141 Also warn if one operand is a constant, and the constant does not
12142 have all bits set that are set in the ~ operand when it is
12145 op0
= c_common_get_narrower (op0
, &unsignedp0
);
12146 op1
= c_common_get_narrower (op1
, &unsignedp1
);
12148 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
12149 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
12151 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
12152 op0
= c_common_get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
12153 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
12154 op1
= c_common_get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
12156 if (tree_fits_shwi_p (op0
) || tree_fits_shwi_p (op1
))
12159 HOST_WIDE_INT constant
, mask
;
12163 if (tree_fits_shwi_p (op0
))
12166 unsignedp
= unsignedp1
;
12167 constant
= tree_to_shwi (op0
);
12172 unsignedp
= unsignedp0
;
12173 constant
= tree_to_shwi (op1
);
12176 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
12177 if (bits
< TYPE_PRECISION (result_type
)
12178 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
12180 mask
= HOST_WIDE_INT_M1U
<< bits
;
12181 if ((mask
& constant
) != mask
)
12184 warning_at (location
, OPT_Wsign_compare
,
12185 "promoted ~unsigned is always non-zero");
12187 warning_at (location
, OPT_Wsign_compare
,
12188 "comparison of promoted ~unsigned with constant");
12192 else if (unsignedp0
&& unsignedp1
12193 && (TYPE_PRECISION (TREE_TYPE (op0
))
12194 < TYPE_PRECISION (result_type
))
12195 && (TYPE_PRECISION (TREE_TYPE (op1
))
12196 < TYPE_PRECISION (result_type
)))
12197 warning_at (location
, OPT_Wsign_compare
,
12198 "comparison of promoted ~unsigned with unsigned");
12202 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
12203 type via c_common_type. If -Wdouble-promotion is in use, and the
12204 conditions for warning have been met, issue a warning. GMSGID is
12205 the warning message. It must have two %T specifiers for the type
12206 that was converted (generally "float") and the type to which it was
12207 converted (generally "double), respectively. LOC is the location
12208 to which the awrning should refer. */
12211 do_warn_double_promotion (tree result_type
, tree type1
, tree type2
,
12212 const char *gmsgid
, location_t loc
)
12216 if (!warn_double_promotion
)
12218 /* If the conversion will not occur at run-time, there is no need to
12220 if (c_inhibit_evaluation_warnings
)
12222 if (TYPE_MAIN_VARIANT (result_type
) != double_type_node
12223 && TYPE_MAIN_VARIANT (result_type
) != complex_double_type_node
)
12225 if (TYPE_MAIN_VARIANT (type1
) == float_type_node
12226 || TYPE_MAIN_VARIANT (type1
) == complex_float_type_node
)
12227 source_type
= type1
;
12228 else if (TYPE_MAIN_VARIANT (type2
) == float_type_node
12229 || TYPE_MAIN_VARIANT (type2
) == complex_float_type_node
)
12230 source_type
= type2
;
12233 warning_at (loc
, OPT_Wdouble_promotion
, gmsgid
, source_type
, result_type
);
12236 /* Possibly warn about unused parameters. */
12239 do_warn_unused_parameter (tree fn
)
12243 for (decl
= DECL_ARGUMENTS (fn
);
12244 decl
; decl
= DECL_CHAIN (decl
))
12245 if (!TREE_USED (decl
) && TREE_CODE (decl
) == PARM_DECL
12246 && DECL_NAME (decl
) && !DECL_ARTIFICIAL (decl
)
12247 && !TREE_NO_WARNING (decl
))
12248 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wunused_parameter
,
12249 "unused parameter %qD", decl
);
12253 /* Setup a TYPE_DECL node as a typedef representation.
12255 X is a TYPE_DECL for a typedef statement. Create a brand new
12256 ..._TYPE node (which will be just a variant of the existing
12257 ..._TYPE node with identical properties) and then install X
12258 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
12260 The whole point here is to end up with a situation where each
12261 and every ..._TYPE node the compiler creates will be uniquely
12262 associated with AT MOST one node representing a typedef name.
12263 This way, even though the compiler substitutes corresponding
12264 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
12265 early on, later parts of the compiler can always do the reverse
12266 translation and get back the corresponding typedef name. For
12269 typedef struct S MY_TYPE;
12272 Later parts of the compiler might only know that `object' was of
12273 type `struct S' if it were not for code just below. With this
12274 code however, later parts of the compiler see something like:
12276 struct S' == struct S
12277 typedef struct S' MY_TYPE;
12280 And they can then deduce (from the node for type struct S') that
12281 the original object declaration was:
12285 Being able to do this is important for proper support of protoize,
12286 and also for generating precise symbolic debugging information
12287 which takes full account of the programmer's (typedef) vocabulary.
12289 Obviously, we don't want to generate a duplicate ..._TYPE node if
12290 the TYPE_DECL node that we are now processing really represents a
12291 standard built-in type. */
12294 set_underlying_type (tree x
)
12296 if (x
== error_mark_node
)
12298 if (DECL_IS_BUILTIN (x
) && TREE_CODE (TREE_TYPE (x
)) != ARRAY_TYPE
)
12300 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
12301 TYPE_NAME (TREE_TYPE (x
)) = x
;
12303 else if (TREE_TYPE (x
) != error_mark_node
12304 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
12306 tree tt
= TREE_TYPE (x
);
12307 DECL_ORIGINAL_TYPE (x
) = tt
;
12308 tt
= build_variant_type_copy (tt
);
12309 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
12310 TYPE_NAME (tt
) = x
;
12311 TREE_USED (tt
) = TREE_USED (x
);
12312 TREE_TYPE (x
) = tt
;
12316 /* Record the types used by the current global variable declaration
12317 being parsed, so that we can decide later to emit their debug info.
12318 Those types are in types_used_by_cur_var_decl, and we are going to
12319 store them in the types_used_by_vars_hash hash table.
12320 DECL is the declaration of the global variable that has been parsed. */
12323 record_types_used_by_current_var_decl (tree decl
)
12325 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
12327 while (types_used_by_cur_var_decl
&& !types_used_by_cur_var_decl
->is_empty ())
12329 tree type
= types_used_by_cur_var_decl
->pop ();
12330 types_used_by_var_decl_insert (type
, decl
);
12334 /* If DECL is a typedef that is declared in the current function,
12335 record it for the purpose of -Wunused-local-typedefs. */
12338 record_locally_defined_typedef (tree decl
)
12340 struct c_language_function
*l
;
12342 if (!warn_unused_local_typedefs
12344 /* if this is not a locally defined typedef then we are not
12346 || !is_typedef_decl (decl
)
12347 || !decl_function_context (decl
))
12350 l
= (struct c_language_function
*) cfun
->language
;
12351 vec_safe_push (l
->local_typedefs
, decl
);
12354 /* If T is a TYPE_DECL declared locally, mark it as used. */
12357 maybe_record_typedef_use (tree t
)
12359 if (!is_typedef_decl (t
))
12362 TREE_USED (t
) = true;
12365 /* Warn if there are some unused locally defined typedefs in the
12366 current function. */
12369 maybe_warn_unused_local_typedefs (void)
12373 /* The number of times we have emitted -Wunused-local-typedefs
12374 warnings. If this is different from errorcount, that means some
12375 unrelated errors have been issued. In which case, we'll avoid
12376 emitting "unused-local-typedefs" warnings. */
12377 static int unused_local_typedefs_warn_count
;
12378 struct c_language_function
*l
;
12383 if ((l
= (struct c_language_function
*) cfun
->language
) == NULL
)
12386 if (warn_unused_local_typedefs
12387 && errorcount
== unused_local_typedefs_warn_count
)
12389 FOR_EACH_VEC_SAFE_ELT (l
->local_typedefs
, i
, decl
)
12390 if (!TREE_USED (decl
))
12391 warning_at (DECL_SOURCE_LOCATION (decl
),
12392 OPT_Wunused_local_typedefs
,
12393 "typedef %qD locally defined but not used", decl
);
12394 unused_local_typedefs_warn_count
= errorcount
;
12397 vec_free (l
->local_typedefs
);
12400 /* Warn about boolean expression compared with an integer value different
12401 from true/false. Warns also e.g. about "(i1 == i2) == 2".
12402 LOC is the location of the comparison, CODE is its code, OP0 and OP1
12403 are the operands of the comparison. The caller must ensure that
12404 either operand is a boolean expression. */
12407 maybe_warn_bool_compare (location_t loc
, enum tree_code code
, tree op0
,
12410 if (TREE_CODE_CLASS (code
) != tcc_comparison
)
12414 if (f
= fold_for_warn (op0
),
12415 TREE_CODE (f
) == INTEGER_CST
)
12417 else if (f
= fold_for_warn (op1
),
12418 TREE_CODE (f
) == INTEGER_CST
)
12423 if (!integer_zerop (cst
) && !integer_onep (cst
))
12425 int sign
= (TREE_CODE (op0
) == INTEGER_CST
12426 ? tree_int_cst_sgn (cst
) : -tree_int_cst_sgn (cst
));
12427 if (code
== EQ_EXPR
12428 || ((code
== GT_EXPR
|| code
== GE_EXPR
) && sign
< 0)
12429 || ((code
== LT_EXPR
|| code
== LE_EXPR
) && sign
> 0))
12430 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12431 "with boolean expression is always false", cst
);
12433 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12434 "with boolean expression is always true", cst
);
12436 else if (integer_zerop (cst
) || integer_onep (cst
))
12438 /* If the non-constant operand isn't of a boolean type, we
12439 don't want to warn here. */
12440 tree noncst
= TREE_CODE (op0
) == INTEGER_CST
? op1
: op0
;
12441 /* Handle booleans promoted to integers. */
12442 if (bool_promoted_to_int_p (noncst
))
12444 else if (TREE_CODE (TREE_TYPE (noncst
)) != BOOLEAN_TYPE
12445 && !truth_value_p (TREE_CODE (noncst
)))
12447 /* Do some magic to get the right diagnostics. */
12448 bool flag
= TREE_CODE (op0
) == INTEGER_CST
;
12449 flag
= integer_zerop (cst
) ? flag
: !flag
;
12450 if ((code
== GE_EXPR
&& !flag
) || (code
== LE_EXPR
&& flag
))
12451 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12452 "with boolean expression is always true", cst
);
12453 else if ((code
== LT_EXPR
&& !flag
) || (code
== GT_EXPR
&& flag
))
12454 warning_at (loc
, OPT_Wbool_compare
, "comparison of constant %qE "
12455 "with boolean expression is always false", cst
);
12459 /* Warn if signed left shift overflows. We don't warn
12460 about left-shifting 1 into the sign bit in C++14; cf.
12461 <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3367.html#1457>
12462 LOC is a location of the shift; OP0 and OP1 are the operands.
12463 Return true if an overflow is detected, false otherwise. */
12466 maybe_warn_shift_overflow (location_t loc
, tree op0
, tree op1
)
12468 if (TREE_CODE (op0
) != INTEGER_CST
12469 || TREE_CODE (op1
) != INTEGER_CST
)
12472 tree type0
= TREE_TYPE (op0
);
12473 unsigned int prec0
= TYPE_PRECISION (type0
);
12475 /* Left-hand operand must be signed. */
12476 if (TYPE_UNSIGNED (type0
))
12479 unsigned int min_prec
= (wi::min_precision (op0
, SIGNED
)
12480 + TREE_INT_CST_LOW (op1
));
12481 /* Handle the case of left-shifting 1 into the sign bit.
12482 * However, shifting 1 _out_ of the sign bit, as in
12483 * INT_MIN << 1, is considered an overflow.
12485 if (!tree_int_cst_sign_bit(op0
) && min_prec
== prec0
+ 1)
12487 /* Never warn for C++14 onwards. */
12488 if (cxx_dialect
>= cxx14
)
12490 /* Otherwise only if -Wshift-overflow=2. But return
12491 true to signal an overflow for the sake of integer
12492 constant expressions. */
12493 if (warn_shift_overflow
< 2)
12497 bool overflowed
= min_prec
> prec0
;
12498 if (overflowed
&& c_inhibit_evaluation_warnings
== 0)
12499 warning_at (loc
, OPT_Wshift_overflow_
,
12500 "result of %qE requires %u bits to represent, "
12501 "but %qT only has %u bits",
12502 build2_loc (loc
, LSHIFT_EXPR
, type0
, op0
, op1
),
12503 min_prec
, type0
, prec0
);
12508 /* The C and C++ parsers both use vectors to hold function arguments.
12509 For efficiency, we keep a cache of unused vectors. This is the
12512 typedef vec
<tree
, va_gc
> *tree_gc_vec
;
12513 static GTY((deletable
)) vec
<tree_gc_vec
, va_gc
> *tree_vector_cache
;
12515 /* Return a new vector from the cache. If the cache is empty,
12516 allocate a new vector. These vectors are GC'ed, so it is OK if the
12517 pointer is not released.. */
12520 make_tree_vector (void)
12522 if (tree_vector_cache
&& !tree_vector_cache
->is_empty ())
12523 return tree_vector_cache
->pop ();
12526 /* Passing 0 to vec::alloc returns NULL, and our callers require
12527 that we always return a non-NULL value. The vector code uses
12528 4 when growing a NULL vector, so we do too. */
12529 vec
<tree
, va_gc
> *v
;
12535 /* Release a vector of trees back to the cache. */
12538 release_tree_vector (vec
<tree
, va_gc
> *vec
)
12543 vec_safe_push (tree_vector_cache
, vec
);
12547 /* Get a new tree vector holding a single tree. */
12550 make_tree_vector_single (tree t
)
12552 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12553 ret
->quick_push (t
);
12557 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
12560 make_tree_vector_from_list (tree list
)
12562 vec
<tree
, va_gc
> *ret
= make_tree_vector ();
12563 for (; list
; list
= TREE_CHAIN (list
))
12564 vec_safe_push (ret
, TREE_VALUE (list
));
12568 /* Get a new tree vector which is a copy of an existing one. */
12571 make_tree_vector_copy (const vec
<tree
, va_gc
> *orig
)
12573 vec
<tree
, va_gc
> *ret
;
12577 ret
= make_tree_vector ();
12578 vec_safe_reserve (ret
, vec_safe_length (orig
));
12579 FOR_EACH_VEC_SAFE_ELT (orig
, ix
, t
)
12580 ret
->quick_push (t
);
12584 /* Return true if KEYWORD starts a type specifier. */
12587 keyword_begins_type_specifier (enum rid keyword
)
12591 case RID_AUTO_TYPE
:
12601 CASE_RID_FLOATN_NX
:
12604 case RID_DFLOAT128
:
12620 if (keyword
>= RID_FIRST_INT_N
12621 && keyword
< RID_FIRST_INT_N
+ NUM_INT_N_ENTS
12622 && int_n_enabled_p
[keyword
-RID_FIRST_INT_N
])
12628 /* Return true if KEYWORD names a type qualifier. */
12631 keyword_is_type_qualifier (enum rid keyword
)
12645 /* Return true if KEYWORD names a storage class specifier.
12647 RID_TYPEDEF is not included in this list despite `typedef' being
12648 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
12649 such for syntactic convenience only. */
12652 keyword_is_storage_class_specifier (enum rid keyword
)
12668 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
12671 keyword_is_function_specifier (enum rid keyword
)
12685 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
12686 declaration-specifier (C99 6.7). */
12689 keyword_is_decl_specifier (enum rid keyword
)
12691 if (keyword_is_storage_class_specifier (keyword
)
12692 || keyword_is_type_qualifier (keyword
)
12693 || keyword_is_function_specifier (keyword
))
12700 case RID_CONSTEXPR
:
12707 /* Initialize language-specific-bits of tree_contains_struct. */
12710 c_common_init_ts (void)
12712 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
12713 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
12714 MARK_TS_TYPED (ARRAY_NOTATION_REF
);
12717 /* Build a user-defined numeric literal out of an integer constant type VALUE
12718 with identifier SUFFIX. */
12721 build_userdef_literal (tree suffix_id
, tree value
,
12722 enum overflow_type overflow
, tree num_string
)
12724 tree literal
= make_node (USERDEF_LITERAL
);
12725 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
12726 USERDEF_LITERAL_VALUE (literal
) = value
;
12727 USERDEF_LITERAL_OVERFLOW (literal
) = overflow
;
12728 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
12732 /* For vector[index], convert the vector to an array of the underlying type.
12733 Return true if the resulting ARRAY_REF should not be an lvalue. */
12736 convert_vector_to_array_for_subscript (location_t loc
,
12737 tree
*vecp
, tree index
)
12740 if (VECTOR_TYPE_P (TREE_TYPE (*vecp
)))
12742 tree type
= TREE_TYPE (*vecp
);
12744 ret
= !lvalue_p (*vecp
);
12746 if (TREE_CODE (index
) == INTEGER_CST
)
12747 if (!tree_fits_uhwi_p (index
)
12748 || tree_to_uhwi (index
) >= TYPE_VECTOR_SUBPARTS (type
))
12749 warning_at (loc
, OPT_Warray_bounds
, "index value is out of bound");
12751 /* We are building an ARRAY_REF so mark the vector as addressable
12752 to not run into the gimplifiers premature setting of DECL_GIMPLE_REG_P
12753 for function parameters. */
12754 c_common_mark_addressable_vec (*vecp
);
12756 *vecp
= build1 (VIEW_CONVERT_EXPR
,
12757 build_array_type_nelts (TREE_TYPE (type
),
12758 TYPE_VECTOR_SUBPARTS (type
)),
12764 /* Determine which of the operands, if any, is a scalar that needs to be
12765 converted to a vector, for the range of operations. */
12767 scalar_to_vector (location_t loc
, enum tree_code code
, tree op0
, tree op1
,
12770 tree type0
= TREE_TYPE (op0
);
12771 tree type1
= TREE_TYPE (op1
);
12772 bool integer_only_op
= false;
12773 enum stv_conv ret
= stv_firstarg
;
12775 gcc_assert (VECTOR_TYPE_P (type0
) || VECTOR_TYPE_P (type1
));
12778 /* Most GENERIC binary expressions require homogeneous arguments.
12779 LSHIFT_EXPR and RSHIFT_EXPR are exceptions and accept a first
12780 argument that is a vector and a second one that is a scalar, so
12781 we never return stv_secondarg for them. */
12784 if (TREE_CODE (type0
) == INTEGER_TYPE
12785 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12787 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12790 error_at (loc
, "conversion of scalar %qT to vector %qT "
12791 "involves truncation", type0
, type1
);
12795 return stv_firstarg
;
12802 integer_only_op
= true;
12805 case VEC_COND_EXPR
:
12810 case TRUNC_DIV_EXPR
:
12811 case CEIL_DIV_EXPR
:
12812 case FLOOR_DIV_EXPR
:
12813 case ROUND_DIV_EXPR
:
12814 case EXACT_DIV_EXPR
:
12815 case TRUNC_MOD_EXPR
:
12816 case FLOOR_MOD_EXPR
:
12824 /* What about UNLT_EXPR? */
12825 if (VECTOR_TYPE_P (type0
))
12827 ret
= stv_secondarg
;
12828 std::swap (type0
, type1
);
12829 std::swap (op0
, op1
);
12832 if (TREE_CODE (type0
) == INTEGER_TYPE
12833 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
12835 if (unsafe_conversion_p (loc
, TREE_TYPE (type1
), op0
, false))
12838 error_at (loc
, "conversion of scalar %qT to vector %qT "
12839 "involves truncation", type0
, type1
);
12844 else if (!integer_only_op
12845 /* Allow integer --> real conversion if safe. */
12846 && (TREE_CODE (type0
) == REAL_TYPE
12847 || TREE_CODE (type0
) == INTEGER_TYPE
)
12848 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (type1
)))
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
);
12863 return stv_nothing
;
12866 /* Return the alignment of std::max_align_t.
12868 [support.types.layout] The type max_align_t is a POD type whose alignment
12869 requirement is at least as great as that of every scalar type, and whose
12870 alignment requirement is supported in every context. */
12873 max_align_t_align ()
12875 return MAX (TYPE_ALIGN (long_long_integer_type_node
),
12876 TYPE_ALIGN (long_double_type_node
));
12879 /* Return true iff ALIGN is an integral constant that is a fundamental
12880 alignment, as defined by [basic.align] in the c++-11
12885 [A fundamental alignment is represented by an alignment less than or
12886 equal to the greatest alignment supported by the implementation
12887 in all contexts, which is equal to alignof(max_align_t)]. */
12890 cxx_fundamental_alignment_p (unsigned align
)
12892 return (align
<= max_align_t_align ());
12895 /* Return true if T is a pointer to a zero-sized aggregate. */
12898 pointer_to_zero_sized_aggr_p (tree t
)
12900 if (!POINTER_TYPE_P (t
))
12903 return (TYPE_SIZE (t
) && integer_zerop (TYPE_SIZE (t
)));
12906 /* For an EXPR of a FUNCTION_TYPE that references a GCC built-in function
12907 with no library fallback or for an ADDR_EXPR whose operand is such type
12908 issues an error pointing to the location LOC.
12909 Returns true when the expression has been diagnosed and false
12912 reject_gcc_builtin (const_tree expr
, location_t loc
/* = UNKNOWN_LOCATION */)
12914 if (TREE_CODE (expr
) == ADDR_EXPR
)
12915 expr
= TREE_OPERAND (expr
, 0);
12917 if (TREE_TYPE (expr
)
12918 && TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
12919 && TREE_CODE (expr
) == FUNCTION_DECL
12920 /* The intersection of DECL_BUILT_IN and DECL_IS_BUILTIN avoids
12921 false positives for user-declared built-ins such as abs or
12922 strlen, and for C++ operators new and delete.
12923 The c_decl_implicit() test avoids false positives for implicitly
12924 declared built-ins with library fallbacks (such as abs). */
12925 && DECL_BUILT_IN (expr
)
12926 && DECL_IS_BUILTIN (expr
)
12927 && !c_decl_implicit (expr
)
12928 && !DECL_ASSEMBLER_NAME_SET_P (expr
))
12930 if (loc
== UNKNOWN_LOCATION
)
12931 loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
12933 /* Reject arguments that are built-in functions with
12934 no library fallback. */
12935 error_at (loc
, "built-in function %qE must be directly called", expr
);
12943 /* If we're creating an if-else-if condition chain, first see if we
12944 already have this COND in the CHAIN. If so, warn and don't add COND
12945 into the vector, otherwise add the COND there. LOC is the location
12949 warn_duplicated_cond_add_or_warn (location_t loc
, tree cond
, vec
<tree
> **chain
)
12951 /* No chain has been created yet. Do nothing. */
12952 if (*chain
== NULL
)
12955 if (TREE_SIDE_EFFECTS (cond
))
12957 /* Uh-oh! This condition has a side-effect, thus invalidates
12958 the whole chain. */
12966 bool found
= false;
12967 FOR_EACH_VEC_ELT (**chain
, ix
, t
)
12968 if (operand_equal_p (cond
, t
, 0))
12970 if (warning_at (loc
, OPT_Wduplicated_cond
,
12971 "duplicated %<if%> condition"))
12972 inform (EXPR_LOCATION (t
), "previously used here");
12978 && !CONSTANT_CLASS_P (cond
)
12979 /* Don't infinitely grow the chain. */
12980 && (*chain
)->length () < 512)
12981 (*chain
)->safe_push (cond
);
12984 /* Check if array size calculations overflow or if the array covers more
12985 than half of the address space. Return true if the size of the array
12986 is valid, false otherwise. TYPE is the type of the array and NAME is
12987 the name of the array, or NULL_TREE for unnamed arrays. */
12990 valid_array_size_p (location_t loc
, tree type
, tree name
)
12992 if (type
!= error_mark_node
12993 && COMPLETE_TYPE_P (type
)
12994 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
12995 && !valid_constant_size_p (TYPE_SIZE_UNIT (type
)))
12998 error_at (loc
, "size of array %qE is too large", name
);
13000 error_at (loc
, "size of unnamed array is too large");
13006 /* Read SOURCE_DATE_EPOCH from environment to have a deterministic
13007 timestamp to replace embedded current dates to get reproducible
13008 results. Returns -1 if SOURCE_DATE_EPOCH is not defined. */
13011 cb_get_source_date_epoch (cpp_reader
*pfile ATTRIBUTE_UNUSED
)
13013 char *source_date_epoch
;
13017 source_date_epoch
= getenv ("SOURCE_DATE_EPOCH");
13018 if (!source_date_epoch
)
13019 return (time_t) -1;
13022 #if defined(INT64_T_IS_LONG)
13023 epoch
= strtol (source_date_epoch
, &endptr
, 10);
13025 epoch
= strtoll (source_date_epoch
, &endptr
, 10);
13027 if (errno
!= 0 || endptr
== source_date_epoch
|| *endptr
!= '\0'
13028 || epoch
< 0 || epoch
> MAX_SOURCE_DATE_EPOCH
)
13030 error_at (input_location
, "environment variable SOURCE_DATE_EPOCH must "
13031 "expand to a non-negative integer less than or equal to %wd",
13032 MAX_SOURCE_DATE_EPOCH
);
13033 return (time_t) -1;
13036 return (time_t) epoch
;
13039 /* Callback for libcpp for offering spelling suggestions for misspelled
13040 directives. GOAL is an unrecognized string; CANDIDATES is a
13041 NULL-terminated array of candidate strings. Return the closest
13042 match to GOAL within CANDIDATES, or NULL if none are good
13046 cb_get_suggestion (cpp_reader
*, const char *goal
,
13047 const char *const *candidates
)
13049 best_match
<const char *, const char *> bm (goal
);
13050 while (*candidates
)
13051 bm
.consider (*candidates
++);
13052 return bm
.get_best_meaningful_candidate ();
13055 /* Check and possibly warn if two declarations have contradictory
13056 attributes, such as always_inline vs. noinline. */
13059 diagnose_mismatched_attributes (tree olddecl
, tree newdecl
)
13061 bool warned
= false;
13063 tree a1
= lookup_attribute ("optimize", DECL_ATTRIBUTES (olddecl
));
13064 tree a2
= lookup_attribute ("optimize", DECL_ATTRIBUTES (newdecl
));
13065 /* An optimization attribute applied on a declaration after the
13066 definition is likely not what the user wanted. */
13067 if (a2
!= NULL_TREE
13068 && DECL_SAVED_TREE (olddecl
) != NULL_TREE
13069 && (a1
== NULL_TREE
|| !attribute_list_equal (a1
, a2
)))
13070 warned
|= warning (OPT_Wattributes
,
13071 "optimization attribute on %qD follows "
13072 "definition but the attribute doesn%'t match",
13075 /* Diagnose inline __attribute__ ((noinline)) which is silly. */
13076 if (DECL_DECLARED_INLINE_P (newdecl
)
13077 && DECL_UNINLINABLE (olddecl
)
13078 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13079 warned
|= warning (OPT_Wattributes
, "inline declaration of %qD follows "
13080 "declaration with attribute noinline", newdecl
);
13081 else if (DECL_DECLARED_INLINE_P (olddecl
)
13082 && DECL_UNINLINABLE (newdecl
)
13083 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
13084 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13085 "noinline follows inline declaration ", newdecl
);
13086 else if (lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
))
13087 && lookup_attribute ("always_inline", DECL_ATTRIBUTES (olddecl
)))
13088 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13089 "%qs follows declaration with attribute %qs",
13090 newdecl
, "noinline", "always_inline");
13091 else if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (newdecl
))
13092 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
13093 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13094 "%qs follows declaration with attribute %qs",
13095 newdecl
, "always_inline", "noinline");
13096 else if (lookup_attribute ("cold", DECL_ATTRIBUTES (newdecl
))
13097 && lookup_attribute ("hot", DECL_ATTRIBUTES (olddecl
)))
13098 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13099 "%qs follows declaration with attribute %qs",
13100 newdecl
, "cold", "hot");
13101 else if (lookup_attribute ("hot", DECL_ATTRIBUTES (newdecl
))
13102 && lookup_attribute ("cold", DECL_ATTRIBUTES (olddecl
)))
13103 warned
|= warning (OPT_Wattributes
, "declaration of %q+D with attribute "
13104 "%qs follows declaration with attribute %qs",
13105 newdecl
, "hot", "cold");
13109 #include "gt-c-family-c-common.h"