1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
38 #include "common/common-target.h"
39 #include "langhooks.h"
40 #include "tree-inline.h"
42 #include "diagnostic.h"
43 #include "tree-iterator.h"
45 #include "tree-mudflap.h"
48 #include "target-def.h"
51 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
53 /* The following symbols are subsumed in the c_global_trees array, and
54 listed here individually for documentation purposes.
56 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
58 tree short_integer_type_node;
59 tree long_integer_type_node;
60 tree long_long_integer_type_node;
61 tree int128_integer_type_node;
63 tree short_unsigned_type_node;
64 tree long_unsigned_type_node;
65 tree long_long_unsigned_type_node;
66 tree int128_unsigned_type_node;
68 tree truthvalue_type_node;
69 tree truthvalue_false_node;
70 tree truthvalue_true_node;
72 tree ptrdiff_type_node;
74 tree unsigned_char_type_node;
75 tree signed_char_type_node;
78 tree char16_type_node;
79 tree char32_type_node;
82 tree double_type_node;
83 tree long_double_type_node;
85 tree complex_integer_type_node;
86 tree complex_float_type_node;
87 tree complex_double_type_node;
88 tree complex_long_double_type_node;
90 tree dfloat32_type_node;
91 tree dfloat64_type_node;
92 tree_dfloat128_type_node;
100 tree unsigned_intQI_type_node;
101 tree unsigned_intHI_type_node;
102 tree unsigned_intSI_type_node;
103 tree unsigned_intDI_type_node;
104 tree unsigned_intTI_type_node;
106 tree widest_integer_literal_type_node;
107 tree widest_unsigned_literal_type_node;
109 Nodes for types `void *' and `const void *'.
111 tree ptr_type_node, const_ptr_type_node;
113 Nodes for types `char *' and `const char *'.
115 tree string_type_node, const_string_type_node;
117 Type `char[SOMENUMBER]'.
118 Used when an array of char is needed and the size is irrelevant.
120 tree char_array_type_node;
122 Type `int[SOMENUMBER]' or something like it.
123 Used when an array of int needed and the size is irrelevant.
125 tree int_array_type_node;
127 Type `wchar_t[SOMENUMBER]' or something like it.
128 Used when a wide string literal is created.
130 tree wchar_array_type_node;
132 Type `char16_t[SOMENUMBER]' or something like it.
133 Used when a UTF-16 string literal is created.
135 tree char16_array_type_node;
137 Type `char32_t[SOMENUMBER]' or something like it.
138 Used when a UTF-32 string literal is created.
140 tree char32_array_type_node;
142 Type `int ()' -- used for implicit declaration of functions.
144 tree default_function_type;
146 A VOID_TYPE node, packaged in a TREE_LIST.
150 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
151 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
152 VAR_DECLS, but C++ does.)
154 tree function_name_decl_node;
155 tree pretty_function_name_decl_node;
156 tree c99_function_name_decl_node;
158 Stack of nested function name VAR_DECLs.
160 tree saved_function_name_decls;
164 tree c_global_trees
[CTI_MAX
];
166 /* Switches common to the C front ends. */
168 /* Nonzero means don't output line number information. */
170 char flag_no_line_commands
;
172 /* Nonzero causes -E output not to be done, but directives such as
173 #define that have side effects are still obeyed. */
177 /* Nonzero means dump macros in some fashion. */
179 char flag_dump_macros
;
181 /* Nonzero means pass #include lines through to the output. */
183 char flag_dump_includes
;
185 /* Nonzero means process PCH files while preprocessing. */
187 bool flag_pch_preprocess
;
189 /* The file name to which we should write a precompiled header, or
190 NULL if no header will be written in this compile. */
192 const char *pch_file
;
194 /* Nonzero if an ISO standard was selected. It rejects macros in the
198 /* Warn about #pragma directives that are not recognized. */
200 int warn_unknown_pragmas
; /* Tri state variable. */
202 /* Warn about format/argument anomalies in calls to formatted I/O functions
203 (*printf, *scanf, strftime, strfmon, etc.). */
207 /* C/ObjC language option variables. */
210 /* Nonzero means allow type mismatches in conditional expressions;
211 just make their values `void'. */
213 int flag_cond_mismatch
;
215 /* Nonzero means enable C89 Amendment 1 features. */
219 /* Nonzero means use the ISO C99 (or C1X) dialect of C. */
223 /* Nonzero means use the ISO C1X dialect of C. */
227 /* Nonzero means that we have builtin functions, and main is an int. */
232 /* ObjC language option variables. */
235 /* Tells the compiler that this is a special run. Do not perform any
236 compiling, instead we are to test some platform dependent features
237 and output a C header file with appropriate definitions. */
239 int print_struct_values
;
241 /* Tells the compiler what is the constant string class for ObjC. */
243 const char *constant_string_class_name
;
246 /* C++ language option variables. */
249 /* Nonzero means generate separate instantiation control files and
250 juggle them at link time. */
252 int flag_use_repository
;
254 /* The C++ dialect being used. C++98 is the default. */
256 enum cxx_dialect cxx_dialect
= cxx98
;
258 /* Maximum template instantiation depth. This limit exists to limit the
259 time it takes to notice excessively recursive template instantiations.
261 The default is lower than the 1024 recommended by the C++0x standard
262 because G++ runs out of stack before 1024 with highly recursive template
263 argument deduction substitution (g++.dg/cpp0x/enum11.C). */
265 int max_tinst_depth
= 900;
267 /* The elements of `ridpointers' are identifier nodes for the reserved
268 type names and storage classes. It is indexed by a RID_... value. */
271 tree (*make_fname_decl
) (location_t
, tree
, int);
273 /* Nonzero means don't warn about problems that occur when the code is
275 int c_inhibit_evaluation_warnings
;
277 /* Whether we are building a boolean conversion inside
278 convert_for_assignment, or some other late binary operation. If
279 build_binary_op is called for C (from code shared by C and C++) in
280 this case, then the operands have already been folded and the
281 result will not be folded again, so C_MAYBE_CONST_EXPR should not
283 bool in_late_binary_op
;
285 /* Whether lexing has been completed, so subsequent preprocessor
286 errors should use the compiler's input_location. */
287 bool done_lexing
= false;
289 /* Information about how a function name is generated. */
292 tree
*const decl
; /* pointer to the VAR_DECL. */
293 const unsigned rid
; /* RID number for the identifier. */
294 const int pretty
; /* How pretty is it? */
297 /* The three ways of getting then name of the current function. */
299 const struct fname_var_t fname_vars
[] =
301 /* C99 compliant __func__, must be first. */
302 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
303 /* GCC __FUNCTION__ compliant. */
304 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
305 /* GCC __PRETTY_FUNCTION__ compliant. */
306 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
310 /* Global visibility options. */
311 struct visibility_flags visibility_options
;
313 static tree
c_fully_fold_internal (tree expr
, bool, bool *, bool *);
314 static tree
check_case_value (tree
);
315 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
317 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
318 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
319 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
320 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
321 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
322 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
323 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
324 static tree
handle_noclone_attribute (tree
*, tree
, tree
, int, bool *);
325 static tree
handle_leaf_attribute (tree
*, tree
, tree
, int, bool *);
326 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
328 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int, bool *);
329 static tree
handle_artificial_attribute (tree
*, tree
, tree
, int, bool *);
330 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
331 static tree
handle_error_attribute (tree
*, tree
, tree
, int, bool *);
332 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
333 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
334 static tree
handle_externally_visible_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_constructor_attribute (tree
*, tree
, tree
, int, bool *);
340 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
341 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
342 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
343 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
344 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
345 static tree
handle_alias_ifunc_attribute (bool, tree
*, tree
, tree
, bool *);
346 static tree
handle_ifunc_attribute (tree
*, tree
, tree
, int, bool *);
347 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
348 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
349 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
351 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
353 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
355 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
356 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
357 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
359 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
360 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
361 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
363 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
365 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
366 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
367 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
368 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
370 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
371 static tree
handle_type_generic_attribute (tree
*, tree
, tree
, int, bool *);
372 static tree
handle_alloc_size_attribute (tree
*, tree
, tree
, int, bool *);
373 static tree
handle_target_attribute (tree
*, tree
, tree
, int, bool *);
374 static tree
handle_optimize_attribute (tree
*, tree
, tree
, int, bool *);
375 static tree
handle_no_split_stack_attribute (tree
*, tree
, tree
, int, bool *);
376 static tree
handle_fnspec_attribute (tree
*, tree
, tree
, int, bool *);
378 static void check_function_nonnull (tree
, int, tree
*);
379 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
380 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
381 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
382 static int resort_field_decl_cmp (const void *, const void *);
384 /* Reserved words. The third field is a mask: keywords are disabled
385 if they match the mask.
388 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
389 C --std=c99: D_CXXONLY | D_OBJC
390 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
391 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
392 C++ --std=c0x: D_CONLY | D_OBJC
393 ObjC++ is like C++ except that D_OBJC is not set
395 If -fno-asm is used, D_ASM is added to the mask. If
396 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
397 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
398 In C with -Wc++-compat, we warn if D_CXXWARN is set.
400 Note the complication of the D_CXX_OBJC keywords. These are
401 reserved words such as 'class'. In C++, 'class' is a reserved
402 word. In Objective-C++ it is too. In Objective-C, it is a
403 reserved word too, but only if it follows an '@' sign.
405 const struct c_common_resword c_common_reswords
[] =
407 { "_Bool", RID_BOOL
, D_CONLY
},
408 { "_Complex", RID_COMPLEX
, 0 },
409 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
410 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
411 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
412 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
413 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
414 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
415 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
416 { "_Static_assert", RID_STATIC_ASSERT
, D_CONLY
},
417 { "_Noreturn", RID_NORETURN
, D_CONLY
},
418 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
419 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
420 { "__alignof", RID_ALIGNOF
, 0 },
421 { "__alignof__", RID_ALIGNOF
, 0 },
422 { "__asm", RID_ASM
, 0 },
423 { "__asm__", RID_ASM
, 0 },
424 { "__attribute", RID_ATTRIBUTE
, 0 },
425 { "__attribute__", RID_ATTRIBUTE
, 0 },
426 { "__bases", RID_BASES
, D_CXXONLY
},
427 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
428 { "__builtin_complex", RID_BUILTIN_COMPLEX
, D_CONLY
},
429 { "__builtin_shuffle", RID_BUILTIN_SHUFFLE
, D_CONLY
},
430 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
431 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
432 { "__builtin_va_arg", RID_VA_ARG
, 0 },
433 { "__complex", RID_COMPLEX
, 0 },
434 { "__complex__", RID_COMPLEX
, 0 },
435 { "__const", RID_CONST
, 0 },
436 { "__const__", RID_CONST
, 0 },
437 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
438 { "__direct_bases", RID_DIRECT_BASES
, D_CXXONLY
},
439 { "__extension__", RID_EXTENSION
, 0 },
440 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
441 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
442 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
443 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
444 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
445 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
446 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
447 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
448 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
449 { "__imag", RID_IMAGPART
, 0 },
450 { "__imag__", RID_IMAGPART
, 0 },
451 { "__inline", RID_INLINE
, 0 },
452 { "__inline__", RID_INLINE
, 0 },
453 { "__int128", RID_INT128
, 0 },
454 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
455 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
456 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
457 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO
, D_CXXONLY
},
458 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
459 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
460 { "__is_literal_type", RID_IS_LITERAL_TYPE
, D_CXXONLY
},
461 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
462 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
463 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
464 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
465 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
466 { "__label__", RID_LABEL
, 0 },
467 { "__null", RID_NULL
, 0 },
468 { "__real", RID_REALPART
, 0 },
469 { "__real__", RID_REALPART
, 0 },
470 { "__restrict", RID_RESTRICT
, 0 },
471 { "__restrict__", RID_RESTRICT
, 0 },
472 { "__signed", RID_SIGNED
, 0 },
473 { "__signed__", RID_SIGNED
, 0 },
474 { "__thread", RID_THREAD
, 0 },
475 { "__typeof", RID_TYPEOF
, 0 },
476 { "__typeof__", RID_TYPEOF
, 0 },
477 { "__underlying_type", RID_UNDERLYING_TYPE
, D_CXXONLY
},
478 { "__volatile", RID_VOLATILE
, 0 },
479 { "__volatile__", RID_VOLATILE
, 0 },
480 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
481 { "asm", RID_ASM
, D_ASM
},
482 { "auto", RID_AUTO
, 0 },
483 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
484 { "break", RID_BREAK
, 0 },
485 { "case", RID_CASE
, 0 },
486 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
487 { "char", RID_CHAR
, 0 },
488 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
489 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
490 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
491 { "const", RID_CONST
, 0 },
492 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
493 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
494 { "continue", RID_CONTINUE
, 0 },
495 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
496 { "default", RID_DEFAULT
, 0 },
497 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
499 { "double", RID_DOUBLE
, 0 },
500 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
501 { "else", RID_ELSE
, 0 },
502 { "enum", RID_ENUM
, 0 },
503 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
504 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
505 { "extern", RID_EXTERN
, 0 },
506 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
507 { "float", RID_FLOAT
, 0 },
508 { "for", RID_FOR
, 0 },
509 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
510 { "goto", RID_GOTO
, 0 },
512 { "inline", RID_INLINE
, D_EXT89
},
513 { "int", RID_INT
, 0 },
514 { "long", RID_LONG
, 0 },
515 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
516 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
517 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
518 { "noexcept", RID_NOEXCEPT
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
519 { "nullptr", RID_NULLPTR
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
520 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
521 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
522 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
523 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
524 { "register", RID_REGISTER
, 0 },
525 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
526 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
527 { "return", RID_RETURN
, 0 },
528 { "short", RID_SHORT
, 0 },
529 { "signed", RID_SIGNED
, 0 },
530 { "sizeof", RID_SIZEOF
, 0 },
531 { "static", RID_STATIC
, 0 },
532 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
533 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
534 { "struct", RID_STRUCT
, 0 },
535 { "switch", RID_SWITCH
, 0 },
536 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
537 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
538 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
539 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
540 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
541 { "typedef", RID_TYPEDEF
, 0 },
542 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
543 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
544 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
545 { "union", RID_UNION
, 0 },
546 { "unsigned", RID_UNSIGNED
, 0 },
547 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
548 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
549 { "void", RID_VOID
, 0 },
550 { "volatile", RID_VOLATILE
, 0 },
551 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
552 { "while", RID_WHILE
, 0 },
553 /* These Objective-C keywords are recognized only immediately after
555 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
556 { "defs", RID_AT_DEFS
, D_OBJC
},
557 { "encode", RID_AT_ENCODE
, D_OBJC
},
558 { "end", RID_AT_END
, D_OBJC
},
559 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
560 { "interface", RID_AT_INTERFACE
, D_OBJC
},
561 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
562 { "selector", RID_AT_SELECTOR
, D_OBJC
},
563 { "finally", RID_AT_FINALLY
, D_OBJC
},
564 { "synchronized", RID_AT_SYNCHRONIZED
, D_OBJC
},
565 { "optional", RID_AT_OPTIONAL
, D_OBJC
},
566 { "required", RID_AT_REQUIRED
, D_OBJC
},
567 { "property", RID_AT_PROPERTY
, D_OBJC
},
568 { "package", RID_AT_PACKAGE
, D_OBJC
},
569 { "synthesize", RID_AT_SYNTHESIZE
, D_OBJC
},
570 { "dynamic", RID_AT_DYNAMIC
, D_OBJC
},
571 /* These are recognized only in protocol-qualifier context
573 { "bycopy", RID_BYCOPY
, D_OBJC
},
574 { "byref", RID_BYREF
, D_OBJC
},
575 { "in", RID_IN
, D_OBJC
},
576 { "inout", RID_INOUT
, D_OBJC
},
577 { "oneway", RID_ONEWAY
, D_OBJC
},
578 { "out", RID_OUT
, D_OBJC
},
579 /* These are recognized inside a property attribute list */
580 { "assign", RID_ASSIGN
, D_OBJC
},
581 { "copy", RID_COPY
, D_OBJC
},
582 { "getter", RID_GETTER
, D_OBJC
},
583 { "nonatomic", RID_NONATOMIC
, D_OBJC
},
584 { "readonly", RID_READONLY
, D_OBJC
},
585 { "readwrite", RID_READWRITE
, D_OBJC
},
586 { "retain", RID_RETAIN
, D_OBJC
},
587 { "setter", RID_SETTER
, D_OBJC
},
590 const unsigned int num_c_common_reswords
=
591 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
593 /* Table of machine-independent attributes common to all C-like languages. */
594 const struct attribute_spec c_common_attribute_table
[] =
596 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
597 affects_type_identity } */
598 { "packed", 0, 0, false, false, false,
599 handle_packed_attribute
, false},
600 { "nocommon", 0, 0, true, false, false,
601 handle_nocommon_attribute
, false},
602 { "common", 0, 0, true, false, false,
603 handle_common_attribute
, false },
604 /* FIXME: logically, noreturn attributes should be listed as
605 "false, true, true" and apply to function types. But implementing this
606 would require all the places in the compiler that use TREE_THIS_VOLATILE
607 on a decl to identify non-returning functions to be located and fixed
608 to check the function type instead. */
609 { "noreturn", 0, 0, true, false, false,
610 handle_noreturn_attribute
, false },
611 { "volatile", 0, 0, true, false, false,
612 handle_noreturn_attribute
, false },
613 { "noinline", 0, 0, true, false, false,
614 handle_noinline_attribute
, false },
615 { "noclone", 0, 0, true, false, false,
616 handle_noclone_attribute
, false },
617 { "leaf", 0, 0, true, false, false,
618 handle_leaf_attribute
, false },
619 { "always_inline", 0, 0, true, false, false,
620 handle_always_inline_attribute
, false },
621 { "gnu_inline", 0, 0, true, false, false,
622 handle_gnu_inline_attribute
, false },
623 { "artificial", 0, 0, true, false, false,
624 handle_artificial_attribute
, false },
625 { "flatten", 0, 0, true, false, false,
626 handle_flatten_attribute
, false },
627 { "used", 0, 0, true, false, false,
628 handle_used_attribute
, false },
629 { "unused", 0, 0, false, false, false,
630 handle_unused_attribute
, false },
631 { "externally_visible", 0, 0, true, false, false,
632 handle_externally_visible_attribute
, false },
633 /* The same comments as for noreturn attributes apply to const ones. */
634 { "const", 0, 0, true, false, false,
635 handle_const_attribute
, false },
636 { "transparent_union", 0, 0, false, false, false,
637 handle_transparent_union_attribute
, false },
638 { "constructor", 0, 1, true, false, false,
639 handle_constructor_attribute
, false },
640 { "destructor", 0, 1, true, false, false,
641 handle_destructor_attribute
, false },
642 { "mode", 1, 1, false, true, false,
643 handle_mode_attribute
, false },
644 { "section", 1, 1, true, false, false,
645 handle_section_attribute
, false },
646 { "aligned", 0, 1, false, false, false,
647 handle_aligned_attribute
, false },
648 { "weak", 0, 0, true, false, false,
649 handle_weak_attribute
, false },
650 { "ifunc", 1, 1, true, false, false,
651 handle_ifunc_attribute
, false },
652 { "alias", 1, 1, true, false, false,
653 handle_alias_attribute
, false },
654 { "weakref", 0, 1, true, false, false,
655 handle_weakref_attribute
, false },
656 { "no_instrument_function", 0, 0, true, false, false,
657 handle_no_instrument_function_attribute
,
659 { "malloc", 0, 0, true, false, false,
660 handle_malloc_attribute
, false },
661 { "returns_twice", 0, 0, true, false, false,
662 handle_returns_twice_attribute
, false },
663 { "no_stack_limit", 0, 0, true, false, false,
664 handle_no_limit_stack_attribute
, false },
665 { "pure", 0, 0, true, false, false,
666 handle_pure_attribute
, false },
667 /* For internal use (marking of builtins) only. The name contains space
668 to prevent its usage in source code. */
669 { "no vops", 0, 0, true, false, false,
670 handle_novops_attribute
, false },
671 { "deprecated", 0, 1, false, false, false,
672 handle_deprecated_attribute
, false },
673 { "vector_size", 1, 1, false, true, false,
674 handle_vector_size_attribute
, false },
675 { "visibility", 1, 1, false, false, false,
676 handle_visibility_attribute
, false },
677 { "tls_model", 1, 1, true, false, false,
678 handle_tls_model_attribute
, false },
679 { "nonnull", 0, -1, false, true, true,
680 handle_nonnull_attribute
, false },
681 { "nothrow", 0, 0, true, false, false,
682 handle_nothrow_attribute
, false },
683 { "may_alias", 0, 0, false, true, false, NULL
, false },
684 { "cleanup", 1, 1, true, false, false,
685 handle_cleanup_attribute
, false },
686 { "warn_unused_result", 0, 0, false, true, true,
687 handle_warn_unused_result_attribute
, false },
688 { "sentinel", 0, 1, false, true, true,
689 handle_sentinel_attribute
, false },
690 /* For internal use (marking of builtins) only. The name contains space
691 to prevent its usage in source code. */
692 { "type generic", 0, 0, false, true, true,
693 handle_type_generic_attribute
, false },
694 { "alloc_size", 1, 2, false, true, true,
695 handle_alloc_size_attribute
, false },
696 { "cold", 0, 0, true, false, false,
697 handle_cold_attribute
, false },
698 { "hot", 0, 0, true, false, false,
699 handle_hot_attribute
, false },
700 { "warning", 1, 1, true, false, false,
701 handle_error_attribute
, false },
702 { "error", 1, 1, true, false, false,
703 handle_error_attribute
, false },
704 { "target", 1, -1, true, false, false,
705 handle_target_attribute
, false },
706 { "optimize", 1, -1, true, false, false,
707 handle_optimize_attribute
, false },
708 { "no_split_stack", 0, 0, true, false, false,
709 handle_no_split_stack_attribute
, false },
710 /* For internal use (marking of builtins and runtime functions) only.
711 The name contains space to prevent its usage in source code. */
712 { "fn spec", 1, 1, false, true, true,
713 handle_fnspec_attribute
, false },
714 { NULL
, 0, 0, false, false, false, NULL
, false }
717 /* Give the specifications for the format attributes, used by C and all
720 const struct attribute_spec c_common_format_attribute_table
[] =
722 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler,
723 affects_type_identity } */
724 { "format", 3, 3, false, true, true,
725 handle_format_attribute
, false },
726 { "format_arg", 1, 1, false, true, true,
727 handle_format_arg_attribute
, false },
728 { NULL
, 0, 0, false, false, false, NULL
, false }
731 /* Return identifier for address space AS. */
734 c_addr_space_name (addr_space_t as
)
736 int rid
= RID_FIRST_ADDR_SPACE
+ as
;
737 gcc_assert (ridpointers
[rid
]);
738 return IDENTIFIER_POINTER (ridpointers
[rid
]);
741 /* Push current bindings for the function name VAR_DECLS. */
744 start_fname_decls (void)
747 tree saved
= NULL_TREE
;
749 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
751 tree decl
= *fname_vars
[ix
].decl
;
755 saved
= tree_cons (decl
, build_int_cst (integer_type_node
, ix
),
757 *fname_vars
[ix
].decl
= NULL_TREE
;
760 if (saved
|| saved_function_name_decls
)
761 /* Normally they'll have been NULL, so only push if we've got a
762 stack, or they are non-NULL. */
763 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
764 saved_function_name_decls
);
767 /* Finish up the current bindings, adding them into the current function's
768 statement tree. This must be done _before_ finish_stmt_tree is called.
769 If there is no current function, we must be at file scope and no statements
770 are involved. Pop the previous bindings. */
773 finish_fname_decls (void)
776 tree stmts
= NULL_TREE
;
777 tree stack
= saved_function_name_decls
;
779 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
780 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
784 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
786 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
787 bodyp
= &BIND_EXPR_BODY (*bodyp
);
789 append_to_statement_list_force (*bodyp
, &stmts
);
793 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
794 *fname_vars
[ix
].decl
= NULL_TREE
;
798 /* We had saved values, restore them. */
801 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
803 tree decl
= TREE_PURPOSE (saved
);
804 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
806 *fname_vars
[ix
].decl
= decl
;
808 stack
= TREE_CHAIN (stack
);
810 saved_function_name_decls
= stack
;
813 /* Return the text name of the current function, suitably prettified
814 by PRETTY_P. Return string must be freed by caller. */
817 fname_as_string (int pretty_p
)
819 const char *name
= "top level";
822 cpp_string cstr
= { 0, 0 }, strname
;
830 if (current_function_decl
)
831 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
833 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
835 namep
= XNEWVEC (char, len
);
836 snprintf (namep
, len
, "\"%s\"", name
);
837 strname
.text
= (unsigned char *) namep
;
838 strname
.len
= len
- 1;
840 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
843 return (const char *) cstr
.text
;
849 /* Return the VAR_DECL for a const char array naming the current
850 function. If the VAR_DECL has not yet been created, create it
851 now. RID indicates how it should be formatted and IDENTIFIER_NODE
852 ID is its name (unfortunately C and C++ hold the RID values of
853 keywords in different places, so we can't derive RID from ID in
854 this language independent code. LOC is the location of the
858 fname_decl (location_t loc
, unsigned int rid
, tree id
)
861 tree decl
= NULL_TREE
;
863 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
864 if (fname_vars
[ix
].rid
== rid
)
867 decl
= *fname_vars
[ix
].decl
;
870 /* If a tree is built here, it would normally have the lineno of
871 the current statement. Later this tree will be moved to the
872 beginning of the function and this line number will be wrong.
873 To avoid this problem set the lineno to 0 here; that prevents
874 it from appearing in the RTL. */
876 location_t saved_location
= input_location
;
877 input_location
= UNKNOWN_LOCATION
;
879 stmts
= push_stmt_list ();
880 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
881 stmts
= pop_stmt_list (stmts
);
882 if (!IS_EMPTY_STMT (stmts
))
883 saved_function_name_decls
884 = tree_cons (decl
, stmts
, saved_function_name_decls
);
885 *fname_vars
[ix
].decl
= decl
;
886 input_location
= saved_location
;
888 if (!ix
&& !current_function_decl
)
889 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
894 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
897 fix_string_type (tree value
)
899 int length
= TREE_STRING_LENGTH (value
);
901 tree e_type
, i_type
, a_type
;
903 /* Compute the number of elements, for the array type. */
904 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
907 e_type
= char_type_node
;
909 else if (TREE_TYPE (value
) == char16_array_type_node
)
911 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
912 e_type
= char16_type_node
;
914 else if (TREE_TYPE (value
) == char32_array_type_node
)
916 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
917 e_type
= char32_type_node
;
921 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
922 e_type
= wchar_type_node
;
925 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
926 limit in C++98 Annex B is very large (65536) and is not normative,
927 so we do not diagnose it (warn_overlength_strings is forced off
928 in c_common_post_options). */
929 if (warn_overlength_strings
)
931 const int nchars_max
= flag_isoc99
? 4095 : 509;
932 const int relevant_std
= flag_isoc99
? 99 : 90;
933 if (nchars
- 1 > nchars_max
)
934 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
935 separate the %d from the 'C'. 'ISO' should not be
936 translated, but it may be moved after 'C%d' in languages
937 where modifiers follow nouns. */
938 pedwarn (input_location
, OPT_Woverlength_strings
,
939 "string length %qd is greater than the length %qd "
940 "ISO C%d compilers are required to support",
941 nchars
- 1, nchars_max
, relevant_std
);
944 /* Create the array type for the string constant. The ISO C++
945 standard says that a string literal has type `const char[N]' or
946 `const wchar_t[N]'. We use the same logic when invoked as a C
947 front-end with -Wwrite-strings.
948 ??? We should change the type of an expression depending on the
949 state of a warning flag. We should just be warning -- see how
950 this is handled in the C++ front-end for the deprecated implicit
951 conversion from string literals to `char*' or `wchar_t*'.
953 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
954 array type being the unqualified version of that type.
955 Therefore, if we are constructing an array of const char, we must
956 construct the matching unqualified array type first. The C front
957 end does not require this, but it does no harm, so we do it
959 i_type
= build_index_type (size_int (nchars
- 1));
960 a_type
= build_array_type (e_type
, i_type
);
961 if (c_dialect_cxx() || warn_write_strings
)
962 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
964 TREE_TYPE (value
) = a_type
;
965 TREE_CONSTANT (value
) = 1;
966 TREE_READONLY (value
) = 1;
967 TREE_STATIC (value
) = 1;
971 /* If DISABLE is true, stop issuing warnings. This is used when
972 parsing code that we know will not be executed. This function may
973 be called multiple times, and works as a stack. */
976 c_disable_warnings (bool disable
)
980 ++c_inhibit_evaluation_warnings
;
981 fold_defer_overflow_warnings ();
985 /* If ENABLE is true, reenable issuing warnings. */
988 c_enable_warnings (bool enable
)
992 --c_inhibit_evaluation_warnings
;
993 fold_undefer_and_ignore_overflow_warnings ();
997 /* Fully fold EXPR, an expression that was not folded (beyond integer
998 constant expressions and null pointer constants) when being built
999 up. If IN_INIT, this is in a static initializer and certain
1000 changes are made to the folding done. Clear *MAYBE_CONST if
1001 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1002 expression because it contains an evaluated operator (in C99) or an
1003 operator outside of sizeof returning an integer constant (in C90)
1004 not permitted in constant expressions, or because it contains an
1005 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1006 set to true by callers before calling this function.) Return the
1007 folded expression. Function arguments have already been folded
1008 before calling this function, as have the contents of SAVE_EXPR,
1009 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1010 C_MAYBE_CONST_EXPR. */
1013 c_fully_fold (tree expr
, bool in_init
, bool *maybe_const
)
1016 tree eptype
= NULL_TREE
;
1018 bool maybe_const_itself
= true;
1019 location_t loc
= EXPR_LOCATION (expr
);
1021 /* This function is not relevant to C++ because C++ folds while
1022 parsing, and may need changes to be correct for C++ when C++
1023 stops folding while parsing. */
1024 if (c_dialect_cxx ())
1028 maybe_const
= &dummy
;
1029 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
1031 eptype
= TREE_TYPE (expr
);
1032 expr
= TREE_OPERAND (expr
, 0);
1034 ret
= c_fully_fold_internal (expr
, in_init
, maybe_const
,
1035 &maybe_const_itself
);
1037 ret
= fold_convert_loc (loc
, eptype
, ret
);
1038 *maybe_const
&= maybe_const_itself
;
1042 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1043 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1044 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1045 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1046 both evaluated and unevaluated subexpressions while
1047 *MAYBE_CONST_ITSELF is carried from only evaluated
1051 c_fully_fold_internal (tree expr
, bool in_init
, bool *maybe_const_operands
,
1052 bool *maybe_const_itself
)
1055 enum tree_code code
= TREE_CODE (expr
);
1056 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
1057 location_t loc
= EXPR_LOCATION (expr
);
1058 tree op0
, op1
, op2
, op3
;
1059 tree orig_op0
, orig_op1
, orig_op2
;
1060 bool op0_const
= true, op1_const
= true, op2_const
= true;
1061 bool op0_const_self
= true, op1_const_self
= true, op2_const_self
= true;
1062 bool nowarning
= TREE_NO_WARNING (expr
);
1065 /* This function is not relevant to C++ because C++ folds while
1066 parsing, and may need changes to be correct for C++ when C++
1067 stops folding while parsing. */
1068 if (c_dialect_cxx ())
1071 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1072 anything else not counted as an expression cannot usefully be
1073 folded further at this point. */
1074 if (!IS_EXPR_CODE_CLASS (kind
)
1075 || kind
== tcc_statement
1076 || code
== SAVE_EXPR
)
1079 /* Operands of variable-length expressions (function calls) have
1080 already been folded, as have __builtin_* function calls, and such
1081 expressions cannot occur in constant expressions. */
1082 if (kind
== tcc_vl_exp
)
1084 *maybe_const_operands
= false;
1089 if (code
== C_MAYBE_CONST_EXPR
)
1091 tree pre
= C_MAYBE_CONST_EXPR_PRE (expr
);
1092 tree inner
= C_MAYBE_CONST_EXPR_EXPR (expr
);
1093 if (C_MAYBE_CONST_EXPR_NON_CONST (expr
))
1094 *maybe_const_operands
= false;
1095 if (C_MAYBE_CONST_EXPR_INT_OPERANDS (expr
))
1096 *maybe_const_itself
= false;
1097 if (pre
&& !in_init
)
1098 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), pre
, inner
);
1104 /* Assignment, increment, decrement, function call and comma
1105 operators, and statement expressions, cannot occur in constant
1106 expressions if evaluated / outside of sizeof. (Function calls
1107 were handled above, though VA_ARG_EXPR is treated like a function
1108 call here, and statement expressions are handled through
1109 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1113 case PREDECREMENT_EXPR
:
1114 case PREINCREMENT_EXPR
:
1115 case POSTDECREMENT_EXPR
:
1116 case POSTINCREMENT_EXPR
:
1118 *maybe_const_operands
= false;
1125 *maybe_const_operands
= false;
1133 /* Fold individual tree codes as appropriate. */
1136 case COMPOUND_LITERAL_EXPR
:
1137 /* Any non-constancy will have been marked in a containing
1138 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1142 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1143 op1
= TREE_OPERAND (expr
, 1);
1144 op2
= TREE_OPERAND (expr
, 2);
1145 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1146 maybe_const_itself
);
1147 STRIP_TYPE_NOPS (op0
);
1148 if (op0
!= orig_op0
)
1149 ret
= build3 (COMPONENT_REF
, TREE_TYPE (expr
), op0
, op1
, op2
);
1152 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1153 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1158 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1159 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1160 op2
= TREE_OPERAND (expr
, 2);
1161 op3
= TREE_OPERAND (expr
, 3);
1162 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1163 maybe_const_itself
);
1164 STRIP_TYPE_NOPS (op0
);
1165 op1
= c_fully_fold_internal (op1
, in_init
, maybe_const_operands
,
1166 maybe_const_itself
);
1167 STRIP_TYPE_NOPS (op1
);
1168 op1
= decl_constant_value_for_optimization (op1
);
1169 if (op0
!= orig_op0
|| op1
!= orig_op1
)
1170 ret
= build4 (ARRAY_REF
, TREE_TYPE (expr
), op0
, op1
, op2
, op3
);
1173 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1174 TREE_SIDE_EFFECTS (ret
) = TREE_SIDE_EFFECTS (expr
);
1175 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1182 case PREDECREMENT_EXPR
:
1183 case PREINCREMENT_EXPR
:
1184 case POSTDECREMENT_EXPR
:
1185 case POSTINCREMENT_EXPR
:
1189 case POINTER_PLUS_EXPR
:
1190 case TRUNC_DIV_EXPR
:
1192 case FLOOR_DIV_EXPR
:
1193 case TRUNC_MOD_EXPR
:
1195 case EXACT_DIV_EXPR
:
1208 case TRUTH_AND_EXPR
:
1210 case TRUTH_XOR_EXPR
:
1211 case UNORDERED_EXPR
:
1218 /* Binary operations evaluating both arguments (increment and
1219 decrement are binary internally in GCC). */
1220 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1221 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1222 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1223 maybe_const_itself
);
1224 STRIP_TYPE_NOPS (op0
);
1225 if (code
!= MODIFY_EXPR
1226 && code
!= PREDECREMENT_EXPR
1227 && code
!= PREINCREMENT_EXPR
1228 && code
!= POSTDECREMENT_EXPR
1229 && code
!= POSTINCREMENT_EXPR
)
1230 op0
= decl_constant_value_for_optimization (op0
);
1231 /* The RHS of a MODIFY_EXPR was fully folded when building that
1232 expression for the sake of conversion warnings. */
1233 if (code
!= MODIFY_EXPR
)
1234 op1
= c_fully_fold_internal (op1
, in_init
, maybe_const_operands
,
1235 maybe_const_itself
);
1236 STRIP_TYPE_NOPS (op1
);
1237 op1
= decl_constant_value_for_optimization (op1
);
1238 if (op0
!= orig_op0
|| op1
!= orig_op1
|| in_init
)
1240 ? fold_build2_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
)
1241 : fold_build2_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
);
1244 if (TREE_OVERFLOW_P (ret
)
1245 && !TREE_OVERFLOW_P (op0
)
1246 && !TREE_OVERFLOW_P (op1
))
1247 overflow_warning (EXPR_LOCATION (expr
), ret
);
1251 case FIX_TRUNC_EXPR
:
1254 case VIEW_CONVERT_EXPR
:
1255 case NON_LVALUE_EXPR
:
1258 case TRUTH_NOT_EXPR
:
1263 /* Unary operations. */
1264 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1265 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1266 maybe_const_itself
);
1267 STRIP_TYPE_NOPS (op0
);
1268 if (code
!= ADDR_EXPR
&& code
!= REALPART_EXPR
&& code
!= IMAGPART_EXPR
)
1269 op0
= decl_constant_value_for_optimization (op0
);
1270 /* ??? Cope with user tricks that amount to offsetof. The middle-end is
1271 not prepared to deal with them if they occur in initializers. */
1273 && code
== ADDR_EXPR
1274 && (op1
= get_base_address (op0
)) != NULL_TREE
1275 && TREE_CODE (op1
) == INDIRECT_REF
1276 && TREE_CONSTANT (TREE_OPERAND (op1
, 0)))
1277 ret
= fold_convert_loc (loc
, TREE_TYPE (expr
), fold_offsetof_1 (op0
));
1278 else if (op0
!= orig_op0
|| in_init
)
1280 ? fold_build1_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
)
1281 : fold_build1_loc (loc
, code
, TREE_TYPE (expr
), op0
);
1284 if (code
== INDIRECT_REF
1286 && TREE_CODE (ret
) == INDIRECT_REF
)
1288 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1289 TREE_SIDE_EFFECTS (ret
) = TREE_SIDE_EFFECTS (expr
);
1290 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1294 case FIX_TRUNC_EXPR
:
1297 /* Don't warn about explicit conversions. We will already
1298 have warned about suspect implicit conversions. */
1302 if (TREE_OVERFLOW_P (ret
) && !TREE_OVERFLOW_P (op0
))
1303 overflow_warning (EXPR_LOCATION (expr
), ret
);
1308 case TRUTH_ANDIF_EXPR
:
1309 case TRUTH_ORIF_EXPR
:
1310 /* Binary operations not necessarily evaluating both
1312 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1313 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1314 op0
= c_fully_fold_internal (op0
, in_init
, &op0_const
, &op0_const_self
);
1315 STRIP_TYPE_NOPS (op0
);
1317 unused_p
= (op0
== (code
== TRUTH_ANDIF_EXPR
1318 ? truthvalue_false_node
1319 : truthvalue_true_node
));
1320 c_disable_warnings (unused_p
);
1321 op1
= c_fully_fold_internal (op1
, in_init
, &op1_const
, &op1_const_self
);
1322 STRIP_TYPE_NOPS (op1
);
1323 c_enable_warnings (unused_p
);
1325 if (op0
!= orig_op0
|| op1
!= orig_op1
|| in_init
)
1327 ? fold_build2_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
)
1328 : fold_build2_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
);
1331 *maybe_const_operands
&= op0_const
;
1332 *maybe_const_itself
&= op0_const_self
;
1336 && (code
== TRUTH_ANDIF_EXPR
1337 ? op0
== truthvalue_false_node
1338 : op0
== truthvalue_true_node
)))
1339 *maybe_const_operands
&= op1_const
;
1342 && (code
== TRUTH_ANDIF_EXPR
1343 ? op0
== truthvalue_false_node
1344 : op0
== truthvalue_true_node
)))
1345 *maybe_const_itself
&= op1_const_self
;
1349 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1350 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1351 orig_op2
= op2
= TREE_OPERAND (expr
, 2);
1352 op0
= c_fully_fold_internal (op0
, in_init
, &op0_const
, &op0_const_self
);
1354 STRIP_TYPE_NOPS (op0
);
1355 c_disable_warnings (op0
== truthvalue_false_node
);
1356 op1
= c_fully_fold_internal (op1
, in_init
, &op1_const
, &op1_const_self
);
1357 STRIP_TYPE_NOPS (op1
);
1358 c_enable_warnings (op0
== truthvalue_false_node
);
1360 c_disable_warnings (op0
== truthvalue_true_node
);
1361 op2
= c_fully_fold_internal (op2
, in_init
, &op2_const
, &op2_const_self
);
1362 STRIP_TYPE_NOPS (op2
);
1363 c_enable_warnings (op0
== truthvalue_true_node
);
1365 if (op0
!= orig_op0
|| op1
!= orig_op1
|| op2
!= orig_op2
)
1366 ret
= fold_build3_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
, op2
);
1369 *maybe_const_operands
&= op0_const
;
1370 *maybe_const_itself
&= op0_const_self
;
1374 && op0
== truthvalue_false_node
))
1375 *maybe_const_operands
&= op1_const
;
1378 && op0
== truthvalue_false_node
))
1379 *maybe_const_itself
&= op1_const_self
;
1383 && op0
== truthvalue_true_node
))
1384 *maybe_const_operands
&= op2_const
;
1387 && op0
== truthvalue_true_node
))
1388 *maybe_const_itself
&= op2_const_self
;
1391 case EXCESS_PRECISION_EXPR
:
1392 /* Each case where an operand with excess precision may be
1393 encountered must remove the EXCESS_PRECISION_EXPR around
1394 inner operands and possibly put one around the whole
1395 expression or possibly convert to the semantic type (which
1396 c_fully_fold does); we cannot tell at this stage which is
1397 appropriate in any particular case. */
1401 /* Various codes may appear through folding built-in functions
1402 and their arguments. */
1407 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1408 have been done by this point, so remove them again. */
1409 nowarning
|= TREE_NO_WARNING (ret
);
1410 STRIP_TYPE_NOPS (ret
);
1411 if (nowarning
&& !TREE_NO_WARNING (ret
))
1413 if (!CAN_HAVE_LOCATION_P (ret
))
1414 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
1415 TREE_NO_WARNING (ret
) = 1;
1418 protected_set_expr_location (ret
, loc
);
1422 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1423 return EXP. Otherwise, return either EXP or its known constant
1424 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1425 Is the BLKmode test appropriate? */
1428 decl_constant_value_for_optimization (tree exp
)
1432 /* This function is only used by C, for c_fully_fold and other
1433 optimization, and may not be correct for C++. */
1434 if (c_dialect_cxx ())
1438 || TREE_CODE (exp
) != VAR_DECL
1439 || TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
1440 || DECL_MODE (exp
) == BLKmode
)
1443 ret
= decl_constant_value (exp
);
1444 /* Avoid unwanted tree sharing between the initializer and current
1445 function's body where the tree can be modified e.g. by the
1447 if (ret
!= exp
&& TREE_STATIC (exp
))
1448 ret
= unshare_expr (ret
);
1452 /* Print a warning if a constant expression had overflow in folding.
1453 Invoke this function on every expression that the language
1454 requires to be a constant expression.
1455 Note the ANSI C standard says it is erroneous for a
1456 constant expression to overflow. */
1459 constant_expression_warning (tree value
)
1461 if (warn_overflow
&& pedantic
1462 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1463 || TREE_CODE (value
) == FIXED_CST
1464 || TREE_CODE (value
) == VECTOR_CST
1465 || TREE_CODE (value
) == COMPLEX_CST
)
1466 && TREE_OVERFLOW (value
))
1467 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1470 /* The same as above but print an unconditional error. */
1472 constant_expression_error (tree value
)
1474 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1475 || TREE_CODE (value
) == FIXED_CST
1476 || TREE_CODE (value
) == VECTOR_CST
1477 || TREE_CODE (value
) == COMPLEX_CST
)
1478 && TREE_OVERFLOW (value
))
1479 error ("overflow in constant expression");
1482 /* Print a warning if an expression had overflow in folding and its
1485 Invoke this function on every expression that
1486 (1) appears in the source code, and
1487 (2) is a constant expression that overflowed, and
1488 (3) is not already checked by convert_and_check;
1489 however, do not invoke this function on operands of explicit casts
1490 or when the expression is the result of an operator and any operand
1491 already overflowed. */
1494 overflow_warning (location_t loc
, tree value
)
1496 if (c_inhibit_evaluation_warnings
!= 0)
1499 switch (TREE_CODE (value
))
1502 warning_at (loc
, OPT_Woverflow
, "integer overflow in expression");
1506 warning_at (loc
, OPT_Woverflow
,
1507 "floating point overflow in expression");
1511 warning_at (loc
, OPT_Woverflow
, "fixed-point overflow in expression");
1515 warning_at (loc
, OPT_Woverflow
, "vector overflow in expression");
1519 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1520 warning_at (loc
, OPT_Woverflow
,
1521 "complex integer overflow in expression");
1522 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1523 warning_at (loc
, OPT_Woverflow
,
1524 "complex floating point overflow in expression");
1532 /* Warn about uses of logical || / && operator in a context where it
1533 is likely that the bitwise equivalent was intended by the
1534 programmer. We have seen an expression in which CODE is a binary
1535 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1536 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1538 warn_logical_operator (location_t location
, enum tree_code code
, tree type
,
1539 enum tree_code code_left
, tree op_left
,
1540 enum tree_code
ARG_UNUSED (code_right
), tree op_right
)
1542 int or_op
= (code
== TRUTH_ORIF_EXPR
|| code
== TRUTH_OR_EXPR
);
1543 int in0_p
, in1_p
, in_p
;
1544 tree low0
, low1
, low
, high0
, high1
, high
, lhs
, rhs
, tem
;
1545 bool strict_overflow_p
= false;
1547 if (code
!= TRUTH_ANDIF_EXPR
1548 && code
!= TRUTH_AND_EXPR
1549 && code
!= TRUTH_ORIF_EXPR
1550 && code
!= TRUTH_OR_EXPR
)
1553 /* Warn if &&/|| are being used in a context where it is
1554 likely that the bitwise equivalent was intended by the
1555 programmer. That is, an expression such as op && MASK
1556 where op should not be any boolean expression, nor a
1557 constant, and mask seems to be a non-boolean integer constant. */
1558 if (!truth_value_p (code_left
)
1559 && INTEGRAL_TYPE_P (TREE_TYPE (op_left
))
1560 && !CONSTANT_CLASS_P (op_left
)
1561 && !TREE_NO_WARNING (op_left
)
1562 && TREE_CODE (op_right
) == INTEGER_CST
1563 && !integer_zerop (op_right
)
1564 && !integer_onep (op_right
))
1567 warning_at (location
, OPT_Wlogical_op
, "logical %<or%>"
1568 " applied to non-boolean constant");
1570 warning_at (location
, OPT_Wlogical_op
, "logical %<and%>"
1571 " applied to non-boolean constant");
1572 TREE_NO_WARNING (op_left
) = true;
1576 /* We do not warn for constants because they are typical of macro
1577 expansions that test for features. */
1578 if (CONSTANT_CLASS_P (op_left
) || CONSTANT_CLASS_P (op_right
))
1581 /* This warning only makes sense with logical operands. */
1582 if (!(truth_value_p (TREE_CODE (op_left
))
1583 || INTEGRAL_TYPE_P (TREE_TYPE (op_left
)))
1584 || !(truth_value_p (TREE_CODE (op_right
))
1585 || INTEGRAL_TYPE_P (TREE_TYPE (op_right
))))
1588 lhs
= make_range (op_left
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
1589 rhs
= make_range (op_right
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
1591 if (lhs
&& TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
1592 lhs
= C_MAYBE_CONST_EXPR_EXPR (lhs
);
1594 if (rhs
&& TREE_CODE (rhs
) == C_MAYBE_CONST_EXPR
)
1595 rhs
= C_MAYBE_CONST_EXPR_EXPR (rhs
);
1597 /* If this is an OR operation, invert both sides; we will invert
1598 again at the end. */
1600 in0_p
= !in0_p
, in1_p
= !in1_p
;
1602 /* If both expressions are the same, if we can merge the ranges, and we
1603 can build the range test, return it or it inverted. */
1604 if (lhs
&& rhs
&& operand_equal_p (lhs
, rhs
, 0)
1605 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
1607 && 0 != (tem
= build_range_check (UNKNOWN_LOCATION
,
1608 type
, lhs
, in_p
, low
, high
)))
1610 if (TREE_CODE (tem
) != INTEGER_CST
)
1614 warning_at (location
, OPT_Wlogical_op
,
1616 "of collectively exhaustive tests is always true");
1618 warning_at (location
, OPT_Wlogical_op
,
1620 "of mutually exclusive tests is always false");
1625 /* Print a warning about casts that might indicate violation
1626 of strict aliasing rules if -Wstrict-aliasing is used and
1627 strict aliasing mode is in effect. OTYPE is the original
1628 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1631 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1633 /* Strip pointer conversion chains and get to the correct original type. */
1635 otype
= TREE_TYPE (expr
);
1637 if (!(flag_strict_aliasing
1638 && POINTER_TYPE_P (type
)
1639 && POINTER_TYPE_P (otype
)
1640 && !VOID_TYPE_P (TREE_TYPE (type
)))
1641 /* If the type we are casting to is a ref-all pointer
1642 dereferencing it is always valid. */
1643 || TYPE_REF_CAN_ALIAS_ALL (type
))
1646 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1647 && (DECL_P (TREE_OPERAND (expr
, 0))
1648 || handled_component_p (TREE_OPERAND (expr
, 0))))
1650 /* Casting the address of an object to non void pointer. Warn
1651 if the cast breaks type based aliasing. */
1652 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1654 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1655 "might break strict-aliasing rules");
1660 /* warn_strict_aliasing >= 3. This includes the default (3).
1661 Only warn if the cast is dereferenced immediately. */
1662 alias_set_type set1
=
1663 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1664 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1666 if (set1
!= set2
&& set2
!= 0
1667 && (set1
== 0 || !alias_sets_conflict_p (set1
, set2
)))
1669 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1670 "pointer will break strict-aliasing rules");
1673 else if (warn_strict_aliasing
== 2
1674 && !alias_sets_must_conflict_p (set1
, set2
))
1676 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1677 "pointer might break strict-aliasing rules");
1683 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1685 /* At this level, warn for any conversions, even if an address is
1686 not taken in the same statement. This will likely produce many
1687 false positives, but could be useful to pinpoint problems that
1688 are not revealed at higher levels. */
1689 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1690 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1691 if (!COMPLETE_TYPE_P (type
)
1692 || !alias_sets_must_conflict_p (set1
, set2
))
1694 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1695 "pointer might break strict-aliasing rules");
1703 /* Warn for unlikely, improbable, or stupid DECL declarations
1707 check_main_parameter_types (tree decl
)
1709 function_args_iterator iter
;
1713 FOREACH_FUNCTION_ARGS (TREE_TYPE (decl
), type
, iter
)
1715 /* XXX void_type_node belies the abstraction. */
1716 if (type
== void_type_node
|| type
== error_mark_node
)
1723 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1724 pedwarn (input_location
, OPT_Wmain
,
1725 "first argument of %q+D should be %<int%>", decl
);
1729 if (TREE_CODE (type
) != POINTER_TYPE
1730 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1731 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1733 pedwarn (input_location
, OPT_Wmain
,
1734 "second argument of %q+D should be %<char **%>", decl
);
1738 if (TREE_CODE (type
) != POINTER_TYPE
1739 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1740 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1742 pedwarn (input_location
, OPT_Wmain
,
1743 "third argument of %q+D should probably be "
1744 "%<char **%>", decl
);
1749 /* It is intentional that this message does not mention the third
1750 argument because it's only mentioned in an appendix of the
1752 if (argct
> 0 && (argct
< 2 || argct
> 3))
1753 pedwarn (input_location
, OPT_Wmain
,
1754 "%q+D takes only zero or two arguments", decl
);
1757 /* True if pointers to distinct types T1 and T2 can be converted to
1758 each other without an explicit cast. Only returns true for opaque
1761 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
1763 if (TREE_CODE (t1
) == VECTOR_TYPE
&& TREE_CODE (t2
) == VECTOR_TYPE
1764 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
1765 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1771 /* True if vector types T1 and T2 can be converted to each other
1772 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1773 can only be converted with -flax-vector-conversions yet that is not
1774 in effect, emit a note telling the user about that option if such
1775 a note has not previously been emitted. */
1777 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
1779 static bool emitted_lax_note
= false;
1780 bool convertible_lax
;
1782 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
1783 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1787 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1788 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1789 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1790 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1791 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1793 if (!convertible_lax
|| flag_lax_vector_conversions
)
1794 return convertible_lax
;
1796 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1797 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1800 if (emit_lax_note
&& !emitted_lax_note
)
1802 emitted_lax_note
= true;
1803 inform (input_location
, "use -flax-vector-conversions to permit "
1804 "conversions between vectors with differing "
1805 "element types or numbers of subparts");
1811 /* Like tree.c:get_narrower, but retain conversion from C++0x scoped enum
1812 to integral type. */
1815 c_common_get_narrower (tree op
, int *unsignedp_ptr
)
1817 op
= get_narrower (op
, unsignedp_ptr
);
1819 if (TREE_CODE (TREE_TYPE (op
)) == ENUMERAL_TYPE
1820 && ENUM_IS_SCOPED (TREE_TYPE (op
)))
1822 /* C++0x scoped enumerations don't implicitly convert to integral
1823 type; if we stripped an explicit conversion to a larger type we
1824 need to replace it so common_type will still work. */
1825 tree type
= (lang_hooks
.types
.type_for_size
1826 (TYPE_PRECISION (TREE_TYPE (op
)),
1827 TYPE_UNSIGNED (TREE_TYPE (op
))));
1828 op
= fold_convert (type
, op
);
1833 /* This is a helper function of build_binary_op.
1835 For certain operations if both args were extended from the same
1836 smaller type, do the arithmetic in that type and then extend.
1838 BITWISE indicates a bitwise operation.
1839 For them, this optimization is safe only if
1840 both args are zero-extended or both are sign-extended.
1841 Otherwise, we might change the result.
1842 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1843 but calculated in (unsigned short) it would be (unsigned short)-1.
1846 shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1848 int unsigned0
, unsigned1
;
1853 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1854 excessive narrowing when we call get_narrower below. For
1855 example, suppose that OP0 is of unsigned int extended
1856 from signed char and that RESULT_TYPE is long long int.
1857 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1860 (long long int) (unsigned int) signed_char
1862 which get_narrower would narrow down to
1864 (unsigned int) signed char
1866 If we do not cast OP0 first, get_narrower would return
1867 signed_char, which is inconsistent with the case of the
1869 op0
= convert (result_type
, op0
);
1870 op1
= convert (result_type
, op1
);
1872 arg0
= c_common_get_narrower (op0
, &unsigned0
);
1873 arg1
= c_common_get_narrower (op1
, &unsigned1
);
1875 /* UNS is 1 if the operation to be done is an unsigned one. */
1876 uns
= TYPE_UNSIGNED (result_type
);
1878 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1879 but it *requires* conversion to FINAL_TYPE. */
1881 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1882 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1883 && TREE_TYPE (op0
) != result_type
)
1884 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1885 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1886 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1887 && TREE_TYPE (op1
) != result_type
)
1888 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1890 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1892 /* For bitwise operations, signedness of nominal type
1893 does not matter. Consider only how operands were extended. */
1897 /* Note that in all three cases below we refrain from optimizing
1898 an unsigned operation on sign-extended args.
1899 That would not be valid. */
1901 /* Both args variable: if both extended in same way
1902 from same width, do it in that width.
1903 Do it unsigned if args were zero-extended. */
1904 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1905 < TYPE_PRECISION (result_type
))
1906 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1907 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1908 && unsigned0
== unsigned1
1909 && (unsigned0
|| !uns
))
1910 return c_common_signed_or_unsigned_type
1911 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1913 else if (TREE_CODE (arg0
) == INTEGER_CST
1914 && (unsigned1
|| !uns
)
1915 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1916 < TYPE_PRECISION (result_type
))
1918 = c_common_signed_or_unsigned_type (unsigned1
,
1920 && !POINTER_TYPE_P (type
)
1921 && int_fits_type_p (arg0
, type
))
1924 else if (TREE_CODE (arg1
) == INTEGER_CST
1925 && (unsigned0
|| !uns
)
1926 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1927 < TYPE_PRECISION (result_type
))
1929 = c_common_signed_or_unsigned_type (unsigned0
,
1931 && !POINTER_TYPE_P (type
)
1932 && int_fits_type_p (arg1
, type
))
1938 /* Checks if expression EXPR of real/integer type cannot be converted
1939 to the real/integer type TYPE. Function returns true when:
1940 * EXPR is a constant which cannot be exactly converted to TYPE
1941 * EXPR is not a constant and size of EXPR's type > than size of TYPE,
1942 for EXPR type and TYPE being both integers or both real.
1943 * EXPR is not a constant of real type and TYPE is an integer.
1944 * EXPR is not a constant of integer type which cannot be
1945 exactly converted to real type.
1946 Function allows conversions between types of different signedness and
1947 does not return true in that case. Function can produce signedness
1948 warnings if PRODUCE_WARNS is true. */
1950 unsafe_conversion_p (tree type
, tree expr
, bool produce_warns
)
1952 bool give_warning
= false;
1953 tree expr_type
= TREE_TYPE (expr
);
1954 location_t loc
= EXPR_LOC_OR_HERE (expr
);
1956 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1958 /* Warn for real constant that is not an exact integer converted
1960 if (TREE_CODE (expr_type
) == REAL_TYPE
1961 && TREE_CODE (type
) == INTEGER_TYPE
)
1963 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
1964 give_warning
= true;
1966 /* Warn for an integer constant that does not fit into integer type. */
1967 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1968 && TREE_CODE (type
) == INTEGER_TYPE
1969 && !int_fits_type_p (expr
, type
))
1971 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
1972 && tree_int_cst_sgn (expr
) < 0)
1975 warning_at (loc
, OPT_Wsign_conversion
, "negative integer"
1976 " implicitly converted to unsigned type");
1978 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
1981 warning_at (loc
, OPT_Wsign_conversion
, "conversion of unsigned"
1982 " constant value to negative integer");
1985 give_warning
= true;
1987 else if (TREE_CODE (type
) == REAL_TYPE
)
1989 /* Warn for an integer constant that does not fit into real type. */
1990 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
1992 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1993 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1994 give_warning
= true;
1996 /* Warn for a real constant that does not fit into a smaller
1998 else if (TREE_CODE (expr_type
) == REAL_TYPE
1999 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2001 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2002 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2003 give_warning
= true;
2009 /* Warn for real types converted to integer types. */
2010 if (TREE_CODE (expr_type
) == REAL_TYPE
2011 && TREE_CODE (type
) == INTEGER_TYPE
)
2012 give_warning
= true;
2014 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2015 && TREE_CODE (type
) == INTEGER_TYPE
)
2017 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2018 expr
= get_unwidened (expr
, 0);
2019 expr_type
= TREE_TYPE (expr
);
2021 /* Don't warn for short y; short x = ((int)y & 0xff); */
2022 if (TREE_CODE (expr
) == BIT_AND_EXPR
2023 || TREE_CODE (expr
) == BIT_IOR_EXPR
2024 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2026 /* If both args were extended from a shortest type,
2027 use that type if that is safe. */
2028 expr_type
= shorten_binary_op (expr_type
,
2029 TREE_OPERAND (expr
, 0),
2030 TREE_OPERAND (expr
, 1),
2033 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2035 tree op0
= TREE_OPERAND (expr
, 0);
2036 tree op1
= TREE_OPERAND (expr
, 1);
2037 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2038 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2040 /* If one of the operands is a non-negative constant
2041 that fits in the target type, then the type of the
2042 other operand does not matter. */
2043 if ((TREE_CODE (op0
) == INTEGER_CST
2044 && int_fits_type_p (op0
, c_common_signed_type (type
))
2045 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2046 || (TREE_CODE (op1
) == INTEGER_CST
2047 && int_fits_type_p (op1
, c_common_signed_type (type
))
2048 && int_fits_type_p (op1
,
2049 c_common_unsigned_type (type
))))
2051 /* If constant is unsigned and fits in the target
2052 type, then the result will also fit. */
2053 else if ((TREE_CODE (op0
) == INTEGER_CST
2055 && int_fits_type_p (op0
, type
))
2056 || (TREE_CODE (op1
) == INTEGER_CST
2058 && int_fits_type_p (op1
, type
)))
2062 /* Warn for integer types converted to smaller integer types. */
2063 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2064 give_warning
= true;
2066 /* When they are the same width but different signedness,
2067 then the value may change. */
2068 else if (((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2069 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2070 /* Even when converted to a bigger type, if the type is
2071 unsigned but expr is signed, then negative values
2073 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2075 warning_at (loc
, OPT_Wsign_conversion
, "conversion to %qT from %qT "
2076 "may change the sign of the result",
2080 /* Warn for integer types converted to real types if and only if
2081 all the range of values of the integer type cannot be
2082 represented by the real type. */
2083 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2084 && TREE_CODE (type
) == REAL_TYPE
)
2086 tree type_low_bound
, type_high_bound
;
2087 REAL_VALUE_TYPE real_low_bound
, real_high_bound
;
2089 /* Don't warn about char y = 0xff; float x = (int) y; */
2090 expr
= get_unwidened (expr
, 0);
2091 expr_type
= TREE_TYPE (expr
);
2093 type_low_bound
= TYPE_MIN_VALUE (expr_type
);
2094 type_high_bound
= TYPE_MAX_VALUE (expr_type
);
2095 real_low_bound
= real_value_from_int_cst (0, type_low_bound
);
2096 real_high_bound
= real_value_from_int_cst (0, type_high_bound
);
2098 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
2099 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
2100 give_warning
= true;
2103 /* Warn for real types converted to smaller real types. */
2104 else if (TREE_CODE (expr_type
) == REAL_TYPE
2105 && TREE_CODE (type
) == REAL_TYPE
2106 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2107 give_warning
= true;
2110 return give_warning
;
2113 /* Warns if the conversion of EXPR to TYPE may alter a value.
2114 This is a helper function for warnings_for_convert_and_check. */
2117 conversion_warning (tree type
, tree expr
)
2119 tree expr_type
= TREE_TYPE (expr
);
2120 location_t loc
= EXPR_LOC_OR_HERE (expr
);
2122 if (!warn_conversion
&& !warn_sign_conversion
)
2125 switch (TREE_CODE (expr
))
2133 case TRUTH_ANDIF_EXPR
:
2134 case TRUTH_ORIF_EXPR
:
2135 case TRUTH_AND_EXPR
:
2137 case TRUTH_XOR_EXPR
:
2138 case TRUTH_NOT_EXPR
:
2139 /* Conversion from boolean to a signed:1 bit-field (which only
2140 can hold the values 0 and -1) doesn't lose information - but
2141 it does change the value. */
2142 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2143 warning_at (loc
, OPT_Wconversion
,
2144 "conversion to %qT from boolean expression", type
);
2149 if (unsafe_conversion_p (type
, expr
, true))
2150 warning_at (loc
, OPT_Wconversion
,
2151 "conversion to %qT alters %qT constant value",
2157 /* In case of COND_EXPR, if both operands are constants or
2158 COND_EXPR, then we do not care about the type of COND_EXPR,
2159 only about the conversion of each operand. */
2160 tree op1
= TREE_OPERAND (expr
, 1);
2161 tree op2
= TREE_OPERAND (expr
, 2);
2163 if ((TREE_CODE (op1
) == REAL_CST
|| TREE_CODE (op1
) == INTEGER_CST
2164 || TREE_CODE (op1
) == COND_EXPR
)
2165 && (TREE_CODE (op2
) == REAL_CST
|| TREE_CODE (op2
) == INTEGER_CST
2166 || TREE_CODE (op2
) == COND_EXPR
))
2168 conversion_warning (type
, op1
);
2169 conversion_warning (type
, op2
);
2175 default: /* 'expr' is not a constant. */
2176 if (unsafe_conversion_p (type
, expr
, true))
2177 warning_at (loc
, OPT_Wconversion
,
2178 "conversion to %qT from %qT may alter its value",
2183 /* Produce warnings after a conversion. RESULT is the result of
2184 converting EXPR to TYPE. This is a helper function for
2185 convert_and_check and cp_convert_and_check. */
2188 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
2190 if (TREE_CODE (expr
) == INTEGER_CST
2191 && (TREE_CODE (type
) == INTEGER_TYPE
2192 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2193 && !int_fits_type_p (expr
, type
))
2195 /* Do not diagnose overflow in a constant expression merely
2196 because a conversion overflowed. */
2197 if (TREE_OVERFLOW (result
))
2198 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2200 if (TYPE_UNSIGNED (type
))
2202 /* This detects cases like converting -129 or 256 to
2204 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2205 warning (OPT_Woverflow
,
2206 "large integer implicitly truncated to unsigned type");
2208 conversion_warning (type
, expr
);
2210 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2211 warning (OPT_Woverflow
,
2212 "overflow in implicit constant conversion");
2213 /* No warning for converting 0x80000000 to int. */
2215 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2216 || TYPE_PRECISION (TREE_TYPE (expr
))
2217 != TYPE_PRECISION (type
)))
2218 warning (OPT_Woverflow
,
2219 "overflow in implicit constant conversion");
2222 conversion_warning (type
, expr
);
2224 else if ((TREE_CODE (result
) == INTEGER_CST
2225 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2226 warning (OPT_Woverflow
,
2227 "overflow in implicit constant conversion");
2229 conversion_warning (type
, expr
);
2233 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2234 Invoke this function on every expression that is converted implicitly,
2235 i.e. because of language rules and not because of an explicit cast. */
2238 convert_and_check (tree type
, tree expr
)
2241 tree expr_for_warning
;
2243 /* Convert from a value with possible excess precision rather than
2244 via the semantic type, but do not warn about values not fitting
2245 exactly in the semantic type. */
2246 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2248 tree orig_type
= TREE_TYPE (expr
);
2249 expr
= TREE_OPERAND (expr
, 0);
2250 expr_for_warning
= convert (orig_type
, expr
);
2251 if (orig_type
== type
)
2252 return expr_for_warning
;
2255 expr_for_warning
= expr
;
2257 if (TREE_TYPE (expr
) == type
)
2260 result
= convert (type
, expr
);
2262 if (c_inhibit_evaluation_warnings
== 0
2263 && !TREE_OVERFLOW_P (expr
)
2264 && result
!= error_mark_node
)
2265 warnings_for_convert_and_check (type
, expr_for_warning
, result
);
2270 /* A node in a list that describes references to variables (EXPR), which are
2271 either read accesses if WRITER is zero, or write accesses, in which case
2272 WRITER is the parent of EXPR. */
2279 /* Used to implement a cache the results of a call to verify_tree. We only
2280 use this for SAVE_EXPRs. */
2283 struct tlist_cache
*next
;
2284 struct tlist
*cache_before_sp
;
2285 struct tlist
*cache_after_sp
;
2289 /* Obstack to use when allocating tlist structures, and corresponding
2291 static struct obstack tlist_obstack
;
2292 static char *tlist_firstobj
= 0;
2294 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2296 static struct tlist
*warned_ids
;
2297 /* SAVE_EXPRs need special treatment. We process them only once and then
2298 cache the results. */
2299 static struct tlist_cache
*save_expr_cache
;
2301 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2302 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2303 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2304 static int warning_candidate_p (tree
);
2305 static bool candidate_equal_p (const_tree
, const_tree
);
2306 static void warn_for_collisions (struct tlist
*);
2307 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2308 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2310 /* Create a new struct tlist and fill in its fields. */
2311 static struct tlist
*
2312 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2315 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2322 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2323 is nonnull, we ignore any node we find which has a writer equal to it. */
2326 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2330 struct tlist
*next
= add
->next
;
2333 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2334 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2339 /* Merge the nodes of ADD into TO. This merging process is done so that for
2340 each variable that already exists in TO, no new node is added; however if
2341 there is a write access recorded in ADD, and an occurrence on TO is only
2342 a read access, then the occurrence in TO will be modified to record the
2346 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2348 struct tlist
**end
= to
;
2351 end
= &(*end
)->next
;
2357 struct tlist
*next
= add
->next
;
2359 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2360 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2364 tmp2
->writer
= add
->writer
;
2368 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
2369 end
= &(*end
)->next
;
2376 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2377 references in list LIST conflict with it, excluding reads if ONLY writers
2381 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2386 /* Avoid duplicate warnings. */
2387 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2388 if (candidate_equal_p (tmp
->expr
, written
))
2393 if (candidate_equal_p (list
->expr
, written
)
2394 && !candidate_equal_p (list
->writer
, writer
)
2395 && (!only_writes
|| list
->writer
))
2397 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2398 warning_at (EXPR_LOC_OR_HERE (writer
),
2399 OPT_Wsequence_point
, "operation on %qE may be undefined",
2406 /* Given a list LIST of references to variables, find whether any of these
2407 can cause conflicts due to missing sequence points. */
2410 warn_for_collisions (struct tlist
*list
)
2414 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
2417 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
2421 /* Return nonzero if X is a tree that can be verified by the sequence point
2424 warning_candidate_p (tree x
)
2426 if (DECL_P (x
) && DECL_ARTIFICIAL (x
))
2429 if (TREE_CODE (x
) == BLOCK
)
2432 /* VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2433 (lvalue_p) crash on TRY/CATCH. */
2434 if (TREE_TYPE (x
) == NULL_TREE
|| VOID_TYPE_P (TREE_TYPE (x
)))
2440 /* No point to track non-const calls, they will never satisfy
2442 if (TREE_CODE (x
) == CALL_EXPR
&& (call_expr_flags (x
) & ECF_CONST
) == 0)
2445 if (TREE_CODE (x
) == STRING_CST
)
2451 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2453 candidate_equal_p (const_tree x
, const_tree y
)
2455 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
2458 /* Walk the tree X, and record accesses to variables. If X is written by the
2459 parent tree, WRITER is the parent.
2460 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2461 expression or its only operand forces a sequence point, then everything up
2462 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2464 Once we return, we will have emitted warnings if any subexpression before
2465 such a sequence point could be undefined. On a higher level, however, the
2466 sequence point may not be relevant, and we'll merge the two lists.
2468 Example: (b++, a) + b;
2469 The call that processes the COMPOUND_EXPR will store the increment of B
2470 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2471 processes the PLUS_EXPR will need to merge the two lists so that
2472 eventually, all accesses end up on the same list (and we'll warn about the
2473 unordered subexpressions b++ and b.
2475 A note on merging. If we modify the former example so that our expression
2478 care must be taken not simply to add all three expressions into the final
2479 PNO_SP list. The function merge_tlist takes care of that by merging the
2480 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2481 way, so that no more than one access to B is recorded. */
2484 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
2487 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
2488 enum tree_code code
;
2489 enum tree_code_class cl
;
2491 /* X may be NULL if it is the operand of an empty statement expression
2497 code
= TREE_CODE (x
);
2498 cl
= TREE_CODE_CLASS (code
);
2500 if (warning_candidate_p (x
))
2501 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
2509 case TRUTH_ANDIF_EXPR
:
2510 case TRUTH_ORIF_EXPR
:
2511 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2512 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2513 warn_for_collisions (tmp_nosp
);
2514 merge_tlist (pbefore_sp
, tmp_before
, 0);
2515 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
2516 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
2517 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2521 tmp_before
= tmp_list2
= 0;
2522 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
2523 warn_for_collisions (tmp_list2
);
2524 merge_tlist (pbefore_sp
, tmp_before
, 0);
2525 merge_tlist (pbefore_sp
, tmp_list2
, 1);
2527 tmp_list3
= tmp_nosp
= 0;
2528 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
2529 warn_for_collisions (tmp_nosp
);
2530 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2532 tmp_list3
= tmp_list2
= 0;
2533 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
2534 warn_for_collisions (tmp_list2
);
2535 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2536 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2537 two first, to avoid warning for (a ? b++ : b++). */
2538 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
2539 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2542 case PREDECREMENT_EXPR
:
2543 case PREINCREMENT_EXPR
:
2544 case POSTDECREMENT_EXPR
:
2545 case POSTINCREMENT_EXPR
:
2546 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
2550 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2551 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2552 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
2553 /* Expressions inside the LHS are not ordered wrt. the sequence points
2554 in the RHS. Example:
2556 Despite the fact that the modification of "a" is in the before_sp
2557 list (tmp_before), it conflicts with the use of "a" in the LHS.
2558 We can handle this by adding the contents of tmp_list3
2559 to those of tmp_before, and redoing the collision warnings for that
2561 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
2562 warn_for_collisions (tmp_before
);
2563 /* Exclude the LHS itself here; we first have to merge it into the
2564 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2565 didn't exclude the LHS, we'd get it twice, once as a read and once
2567 add_tlist (pno_sp
, tmp_list3
, x
, 0);
2568 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
2570 merge_tlist (pbefore_sp
, tmp_before
, 0);
2571 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
2572 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
2573 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
2577 /* We need to warn about conflicts among arguments and conflicts between
2578 args and the function address. Side effects of the function address,
2579 however, are not ordered by the sequence point of the call. */
2581 call_expr_arg_iterator iter
;
2583 tmp_before
= tmp_nosp
= 0;
2584 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2585 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
2587 tmp_list2
= tmp_list3
= 0;
2588 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
2589 merge_tlist (&tmp_list3
, tmp_list2
, 0);
2590 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
2592 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
2593 warn_for_collisions (tmp_before
);
2594 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
2599 /* Scan all the list, e.g. indices of multi dimensional array. */
2602 tmp_before
= tmp_nosp
= 0;
2603 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2604 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2605 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2612 struct tlist_cache
*t
;
2613 for (t
= save_expr_cache
; t
; t
= t
->next
)
2614 if (candidate_equal_p (t
->expr
, x
))
2619 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
2620 t
->next
= save_expr_cache
;
2622 save_expr_cache
= t
;
2624 tmp_before
= tmp_nosp
= 0;
2625 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2626 warn_for_collisions (tmp_nosp
);
2631 struct tlist
*t
= tmp_nosp
;
2633 merge_tlist (&tmp_list3
, t
, 0);
2635 t
->cache_before_sp
= tmp_before
;
2636 t
->cache_after_sp
= tmp_list3
;
2638 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
2639 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
2644 x
= TREE_OPERAND (x
, 0);
2651 /* For other expressions, simply recurse on their operands.
2652 Manual tail recursion for unary expressions.
2653 Other non-expressions need not be processed. */
2654 if (cl
== tcc_unary
)
2656 x
= TREE_OPERAND (x
, 0);
2660 else if (IS_EXPR_CODE_CLASS (cl
))
2663 int max
= TREE_OPERAND_LENGTH (x
);
2664 for (lp
= 0; lp
< max
; lp
++)
2666 tmp_before
= tmp_nosp
= 0;
2667 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
2668 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2669 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2676 /* Try to warn for undefined behavior in EXPR due to missing sequence
2680 verify_sequence_points (tree expr
)
2682 struct tlist
*before_sp
= 0, *after_sp
= 0;
2685 save_expr_cache
= 0;
2686 if (tlist_firstobj
== 0)
2688 gcc_obstack_init (&tlist_obstack
);
2689 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
2692 verify_tree (expr
, &before_sp
, &after_sp
, 0);
2693 warn_for_collisions (after_sp
);
2694 obstack_free (&tlist_obstack
, tlist_firstobj
);
2697 /* Validate the expression after `case' and apply default promotions. */
2700 check_case_value (tree value
)
2702 if (value
== NULL_TREE
)
2705 if (TREE_CODE (value
) == INTEGER_CST
)
2706 /* Promote char or short to int. */
2707 value
= perform_integral_promotions (value
);
2708 else if (value
!= error_mark_node
)
2710 error ("case label does not reduce to an integer constant");
2711 value
= error_mark_node
;
2714 constant_expression_warning (value
);
2719 /* See if the case values LOW and HIGH are in the range of the original
2720 type (i.e. before the default conversion to int) of the switch testing
2722 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2723 the type before promoting it. CASE_LOW_P is a pointer to the lower
2724 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2725 if the case is not a case range.
2726 The caller has to make sure that we are not called with NULL for
2727 CASE_LOW_P (i.e. the default case).
2728 Returns true if the case label is in range of ORIG_TYPE (saturated or
2729 untouched) or false if the label is out of range. */
2732 check_case_bounds (tree type
, tree orig_type
,
2733 tree
*case_low_p
, tree
*case_high_p
)
2735 tree min_value
, max_value
;
2736 tree case_low
= *case_low_p
;
2737 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2739 /* If there was a problem with the original type, do nothing. */
2740 if (orig_type
== error_mark_node
)
2743 min_value
= TYPE_MIN_VALUE (orig_type
);
2744 max_value
= TYPE_MAX_VALUE (orig_type
);
2746 /* Case label is less than minimum for type. */
2747 if (tree_int_cst_compare (case_low
, min_value
) < 0
2748 && tree_int_cst_compare (case_high
, min_value
) < 0)
2750 warning (0, "case label value is less than minimum value for type");
2754 /* Case value is greater than maximum for type. */
2755 if (tree_int_cst_compare (case_low
, max_value
) > 0
2756 && tree_int_cst_compare (case_high
, max_value
) > 0)
2758 warning (0, "case label value exceeds maximum value for type");
2762 /* Saturate lower case label value to minimum. */
2763 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2764 && tree_int_cst_compare (case_low
, min_value
) < 0)
2766 warning (0, "lower value in case label range"
2767 " less than minimum value for type");
2768 case_low
= min_value
;
2771 /* Saturate upper case label value to maximum. */
2772 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2773 && tree_int_cst_compare (case_high
, max_value
) > 0)
2775 warning (0, "upper value in case label range"
2776 " exceeds maximum value for type");
2777 case_high
= max_value
;
2780 if (*case_low_p
!= case_low
)
2781 *case_low_p
= convert (type
, case_low
);
2782 if (case_high_p
&& *case_high_p
!= case_high
)
2783 *case_high_p
= convert (type
, case_high
);
2788 /* Return an integer type with BITS bits of precision,
2789 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2792 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2794 if (bits
== TYPE_PRECISION (integer_type_node
))
2795 return unsignedp
? unsigned_type_node
: integer_type_node
;
2797 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2798 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2800 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2801 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2803 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2804 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2806 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2807 return (unsignedp
? long_long_unsigned_type_node
2808 : long_long_integer_type_node
);
2810 if (int128_integer_type_node
2811 && bits
== TYPE_PRECISION (int128_integer_type_node
))
2812 return (unsignedp
? int128_unsigned_type_node
2813 : int128_integer_type_node
);
2815 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2816 return (unsignedp
? widest_unsigned_literal_type_node
2817 : widest_integer_literal_type_node
);
2819 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2820 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2822 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2823 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2825 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2826 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2828 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2829 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2834 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2835 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2836 and saturating if SATP is nonzero, otherwise not saturating. */
2839 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2840 int unsignedp
, int satp
)
2842 enum machine_mode mode
;
2844 mode
= unsignedp
? UQQmode
: QQmode
;
2846 mode
= unsignedp
? UHAmode
: HAmode
;
2848 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2849 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2852 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2854 sorry ("GCC cannot support operators with integer types and "
2855 "fixed-point types that have too many integral and "
2856 "fractional bits together");
2860 return c_common_type_for_mode (mode
, satp
);
2863 /* Used for communication between c_common_type_for_mode and
2864 c_register_builtin_type. */
2865 static GTY(()) tree registered_builtin_types
;
2867 /* Return a data type that has machine mode MODE.
2868 If the mode is an integer,
2869 then UNSIGNEDP selects between signed and unsigned types.
2870 If the mode is a fixed-point mode,
2871 then UNSIGNEDP selects between saturating and nonsaturating types. */
2874 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
2878 if (mode
== TYPE_MODE (integer_type_node
))
2879 return unsignedp
? unsigned_type_node
: integer_type_node
;
2881 if (mode
== TYPE_MODE (signed_char_type_node
))
2882 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2884 if (mode
== TYPE_MODE (short_integer_type_node
))
2885 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2887 if (mode
== TYPE_MODE (long_integer_type_node
))
2888 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2890 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2891 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2893 if (int128_integer_type_node
2894 && mode
== TYPE_MODE (int128_integer_type_node
))
2895 return unsignedp
? int128_unsigned_type_node
: int128_integer_type_node
;
2897 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2898 return unsignedp
? widest_unsigned_literal_type_node
2899 : widest_integer_literal_type_node
;
2902 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2905 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2908 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2911 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2913 #if HOST_BITS_PER_WIDE_INT >= 64
2914 if (mode
== TYPE_MODE (intTI_type_node
))
2915 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2918 if (mode
== TYPE_MODE (float_type_node
))
2919 return float_type_node
;
2921 if (mode
== TYPE_MODE (double_type_node
))
2922 return double_type_node
;
2924 if (mode
== TYPE_MODE (long_double_type_node
))
2925 return long_double_type_node
;
2927 if (mode
== TYPE_MODE (void_type_node
))
2928 return void_type_node
;
2930 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2932 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2933 : make_signed_type (GET_MODE_PRECISION (mode
)));
2935 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2937 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2938 : make_signed_type (GET_MODE_PRECISION (mode
)));
2940 if (COMPLEX_MODE_P (mode
))
2942 enum machine_mode inner_mode
;
2945 if (mode
== TYPE_MODE (complex_float_type_node
))
2946 return complex_float_type_node
;
2947 if (mode
== TYPE_MODE (complex_double_type_node
))
2948 return complex_double_type_node
;
2949 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2950 return complex_long_double_type_node
;
2952 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2953 return complex_integer_type_node
;
2955 inner_mode
= GET_MODE_INNER (mode
);
2956 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2957 if (inner_type
!= NULL_TREE
)
2958 return build_complex_type (inner_type
);
2960 else if (VECTOR_MODE_P (mode
))
2962 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2963 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2964 if (inner_type
!= NULL_TREE
)
2965 return build_vector_type_for_mode (inner_type
, mode
);
2968 if (mode
== TYPE_MODE (dfloat32_type_node
))
2969 return dfloat32_type_node
;
2970 if (mode
== TYPE_MODE (dfloat64_type_node
))
2971 return dfloat64_type_node
;
2972 if (mode
== TYPE_MODE (dfloat128_type_node
))
2973 return dfloat128_type_node
;
2975 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
2977 if (mode
== TYPE_MODE (short_fract_type_node
))
2978 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
2979 if (mode
== TYPE_MODE (fract_type_node
))
2980 return unsignedp
? sat_fract_type_node
: fract_type_node
;
2981 if (mode
== TYPE_MODE (long_fract_type_node
))
2982 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
2983 if (mode
== TYPE_MODE (long_long_fract_type_node
))
2984 return unsignedp
? sat_long_long_fract_type_node
2985 : long_long_fract_type_node
;
2987 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
2988 return unsignedp
? sat_unsigned_short_fract_type_node
2989 : unsigned_short_fract_type_node
;
2990 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
2991 return unsignedp
? sat_unsigned_fract_type_node
2992 : unsigned_fract_type_node
;
2993 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
2994 return unsignedp
? sat_unsigned_long_fract_type_node
2995 : unsigned_long_fract_type_node
;
2996 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
2997 return unsignedp
? sat_unsigned_long_long_fract_type_node
2998 : unsigned_long_long_fract_type_node
;
3000 if (mode
== TYPE_MODE (short_accum_type_node
))
3001 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3002 if (mode
== TYPE_MODE (accum_type_node
))
3003 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3004 if (mode
== TYPE_MODE (long_accum_type_node
))
3005 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3006 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3007 return unsignedp
? sat_long_long_accum_type_node
3008 : long_long_accum_type_node
;
3010 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3011 return unsignedp
? sat_unsigned_short_accum_type_node
3012 : unsigned_short_accum_type_node
;
3013 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3014 return unsignedp
? sat_unsigned_accum_type_node
3015 : unsigned_accum_type_node
;
3016 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3017 return unsignedp
? sat_unsigned_long_accum_type_node
3018 : unsigned_long_accum_type_node
;
3019 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3020 return unsignedp
? sat_unsigned_long_long_accum_type_node
3021 : unsigned_long_long_accum_type_node
;
3024 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3026 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3028 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3030 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3032 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3034 if (mode
== UQQmode
)
3035 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3036 if (mode
== UHQmode
)
3037 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3038 if (mode
== USQmode
)
3039 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3040 if (mode
== UDQmode
)
3041 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3042 if (mode
== UTQmode
)
3043 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3046 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3048 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3050 return unsignedp
? sat_da_type_node
: da_type_node
;
3052 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3054 if (mode
== UHAmode
)
3055 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3056 if (mode
== USAmode
)
3057 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3058 if (mode
== UDAmode
)
3059 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3060 if (mode
== UTAmode
)
3061 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3064 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3065 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
3066 return TREE_VALUE (t
);
3072 c_common_unsigned_type (tree type
)
3074 return c_common_signed_or_unsigned_type (1, type
);
3077 /* Return a signed type the same as TYPE in other respects. */
3080 c_common_signed_type (tree type
)
3082 return c_common_signed_or_unsigned_type (0, type
);
3085 /* Return a type the same as TYPE except unsigned or
3086 signed according to UNSIGNEDP. */
3089 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3093 /* This block of code emulates the behavior of the old
3094 c_common_unsigned_type. In particular, it returns
3095 long_unsigned_type_node if passed a long, even when a int would
3096 have the same size. This is necessary for warnings to work
3097 correctly in archs where sizeof(int) == sizeof(long) */
3099 type1
= TYPE_MAIN_VARIANT (type
);
3100 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3101 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3102 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3103 return unsignedp
? unsigned_type_node
: integer_type_node
;
3104 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3105 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3106 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3107 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3108 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3109 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3110 if (int128_integer_type_node
3111 && (type1
== int128_integer_type_node
3112 || type1
== int128_unsigned_type_node
))
3113 return unsignedp
? int128_unsigned_type_node
: int128_integer_type_node
;
3114 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3115 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3116 #if HOST_BITS_PER_WIDE_INT >= 64
3117 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3118 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3120 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3121 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3122 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3123 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3124 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3125 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3126 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3127 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3129 #define C_COMMON_FIXED_TYPES(NAME) \
3130 if (type1 == short_ ## NAME ## _type_node \
3131 || type1 == unsigned_short_ ## NAME ## _type_node) \
3132 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3133 : short_ ## NAME ## _type_node; \
3134 if (type1 == NAME ## _type_node \
3135 || type1 == unsigned_ ## NAME ## _type_node) \
3136 return unsignedp ? unsigned_ ## NAME ## _type_node \
3137 : NAME ## _type_node; \
3138 if (type1 == long_ ## NAME ## _type_node \
3139 || type1 == unsigned_long_ ## NAME ## _type_node) \
3140 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3141 : long_ ## NAME ## _type_node; \
3142 if (type1 == long_long_ ## NAME ## _type_node \
3143 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3144 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3145 : long_long_ ## NAME ## _type_node;
3147 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3148 if (type1 == NAME ## _type_node \
3149 || type1 == u ## NAME ## _type_node) \
3150 return unsignedp ? u ## NAME ## _type_node \
3151 : NAME ## _type_node;
3153 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3154 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3155 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3156 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3157 : sat_ ## short_ ## NAME ## _type_node; \
3158 if (type1 == sat_ ## NAME ## _type_node \
3159 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3160 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3161 : sat_ ## NAME ## _type_node; \
3162 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3163 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3164 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3165 : sat_ ## long_ ## NAME ## _type_node; \
3166 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3167 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3168 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3169 : sat_ ## long_long_ ## NAME ## _type_node;
3171 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3172 if (type1 == sat_ ## NAME ## _type_node \
3173 || type1 == sat_ ## u ## NAME ## _type_node) \
3174 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3175 : sat_ ## NAME ## _type_node;
3177 C_COMMON_FIXED_TYPES (fract
);
3178 C_COMMON_FIXED_TYPES_SAT (fract
);
3179 C_COMMON_FIXED_TYPES (accum
);
3180 C_COMMON_FIXED_TYPES_SAT (accum
);
3182 C_COMMON_FIXED_MODE_TYPES (qq
);
3183 C_COMMON_FIXED_MODE_TYPES (hq
);
3184 C_COMMON_FIXED_MODE_TYPES (sq
);
3185 C_COMMON_FIXED_MODE_TYPES (dq
);
3186 C_COMMON_FIXED_MODE_TYPES (tq
);
3187 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3188 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3189 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3190 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3191 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3192 C_COMMON_FIXED_MODE_TYPES (ha
);
3193 C_COMMON_FIXED_MODE_TYPES (sa
);
3194 C_COMMON_FIXED_MODE_TYPES (da
);
3195 C_COMMON_FIXED_MODE_TYPES (ta
);
3196 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3197 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3198 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3199 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3201 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3202 the precision; they have precision set to match their range, but
3203 may use a wider mode to match an ABI. If we change modes, we may
3204 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3205 the precision as well, so as to yield correct results for
3206 bit-field types. C++ does not have these separate bit-field
3207 types, and producing a signed or unsigned variant of an
3208 ENUMERAL_TYPE may cause other problems as well. */
3210 if (!INTEGRAL_TYPE_P (type
)
3211 || TYPE_UNSIGNED (type
) == unsignedp
)
3214 #define TYPE_OK(node) \
3215 (TYPE_MODE (type) == TYPE_MODE (node) \
3216 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3217 if (TYPE_OK (signed_char_type_node
))
3218 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3219 if (TYPE_OK (integer_type_node
))
3220 return unsignedp
? unsigned_type_node
: integer_type_node
;
3221 if (TYPE_OK (short_integer_type_node
))
3222 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3223 if (TYPE_OK (long_integer_type_node
))
3224 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3225 if (TYPE_OK (long_long_integer_type_node
))
3226 return (unsignedp
? long_long_unsigned_type_node
3227 : long_long_integer_type_node
);
3228 if (int128_integer_type_node
&& TYPE_OK (int128_integer_type_node
))
3229 return (unsignedp
? int128_unsigned_type_node
3230 : int128_integer_type_node
);
3231 if (TYPE_OK (widest_integer_literal_type_node
))
3232 return (unsignedp
? widest_unsigned_literal_type_node
3233 : widest_integer_literal_type_node
);
3235 #if HOST_BITS_PER_WIDE_INT >= 64
3236 if (TYPE_OK (intTI_type_node
))
3237 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3239 if (TYPE_OK (intDI_type_node
))
3240 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3241 if (TYPE_OK (intSI_type_node
))
3242 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3243 if (TYPE_OK (intHI_type_node
))
3244 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3245 if (TYPE_OK (intQI_type_node
))
3246 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3249 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3252 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3255 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3257 /* Extended integer types of the same width as a standard type have
3258 lesser rank, so those of the same width as int promote to int or
3259 unsigned int and are valid for printf formats expecting int or
3260 unsigned int. To avoid such special cases, avoid creating
3261 extended integer types for bit-fields if a standard integer type
3263 if (width
== TYPE_PRECISION (integer_type_node
))
3264 return unsignedp
? unsigned_type_node
: integer_type_node
;
3265 if (width
== TYPE_PRECISION (signed_char_type_node
))
3266 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3267 if (width
== TYPE_PRECISION (short_integer_type_node
))
3268 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3269 if (width
== TYPE_PRECISION (long_integer_type_node
))
3270 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3271 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3272 return (unsignedp
? long_long_unsigned_type_node
3273 : long_long_integer_type_node
);
3274 if (int128_integer_type_node
3275 && width
== TYPE_PRECISION (int128_integer_type_node
))
3276 return (unsignedp
? int128_unsigned_type_node
3277 : int128_integer_type_node
);
3278 return build_nonstandard_integer_type (width
, unsignedp
);
3281 /* The C version of the register_builtin_type langhook. */
3284 c_register_builtin_type (tree type
, const char* name
)
3288 decl
= build_decl (UNKNOWN_LOCATION
,
3289 TYPE_DECL
, get_identifier (name
), type
);
3290 DECL_ARTIFICIAL (decl
) = 1;
3291 if (!TYPE_NAME (type
))
3292 TYPE_NAME (type
) = decl
;
3295 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3298 /* Print an error message for invalid operands to arith operation
3299 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3300 LOCATION is the location of the message. */
3303 binary_op_error (location_t location
, enum tree_code code
,
3304 tree type0
, tree type1
)
3311 opname
= "+"; break;
3313 opname
= "-"; break;
3315 opname
= "*"; break;
3317 opname
= "max"; break;
3319 opname
= "min"; break;
3321 opname
= "=="; break;
3323 opname
= "!="; break;
3325 opname
= "<="; break;
3327 opname
= ">="; break;
3329 opname
= "<"; break;
3331 opname
= ">"; break;
3333 opname
= "<<"; break;
3335 opname
= ">>"; break;
3336 case TRUNC_MOD_EXPR
:
3337 case FLOOR_MOD_EXPR
:
3338 opname
= "%"; break;
3339 case TRUNC_DIV_EXPR
:
3340 case FLOOR_DIV_EXPR
:
3341 opname
= "/"; break;
3343 opname
= "&"; break;
3345 opname
= "|"; break;
3346 case TRUTH_ANDIF_EXPR
:
3347 opname
= "&&"; break;
3348 case TRUTH_ORIF_EXPR
:
3349 opname
= "||"; break;
3351 opname
= "^"; break;
3356 "invalid operands to binary %s (have %qT and %qT)", opname
,
3360 /* Subroutine of build_binary_op, used for comparison operations.
3361 See if the operands have both been converted from subword integer types
3362 and, if so, perhaps change them both back to their original type.
3363 This function is also responsible for converting the two operands
3364 to the proper common type for comparison.
3366 The arguments of this function are all pointers to local variables
3367 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3368 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3370 If this function returns nonzero, it means that the comparison has
3371 a constant value. What this function returns is an expression for
3375 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
3376 enum tree_code
*rescode_ptr
)
3379 tree op0
= *op0_ptr
;
3380 tree op1
= *op1_ptr
;
3381 int unsignedp0
, unsignedp1
;
3383 tree primop0
, primop1
;
3384 enum tree_code code
= *rescode_ptr
;
3386 /* Throw away any conversions to wider types
3387 already present in the operands. */
3389 primop0
= c_common_get_narrower (op0
, &unsignedp0
);
3390 primop1
= c_common_get_narrower (op1
, &unsignedp1
);
3392 /* If primopN is first sign-extended from primopN's precision to opN's
3393 precision, then zero-extended from opN's precision to
3394 *restype_ptr precision, shortenings might be invalid. */
3395 if (TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (TREE_TYPE (op0
))
3396 && TYPE_PRECISION (TREE_TYPE (op0
)) < TYPE_PRECISION (*restype_ptr
)
3398 && TYPE_UNSIGNED (TREE_TYPE (op0
)))
3400 if (TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (TREE_TYPE (op1
))
3401 && TYPE_PRECISION (TREE_TYPE (op1
)) < TYPE_PRECISION (*restype_ptr
)
3403 && TYPE_UNSIGNED (TREE_TYPE (op1
)))
3406 /* Handle the case that OP0 does not *contain* a conversion
3407 but it *requires* conversion to FINAL_TYPE. */
3409 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
3410 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3411 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
3412 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
3414 /* If one of the operands must be floated, we cannot optimize. */
3415 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
3416 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
3418 /* If first arg is constant, swap the args (changing operation
3419 so value is preserved), for canonicalization. Don't do this if
3420 the second arg is 0. */
3422 if (TREE_CONSTANT (primop0
)
3423 && !integer_zerop (primop1
) && !real_zerop (primop1
)
3424 && !fixed_zerop (primop1
))
3427 int temi
= unsignedp0
;
3435 unsignedp0
= unsignedp1
;
3458 *rescode_ptr
= code
;
3461 /* If comparing an integer against a constant more bits wide,
3462 maybe we can deduce a value of 1 or 0 independent of the data.
3463 Or else truncate the constant now
3464 rather than extend the variable at run time.
3466 This is only interesting if the constant is the wider arg.
3467 Also, it is not safe if the constant is unsigned and the
3468 variable arg is signed, since in this case the variable
3469 would be sign-extended and then regarded as unsigned.
3470 Our technique fails in this case because the lowest/highest
3471 possible unsigned results don't follow naturally from the
3472 lowest/highest possible values of the variable operand.
3473 For just EQ_EXPR and NE_EXPR there is another technique that
3474 could be used: see if the constant can be faithfully represented
3475 in the other operand's type, by truncating it and reextending it
3476 and see if that preserves the constant's value. */
3478 if (!real1
&& !real2
3479 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
3480 && TREE_CODE (primop1
) == INTEGER_CST
3481 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
3483 int min_gt
, max_gt
, min_lt
, max_lt
;
3484 tree maxval
, minval
;
3485 /* 1 if comparison is nominally unsigned. */
3486 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
3489 type
= c_common_signed_or_unsigned_type (unsignedp0
,
3490 TREE_TYPE (primop0
));
3492 maxval
= TYPE_MAX_VALUE (type
);
3493 minval
= TYPE_MIN_VALUE (type
);
3495 if (unsignedp
&& !unsignedp0
)
3496 *restype_ptr
= c_common_signed_type (*restype_ptr
);
3498 if (TREE_TYPE (primop1
) != *restype_ptr
)
3500 /* Convert primop1 to target type, but do not introduce
3501 additional overflow. We know primop1 is an int_cst. */
3502 primop1
= force_fit_type_double (*restype_ptr
,
3503 tree_to_double_int (primop1
),
3504 0, TREE_OVERFLOW (primop1
));
3506 if (type
!= *restype_ptr
)
3508 minval
= convert (*restype_ptr
, minval
);
3509 maxval
= convert (*restype_ptr
, maxval
);
3512 if (unsignedp
&& unsignedp0
)
3514 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
3515 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
3516 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
3517 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
3521 min_gt
= INT_CST_LT (primop1
, minval
);
3522 max_gt
= INT_CST_LT (primop1
, maxval
);
3523 min_lt
= INT_CST_LT (minval
, primop1
);
3524 max_lt
= INT_CST_LT (maxval
, primop1
);
3528 /* This used to be a switch, but Genix compiler can't handle that. */
3529 if (code
== NE_EXPR
)
3531 if (max_lt
|| min_gt
)
3532 val
= truthvalue_true_node
;
3534 else if (code
== EQ_EXPR
)
3536 if (max_lt
|| min_gt
)
3537 val
= truthvalue_false_node
;
3539 else if (code
== LT_EXPR
)
3542 val
= truthvalue_true_node
;
3544 val
= truthvalue_false_node
;
3546 else if (code
== GT_EXPR
)
3549 val
= truthvalue_true_node
;
3551 val
= truthvalue_false_node
;
3553 else if (code
== LE_EXPR
)
3556 val
= truthvalue_true_node
;
3558 val
= truthvalue_false_node
;
3560 else if (code
== GE_EXPR
)
3563 val
= truthvalue_true_node
;
3565 val
= truthvalue_false_node
;
3568 /* If primop0 was sign-extended and unsigned comparison specd,
3569 we did a signed comparison above using the signed type bounds.
3570 But the comparison we output must be unsigned.
3572 Also, for inequalities, VAL is no good; but if the signed
3573 comparison had *any* fixed result, it follows that the
3574 unsigned comparison just tests the sign in reverse
3575 (positive values are LE, negative ones GE).
3576 So we can generate an unsigned comparison
3577 against an extreme value of the signed type. */
3579 if (unsignedp
&& !unsignedp0
)
3586 primop1
= TYPE_MIN_VALUE (type
);
3592 primop1
= TYPE_MAX_VALUE (type
);
3599 type
= c_common_unsigned_type (type
);
3602 if (TREE_CODE (primop0
) != INTEGER_CST
)
3604 if (val
== truthvalue_false_node
)
3605 warning (OPT_Wtype_limits
, "comparison is always false due to limited range of data type");
3606 if (val
== truthvalue_true_node
)
3607 warning (OPT_Wtype_limits
, "comparison is always true due to limited range of data type");
3612 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3613 if (TREE_SIDE_EFFECTS (primop0
))
3614 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
3618 /* Value is not predetermined, but do the comparison
3619 in the type of the operand that is not constant.
3620 TYPE is already properly set. */
3623 /* If either arg is decimal float and the other is float, find the
3624 proper common type to use for comparison. */
3625 else if (real1
&& real2
3626 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
3627 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
3628 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3630 else if (real1
&& real2
3631 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3632 == TYPE_PRECISION (TREE_TYPE (primop1
))))
3633 type
= TREE_TYPE (primop0
);
3635 /* If args' natural types are both narrower than nominal type
3636 and both extend in the same manner, compare them
3637 in the type of the wider arg.
3638 Otherwise must actually extend both to the nominal
3639 common type lest different ways of extending
3641 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3643 else if (unsignedp0
== unsignedp1
&& real1
== real2
3644 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
3645 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
3647 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3648 type
= c_common_signed_or_unsigned_type (unsignedp0
3649 || TYPE_UNSIGNED (*restype_ptr
),
3651 /* Make sure shorter operand is extended the right way
3652 to match the longer operand. */
3654 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
3655 TREE_TYPE (primop0
)),
3658 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
3659 TREE_TYPE (primop1
)),
3664 /* Here we must do the comparison on the nominal type
3665 using the args exactly as we received them. */
3666 type
= *restype_ptr
;
3670 if (!real1
&& !real2
&& integer_zerop (primop1
)
3671 && TYPE_UNSIGNED (*restype_ptr
))
3677 /* All unsigned values are >= 0, so we warn. However,
3678 if OP0 is a constant that is >= 0, the signedness of
3679 the comparison isn't an issue, so suppress the
3681 if (warn_type_limits
&& !in_system_header
3682 && !(TREE_CODE (primop0
) == INTEGER_CST
3683 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3685 warning (OPT_Wtype_limits
,
3686 "comparison of unsigned expression >= 0 is always true");
3687 value
= truthvalue_true_node
;
3691 if (warn_type_limits
&& !in_system_header
3692 && !(TREE_CODE (primop0
) == INTEGER_CST
3693 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3695 warning (OPT_Wtype_limits
,
3696 "comparison of unsigned expression < 0 is always false");
3697 value
= truthvalue_false_node
;
3706 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3707 if (TREE_SIDE_EFFECTS (primop0
))
3708 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3715 *op0_ptr
= convert (type
, primop0
);
3716 *op1_ptr
= convert (type
, primop1
);
3718 *restype_ptr
= truthvalue_type_node
;
3723 /* Return a tree for the sum or difference (RESULTCODE says which)
3724 of pointer PTROP and integer INTOP. */
3727 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
3728 tree ptrop
, tree intop
)
3732 /* The result is a pointer of the same type that is being added. */
3733 tree result_type
= TREE_TYPE (ptrop
);
3735 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3737 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3738 "pointer of type %<void *%> used in arithmetic");
3739 size_exp
= integer_one_node
;
3741 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3743 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3744 "pointer to a function used in arithmetic");
3745 size_exp
= integer_one_node
;
3747 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
3749 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3750 "pointer to member function used in arithmetic");
3751 size_exp
= integer_one_node
;
3754 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
3756 /* We are manipulating pointer values, so we don't need to warn
3757 about relying on undefined signed overflow. We disable the
3758 warning here because we use integer types so fold won't know that
3759 they are really pointers. */
3760 fold_defer_overflow_warnings ();
3762 /* If what we are about to multiply by the size of the elements
3763 contains a constant term, apply distributive law
3764 and multiply that constant term separately.
3765 This helps produce common subexpressions. */
3766 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3767 && !TREE_CONSTANT (intop
)
3768 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3769 && TREE_CONSTANT (size_exp
)
3770 /* If the constant comes from pointer subtraction,
3771 skip this optimization--it would cause an error. */
3772 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3773 /* If the constant is unsigned, and smaller than the pointer size,
3774 then we must skip this optimization. This is because it could cause
3775 an overflow error if the constant is negative but INTOP is not. */
3776 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3777 || (TYPE_PRECISION (TREE_TYPE (intop
))
3778 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3780 enum tree_code subcode
= resultcode
;
3781 tree int_type
= TREE_TYPE (intop
);
3782 if (TREE_CODE (intop
) == MINUS_EXPR
)
3783 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3784 /* Convert both subexpression types to the type of intop,
3785 because weird cases involving pointer arithmetic
3786 can result in a sum or difference with different type args. */
3787 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3789 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3790 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3793 /* Convert the integer argument to a type the same size as sizetype
3794 so the multiply won't overflow spuriously. */
3795 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3796 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3797 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3798 TYPE_UNSIGNED (sizetype
)), intop
);
3800 /* Replace the integer argument with a suitable product by the object size.
3801 Do this multiplication as signed, then convert to the appropriate type
3802 for the pointer operation and disregard an overflow that occured only
3803 because of the sign-extension change in the latter conversion. */
3805 tree t
= build_binary_op (loc
,
3807 convert (TREE_TYPE (intop
), size_exp
), 1);
3808 intop
= convert (sizetype
, t
);
3809 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
3810 intop
= build_int_cst_wide (TREE_TYPE (intop
), TREE_INT_CST_LOW (intop
),
3811 TREE_INT_CST_HIGH (intop
));
3814 /* Create the sum or difference. */
3815 if (resultcode
== MINUS_EXPR
)
3816 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
3818 ret
= fold_build_pointer_plus_loc (loc
, ptrop
, intop
);
3820 fold_undefer_and_ignore_overflow_warnings ();
3825 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3826 and if NON_CONST is known not to be permitted in an evaluated part
3827 of a constant expression. */
3830 c_wrap_maybe_const (tree expr
, bool non_const
)
3832 bool nowarning
= TREE_NO_WARNING (expr
);
3833 location_t loc
= EXPR_LOCATION (expr
);
3835 /* This should never be called for C++. */
3836 if (c_dialect_cxx ())
3839 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3840 STRIP_TYPE_NOPS (expr
);
3841 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
3842 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
3844 TREE_NO_WARNING (expr
) = 1;
3845 protected_set_expr_location (expr
, loc
);
3850 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3851 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3852 around the SAVE_EXPR if needed so that c_fully_fold does not need
3853 to look inside SAVE_EXPRs. */
3856 c_save_expr (tree expr
)
3858 bool maybe_const
= true;
3859 if (c_dialect_cxx ())
3860 return save_expr (expr
);
3861 expr
= c_fully_fold (expr
, false, &maybe_const
);
3862 expr
= save_expr (expr
);
3864 expr
= c_wrap_maybe_const (expr
, true);
3868 /* Return whether EXPR is a declaration whose address can never be
3872 decl_with_nonnull_addr_p (const_tree expr
)
3874 return (DECL_P (expr
)
3875 && (TREE_CODE (expr
) == PARM_DECL
3876 || TREE_CODE (expr
) == LABEL_DECL
3877 || !DECL_WEAK (expr
)));
3880 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3881 or for an `if' or `while' statement or ?..: exp. It should already
3882 have been validated to be of suitable type; otherwise, a bad
3883 diagnostic may result.
3885 The EXPR is located at LOCATION.
3887 This preparation consists of taking the ordinary
3888 representation of an expression expr and producing a valid tree
3889 boolean expression describing whether expr is nonzero. We could
3890 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3891 but we optimize comparisons, &&, ||, and !.
3893 The resulting type should always be `truthvalue_type_node'. */
3896 c_common_truthvalue_conversion (location_t location
, tree expr
)
3898 switch (TREE_CODE (expr
))
3900 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3901 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3902 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3903 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3904 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3906 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3907 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3910 case TRUTH_ANDIF_EXPR
:
3911 case TRUTH_ORIF_EXPR
:
3912 case TRUTH_AND_EXPR
:
3914 case TRUTH_XOR_EXPR
:
3915 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3917 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3918 c_common_truthvalue_conversion (location
,
3919 TREE_OPERAND (expr
, 0)),
3920 c_common_truthvalue_conversion (location
,
3921 TREE_OPERAND (expr
, 1)));
3924 case TRUTH_NOT_EXPR
:
3925 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3927 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
3928 c_common_truthvalue_conversion (location
,
3929 TREE_OPERAND (expr
, 0)));
3936 return integer_zerop (expr
) ? truthvalue_false_node
3937 : truthvalue_true_node
;
3940 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3941 ? truthvalue_true_node
3942 : truthvalue_false_node
;
3945 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3946 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3947 ? truthvalue_true_node
3948 : truthvalue_false_node
;
3951 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
3956 tree inner
= TREE_OPERAND (expr
, 0);
3957 if (decl_with_nonnull_addr_p (inner
))
3959 /* Common Ada/Pascal programmer's mistake. */
3960 warning_at (location
,
3962 "the address of %qD will always evaluate as %<true%>",
3964 return truthvalue_true_node
;
3970 expr
= build_binary_op (EXPR_LOCATION (expr
),
3971 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3972 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3973 c_common_truthvalue_conversion (location
,
3974 TREE_OPERAND (expr
, 0)),
3975 c_common_truthvalue_conversion (location
,
3976 TREE_OPERAND (expr
, 1)),
3983 case EXCESS_PRECISION_EXPR
:
3984 /* These don't change whether an object is nonzero or zero. */
3985 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
3989 /* These don't change whether an object is zero or nonzero, but
3990 we can't ignore them if their second arg has side-effects. */
3991 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
3993 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3994 TREE_OPERAND (expr
, 1),
3995 c_common_truthvalue_conversion
3996 (location
, TREE_OPERAND (expr
, 0)));
4000 return c_common_truthvalue_conversion (location
,
4001 TREE_OPERAND (expr
, 0));
4004 /* Distribute the conversion into the arms of a COND_EXPR. */
4005 if (c_dialect_cxx ())
4007 tree op1
= TREE_OPERAND (expr
, 1);
4008 tree op2
= TREE_OPERAND (expr
, 2);
4009 /* In C++ one of the arms might have void type if it is throw. */
4010 if (!VOID_TYPE_P (TREE_TYPE (op1
)))
4011 op1
= c_common_truthvalue_conversion (location
, op1
);
4012 if (!VOID_TYPE_P (TREE_TYPE (op2
)))
4013 op2
= c_common_truthvalue_conversion (location
, op2
);
4014 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4015 TREE_OPERAND (expr
, 0), op1
, op2
);
4020 /* Folding will happen later for C. */
4021 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4022 TREE_OPERAND (expr
, 0),
4023 c_common_truthvalue_conversion (location
,
4024 TREE_OPERAND (expr
, 1)),
4025 c_common_truthvalue_conversion (location
,
4026 TREE_OPERAND (expr
, 2)));
4032 tree totype
= TREE_TYPE (expr
);
4033 tree fromtype
= TREE_TYPE (TREE_OPERAND (expr
, 0));
4035 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4036 since that affects how `default_conversion' will behave. */
4037 if (TREE_CODE (totype
) == REFERENCE_TYPE
4038 || TREE_CODE (fromtype
) == REFERENCE_TYPE
)
4040 /* Don't strip a conversion from C++0x scoped enum, since they
4041 don't implicitly convert to other types. */
4042 if (TREE_CODE (fromtype
) == ENUMERAL_TYPE
4043 && ENUM_IS_SCOPED (fromtype
))
4045 /* If this isn't narrowing the argument, we can ignore it. */
4046 if (TYPE_PRECISION (totype
) >= TYPE_PRECISION (fromtype
))
4047 return c_common_truthvalue_conversion (location
,
4048 TREE_OPERAND (expr
, 0));
4053 if (!TREE_NO_WARNING (expr
)
4054 && warn_parentheses
)
4056 warning (OPT_Wparentheses
,
4057 "suggest parentheses around assignment used as truth value");
4058 TREE_NO_WARNING (expr
) = 1;
4066 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4068 tree t
= (in_late_binary_op
? save_expr (expr
) : c_save_expr (expr
));
4069 expr
= (build_binary_op
4070 (EXPR_LOCATION (expr
),
4071 (TREE_SIDE_EFFECTS (expr
)
4072 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4073 c_common_truthvalue_conversion
4075 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
4076 c_common_truthvalue_conversion
4078 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
4083 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4085 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4087 (TREE_TYPE (expr
))));
4088 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4091 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4094 protected_set_expr_location (expr
, location
);
4098 static void def_builtin_1 (enum built_in_function fncode
,
4100 enum built_in_class fnclass
,
4101 tree fntype
, tree libtype
,
4102 bool both_p
, bool fallback_p
, bool nonansi_p
,
4103 tree fnattrs
, bool implicit_p
);
4106 /* Apply the TYPE_QUALS to the new DECL. */
4109 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4111 tree type
= TREE_TYPE (decl
);
4113 if (type
== error_mark_node
)
4116 if ((type_quals
& TYPE_QUAL_CONST
)
4117 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4118 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
4119 constructor can produce constant init, so rely on cp_finish_decl to
4120 clear TREE_READONLY if the variable has non-constant init. */
4121 TREE_READONLY (decl
) = 1;
4122 if (type_quals
& TYPE_QUAL_VOLATILE
)
4124 TREE_SIDE_EFFECTS (decl
) = 1;
4125 TREE_THIS_VOLATILE (decl
) = 1;
4127 if (type_quals
& TYPE_QUAL_RESTRICT
)
4129 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4130 /* Allow 'restrict' on arrays of pointers.
4131 FIXME currently we just ignore it. */
4132 type
= TREE_TYPE (type
);
4134 || !POINTER_TYPE_P (type
)
4135 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4136 error ("invalid use of %<restrict%>");
4140 /* Hash function for the problem of multiple type definitions in
4141 different files. This must hash all types that will compare
4142 equal via comptypes to the same value. In practice it hashes
4143 on some of the simple stuff and leaves the details to comptypes. */
4146 c_type_hash (const void *p
)
4150 const_tree
const t
= (const_tree
) p
;
4152 switch (TREE_CODE (t
))
4154 /* For pointers, hash on pointee type plus some swizzling. */
4156 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
4157 /* Hash on number of elements and total size. */
4160 t2
= TYPE_VALUES (t
);
4164 t2
= TYPE_FIELDS (t
);
4166 case QUAL_UNION_TYPE
:
4168 t2
= TYPE_FIELDS (t
);
4172 t2
= TYPE_FIELDS (t
);
4177 /* FIXME: We want to use a DECL_CHAIN iteration method here, but
4178 TYPE_VALUES of ENUMERAL_TYPEs is stored as a TREE_LIST. */
4179 n_elements
= list_length (t2
);
4180 /* We might have a VLA here. */
4181 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4184 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4185 return ((size
<< 24) | (n_elements
<< shift
));
4188 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
4190 /* Return the typed-based alias set for T, which may be an expression
4191 or a type. Return -1 if we don't do anything special. */
4194 c_common_get_alias_set (tree t
)
4199 /* For VLAs, use the alias set of the element type rather than the
4200 default of alias set 0 for types compared structurally. */
4201 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4203 if (TREE_CODE (t
) == ARRAY_TYPE
)
4204 return get_alias_set (TREE_TYPE (t
));
4208 /* Permit type-punning when accessing a union, provided the access
4209 is directly through the union. For example, this code does not
4210 permit taking the address of a union member and then storing
4211 through it. Even the type-punning allowed here is a GCC
4212 extension, albeit a common and useful one; the C standard says
4213 that such accesses have implementation-defined behavior. */
4215 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
4216 u
= TREE_OPERAND (u
, 0))
4217 if (TREE_CODE (u
) == COMPONENT_REF
4218 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
4221 /* That's all the expressions we handle specially. */
4225 /* The C standard guarantees that any object may be accessed via an
4226 lvalue that has character type. */
4227 if (t
== char_type_node
4228 || t
== signed_char_type_node
4229 || t
== unsigned_char_type_node
)
4232 /* The C standard specifically allows aliasing between signed and
4233 unsigned variants of the same type. We treat the signed
4234 variant as canonical. */
4235 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4237 tree t1
= c_common_signed_type (t
);
4239 /* t1 == t can happen for boolean nodes which are always unsigned. */
4241 return get_alias_set (t1
);
4244 /* Handle the case of multiple type nodes referring to "the same" type,
4245 which occurs with IMA. These share an alias set. FIXME: Currently only
4246 C90 is handled. (In C99 type compatibility is not transitive, which
4247 complicates things mightily. The alias set splay trees can theoretically
4248 represent this, but insertion is tricky when you consider all the
4249 different orders things might arrive in.) */
4251 if (c_language
!= clk_c
|| flag_isoc99
)
4254 /* Save time if there's only one input file. */
4255 if (num_in_fnames
== 1)
4258 /* Pointers need special handling if they point to any type that
4259 needs special handling (below). */
4260 if (TREE_CODE (t
) == POINTER_TYPE
)
4263 /* Find bottom type under any nested POINTERs. */
4264 for (t2
= TREE_TYPE (t
);
4265 TREE_CODE (t2
) == POINTER_TYPE
;
4266 t2
= TREE_TYPE (t2
))
4268 if (TREE_CODE (t2
) != RECORD_TYPE
4269 && TREE_CODE (t2
) != ENUMERAL_TYPE
4270 && TREE_CODE (t2
) != QUAL_UNION_TYPE
4271 && TREE_CODE (t2
) != UNION_TYPE
)
4273 if (TYPE_SIZE (t2
) == 0)
4276 /* These are the only cases that need special handling. */
4277 if (TREE_CODE (t
) != RECORD_TYPE
4278 && TREE_CODE (t
) != ENUMERAL_TYPE
4279 && TREE_CODE (t
) != QUAL_UNION_TYPE
4280 && TREE_CODE (t
) != UNION_TYPE
4281 && TREE_CODE (t
) != POINTER_TYPE
)
4284 if (TYPE_SIZE (t
) == 0)
4287 /* Look up t in hash table. Only one of the compatible types within each
4288 alias set is recorded in the table. */
4289 if (!type_hash_table
)
4290 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
4291 (htab_eq
) lang_hooks
.types_compatible_p
,
4293 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
4296 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4297 return TYPE_ALIAS_SET ((tree
)*slot
);
4300 /* Our caller will assign and record (in t) a new alias set; all we need
4301 to do is remember t in the hash table. */
4307 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4308 the second parameter indicates which OPERATOR is being applied.
4309 The COMPLAIN flag controls whether we should diagnose possibly
4310 ill-formed constructs or not. LOC is the location of the SIZEOF or
4314 c_sizeof_or_alignof_type (location_t loc
,
4315 tree type
, bool is_sizeof
, int complain
)
4317 const char *op_name
;
4319 enum tree_code type_code
= TREE_CODE (type
);
4321 op_name
= is_sizeof
? "sizeof" : "__alignof__";
4323 if (type_code
== FUNCTION_TYPE
)
4327 if (complain
&& (pedantic
|| warn_pointer_arith
))
4328 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
4329 "invalid application of %<sizeof%> to a function type");
4331 return error_mark_node
;
4332 value
= size_one_node
;
4335 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
4337 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
4339 if (type_code
== VOID_TYPE
4340 && complain
&& (pedantic
|| warn_pointer_arith
))
4341 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
4342 "invalid application of %qs to a void type", op_name
);
4344 return error_mark_node
;
4345 value
= size_one_node
;
4347 else if (!COMPLETE_TYPE_P (type
))
4350 error_at (loc
, "invalid application of %qs to incomplete type %qT ",
4352 return error_mark_node
;
4357 /* Convert in case a char is more than one unit. */
4358 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
4359 size_int (TYPE_PRECISION (char_type_node
)
4362 value
= size_int (TYPE_ALIGN_UNIT (type
));
4365 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4366 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4367 never happen. However, this node should really have type
4368 `size_t', which is just a typedef for an ordinary integer type. */
4369 value
= fold_convert_loc (loc
, size_type_node
, value
);
4370 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
4375 /* Implement the __alignof keyword: Return the minimum required
4376 alignment of EXPR, measured in bytes. For VAR_DECLs,
4377 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4378 from an "aligned" __attribute__ specification). LOC is the
4379 location of the ALIGNOF operator. */
4382 c_alignof_expr (location_t loc
, tree expr
)
4386 if (VAR_OR_FUNCTION_DECL_P (expr
))
4387 t
= size_int (DECL_ALIGN_UNIT (expr
));
4389 else if (TREE_CODE (expr
) == COMPONENT_REF
4390 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
4392 error_at (loc
, "%<__alignof%> applied to a bit-field");
4395 else if (TREE_CODE (expr
) == COMPONENT_REF
4396 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
4397 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
4399 else if (TREE_CODE (expr
) == INDIRECT_REF
)
4401 tree t
= TREE_OPERAND (expr
, 0);
4403 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
4405 while (CONVERT_EXPR_P (t
)
4406 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
4410 t
= TREE_OPERAND (t
, 0);
4411 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
4412 if (thisalign
> bestalign
)
4413 best
= t
, bestalign
= thisalign
;
4415 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
4418 return c_alignof (loc
, TREE_TYPE (expr
));
4420 return fold_convert_loc (loc
, size_type_node
, t
);
4423 /* Handle C and C++ default attributes. */
4425 enum built_in_attribute
4427 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4428 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4429 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4430 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4431 #include "builtin-attrs.def"
4432 #undef DEF_ATTR_NULL_TREE
4434 #undef DEF_ATTR_IDENT
4435 #undef DEF_ATTR_TREE_LIST
4439 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
4441 static void c_init_attributes (void);
4445 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4446 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4447 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4448 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4449 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4450 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4451 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4452 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4453 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4454 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4455 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4456 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4457 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4458 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4459 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4461 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4462 #include "builtin-types.def"
4463 #undef DEF_PRIMITIVE_TYPE
4464 #undef DEF_FUNCTION_TYPE_0
4465 #undef DEF_FUNCTION_TYPE_1
4466 #undef DEF_FUNCTION_TYPE_2
4467 #undef DEF_FUNCTION_TYPE_3
4468 #undef DEF_FUNCTION_TYPE_4
4469 #undef DEF_FUNCTION_TYPE_5
4470 #undef DEF_FUNCTION_TYPE_6
4471 #undef DEF_FUNCTION_TYPE_7
4472 #undef DEF_FUNCTION_TYPE_VAR_0
4473 #undef DEF_FUNCTION_TYPE_VAR_1
4474 #undef DEF_FUNCTION_TYPE_VAR_2
4475 #undef DEF_FUNCTION_TYPE_VAR_3
4476 #undef DEF_FUNCTION_TYPE_VAR_4
4477 #undef DEF_FUNCTION_TYPE_VAR_5
4478 #undef DEF_POINTER_TYPE
4482 typedef enum c_builtin_type builtin_type
;
4484 /* A temporary array for c_common_nodes_and_builtins. Used in
4485 communication with def_fn_type. */
4486 static tree builtin_types
[(int) BT_LAST
+ 1];
4488 /* A helper function for c_common_nodes_and_builtins. Build function type
4489 for DEF with return type RET and N arguments. If VAR is true, then the
4490 function should be variadic after those N arguments.
4492 Takes special care not to ICE if any of the types involved are
4493 error_mark_node, which indicates that said type is not in fact available
4494 (see builtin_type_for_size). In which case the function type as a whole
4495 should be error_mark_node. */
4498 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
4501 tree
*args
= XALLOCAVEC (tree
, n
);
4506 for (i
= 0; i
< n
; ++i
)
4508 builtin_type a
= (builtin_type
) va_arg (list
, int);
4509 t
= builtin_types
[a
];
4510 if (t
== error_mark_node
)
4515 t
= builtin_types
[ret
];
4516 if (t
== error_mark_node
)
4519 t
= build_varargs_function_type_array (t
, n
, args
);
4521 t
= build_function_type_array (t
, n
, args
);
4524 builtin_types
[def
] = t
;
4528 /* Build builtin functions common to both C and C++ language
4532 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
4534 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4535 builtin_types[ENUM] = VALUE;
4536 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4537 def_fn_type (ENUM, RETURN, 0, 0);
4538 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4539 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4540 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4541 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4542 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4543 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4544 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4545 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4546 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4547 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4548 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4550 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4551 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4553 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4554 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4555 def_fn_type (ENUM, RETURN, 1, 0);
4556 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4557 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4558 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4559 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4560 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4561 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4562 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4563 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4564 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4565 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4566 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4567 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4569 #include "builtin-types.def"
4571 #undef DEF_PRIMITIVE_TYPE
4572 #undef DEF_FUNCTION_TYPE_1
4573 #undef DEF_FUNCTION_TYPE_2
4574 #undef DEF_FUNCTION_TYPE_3
4575 #undef DEF_FUNCTION_TYPE_4
4576 #undef DEF_FUNCTION_TYPE_5
4577 #undef DEF_FUNCTION_TYPE_6
4578 #undef DEF_FUNCTION_TYPE_VAR_0
4579 #undef DEF_FUNCTION_TYPE_VAR_1
4580 #undef DEF_FUNCTION_TYPE_VAR_2
4581 #undef DEF_FUNCTION_TYPE_VAR_3
4582 #undef DEF_FUNCTION_TYPE_VAR_4
4583 #undef DEF_FUNCTION_TYPE_VAR_5
4584 #undef DEF_POINTER_TYPE
4585 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4587 c_init_attributes ();
4589 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4590 NONANSI_P, ATTRS, IMPLICIT, COND) \
4592 def_builtin_1 (ENUM, NAME, CLASS, \
4593 builtin_types[(int) TYPE], \
4594 builtin_types[(int) LIBTYPE], \
4595 BOTH_P, FALLBACK_P, NONANSI_P, \
4596 built_in_attributes[(int) ATTRS], IMPLICIT);
4597 #include "builtins.def"
4600 targetm
.init_builtins ();
4602 build_common_builtin_nodes ();
4608 /* Like get_identifier, but avoid warnings about null arguments when
4609 the argument may be NULL for targets where GCC lacks stdint.h type
4613 c_get_ident (const char *id
)
4615 return get_identifier (id
);
4618 /* Build tree nodes and builtin functions common to both C and C++ language
4622 c_common_nodes_and_builtins (void)
4624 int char16_type_size
;
4625 int char32_type_size
;
4626 int wchar_type_size
;
4627 tree array_domain_type
;
4628 tree va_list_ref_type_node
;
4629 tree va_list_arg_type_node
;
4631 build_common_tree_nodes (flag_signed_char
, flag_short_double
);
4633 /* Define `int' and `char' first so that dbx will output them first. */
4634 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
4635 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4637 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4638 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4639 but not C. Are the conditionals here needed? */
4640 if (c_dialect_cxx ())
4641 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
4642 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4643 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4644 record_builtin_type (RID_MAX
, "long unsigned int",
4645 long_unsigned_type_node
);
4646 if (int128_integer_type_node
!= NULL_TREE
)
4648 record_builtin_type (RID_INT128
, "__int128",
4649 int128_integer_type_node
);
4650 record_builtin_type (RID_MAX
, "__int128 unsigned",
4651 int128_unsigned_type_node
);
4653 if (c_dialect_cxx ())
4654 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4655 record_builtin_type (RID_MAX
, "long long int",
4656 long_long_integer_type_node
);
4657 record_builtin_type (RID_MAX
, "long long unsigned int",
4658 long_long_unsigned_type_node
);
4659 if (c_dialect_cxx ())
4660 record_builtin_type (RID_MAX
, "long long unsigned",
4661 long_long_unsigned_type_node
);
4662 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4663 record_builtin_type (RID_MAX
, "short unsigned int",
4664 short_unsigned_type_node
);
4665 if (c_dialect_cxx ())
4666 record_builtin_type (RID_MAX
, "unsigned short",
4667 short_unsigned_type_node
);
4669 /* Define both `signed char' and `unsigned char'. */
4670 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4671 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4673 /* These are types that c_common_type_for_size and
4674 c_common_type_for_mode use. */
4675 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4676 TYPE_DECL
, NULL_TREE
,
4678 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4679 TYPE_DECL
, NULL_TREE
,
4681 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4682 TYPE_DECL
, NULL_TREE
,
4684 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4685 TYPE_DECL
, NULL_TREE
,
4687 #if HOST_BITS_PER_WIDE_INT >= 64
4688 if (targetm
.scalar_mode_supported_p (TImode
))
4689 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4691 get_identifier ("__int128_t"),
4694 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4695 TYPE_DECL
, NULL_TREE
,
4696 unsigned_intQI_type_node
));
4697 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4698 TYPE_DECL
, NULL_TREE
,
4699 unsigned_intHI_type_node
));
4700 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4701 TYPE_DECL
, NULL_TREE
,
4702 unsigned_intSI_type_node
));
4703 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4704 TYPE_DECL
, NULL_TREE
,
4705 unsigned_intDI_type_node
));
4706 #if HOST_BITS_PER_WIDE_INT >= 64
4707 if (targetm
.scalar_mode_supported_p (TImode
))
4708 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4710 get_identifier ("__uint128_t"),
4711 unsigned_intTI_type_node
));
4714 /* Create the widest literal types. */
4715 widest_integer_literal_type_node
4716 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
4717 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4718 TYPE_DECL
, NULL_TREE
,
4719 widest_integer_literal_type_node
));
4721 widest_unsigned_literal_type_node
4722 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
4723 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4724 TYPE_DECL
, NULL_TREE
,
4725 widest_unsigned_literal_type_node
));
4727 signed_size_type_node
= c_common_signed_type (size_type_node
);
4730 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4732 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4733 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4734 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4736 /* Only supported decimal floating point extension if the target
4737 actually supports underlying modes. */
4738 if (targetm
.scalar_mode_supported_p (SDmode
)
4739 && targetm
.scalar_mode_supported_p (DDmode
)
4740 && targetm
.scalar_mode_supported_p (TDmode
))
4742 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4743 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4744 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4747 if (targetm
.fixed_point_supported_p ())
4749 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4750 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4751 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4752 record_builtin_type (RID_MAX
, "long long _Fract",
4753 long_long_fract_type_node
);
4754 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4755 unsigned_short_fract_type_node
);
4756 record_builtin_type (RID_MAX
, "unsigned _Fract",
4757 unsigned_fract_type_node
);
4758 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4759 unsigned_long_fract_type_node
);
4760 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4761 unsigned_long_long_fract_type_node
);
4762 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4763 sat_short_fract_type_node
);
4764 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4765 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4766 sat_long_fract_type_node
);
4767 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4768 sat_long_long_fract_type_node
);
4769 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4770 sat_unsigned_short_fract_type_node
);
4771 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4772 sat_unsigned_fract_type_node
);
4773 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4774 sat_unsigned_long_fract_type_node
);
4775 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4776 sat_unsigned_long_long_fract_type_node
);
4777 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4778 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4779 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4780 record_builtin_type (RID_MAX
, "long long _Accum",
4781 long_long_accum_type_node
);
4782 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4783 unsigned_short_accum_type_node
);
4784 record_builtin_type (RID_MAX
, "unsigned _Accum",
4785 unsigned_accum_type_node
);
4786 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4787 unsigned_long_accum_type_node
);
4788 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4789 unsigned_long_long_accum_type_node
);
4790 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4791 sat_short_accum_type_node
);
4792 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4793 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4794 sat_long_accum_type_node
);
4795 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4796 sat_long_long_accum_type_node
);
4797 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4798 sat_unsigned_short_accum_type_node
);
4799 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4800 sat_unsigned_accum_type_node
);
4801 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4802 sat_unsigned_long_accum_type_node
);
4803 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4804 sat_unsigned_long_long_accum_type_node
);
4808 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4810 get_identifier ("complex int"),
4811 complex_integer_type_node
));
4812 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4814 get_identifier ("complex float"),
4815 complex_float_type_node
));
4816 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4818 get_identifier ("complex double"),
4819 complex_double_type_node
));
4820 lang_hooks
.decls
.pushdecl
4821 (build_decl (UNKNOWN_LOCATION
,
4822 TYPE_DECL
, get_identifier ("complex long double"),
4823 complex_long_double_type_node
));
4825 if (c_dialect_cxx ())
4826 /* For C++, make fileptr_type_node a distinct void * type until
4827 FILE type is defined. */
4828 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4830 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4832 /* Set the TYPE_NAME for any variants that were built before
4833 record_builtin_type gave names to the built-in types. */
4835 tree void_name
= TYPE_NAME (void_type_node
);
4836 TYPE_NAME (void_type_node
) = NULL_TREE
;
4837 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4839 TYPE_NAME (void_type_node
) = void_name
;
4842 /* This node must not be shared. */
4843 void_zero_node
= make_node (INTEGER_CST
);
4844 TREE_TYPE (void_zero_node
) = void_type_node
;
4846 void_list_node
= build_void_list_node ();
4848 /* Make a type to be the domain of a few array types
4849 whose domains don't really matter.
4850 200 is small enough that it always fits in size_t
4851 and large enough that it can hold most function names for the
4852 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4853 array_domain_type
= build_index_type (size_int (200));
4855 /* Make a type for arrays of characters.
4856 With luck nothing will ever really depend on the length of this
4858 char_array_type_node
4859 = build_array_type (char_type_node
, array_domain_type
);
4861 /* Likewise for arrays of ints. */
4863 = build_array_type (integer_type_node
, array_domain_type
);
4865 string_type_node
= build_pointer_type (char_type_node
);
4866 const_string_type_node
4867 = build_pointer_type (build_qualified_type
4868 (char_type_node
, TYPE_QUAL_CONST
));
4870 /* This is special for C++ so functions can be overloaded. */
4871 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4872 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4873 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4874 underlying_wchar_type_node
= wchar_type_node
;
4875 if (c_dialect_cxx ())
4877 if (TYPE_UNSIGNED (wchar_type_node
))
4878 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4880 wchar_type_node
= make_signed_type (wchar_type_size
);
4881 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4884 /* This is for wide string constants. */
4885 wchar_array_type_node
4886 = build_array_type (wchar_type_node
, array_domain_type
);
4888 /* Define 'char16_t'. */
4889 char16_type_node
= get_identifier (CHAR16_TYPE
);
4890 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4891 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4892 if (c_dialect_cxx ())
4894 char16_type_node
= make_unsigned_type (char16_type_size
);
4896 if (cxx_dialect
== cxx0x
)
4897 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4900 /* This is for UTF-16 string constants. */
4901 char16_array_type_node
4902 = build_array_type (char16_type_node
, array_domain_type
);
4904 /* Define 'char32_t'. */
4905 char32_type_node
= get_identifier (CHAR32_TYPE
);
4906 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4907 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4908 if (c_dialect_cxx ())
4910 char32_type_node
= make_unsigned_type (char32_type_size
);
4912 if (cxx_dialect
== cxx0x
)
4913 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4916 /* This is for UTF-32 string constants. */
4917 char32_array_type_node
4918 = build_array_type (char32_type_node
, array_domain_type
);
4921 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4924 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4926 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4928 if (SIG_ATOMIC_TYPE
)
4929 sig_atomic_type_node
=
4930 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
4933 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
4936 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
4939 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
4942 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
4945 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
4948 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
4950 c_uint32_type_node
=
4951 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
4953 c_uint64_type_node
=
4954 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
4955 if (INT_LEAST8_TYPE
)
4956 int_least8_type_node
=
4957 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
4958 if (INT_LEAST16_TYPE
)
4959 int_least16_type_node
=
4960 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
4961 if (INT_LEAST32_TYPE
)
4962 int_least32_type_node
=
4963 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
4964 if (INT_LEAST64_TYPE
)
4965 int_least64_type_node
=
4966 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
4967 if (UINT_LEAST8_TYPE
)
4968 uint_least8_type_node
=
4969 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
4970 if (UINT_LEAST16_TYPE
)
4971 uint_least16_type_node
=
4972 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
4973 if (UINT_LEAST32_TYPE
)
4974 uint_least32_type_node
=
4975 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
4976 if (UINT_LEAST64_TYPE
)
4977 uint_least64_type_node
=
4978 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
4980 int_fast8_type_node
=
4981 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
4982 if (INT_FAST16_TYPE
)
4983 int_fast16_type_node
=
4984 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
4985 if (INT_FAST32_TYPE
)
4986 int_fast32_type_node
=
4987 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
4988 if (INT_FAST64_TYPE
)
4989 int_fast64_type_node
=
4990 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
4991 if (UINT_FAST8_TYPE
)
4992 uint_fast8_type_node
=
4993 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
4994 if (UINT_FAST16_TYPE
)
4995 uint_fast16_type_node
=
4996 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
4997 if (UINT_FAST32_TYPE
)
4998 uint_fast32_type_node
=
4999 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5000 if (UINT_FAST64_TYPE
)
5001 uint_fast64_type_node
=
5002 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5005 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5008 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5010 default_function_type
5011 = build_varargs_function_type_list (integer_type_node
, NULL_TREE
);
5013 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5014 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5016 lang_hooks
.decls
.pushdecl
5017 (build_decl (UNKNOWN_LOCATION
,
5018 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5019 va_list_type_node
));
5020 if (targetm
.enum_va_list_p
)
5026 for (l
= 0; targetm
.enum_va_list_p (l
, &pname
, &ptype
); ++l
)
5028 lang_hooks
.decls
.pushdecl
5029 (build_decl (UNKNOWN_LOCATION
,
5030 TYPE_DECL
, get_identifier (pname
),
5036 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5038 va_list_arg_type_node
= va_list_ref_type_node
=
5039 build_pointer_type (TREE_TYPE (va_list_type_node
));
5043 va_list_arg_type_node
= va_list_type_node
;
5044 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5047 if (!flag_preprocess_only
)
5048 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5050 main_identifier_node
= get_identifier ("main");
5052 /* Create the built-in __null node. It is important that this is
5054 null_node
= make_node (INTEGER_CST
);
5055 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5057 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5058 memset (builtin_types
, 0, sizeof (builtin_types
));
5061 /* The number of named compound-literals generated thus far. */
5062 static GTY(()) int compound_literal_number
;
5064 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5067 set_compound_literal_name (tree decl
)
5070 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5071 compound_literal_number
);
5072 compound_literal_number
++;
5073 DECL_NAME (decl
) = get_identifier (name
);
5077 build_va_arg (location_t loc
, tree expr
, tree type
)
5079 expr
= build1 (VA_ARG_EXPR
, type
, expr
);
5080 SET_EXPR_LOCATION (expr
, loc
);
5085 /* Linked list of disabled built-in functions. */
5087 typedef struct disabled_builtin
5090 struct disabled_builtin
*next
;
5092 static disabled_builtin
*disabled_builtins
= NULL
;
5094 static bool builtin_function_disabled_p (const char *);
5096 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5097 begins with "__builtin_", give an error. */
5100 disable_builtin_function (const char *name
)
5102 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5103 error ("cannot disable built-in function %qs", name
);
5106 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5107 new_disabled_builtin
->name
= name
;
5108 new_disabled_builtin
->next
= disabled_builtins
;
5109 disabled_builtins
= new_disabled_builtin
;
5114 /* Return true if the built-in function NAME has been disabled, false
5118 builtin_function_disabled_p (const char *name
)
5120 disabled_builtin
*p
;
5121 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
5123 if (strcmp (name
, p
->name
) == 0)
5130 /* Worker for DEF_BUILTIN.
5131 Possibly define a builtin function with one or two names.
5132 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5133 nonansi_p and flag_no_nonansi_builtin. */
5136 def_builtin_1 (enum built_in_function fncode
,
5138 enum built_in_class fnclass
,
5139 tree fntype
, tree libtype
,
5140 bool both_p
, bool fallback_p
, bool nonansi_p
,
5141 tree fnattrs
, bool implicit_p
)
5144 const char *libname
;
5146 if (fntype
== error_mark_node
)
5149 gcc_assert ((!both_p
&& !fallback_p
)
5150 || !strncmp (name
, "__builtin_",
5151 strlen ("__builtin_")));
5153 libname
= name
+ strlen ("__builtin_");
5154 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
5155 (fallback_p
? libname
: NULL
),
5158 set_builtin_decl (fncode
, decl
, implicit_p
);
5161 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
5162 && !(nonansi_p
&& flag_no_nonansi_builtin
))
5163 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
5167 /* Nonzero if the type T promotes to int. This is (nearly) the
5168 integral promotions defined in ISO C99 6.3.1.1/2. */
5171 c_promoting_integer_type_p (const_tree t
)
5173 switch (TREE_CODE (t
))
5176 return (TYPE_MAIN_VARIANT (t
) == char_type_node
5177 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
5178 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
5179 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
5180 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
5181 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
5184 /* ??? Technically all enumerations not larger than an int
5185 promote to an int. But this is used along code paths
5186 that only want to notice a size change. */
5187 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
5197 /* Return 1 if PARMS specifies a fixed number of parameters
5198 and none of their types is affected by default promotions. */
5201 self_promoting_args_p (const_tree parms
)
5204 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
5206 tree type
= TREE_VALUE (t
);
5208 if (type
== error_mark_node
)
5211 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
5217 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
5220 if (c_promoting_integer_type_p (type
))
5226 /* Recursively remove any '*' or '&' operator from TYPE. */
5228 strip_pointer_operator (tree t
)
5230 while (POINTER_TYPE_P (t
))
5235 /* Recursively remove pointer or array type from TYPE. */
5237 strip_pointer_or_array_types (tree t
)
5239 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
5244 /* Used to compare case labels. K1 and K2 are actually tree nodes
5245 representing case labels, or NULL_TREE for a `default' label.
5246 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5247 K2, and 0 if K1 and K2 are equal. */
5250 case_compare (splay_tree_key k1
, splay_tree_key k2
)
5252 /* Consider a NULL key (such as arises with a `default' label) to be
5253 smaller than anything else. */
5259 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5262 /* Process a case label, located at LOC, for the range LOW_VALUE
5263 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5264 then this case label is actually a `default' label. If only
5265 HIGH_VALUE is NULL_TREE, then case label was declared using the
5266 usual C/C++ syntax, rather than the GNU case range extension.
5267 CASES is a tree containing all the case ranges processed so far;
5268 COND is the condition for the switch-statement itself. Returns the
5269 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5273 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
5274 tree low_value
, tree high_value
)
5279 splay_tree_node node
;
5281 /* Create the LABEL_DECL itself. */
5282 label
= create_artificial_label (loc
);
5284 /* If there was an error processing the switch condition, bail now
5285 before we get more confused. */
5286 if (!cond
|| cond
== error_mark_node
)
5289 if ((low_value
&& TREE_TYPE (low_value
)
5290 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
5291 || (high_value
&& TREE_TYPE (high_value
)
5292 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
5294 error_at (loc
, "pointers are not permitted as case values");
5298 /* Case ranges are a GNU extension. */
5300 pedwarn (loc
, OPT_pedantic
,
5301 "range expressions in switch statements are non-standard");
5303 type
= TREE_TYPE (cond
);
5306 low_value
= check_case_value (low_value
);
5307 low_value
= convert_and_check (type
, low_value
);
5308 if (low_value
== error_mark_node
)
5313 high_value
= check_case_value (high_value
);
5314 high_value
= convert_and_check (type
, high_value
);
5315 if (high_value
== error_mark_node
)
5319 if (low_value
&& high_value
)
5321 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5322 really a case range, even though it was written that way.
5323 Remove the HIGH_VALUE to simplify later processing. */
5324 if (tree_int_cst_equal (low_value
, high_value
))
5325 high_value
= NULL_TREE
;
5326 else if (!tree_int_cst_lt (low_value
, high_value
))
5327 warning_at (loc
, 0, "empty range specified");
5330 /* See if the case is in range of the type of the original testing
5331 expression. If both low_value and high_value are out of range,
5332 don't insert the case label and return NULL_TREE. */
5334 && !check_case_bounds (type
, orig_type
,
5335 &low_value
, high_value
? &high_value
: NULL
))
5338 /* Look up the LOW_VALUE in the table of case labels we already
5340 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
5341 /* If there was not an exact match, check for overlapping ranges.
5342 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5343 that's a `default' label and the only overlap is an exact match. */
5344 if (!node
&& (low_value
|| high_value
))
5346 splay_tree_node low_bound
;
5347 splay_tree_node high_bound
;
5349 /* Even though there wasn't an exact match, there might be an
5350 overlap between this case range and another case range.
5351 Since we've (inductively) not allowed any overlapping case
5352 ranges, we simply need to find the greatest low case label
5353 that is smaller that LOW_VALUE, and the smallest low case
5354 label that is greater than LOW_VALUE. If there is an overlap
5355 it will occur in one of these two ranges. */
5356 low_bound
= splay_tree_predecessor (cases
,
5357 (splay_tree_key
) low_value
);
5358 high_bound
= splay_tree_successor (cases
,
5359 (splay_tree_key
) low_value
);
5361 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5362 the LOW_VALUE, so there is no need to check unless the
5363 LOW_BOUND is in fact itself a case range. */
5365 && CASE_HIGH ((tree
) low_bound
->value
)
5366 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
5369 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5370 range is bigger than the low end of the current range, so we
5371 are only interested if the current range is a real range, and
5372 not an ordinary case label. */
5375 && (tree_int_cst_compare ((tree
) high_bound
->key
,
5380 /* If there was an overlap, issue an error. */
5383 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
5387 error_at (loc
, "duplicate (or overlapping) case value");
5388 error_at (DECL_SOURCE_LOCATION (duplicate
),
5389 "this is the first entry overlapping that value");
5393 error_at (loc
, "duplicate case value") ;
5394 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
5398 error_at (loc
, "multiple default labels in one switch");
5399 error_at (DECL_SOURCE_LOCATION (duplicate
),
5400 "this is the first default label");
5405 /* Add a CASE_LABEL to the statement-tree. */
5406 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
5407 /* Register this case label in the splay tree. */
5408 splay_tree_insert (cases
,
5409 (splay_tree_key
) low_value
,
5410 (splay_tree_value
) case_label
);
5415 /* Add a label so that the back-end doesn't think that the beginning of
5416 the switch is unreachable. Note that we do not add a case label, as
5417 that just leads to duplicates and thence to failure later on. */
5420 tree t
= create_artificial_label (loc
);
5421 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
5423 return error_mark_node
;
5426 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5427 Used to verify that case values match up with enumerator values. */
5430 match_case_to_enum_1 (tree key
, tree type
, tree label
)
5432 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
5434 /* ??? Not working too hard to print the double-word value.
5435 Should perhaps be done with %lwd in the diagnostic routines? */
5436 if (TREE_INT_CST_HIGH (key
) == 0)
5437 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
5438 TREE_INT_CST_LOW (key
));
5439 else if (!TYPE_UNSIGNED (type
)
5440 && TREE_INT_CST_HIGH (key
) == -1
5441 && TREE_INT_CST_LOW (key
) != 0)
5442 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
5443 -TREE_INT_CST_LOW (key
));
5445 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
5446 (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (key
),
5447 (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (key
));
5449 if (TYPE_NAME (type
) == 0)
5450 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
5451 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
5452 "case value %qs not in enumerated type",
5455 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
5456 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
5457 "case value %qs not in enumerated type %qT",
5461 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5462 Used to verify that case values match up with enumerator values. */
5465 match_case_to_enum (splay_tree_node node
, void *data
)
5467 tree label
= (tree
) node
->value
;
5468 tree type
= (tree
) data
;
5470 /* Skip default case. */
5471 if (!CASE_LOW (label
))
5474 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5475 when we did our enum->case scan. Reset our scratch bit after. */
5476 if (!CASE_LOW_SEEN (label
))
5477 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
5479 CASE_LOW_SEEN (label
) = 0;
5481 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5482 not set, that means that CASE_HIGH did not appear when we did our
5483 enum->case scan. Reset our scratch bit after. */
5484 if (CASE_HIGH (label
))
5486 if (!CASE_HIGH_SEEN (label
))
5487 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
5489 CASE_HIGH_SEEN (label
) = 0;
5495 /* Handle -Wswitch*. Called from the front end after parsing the
5496 switch construct. */
5497 /* ??? Should probably be somewhere generic, since other languages
5498 besides C and C++ would want this. At the moment, however, C/C++
5499 are the only tree-ssa languages that support enumerations at all,
5500 so the point is moot. */
5503 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
5504 tree type
, tree cond
)
5506 splay_tree_node default_node
;
5507 splay_tree_node node
;
5510 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
5513 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
5515 warning_at (switch_location
, OPT_Wswitch_default
,
5516 "switch missing default case");
5518 /* From here on, we only care about about enumerated types. */
5519 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
5522 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5523 if (!warn_switch_enum
&& !warn_switch
)
5526 /* Check the cases. Warn about case values which are not members of
5527 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5528 there is no default case, check that exactly all enumeration
5529 literals are covered by the cases. */
5531 /* Clearing COND if it is not an integer constant simplifies
5532 the tests inside the loop below. */
5533 if (TREE_CODE (cond
) != INTEGER_CST
)
5536 /* The time complexity here is O(N*lg(N)) worst case, but for the
5537 common case of monotonically increasing enumerators, it is
5538 O(N), since the nature of the splay tree will keep the next
5539 element adjacent to the root at all times. */
5541 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
5543 tree value
= TREE_VALUE (chain
);
5544 if (TREE_CODE (value
) == CONST_DECL
)
5545 value
= DECL_INITIAL (value
);
5546 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
5549 /* Mark the CASE_LOW part of the case entry as seen. */
5550 tree label
= (tree
) node
->value
;
5551 CASE_LOW_SEEN (label
) = 1;
5555 /* Even though there wasn't an exact match, there might be a
5556 case range which includes the enumerator's value. */
5557 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
5558 if (node
&& CASE_HIGH ((tree
) node
->value
))
5560 tree label
= (tree
) node
->value
;
5561 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
5564 /* If we match the upper bound exactly, mark the CASE_HIGH
5565 part of the case entry as seen. */
5567 CASE_HIGH_SEEN (label
) = 1;
5572 /* We've now determined that this enumerated literal isn't
5573 handled by the case labels of the switch statement. */
5575 /* If the switch expression is a constant, we only really care
5576 about whether that constant is handled by the switch. */
5577 if (cond
&& tree_int_cst_compare (cond
, value
))
5580 /* If there is a default_node, the only relevant option is
5581 Wswitch-enum. Otherwise, if both are enabled then we prefer
5582 to warn using -Wswitch because -Wswitch is enabled by -Wall
5583 while -Wswitch-enum is explicit. */
5584 warning_at (switch_location
,
5585 (default_node
|| !warn_switch
5588 "enumeration value %qE not handled in switch",
5589 TREE_PURPOSE (chain
));
5592 /* Warn if there are case expressions that don't correspond to
5593 enumerators. This can occur since C and C++ don't enforce
5594 type-checking of assignments to enumeration variables.
5596 The time complexity here is now always O(N) worst case, since
5597 we should have marked both the lower bound and upper bound of
5598 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5599 above. This scan also resets those fields. */
5601 splay_tree_foreach (cases
, match_case_to_enum
, type
);
5604 /* Finish an expression taking the address of LABEL (an
5605 IDENTIFIER_NODE). Returns an expression for the address.
5607 LOC is the location for the expression returned. */
5610 finish_label_address_expr (tree label
, location_t loc
)
5614 pedwarn (input_location
, OPT_pedantic
, "taking the address of a label is non-standard");
5616 if (label
== error_mark_node
)
5617 return error_mark_node
;
5619 label
= lookup_label (label
);
5620 if (label
== NULL_TREE
)
5621 result
= null_pointer_node
;
5624 TREE_USED (label
) = 1;
5625 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
5626 /* The current function is not necessarily uninlinable.
5627 Computed gotos are incompatible with inlining, but the value
5628 here could be used only in a diagnostic, for example. */
5629 protected_set_expr_location (result
, loc
);
5636 /* Given a boolean expression ARG, return a tree representing an increment
5637 or decrement (as indicated by CODE) of ARG. The front end must check for
5638 invalid cases (e.g., decrement in C++). */
5640 boolean_increment (enum tree_code code
, tree arg
)
5643 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
5645 arg
= stabilize_reference (arg
);
5648 case PREINCREMENT_EXPR
:
5649 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5651 case POSTINCREMENT_EXPR
:
5652 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5653 arg
= save_expr (arg
);
5654 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5655 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5657 case PREDECREMENT_EXPR
:
5658 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5659 invert_truthvalue_loc (input_location
, arg
));
5661 case POSTDECREMENT_EXPR
:
5662 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5663 invert_truthvalue_loc (input_location
, arg
));
5664 arg
= save_expr (arg
);
5665 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5666 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5671 TREE_SIDE_EFFECTS (val
) = 1;
5675 /* Built-in macros for stddef.h and stdint.h, that require macros
5676 defined in this file. */
5678 c_stddef_cpp_builtins(void)
5680 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
5681 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
5682 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
5683 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
5684 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
5685 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
5686 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
5687 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
5688 if (SIG_ATOMIC_TYPE
)
5689 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
5691 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
5693 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
5695 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
5697 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
5699 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
5701 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
5703 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
5705 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
5706 if (INT_LEAST8_TYPE
)
5707 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
5708 if (INT_LEAST16_TYPE
)
5709 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
5710 if (INT_LEAST32_TYPE
)
5711 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
5712 if (INT_LEAST64_TYPE
)
5713 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
5714 if (UINT_LEAST8_TYPE
)
5715 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
5716 if (UINT_LEAST16_TYPE
)
5717 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
5718 if (UINT_LEAST32_TYPE
)
5719 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
5720 if (UINT_LEAST64_TYPE
)
5721 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
5723 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
5724 if (INT_FAST16_TYPE
)
5725 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
5726 if (INT_FAST32_TYPE
)
5727 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
5728 if (INT_FAST64_TYPE
)
5729 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
5730 if (UINT_FAST8_TYPE
)
5731 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
5732 if (UINT_FAST16_TYPE
)
5733 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
5734 if (UINT_FAST32_TYPE
)
5735 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
5736 if (UINT_FAST64_TYPE
)
5737 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
5739 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
5741 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
5745 c_init_attributes (void)
5747 /* Fill in the built_in_attributes array. */
5748 #define DEF_ATTR_NULL_TREE(ENUM) \
5749 built_in_attributes[(int) ENUM] = NULL_TREE;
5750 #define DEF_ATTR_INT(ENUM, VALUE) \
5751 built_in_attributes[(int) ENUM] = build_int_cst (integer_type_node, VALUE);
5752 #define DEF_ATTR_IDENT(ENUM, STRING) \
5753 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5754 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5755 built_in_attributes[(int) ENUM] \
5756 = tree_cons (built_in_attributes[(int) PURPOSE], \
5757 built_in_attributes[(int) VALUE], \
5758 built_in_attributes[(int) CHAIN]);
5759 #include "builtin-attrs.def"
5760 #undef DEF_ATTR_NULL_TREE
5762 #undef DEF_ATTR_IDENT
5763 #undef DEF_ATTR_TREE_LIST
5766 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5767 identifier as an argument, so the front end shouldn't look it up. */
5770 attribute_takes_identifier_p (const_tree attr_id
)
5772 const struct attribute_spec
*spec
= lookup_attribute_spec (attr_id
);
5774 /* Unknown attribute that we'll end up ignoring, return true so we
5775 don't complain about an identifier argument. */
5777 else if (!strcmp ("mode", spec
->name
)
5778 || !strcmp ("format", spec
->name
)
5779 || !strcmp ("cleanup", spec
->name
))
5782 return targetm
.attribute_takes_identifier_p (attr_id
);
5785 /* Attribute handlers common to C front ends. */
5787 /* Handle a "packed" attribute; arguments as in
5788 struct attribute_spec.handler. */
5791 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5792 int flags
, bool *no_add_attrs
)
5796 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5797 *node
= build_variant_type_copy (*node
);
5798 TYPE_PACKED (*node
) = 1;
5800 else if (TREE_CODE (*node
) == FIELD_DECL
)
5802 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
5803 /* Still pack bitfields. */
5804 && ! DECL_INITIAL (*node
))
5805 warning (OPT_Wattributes
,
5806 "%qE attribute ignored for field of type %qT",
5807 name
, TREE_TYPE (*node
));
5809 DECL_PACKED (*node
) = 1;
5811 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5812 used for DECL_REGISTER. It wouldn't mean anything anyway.
5813 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5814 that changes what the typedef is typing. */
5817 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5818 *no_add_attrs
= true;
5824 /* Handle a "nocommon" attribute; arguments as in
5825 struct attribute_spec.handler. */
5828 handle_nocommon_attribute (tree
*node
, tree name
,
5829 tree
ARG_UNUSED (args
),
5830 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5832 if (TREE_CODE (*node
) == VAR_DECL
)
5833 DECL_COMMON (*node
) = 0;
5836 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5837 *no_add_attrs
= true;
5843 /* Handle a "common" attribute; arguments as in
5844 struct attribute_spec.handler. */
5847 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5848 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5850 if (TREE_CODE (*node
) == VAR_DECL
)
5851 DECL_COMMON (*node
) = 1;
5854 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5855 *no_add_attrs
= true;
5861 /* Handle a "noreturn" attribute; arguments as in
5862 struct attribute_spec.handler. */
5865 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5866 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5868 tree type
= TREE_TYPE (*node
);
5870 /* See FIXME comment in c_common_attribute_table. */
5871 if (TREE_CODE (*node
) == FUNCTION_DECL
5872 || objc_method_decl (TREE_CODE (*node
)))
5873 TREE_THIS_VOLATILE (*node
) = 1;
5874 else if (TREE_CODE (type
) == POINTER_TYPE
5875 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5877 = build_pointer_type
5878 (build_type_variant (TREE_TYPE (type
),
5879 TYPE_READONLY (TREE_TYPE (type
)), 1));
5882 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5883 *no_add_attrs
= true;
5889 /* Handle a "hot" and attribute; arguments as in
5890 struct attribute_spec.handler. */
5893 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5894 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5896 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5898 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
5900 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5902 *no_add_attrs
= true;
5904 /* Most of the rest of the hot processing is done later with
5905 lookup_attribute. */
5909 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5910 *no_add_attrs
= true;
5915 /* Handle a "cold" and attribute; arguments as in
5916 struct attribute_spec.handler. */
5919 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5920 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5922 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5924 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
5926 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5928 *no_add_attrs
= true;
5930 /* Most of the rest of the cold processing is done later with
5931 lookup_attribute. */
5935 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5936 *no_add_attrs
= true;
5942 /* Handle a "noinline" attribute; arguments as in
5943 struct attribute_spec.handler. */
5946 handle_noinline_attribute (tree
*node
, tree name
,
5947 tree
ARG_UNUSED (args
),
5948 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5950 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5951 DECL_UNINLINABLE (*node
) = 1;
5954 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5955 *no_add_attrs
= true;
5961 /* Handle a "noclone" attribute; arguments as in
5962 struct attribute_spec.handler. */
5965 handle_noclone_attribute (tree
*node
, tree name
,
5966 tree
ARG_UNUSED (args
),
5967 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5969 if (TREE_CODE (*node
) != FUNCTION_DECL
)
5971 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5972 *no_add_attrs
= true;
5978 /* Handle a "always_inline" attribute; arguments as in
5979 struct attribute_spec.handler. */
5982 handle_always_inline_attribute (tree
*node
, tree name
,
5983 tree
ARG_UNUSED (args
),
5984 int ARG_UNUSED (flags
),
5987 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5989 /* Set the attribute and mark it for disregarding inline
5991 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
5995 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5996 *no_add_attrs
= true;
6002 /* Handle a "gnu_inline" attribute; arguments as in
6003 struct attribute_spec.handler. */
6006 handle_gnu_inline_attribute (tree
*node
, tree name
,
6007 tree
ARG_UNUSED (args
),
6008 int ARG_UNUSED (flags
),
6011 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
6013 /* Do nothing else, just set the attribute. We'll get at
6014 it later with lookup_attribute. */
6018 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6019 *no_add_attrs
= true;
6025 /* Handle a "leaf" attribute; arguments as in
6026 struct attribute_spec.handler. */
6029 handle_leaf_attribute (tree
*node
, tree name
,
6030 tree
ARG_UNUSED (args
),
6031 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6033 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6035 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6036 *no_add_attrs
= true;
6038 if (!TREE_PUBLIC (*node
))
6040 warning (OPT_Wattributes
, "%qE attribute has no effect on unit local functions", name
);
6041 *no_add_attrs
= true;
6047 /* Handle an "artificial" attribute; arguments as in
6048 struct attribute_spec.handler. */
6051 handle_artificial_attribute (tree
*node
, tree name
,
6052 tree
ARG_UNUSED (args
),
6053 int ARG_UNUSED (flags
),
6056 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
6058 /* Do nothing else, just set the attribute. We'll get at
6059 it later with lookup_attribute. */
6063 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6064 *no_add_attrs
= true;
6070 /* Handle a "flatten" attribute; arguments as in
6071 struct attribute_spec.handler. */
6074 handle_flatten_attribute (tree
*node
, tree name
,
6075 tree args ATTRIBUTE_UNUSED
,
6076 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
6078 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6079 /* Do nothing else, just set the attribute. We'll get at
6080 it later with lookup_attribute. */
6084 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6085 *no_add_attrs
= true;
6091 /* Handle a "warning" or "error" attribute; arguments as in
6092 struct attribute_spec.handler. */
6095 handle_error_attribute (tree
*node
, tree name
, tree args
,
6096 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6098 if (TREE_CODE (*node
) == FUNCTION_DECL
6099 || TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
6100 /* Do nothing else, just set the attribute. We'll get at
6101 it later with lookup_attribute. */
6105 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6106 *no_add_attrs
= true;
6112 /* Handle a "used" attribute; arguments as in
6113 struct attribute_spec.handler. */
6116 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
6117 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6121 if (TREE_CODE (node
) == FUNCTION_DECL
6122 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
))
6123 || (TREE_CODE (node
) == TYPE_DECL
))
6125 TREE_USED (node
) = 1;
6126 DECL_PRESERVE_P (node
) = 1;
6127 if (TREE_CODE (node
) == VAR_DECL
)
6128 DECL_READ_P (node
) = 1;
6132 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6133 *no_add_attrs
= true;
6139 /* Handle a "unused" attribute; arguments as in
6140 struct attribute_spec.handler. */
6143 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6144 int flags
, bool *no_add_attrs
)
6150 if (TREE_CODE (decl
) == PARM_DECL
6151 || TREE_CODE (decl
) == VAR_DECL
6152 || TREE_CODE (decl
) == FUNCTION_DECL
6153 || TREE_CODE (decl
) == LABEL_DECL
6154 || TREE_CODE (decl
) == TYPE_DECL
)
6156 TREE_USED (decl
) = 1;
6157 if (TREE_CODE (decl
) == VAR_DECL
6158 || TREE_CODE (decl
) == PARM_DECL
)
6159 DECL_READ_P (decl
) = 1;
6163 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6164 *no_add_attrs
= true;
6169 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6170 *node
= build_variant_type_copy (*node
);
6171 TREE_USED (*node
) = 1;
6177 /* Handle a "externally_visible" attribute; arguments as in
6178 struct attribute_spec.handler. */
6181 handle_externally_visible_attribute (tree
*pnode
, tree name
,
6182 tree
ARG_UNUSED (args
),
6183 int ARG_UNUSED (flags
),
6188 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
6190 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
6191 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
6193 warning (OPT_Wattributes
,
6194 "%qE attribute have effect only on public objects", name
);
6195 *no_add_attrs
= true;
6200 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6201 *no_add_attrs
= true;
6207 /* Handle a "const" attribute; arguments as in
6208 struct attribute_spec.handler. */
6211 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6212 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6214 tree type
= TREE_TYPE (*node
);
6216 /* See FIXME comment on noreturn in c_common_attribute_table. */
6217 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6218 TREE_READONLY (*node
) = 1;
6219 else if (TREE_CODE (type
) == POINTER_TYPE
6220 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6222 = build_pointer_type
6223 (build_type_variant (TREE_TYPE (type
), 1,
6224 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
6227 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6228 *no_add_attrs
= true;
6234 /* Handle a "transparent_union" attribute; arguments as in
6235 struct attribute_spec.handler. */
6238 handle_transparent_union_attribute (tree
*node
, tree name
,
6239 tree
ARG_UNUSED (args
), int flags
,
6244 *no_add_attrs
= true;
6246 if (TREE_CODE (*node
) == TYPE_DECL
)
6247 node
= &TREE_TYPE (*node
);
6250 if (TREE_CODE (type
) == UNION_TYPE
)
6252 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6253 the code in finish_struct. */
6254 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6256 if (TYPE_FIELDS (type
) == NULL_TREE
6258 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
6261 /* A type variant isn't good enough, since we don't a cast
6262 to such a type removed as a no-op. */
6263 *node
= type
= build_duplicate_type (type
);
6266 TYPE_TRANSPARENT_AGGR (type
) = 1;
6271 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6275 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6276 get the requested priority for a constructor or destructor,
6277 possibly issuing diagnostics for invalid or reserved
6280 static priority_type
6281 get_priority (tree args
, bool is_destructor
)
6287 return DEFAULT_INIT_PRIORITY
;
6289 if (!SUPPORTS_INIT_PRIORITY
)
6292 error ("destructor priorities are not supported");
6294 error ("constructor priorities are not supported");
6295 return DEFAULT_INIT_PRIORITY
;
6298 arg
= TREE_VALUE (args
);
6299 if (!host_integerp (arg
, /*pos=*/0)
6300 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6303 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
6304 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
6307 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
6311 "destructor priorities from 0 to %d are reserved "
6312 "for the implementation",
6313 MAX_RESERVED_INIT_PRIORITY
);
6316 "constructor priorities from 0 to %d are reserved "
6317 "for the implementation",
6318 MAX_RESERVED_INIT_PRIORITY
);
6324 error ("destructor priorities must be integers from 0 to %d inclusive",
6327 error ("constructor priorities must be integers from 0 to %d inclusive",
6329 return DEFAULT_INIT_PRIORITY
;
6332 /* Handle a "constructor" attribute; arguments as in
6333 struct attribute_spec.handler. */
6336 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
6337 int ARG_UNUSED (flags
),
6341 tree type
= TREE_TYPE (decl
);
6343 if (TREE_CODE (decl
) == FUNCTION_DECL
6344 && TREE_CODE (type
) == FUNCTION_TYPE
6345 && decl_function_context (decl
) == 0)
6347 priority_type priority
;
6348 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
6349 priority
= get_priority (args
, /*is_destructor=*/false);
6350 SET_DECL_INIT_PRIORITY (decl
, priority
);
6351 TREE_USED (decl
) = 1;
6355 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6356 *no_add_attrs
= true;
6362 /* Handle a "destructor" attribute; arguments as in
6363 struct attribute_spec.handler. */
6366 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
6367 int ARG_UNUSED (flags
),
6371 tree type
= TREE_TYPE (decl
);
6373 if (TREE_CODE (decl
) == FUNCTION_DECL
6374 && TREE_CODE (type
) == FUNCTION_TYPE
6375 && decl_function_context (decl
) == 0)
6377 priority_type priority
;
6378 DECL_STATIC_DESTRUCTOR (decl
) = 1;
6379 priority
= get_priority (args
, /*is_destructor=*/true);
6380 SET_DECL_FINI_PRIORITY (decl
, priority
);
6381 TREE_USED (decl
) = 1;
6385 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6386 *no_add_attrs
= true;
6392 /* Nonzero if the mode is a valid vector mode for this architecture.
6393 This returns nonzero even if there is no hardware support for the
6394 vector mode, but we can emulate with narrower modes. */
6397 vector_mode_valid_p (enum machine_mode mode
)
6399 enum mode_class mclass
= GET_MODE_CLASS (mode
);
6400 enum machine_mode innermode
;
6402 /* Doh! What's going on? */
6403 if (mclass
!= MODE_VECTOR_INT
6404 && mclass
!= MODE_VECTOR_FLOAT
6405 && mclass
!= MODE_VECTOR_FRACT
6406 && mclass
!= MODE_VECTOR_UFRACT
6407 && mclass
!= MODE_VECTOR_ACCUM
6408 && mclass
!= MODE_VECTOR_UACCUM
)
6411 /* Hardware support. Woo hoo! */
6412 if (targetm
.vector_mode_supported_p (mode
))
6415 innermode
= GET_MODE_INNER (mode
);
6417 /* We should probably return 1 if requesting V4DI and we have no DI,
6418 but we have V2DI, but this is probably very unlikely. */
6420 /* If we have support for the inner mode, we can safely emulate it.
6421 We may not have V2DI, but me can emulate with a pair of DIs. */
6422 return targetm
.scalar_mode_supported_p (innermode
);
6426 /* Handle a "mode" attribute; arguments as in
6427 struct attribute_spec.handler. */
6430 handle_mode_attribute (tree
*node
, tree name
, tree args
,
6431 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6434 tree ident
= TREE_VALUE (args
);
6436 *no_add_attrs
= true;
6438 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
6439 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6443 const char *p
= IDENTIFIER_POINTER (ident
);
6444 int len
= strlen (p
);
6445 enum machine_mode mode
= VOIDmode
;
6449 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
6450 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
6452 char *newp
= (char *) alloca (len
- 1);
6454 strcpy (newp
, &p
[2]);
6455 newp
[len
- 4] = '\0';
6459 /* Change this type to have a type with the specified mode.
6460 First check for the special modes. */
6461 if (!strcmp (p
, "byte"))
6463 else if (!strcmp (p
, "word"))
6465 else if (!strcmp (p
, "pointer"))
6467 else if (!strcmp (p
, "libgcc_cmp_return"))
6468 mode
= targetm
.libgcc_cmp_return_mode ();
6469 else if (!strcmp (p
, "libgcc_shift_count"))
6470 mode
= targetm
.libgcc_shift_count_mode ();
6471 else if (!strcmp (p
, "unwind_word"))
6472 mode
= targetm
.unwind_word_mode ();
6474 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
6475 if (!strcmp (p
, GET_MODE_NAME (j
)))
6477 mode
= (enum machine_mode
) j
;
6481 if (mode
== VOIDmode
)
6483 error ("unknown machine mode %qE", ident
);
6488 switch (GET_MODE_CLASS (mode
))
6491 case MODE_PARTIAL_INT
:
6493 case MODE_DECIMAL_FLOAT
:
6498 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
6501 case MODE_COMPLEX_INT
:
6502 case MODE_COMPLEX_FLOAT
:
6503 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
6506 case MODE_VECTOR_INT
:
6507 case MODE_VECTOR_FLOAT
:
6508 case MODE_VECTOR_FRACT
:
6509 case MODE_VECTOR_UFRACT
:
6510 case MODE_VECTOR_ACCUM
:
6511 case MODE_VECTOR_UACCUM
:
6512 warning (OPT_Wattributes
, "specifying vector types with "
6513 "__attribute__ ((mode)) is deprecated");
6514 warning (OPT_Wattributes
,
6515 "use __attribute__ ((vector_size)) instead");
6516 valid_mode
= vector_mode_valid_p (mode
);
6524 error ("unable to emulate %qs", p
);
6528 if (POINTER_TYPE_P (type
))
6530 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
6531 tree (*fn
)(tree
, enum machine_mode
, bool);
6533 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
6535 error ("invalid pointer mode %qs", p
);
6539 if (TREE_CODE (type
) == POINTER_TYPE
)
6540 fn
= build_pointer_type_for_mode
;
6542 fn
= build_reference_type_for_mode
;
6543 typefm
= fn (TREE_TYPE (type
), mode
, false);
6547 /* For fixed-point modes, we need to test if the signness of type
6548 and the machine mode are consistent. */
6549 if (ALL_FIXED_POINT_MODE_P (mode
)
6550 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
6552 error ("signedness of type and machine mode %qs don%'t match", p
);
6555 /* For fixed-point modes, we need to pass saturating info. */
6556 typefm
= lang_hooks
.types
.type_for_mode (mode
,
6557 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
6558 : TYPE_UNSIGNED (type
));
6561 if (typefm
== NULL_TREE
)
6563 error ("no data type for mode %qs", p
);
6566 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
6568 /* For enumeral types, copy the precision from the integer
6569 type returned above. If not an INTEGER_TYPE, we can't use
6570 this mode for this type. */
6571 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
6573 error ("cannot use mode %qs for enumeral types", p
);
6577 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
6579 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
6584 /* We cannot build a type variant, as there's code that assumes
6585 that TYPE_MAIN_VARIANT has the same mode. This includes the
6586 debug generators. Instead, create a subrange type. This
6587 results in all of the enumeral values being emitted only once
6588 in the original, and the subtype gets them by reference. */
6589 if (TYPE_UNSIGNED (type
))
6590 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
6592 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
6593 TREE_TYPE (typefm
) = type
;
6596 else if (VECTOR_MODE_P (mode
)
6597 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
6598 : TREE_CODE (type
) != TREE_CODE (typefm
))
6600 error ("mode %qs applied to inappropriate type", p
);
6610 /* Handle a "section" attribute; arguments as in
6611 struct attribute_spec.handler. */
6614 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6615 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6619 if (targetm_common
.have_named_sections
)
6621 user_defined_section_attribute
= true;
6623 if ((TREE_CODE (decl
) == FUNCTION_DECL
6624 || TREE_CODE (decl
) == VAR_DECL
)
6625 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
6627 if (TREE_CODE (decl
) == VAR_DECL
6628 && current_function_decl
!= NULL_TREE
6629 && !TREE_STATIC (decl
))
6631 error_at (DECL_SOURCE_LOCATION (decl
),
6632 "section attribute cannot be specified for "
6634 *no_add_attrs
= true;
6637 /* The decl may have already been given a section attribute
6638 from a previous declaration. Ensure they match. */
6639 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
6640 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
6641 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
6643 error ("section of %q+D conflicts with previous declaration",
6645 *no_add_attrs
= true;
6647 else if (TREE_CODE (decl
) == VAR_DECL
6648 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
6649 && DECL_THREAD_LOCAL_P (decl
))
6651 error ("section of %q+D cannot be overridden", *node
);
6652 *no_add_attrs
= true;
6655 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
6659 error ("section attribute not allowed for %q+D", *node
);
6660 *no_add_attrs
= true;
6665 error_at (DECL_SOURCE_LOCATION (*node
),
6666 "section attributes are not supported for this target");
6667 *no_add_attrs
= true;
6673 /* Handle a "aligned" attribute; arguments as in
6674 struct attribute_spec.handler. */
6677 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6678 int flags
, bool *no_add_attrs
)
6680 tree decl
= NULL_TREE
;
6683 tree align_expr
= (args
? TREE_VALUE (args
)
6684 : size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
));
6690 type
= &TREE_TYPE (decl
);
6691 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
6693 else if (TYPE_P (*node
))
6694 type
= node
, is_type
= 1;
6696 if (TREE_CODE (align_expr
) != INTEGER_CST
)
6698 error ("requested alignment is not a constant");
6699 *no_add_attrs
= true;
6701 else if ((i
= tree_log2 (align_expr
)) == -1)
6703 error ("requested alignment is not a power of 2");
6704 *no_add_attrs
= true;
6706 else if (i
>= HOST_BITS_PER_INT
- BITS_PER_UNIT_LOG
)
6708 error ("requested alignment is too large");
6709 *no_add_attrs
= true;
6713 if ((flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6714 /* OK, modify the type in place. */;
6715 /* If we have a TYPE_DECL, then copy the type, so that we
6716 don't accidentally modify a builtin type. See pushdecl. */
6717 else if (decl
&& TREE_TYPE (decl
) != error_mark_node
6718 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
6720 tree tt
= TREE_TYPE (decl
);
6721 *type
= build_variant_type_copy (*type
);
6722 DECL_ORIGINAL_TYPE (decl
) = tt
;
6723 TYPE_NAME (*type
) = decl
;
6724 TREE_USED (*type
) = TREE_USED (decl
);
6725 TREE_TYPE (decl
) = *type
;
6728 *type
= build_variant_type_copy (*type
);
6730 TYPE_ALIGN (*type
) = (1U << i
) * BITS_PER_UNIT
;
6731 TYPE_USER_ALIGN (*type
) = 1;
6733 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
6734 && TREE_CODE (decl
) != FIELD_DECL
)
6736 error ("alignment may not be specified for %q+D", decl
);
6737 *no_add_attrs
= true;
6739 else if (TREE_CODE (decl
) == FUNCTION_DECL
6740 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
6742 if (DECL_USER_ALIGN (decl
))
6743 error ("alignment for %q+D was previously specified as %d "
6744 "and may not be decreased", decl
,
6745 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6747 error ("alignment for %q+D must be at least %d", decl
,
6748 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6749 *no_add_attrs
= true;
6753 DECL_ALIGN (decl
) = (1U << i
) * BITS_PER_UNIT
;
6754 DECL_USER_ALIGN (decl
) = 1;
6760 /* Handle a "weak" attribute; arguments as in
6761 struct attribute_spec.handler. */
6764 handle_weak_attribute (tree
*node
, tree name
,
6765 tree
ARG_UNUSED (args
),
6766 int ARG_UNUSED (flags
),
6767 bool * ARG_UNUSED (no_add_attrs
))
6769 if (TREE_CODE (*node
) == FUNCTION_DECL
6770 && DECL_DECLARED_INLINE_P (*node
))
6772 warning (OPT_Wattributes
, "inline function %q+D declared weak", *node
);
6773 *no_add_attrs
= true;
6775 else if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
6777 error ("indirect function %q+D cannot be declared weak", *node
);
6778 *no_add_attrs
= true;
6781 else if (TREE_CODE (*node
) == FUNCTION_DECL
6782 || TREE_CODE (*node
) == VAR_DECL
)
6783 declare_weak (*node
);
6785 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6790 /* Handle an "alias" or "ifunc" attribute; arguments as in
6791 struct attribute_spec.handler, except that IS_ALIAS tells us
6792 whether this is an alias as opposed to ifunc attribute. */
6795 handle_alias_ifunc_attribute (bool is_alias
, tree
*node
, tree name
, tree args
,
6800 if (TREE_CODE (decl
) != FUNCTION_DECL
6801 && (!is_alias
|| TREE_CODE (decl
) != VAR_DECL
))
6803 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6804 *no_add_attrs
= true;
6806 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
6807 || (TREE_CODE (decl
) != FUNCTION_DECL
6808 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
6809 /* A static variable declaration is always a tentative definition,
6810 but the alias is a non-tentative definition which overrides. */
6811 || (TREE_CODE (decl
) != FUNCTION_DECL
6812 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
6814 error ("%q+D defined both normally and as %qE attribute", decl
, name
);
6815 *no_add_attrs
= true;
6819 && (lookup_attribute ("weak", DECL_ATTRIBUTES (decl
))
6820 || lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
))))
6822 error ("weak %q+D cannot be defined %qE", decl
, name
);
6823 *no_add_attrs
= true;
6827 /* Note that the very first time we process a nested declaration,
6828 decl_function_context will not be set. Indeed, *would* never
6829 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6830 we do below. After such frobbery, pushdecl would set the context.
6831 In any case, this is never what we want. */
6832 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
6836 id
= TREE_VALUE (args
);
6837 if (TREE_CODE (id
) != STRING_CST
)
6839 error ("attribute %qE argument not a string", name
);
6840 *no_add_attrs
= true;
6843 id
= get_identifier (TREE_STRING_POINTER (id
));
6844 /* This counts as a use of the object pointed to. */
6847 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6848 DECL_INITIAL (decl
) = error_mark_node
;
6851 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
6852 DECL_EXTERNAL (decl
) = 1;
6854 DECL_EXTERNAL (decl
) = 0;
6855 TREE_STATIC (decl
) = 1;
6859 /* ifuncs are also aliases, so set that attribute too. */
6860 DECL_ATTRIBUTES (decl
)
6861 = tree_cons (get_identifier ("alias"), args
, DECL_ATTRIBUTES (decl
));
6865 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6866 *no_add_attrs
= true;
6872 /* Handle an "alias" or "ifunc" attribute; arguments as in
6873 struct attribute_spec.handler. */
6876 handle_ifunc_attribute (tree
*node
, tree name
, tree args
,
6877 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6879 return handle_alias_ifunc_attribute (false, node
, name
, args
, no_add_attrs
);
6882 /* Handle an "alias" or "ifunc" attribute; arguments as in
6883 struct attribute_spec.handler. */
6886 handle_alias_attribute (tree
*node
, tree name
, tree args
,
6887 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6889 return handle_alias_ifunc_attribute (true, node
, name
, args
, no_add_attrs
);
6892 /* Handle a "weakref" attribute; arguments as in struct
6893 attribute_spec.handler. */
6896 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6897 int flags
, bool *no_add_attrs
)
6899 tree attr
= NULL_TREE
;
6901 /* We must ignore the attribute when it is associated with
6902 local-scoped decls, since attribute alias is ignored and many
6903 such symbols do not even have a DECL_WEAK field. */
6904 if (decl_function_context (*node
)
6905 || current_function_decl
6906 || (TREE_CODE (*node
) != VAR_DECL
&& TREE_CODE (*node
) != FUNCTION_DECL
))
6908 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6909 *no_add_attrs
= true;
6913 if (lookup_attribute ("ifunc", DECL_ATTRIBUTES (*node
)))
6915 error ("indirect function %q+D cannot be declared weakref", *node
);
6916 *no_add_attrs
= true;
6920 /* The idea here is that `weakref("name")' mutates into `weakref,
6921 alias("name")', and weakref without arguments, in turn,
6922 implicitly adds weak. */
6926 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
6927 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
6929 *no_add_attrs
= true;
6931 decl_attributes (node
, attr
, flags
);
6935 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
6936 error_at (DECL_SOURCE_LOCATION (*node
),
6937 "weakref attribute must appear before alias attribute");
6939 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6940 and that isn't supported; and because it wants to add it to
6941 the list of weak decls, which isn't helpful. */
6942 DECL_WEAK (*node
) = 1;
6948 /* Handle an "visibility" attribute; arguments as in
6949 struct attribute_spec.handler. */
6952 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
6953 int ARG_UNUSED (flags
),
6954 bool *ARG_UNUSED (no_add_attrs
))
6957 tree id
= TREE_VALUE (args
);
6958 enum symbol_visibility vis
;
6962 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
6964 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
6966 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
6970 else if (TYPE_FIELDS (*node
))
6972 error ("%qE attribute ignored because %qT is already defined",
6977 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
6979 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6983 if (TREE_CODE (id
) != STRING_CST
)
6985 error ("visibility argument not a string");
6989 /* If this is a type, set the visibility on the type decl. */
6992 decl
= TYPE_NAME (decl
);
6995 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6997 warning (OPT_Wattributes
, "%qE attribute ignored on types",
7003 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
7004 vis
= VISIBILITY_DEFAULT
;
7005 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
7006 vis
= VISIBILITY_INTERNAL
;
7007 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
7008 vis
= VISIBILITY_HIDDEN
;
7009 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
7010 vis
= VISIBILITY_PROTECTED
;
7013 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
7014 vis
= VISIBILITY_DEFAULT
;
7017 if (DECL_VISIBILITY_SPECIFIED (decl
)
7018 && vis
!= DECL_VISIBILITY (decl
))
7020 tree attributes
= (TYPE_P (*node
)
7021 ? TYPE_ATTRIBUTES (*node
)
7022 : DECL_ATTRIBUTES (decl
));
7023 if (lookup_attribute ("visibility", attributes
))
7024 error ("%qD redeclared with different visibility", decl
);
7025 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7026 && lookup_attribute ("dllimport", attributes
))
7027 error ("%qD was declared %qs which implies default visibility",
7029 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7030 && lookup_attribute ("dllexport", attributes
))
7031 error ("%qD was declared %qs which implies default visibility",
7035 DECL_VISIBILITY (decl
) = vis
;
7036 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
7038 /* Go ahead and attach the attribute to the node as well. This is needed
7039 so we can determine whether we have VISIBILITY_DEFAULT because the
7040 visibility was not specified, or because it was explicitly overridden
7041 from the containing scope. */
7046 /* Determine the ELF symbol visibility for DECL, which is either a
7047 variable or a function. It is an error to use this function if a
7048 definition of DECL is not available in this translation unit.
7049 Returns true if the final visibility has been determined by this
7050 function; false if the caller is free to make additional
7054 c_determine_visibility (tree decl
)
7056 gcc_assert (TREE_CODE (decl
) == VAR_DECL
7057 || TREE_CODE (decl
) == FUNCTION_DECL
);
7059 /* If the user explicitly specified the visibility with an
7060 attribute, honor that. DECL_VISIBILITY will have been set during
7061 the processing of the attribute. We check for an explicit
7062 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
7063 to distinguish the use of an attribute from the use of a "#pragma
7064 GCC visibility push(...)"; in the latter case we still want other
7065 considerations to be able to overrule the #pragma. */
7066 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
7067 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7068 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
7069 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
7072 /* Set default visibility to whatever the user supplied with
7073 visibility_specified depending on #pragma GCC visibility. */
7074 if (!DECL_VISIBILITY_SPECIFIED (decl
))
7076 if (visibility_options
.inpragma
7077 || DECL_VISIBILITY (decl
) != default_visibility
)
7079 DECL_VISIBILITY (decl
) = default_visibility
;
7080 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
7081 /* If visibility changed and DECL already has DECL_RTL, ensure
7082 symbol flags are updated. */
7083 if (((TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
))
7084 || TREE_CODE (decl
) == FUNCTION_DECL
)
7085 && DECL_RTL_SET_P (decl
))
7086 make_decl_rtl (decl
);
7092 /* Handle an "tls_model" attribute; arguments as in
7093 struct attribute_spec.handler. */
7096 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
7097 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7101 enum tls_model kind
;
7103 *no_add_attrs
= true;
7105 if (TREE_CODE (decl
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (decl
))
7107 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7111 kind
= DECL_TLS_MODEL (decl
);
7112 id
= TREE_VALUE (args
);
7113 if (TREE_CODE (id
) != STRING_CST
)
7115 error ("tls_model argument not a string");
7119 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
7120 kind
= TLS_MODEL_LOCAL_EXEC
;
7121 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
7122 kind
= TLS_MODEL_INITIAL_EXEC
;
7123 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
7124 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
7125 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
7126 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
7128 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7130 DECL_TLS_MODEL (decl
) = kind
;
7134 /* Handle a "no_instrument_function" attribute; arguments as in
7135 struct attribute_spec.handler. */
7138 handle_no_instrument_function_attribute (tree
*node
, tree name
,
7139 tree
ARG_UNUSED (args
),
7140 int ARG_UNUSED (flags
),
7145 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7147 error_at (DECL_SOURCE_LOCATION (decl
),
7148 "%qE attribute applies only to functions", name
);
7149 *no_add_attrs
= true;
7151 else if (DECL_INITIAL (decl
))
7153 error_at (DECL_SOURCE_LOCATION (decl
),
7154 "can%'t set %qE attribute after definition", name
);
7155 *no_add_attrs
= true;
7158 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
7163 /* Handle a "malloc" attribute; arguments as in
7164 struct attribute_spec.handler. */
7167 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7168 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7170 if (TREE_CODE (*node
) == FUNCTION_DECL
7171 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
7172 DECL_IS_MALLOC (*node
) = 1;
7175 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7176 *no_add_attrs
= true;
7182 /* Handle a "alloc_size" attribute; arguments as in
7183 struct attribute_spec.handler. */
7186 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7187 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7189 unsigned arg_count
= type_num_arguments (*node
);
7190 for (; args
; args
= TREE_CHAIN (args
))
7192 tree position
= TREE_VALUE (args
);
7194 if (TREE_CODE (position
) != INTEGER_CST
7195 || TREE_INT_CST_HIGH (position
)
7196 || TREE_INT_CST_LOW (position
) < 1
7197 || TREE_INT_CST_LOW (position
) > arg_count
)
7199 warning (OPT_Wattributes
,
7200 "alloc_size parameter outside range");
7201 *no_add_attrs
= true;
7208 /* Handle a "fn spec" attribute; arguments as in
7209 struct attribute_spec.handler. */
7212 handle_fnspec_attribute (tree
*node ATTRIBUTE_UNUSED
, tree
ARG_UNUSED (name
),
7213 tree args
, int ARG_UNUSED (flags
),
7214 bool *no_add_attrs ATTRIBUTE_UNUSED
)
7217 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
7218 && !TREE_CHAIN (args
));
7222 /* Handle a "returns_twice" attribute; arguments as in
7223 struct attribute_spec.handler. */
7226 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7227 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7229 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7230 DECL_IS_RETURNS_TWICE (*node
) = 1;
7233 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7234 *no_add_attrs
= true;
7240 /* Handle a "no_limit_stack" attribute; arguments as in
7241 struct attribute_spec.handler. */
7244 handle_no_limit_stack_attribute (tree
*node
, tree name
,
7245 tree
ARG_UNUSED (args
),
7246 int ARG_UNUSED (flags
),
7251 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7253 error_at (DECL_SOURCE_LOCATION (decl
),
7254 "%qE attribute applies only to functions", name
);
7255 *no_add_attrs
= true;
7257 else if (DECL_INITIAL (decl
))
7259 error_at (DECL_SOURCE_LOCATION (decl
),
7260 "can%'t set %qE attribute after definition", name
);
7261 *no_add_attrs
= true;
7264 DECL_NO_LIMIT_STACK (decl
) = 1;
7269 /* Handle a "pure" attribute; arguments as in
7270 struct attribute_spec.handler. */
7273 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7274 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7276 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7277 DECL_PURE_P (*node
) = 1;
7278 /* ??? TODO: Support types. */
7281 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7282 *no_add_attrs
= true;
7288 /* Handle a "no vops" attribute; arguments as in
7289 struct attribute_spec.handler. */
7292 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7293 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
7294 bool *ARG_UNUSED (no_add_attrs
))
7296 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
7297 DECL_IS_NOVOPS (*node
) = 1;
7301 /* Handle a "deprecated" attribute; arguments as in
7302 struct attribute_spec.handler. */
7305 handle_deprecated_attribute (tree
*node
, tree name
,
7306 tree args
, int flags
,
7309 tree type
= NULL_TREE
;
7311 tree what
= NULL_TREE
;
7314 *no_add_attrs
= true;
7315 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7317 error ("deprecated message is not a string");
7318 *no_add_attrs
= true;
7324 type
= TREE_TYPE (decl
);
7326 if (TREE_CODE (decl
) == TYPE_DECL
7327 || TREE_CODE (decl
) == PARM_DECL
7328 || TREE_CODE (decl
) == VAR_DECL
7329 || TREE_CODE (decl
) == FUNCTION_DECL
7330 || TREE_CODE (decl
) == FIELD_DECL
7331 || objc_method_decl (TREE_CODE (decl
)))
7332 TREE_DEPRECATED (decl
) = 1;
7336 else if (TYPE_P (*node
))
7338 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7339 *node
= build_variant_type_copy (*node
);
7340 TREE_DEPRECATED (*node
) = 1;
7348 *no_add_attrs
= true;
7349 if (type
&& TYPE_NAME (type
))
7351 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
7352 what
= TYPE_NAME (*node
);
7353 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
7354 && DECL_NAME (TYPE_NAME (type
)))
7355 what
= DECL_NAME (TYPE_NAME (type
));
7358 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
7360 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7366 /* Handle a "vector_size" attribute; arguments as in
7367 struct attribute_spec.handler. */
7370 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
7371 int ARG_UNUSED (flags
),
7374 unsigned HOST_WIDE_INT vecsize
, nunits
;
7375 enum machine_mode orig_mode
;
7376 tree type
= *node
, new_type
, size
;
7378 *no_add_attrs
= true;
7380 size
= TREE_VALUE (args
);
7382 if (!host_integerp (size
, 1))
7384 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7388 /* Get the vector size (in bytes). */
7389 vecsize
= tree_low_cst (size
, 1);
7391 /* We need to provide for vector pointers, vector arrays, and
7392 functions returning vectors. For example:
7394 __attribute__((vector_size(16))) short *foo;
7396 In this case, the mode is SI, but the type being modified is
7397 HI, so we need to look further. */
7399 while (POINTER_TYPE_P (type
)
7400 || TREE_CODE (type
) == FUNCTION_TYPE
7401 || TREE_CODE (type
) == METHOD_TYPE
7402 || TREE_CODE (type
) == ARRAY_TYPE
7403 || TREE_CODE (type
) == OFFSET_TYPE
)
7404 type
= TREE_TYPE (type
);
7406 /* Get the mode of the type being modified. */
7407 orig_mode
= TYPE_MODE (type
);
7409 if ((!INTEGRAL_TYPE_P (type
)
7410 && !SCALAR_FLOAT_TYPE_P (type
)
7411 && !FIXED_POINT_TYPE_P (type
))
7412 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
7413 && GET_MODE_CLASS (orig_mode
) != MODE_INT
7414 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
7415 || !host_integerp (TYPE_SIZE_UNIT (type
), 1)
7416 || TREE_CODE (type
) == BOOLEAN_TYPE
)
7418 error ("invalid vector type for attribute %qE", name
);
7422 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
7424 error ("vector size not an integral multiple of component size");
7430 error ("zero vector size");
7434 /* Calculate how many units fit in the vector. */
7435 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
7436 if (nunits
& (nunits
- 1))
7438 error ("number of components of the vector not a power of two");
7442 new_type
= build_vector_type (type
, nunits
);
7444 /* Build back pointers if needed. */
7445 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
7450 /* Handle the "nonnull" attribute. */
7452 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7453 tree args
, int ARG_UNUSED (flags
),
7457 unsigned HOST_WIDE_INT attr_arg_num
;
7459 /* If no arguments are specified, all pointer arguments should be
7460 non-null. Verify a full prototype is given so that the arguments
7461 will have the correct types when we actually check them later. */
7464 if (!prototype_p (type
))
7466 error ("nonnull attribute without arguments on a non-prototype");
7467 *no_add_attrs
= true;
7472 /* Argument list specified. Verify that each argument number references
7473 a pointer argument. */
7474 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
7476 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
7478 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
7480 error ("nonnull argument has invalid operand number (argument %lu)",
7481 (unsigned long) attr_arg_num
);
7482 *no_add_attrs
= true;
7486 if (prototype_p (type
))
7488 function_args_iterator iter
;
7491 function_args_iter_init (&iter
, type
);
7492 for (ck_num
= 1; ; ck_num
++, function_args_iter_next (&iter
))
7494 argument
= function_args_iter_cond (&iter
);
7495 if (argument
== NULL_TREE
|| ck_num
== arg_num
)
7500 || TREE_CODE (argument
) == VOID_TYPE
)
7502 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
7503 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
7504 *no_add_attrs
= true;
7508 if (TREE_CODE (argument
) != POINTER_TYPE
)
7510 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
7511 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
7512 *no_add_attrs
= true;
7521 /* Check the argument list of a function call for null in argument slots
7522 that are marked as requiring a non-null pointer argument. The NARGS
7523 arguments are passed in the array ARGARRAY.
7527 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
7532 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
7534 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
7536 args
= TREE_VALUE (a
);
7538 /* Walk the argument list. If we encounter an argument number we
7539 should check for non-null, do it. If the attribute has no args,
7540 then every pointer argument is checked (in which case the check
7541 for pointer type is done in check_nonnull_arg). */
7542 for (i
= 0; i
< nargs
; i
++)
7544 if (!args
|| nonnull_check_p (args
, i
+ 1))
7545 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
7553 /* Check that the Nth argument of a function call (counting backwards
7554 from the end) is a (pointer)0. The NARGS arguments are passed in the
7558 check_function_sentinel (const_tree fntype
, int nargs
, tree
*argarray
)
7560 tree attr
= lookup_attribute ("sentinel", TYPE_ATTRIBUTES (fntype
));
7567 function_args_iterator iter
;
7570 /* Skip over the named arguments. */
7571 FOREACH_FUNCTION_ARGS (fntype
, t
, iter
)
7578 if (TREE_VALUE (attr
))
7580 tree p
= TREE_VALUE (TREE_VALUE (attr
));
7581 pos
= TREE_INT_CST_LOW (p
);
7584 /* The sentinel must be one of the varargs, i.e.
7585 in position >= the number of fixed arguments. */
7586 if ((nargs
- 1 - pos
) < len
)
7588 warning (OPT_Wformat
,
7589 "not enough variable arguments to fit a sentinel");
7593 /* Validate the sentinel. */
7594 sentinel
= argarray
[nargs
- 1 - pos
];
7595 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
7596 || !integer_zerop (sentinel
))
7597 /* Although __null (in C++) is only an integer we allow it
7598 nevertheless, as we are guaranteed that it's exactly
7599 as wide as a pointer, and we don't want to force
7600 users to cast the NULL they have written there.
7601 We warn with -Wstrict-null-sentinel, though. */
7602 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
7603 warning (OPT_Wformat
, "missing sentinel in function call");
7607 /* Helper for check_function_nonnull; given a list of operands which
7608 must be non-null in ARGS, determine if operand PARAM_NUM should be
7612 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
7614 unsigned HOST_WIDE_INT arg_num
= 0;
7616 for (; args
; args
= TREE_CHAIN (args
))
7618 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
7622 if (arg_num
== param_num
)
7628 /* Check that the function argument PARAM (which is operand number
7629 PARAM_NUM) is non-null. This is called by check_function_nonnull
7630 via check_function_arguments_recurse. */
7633 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
7634 unsigned HOST_WIDE_INT param_num
)
7636 /* Just skip checking the argument if it's not a pointer. This can
7637 happen if the "nonnull" attribute was given without an operand
7638 list (which means to check every pointer argument). */
7640 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
7643 if (integer_zerop (param
))
7644 warning (OPT_Wnonnull
, "null argument where non-null required "
7645 "(argument %lu)", (unsigned long) param_num
);
7648 /* Helper for nonnull attribute handling; fetch the operand number
7649 from the attribute argument list. */
7652 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
7654 /* Verify the arg number is a constant. */
7655 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
7656 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
7659 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
7663 /* Handle a "nothrow" attribute; arguments as in
7664 struct attribute_spec.handler. */
7667 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7668 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7670 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7671 TREE_NOTHROW (*node
) = 1;
7672 /* ??? TODO: Support types. */
7675 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7676 *no_add_attrs
= true;
7682 /* Handle a "cleanup" attribute; arguments as in
7683 struct attribute_spec.handler. */
7686 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
7687 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7690 tree cleanup_id
, cleanup_decl
;
7692 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7693 for global destructors in C++. This requires infrastructure that
7694 we don't have generically at the moment. It's also not a feature
7695 we'd be missing too much, since we do have attribute constructor. */
7696 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
7698 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7699 *no_add_attrs
= true;
7703 /* Verify that the argument is a function in scope. */
7704 /* ??? We could support pointers to functions here as well, if
7705 that was considered desirable. */
7706 cleanup_id
= TREE_VALUE (args
);
7707 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
7709 error ("cleanup argument not an identifier");
7710 *no_add_attrs
= true;
7713 cleanup_decl
= lookup_name (cleanup_id
);
7714 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
7716 error ("cleanup argument not a function");
7717 *no_add_attrs
= true;
7721 /* That the function has proper type is checked with the
7722 eventual call to build_function_call. */
7727 /* Handle a "warn_unused_result" attribute. No special handling. */
7730 handle_warn_unused_result_attribute (tree
*node
, tree name
,
7731 tree
ARG_UNUSED (args
),
7732 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7734 /* Ignore the attribute for functions not returning any value. */
7735 if (VOID_TYPE_P (TREE_TYPE (*node
)))
7737 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7738 *no_add_attrs
= true;
7744 /* Handle a "sentinel" attribute. */
7747 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
7748 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7750 if (!prototype_p (*node
))
7752 warning (OPT_Wattributes
,
7753 "%qE attribute requires prototypes with named arguments", name
);
7754 *no_add_attrs
= true;
7758 if (!stdarg_p (*node
))
7760 warning (OPT_Wattributes
,
7761 "%qE attribute only applies to variadic functions", name
);
7762 *no_add_attrs
= true;
7768 tree position
= TREE_VALUE (args
);
7770 if (TREE_CODE (position
) != INTEGER_CST
)
7772 warning (OPT_Wattributes
,
7773 "requested position is not an integer constant");
7774 *no_add_attrs
= true;
7778 if (tree_int_cst_lt (position
, integer_zero_node
))
7780 warning (OPT_Wattributes
,
7781 "requested position is less than zero");
7782 *no_add_attrs
= true;
7790 /* Handle a "type_generic" attribute. */
7793 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7794 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
7795 bool * ARG_UNUSED (no_add_attrs
))
7797 /* Ensure we have a function type. */
7798 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
7800 /* Ensure we have a variadic function. */
7801 gcc_assert (!prototype_p (*node
) || stdarg_p (*node
));
7806 /* Handle a "target" attribute. */
7809 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
7812 /* Ensure we have a function type. */
7813 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7815 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7816 *no_add_attrs
= true;
7818 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
7820 *no_add_attrs
= true;
7825 /* Arguments being collected for optimization. */
7826 typedef const char *const_char_p
; /* For DEF_VEC_P. */
7827 DEF_VEC_P(const_char_p
);
7828 DEF_VEC_ALLOC_P(const_char_p
, gc
);
7829 static GTY(()) VEC(const_char_p
, gc
) *optimize_args
;
7832 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7833 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7834 false for #pragma GCC optimize. */
7837 parse_optimize_options (tree args
, bool attr_p
)
7842 int saved_flag_strict_aliasing
;
7843 const char **opt_argv
;
7844 struct cl_decoded_option
*decoded_options
;
7845 unsigned int decoded_options_count
;
7848 /* Build up argv vector. Just in case the string is stored away, use garbage
7849 collected strings. */
7850 VEC_truncate (const_char_p
, optimize_args
, 0);
7851 VEC_safe_push (const_char_p
, gc
, optimize_args
, NULL
);
7853 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
7855 tree value
= TREE_VALUE (ap
);
7857 if (TREE_CODE (value
) == INTEGER_CST
)
7860 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
7861 VEC_safe_push (const_char_p
, gc
, optimize_args
, ggc_strdup (buffer
));
7864 else if (TREE_CODE (value
) == STRING_CST
)
7866 /* Split string into multiple substrings. */
7867 size_t len
= TREE_STRING_LENGTH (value
);
7868 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
7869 char *end
= p
+ len
;
7873 while (next_p
!= NULL
)
7879 comma
= strchr (p
, ',');
7892 r
= q
= (char *) ggc_alloc_atomic (len2
+ 3);
7894 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7896 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
7900 warning (OPT_Wattributes
,
7901 "bad option %s to optimize attribute", p
);
7903 warning (OPT_Wpragmas
,
7904 "bad option %s to pragma attribute", p
);
7912 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7913 itself is -Os, and any other switch begins with a -f. */
7914 if ((*p
>= '0' && *p
<= '9')
7915 || (p
[0] == 's' && p
[1] == '\0'))
7921 memcpy (r
, p
, len2
);
7923 VEC_safe_push (const_char_p
, gc
, optimize_args
, q
);
7929 opt_argc
= VEC_length (const_char_p
, optimize_args
);
7930 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
7932 for (i
= 1; i
< opt_argc
; i
++)
7933 opt_argv
[i
] = VEC_index (const_char_p
, optimize_args
, i
);
7935 saved_flag_strict_aliasing
= flag_strict_aliasing
;
7937 /* Now parse the options. */
7938 decode_cmdline_options_to_array_default_mask (opt_argc
, opt_argv
,
7940 &decoded_options_count
);
7941 decode_options (&global_options
, &global_options_set
,
7942 decoded_options
, decoded_options_count
,
7943 input_location
, global_dc
);
7945 targetm
.override_options_after_change();
7947 /* Don't allow changing -fstrict-aliasing. */
7948 flag_strict_aliasing
= saved_flag_strict_aliasing
;
7950 VEC_truncate (const_char_p
, optimize_args
, 0);
7954 /* For handling "optimize" attribute. arguments as in
7955 struct attribute_spec.handler. */
7958 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
7959 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7961 /* Ensure we have a function type. */
7962 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7964 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7965 *no_add_attrs
= true;
7969 struct cl_optimization cur_opts
;
7970 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
7972 /* Save current options. */
7973 cl_optimization_save (&cur_opts
, &global_options
);
7975 /* If we previously had some optimization options, use them as the
7978 cl_optimization_restore (&global_options
,
7979 TREE_OPTIMIZATION (old_opts
));
7981 /* Parse options, and update the vector. */
7982 parse_optimize_options (args
, true);
7983 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
7984 = build_optimization_node ();
7986 /* Restore current options. */
7987 cl_optimization_restore (&global_options
, &cur_opts
);
7993 /* Handle a "no_split_stack" attribute. */
7996 handle_no_split_stack_attribute (tree
*node
, tree name
,
7997 tree
ARG_UNUSED (args
),
7998 int ARG_UNUSED (flags
),
8003 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8005 error_at (DECL_SOURCE_LOCATION (decl
),
8006 "%qE attribute applies only to functions", name
);
8007 *no_add_attrs
= true;
8009 else if (DECL_INITIAL (decl
))
8011 error_at (DECL_SOURCE_LOCATION (decl
),
8012 "can%'t set %qE attribute after definition", name
);
8013 *no_add_attrs
= true;
8019 /* Check for valid arguments being passed to a function with FNTYPE.
8020 There are NARGS arguments in the array ARGARRAY. */
8022 check_function_arguments (const_tree fntype
, int nargs
, tree
*argarray
)
8024 /* Check for null being passed in a pointer argument that must be
8025 non-null. We also need to do this if format checking is enabled. */
8028 check_function_nonnull (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
8030 /* Check for errors in format strings. */
8032 if (warn_format
|| warn_missing_format_attribute
)
8033 check_function_format (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
);
8036 check_function_sentinel (fntype
, nargs
, argarray
);
8039 /* Generic argument checking recursion routine. PARAM is the argument to
8040 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
8041 once the argument is resolved. CTX is context for the callback. */
8043 check_function_arguments_recurse (void (*callback
)
8044 (void *, tree
, unsigned HOST_WIDE_INT
),
8045 void *ctx
, tree param
,
8046 unsigned HOST_WIDE_INT param_num
)
8048 if (CONVERT_EXPR_P (param
)
8049 && (TYPE_PRECISION (TREE_TYPE (param
))
8050 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
8052 /* Strip coercion. */
8053 check_function_arguments_recurse (callback
, ctx
,
8054 TREE_OPERAND (param
, 0), param_num
);
8058 if (TREE_CODE (param
) == CALL_EXPR
)
8060 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
8062 bool found_format_arg
= false;
8064 /* See if this is a call to a known internationalization function
8065 that modifies a format arg. Such a function may have multiple
8066 format_arg attributes (for example, ngettext). */
8068 for (attrs
= TYPE_ATTRIBUTES (type
);
8070 attrs
= TREE_CHAIN (attrs
))
8071 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
8074 tree format_num_expr
;
8077 call_expr_arg_iterator iter
;
8079 /* Extract the argument number, which was previously checked
8081 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
8083 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
8084 && !TREE_INT_CST_HIGH (format_num_expr
));
8086 format_num
= TREE_INT_CST_LOW (format_num_expr
);
8088 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
8090 inner_arg
= next_call_expr_arg (&iter
), i
++)
8091 if (i
== format_num
)
8093 check_function_arguments_recurse (callback
, ctx
,
8094 inner_arg
, param_num
);
8095 found_format_arg
= true;
8100 /* If we found a format_arg attribute and did a recursive check,
8101 we are done with checking this argument. Otherwise, we continue
8102 and this will be considered a non-literal. */
8103 if (found_format_arg
)
8107 if (TREE_CODE (param
) == COND_EXPR
)
8109 /* Check both halves of the conditional expression. */
8110 check_function_arguments_recurse (callback
, ctx
,
8111 TREE_OPERAND (param
, 1), param_num
);
8112 check_function_arguments_recurse (callback
, ctx
,
8113 TREE_OPERAND (param
, 2), param_num
);
8117 (*callback
) (ctx
, param
, param_num
);
8120 /* Checks for a builtin function FNDECL that the number of arguments
8121 NARGS against the required number REQUIRED and issues an error if
8122 there is a mismatch. Returns true if the number of arguments is
8123 correct, otherwise false. */
8126 builtin_function_validate_nargs (tree fndecl
, int nargs
, int required
)
8128 if (nargs
< required
)
8130 error_at (input_location
,
8131 "not enough arguments to function %qE", fndecl
);
8134 else if (nargs
> required
)
8136 error_at (input_location
,
8137 "too many arguments to function %qE", fndecl
);
8143 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8144 Returns false if there was an error, otherwise true. */
8147 check_builtin_function_arguments (tree fndecl
, int nargs
, tree
*args
)
8149 if (!DECL_BUILT_IN (fndecl
)
8150 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
8153 switch (DECL_FUNCTION_CODE (fndecl
))
8155 case BUILT_IN_CONSTANT_P
:
8156 return builtin_function_validate_nargs (fndecl
, nargs
, 1);
8158 case BUILT_IN_ISFINITE
:
8159 case BUILT_IN_ISINF
:
8160 case BUILT_IN_ISINF_SIGN
:
8161 case BUILT_IN_ISNAN
:
8162 case BUILT_IN_ISNORMAL
:
8163 if (builtin_function_validate_nargs (fndecl
, nargs
, 1))
8165 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
8167 error ("non-floating-point argument in call to "
8168 "function %qE", fndecl
);
8175 case BUILT_IN_ISGREATER
:
8176 case BUILT_IN_ISGREATEREQUAL
:
8177 case BUILT_IN_ISLESS
:
8178 case BUILT_IN_ISLESSEQUAL
:
8179 case BUILT_IN_ISLESSGREATER
:
8180 case BUILT_IN_ISUNORDERED
:
8181 if (builtin_function_validate_nargs (fndecl
, nargs
, 2))
8183 enum tree_code code0
, code1
;
8184 code0
= TREE_CODE (TREE_TYPE (args
[0]));
8185 code1
= TREE_CODE (TREE_TYPE (args
[1]));
8186 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
8187 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
8188 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
8190 error ("non-floating-point arguments in call to "
8191 "function %qE", fndecl
);
8198 case BUILT_IN_FPCLASSIFY
:
8199 if (builtin_function_validate_nargs (fndecl
, nargs
, 6))
8204 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
8206 error ("non-const integer argument %u in call to function %qE",
8211 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
8213 error ("non-floating-point argument in call to function %qE",
8221 case BUILT_IN_ASSUME_ALIGNED
:
8222 if (builtin_function_validate_nargs (fndecl
, nargs
, 2 + (nargs
> 2)))
8224 if (nargs
>= 3 && TREE_CODE (TREE_TYPE (args
[2])) != INTEGER_TYPE
)
8226 error ("non-integer argument 3 in call to function %qE", fndecl
);
8238 /* Function to help qsort sort FIELD_DECLs by name order. */
8241 field_decl_cmp (const void *x_p
, const void *y_p
)
8243 const tree
*const x
= (const tree
*const) x_p
;
8244 const tree
*const y
= (const tree
*const) y_p
;
8246 if (DECL_NAME (*x
) == DECL_NAME (*y
))
8247 /* A nontype is "greater" than a type. */
8248 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
8249 if (DECL_NAME (*x
) == NULL_TREE
)
8251 if (DECL_NAME (*y
) == NULL_TREE
)
8253 if (DECL_NAME (*x
) < DECL_NAME (*y
))
8259 gt_pointer_operator new_value
;
8263 /* This routine compares two fields like field_decl_cmp but using the
8264 pointer operator in resort_data. */
8267 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
8269 const tree
*const x
= (const tree
*const) x_p
;
8270 const tree
*const y
= (const tree
*const) y_p
;
8272 if (DECL_NAME (*x
) == DECL_NAME (*y
))
8273 /* A nontype is "greater" than a type. */
8274 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
8275 if (DECL_NAME (*x
) == NULL_TREE
)
8277 if (DECL_NAME (*y
) == NULL_TREE
)
8280 tree d1
= DECL_NAME (*x
);
8281 tree d2
= DECL_NAME (*y
);
8282 resort_data
.new_value (&d1
, resort_data
.cookie
);
8283 resort_data
.new_value (&d2
, resort_data
.cookie
);
8290 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8293 resort_sorted_fields (void *obj
,
8294 void * ARG_UNUSED (orig_obj
),
8295 gt_pointer_operator new_value
,
8298 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
8299 resort_data
.new_value
= new_value
;
8300 resort_data
.cookie
= cookie
;
8301 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
8302 resort_field_decl_cmp
);
8305 /* Subroutine of c_parse_error.
8306 Return the result of concatenating LHS and RHS. RHS is really
8307 a string literal, its first character is indicated by RHS_START and
8308 RHS_SIZE is its length (including the terminating NUL character).
8310 The caller is responsible for deleting the returned pointer. */
8313 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
8315 const int lhs_size
= strlen (lhs
);
8316 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
8317 strncpy (result
, lhs
, lhs_size
);
8318 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
8322 /* Issue the error given by GMSGID, indicating that it occurred before
8323 TOKEN, which had the associated VALUE. */
8326 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
8327 tree value
, unsigned char token_flags
)
8329 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8331 char *message
= NULL
;
8333 if (token_type
== CPP_EOF
)
8334 message
= catenate_messages (gmsgid
, " at end of input");
8335 else if (token_type
== CPP_CHAR
8336 || token_type
== CPP_WCHAR
8337 || token_type
== CPP_CHAR16
8338 || token_type
== CPP_CHAR32
)
8340 unsigned int val
= TREE_INT_CST_LOW (value
);
8359 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
8360 message
= catenate_messages (gmsgid
, " before %s'%c'");
8362 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
8364 error (message
, prefix
, val
);
8368 else if (token_type
== CPP_STRING
8369 || token_type
== CPP_WSTRING
8370 || token_type
== CPP_STRING16
8371 || token_type
== CPP_STRING32
8372 || token_type
== CPP_UTF8STRING
)
8373 message
= catenate_messages (gmsgid
, " before string constant");
8374 else if (token_type
== CPP_NUMBER
)
8375 message
= catenate_messages (gmsgid
, " before numeric constant");
8376 else if (token_type
== CPP_NAME
)
8378 message
= catenate_messages (gmsgid
, " before %qE");
8379 error (message
, value
);
8383 else if (token_type
== CPP_PRAGMA
)
8384 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
8385 else if (token_type
== CPP_PRAGMA_EOL
)
8386 message
= catenate_messages (gmsgid
, " before end of line");
8387 else if (token_type
== CPP_DECLTYPE
)
8388 message
= catenate_messages (gmsgid
, " before %<decltype%>");
8389 else if (token_type
< N_TTYPES
)
8391 message
= catenate_messages (gmsgid
, " before %qs token");
8392 error (message
, cpp_type2name (token_type
, token_flags
));
8404 #undef catenate_messages
8407 /* Mapping for cpp message reasons to the options that enable them. */
8409 struct reason_option_codes_t
8411 const int reason
; /* cpplib message reason. */
8412 const int option_code
; /* gcc option that controls this message. */
8415 static const struct reason_option_codes_t option_codes
[] = {
8416 {CPP_W_DEPRECATED
, OPT_Wdeprecated
},
8417 {CPP_W_COMMENTS
, OPT_Wcomment
},
8418 {CPP_W_TRIGRAPHS
, OPT_Wtrigraphs
},
8419 {CPP_W_MULTICHAR
, OPT_Wmultichar
},
8420 {CPP_W_TRADITIONAL
, OPT_Wtraditional
},
8421 {CPP_W_LONG_LONG
, OPT_Wlong_long
},
8422 {CPP_W_ENDIF_LABELS
, OPT_Wendif_labels
},
8423 {CPP_W_VARIADIC_MACROS
, OPT_Wvariadic_macros
},
8424 {CPP_W_BUILTIN_MACRO_REDEFINED
, OPT_Wbuiltin_macro_redefined
},
8425 {CPP_W_UNDEF
, OPT_Wundef
},
8426 {CPP_W_UNUSED_MACROS
, OPT_Wunused_macros
},
8427 {CPP_W_CXX_OPERATOR_NAMES
, OPT_Wc___compat
},
8428 {CPP_W_NORMALIZE
, OPT_Wnormalized_
},
8429 {CPP_W_INVALID_PCH
, OPT_Winvalid_pch
},
8430 {CPP_W_WARNING_DIRECTIVE
, OPT_Wcpp
},
8434 /* Return the gcc option code associated with the reason for a cpp
8435 message, or 0 if none. */
8438 c_option_controlling_cpp_error (int reason
)
8440 const struct reason_option_codes_t
*entry
;
8442 for (entry
= option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
8444 if (entry
->reason
== reason
)
8445 return entry
->option_code
;
8450 /* Callback from cpp_error for PFILE to print diagnostics from the
8451 preprocessor. The diagnostic is of type LEVEL, with REASON set
8452 to the reason code if LEVEL is represents a warning, at location
8453 LOCATION unless this is after lexing and the compiler's location
8454 should be used instead, with column number possibly overridden by
8455 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8456 the arguments. Returns true if a diagnostic was emitted, false
8460 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
8461 location_t location
, unsigned int column_override
,
8462 const char *msg
, va_list *ap
)
8464 diagnostic_info diagnostic
;
8465 diagnostic_t dlevel
;
8466 bool save_warn_system_headers
= global_dc
->dc_warn_system_headers
;
8471 case CPP_DL_WARNING_SYSHDR
:
8474 global_dc
->dc_warn_system_headers
= 1;
8476 case CPP_DL_WARNING
:
8479 dlevel
= DK_WARNING
;
8481 case CPP_DL_PEDWARN
:
8482 if (flag_no_output
&& !flag_pedantic_errors
)
8484 dlevel
= DK_PEDWARN
;
8502 location
= input_location
;
8503 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
8505 if (column_override
)
8506 diagnostic_override_column (&diagnostic
, column_override
);
8507 diagnostic_override_option_index (&diagnostic
,
8508 c_option_controlling_cpp_error (reason
));
8509 ret
= report_diagnostic (&diagnostic
);
8510 if (level
== CPP_DL_WARNING_SYSHDR
)
8511 global_dc
->dc_warn_system_headers
= save_warn_system_headers
;
8515 /* Convert a character from the host to the target execution character
8516 set. cpplib handles this, mostly. */
8519 c_common_to_target_charset (HOST_WIDE_INT c
)
8521 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8522 zero-extended under -fno-signed-char. cpplib insists that characters
8523 and character constants are always unsigned. Hence we must convert
8525 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
8527 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
8529 if (flag_signed_char
)
8530 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
8531 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
8536 /* Fold an offsetof-like expression. EXPR is a nested sequence of component
8537 references with an INDIRECT_REF of a constant at the bottom; much like the
8538 traditional rendering of offsetof as a macro. Return the folded result. */
8541 fold_offsetof_1 (tree expr
)
8545 switch (TREE_CODE (expr
))
8551 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
8552 return error_mark_node
;
8556 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
8557 return error_mark_node
;
8561 if (!TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
8563 error ("cannot apply %<offsetof%> to a non constant address");
8564 return error_mark_node
;
8566 return TREE_OPERAND (expr
, 0);
8569 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0));
8570 if (base
== error_mark_node
)
8573 t
= TREE_OPERAND (expr
, 1);
8574 if (DECL_C_BIT_FIELD (t
))
8576 error ("attempt to take address of bit-field structure "
8578 return error_mark_node
;
8580 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
8581 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
),
8587 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0));
8588 if (base
== error_mark_node
)
8591 t
= TREE_OPERAND (expr
, 1);
8593 /* Check if the offset goes beyond the upper bound of the array. */
8594 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) >= 0)
8596 tree upbound
= array_ref_up_bound (expr
);
8597 if (upbound
!= NULL_TREE
8598 && TREE_CODE (upbound
) == INTEGER_CST
8599 && !tree_int_cst_equal (upbound
,
8600 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
8602 upbound
= size_binop (PLUS_EXPR
, upbound
,
8603 build_int_cst (TREE_TYPE (upbound
), 1));
8604 if (tree_int_cst_lt (upbound
, t
))
8608 for (v
= TREE_OPERAND (expr
, 0);
8609 TREE_CODE (v
) == COMPONENT_REF
;
8610 v
= TREE_OPERAND (v
, 0))
8611 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
8614 tree fld_chain
= DECL_CHAIN (TREE_OPERAND (v
, 1));
8615 for (; fld_chain
; fld_chain
= DECL_CHAIN (fld_chain
))
8616 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
8622 /* Don't warn if the array might be considered a poor
8623 man's flexible array member with a very permissive
8624 definition thereof. */
8625 if (TREE_CODE (v
) == ARRAY_REF
8626 || TREE_CODE (v
) == COMPONENT_REF
)
8627 warning (OPT_Warray_bounds
,
8628 "index %E denotes an offset "
8629 "greater than size of %qT",
8630 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
8635 t
= convert (sizetype
, t
);
8636 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
8640 /* Handle static members of volatile structs. */
8641 t
= TREE_OPERAND (expr
, 1);
8642 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
8643 return fold_offsetof_1 (t
);
8649 return fold_build_pointer_plus (base
, off
);
8652 /* Likewise, but convert it to the return type of offsetof. */
8655 fold_offsetof (tree expr
)
8657 return convert (size_type_node
, fold_offsetof_1 (expr
));
8660 /* Warn for A ?: C expressions (with B omitted) where A is a boolean
8661 expression, because B will always be true. */
8664 warn_for_omitted_condop (location_t location
, tree cond
)
8666 if (truth_value_p (TREE_CODE (cond
)))
8667 warning_at (location
, OPT_Wparentheses
,
8668 "the omitted middle operand in ?: will always be %<true%>, "
8669 "suggest explicit middle operand");
8672 /* Give an error for storing into ARG, which is 'const'. USE indicates
8673 how ARG was being used. */
8676 readonly_error (tree arg
, enum lvalue_use use
)
8678 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
8680 /* Using this macro rather than (for example) arrays of messages
8681 ensures that all the format strings are checked at compile
8683 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
8684 : (use == lv_increment ? (I) \
8685 : (use == lv_decrement ? (D) : (AS))))
8686 if (TREE_CODE (arg
) == COMPONENT_REF
)
8688 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
8689 error (READONLY_MSG (G_("assignment of member "
8690 "%qD in read-only object"),
8691 G_("increment of member "
8692 "%qD in read-only object"),
8693 G_("decrement of member "
8694 "%qD in read-only object"),
8695 G_("member %qD in read-only object "
8696 "used as %<asm%> output")),
8697 TREE_OPERAND (arg
, 1));
8699 error (READONLY_MSG (G_("assignment of read-only member %qD"),
8700 G_("increment of read-only member %qD"),
8701 G_("decrement of read-only member %qD"),
8702 G_("read-only member %qD used as %<asm%> output")),
8703 TREE_OPERAND (arg
, 1));
8705 else if (TREE_CODE (arg
) == VAR_DECL
)
8706 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
8707 G_("increment of read-only variable %qD"),
8708 G_("decrement of read-only variable %qD"),
8709 G_("read-only variable %qD used as %<asm%> output")),
8711 else if (TREE_CODE (arg
) == PARM_DECL
)
8712 error (READONLY_MSG (G_("assignment of read-only parameter %qD"),
8713 G_("increment of read-only parameter %qD"),
8714 G_("decrement of read-only parameter %qD"),
8715 G_("read-only parameter %qD use as %<asm%> output")),
8717 else if (TREE_CODE (arg
) == RESULT_DECL
)
8719 gcc_assert (c_dialect_cxx ());
8720 error (READONLY_MSG (G_("assignment of "
8721 "read-only named return value %qD"),
8723 "read-only named return value %qD"),
8725 "read-only named return value %qD"),
8726 G_("read-only named return value %qD "
8727 "used as %<asm%>output")),
8730 else if (TREE_CODE (arg
) == FUNCTION_DECL
)
8731 error (READONLY_MSG (G_("assignment of function %qD"),
8732 G_("increment of function %qD"),
8733 G_("decrement of function %qD"),
8734 G_("function %qD used as %<asm%> output")),
8737 error (READONLY_MSG (G_("assignment of read-only location %qE"),
8738 G_("increment of read-only location %qE"),
8739 G_("decrement of read-only location %qE"),
8740 G_("read-only location %qE used as %<asm%> output")),
8744 /* Print an error message for an invalid lvalue. USE says
8745 how the lvalue is being used and so selects the error message. LOC
8746 is the location for the error. */
8749 lvalue_error (location_t loc
, enum lvalue_use use
)
8754 error_at (loc
, "lvalue required as left operand of assignment");
8757 error_at (loc
, "lvalue required as increment operand");
8760 error_at (loc
, "lvalue required as decrement operand");
8763 error_at (loc
, "lvalue required as unary %<&%> operand");
8766 error_at (loc
, "lvalue required in asm statement");
8773 /* Print an error message for an invalid indirection of type TYPE.
8774 ERRSTRING is the name of the operator for the indirection. */
8777 invalid_indirection_error (location_t loc
, tree type
, ref_operator errstring
)
8782 gcc_assert (c_dialect_cxx ());
8783 error_at (loc
, "invalid type argument (have %qT)", type
);
8785 case RO_ARRAY_INDEXING
:
8787 "invalid type argument of array indexing (have %qT)",
8792 "invalid type argument of unary %<*%> (have %qT)",
8797 "invalid type argument of %<->%> (have %qT)",
8800 case RO_IMPLICIT_CONVERSION
:
8802 "invalid type argument of implicit conversion (have %qT)",
8810 /* *PTYPE is an incomplete array. Complete it with a domain based on
8811 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8812 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8813 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8816 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
8818 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
8819 int failure
= 0, quals
;
8820 hashval_t hashcode
= 0;
8822 maxindex
= size_zero_node
;
8825 if (TREE_CODE (initial_value
) == STRING_CST
)
8828 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8829 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
8831 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8833 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
8835 if (VEC_empty (constructor_elt
, v
))
8839 maxindex
= ssize_int (-1);
8844 unsigned HOST_WIDE_INT cnt
;
8845 constructor_elt
*ce
;
8846 bool fold_p
= false;
8848 if (VEC_index (constructor_elt
, v
, 0)->index
)
8849 maxindex
= fold_convert_loc (input_location
, sizetype
,
8850 VEC_index (constructor_elt
,
8852 curindex
= maxindex
;
8855 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
8858 bool curfold_p
= false;
8860 curindex
= ce
->index
, curfold_p
= true;
8864 curindex
= fold_convert (sizetype
, curindex
);
8865 curindex
= size_binop (PLUS_EXPR
, curindex
,
8868 if (tree_int_cst_lt (maxindex
, curindex
))
8869 maxindex
= curindex
, fold_p
= curfold_p
;
8872 maxindex
= fold_convert (sizetype
, maxindex
);
8877 /* Make an error message unless that happened already. */
8878 if (initial_value
!= error_mark_node
)
8890 elt
= TREE_TYPE (type
);
8891 quals
= TYPE_QUALS (strip_array_types (elt
));
8895 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
8897 /* Using build_distinct_type_copy and modifying things afterward instead
8898 of using build_array_type to create a new type preserves all of the
8899 TYPE_LANG_FLAG_? bits that the front end may have set. */
8900 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
8901 TREE_TYPE (main_type
) = unqual_elt
;
8902 TYPE_DOMAIN (main_type
)
8903 = build_range_type (TREE_TYPE (maxindex
),
8904 build_int_cst (TREE_TYPE (maxindex
), 0), maxindex
);
8905 layout_type (main_type
);
8907 /* Make sure we have the canonical MAIN_TYPE. */
8908 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
8909 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
8911 main_type
= type_hash_canon (hashcode
, main_type
);
8913 /* Fix the canonical type. */
8914 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
8915 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
8916 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
8917 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
8918 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
8919 != TYPE_DOMAIN (main_type
)))
8920 TYPE_CANONICAL (main_type
)
8921 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
8922 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
8924 TYPE_CANONICAL (main_type
) = main_type
;
8929 type
= c_build_qualified_type (main_type
, quals
);
8931 if (COMPLETE_TYPE_P (type
)
8932 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
8933 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type
)))
8935 error ("size of array is too large");
8936 /* If we proceed with the array type as it is, we'll eventually
8937 crash in tree_low_cst(). */
8938 type
= error_mark_node
;
8945 /* Like c_mark_addressable but don't check register qualifier. */
8947 c_common_mark_addressable_vec (tree t
)
8949 while (handled_component_p (t
))
8950 t
= TREE_OPERAND (t
, 0);
8951 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8953 TREE_ADDRESSABLE (t
) = 1;
8958 /* Used to help initialize the builtin-types.def table. When a type of
8959 the correct size doesn't exist, use error_mark_node instead of NULL.
8960 The later results in segfaults even when a decl using the type doesn't
8964 builtin_type_for_size (int size
, bool unsignedp
)
8966 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
8967 return type
? type
: error_mark_node
;
8970 /* A helper function for resolve_overloaded_builtin in resolving the
8971 overloaded __sync_ builtins. Returns a positive power of 2 if the
8972 first operand of PARAMS is a pointer to a supported data type.
8973 Returns 0 if an error is encountered. */
8976 sync_resolve_size (tree function
, VEC(tree
,gc
) *params
)
8981 if (VEC_empty (tree
, params
))
8983 error ("too few arguments to function %qE", function
);
8987 type
= TREE_TYPE (VEC_index (tree
, params
, 0));
8988 if (TREE_CODE (type
) != POINTER_TYPE
)
8991 type
= TREE_TYPE (type
);
8992 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
8995 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
8996 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
9000 error ("incompatible type for argument %d of %qE", 1, function
);
9004 /* A helper function for resolve_overloaded_builtin. Adds casts to
9005 PARAMS to make arguments match up with those of FUNCTION. Drops
9006 the variadic arguments at the end. Returns false if some error
9007 was encountered; true on success. */
9010 sync_resolve_params (tree orig_function
, tree function
, VEC(tree
, gc
) *params
)
9012 function_args_iterator iter
;
9014 unsigned int parmnum
;
9016 function_args_iter_init (&iter
, TREE_TYPE (function
));
9017 /* We've declared the implementation functions to use "volatile void *"
9018 as the pointer parameter, so we shouldn't get any complaints from the
9019 call to check_function_arguments what ever type the user used. */
9020 function_args_iter_next (&iter
);
9021 ptype
= TREE_TYPE (TREE_TYPE (VEC_index (tree
, params
, 0)));
9023 /* For the rest of the values, we need to cast these to FTYPE, so that we
9024 don't get warnings for passing pointer types, etc. */
9030 arg_type
= function_args_iter_cond (&iter
);
9031 /* XXX void_type_node belies the abstraction. */
9032 if (arg_type
== void_type_node
)
9036 if (VEC_length (tree
, params
) <= parmnum
)
9038 error ("too few arguments to function %qE", orig_function
);
9042 /* ??? Ideally for the first conversion we'd use convert_for_assignment
9043 so that we get warnings for anything that doesn't match the pointer
9044 type. This isn't portable across the C and C++ front ends atm. */
9045 val
= VEC_index (tree
, params
, parmnum
);
9046 val
= convert (ptype
, val
);
9047 val
= convert (arg_type
, val
);
9048 VEC_replace (tree
, params
, parmnum
, val
);
9050 function_args_iter_next (&iter
);
9053 /* The definition of these primitives is variadic, with the remaining
9054 being "an optional list of variables protected by the memory barrier".
9055 No clue what that's supposed to mean, precisely, but we consider all
9056 call-clobbered variables to be protected so we're safe. */
9057 VEC_truncate (tree
, params
, parmnum
+ 1);
9062 /* A helper function for resolve_overloaded_builtin. Adds a cast to
9063 RESULT to make it match the type of the first pointer argument in
9067 sync_resolve_return (tree first_param
, tree result
)
9069 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
9070 ptype
= TYPE_MAIN_VARIANT (ptype
);
9071 return convert (ptype
, result
);
9074 /* Some builtin functions are placeholders for other expressions. This
9075 function should be called immediately after parsing the call expression
9076 before surrounding code has committed to the type of the expression.
9078 LOC is the location of the builtin call.
9080 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
9081 PARAMS is the argument list for the call. The return value is non-null
9082 when expansion is complete, and null if normal processing should
9086 resolve_overloaded_builtin (location_t loc
, tree function
, VEC(tree
,gc
) *params
)
9088 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
9089 switch (DECL_BUILT_IN_CLASS (function
))
9091 case BUILT_IN_NORMAL
:
9094 if (targetm
.resolve_overloaded_builtin
)
9095 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
9102 /* Handle BUILT_IN_NORMAL here. */
9105 case BUILT_IN_SYNC_FETCH_AND_ADD_N
:
9106 case BUILT_IN_SYNC_FETCH_AND_SUB_N
:
9107 case BUILT_IN_SYNC_FETCH_AND_OR_N
:
9108 case BUILT_IN_SYNC_FETCH_AND_AND_N
:
9109 case BUILT_IN_SYNC_FETCH_AND_XOR_N
:
9110 case BUILT_IN_SYNC_FETCH_AND_NAND_N
:
9111 case BUILT_IN_SYNC_ADD_AND_FETCH_N
:
9112 case BUILT_IN_SYNC_SUB_AND_FETCH_N
:
9113 case BUILT_IN_SYNC_OR_AND_FETCH_N
:
9114 case BUILT_IN_SYNC_AND_AND_FETCH_N
:
9115 case BUILT_IN_SYNC_XOR_AND_FETCH_N
:
9116 case BUILT_IN_SYNC_NAND_AND_FETCH_N
:
9117 case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
:
9118 case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_N
:
9119 case BUILT_IN_SYNC_LOCK_TEST_AND_SET_N
:
9120 case BUILT_IN_SYNC_LOCK_RELEASE_N
:
9122 int n
= sync_resolve_size (function
, params
);
9123 tree new_function
, first_param
, result
;
9124 enum built_in_function fncode
;
9127 return error_mark_node
;
9129 fncode
= (enum built_in_function
)((int)orig_code
+ exact_log2 (n
) + 1);
9130 new_function
= builtin_decl_explicit (fncode
);
9131 if (!sync_resolve_params (function
, new_function
, params
))
9132 return error_mark_node
;
9134 first_param
= VEC_index (tree
, params
, 0);
9135 result
= build_function_call_vec (loc
, new_function
, params
, NULL
);
9136 if (orig_code
!= BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_N
9137 && orig_code
!= BUILT_IN_SYNC_LOCK_RELEASE_N
)
9138 result
= sync_resolve_return (first_param
, result
);
9148 /* Ignoring their sign, return true if two scalar types are the same. */
9150 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
9152 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
9154 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
9155 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
9156 || c2
== FIXED_POINT_TYPE
));
9158 /* Equality works here because c_common_signed_type uses
9159 TYPE_MAIN_VARIANT. */
9160 return c_common_signed_type (t1
)
9161 == c_common_signed_type (t2
);
9164 /* Check for missing format attributes on function pointers. LTYPE is
9165 the new type or left-hand side type. RTYPE is the old type or
9166 right-hand side type. Returns TRUE if LTYPE is missing the desired
9170 check_missing_format_attribute (tree ltype
, tree rtype
)
9172 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
9175 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
9176 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
9181 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
9182 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
9190 /* Subscripting with type char is likely to lose on a machine where
9191 chars are signed. So warn on any machine, but optionally. Don't
9192 warn for unsigned char since that type is safe. Don't warn for
9193 signed char because anyone who uses that must have done so
9194 deliberately. Furthermore, we reduce the false positive load by
9195 warning only for non-constant value of type char. */
9198 warn_array_subscript_with_type_char (tree index
)
9200 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
9201 && TREE_CODE (index
) != INTEGER_CST
)
9202 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
9205 /* Implement -Wparentheses for the unexpected C precedence rules, to
9206 cover cases like x + y << z which readers are likely to
9207 misinterpret. We have seen an expression in which CODE is a binary
9208 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
9209 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
9210 CODE_RIGHT may be ERROR_MARK, which means that that side of the
9211 expression was not formed using a binary or unary operator, or it
9212 was enclosed in parentheses. */
9215 warn_about_parentheses (enum tree_code code
,
9216 enum tree_code code_left
, tree arg_left
,
9217 enum tree_code code_right
, tree arg_right
)
9219 if (!warn_parentheses
)
9222 /* This macro tests that the expression ARG with original tree code
9223 CODE appears to be a boolean expression. or the result of folding a
9224 boolean expression. */
9225 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
9226 (truth_value_p (TREE_CODE (ARG)) \
9227 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
9228 /* Folding may create 0 or 1 integers from other expressions. */ \
9229 || ((CODE) != INTEGER_CST \
9230 && (integer_onep (ARG) || integer_zerop (ARG))))
9235 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
9236 warning (OPT_Wparentheses
,
9237 "suggest parentheses around %<+%> inside %<<<%>");
9238 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
9239 warning (OPT_Wparentheses
,
9240 "suggest parentheses around %<-%> inside %<<<%>");
9244 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
9245 warning (OPT_Wparentheses
,
9246 "suggest parentheses around %<+%> inside %<>>%>");
9247 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
9248 warning (OPT_Wparentheses
,
9249 "suggest parentheses around %<-%> inside %<>>%>");
9252 case TRUTH_ORIF_EXPR
:
9253 if (code_left
== TRUTH_ANDIF_EXPR
|| code_right
== TRUTH_ANDIF_EXPR
)
9254 warning (OPT_Wparentheses
,
9255 "suggest parentheses around %<&&%> within %<||%>");
9259 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
9260 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
9261 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
9262 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
9263 warning (OPT_Wparentheses
,
9264 "suggest parentheses around arithmetic in operand of %<|%>");
9265 /* Check cases like x|y==z */
9266 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9267 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9268 warning (OPT_Wparentheses
,
9269 "suggest parentheses around comparison in operand of %<|%>");
9270 /* Check cases like !x | y */
9271 else if (code_left
== TRUTH_NOT_EXPR
9272 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
9273 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
9274 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
9278 if (code_left
== BIT_AND_EXPR
9279 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
9280 || code_right
== BIT_AND_EXPR
9281 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
9282 warning (OPT_Wparentheses
,
9283 "suggest parentheses around arithmetic in operand of %<^%>");
9284 /* Check cases like x^y==z */
9285 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9286 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9287 warning (OPT_Wparentheses
,
9288 "suggest parentheses around comparison in operand of %<^%>");
9292 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
9293 warning (OPT_Wparentheses
,
9294 "suggest parentheses around %<+%> in operand of %<&%>");
9295 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
9296 warning (OPT_Wparentheses
,
9297 "suggest parentheses around %<-%> in operand of %<&%>");
9298 /* Check cases like x&y==z */
9299 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9300 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9301 warning (OPT_Wparentheses
,
9302 "suggest parentheses around comparison in operand of %<&%>");
9303 /* Check cases like !x & y */
9304 else if (code_left
== TRUTH_NOT_EXPR
9305 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
9306 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
9307 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
9311 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9312 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9313 warning (OPT_Wparentheses
,
9314 "suggest parentheses around comparison in operand of %<==%>");
9317 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9318 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9319 warning (OPT_Wparentheses
,
9320 "suggest parentheses around comparison in operand of %<!=%>");
9324 if (TREE_CODE_CLASS (code
) == tcc_comparison
9325 && ((TREE_CODE_CLASS (code_left
) == tcc_comparison
9326 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
9327 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
9328 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
9329 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
9330 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))))
9331 warning (OPT_Wparentheses
, "comparisons like %<X<=Y<=Z%> do not "
9332 "have their mathematical meaning");
9335 #undef NOT_A_BOOLEAN_EXPR_P
9338 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9341 warn_for_unused_label (tree label
)
9343 if (!TREE_USED (label
))
9345 if (DECL_INITIAL (label
))
9346 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
9348 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
9352 /* Warn for division by zero according to the value of DIVISOR. LOC
9353 is the location of the division operator. */
9356 warn_for_div_by_zero (location_t loc
, tree divisor
)
9358 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9359 about division by zero. Do not issue a warning if DIVISOR has a
9360 floating-point type, since we consider 0.0/0.0 a valid way of
9361 generating a NaN. */
9362 if (c_inhibit_evaluation_warnings
== 0
9363 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
9364 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
9367 /* Subroutine of build_binary_op. Give warnings for comparisons
9368 between signed and unsigned quantities that may fail. Do the
9369 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9370 so that casts will be considered, but default promotions won't
9373 LOCATION is the location of the comparison operator.
9375 The arguments of this function map directly to local variables
9376 of build_binary_op. */
9379 warn_for_sign_compare (location_t location
,
9380 tree orig_op0
, tree orig_op1
,
9382 tree result_type
, enum tree_code resultcode
)
9384 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
9385 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
9386 int unsignedp0
, unsignedp1
;
9388 /* In C++, check for comparison of different enum types. */
9390 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
9391 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
9392 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
9393 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
9395 warning_at (location
,
9396 OPT_Wsign_compare
, "comparison between types %qT and %qT",
9397 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
9400 /* Do not warn if the comparison is being done in a signed type,
9401 since the signed type will only be chosen if it can represent
9402 all the values of the unsigned type. */
9403 if (!TYPE_UNSIGNED (result_type
))
9405 /* Do not warn if both operands are unsigned. */
9406 else if (op0_signed
== op1_signed
)
9410 tree sop
, uop
, base_type
;
9414 sop
= orig_op0
, uop
= orig_op1
;
9416 sop
= orig_op1
, uop
= orig_op0
;
9418 STRIP_TYPE_NOPS (sop
);
9419 STRIP_TYPE_NOPS (uop
);
9420 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
9421 ? TREE_TYPE (result_type
) : result_type
);
9423 /* Do not warn if the signed quantity is an unsuffixed integer
9424 literal (or some static constant expression involving such
9425 literals or a conditional expression involving such literals)
9426 and it is non-negative. */
9427 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
9429 /* Do not warn if the comparison is an equality operation, the
9430 unsigned quantity is an integral constant, and it would fit
9431 in the result if the result were signed. */
9432 else if (TREE_CODE (uop
) == INTEGER_CST
9433 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
9434 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
9436 /* In C, do not warn if the unsigned quantity is an enumeration
9437 constant and its maximum value would fit in the result if the
9438 result were signed. */
9439 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
9440 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
9441 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
9442 c_common_signed_type (base_type
)))
9445 warning_at (location
,
9447 "comparison between signed and unsigned integer expressions");
9450 /* Warn if two unsigned values are being compared in a size larger
9451 than their original size, and one (and only one) is the result of
9452 a `~' operator. This comparison will always fail.
9454 Also warn if one operand is a constant, and the constant does not
9455 have all bits set that are set in the ~ operand when it is
9458 op0
= c_common_get_narrower (op0
, &unsignedp0
);
9459 op1
= c_common_get_narrower (op1
, &unsignedp1
);
9461 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
9462 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
9464 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
9465 op0
= c_common_get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
9466 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
9467 op1
= c_common_get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
9469 if (host_integerp (op0
, 0) || host_integerp (op1
, 0))
9472 HOST_WIDE_INT constant
, mask
;
9476 if (host_integerp (op0
, 0))
9479 unsignedp
= unsignedp1
;
9480 constant
= tree_low_cst (op0
, 0);
9485 unsignedp
= unsignedp0
;
9486 constant
= tree_low_cst (op1
, 0);
9489 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
9490 if (bits
< TYPE_PRECISION (result_type
)
9491 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
9493 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
9494 if ((mask
& constant
) != mask
)
9497 warning (OPT_Wsign_compare
,
9498 "promoted ~unsigned is always non-zero");
9500 warning_at (location
, OPT_Wsign_compare
,
9501 "comparison of promoted ~unsigned with constant");
9505 else if (unsignedp0
&& unsignedp1
9506 && (TYPE_PRECISION (TREE_TYPE (op0
))
9507 < TYPE_PRECISION (result_type
))
9508 && (TYPE_PRECISION (TREE_TYPE (op1
))
9509 < TYPE_PRECISION (result_type
)))
9510 warning_at (location
, OPT_Wsign_compare
,
9511 "comparison of promoted ~unsigned with unsigned");
9515 /* RESULT_TYPE is the result of converting TYPE1 and TYPE2 to a common
9516 type via c_common_type. If -Wdouble-promotion is in use, and the
9517 conditions for warning have been met, issue a warning. GMSGID is
9518 the warning message. It must have two %T specifiers for the type
9519 that was converted (generally "float") and the type to which it was
9520 converted (generally "double), respectively. LOC is the location
9521 to which the awrning should refer. */
9524 do_warn_double_promotion (tree result_type
, tree type1
, tree type2
,
9525 const char *gmsgid
, location_t loc
)
9529 if (!warn_double_promotion
)
9531 /* If the conversion will not occur at run-time, there is no need to
9533 if (c_inhibit_evaluation_warnings
)
9535 if (TYPE_MAIN_VARIANT (result_type
) != double_type_node
9536 && TYPE_MAIN_VARIANT (result_type
) != complex_double_type_node
)
9538 if (TYPE_MAIN_VARIANT (type1
) == float_type_node
9539 || TYPE_MAIN_VARIANT (type1
) == complex_float_type_node
)
9540 source_type
= type1
;
9541 else if (TYPE_MAIN_VARIANT (type2
) == float_type_node
9542 || TYPE_MAIN_VARIANT (type2
) == complex_float_type_node
)
9543 source_type
= type2
;
9546 warning_at (loc
, OPT_Wdouble_promotion
, gmsgid
, source_type
, result_type
);
9549 /* Setup a TYPE_DECL node as a typedef representation.
9551 X is a TYPE_DECL for a typedef statement. Create a brand new
9552 ..._TYPE node (which will be just a variant of the existing
9553 ..._TYPE node with identical properties) and then install X
9554 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
9556 The whole point here is to end up with a situation where each
9557 and every ..._TYPE node the compiler creates will be uniquely
9558 associated with AT MOST one node representing a typedef name.
9559 This way, even though the compiler substitutes corresponding
9560 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
9561 early on, later parts of the compiler can always do the reverse
9562 translation and get back the corresponding typedef name. For
9565 typedef struct S MY_TYPE;
9568 Later parts of the compiler might only know that `object' was of
9569 type `struct S' if it were not for code just below. With this
9570 code however, later parts of the compiler see something like:
9572 struct S' == struct S
9573 typedef struct S' MY_TYPE;
9576 And they can then deduce (from the node for type struct S') that
9577 the original object declaration was:
9581 Being able to do this is important for proper support of protoize,
9582 and also for generating precise symbolic debugging information
9583 which takes full account of the programmer's (typedef) vocabulary.
9585 Obviously, we don't want to generate a duplicate ..._TYPE node if
9586 the TYPE_DECL node that we are now processing really represents a
9587 standard built-in type. */
9590 set_underlying_type (tree x
)
9592 if (x
== error_mark_node
)
9594 if (DECL_IS_BUILTIN (x
))
9596 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
9597 TYPE_NAME (TREE_TYPE (x
)) = x
;
9599 else if (TREE_TYPE (x
) != error_mark_node
9600 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
9602 tree tt
= TREE_TYPE (x
);
9603 DECL_ORIGINAL_TYPE (x
) = tt
;
9604 tt
= build_variant_type_copy (tt
);
9605 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
9607 TREE_USED (tt
) = TREE_USED (x
);
9612 /* Record the types used by the current global variable declaration
9613 being parsed, so that we can decide later to emit their debug info.
9614 Those types are in types_used_by_cur_var_decl, and we are going to
9615 store them in the types_used_by_vars_hash hash table.
9616 DECL is the declaration of the global variable that has been parsed. */
9619 record_types_used_by_current_var_decl (tree decl
)
9621 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
9623 while (!VEC_empty (tree
, types_used_by_cur_var_decl
))
9625 tree type
= VEC_pop (tree
, types_used_by_cur_var_decl
);
9626 types_used_by_var_decl_insert (type
, decl
);
9630 /* If DECL is a typedef that is declared in the current function,
9631 record it for the purpose of -Wunused-local-typedefs. */
9634 record_locally_defined_typedef (tree decl
)
9636 struct c_language_function
*l
;
9638 if (!warn_unused_local_typedefs
9640 /* if this is not a locally defined typedef then we are not
9642 || !is_typedef_decl (decl
)
9643 || !decl_function_context (decl
))
9646 l
= (struct c_language_function
*) cfun
->language
;
9647 VEC_safe_push (tree
, gc
, l
->local_typedefs
, decl
);
9650 /* If T is a TYPE_DECL declared locally, mark it as used. */
9653 maybe_record_typedef_use (tree t
)
9655 if (!is_typedef_decl (t
))
9658 TREE_USED (t
) = true;
9661 /* Warn if there are some unused locally defined typedefs in the
9662 current function. */
9665 maybe_warn_unused_local_typedefs (void)
9669 /* The number of times we have emitted -Wunused-local-typedefs
9670 warnings. If this is different from errorcount, that means some
9671 unrelated errors have been issued. In which case, we'll avoid
9672 emitting "unused-local-typedefs" warnings. */
9673 static int unused_local_typedefs_warn_count
;
9674 struct c_language_function
*l
;
9679 if ((l
= (struct c_language_function
*) cfun
->language
) == NULL
)
9682 if (warn_unused_local_typedefs
9683 && errorcount
== unused_local_typedefs_warn_count
)
9685 FOR_EACH_VEC_ELT (tree
, l
->local_typedefs
, i
, decl
)
9686 if (!TREE_USED (decl
))
9687 warning_at (DECL_SOURCE_LOCATION (decl
),
9688 OPT_Wunused_local_typedefs
,
9689 "typedef %qD locally defined but not used", decl
);
9690 unused_local_typedefs_warn_count
= errorcount
;
9693 if (l
->local_typedefs
)
9695 VEC_free (tree
, gc
, l
->local_typedefs
);
9696 l
->local_typedefs
= NULL
;
9700 /* The C and C++ parsers both use vectors to hold function arguments.
9701 For efficiency, we keep a cache of unused vectors. This is the
9704 typedef VEC(tree
,gc
)* tree_gc_vec
;
9705 DEF_VEC_P(tree_gc_vec
);
9706 DEF_VEC_ALLOC_P(tree_gc_vec
,gc
);
9707 static GTY((deletable
)) VEC(tree_gc_vec
,gc
) *tree_vector_cache
;
9709 /* Return a new vector from the cache. If the cache is empty,
9710 allocate a new vector. These vectors are GC'ed, so it is OK if the
9711 pointer is not released.. */
9714 make_tree_vector (void)
9716 if (!VEC_empty (tree_gc_vec
, tree_vector_cache
))
9717 return VEC_pop (tree_gc_vec
, tree_vector_cache
);
9720 /* Passing 0 to VEC_alloc returns NULL, and our callers require
9721 that we always return a non-NULL value. The vector code uses
9722 4 when growing a NULL vector, so we do too. */
9723 return VEC_alloc (tree
, gc
, 4);
9727 /* Release a vector of trees back to the cache. */
9730 release_tree_vector (VEC(tree
,gc
) *vec
)
9734 VEC_truncate (tree
, vec
, 0);
9735 VEC_safe_push (tree_gc_vec
, gc
, tree_vector_cache
, vec
);
9739 /* Get a new tree vector holding a single tree. */
9742 make_tree_vector_single (tree t
)
9744 VEC(tree
,gc
) *ret
= make_tree_vector ();
9745 VEC_quick_push (tree
, ret
, t
);
9749 /* Get a new tree vector of the TREE_VALUEs of a TREE_LIST chain. */
9752 make_tree_vector_from_list (tree list
)
9754 VEC(tree
,gc
) *ret
= make_tree_vector ();
9755 for (; list
; list
= TREE_CHAIN (list
))
9756 VEC_safe_push (tree
, gc
, ret
, TREE_VALUE (list
));
9760 /* Get a new tree vector which is a copy of an existing one. */
9763 make_tree_vector_copy (const VEC(tree
,gc
) *orig
)
9769 ret
= make_tree_vector ();
9770 VEC_reserve (tree
, gc
, ret
, VEC_length (tree
, orig
));
9771 FOR_EACH_VEC_ELT (tree
, orig
, ix
, t
)
9772 VEC_quick_push (tree
, ret
, t
);
9776 /* Return true if KEYWORD starts a type specifier. */
9779 keyword_begins_type_specifier (enum rid keyword
)
9815 /* Return true if KEYWORD names a type qualifier. */
9818 keyword_is_type_qualifier (enum rid keyword
)
9831 /* Return true if KEYWORD names a storage class specifier.
9833 RID_TYPEDEF is not included in this list despite `typedef' being
9834 listed in C99 6.7.1.1. 6.7.1.3 indicates that `typedef' is listed as
9835 such for syntactic convenience only. */
9838 keyword_is_storage_class_specifier (enum rid keyword
)
9854 /* Return true if KEYWORD names a function-specifier [dcl.fct.spec]. */
9857 keyword_is_function_specifier (enum rid keyword
)
9871 /* Return true if KEYWORD names a decl-specifier [dcl.spec] or a
9872 declaration-specifier (C99 6.7). */
9875 keyword_is_decl_specifier (enum rid keyword
)
9877 if (keyword_is_storage_class_specifier (keyword
)
9878 || keyword_is_type_qualifier (keyword
)
9879 || keyword_is_function_specifier (keyword
))
9893 /* Initialize language-specific-bits of tree_contains_struct. */
9896 c_common_init_ts (void)
9898 MARK_TS_TYPED (C_MAYBE_CONST_EXPR
);
9899 MARK_TS_TYPED (EXCESS_PRECISION_EXPR
);
9902 /* Build a user-defined numeric literal out of an integer constant type VALUE
9903 with identifier SUFFIX. */
9906 build_userdef_literal (tree suffix_id
, tree value
, tree num_string
)
9908 tree literal
= make_node (USERDEF_LITERAL
);
9909 USERDEF_LITERAL_SUFFIX_ID (literal
) = suffix_id
;
9910 USERDEF_LITERAL_VALUE (literal
) = value
;
9911 USERDEF_LITERAL_NUM_STRING (literal
) = num_string
;
9915 #include "gt-c-family-c-common.h"