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
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"
40 #include "langhooks.h"
41 #include "tree-inline.h"
44 #include "diagnostic.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
51 #include "target-def.h"
53 #include "fixed-value.h"
56 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
58 /* The following symbols are subsumed in the c_global_trees array, and
59 listed here individually for documentation purposes.
61 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
63 tree short_integer_type_node;
64 tree long_integer_type_node;
65 tree long_long_integer_type_node;
67 tree short_unsigned_type_node;
68 tree long_unsigned_type_node;
69 tree long_long_unsigned_type_node;
71 tree truthvalue_type_node;
72 tree truthvalue_false_node;
73 tree truthvalue_true_node;
75 tree ptrdiff_type_node;
77 tree unsigned_char_type_node;
78 tree signed_char_type_node;
81 tree char16_type_node;
82 tree char32_type_node;
85 tree double_type_node;
86 tree long_double_type_node;
88 tree complex_integer_type_node;
89 tree complex_float_type_node;
90 tree complex_double_type_node;
91 tree complex_long_double_type_node;
93 tree dfloat32_type_node;
94 tree dfloat64_type_node;
95 tree_dfloat128_type_node;
100 tree intDI_type_node;
101 tree intTI_type_node;
103 tree unsigned_intQI_type_node;
104 tree unsigned_intHI_type_node;
105 tree unsigned_intSI_type_node;
106 tree unsigned_intDI_type_node;
107 tree unsigned_intTI_type_node;
109 tree widest_integer_literal_type_node;
110 tree widest_unsigned_literal_type_node;
112 Nodes for types `void *' and `const void *'.
114 tree ptr_type_node, const_ptr_type_node;
116 Nodes for types `char *' and `const char *'.
118 tree string_type_node, const_string_type_node;
120 Type `char[SOMENUMBER]'.
121 Used when an array of char is needed and the size is irrelevant.
123 tree char_array_type_node;
125 Type `int[SOMENUMBER]' or something like it.
126 Used when an array of int needed and the size is irrelevant.
128 tree int_array_type_node;
130 Type `wchar_t[SOMENUMBER]' or something like it.
131 Used when a wide string literal is created.
133 tree wchar_array_type_node;
135 Type `char16_t[SOMENUMBER]' or something like it.
136 Used when a UTF-16 string literal is created.
138 tree char16_array_type_node;
140 Type `char32_t[SOMENUMBER]' or something like it.
141 Used when a UTF-32 string literal is created.
143 tree char32_array_type_node;
145 Type `int ()' -- used for implicit declaration of functions.
147 tree default_function_type;
149 A VOID_TYPE node, packaged in a TREE_LIST.
153 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
154 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
155 VAR_DECLS, but C++ does.)
157 tree function_name_decl_node;
158 tree pretty_function_name_decl_node;
159 tree c99_function_name_decl_node;
161 Stack of nested function name VAR_DECLs.
163 tree saved_function_name_decls;
167 tree c_global_trees
[CTI_MAX
];
169 /* Switches common to the C front ends. */
171 /* Nonzero if preprocessing only. */
173 int flag_preprocess_only
;
175 /* Nonzero means don't output line number information. */
177 char flag_no_line_commands
;
179 /* Nonzero causes -E output not to be done, but directives such as
180 #define that have side effects are still obeyed. */
184 /* Nonzero means dump macros in some fashion. */
186 char flag_dump_macros
;
188 /* Nonzero means pass #include lines through to the output. */
190 char flag_dump_includes
;
192 /* Nonzero means process PCH files while preprocessing. */
194 bool flag_pch_preprocess
;
196 /* The file name to which we should write a precompiled header, or
197 NULL if no header will be written in this compile. */
199 const char *pch_file
;
201 /* Nonzero if an ISO standard was selected. It rejects macros in the
205 /* Nonzero if -undef was given. It suppresses target built-in macros
209 /* Nonzero means don't recognize the non-ANSI builtin functions. */
213 /* Nonzero means don't recognize the non-ANSI builtin functions.
216 int flag_no_nonansi_builtin
;
218 /* Nonzero means give `double' the same size as `float'. */
220 int flag_short_double
;
222 /* Nonzero means give `wchar_t' the same size as `short'. */
224 int flag_short_wchar
;
226 /* Nonzero means allow implicit conversions between vectors with
227 differing numbers of subparts and/or differing element types. */
228 int flag_lax_vector_conversions
;
230 /* Nonzero means allow Microsoft extensions without warnings or errors. */
231 int flag_ms_extensions
;
233 /* Nonzero means don't recognize the keyword `asm'. */
237 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
239 int flag_signed_bitfields
= 1;
241 /* Warn about #pragma directives that are not recognized. */
243 int warn_unknown_pragmas
; /* Tri state variable. */
245 /* Warn about format/argument anomalies in calls to formatted I/O functions
246 (*printf, *scanf, strftime, strfmon, etc.). */
250 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
251 with GCC this doesn't matter as __null is guaranteed to have the right
254 int warn_strict_null_sentinel
;
256 /* Zero means that faster, ...NonNil variants of objc_msgSend...
257 calls will be used in ObjC; passing nil receivers to such calls
258 will most likely result in crashes. */
259 int flag_nil_receivers
= 1;
261 /* Nonzero means that code generation will be altered to support
262 "zero-link" execution. This currently affects ObjC only, but may
263 affect other languages in the future. */
264 int flag_zero_link
= 0;
266 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
267 unit. It will inform the ObjC runtime that class definition(s) herein
268 contained are to replace one(s) previously loaded. */
269 int flag_replace_objc_classes
= 0;
271 /* C/ObjC language option variables. */
274 /* Nonzero means allow type mismatches in conditional expressions;
275 just make their values `void'. */
277 int flag_cond_mismatch
;
279 /* Nonzero means enable C89 Amendment 1 features. */
283 /* Nonzero means use the ISO C99 dialect of C. */
287 /* Nonzero means that we have builtin functions, and main is an int. */
292 /* ObjC language option variables. */
295 /* Open and close the file for outputting class declarations, if
298 int flag_gen_declaration
;
300 /* Tells the compiler that this is a special run. Do not perform any
301 compiling, instead we are to test some platform dependent features
302 and output a C header file with appropriate definitions. */
304 int print_struct_values
;
306 /* Tells the compiler what is the constant string class for ObjC. */
308 const char *constant_string_class_name
;
311 /* C++ language option variables. */
314 /* Nonzero means don't recognize any extension keywords. */
316 int flag_no_gnu_keywords
;
318 /* Nonzero means do emit exported implementations of functions even if
319 they can be inlined. */
321 int flag_implement_inlines
= 1;
323 /* Nonzero means that implicit instantiations will be emitted if needed. */
325 int flag_implicit_templates
= 1;
327 /* Nonzero means that implicit instantiations of inline templates will be
328 emitted if needed, even if instantiations of non-inline templates
331 int flag_implicit_inline_templates
= 1;
333 /* Nonzero means generate separate instantiation control files and
334 juggle them at link time. */
336 int flag_use_repository
;
338 /* Nonzero if we want to issue diagnostics that the standard says are not
341 int flag_optional_diags
= 1;
343 /* Nonzero means we should attempt to elide constructors when possible. */
345 int flag_elide_constructors
= 1;
347 /* Nonzero means that member functions defined in class scope are
348 inline by default. */
350 int flag_default_inline
= 1;
352 /* Controls whether compiler generates 'type descriptor' that give
353 run-time type information. */
357 /* Nonzero if we want to conserve space in the .o files. We do this
358 by putting uninitialized data and runtime initialized data into
359 .common instead of .data at the expense of not flagging multiple
362 int flag_conserve_space
;
364 /* Nonzero if we want to obey access control semantics. */
366 int flag_access_control
= 1;
368 /* Nonzero if we want to check the return value of new and avoid calling
369 constructors if it is a null pointer. */
373 /* The C++ dialect being used. C++98 is the default. */
375 enum cxx_dialect cxx_dialect
= cxx98
;
377 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
378 initialization variables.
379 0: Old rules, set by -fno-for-scope.
380 2: New ISO rules, set by -ffor-scope.
381 1: Try to implement new ISO rules, but with backup compatibility
382 (and warnings). This is the default, for now. */
384 int flag_new_for_scope
= 1;
386 /* Nonzero if we want to emit defined symbols with common-like linkage as
387 weak symbols where possible, in order to conform to C++ semantics.
388 Otherwise, emit them as local symbols. */
392 /* 0 means we want the preprocessor to not emit line directives for
393 the current working directory. 1 means we want it to do it. -1
394 means we should decide depending on whether debugging information
395 is being emitted or not. */
397 int flag_working_directory
= -1;
399 /* Nonzero to use __cxa_atexit, rather than atexit, to register
400 destructors for local statics and global objects. '2' means it has been
401 set nonzero as a default, not by a command-line flag. */
403 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
405 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
406 code. '2' means it has not been set explicitly on the command line. */
408 int flag_use_cxa_get_exception_ptr
= 2;
410 /* Nonzero means to implement standard semantics for exception
411 specifications, calling unexpected if an exception is thrown that
412 doesn't match the specification. Zero means to treat them as
413 assertions and optimize accordingly, but not check them. */
415 int flag_enforce_eh_specs
= 1;
417 /* Nonzero means to generate thread-safe code for initializing local
420 int flag_threadsafe_statics
= 1;
422 /* Nonzero if we want to pretty-print template specializations as the
423 template signature followed by the arguments. */
425 int flag_pretty_templates
= 1;
427 /* Nonzero means warn about implicit declarations. */
429 int warn_implicit
= 1;
431 /* Maximum template instantiation depth. This limit exists to limit the
432 time it takes to notice infinite template instantiations; the default
433 value of 1024 is likely to be in the next C++ standard. */
435 int max_tinst_depth
= 1024;
439 /* The elements of `ridpointers' are identifier nodes for the reserved
440 type names and storage classes. It is indexed by a RID_... value. */
443 tree (*make_fname_decl
) (location_t
, tree
, int);
445 /* Nonzero means don't warn about problems that occur when the code is
447 int c_inhibit_evaluation_warnings
;
449 /* Whether lexing has been completed, so subsequent preprocessor
450 errors should use the compiler's input_location. */
451 bool done_lexing
= false;
453 /* Information about how a function name is generated. */
456 tree
*const decl
; /* pointer to the VAR_DECL. */
457 const unsigned rid
; /* RID number for the identifier. */
458 const int pretty
; /* How pretty is it? */
461 /* The three ways of getting then name of the current function. */
463 const struct fname_var_t fname_vars
[] =
465 /* C99 compliant __func__, must be first. */
466 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
467 /* GCC __FUNCTION__ compliant. */
468 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
469 /* GCC __PRETTY_FUNCTION__ compliant. */
470 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
474 static tree
c_fully_fold_internal (tree expr
, bool, bool *, bool *);
475 static tree
check_case_value (tree
);
476 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
478 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
479 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
480 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
481 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
482 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
483 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
484 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
485 static tree
handle_noclone_attribute (tree
*, tree
, tree
, int, bool *);
486 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
488 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int, bool *);
489 static tree
handle_artificial_attribute (tree
*, tree
, tree
, int, bool *);
490 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
491 static tree
handle_error_attribute (tree
*, tree
, tree
, int, bool *);
492 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
493 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
494 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
496 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
497 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
499 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
500 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
501 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
502 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
503 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
504 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
505 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
506 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
507 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
509 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
511 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
513 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
514 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
515 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
517 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
518 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
519 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
521 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
523 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
524 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
525 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
526 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
528 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
529 static tree
handle_type_generic_attribute (tree
*, tree
, tree
, int, bool *);
530 static tree
handle_alloc_size_attribute (tree
*, tree
, tree
, int, bool *);
531 static tree
handle_target_attribute (tree
*, tree
, tree
, int, bool *);
532 static tree
handle_optimize_attribute (tree
*, tree
, tree
, int, bool *);
534 static void check_function_nonnull (tree
, int, tree
*);
535 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
536 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
537 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
538 static int resort_field_decl_cmp (const void *, const void *);
540 /* Reserved words. The third field is a mask: keywords are disabled
541 if they match the mask.
544 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
545 C --std=c99: D_CXXONLY | D_OBJC
546 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
547 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
548 C++ --std=c0x: D_CONLY | D_OBJC
549 ObjC++ is like C++ except that D_OBJC is not set
551 If -fno-asm is used, D_ASM is added to the mask. If
552 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
553 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
554 In C with -Wc++-compat, we warn if D_CXXWARN is set. */
556 const struct c_common_resword c_common_reswords
[] =
558 { "_Bool", RID_BOOL
, D_CONLY
},
559 { "_Complex", RID_COMPLEX
, 0 },
560 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
561 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
562 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
563 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
564 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
565 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
566 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
567 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
568 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
569 { "__alignof", RID_ALIGNOF
, 0 },
570 { "__alignof__", RID_ALIGNOF
, 0 },
571 { "__asm", RID_ASM
, 0 },
572 { "__asm__", RID_ASM
, 0 },
573 { "__attribute", RID_ATTRIBUTE
, 0 },
574 { "__attribute__", RID_ATTRIBUTE
, 0 },
575 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
576 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
577 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
578 { "__builtin_va_arg", RID_VA_ARG
, 0 },
579 { "__complex", RID_COMPLEX
, 0 },
580 { "__complex__", RID_COMPLEX
, 0 },
581 { "__const", RID_CONST
, 0 },
582 { "__const__", RID_CONST
, 0 },
583 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
584 { "__extension__", RID_EXTENSION
, 0 },
585 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
586 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
587 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
588 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
589 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
590 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
591 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
592 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
593 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
594 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
595 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
596 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
597 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO
, D_CXXONLY
},
598 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
599 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
600 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
601 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
602 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
603 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
604 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
605 { "__imag", RID_IMAGPART
, 0 },
606 { "__imag__", RID_IMAGPART
, 0 },
607 { "__inline", RID_INLINE
, 0 },
608 { "__inline__", RID_INLINE
, 0 },
609 { "__label__", RID_LABEL
, 0 },
610 { "__null", RID_NULL
, 0 },
611 { "__real", RID_REALPART
, 0 },
612 { "__real__", RID_REALPART
, 0 },
613 { "__restrict", RID_RESTRICT
, 0 },
614 { "__restrict__", RID_RESTRICT
, 0 },
615 { "__signed", RID_SIGNED
, 0 },
616 { "__signed__", RID_SIGNED
, 0 },
617 { "__thread", RID_THREAD
, 0 },
618 { "__typeof", RID_TYPEOF
, 0 },
619 { "__typeof__", RID_TYPEOF
, 0 },
620 { "__volatile", RID_VOLATILE
, 0 },
621 { "__volatile__", RID_VOLATILE
, 0 },
622 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
623 { "asm", RID_ASM
, D_ASM
},
624 { "auto", RID_AUTO
, 0 },
625 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
626 { "break", RID_BREAK
, 0 },
627 { "case", RID_CASE
, 0 },
628 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
629 { "char", RID_CHAR
, 0 },
630 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
631 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
632 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
633 { "const", RID_CONST
, 0 },
634 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
635 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
636 { "continue", RID_CONTINUE
, 0 },
637 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
638 { "default", RID_DEFAULT
, 0 },
639 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
641 { "double", RID_DOUBLE
, 0 },
642 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
643 { "else", RID_ELSE
, 0 },
644 { "enum", RID_ENUM
, 0 },
645 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
646 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
647 { "extern", RID_EXTERN
, 0 },
648 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
649 { "float", RID_FLOAT
, 0 },
650 { "for", RID_FOR
, 0 },
651 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
652 { "goto", RID_GOTO
, 0 },
654 { "inline", RID_INLINE
, D_EXT89
},
655 { "int", RID_INT
, 0 },
656 { "long", RID_LONG
, 0 },
657 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
658 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
659 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
660 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
661 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
662 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
663 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
664 { "register", RID_REGISTER
, 0 },
665 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
666 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
667 { "return", RID_RETURN
, 0 },
668 { "short", RID_SHORT
, 0 },
669 { "signed", RID_SIGNED
, 0 },
670 { "sizeof", RID_SIZEOF
, 0 },
671 { "static", RID_STATIC
, 0 },
672 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
673 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
674 { "struct", RID_STRUCT
, 0 },
675 { "switch", RID_SWITCH
, 0 },
676 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
677 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
678 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
679 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
680 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
681 { "typedef", RID_TYPEDEF
, 0 },
682 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
683 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
684 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
685 { "union", RID_UNION
, 0 },
686 { "unsigned", RID_UNSIGNED
, 0 },
687 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
688 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
689 { "void", RID_VOID
, 0 },
690 { "volatile", RID_VOLATILE
, 0 },
691 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
692 { "while", RID_WHILE
, 0 },
693 /* These Objective-C keywords are recognized only immediately after
695 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
696 { "defs", RID_AT_DEFS
, D_OBJC
},
697 { "encode", RID_AT_ENCODE
, D_OBJC
},
698 { "end", RID_AT_END
, D_OBJC
},
699 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
700 { "interface", RID_AT_INTERFACE
, D_OBJC
},
701 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
702 { "selector", RID_AT_SELECTOR
, D_OBJC
},
703 { "finally", RID_AT_FINALLY
, D_OBJC
},
704 { "synchronized", RID_AT_SYNCHRONIZED
, D_OBJC
},
705 /* These are recognized only in protocol-qualifier context
707 { "bycopy", RID_BYCOPY
, D_OBJC
},
708 { "byref", RID_BYREF
, D_OBJC
},
709 { "in", RID_IN
, D_OBJC
},
710 { "inout", RID_INOUT
, D_OBJC
},
711 { "oneway", RID_ONEWAY
, D_OBJC
},
712 { "out", RID_OUT
, D_OBJC
},
714 #ifdef TARGET_ADDR_SPACE_KEYWORDS
715 /* Any address space keywords recognized by the target. */
716 TARGET_ADDR_SPACE_KEYWORDS
,
720 const unsigned int num_c_common_reswords
=
721 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
723 /* Table of machine-independent attributes common to all C-like languages. */
724 const struct attribute_spec c_common_attribute_table
[] =
726 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
727 { "packed", 0, 0, false, false, false,
728 handle_packed_attribute
},
729 { "nocommon", 0, 0, true, false, false,
730 handle_nocommon_attribute
},
731 { "common", 0, 0, true, false, false,
732 handle_common_attribute
},
733 /* FIXME: logically, noreturn attributes should be listed as
734 "false, true, true" and apply to function types. But implementing this
735 would require all the places in the compiler that use TREE_THIS_VOLATILE
736 on a decl to identify non-returning functions to be located and fixed
737 to check the function type instead. */
738 { "noreturn", 0, 0, true, false, false,
739 handle_noreturn_attribute
},
740 { "volatile", 0, 0, true, false, false,
741 handle_noreturn_attribute
},
742 { "noinline", 0, 0, true, false, false,
743 handle_noinline_attribute
},
744 { "noclone", 0, 0, true, false, false,
745 handle_noclone_attribute
},
746 { "always_inline", 0, 0, true, false, false,
747 handle_always_inline_attribute
},
748 { "gnu_inline", 0, 0, true, false, false,
749 handle_gnu_inline_attribute
},
750 { "artificial", 0, 0, true, false, false,
751 handle_artificial_attribute
},
752 { "flatten", 0, 0, true, false, false,
753 handle_flatten_attribute
},
754 { "used", 0, 0, true, false, false,
755 handle_used_attribute
},
756 { "unused", 0, 0, false, false, false,
757 handle_unused_attribute
},
758 { "externally_visible", 0, 0, true, false, false,
759 handle_externally_visible_attribute
},
760 /* The same comments as for noreturn attributes apply to const ones. */
761 { "const", 0, 0, true, false, false,
762 handle_const_attribute
},
763 { "transparent_union", 0, 0, false, false, false,
764 handle_transparent_union_attribute
},
765 { "constructor", 0, 1, true, false, false,
766 handle_constructor_attribute
},
767 { "destructor", 0, 1, true, false, false,
768 handle_destructor_attribute
},
769 { "mode", 1, 1, false, true, false,
770 handle_mode_attribute
},
771 { "section", 1, 1, true, false, false,
772 handle_section_attribute
},
773 { "aligned", 0, 1, false, false, false,
774 handle_aligned_attribute
},
775 { "weak", 0, 0, true, false, false,
776 handle_weak_attribute
},
777 { "alias", 1, 1, true, false, false,
778 handle_alias_attribute
},
779 { "weakref", 0, 1, true, false, false,
780 handle_weakref_attribute
},
781 { "no_instrument_function", 0, 0, true, false, false,
782 handle_no_instrument_function_attribute
},
783 { "malloc", 0, 0, true, false, false,
784 handle_malloc_attribute
},
785 { "returns_twice", 0, 0, true, false, false,
786 handle_returns_twice_attribute
},
787 { "no_stack_limit", 0, 0, true, false, false,
788 handle_no_limit_stack_attribute
},
789 { "pure", 0, 0, true, false, false,
790 handle_pure_attribute
},
791 /* For internal use (marking of builtins) only. The name contains space
792 to prevent its usage in source code. */
793 { "no vops", 0, 0, true, false, false,
794 handle_novops_attribute
},
795 { "deprecated", 0, 1, false, false, false,
796 handle_deprecated_attribute
},
797 { "vector_size", 1, 1, false, true, false,
798 handle_vector_size_attribute
},
799 { "visibility", 1, 1, false, false, false,
800 handle_visibility_attribute
},
801 { "tls_model", 1, 1, true, false, false,
802 handle_tls_model_attribute
},
803 { "nonnull", 0, -1, false, true, true,
804 handle_nonnull_attribute
},
805 { "nothrow", 0, 0, true, false, false,
806 handle_nothrow_attribute
},
807 { "may_alias", 0, 0, false, true, false, NULL
},
808 { "cleanup", 1, 1, true, false, false,
809 handle_cleanup_attribute
},
810 { "warn_unused_result", 0, 0, false, true, true,
811 handle_warn_unused_result_attribute
},
812 { "sentinel", 0, 1, false, true, true,
813 handle_sentinel_attribute
},
814 /* For internal use (marking of builtins) only. The name contains space
815 to prevent its usage in source code. */
816 { "type generic", 0, 0, false, true, true,
817 handle_type_generic_attribute
},
818 { "alloc_size", 1, 2, false, true, true,
819 handle_alloc_size_attribute
},
820 { "cold", 0, 0, true, false, false,
821 handle_cold_attribute
},
822 { "hot", 0, 0, true, false, false,
823 handle_hot_attribute
},
824 { "warning", 1, 1, true, false, false,
825 handle_error_attribute
},
826 { "error", 1, 1, true, false, false,
827 handle_error_attribute
},
828 { "target", 1, -1, true, false, false,
829 handle_target_attribute
},
830 { "optimize", 1, -1, true, false, false,
831 handle_optimize_attribute
},
832 { NULL
, 0, 0, false, false, false, NULL
}
835 /* Give the specifications for the format attributes, used by C and all
838 const struct attribute_spec c_common_format_attribute_table
[] =
840 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
841 { "format", 3, 3, false, true, true,
842 handle_format_attribute
},
843 { "format_arg", 1, 1, false, true, true,
844 handle_format_arg_attribute
},
845 { NULL
, 0, 0, false, false, false, NULL
}
848 /* Return identifier for address space AS. */
850 c_addr_space_name (addr_space_t as
)
854 for (i
= 0; i
< num_c_common_reswords
; i
++)
855 if (c_common_reswords
[i
].rid
== RID_FIRST_ADDR_SPACE
+ as
)
856 return c_common_reswords
[i
].word
;
861 /* Push current bindings for the function name VAR_DECLS. */
864 start_fname_decls (void)
867 tree saved
= NULL_TREE
;
869 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
871 tree decl
= *fname_vars
[ix
].decl
;
875 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
876 *fname_vars
[ix
].decl
= NULL_TREE
;
879 if (saved
|| saved_function_name_decls
)
880 /* Normally they'll have been NULL, so only push if we've got a
881 stack, or they are non-NULL. */
882 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
883 saved_function_name_decls
);
886 /* Finish up the current bindings, adding them into the current function's
887 statement tree. This must be done _before_ finish_stmt_tree is called.
888 If there is no current function, we must be at file scope and no statements
889 are involved. Pop the previous bindings. */
892 finish_fname_decls (void)
895 tree stmts
= NULL_TREE
;
896 tree stack
= saved_function_name_decls
;
898 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
899 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
903 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
905 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
906 bodyp
= &BIND_EXPR_BODY (*bodyp
);
908 append_to_statement_list_force (*bodyp
, &stmts
);
912 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
913 *fname_vars
[ix
].decl
= NULL_TREE
;
917 /* We had saved values, restore them. */
920 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
922 tree decl
= TREE_PURPOSE (saved
);
923 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
925 *fname_vars
[ix
].decl
= decl
;
927 stack
= TREE_CHAIN (stack
);
929 saved_function_name_decls
= stack
;
932 /* Return the text name of the current function, suitably prettified
933 by PRETTY_P. Return string must be freed by caller. */
936 fname_as_string (int pretty_p
)
938 const char *name
= "top level";
941 cpp_string cstr
= { 0, 0 }, strname
;
949 if (current_function_decl
)
950 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
952 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
954 namep
= XNEWVEC (char, len
);
955 snprintf (namep
, len
, "\"%s\"", name
);
956 strname
.text
= (unsigned char *) namep
;
957 strname
.len
= len
- 1;
959 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
962 return (const char *) cstr
.text
;
968 /* Return the VAR_DECL for a const char array naming the current
969 function. If the VAR_DECL has not yet been created, create it
970 now. RID indicates how it should be formatted and IDENTIFIER_NODE
971 ID is its name (unfortunately C and C++ hold the RID values of
972 keywords in different places, so we can't derive RID from ID in
973 this language independent code. LOC is the location of the
977 fname_decl (location_t loc
, unsigned int rid
, tree id
)
980 tree decl
= NULL_TREE
;
982 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
983 if (fname_vars
[ix
].rid
== rid
)
986 decl
= *fname_vars
[ix
].decl
;
989 /* If a tree is built here, it would normally have the lineno of
990 the current statement. Later this tree will be moved to the
991 beginning of the function and this line number will be wrong.
992 To avoid this problem set the lineno to 0 here; that prevents
993 it from appearing in the RTL. */
995 location_t saved_location
= input_location
;
996 input_location
= UNKNOWN_LOCATION
;
998 stmts
= push_stmt_list ();
999 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
1000 stmts
= pop_stmt_list (stmts
);
1001 if (!IS_EMPTY_STMT (stmts
))
1002 saved_function_name_decls
1003 = tree_cons (decl
, stmts
, saved_function_name_decls
);
1004 *fname_vars
[ix
].decl
= decl
;
1005 input_location
= saved_location
;
1007 if (!ix
&& !current_function_decl
)
1008 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
1013 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1016 fix_string_type (tree value
)
1018 int length
= TREE_STRING_LENGTH (value
);
1020 tree e_type
, i_type
, a_type
;
1022 /* Compute the number of elements, for the array type. */
1023 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
1026 e_type
= char_type_node
;
1028 else if (TREE_TYPE (value
) == char16_array_type_node
)
1030 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
1031 e_type
= char16_type_node
;
1033 else if (TREE_TYPE (value
) == char32_array_type_node
)
1035 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
1036 e_type
= char32_type_node
;
1040 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
1041 e_type
= wchar_type_node
;
1044 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1045 limit in C++98 Annex B is very large (65536) and is not normative,
1046 so we do not diagnose it (warn_overlength_strings is forced off
1047 in c_common_post_options). */
1048 if (warn_overlength_strings
)
1050 const int nchars_max
= flag_isoc99
? 4095 : 509;
1051 const int relevant_std
= flag_isoc99
? 99 : 90;
1052 if (nchars
- 1 > nchars_max
)
1053 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1054 separate the %d from the 'C'. 'ISO' should not be
1055 translated, but it may be moved after 'C%d' in languages
1056 where modifiers follow nouns. */
1057 pedwarn (input_location
, OPT_Woverlength_strings
,
1058 "string length %qd is greater than the length %qd "
1059 "ISO C%d compilers are required to support",
1060 nchars
- 1, nchars_max
, relevant_std
);
1063 /* Create the array type for the string constant. The ISO C++
1064 standard says that a string literal has type `const char[N]' or
1065 `const wchar_t[N]'. We use the same logic when invoked as a C
1066 front-end with -Wwrite-strings.
1067 ??? We should change the type of an expression depending on the
1068 state of a warning flag. We should just be warning -- see how
1069 this is handled in the C++ front-end for the deprecated implicit
1070 conversion from string literals to `char*' or `wchar_t*'.
1072 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1073 array type being the unqualified version of that type.
1074 Therefore, if we are constructing an array of const char, we must
1075 construct the matching unqualified array type first. The C front
1076 end does not require this, but it does no harm, so we do it
1078 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
1079 a_type
= build_array_type (e_type
, i_type
);
1080 if (c_dialect_cxx() || warn_write_strings
)
1081 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
1083 TREE_TYPE (value
) = a_type
;
1084 TREE_CONSTANT (value
) = 1;
1085 TREE_READONLY (value
) = 1;
1086 TREE_STATIC (value
) = 1;
1090 /* Fully fold EXPR, an expression that was not folded (beyond integer
1091 constant expressions and null pointer constants) when being built
1092 up. If IN_INIT, this is in a static initializer and certain
1093 changes are made to the folding done. Clear *MAYBE_CONST if
1094 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1095 expression because it contains an evaluated operator (in C99) or an
1096 operator outside of sizeof returning an integer constant (in C90)
1097 not permitted in constant expressions, or because it contains an
1098 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1099 set to true by callers before calling this function.) Return the
1100 folded expression. Function arguments have already been folded
1101 before calling this function, as have the contents of SAVE_EXPR,
1102 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1103 C_MAYBE_CONST_EXPR. */
1106 c_fully_fold (tree expr
, bool in_init
, bool *maybe_const
)
1109 tree eptype
= NULL_TREE
;
1111 bool maybe_const_itself
= true;
1112 location_t loc
= EXPR_LOCATION (expr
);
1114 /* This function is not relevant to C++ because C++ folds while
1115 parsing, and may need changes to be correct for C++ when C++
1116 stops folding while parsing. */
1117 if (c_dialect_cxx ())
1121 maybe_const
= &dummy
;
1122 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
1124 eptype
= TREE_TYPE (expr
);
1125 expr
= TREE_OPERAND (expr
, 0);
1127 ret
= c_fully_fold_internal (expr
, in_init
, maybe_const
,
1128 &maybe_const_itself
);
1130 ret
= fold_convert_loc (loc
, eptype
, ret
);
1131 *maybe_const
&= maybe_const_itself
;
1135 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1136 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1137 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1138 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1139 both evaluated and unevaluated subexpressions while
1140 *MAYBE_CONST_ITSELF is carried from only evaluated
1144 c_fully_fold_internal (tree expr
, bool in_init
, bool *maybe_const_operands
,
1145 bool *maybe_const_itself
)
1148 enum tree_code code
= TREE_CODE (expr
);
1149 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
1150 location_t loc
= EXPR_LOCATION (expr
);
1151 tree op0
, op1
, op2
, op3
;
1152 tree orig_op0
, orig_op1
, orig_op2
;
1153 bool op0_const
= true, op1_const
= true, op2_const
= true;
1154 bool op0_const_self
= true, op1_const_self
= true, op2_const_self
= true;
1155 bool nowarning
= TREE_NO_WARNING (expr
);
1158 /* This function is not relevant to C++ because C++ folds while
1159 parsing, and may need changes to be correct for C++ when C++
1160 stops folding while parsing. */
1161 if (c_dialect_cxx ())
1164 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1165 anything else not counted as an expression cannot usefully be
1166 folded further at this point. */
1167 if (!IS_EXPR_CODE_CLASS (kind
)
1168 || kind
== tcc_statement
1169 || code
== SAVE_EXPR
)
1172 /* Operands of variable-length expressions (function calls) have
1173 already been folded, as have __builtin_* function calls, and such
1174 expressions cannot occur in constant expressions. */
1175 if (kind
== tcc_vl_exp
)
1177 *maybe_const_operands
= false;
1182 if (code
== C_MAYBE_CONST_EXPR
)
1184 tree pre
= C_MAYBE_CONST_EXPR_PRE (expr
);
1185 tree inner
= C_MAYBE_CONST_EXPR_EXPR (expr
);
1186 if (C_MAYBE_CONST_EXPR_NON_CONST (expr
))
1187 *maybe_const_operands
= false;
1188 if (C_MAYBE_CONST_EXPR_INT_OPERANDS (expr
))
1189 *maybe_const_itself
= false;
1190 if (pre
&& !in_init
)
1191 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), pre
, inner
);
1197 /* Assignment, increment, decrement, function call and comma
1198 operators, and statement expressions, cannot occur in constant
1199 expressions if evaluated / outside of sizeof. (Function calls
1200 were handled above, though VA_ARG_EXPR is treated like a function
1201 call here, and statement expressions are handled through
1202 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1206 case PREDECREMENT_EXPR
:
1207 case PREINCREMENT_EXPR
:
1208 case POSTDECREMENT_EXPR
:
1209 case POSTINCREMENT_EXPR
:
1211 *maybe_const_operands
= false;
1218 *maybe_const_operands
= false;
1226 /* Fold individual tree codes as appropriate. */
1229 case COMPOUND_LITERAL_EXPR
:
1230 /* Any non-constancy will have been marked in a containing
1231 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1235 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1236 op1
= TREE_OPERAND (expr
, 1);
1237 op2
= TREE_OPERAND (expr
, 2);
1238 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1239 maybe_const_itself
);
1240 STRIP_TYPE_NOPS (op0
);
1241 if (op0
!= orig_op0
)
1242 ret
= build3 (COMPONENT_REF
, TREE_TYPE (expr
), op0
, op1
, op2
);
1245 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1246 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1251 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1252 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1253 op2
= TREE_OPERAND (expr
, 2);
1254 op3
= TREE_OPERAND (expr
, 3);
1255 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1256 maybe_const_itself
);
1257 STRIP_TYPE_NOPS (op0
);
1258 op1
= c_fully_fold_internal (op1
, in_init
, maybe_const_operands
,
1259 maybe_const_itself
);
1260 STRIP_TYPE_NOPS (op1
);
1261 op1
= decl_constant_value_for_optimization (op1
);
1262 if (op0
!= orig_op0
|| op1
!= orig_op1
)
1263 ret
= build4 (ARRAY_REF
, TREE_TYPE (expr
), op0
, op1
, op2
, op3
);
1266 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1267 TREE_SIDE_EFFECTS (ret
) = TREE_SIDE_EFFECTS (expr
);
1268 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1275 case PREDECREMENT_EXPR
:
1276 case PREINCREMENT_EXPR
:
1277 case POSTDECREMENT_EXPR
:
1278 case POSTINCREMENT_EXPR
:
1282 case POINTER_PLUS_EXPR
:
1283 case TRUNC_DIV_EXPR
:
1285 case FLOOR_DIV_EXPR
:
1286 case TRUNC_MOD_EXPR
:
1288 case EXACT_DIV_EXPR
:
1301 case TRUTH_AND_EXPR
:
1303 case TRUTH_XOR_EXPR
:
1304 case UNORDERED_EXPR
:
1311 /* Binary operations evaluating both arguments (increment and
1312 decrement are binary internally in GCC). */
1313 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1314 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1315 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1316 maybe_const_itself
);
1317 STRIP_TYPE_NOPS (op0
);
1318 if (code
!= MODIFY_EXPR
1319 && code
!= PREDECREMENT_EXPR
1320 && code
!= PREINCREMENT_EXPR
1321 && code
!= POSTDECREMENT_EXPR
1322 && code
!= POSTINCREMENT_EXPR
)
1323 op0
= decl_constant_value_for_optimization (op0
);
1324 /* The RHS of a MODIFY_EXPR was fully folded when building that
1325 expression for the sake of conversion warnings. */
1326 if (code
!= MODIFY_EXPR
)
1327 op1
= c_fully_fold_internal (op1
, in_init
, maybe_const_operands
,
1328 maybe_const_itself
);
1329 STRIP_TYPE_NOPS (op1
);
1330 op1
= decl_constant_value_for_optimization (op1
);
1331 if (op0
!= orig_op0
|| op1
!= orig_op1
|| in_init
)
1333 ? fold_build2_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
)
1334 : fold_build2_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
);
1337 if (TREE_OVERFLOW_P (ret
)
1338 && !TREE_OVERFLOW_P (op0
)
1339 && !TREE_OVERFLOW_P (op1
))
1340 overflow_warning (EXPR_LOCATION (expr
), ret
);
1344 case FIX_TRUNC_EXPR
:
1347 case NON_LVALUE_EXPR
:
1350 case TRUTH_NOT_EXPR
:
1355 /* Unary operations. */
1356 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1357 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1358 maybe_const_itself
);
1359 STRIP_TYPE_NOPS (op0
);
1360 if (code
!= ADDR_EXPR
&& code
!= REALPART_EXPR
&& code
!= IMAGPART_EXPR
)
1361 op0
= decl_constant_value_for_optimization (op0
);
1362 if (op0
!= orig_op0
|| in_init
)
1364 ? fold_build1_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
)
1365 : fold_build1_loc (loc
, code
, TREE_TYPE (expr
), op0
);
1368 if (code
== INDIRECT_REF
1370 && TREE_CODE (ret
) == INDIRECT_REF
)
1372 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1373 TREE_SIDE_EFFECTS (ret
) = TREE_SIDE_EFFECTS (expr
);
1374 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1378 case FIX_TRUNC_EXPR
:
1381 /* Don't warn about explicit conversions. We will already
1382 have warned about suspect implicit conversions. */
1386 if (TREE_OVERFLOW_P (ret
) && !TREE_OVERFLOW_P (op0
))
1387 overflow_warning (EXPR_LOCATION (expr
), ret
);
1392 case TRUTH_ANDIF_EXPR
:
1393 case TRUTH_ORIF_EXPR
:
1394 /* Binary operations not necessarily evaluating both
1396 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1397 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1398 op0
= c_fully_fold_internal (op0
, in_init
, &op0_const
, &op0_const_self
);
1399 STRIP_TYPE_NOPS (op0
);
1401 unused_p
= (op0
== (code
== TRUTH_ANDIF_EXPR
1402 ? truthvalue_false_node
1403 : truthvalue_true_node
));
1404 c_inhibit_evaluation_warnings
+= unused_p
;
1405 op1
= c_fully_fold_internal (op1
, in_init
, &op1_const
, &op1_const_self
);
1406 STRIP_TYPE_NOPS (op1
);
1407 c_inhibit_evaluation_warnings
-= unused_p
;
1409 if (op0
!= orig_op0
|| op1
!= orig_op1
|| in_init
)
1411 ? fold_build2_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
)
1412 : fold_build2_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
);
1415 *maybe_const_operands
&= op0_const
;
1416 *maybe_const_itself
&= op0_const_self
;
1420 && (code
== TRUTH_ANDIF_EXPR
1421 ? op0
== truthvalue_false_node
1422 : op0
== truthvalue_true_node
)))
1423 *maybe_const_operands
&= op1_const
;
1426 && (code
== TRUTH_ANDIF_EXPR
1427 ? op0
== truthvalue_false_node
1428 : op0
== truthvalue_true_node
)))
1429 *maybe_const_itself
&= op1_const_self
;
1433 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1434 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1435 orig_op2
= op2
= TREE_OPERAND (expr
, 2);
1436 op0
= c_fully_fold_internal (op0
, in_init
, &op0_const
, &op0_const_self
);
1438 STRIP_TYPE_NOPS (op0
);
1439 c_inhibit_evaluation_warnings
+= (op0
== truthvalue_false_node
);
1440 op1
= c_fully_fold_internal (op1
, in_init
, &op1_const
, &op1_const_self
);
1441 STRIP_TYPE_NOPS (op1
);
1442 c_inhibit_evaluation_warnings
-= (op0
== truthvalue_false_node
);
1444 c_inhibit_evaluation_warnings
+= (op0
== truthvalue_true_node
);
1445 op2
= c_fully_fold_internal (op2
, in_init
, &op2_const
, &op2_const_self
);
1446 STRIP_TYPE_NOPS (op2
);
1447 c_inhibit_evaluation_warnings
-= (op0
== truthvalue_true_node
);
1449 if (op0
!= orig_op0
|| op1
!= orig_op1
|| op2
!= orig_op2
)
1450 ret
= fold_build3_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
, op2
);
1453 *maybe_const_operands
&= op0_const
;
1454 *maybe_const_itself
&= op0_const_self
;
1458 && op0
== truthvalue_false_node
))
1459 *maybe_const_operands
&= op1_const
;
1462 && op0
== truthvalue_false_node
))
1463 *maybe_const_itself
&= op1_const_self
;
1467 && op0
== truthvalue_true_node
))
1468 *maybe_const_operands
&= op2_const
;
1471 && op0
== truthvalue_true_node
))
1472 *maybe_const_itself
&= op2_const_self
;
1475 case EXCESS_PRECISION_EXPR
:
1476 /* Each case where an operand with excess precision may be
1477 encountered must remove the EXCESS_PRECISION_EXPR around
1478 inner operands and possibly put one around the whole
1479 expression or possibly convert to the semantic type (which
1480 c_fully_fold does); we cannot tell at this stage which is
1481 appropriate in any particular case. */
1485 /* Various codes may appear through folding built-in functions
1486 and their arguments. */
1491 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1492 have been done by this point, so remove them again. */
1493 nowarning
|= TREE_NO_WARNING (ret
);
1494 STRIP_TYPE_NOPS (ret
);
1495 if (nowarning
&& !TREE_NO_WARNING (ret
))
1497 if (!CAN_HAVE_LOCATION_P (ret
))
1498 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
1499 TREE_NO_WARNING (ret
) = 1;
1502 protected_set_expr_location (ret
, loc
);
1506 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1507 return EXP. Otherwise, return either EXP or its known constant
1508 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1509 Is the BLKmode test appropriate? */
1512 decl_constant_value_for_optimization (tree exp
)
1516 /* This function is only used by C, for c_fully_fold and other
1517 optimization, and may not be correct for C++. */
1518 if (c_dialect_cxx ())
1522 || TREE_CODE (exp
) != VAR_DECL
1523 || TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
1524 || DECL_MODE (exp
) == BLKmode
)
1527 ret
= decl_constant_value (exp
);
1528 /* Avoid unwanted tree sharing between the initializer and current
1529 function's body where the tree can be modified e.g. by the
1531 if (ret
!= exp
&& TREE_STATIC (exp
))
1532 ret
= unshare_expr (ret
);
1536 /* Print a warning if a constant expression had overflow in folding.
1537 Invoke this function on every expression that the language
1538 requires to be a constant expression.
1539 Note the ANSI C standard says it is erroneous for a
1540 constant expression to overflow. */
1543 constant_expression_warning (tree value
)
1545 if (warn_overflow
&& pedantic
1546 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1547 || TREE_CODE (value
) == FIXED_CST
1548 || TREE_CODE (value
) == VECTOR_CST
1549 || TREE_CODE (value
) == COMPLEX_CST
)
1550 && TREE_OVERFLOW (value
))
1551 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1554 /* The same as above but print an unconditional error. */
1556 constant_expression_error (tree value
)
1558 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1559 || TREE_CODE (value
) == FIXED_CST
1560 || TREE_CODE (value
) == VECTOR_CST
1561 || TREE_CODE (value
) == COMPLEX_CST
)
1562 && TREE_OVERFLOW (value
))
1563 error ("overflow in constant expression");
1566 /* Print a warning if an expression had overflow in folding and its
1569 Invoke this function on every expression that
1570 (1) appears in the source code, and
1571 (2) is a constant expression that overflowed, and
1572 (3) is not already checked by convert_and_check;
1573 however, do not invoke this function on operands of explicit casts
1574 or when the expression is the result of an operator and any operand
1575 already overflowed. */
1578 overflow_warning (location_t loc
, tree value
)
1580 if (c_inhibit_evaluation_warnings
!= 0)
1583 switch (TREE_CODE (value
))
1586 warning_at (loc
, OPT_Woverflow
, "integer overflow in expression");
1590 warning_at (loc
, OPT_Woverflow
,
1591 "floating point overflow in expression");
1595 warning_at (loc
, OPT_Woverflow
, "fixed-point overflow in expression");
1599 warning_at (loc
, OPT_Woverflow
, "vector overflow in expression");
1603 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1604 warning_at (loc
, OPT_Woverflow
,
1605 "complex integer overflow in expression");
1606 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1607 warning_at (loc
, OPT_Woverflow
,
1608 "complex floating point overflow in expression");
1616 /* Warn about uses of logical || / && operator in a context where it
1617 is likely that the bitwise equivalent was intended by the
1618 programmer. We have seen an expression in which CODE is a binary
1619 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1620 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1622 warn_logical_operator (location_t location
, enum tree_code code
, tree type
,
1623 enum tree_code code_left
, tree op_left
,
1624 enum tree_code
ARG_UNUSED (code_right
), tree op_right
)
1626 int or_op
= (code
== TRUTH_ORIF_EXPR
|| code
== TRUTH_OR_EXPR
);
1627 int in0_p
, in1_p
, in_p
;
1628 tree low0
, low1
, low
, high0
, high1
, high
, lhs
, rhs
, tem
;
1629 bool strict_overflow_p
= false;
1631 if (code
!= TRUTH_ANDIF_EXPR
1632 && code
!= TRUTH_AND_EXPR
1633 && code
!= TRUTH_ORIF_EXPR
1634 && code
!= TRUTH_OR_EXPR
)
1637 /* Warn if &&/|| are being used in a context where it is
1638 likely that the bitwise equivalent was intended by the
1639 programmer. That is, an expression such as op && MASK
1640 where op should not be any boolean expression, nor a
1641 constant, and mask seems to be a non-boolean integer constant. */
1642 if (!truth_value_p (code_left
)
1643 && INTEGRAL_TYPE_P (TREE_TYPE (op_left
))
1644 && !CONSTANT_CLASS_P (op_left
)
1645 && !TREE_NO_WARNING (op_left
)
1646 && TREE_CODE (op_right
) == INTEGER_CST
1647 && !integer_zerop (op_right
)
1648 && !integer_onep (op_right
))
1651 warning_at (location
, OPT_Wlogical_op
, "logical %<or%>"
1652 " applied to non-boolean constant");
1654 warning_at (location
, OPT_Wlogical_op
, "logical %<and%>"
1655 " applied to non-boolean constant");
1656 TREE_NO_WARNING (op_left
) = true;
1660 /* We do not warn for constants because they are typical of macro
1661 expansions that test for features. */
1662 if (CONSTANT_CLASS_P (op_left
) || CONSTANT_CLASS_P (op_right
))
1665 /* This warning only makes sense with logical operands. */
1666 if (!(truth_value_p (TREE_CODE (op_left
))
1667 || INTEGRAL_TYPE_P (TREE_TYPE (op_left
)))
1668 || !(truth_value_p (TREE_CODE (op_right
))
1669 || INTEGRAL_TYPE_P (TREE_TYPE (op_right
))))
1672 lhs
= make_range (op_left
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
1673 rhs
= make_range (op_right
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
1675 if (lhs
&& TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
1676 lhs
= C_MAYBE_CONST_EXPR_EXPR (lhs
);
1678 if (rhs
&& TREE_CODE (rhs
) == C_MAYBE_CONST_EXPR
)
1679 rhs
= C_MAYBE_CONST_EXPR_EXPR (rhs
);
1681 /* If this is an OR operation, invert both sides; we will invert
1682 again at the end. */
1684 in0_p
= !in0_p
, in1_p
= !in1_p
;
1686 /* If both expressions are the same, if we can merge the ranges, and we
1687 can build the range test, return it or it inverted. */
1688 if (lhs
&& rhs
&& operand_equal_p (lhs
, rhs
, 0)
1689 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
1691 && 0 != (tem
= build_range_check (UNKNOWN_LOCATION
,
1692 type
, lhs
, in_p
, low
, high
)))
1694 if (TREE_CODE (tem
) != INTEGER_CST
)
1698 warning_at (location
, OPT_Wlogical_op
,
1700 "of collectively exhaustive tests is always true");
1702 warning_at (location
, OPT_Wlogical_op
,
1704 "of mutually exclusive tests is always false");
1709 /* Print a warning about casts that might indicate violation
1710 of strict aliasing rules if -Wstrict-aliasing is used and
1711 strict aliasing mode is in effect. OTYPE is the original
1712 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1715 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1717 /* Strip pointer conversion chains and get to the correct original type. */
1719 otype
= TREE_TYPE (expr
);
1721 if (!(flag_strict_aliasing
1722 && POINTER_TYPE_P (type
)
1723 && POINTER_TYPE_P (otype
)
1724 && !VOID_TYPE_P (TREE_TYPE (type
)))
1725 /* If the type we are casting to is a ref-all pointer
1726 dereferencing it is always valid. */
1727 || TYPE_REF_CAN_ALIAS_ALL (type
))
1730 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1731 && (DECL_P (TREE_OPERAND (expr
, 0))
1732 || handled_component_p (TREE_OPERAND (expr
, 0))))
1734 /* Casting the address of an object to non void pointer. Warn
1735 if the cast breaks type based aliasing. */
1736 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1738 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1739 "might break strict-aliasing rules");
1744 /* warn_strict_aliasing >= 3. This includes the default (3).
1745 Only warn if the cast is dereferenced immediately. */
1746 alias_set_type set1
=
1747 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1748 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1750 if (set1
!= set2
&& set2
!= 0
1751 && (set1
== 0 || !alias_sets_conflict_p (set1
, set2
)))
1753 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1754 "pointer will break strict-aliasing rules");
1757 else if (warn_strict_aliasing
== 2
1758 && !alias_sets_must_conflict_p (set1
, set2
))
1760 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1761 "pointer might break strict-aliasing rules");
1767 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1769 /* At this level, warn for any conversions, even if an address is
1770 not taken in the same statement. This will likely produce many
1771 false positives, but could be useful to pinpoint problems that
1772 are not revealed at higher levels. */
1773 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1774 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1775 if (!COMPLETE_TYPE_P (type
)
1776 || !alias_sets_must_conflict_p (set1
, set2
))
1778 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1779 "pointer might break strict-aliasing rules");
1787 /* Warn for unlikely, improbable, or stupid DECL declarations
1791 check_main_parameter_types (tree decl
)
1796 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1797 args
= TREE_CHAIN (args
))
1799 tree type
= args
? TREE_VALUE (args
) : 0;
1801 if (type
== void_type_node
|| type
== error_mark_node
)
1808 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1809 pedwarn (input_location
, OPT_Wmain
, "first argument of %q+D should be %<int%>",
1814 if (TREE_CODE (type
) != POINTER_TYPE
1815 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1816 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1818 pedwarn (input_location
, OPT_Wmain
, "second argument of %q+D should be %<char **%>",
1823 if (TREE_CODE (type
) != POINTER_TYPE
1824 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1825 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1827 pedwarn (input_location
, OPT_Wmain
, "third argument of %q+D should probably be "
1828 "%<char **%>", decl
);
1833 /* It is intentional that this message does not mention the third
1834 argument because it's only mentioned in an appendix of the
1836 if (argct
> 0 && (argct
< 2 || argct
> 3))
1837 pedwarn (input_location
, OPT_Wmain
, "%q+D takes only zero or two arguments", decl
);
1840 /* True if pointers to distinct types T1 and T2 can be converted to
1841 each other without an explicit cast. Only returns true for opaque
1844 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
1846 if (TREE_CODE (t1
) == VECTOR_TYPE
&& TREE_CODE (t2
) == VECTOR_TYPE
1847 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
1848 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1854 /* True if vector types T1 and T2 can be converted to each other
1855 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1856 can only be converted with -flax-vector-conversions yet that is not
1857 in effect, emit a note telling the user about that option if such
1858 a note has not previously been emitted. */
1860 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
1862 static bool emitted_lax_note
= false;
1863 bool convertible_lax
;
1865 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
1866 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1870 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1871 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1872 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1873 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1874 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1876 if (!convertible_lax
|| flag_lax_vector_conversions
)
1877 return convertible_lax
;
1879 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1880 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1883 if (emit_lax_note
&& !emitted_lax_note
)
1885 emitted_lax_note
= true;
1886 inform (input_location
, "use -flax-vector-conversions to permit "
1887 "conversions between vectors with differing "
1888 "element types or numbers of subparts");
1894 /* This is a helper function of build_binary_op.
1896 For certain operations if both args were extended from the same
1897 smaller type, do the arithmetic in that type and then extend.
1899 BITWISE indicates a bitwise operation.
1900 For them, this optimization is safe only if
1901 both args are zero-extended or both are sign-extended.
1902 Otherwise, we might change the result.
1903 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1904 but calculated in (unsigned short) it would be (unsigned short)-1.
1906 tree
shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1908 int unsigned0
, unsigned1
;
1913 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1914 excessive narrowing when we call get_narrower below. For
1915 example, suppose that OP0 is of unsigned int extended
1916 from signed char and that RESULT_TYPE is long long int.
1917 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1920 (long long int) (unsigned int) signed_char
1922 which get_narrower would narrow down to
1924 (unsigned int) signed char
1926 If we do not cast OP0 first, get_narrower would return
1927 signed_char, which is inconsistent with the case of the
1929 op0
= convert (result_type
, op0
);
1930 op1
= convert (result_type
, op1
);
1932 arg0
= get_narrower (op0
, &unsigned0
);
1933 arg1
= get_narrower (op1
, &unsigned1
);
1935 /* UNS is 1 if the operation to be done is an unsigned one. */
1936 uns
= TYPE_UNSIGNED (result_type
);
1938 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1939 but it *requires* conversion to FINAL_TYPE. */
1941 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1942 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1943 && TREE_TYPE (op0
) != result_type
)
1944 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1945 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1946 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1947 && TREE_TYPE (op1
) != result_type
)
1948 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1950 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1952 /* For bitwise operations, signedness of nominal type
1953 does not matter. Consider only how operands were extended. */
1957 /* Note that in all three cases below we refrain from optimizing
1958 an unsigned operation on sign-extended args.
1959 That would not be valid. */
1961 /* Both args variable: if both extended in same way
1962 from same width, do it in that width.
1963 Do it unsigned if args were zero-extended. */
1964 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1965 < TYPE_PRECISION (result_type
))
1966 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1967 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1968 && unsigned0
== unsigned1
1969 && (unsigned0
|| !uns
))
1970 return c_common_signed_or_unsigned_type
1971 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1973 else if (TREE_CODE (arg0
) == INTEGER_CST
1974 && (unsigned1
|| !uns
)
1975 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1976 < TYPE_PRECISION (result_type
))
1978 = c_common_signed_or_unsigned_type (unsigned1
,
1980 && !POINTER_TYPE_P (type
)
1981 && int_fits_type_p (arg0
, type
))
1984 else if (TREE_CODE (arg1
) == INTEGER_CST
1985 && (unsigned0
|| !uns
)
1986 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1987 < TYPE_PRECISION (result_type
))
1989 = c_common_signed_or_unsigned_type (unsigned0
,
1991 && !POINTER_TYPE_P (type
)
1992 && int_fits_type_p (arg1
, type
))
1998 /* Warns if the conversion of EXPR to TYPE may alter a value.
1999 This is a helper function for warnings_for_convert_and_check. */
2002 conversion_warning (tree type
, tree expr
)
2004 bool give_warning
= false;
2007 const int expr_num_operands
= TREE_OPERAND_LENGTH (expr
);
2008 tree expr_type
= TREE_TYPE (expr
);
2010 if (!warn_conversion
&& !warn_sign_conversion
)
2013 /* If any operand is artificial, then this expression was generated
2014 by the compiler and we do not warn. */
2015 for (i
= 0; i
< expr_num_operands
; i
++)
2017 tree op
= TREE_OPERAND (expr
, i
);
2018 if (op
&& DECL_P (op
) && DECL_ARTIFICIAL (op
))
2022 switch (TREE_CODE (expr
))
2030 case TRUTH_ANDIF_EXPR
:
2031 case TRUTH_ORIF_EXPR
:
2032 case TRUTH_AND_EXPR
:
2034 case TRUTH_XOR_EXPR
:
2035 case TRUTH_NOT_EXPR
:
2036 /* Conversion from boolean to a signed:1 bit-field (which only
2037 can hold the values 0 and -1) doesn't lose information - but
2038 it does change the value. */
2039 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2040 warning (OPT_Wconversion
,
2041 "conversion to %qT from boolean expression", type
);
2047 /* Warn for real constant that is not an exact integer converted
2049 if (TREE_CODE (expr_type
) == REAL_TYPE
2050 && TREE_CODE (type
) == INTEGER_TYPE
)
2052 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
2053 give_warning
= true;
2055 /* Warn for an integer constant that does not fit into integer type. */
2056 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2057 && TREE_CODE (type
) == INTEGER_TYPE
2058 && !int_fits_type_p (expr
, type
))
2060 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
2061 && tree_int_cst_sgn (expr
) < 0)
2062 warning (OPT_Wsign_conversion
,
2063 "negative integer implicitly converted to unsigned type");
2064 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
2065 warning (OPT_Wsign_conversion
, "conversion of unsigned constant "
2066 "value to negative integer");
2068 give_warning
= true;
2070 else if (TREE_CODE (type
) == REAL_TYPE
)
2072 /* Warn for an integer constant that does not fit into real type. */
2073 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
2075 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
2076 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2077 give_warning
= true;
2079 /* Warn for a real constant that does not fit into a smaller
2081 else if (TREE_CODE (expr_type
) == REAL_TYPE
2082 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2084 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2085 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2086 give_warning
= true;
2091 warning (OPT_Wconversion
,
2092 "conversion to %qT alters %qT constant value",
2099 /* In case of COND_EXPR, if both operands are constants or
2100 COND_EXPR, then we do not care about the type of COND_EXPR,
2101 only about the conversion of each operand. */
2102 tree op1
= TREE_OPERAND (expr
, 1);
2103 tree op2
= TREE_OPERAND (expr
, 2);
2105 if ((TREE_CODE (op1
) == REAL_CST
|| TREE_CODE (op1
) == INTEGER_CST
2106 || TREE_CODE (op1
) == COND_EXPR
)
2107 && (TREE_CODE (op2
) == REAL_CST
|| TREE_CODE (op2
) == INTEGER_CST
2108 || TREE_CODE (op2
) == COND_EXPR
))
2110 conversion_warning (type
, op1
);
2111 conversion_warning (type
, op2
);
2117 default: /* 'expr' is not a constant. */
2119 /* Warn for real types converted to integer types. */
2120 if (TREE_CODE (expr_type
) == REAL_TYPE
2121 && TREE_CODE (type
) == INTEGER_TYPE
)
2122 give_warning
= true;
2124 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2125 && TREE_CODE (type
) == INTEGER_TYPE
)
2127 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2128 expr
= get_unwidened (expr
, 0);
2129 expr_type
= TREE_TYPE (expr
);
2131 /* Don't warn for short y; short x = ((int)y & 0xff); */
2132 if (TREE_CODE (expr
) == BIT_AND_EXPR
2133 || TREE_CODE (expr
) == BIT_IOR_EXPR
2134 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2136 /* If both args were extended from a shortest type,
2137 use that type if that is safe. */
2138 expr_type
= shorten_binary_op (expr_type
,
2139 TREE_OPERAND (expr
, 0),
2140 TREE_OPERAND (expr
, 1),
2143 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2145 tree op0
= TREE_OPERAND (expr
, 0);
2146 tree op1
= TREE_OPERAND (expr
, 1);
2147 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2148 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2150 /* If one of the operands is a non-negative constant
2151 that fits in the target type, then the type of the
2152 other operand does not matter. */
2153 if ((TREE_CODE (op0
) == INTEGER_CST
2154 && int_fits_type_p (op0
, c_common_signed_type (type
))
2155 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2156 || (TREE_CODE (op1
) == INTEGER_CST
2157 && int_fits_type_p (op1
, c_common_signed_type (type
))
2158 && int_fits_type_p (op1
,
2159 c_common_unsigned_type (type
))))
2161 /* If constant is unsigned and fits in the target
2162 type, then the result will also fit. */
2163 else if ((TREE_CODE (op0
) == INTEGER_CST
2165 && int_fits_type_p (op0
, type
))
2166 || (TREE_CODE (op1
) == INTEGER_CST
2168 && int_fits_type_p (op1
, type
)))
2172 /* Warn for integer types converted to smaller integer types. */
2173 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2174 give_warning
= true;
2176 /* When they are the same width but different signedness,
2177 then the value may change. */
2178 else if ((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2179 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2180 /* Even when converted to a bigger type, if the type is
2181 unsigned but expr is signed, then negative values
2183 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2184 warning (OPT_Wsign_conversion
, "conversion to %qT from %qT "
2185 "may change the sign of the result",
2189 /* Warn for integer types converted to real types if and only if
2190 all the range of values of the integer type cannot be
2191 represented by the real type. */
2192 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2193 && TREE_CODE (type
) == REAL_TYPE
)
2195 tree type_low_bound
, type_high_bound
;
2196 REAL_VALUE_TYPE real_low_bound
, real_high_bound
;
2198 /* Don't warn about char y = 0xff; float x = (int) y; */
2199 expr
= get_unwidened (expr
, 0);
2200 expr_type
= TREE_TYPE (expr
);
2202 type_low_bound
= TYPE_MIN_VALUE (expr_type
);
2203 type_high_bound
= TYPE_MAX_VALUE (expr_type
);
2204 real_low_bound
= real_value_from_int_cst (0, type_low_bound
);
2205 real_high_bound
= real_value_from_int_cst (0, type_high_bound
);
2207 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
2208 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
2209 give_warning
= true;
2212 /* Warn for real types converted to smaller real types. */
2213 else if (TREE_CODE (expr_type
) == REAL_TYPE
2214 && TREE_CODE (type
) == REAL_TYPE
2215 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2216 give_warning
= true;
2220 warning (OPT_Wconversion
,
2221 "conversion to %qT from %qT may alter its value",
2226 /* Produce warnings after a conversion. RESULT is the result of
2227 converting EXPR to TYPE. This is a helper function for
2228 convert_and_check and cp_convert_and_check. */
2231 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
2233 if (TREE_CODE (expr
) == INTEGER_CST
2234 && (TREE_CODE (type
) == INTEGER_TYPE
2235 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2236 && !int_fits_type_p (expr
, type
))
2238 /* Do not diagnose overflow in a constant expression merely
2239 because a conversion overflowed. */
2240 if (TREE_OVERFLOW (result
))
2241 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2243 if (TYPE_UNSIGNED (type
))
2245 /* This detects cases like converting -129 or 256 to
2247 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2248 warning (OPT_Woverflow
,
2249 "large integer implicitly truncated to unsigned type");
2251 conversion_warning (type
, expr
);
2253 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2254 warning (OPT_Woverflow
,
2255 "overflow in implicit constant conversion");
2256 /* No warning for converting 0x80000000 to int. */
2258 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2259 || TYPE_PRECISION (TREE_TYPE (expr
))
2260 != TYPE_PRECISION (type
)))
2261 warning (OPT_Woverflow
,
2262 "overflow in implicit constant conversion");
2265 conversion_warning (type
, expr
);
2267 else if ((TREE_CODE (result
) == INTEGER_CST
2268 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2269 warning (OPT_Woverflow
,
2270 "overflow in implicit constant conversion");
2272 conversion_warning (type
, expr
);
2276 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2277 Invoke this function on every expression that is converted implicitly,
2278 i.e. because of language rules and not because of an explicit cast. */
2281 convert_and_check (tree type
, tree expr
)
2284 tree expr_for_warning
;
2286 /* Convert from a value with possible excess precision rather than
2287 via the semantic type, but do not warn about values not fitting
2288 exactly in the semantic type. */
2289 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2291 tree orig_type
= TREE_TYPE (expr
);
2292 expr
= TREE_OPERAND (expr
, 0);
2293 expr_for_warning
= convert (orig_type
, expr
);
2294 if (orig_type
== type
)
2295 return expr_for_warning
;
2298 expr_for_warning
= expr
;
2300 if (TREE_TYPE (expr
) == type
)
2303 result
= convert (type
, expr
);
2305 if (c_inhibit_evaluation_warnings
== 0
2306 && !TREE_OVERFLOW_P (expr
)
2307 && result
!= error_mark_node
)
2308 warnings_for_convert_and_check (type
, expr_for_warning
, result
);
2313 /* A node in a list that describes references to variables (EXPR), which are
2314 either read accesses if WRITER is zero, or write accesses, in which case
2315 WRITER is the parent of EXPR. */
2322 /* Used to implement a cache the results of a call to verify_tree. We only
2323 use this for SAVE_EXPRs. */
2326 struct tlist_cache
*next
;
2327 struct tlist
*cache_before_sp
;
2328 struct tlist
*cache_after_sp
;
2332 /* Obstack to use when allocating tlist structures, and corresponding
2334 static struct obstack tlist_obstack
;
2335 static char *tlist_firstobj
= 0;
2337 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2339 static struct tlist
*warned_ids
;
2340 /* SAVE_EXPRs need special treatment. We process them only once and then
2341 cache the results. */
2342 static struct tlist_cache
*save_expr_cache
;
2344 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2345 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2346 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2347 static int warning_candidate_p (tree
);
2348 static bool candidate_equal_p (const_tree
, const_tree
);
2349 static void warn_for_collisions (struct tlist
*);
2350 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2351 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2353 /* Create a new struct tlist and fill in its fields. */
2354 static struct tlist
*
2355 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2358 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2365 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2366 is nonnull, we ignore any node we find which has a writer equal to it. */
2369 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2373 struct tlist
*next
= add
->next
;
2376 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2377 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2382 /* Merge the nodes of ADD into TO. This merging process is done so that for
2383 each variable that already exists in TO, no new node is added; however if
2384 there is a write access recorded in ADD, and an occurrence on TO is only
2385 a read access, then the occurrence in TO will be modified to record the
2389 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2391 struct tlist
**end
= to
;
2394 end
= &(*end
)->next
;
2400 struct tlist
*next
= add
->next
;
2402 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2403 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2407 tmp2
->writer
= add
->writer
;
2411 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
2412 end
= &(*end
)->next
;
2419 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2420 references in list LIST conflict with it, excluding reads if ONLY writers
2424 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2429 /* Avoid duplicate warnings. */
2430 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2431 if (candidate_equal_p (tmp
->expr
, written
))
2436 if (candidate_equal_p (list
->expr
, written
)
2437 && !candidate_equal_p (list
->writer
, writer
)
2438 && (!only_writes
|| list
->writer
))
2440 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2441 warning_at (EXPR_HAS_LOCATION (writer
)
2442 ? EXPR_LOCATION (writer
) : input_location
,
2443 OPT_Wsequence_point
, "operation on %qE may be undefined",
2450 /* Given a list LIST of references to variables, find whether any of these
2451 can cause conflicts due to missing sequence points. */
2454 warn_for_collisions (struct tlist
*list
)
2458 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
2461 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
2465 /* Return nonzero if X is a tree that can be verified by the sequence point
2468 warning_candidate_p (tree x
)
2470 /* !VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2471 (lvalue_p) crash on TRY/CATCH. */
2472 return !(DECL_P (x
) && DECL_ARTIFICIAL (x
))
2473 && TREE_TYPE (x
) && !VOID_TYPE_P (TREE_TYPE (x
)) && lvalue_p (x
);
2476 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2478 candidate_equal_p (const_tree x
, const_tree y
)
2480 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
2483 /* Walk the tree X, and record accesses to variables. If X is written by the
2484 parent tree, WRITER is the parent.
2485 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2486 expression or its only operand forces a sequence point, then everything up
2487 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2489 Once we return, we will have emitted warnings if any subexpression before
2490 such a sequence point could be undefined. On a higher level, however, the
2491 sequence point may not be relevant, and we'll merge the two lists.
2493 Example: (b++, a) + b;
2494 The call that processes the COMPOUND_EXPR will store the increment of B
2495 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2496 processes the PLUS_EXPR will need to merge the two lists so that
2497 eventually, all accesses end up on the same list (and we'll warn about the
2498 unordered subexpressions b++ and b.
2500 A note on merging. If we modify the former example so that our expression
2503 care must be taken not simply to add all three expressions into the final
2504 PNO_SP list. The function merge_tlist takes care of that by merging the
2505 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2506 way, so that no more than one access to B is recorded. */
2509 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
2512 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
2513 enum tree_code code
;
2514 enum tree_code_class cl
;
2516 /* X may be NULL if it is the operand of an empty statement expression
2522 code
= TREE_CODE (x
);
2523 cl
= TREE_CODE_CLASS (code
);
2525 if (warning_candidate_p (x
))
2526 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
2534 case TRUTH_ANDIF_EXPR
:
2535 case TRUTH_ORIF_EXPR
:
2536 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2537 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2538 warn_for_collisions (tmp_nosp
);
2539 merge_tlist (pbefore_sp
, tmp_before
, 0);
2540 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
2541 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
2542 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2546 tmp_before
= tmp_list2
= 0;
2547 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
2548 warn_for_collisions (tmp_list2
);
2549 merge_tlist (pbefore_sp
, tmp_before
, 0);
2550 merge_tlist (pbefore_sp
, tmp_list2
, 1);
2552 tmp_list3
= tmp_nosp
= 0;
2553 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
2554 warn_for_collisions (tmp_nosp
);
2555 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2557 tmp_list3
= tmp_list2
= 0;
2558 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
2559 warn_for_collisions (tmp_list2
);
2560 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2561 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2562 two first, to avoid warning for (a ? b++ : b++). */
2563 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
2564 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2567 case PREDECREMENT_EXPR
:
2568 case PREINCREMENT_EXPR
:
2569 case POSTDECREMENT_EXPR
:
2570 case POSTINCREMENT_EXPR
:
2571 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
2575 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2576 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2577 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
2578 /* Expressions inside the LHS are not ordered wrt. the sequence points
2579 in the RHS. Example:
2581 Despite the fact that the modification of "a" is in the before_sp
2582 list (tmp_before), it conflicts with the use of "a" in the LHS.
2583 We can handle this by adding the contents of tmp_list3
2584 to those of tmp_before, and redoing the collision warnings for that
2586 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
2587 warn_for_collisions (tmp_before
);
2588 /* Exclude the LHS itself here; we first have to merge it into the
2589 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2590 didn't exclude the LHS, we'd get it twice, once as a read and once
2592 add_tlist (pno_sp
, tmp_list3
, x
, 0);
2593 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
2595 merge_tlist (pbefore_sp
, tmp_before
, 0);
2596 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
2597 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
2598 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
2602 /* We need to warn about conflicts among arguments and conflicts between
2603 args and the function address. Side effects of the function address,
2604 however, are not ordered by the sequence point of the call. */
2606 call_expr_arg_iterator iter
;
2608 tmp_before
= tmp_nosp
= 0;
2609 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2610 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
2612 tmp_list2
= tmp_list3
= 0;
2613 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
2614 merge_tlist (&tmp_list3
, tmp_list2
, 0);
2615 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
2617 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
2618 warn_for_collisions (tmp_before
);
2619 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
2624 /* Scan all the list, e.g. indices of multi dimensional array. */
2627 tmp_before
= tmp_nosp
= 0;
2628 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2629 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2630 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2637 struct tlist_cache
*t
;
2638 for (t
= save_expr_cache
; t
; t
= t
->next
)
2639 if (candidate_equal_p (t
->expr
, x
))
2644 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
2645 t
->next
= save_expr_cache
;
2647 save_expr_cache
= t
;
2649 tmp_before
= tmp_nosp
= 0;
2650 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2651 warn_for_collisions (tmp_nosp
);
2656 struct tlist
*t
= tmp_nosp
;
2658 merge_tlist (&tmp_list3
, t
, 0);
2660 t
->cache_before_sp
= tmp_before
;
2661 t
->cache_after_sp
= tmp_list3
;
2663 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
2664 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
2669 x
= TREE_OPERAND (x
, 0);
2676 /* For other expressions, simply recurse on their operands.
2677 Manual tail recursion for unary expressions.
2678 Other non-expressions need not be processed. */
2679 if (cl
== tcc_unary
)
2681 x
= TREE_OPERAND (x
, 0);
2685 else if (IS_EXPR_CODE_CLASS (cl
))
2688 int max
= TREE_OPERAND_LENGTH (x
);
2689 for (lp
= 0; lp
< max
; lp
++)
2691 tmp_before
= tmp_nosp
= 0;
2692 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
2693 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2694 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2701 /* Try to warn for undefined behavior in EXPR due to missing sequence
2705 verify_sequence_points (tree expr
)
2707 struct tlist
*before_sp
= 0, *after_sp
= 0;
2710 save_expr_cache
= 0;
2711 if (tlist_firstobj
== 0)
2713 gcc_obstack_init (&tlist_obstack
);
2714 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
2717 verify_tree (expr
, &before_sp
, &after_sp
, 0);
2718 warn_for_collisions (after_sp
);
2719 obstack_free (&tlist_obstack
, tlist_firstobj
);
2722 /* Validate the expression after `case' and apply default promotions. */
2725 check_case_value (tree value
)
2727 if (value
== NULL_TREE
)
2730 /* ??? Can we ever get nops here for a valid case value? We
2732 STRIP_TYPE_NOPS (value
);
2733 /* In C++, the following is allowed:
2736 switch (...) { case i: ... }
2738 So, we try to reduce the VALUE to a constant that way. */
2739 if (c_dialect_cxx ())
2741 value
= decl_constant_value (value
);
2742 STRIP_TYPE_NOPS (value
);
2743 value
= fold (value
);
2746 if (TREE_CODE (value
) == INTEGER_CST
)
2747 /* Promote char or short to int. */
2748 value
= perform_integral_promotions (value
);
2749 else if (value
!= error_mark_node
)
2751 error ("case label does not reduce to an integer constant");
2752 value
= error_mark_node
;
2755 constant_expression_warning (value
);
2760 /* See if the case values LOW and HIGH are in the range of the original
2761 type (i.e. before the default conversion to int) of the switch testing
2763 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2764 the type before promoting it. CASE_LOW_P is a pointer to the lower
2765 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2766 if the case is not a case range.
2767 The caller has to make sure that we are not called with NULL for
2768 CASE_LOW_P (i.e. the default case).
2769 Returns true if the case label is in range of ORIG_TYPE (saturated or
2770 untouched) or false if the label is out of range. */
2773 check_case_bounds (tree type
, tree orig_type
,
2774 tree
*case_low_p
, tree
*case_high_p
)
2776 tree min_value
, max_value
;
2777 tree case_low
= *case_low_p
;
2778 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2780 /* If there was a problem with the original type, do nothing. */
2781 if (orig_type
== error_mark_node
)
2784 min_value
= TYPE_MIN_VALUE (orig_type
);
2785 max_value
= TYPE_MAX_VALUE (orig_type
);
2787 /* Case label is less than minimum for type. */
2788 if (tree_int_cst_compare (case_low
, min_value
) < 0
2789 && tree_int_cst_compare (case_high
, min_value
) < 0)
2791 warning (0, "case label value is less than minimum value for type");
2795 /* Case value is greater than maximum for type. */
2796 if (tree_int_cst_compare (case_low
, max_value
) > 0
2797 && tree_int_cst_compare (case_high
, max_value
) > 0)
2799 warning (0, "case label value exceeds maximum value for type");
2803 /* Saturate lower case label value to minimum. */
2804 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2805 && tree_int_cst_compare (case_low
, min_value
) < 0)
2807 warning (0, "lower value in case label range"
2808 " less than minimum value for type");
2809 case_low
= min_value
;
2812 /* Saturate upper case label value to maximum. */
2813 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2814 && tree_int_cst_compare (case_high
, max_value
) > 0)
2816 warning (0, "upper value in case label range"
2817 " exceeds maximum value for type");
2818 case_high
= max_value
;
2821 if (*case_low_p
!= case_low
)
2822 *case_low_p
= convert (type
, case_low
);
2823 if (case_high_p
&& *case_high_p
!= case_high
)
2824 *case_high_p
= convert (type
, case_high
);
2829 /* Return an integer type with BITS bits of precision,
2830 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2833 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2835 if (bits
== TYPE_PRECISION (integer_type_node
))
2836 return unsignedp
? unsigned_type_node
: integer_type_node
;
2838 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2839 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2841 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2842 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2844 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2845 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2847 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2848 return (unsignedp
? long_long_unsigned_type_node
2849 : long_long_integer_type_node
);
2851 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2852 return (unsignedp
? widest_unsigned_literal_type_node
2853 : widest_integer_literal_type_node
);
2855 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2856 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2858 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2859 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2861 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2862 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2864 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2865 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2870 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2871 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2872 and saturating if SATP is nonzero, otherwise not saturating. */
2875 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2876 int unsignedp
, int satp
)
2878 enum machine_mode mode
;
2880 mode
= unsignedp
? UQQmode
: QQmode
;
2882 mode
= unsignedp
? UHAmode
: HAmode
;
2884 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2885 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2888 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2890 sorry ("GCC cannot support operators with integer types and "
2891 "fixed-point types that have too many integral and "
2892 "fractional bits together");
2896 return c_common_type_for_mode (mode
, satp
);
2899 /* Used for communication between c_common_type_for_mode and
2900 c_register_builtin_type. */
2901 static GTY(()) tree registered_builtin_types
;
2903 /* Return a data type that has machine mode MODE.
2904 If the mode is an integer,
2905 then UNSIGNEDP selects between signed and unsigned types.
2906 If the mode is a fixed-point mode,
2907 then UNSIGNEDP selects between saturating and nonsaturating types. */
2910 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
2914 if (mode
== TYPE_MODE (integer_type_node
))
2915 return unsignedp
? unsigned_type_node
: integer_type_node
;
2917 if (mode
== TYPE_MODE (signed_char_type_node
))
2918 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2920 if (mode
== TYPE_MODE (short_integer_type_node
))
2921 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2923 if (mode
== TYPE_MODE (long_integer_type_node
))
2924 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2926 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2927 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2929 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2930 return unsignedp
? widest_unsigned_literal_type_node
2931 : widest_integer_literal_type_node
;
2934 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2937 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2940 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2943 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2945 #if HOST_BITS_PER_WIDE_INT >= 64
2946 if (mode
== TYPE_MODE (intTI_type_node
))
2947 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2950 if (mode
== TYPE_MODE (float_type_node
))
2951 return float_type_node
;
2953 if (mode
== TYPE_MODE (double_type_node
))
2954 return double_type_node
;
2956 if (mode
== TYPE_MODE (long_double_type_node
))
2957 return long_double_type_node
;
2959 if (mode
== TYPE_MODE (void_type_node
))
2960 return void_type_node
;
2962 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2964 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2965 : make_signed_type (GET_MODE_PRECISION (mode
)));
2967 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2969 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2970 : make_signed_type (GET_MODE_PRECISION (mode
)));
2972 if (COMPLEX_MODE_P (mode
))
2974 enum machine_mode inner_mode
;
2977 if (mode
== TYPE_MODE (complex_float_type_node
))
2978 return complex_float_type_node
;
2979 if (mode
== TYPE_MODE (complex_double_type_node
))
2980 return complex_double_type_node
;
2981 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2982 return complex_long_double_type_node
;
2984 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2985 return complex_integer_type_node
;
2987 inner_mode
= GET_MODE_INNER (mode
);
2988 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2989 if (inner_type
!= NULL_TREE
)
2990 return build_complex_type (inner_type
);
2992 else if (VECTOR_MODE_P (mode
))
2994 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2995 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2996 if (inner_type
!= NULL_TREE
)
2997 return build_vector_type_for_mode (inner_type
, mode
);
3000 if (mode
== TYPE_MODE (dfloat32_type_node
))
3001 return dfloat32_type_node
;
3002 if (mode
== TYPE_MODE (dfloat64_type_node
))
3003 return dfloat64_type_node
;
3004 if (mode
== TYPE_MODE (dfloat128_type_node
))
3005 return dfloat128_type_node
;
3007 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
3009 if (mode
== TYPE_MODE (short_fract_type_node
))
3010 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
3011 if (mode
== TYPE_MODE (fract_type_node
))
3012 return unsignedp
? sat_fract_type_node
: fract_type_node
;
3013 if (mode
== TYPE_MODE (long_fract_type_node
))
3014 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
3015 if (mode
== TYPE_MODE (long_long_fract_type_node
))
3016 return unsignedp
? sat_long_long_fract_type_node
3017 : long_long_fract_type_node
;
3019 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
3020 return unsignedp
? sat_unsigned_short_fract_type_node
3021 : unsigned_short_fract_type_node
;
3022 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
3023 return unsignedp
? sat_unsigned_fract_type_node
3024 : unsigned_fract_type_node
;
3025 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
3026 return unsignedp
? sat_unsigned_long_fract_type_node
3027 : unsigned_long_fract_type_node
;
3028 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
3029 return unsignedp
? sat_unsigned_long_long_fract_type_node
3030 : unsigned_long_long_fract_type_node
;
3032 if (mode
== TYPE_MODE (short_accum_type_node
))
3033 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3034 if (mode
== TYPE_MODE (accum_type_node
))
3035 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3036 if (mode
== TYPE_MODE (long_accum_type_node
))
3037 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3038 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3039 return unsignedp
? sat_long_long_accum_type_node
3040 : long_long_accum_type_node
;
3042 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3043 return unsignedp
? sat_unsigned_short_accum_type_node
3044 : unsigned_short_accum_type_node
;
3045 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3046 return unsignedp
? sat_unsigned_accum_type_node
3047 : unsigned_accum_type_node
;
3048 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3049 return unsignedp
? sat_unsigned_long_accum_type_node
3050 : unsigned_long_accum_type_node
;
3051 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3052 return unsignedp
? sat_unsigned_long_long_accum_type_node
3053 : unsigned_long_long_accum_type_node
;
3056 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3058 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3060 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3062 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3064 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3066 if (mode
== UQQmode
)
3067 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3068 if (mode
== UHQmode
)
3069 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3070 if (mode
== USQmode
)
3071 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3072 if (mode
== UDQmode
)
3073 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3074 if (mode
== UTQmode
)
3075 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3078 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3080 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3082 return unsignedp
? sat_da_type_node
: da_type_node
;
3084 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3086 if (mode
== UHAmode
)
3087 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3088 if (mode
== USAmode
)
3089 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3090 if (mode
== UDAmode
)
3091 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3092 if (mode
== UTAmode
)
3093 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3096 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3097 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
3098 return TREE_VALUE (t
);
3104 c_common_unsigned_type (tree type
)
3106 return c_common_signed_or_unsigned_type (1, type
);
3109 /* Return a signed type the same as TYPE in other respects. */
3112 c_common_signed_type (tree type
)
3114 return c_common_signed_or_unsigned_type (0, type
);
3117 /* Return a type the same as TYPE except unsigned or
3118 signed according to UNSIGNEDP. */
3121 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3125 /* This block of code emulates the behavior of the old
3126 c_common_unsigned_type. In particular, it returns
3127 long_unsigned_type_node if passed a long, even when a int would
3128 have the same size. This is necessary for warnings to work
3129 correctly in archs where sizeof(int) == sizeof(long) */
3131 type1
= TYPE_MAIN_VARIANT (type
);
3132 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3133 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3134 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3135 return unsignedp
? unsigned_type_node
: integer_type_node
;
3136 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3137 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3138 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3139 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3140 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3141 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3142 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3143 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3144 #if HOST_BITS_PER_WIDE_INT >= 64
3145 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3146 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3148 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3149 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3150 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3151 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3152 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3153 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3154 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3155 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3157 #define C_COMMON_FIXED_TYPES(NAME) \
3158 if (type1 == short_ ## NAME ## _type_node \
3159 || type1 == unsigned_short_ ## NAME ## _type_node) \
3160 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3161 : short_ ## NAME ## _type_node; \
3162 if (type1 == NAME ## _type_node \
3163 || type1 == unsigned_ ## NAME ## _type_node) \
3164 return unsignedp ? unsigned_ ## NAME ## _type_node \
3165 : NAME ## _type_node; \
3166 if (type1 == long_ ## NAME ## _type_node \
3167 || type1 == unsigned_long_ ## NAME ## _type_node) \
3168 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3169 : long_ ## NAME ## _type_node; \
3170 if (type1 == long_long_ ## NAME ## _type_node \
3171 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3172 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3173 : long_long_ ## NAME ## _type_node;
3175 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3176 if (type1 == NAME ## _type_node \
3177 || type1 == u ## NAME ## _type_node) \
3178 return unsignedp ? u ## NAME ## _type_node \
3179 : NAME ## _type_node;
3181 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3182 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3183 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3184 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3185 : sat_ ## short_ ## NAME ## _type_node; \
3186 if (type1 == sat_ ## NAME ## _type_node \
3187 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3188 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3189 : sat_ ## NAME ## _type_node; \
3190 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3191 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3192 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3193 : sat_ ## long_ ## NAME ## _type_node; \
3194 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3195 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3196 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3197 : sat_ ## long_long_ ## NAME ## _type_node;
3199 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3200 if (type1 == sat_ ## NAME ## _type_node \
3201 || type1 == sat_ ## u ## NAME ## _type_node) \
3202 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3203 : sat_ ## NAME ## _type_node;
3205 C_COMMON_FIXED_TYPES (fract
);
3206 C_COMMON_FIXED_TYPES_SAT (fract
);
3207 C_COMMON_FIXED_TYPES (accum
);
3208 C_COMMON_FIXED_TYPES_SAT (accum
);
3210 C_COMMON_FIXED_MODE_TYPES (qq
);
3211 C_COMMON_FIXED_MODE_TYPES (hq
);
3212 C_COMMON_FIXED_MODE_TYPES (sq
);
3213 C_COMMON_FIXED_MODE_TYPES (dq
);
3214 C_COMMON_FIXED_MODE_TYPES (tq
);
3215 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3216 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3217 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3218 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3219 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3220 C_COMMON_FIXED_MODE_TYPES (ha
);
3221 C_COMMON_FIXED_MODE_TYPES (sa
);
3222 C_COMMON_FIXED_MODE_TYPES (da
);
3223 C_COMMON_FIXED_MODE_TYPES (ta
);
3224 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3225 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3226 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3227 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3229 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3230 the precision; they have precision set to match their range, but
3231 may use a wider mode to match an ABI. If we change modes, we may
3232 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3233 the precision as well, so as to yield correct results for
3234 bit-field types. C++ does not have these separate bit-field
3235 types, and producing a signed or unsigned variant of an
3236 ENUMERAL_TYPE may cause other problems as well. */
3238 if (!INTEGRAL_TYPE_P (type
)
3239 || TYPE_UNSIGNED (type
) == unsignedp
)
3242 #define TYPE_OK(node) \
3243 (TYPE_MODE (type) == TYPE_MODE (node) \
3244 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3245 if (TYPE_OK (signed_char_type_node
))
3246 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3247 if (TYPE_OK (integer_type_node
))
3248 return unsignedp
? unsigned_type_node
: integer_type_node
;
3249 if (TYPE_OK (short_integer_type_node
))
3250 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3251 if (TYPE_OK (long_integer_type_node
))
3252 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3253 if (TYPE_OK (long_long_integer_type_node
))
3254 return (unsignedp
? long_long_unsigned_type_node
3255 : long_long_integer_type_node
);
3256 if (TYPE_OK (widest_integer_literal_type_node
))
3257 return (unsignedp
? widest_unsigned_literal_type_node
3258 : widest_integer_literal_type_node
);
3260 #if HOST_BITS_PER_WIDE_INT >= 64
3261 if (TYPE_OK (intTI_type_node
))
3262 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3264 if (TYPE_OK (intDI_type_node
))
3265 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3266 if (TYPE_OK (intSI_type_node
))
3267 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3268 if (TYPE_OK (intHI_type_node
))
3269 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3270 if (TYPE_OK (intQI_type_node
))
3271 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3274 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3277 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3280 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3282 /* Extended integer types of the same width as a standard type have
3283 lesser rank, so those of the same width as int promote to int or
3284 unsigned int and are valid for printf formats expecting int or
3285 unsigned int. To avoid such special cases, avoid creating
3286 extended integer types for bit-fields if a standard integer type
3288 if (width
== TYPE_PRECISION (integer_type_node
))
3289 return unsignedp
? unsigned_type_node
: integer_type_node
;
3290 if (width
== TYPE_PRECISION (signed_char_type_node
))
3291 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3292 if (width
== TYPE_PRECISION (short_integer_type_node
))
3293 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3294 if (width
== TYPE_PRECISION (long_integer_type_node
))
3295 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3296 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3297 return (unsignedp
? long_long_unsigned_type_node
3298 : long_long_integer_type_node
);
3299 return build_nonstandard_integer_type (width
, unsignedp
);
3302 /* The C version of the register_builtin_type langhook. */
3305 c_register_builtin_type (tree type
, const char* name
)
3309 decl
= build_decl (UNKNOWN_LOCATION
,
3310 TYPE_DECL
, get_identifier (name
), type
);
3311 DECL_ARTIFICIAL (decl
) = 1;
3312 if (!TYPE_NAME (type
))
3313 TYPE_NAME (type
) = decl
;
3316 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3319 /* Print an error message for invalid operands to arith operation
3320 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3321 LOCATION is the location of the message. */
3324 binary_op_error (location_t location
, enum tree_code code
,
3325 tree type0
, tree type1
)
3332 opname
= "+"; break;
3334 opname
= "-"; break;
3336 opname
= "*"; break;
3338 opname
= "max"; break;
3340 opname
= "min"; break;
3342 opname
= "=="; break;
3344 opname
= "!="; break;
3346 opname
= "<="; break;
3348 opname
= ">="; break;
3350 opname
= "<"; break;
3352 opname
= ">"; break;
3354 opname
= "<<"; break;
3356 opname
= ">>"; break;
3357 case TRUNC_MOD_EXPR
:
3358 case FLOOR_MOD_EXPR
:
3359 opname
= "%"; break;
3360 case TRUNC_DIV_EXPR
:
3361 case FLOOR_DIV_EXPR
:
3362 opname
= "/"; break;
3364 opname
= "&"; break;
3366 opname
= "|"; break;
3367 case TRUTH_ANDIF_EXPR
:
3368 opname
= "&&"; break;
3369 case TRUTH_ORIF_EXPR
:
3370 opname
= "||"; break;
3372 opname
= "^"; break;
3377 "invalid operands to binary %s (have %qT and %qT)", opname
,
3381 /* Subroutine of build_binary_op, used for comparison operations.
3382 See if the operands have both been converted from subword integer types
3383 and, if so, perhaps change them both back to their original type.
3384 This function is also responsible for converting the two operands
3385 to the proper common type for comparison.
3387 The arguments of this function are all pointers to local variables
3388 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3389 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3391 If this function returns nonzero, it means that the comparison has
3392 a constant value. What this function returns is an expression for
3396 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
3397 enum tree_code
*rescode_ptr
)
3400 tree op0
= *op0_ptr
;
3401 tree op1
= *op1_ptr
;
3402 int unsignedp0
, unsignedp1
;
3404 tree primop0
, primop1
;
3405 enum tree_code code
= *rescode_ptr
;
3407 /* Throw away any conversions to wider types
3408 already present in the operands. */
3410 primop0
= get_narrower (op0
, &unsignedp0
);
3411 primop1
= get_narrower (op1
, &unsignedp1
);
3413 /* Handle the case that OP0 does not *contain* a conversion
3414 but it *requires* conversion to FINAL_TYPE. */
3416 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
3417 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3418 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
3419 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
3421 /* If one of the operands must be floated, we cannot optimize. */
3422 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
3423 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
3425 /* If first arg is constant, swap the args (changing operation
3426 so value is preserved), for canonicalization. Don't do this if
3427 the second arg is 0. */
3429 if (TREE_CONSTANT (primop0
)
3430 && !integer_zerop (primop1
) && !real_zerop (primop1
)
3431 && !fixed_zerop (primop1
))
3434 int temi
= unsignedp0
;
3442 unsignedp0
= unsignedp1
;
3465 *rescode_ptr
= code
;
3468 /* If comparing an integer against a constant more bits wide,
3469 maybe we can deduce a value of 1 or 0 independent of the data.
3470 Or else truncate the constant now
3471 rather than extend the variable at run time.
3473 This is only interesting if the constant is the wider arg.
3474 Also, it is not safe if the constant is unsigned and the
3475 variable arg is signed, since in this case the variable
3476 would be sign-extended and then regarded as unsigned.
3477 Our technique fails in this case because the lowest/highest
3478 possible unsigned results don't follow naturally from the
3479 lowest/highest possible values of the variable operand.
3480 For just EQ_EXPR and NE_EXPR there is another technique that
3481 could be used: see if the constant can be faithfully represented
3482 in the other operand's type, by truncating it and reextending it
3483 and see if that preserves the constant's value. */
3485 if (!real1
&& !real2
3486 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
3487 && TREE_CODE (primop1
) == INTEGER_CST
3488 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
3490 int min_gt
, max_gt
, min_lt
, max_lt
;
3491 tree maxval
, minval
;
3492 /* 1 if comparison is nominally unsigned. */
3493 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
3496 type
= c_common_signed_or_unsigned_type (unsignedp0
,
3497 TREE_TYPE (primop0
));
3499 maxval
= TYPE_MAX_VALUE (type
);
3500 minval
= TYPE_MIN_VALUE (type
);
3502 if (unsignedp
&& !unsignedp0
)
3503 *restype_ptr
= c_common_signed_type (*restype_ptr
);
3505 if (TREE_TYPE (primop1
) != *restype_ptr
)
3507 /* Convert primop1 to target type, but do not introduce
3508 additional overflow. We know primop1 is an int_cst. */
3509 primop1
= force_fit_type_double (*restype_ptr
,
3510 TREE_INT_CST_LOW (primop1
),
3511 TREE_INT_CST_HIGH (primop1
), 0,
3512 TREE_OVERFLOW (primop1
));
3514 if (type
!= *restype_ptr
)
3516 minval
= convert (*restype_ptr
, minval
);
3517 maxval
= convert (*restype_ptr
, maxval
);
3520 if (unsignedp
&& unsignedp0
)
3522 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
3523 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
3524 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
3525 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
3529 min_gt
= INT_CST_LT (primop1
, minval
);
3530 max_gt
= INT_CST_LT (primop1
, maxval
);
3531 min_lt
= INT_CST_LT (minval
, primop1
);
3532 max_lt
= INT_CST_LT (maxval
, primop1
);
3536 /* This used to be a switch, but Genix compiler can't handle that. */
3537 if (code
== NE_EXPR
)
3539 if (max_lt
|| min_gt
)
3540 val
= truthvalue_true_node
;
3542 else if (code
== EQ_EXPR
)
3544 if (max_lt
|| min_gt
)
3545 val
= truthvalue_false_node
;
3547 else if (code
== LT_EXPR
)
3550 val
= truthvalue_true_node
;
3552 val
= truthvalue_false_node
;
3554 else if (code
== GT_EXPR
)
3557 val
= truthvalue_true_node
;
3559 val
= truthvalue_false_node
;
3561 else if (code
== LE_EXPR
)
3564 val
= truthvalue_true_node
;
3566 val
= truthvalue_false_node
;
3568 else if (code
== GE_EXPR
)
3571 val
= truthvalue_true_node
;
3573 val
= truthvalue_false_node
;
3576 /* If primop0 was sign-extended and unsigned comparison specd,
3577 we did a signed comparison above using the signed type bounds.
3578 But the comparison we output must be unsigned.
3580 Also, for inequalities, VAL is no good; but if the signed
3581 comparison had *any* fixed result, it follows that the
3582 unsigned comparison just tests the sign in reverse
3583 (positive values are LE, negative ones GE).
3584 So we can generate an unsigned comparison
3585 against an extreme value of the signed type. */
3587 if (unsignedp
&& !unsignedp0
)
3594 primop1
= TYPE_MIN_VALUE (type
);
3600 primop1
= TYPE_MAX_VALUE (type
);
3607 type
= c_common_unsigned_type (type
);
3610 if (TREE_CODE (primop0
) != INTEGER_CST
)
3612 if (val
== truthvalue_false_node
)
3613 warning (OPT_Wtype_limits
, "comparison is always false due to limited range of data type");
3614 if (val
== truthvalue_true_node
)
3615 warning (OPT_Wtype_limits
, "comparison is always true due to limited range of data type");
3620 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3621 if (TREE_SIDE_EFFECTS (primop0
))
3622 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
3626 /* Value is not predetermined, but do the comparison
3627 in the type of the operand that is not constant.
3628 TYPE is already properly set. */
3631 /* If either arg is decimal float and the other is float, find the
3632 proper common type to use for comparison. */
3633 else if (real1
&& real2
3634 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
3635 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
3636 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3638 else if (real1
&& real2
3639 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3640 == TYPE_PRECISION (TREE_TYPE (primop1
))))
3641 type
= TREE_TYPE (primop0
);
3643 /* If args' natural types are both narrower than nominal type
3644 and both extend in the same manner, compare them
3645 in the type of the wider arg.
3646 Otherwise must actually extend both to the nominal
3647 common type lest different ways of extending
3649 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3651 else if (unsignedp0
== unsignedp1
&& real1
== real2
3652 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
3653 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
3655 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3656 type
= c_common_signed_or_unsigned_type (unsignedp0
3657 || TYPE_UNSIGNED (*restype_ptr
),
3659 /* Make sure shorter operand is extended the right way
3660 to match the longer operand. */
3662 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
3663 TREE_TYPE (primop0
)),
3666 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
3667 TREE_TYPE (primop1
)),
3672 /* Here we must do the comparison on the nominal type
3673 using the args exactly as we received them. */
3674 type
= *restype_ptr
;
3678 if (!real1
&& !real2
&& integer_zerop (primop1
)
3679 && TYPE_UNSIGNED (*restype_ptr
))
3685 /* All unsigned values are >= 0, so we warn. However,
3686 if OP0 is a constant that is >= 0, the signedness of
3687 the comparison isn't an issue, so suppress the
3689 if (warn_type_limits
&& !in_system_header
3690 && !(TREE_CODE (primop0
) == INTEGER_CST
3691 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3693 warning (OPT_Wtype_limits
,
3694 "comparison of unsigned expression >= 0 is always true");
3695 value
= truthvalue_true_node
;
3699 if (warn_type_limits
&& !in_system_header
3700 && !(TREE_CODE (primop0
) == INTEGER_CST
3701 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3703 warning (OPT_Wtype_limits
,
3704 "comparison of unsigned expression < 0 is always false");
3705 value
= truthvalue_false_node
;
3714 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3715 if (TREE_SIDE_EFFECTS (primop0
))
3716 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3723 *op0_ptr
= convert (type
, primop0
);
3724 *op1_ptr
= convert (type
, primop1
);
3726 *restype_ptr
= truthvalue_type_node
;
3731 /* Return a tree for the sum or difference (RESULTCODE says which)
3732 of pointer PTROP and integer INTOP. */
3735 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
3736 tree ptrop
, tree intop
)
3740 /* The result is a pointer of the same type that is being added. */
3741 tree result_type
= TREE_TYPE (ptrop
);
3743 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3745 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3746 "pointer of type %<void *%> used in arithmetic");
3747 size_exp
= integer_one_node
;
3749 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3751 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3752 "pointer to a function used in arithmetic");
3753 size_exp
= integer_one_node
;
3755 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
3757 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3758 "pointer to member function used in arithmetic");
3759 size_exp
= integer_one_node
;
3762 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
3764 /* We are manipulating pointer values, so we don't need to warn
3765 about relying on undefined signed overflow. We disable the
3766 warning here because we use integer types so fold won't know that
3767 they are really pointers. */
3768 fold_defer_overflow_warnings ();
3770 /* If what we are about to multiply by the size of the elements
3771 contains a constant term, apply distributive law
3772 and multiply that constant term separately.
3773 This helps produce common subexpressions. */
3774 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3775 && !TREE_CONSTANT (intop
)
3776 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3777 && TREE_CONSTANT (size_exp
)
3778 /* If the constant comes from pointer subtraction,
3779 skip this optimization--it would cause an error. */
3780 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3781 /* If the constant is unsigned, and smaller than the pointer size,
3782 then we must skip this optimization. This is because it could cause
3783 an overflow error if the constant is negative but INTOP is not. */
3784 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3785 || (TYPE_PRECISION (TREE_TYPE (intop
))
3786 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3788 enum tree_code subcode
= resultcode
;
3789 tree int_type
= TREE_TYPE (intop
);
3790 if (TREE_CODE (intop
) == MINUS_EXPR
)
3791 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3792 /* Convert both subexpression types to the type of intop,
3793 because weird cases involving pointer arithmetic
3794 can result in a sum or difference with different type args. */
3795 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3797 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3798 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3801 /* Convert the integer argument to a type the same size as sizetype
3802 so the multiply won't overflow spuriously. */
3803 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3804 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3805 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3806 TYPE_UNSIGNED (sizetype
)), intop
);
3808 /* Replace the integer argument with a suitable product by the object size.
3809 Do this multiplication as signed, then convert to the appropriate type
3810 for the pointer operation and disregard an overflow that occured only
3811 because of the sign-extension change in the latter conversion. */
3813 tree t
= build_binary_op (loc
,
3815 convert (TREE_TYPE (intop
), size_exp
), 1);
3816 intop
= convert (sizetype
, t
);
3817 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
3818 intop
= build_int_cst_wide (TREE_TYPE (intop
), TREE_INT_CST_LOW (intop
),
3819 TREE_INT_CST_HIGH (intop
));
3822 /* Create the sum or difference. */
3823 if (resultcode
== MINUS_EXPR
)
3824 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
3826 ret
= fold_build2_loc (loc
, POINTER_PLUS_EXPR
, result_type
, ptrop
, intop
);
3828 fold_undefer_and_ignore_overflow_warnings ();
3833 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3834 and if NON_CONST is known not to be permitted in an evaluated part
3835 of a constant expression. */
3838 c_wrap_maybe_const (tree expr
, bool non_const
)
3840 bool nowarning
= TREE_NO_WARNING (expr
);
3841 location_t loc
= EXPR_LOCATION (expr
);
3843 /* This should never be called for C++. */
3844 if (c_dialect_cxx ())
3847 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3848 STRIP_TYPE_NOPS (expr
);
3849 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
3850 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
3852 TREE_NO_WARNING (expr
) = 1;
3853 protected_set_expr_location (expr
, loc
);
3858 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3859 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3860 around the SAVE_EXPR if needed so that c_fully_fold does not need
3861 to look inside SAVE_EXPRs. */
3864 c_save_expr (tree expr
)
3866 bool maybe_const
= true;
3867 if (c_dialect_cxx ())
3868 return save_expr (expr
);
3869 expr
= c_fully_fold (expr
, false, &maybe_const
);
3870 expr
= save_expr (expr
);
3872 expr
= c_wrap_maybe_const (expr
, true);
3876 /* Return whether EXPR is a declaration whose address can never be
3880 decl_with_nonnull_addr_p (const_tree expr
)
3882 return (DECL_P (expr
)
3883 && (TREE_CODE (expr
) == PARM_DECL
3884 || TREE_CODE (expr
) == LABEL_DECL
3885 || !DECL_WEAK (expr
)));
3888 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3889 or for an `if' or `while' statement or ?..: exp. It should already
3890 have been validated to be of suitable type; otherwise, a bad
3891 diagnostic may result.
3893 The EXPR is located at LOCATION.
3895 This preparation consists of taking the ordinary
3896 representation of an expression expr and producing a valid tree
3897 boolean expression describing whether expr is nonzero. We could
3898 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3899 but we optimize comparisons, &&, ||, and !.
3901 The resulting type should always be `truthvalue_type_node'. */
3904 c_common_truthvalue_conversion (location_t location
, tree expr
)
3906 switch (TREE_CODE (expr
))
3908 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3909 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3910 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3911 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3912 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3914 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3915 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3918 case TRUTH_ANDIF_EXPR
:
3919 case TRUTH_ORIF_EXPR
:
3920 case TRUTH_AND_EXPR
:
3922 case TRUTH_XOR_EXPR
:
3923 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3925 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3926 c_common_truthvalue_conversion (location
,
3927 TREE_OPERAND (expr
, 0)),
3928 c_common_truthvalue_conversion (location
,
3929 TREE_OPERAND (expr
, 1)));
3932 case TRUTH_NOT_EXPR
:
3933 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3935 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
3936 c_common_truthvalue_conversion (location
,
3937 TREE_OPERAND (expr
, 0)));
3944 return integer_zerop (expr
) ? truthvalue_false_node
3945 : truthvalue_true_node
;
3948 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3949 ? truthvalue_true_node
3950 : truthvalue_false_node
;
3953 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3954 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3955 ? truthvalue_true_node
3956 : truthvalue_false_node
;
3959 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
3964 tree inner
= TREE_OPERAND (expr
, 0);
3965 if (decl_with_nonnull_addr_p (inner
))
3967 /* Common Ada/Pascal programmer's mistake. */
3968 warning_at (location
,
3970 "the address of %qD will always evaluate as %<true%>",
3972 return truthvalue_true_node
;
3975 /* If we still have a decl, it is possible for its address to
3976 be NULL, so we cannot optimize. */
3979 gcc_assert (DECL_WEAK (inner
));
3983 if (TREE_SIDE_EFFECTS (inner
))
3985 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3986 inner
, truthvalue_true_node
);
3990 return truthvalue_true_node
;
3994 expr
= build_binary_op (EXPR_LOCATION (expr
),
3995 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3996 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3997 c_common_truthvalue_conversion (location
,
3998 TREE_OPERAND (expr
, 0)),
3999 c_common_truthvalue_conversion (location
,
4000 TREE_OPERAND (expr
, 1)),
4007 case EXCESS_PRECISION_EXPR
:
4008 /* These don't change whether an object is nonzero or zero. */
4009 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
4013 /* These don't change whether an object is zero or nonzero, but
4014 we can't ignore them if their second arg has side-effects. */
4015 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
4017 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
4018 TREE_OPERAND (expr
, 1),
4019 c_common_truthvalue_conversion
4020 (location
, TREE_OPERAND (expr
, 0)));
4024 return c_common_truthvalue_conversion (location
,
4025 TREE_OPERAND (expr
, 0));
4028 /* Distribute the conversion into the arms of a COND_EXPR. */
4029 if (c_dialect_cxx ())
4031 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4032 TREE_OPERAND (expr
, 0),
4033 c_common_truthvalue_conversion (location
,
4036 c_common_truthvalue_conversion (location
,
4043 /* Folding will happen later for C. */
4044 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4045 TREE_OPERAND (expr
, 0),
4046 c_common_truthvalue_conversion (location
,
4047 TREE_OPERAND (expr
, 1)),
4048 c_common_truthvalue_conversion (location
,
4049 TREE_OPERAND (expr
, 2)));
4054 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4055 since that affects how `default_conversion' will behave. */
4056 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
4057 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
4059 /* If this is widening the argument, we can ignore it. */
4060 if (TYPE_PRECISION (TREE_TYPE (expr
))
4061 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
4062 return c_common_truthvalue_conversion (location
,
4063 TREE_OPERAND (expr
, 0));
4067 if (!TREE_NO_WARNING (expr
)
4068 && warn_parentheses
)
4070 warning (OPT_Wparentheses
,
4071 "suggest parentheses around assignment used as truth value");
4072 TREE_NO_WARNING (expr
) = 1;
4080 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4082 tree t
= c_save_expr (expr
);
4083 expr
= (build_binary_op
4084 (EXPR_LOCATION (expr
),
4085 (TREE_SIDE_EFFECTS (expr
)
4086 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4087 c_common_truthvalue_conversion
4089 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
4090 c_common_truthvalue_conversion
4092 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
4097 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4099 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4101 (TREE_TYPE (expr
))));
4102 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4105 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4108 protected_set_expr_location (expr
, location
);
4112 static void def_builtin_1 (enum built_in_function fncode
,
4114 enum built_in_class fnclass
,
4115 tree fntype
, tree libtype
,
4116 bool both_p
, bool fallback_p
, bool nonansi_p
,
4117 tree fnattrs
, bool implicit_p
);
4120 /* Apply the TYPE_QUALS to the new DECL. */
4123 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4125 tree type
= TREE_TYPE (decl
);
4127 if (type
== error_mark_node
)
4130 if (((type_quals
& TYPE_QUAL_CONST
)
4131 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4132 /* An object declared 'const' is only readonly after it is
4133 initialized. We don't have any way of expressing this currently,
4134 so we need to be conservative and unset TREE_READONLY for types
4135 with constructors. Otherwise aliasing code will ignore stores in
4136 an inline constructor. */
4137 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
4138 TREE_READONLY (decl
) = 1;
4139 if (type_quals
& TYPE_QUAL_VOLATILE
)
4141 TREE_SIDE_EFFECTS (decl
) = 1;
4142 TREE_THIS_VOLATILE (decl
) = 1;
4144 if (type_quals
& TYPE_QUAL_RESTRICT
)
4146 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4147 /* Allow 'restrict' on arrays of pointers.
4148 FIXME currently we just ignore it. */
4149 type
= TREE_TYPE (type
);
4151 || !POINTER_TYPE_P (type
)
4152 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4153 error ("invalid use of %<restrict%>");
4157 /* Hash function for the problem of multiple type definitions in
4158 different files. This must hash all types that will compare
4159 equal via comptypes to the same value. In practice it hashes
4160 on some of the simple stuff and leaves the details to comptypes. */
4163 c_type_hash (const void *p
)
4167 const_tree
const t
= (const_tree
) p
;
4169 switch (TREE_CODE (t
))
4171 /* For pointers, hash on pointee type plus some swizzling. */
4173 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
4174 /* Hash on number of elements and total size. */
4177 t2
= TYPE_VALUES (t
);
4181 t2
= TYPE_FIELDS (t
);
4183 case QUAL_UNION_TYPE
:
4185 t2
= TYPE_FIELDS (t
);
4189 t2
= TYPE_FIELDS (t
);
4194 for (; t2
; t2
= TREE_CHAIN (t2
))
4196 /* We might have a VLA here. */
4197 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4200 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4201 return ((size
<< 24) | (i
<< shift
));
4204 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
4206 /* Return the typed-based alias set for T, which may be an expression
4207 or a type. Return -1 if we don't do anything special. */
4210 c_common_get_alias_set (tree t
)
4215 /* For VLAs, use the alias set of the element type rather than the
4216 default of alias set 0 for types compared structurally. */
4217 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4219 if (TREE_CODE (t
) == ARRAY_TYPE
)
4220 return get_alias_set (TREE_TYPE (t
));
4224 /* Permit type-punning when accessing a union, provided the access
4225 is directly through the union. For example, this code does not
4226 permit taking the address of a union member and then storing
4227 through it. Even the type-punning allowed here is a GCC
4228 extension, albeit a common and useful one; the C standard says
4229 that such accesses have implementation-defined behavior. */
4231 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
4232 u
= TREE_OPERAND (u
, 0))
4233 if (TREE_CODE (u
) == COMPONENT_REF
4234 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
4237 /* That's all the expressions we handle specially. */
4241 /* The C standard guarantees that any object may be accessed via an
4242 lvalue that has character type. */
4243 if (t
== char_type_node
4244 || t
== signed_char_type_node
4245 || t
== unsigned_char_type_node
)
4248 /* The C standard specifically allows aliasing between signed and
4249 unsigned variants of the same type. We treat the signed
4250 variant as canonical. */
4251 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4253 tree t1
= c_common_signed_type (t
);
4255 /* t1 == t can happen for boolean nodes which are always unsigned. */
4257 return get_alias_set (t1
);
4259 else if (POINTER_TYPE_P (t
))
4263 /* Unfortunately, there is no canonical form of a pointer type.
4264 In particular, if we have `typedef int I', then `int *', and
4265 `I *' are different types. So, we have to pick a canonical
4266 representative. We do this below.
4268 Technically, this approach is actually more conservative that
4269 it needs to be. In particular, `const int *' and `int *'
4270 should be in different alias sets, according to the C and C++
4271 standard, since their types are not the same, and so,
4272 technically, an `int **' and `const int **' cannot point at
4275 But, the standard is wrong. In particular, this code is
4280 const int* const* cipp = ipp;
4282 And, it doesn't make sense for that to be legal unless you
4283 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
4284 the pointed-to types. This issue has been reported to the
4286 t1
= build_type_no_quals (t
);
4288 return get_alias_set (t1
);
4291 /* Handle the case of multiple type nodes referring to "the same" type,
4292 which occurs with IMA. These share an alias set. FIXME: Currently only
4293 C90 is handled. (In C99 type compatibility is not transitive, which
4294 complicates things mightily. The alias set splay trees can theoretically
4295 represent this, but insertion is tricky when you consider all the
4296 different orders things might arrive in.) */
4298 if (c_language
!= clk_c
|| flag_isoc99
)
4301 /* Save time if there's only one input file. */
4302 if (num_in_fnames
== 1)
4305 /* Pointers need special handling if they point to any type that
4306 needs special handling (below). */
4307 if (TREE_CODE (t
) == POINTER_TYPE
)
4310 /* Find bottom type under any nested POINTERs. */
4311 for (t2
= TREE_TYPE (t
);
4312 TREE_CODE (t2
) == POINTER_TYPE
;
4313 t2
= TREE_TYPE (t2
))
4315 if (TREE_CODE (t2
) != RECORD_TYPE
4316 && TREE_CODE (t2
) != ENUMERAL_TYPE
4317 && TREE_CODE (t2
) != QUAL_UNION_TYPE
4318 && TREE_CODE (t2
) != UNION_TYPE
)
4320 if (TYPE_SIZE (t2
) == 0)
4323 /* These are the only cases that need special handling. */
4324 if (TREE_CODE (t
) != RECORD_TYPE
4325 && TREE_CODE (t
) != ENUMERAL_TYPE
4326 && TREE_CODE (t
) != QUAL_UNION_TYPE
4327 && TREE_CODE (t
) != UNION_TYPE
4328 && TREE_CODE (t
) != POINTER_TYPE
)
4331 if (TYPE_SIZE (t
) == 0)
4334 /* Look up t in hash table. Only one of the compatible types within each
4335 alias set is recorded in the table. */
4336 if (!type_hash_table
)
4337 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
4338 (htab_eq
) lang_hooks
.types_compatible_p
,
4340 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
4343 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4344 return TYPE_ALIAS_SET ((tree
)*slot
);
4347 /* Our caller will assign and record (in t) a new alias set; all we need
4348 to do is remember t in the hash table. */
4354 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4355 the second parameter indicates which OPERATOR is being applied.
4356 The COMPLAIN flag controls whether we should diagnose possibly
4357 ill-formed constructs or not. LOC is the location of the SIZEOF or
4361 c_sizeof_or_alignof_type (location_t loc
,
4362 tree type
, bool is_sizeof
, int complain
)
4364 const char *op_name
;
4366 enum tree_code type_code
= TREE_CODE (type
);
4368 op_name
= is_sizeof
? "sizeof" : "__alignof__";
4370 if (type_code
== FUNCTION_TYPE
)
4374 if (complain
&& (pedantic
|| warn_pointer_arith
))
4375 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
4376 "invalid application of %<sizeof%> to a function type");
4378 return error_mark_node
;
4379 value
= size_one_node
;
4382 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
4384 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
4386 if (type_code
== VOID_TYPE
4387 && complain
&& (pedantic
|| warn_pointer_arith
))
4388 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
4389 "invalid application of %qs to a void type", op_name
);
4391 return error_mark_node
;
4392 value
= size_one_node
;
4394 else if (!COMPLETE_TYPE_P (type
))
4397 error_at (loc
, "invalid application of %qs to incomplete type %qT ",
4399 return error_mark_node
;
4404 /* Convert in case a char is more than one unit. */
4405 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
4406 size_int (TYPE_PRECISION (char_type_node
)
4409 value
= size_int (TYPE_ALIGN_UNIT (type
));
4412 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4413 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4414 never happen. However, this node should really have type
4415 `size_t', which is just a typedef for an ordinary integer type. */
4416 value
= fold_convert_loc (loc
, size_type_node
, value
);
4417 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
4422 /* Implement the __alignof keyword: Return the minimum required
4423 alignment of EXPR, measured in bytes. For VAR_DECLs,
4424 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4425 from an "aligned" __attribute__ specification). LOC is the
4426 location of the ALIGNOF operator. */
4429 c_alignof_expr (location_t loc
, tree expr
)
4433 if (VAR_OR_FUNCTION_DECL_P (expr
))
4434 t
= size_int (DECL_ALIGN_UNIT (expr
));
4436 else if (TREE_CODE (expr
) == COMPONENT_REF
4437 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
4439 error_at (loc
, "%<__alignof%> applied to a bit-field");
4442 else if (TREE_CODE (expr
) == COMPONENT_REF
4443 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
4444 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
4446 else if (TREE_CODE (expr
) == INDIRECT_REF
)
4448 tree t
= TREE_OPERAND (expr
, 0);
4450 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
4452 while (CONVERT_EXPR_P (t
)
4453 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
4457 t
= TREE_OPERAND (t
, 0);
4458 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
4459 if (thisalign
> bestalign
)
4460 best
= t
, bestalign
= thisalign
;
4462 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
4465 return c_alignof (loc
, TREE_TYPE (expr
));
4467 return fold_convert_loc (loc
, size_type_node
, t
);
4470 /* Handle C and C++ default attributes. */
4472 enum built_in_attribute
4474 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4475 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4476 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4477 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4478 #include "builtin-attrs.def"
4479 #undef DEF_ATTR_NULL_TREE
4481 #undef DEF_ATTR_IDENT
4482 #undef DEF_ATTR_TREE_LIST
4486 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
4488 static void c_init_attributes (void);
4492 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4493 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4494 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4495 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4496 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4497 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4498 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4499 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4500 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4501 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4502 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4503 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4504 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4505 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4506 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4508 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4509 #include "builtin-types.def"
4510 #undef DEF_PRIMITIVE_TYPE
4511 #undef DEF_FUNCTION_TYPE_0
4512 #undef DEF_FUNCTION_TYPE_1
4513 #undef DEF_FUNCTION_TYPE_2
4514 #undef DEF_FUNCTION_TYPE_3
4515 #undef DEF_FUNCTION_TYPE_4
4516 #undef DEF_FUNCTION_TYPE_5
4517 #undef DEF_FUNCTION_TYPE_6
4518 #undef DEF_FUNCTION_TYPE_7
4519 #undef DEF_FUNCTION_TYPE_VAR_0
4520 #undef DEF_FUNCTION_TYPE_VAR_1
4521 #undef DEF_FUNCTION_TYPE_VAR_2
4522 #undef DEF_FUNCTION_TYPE_VAR_3
4523 #undef DEF_FUNCTION_TYPE_VAR_4
4524 #undef DEF_FUNCTION_TYPE_VAR_5
4525 #undef DEF_POINTER_TYPE
4529 typedef enum c_builtin_type builtin_type
;
4531 /* A temporary array for c_common_nodes_and_builtins. Used in
4532 communication with def_fn_type. */
4533 static tree builtin_types
[(int) BT_LAST
+ 1];
4535 /* A helper function for c_common_nodes_and_builtins. Build function type
4536 for DEF with return type RET and N arguments. If VAR is true, then the
4537 function should be variadic after those N arguments.
4539 Takes special care not to ICE if any of the types involved are
4540 error_mark_node, which indicates that said type is not in fact available
4541 (see builtin_type_for_size). In which case the function type as a whole
4542 should be error_mark_node. */
4545 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
4547 tree args
= NULL
, t
;
4552 for (i
= 0; i
< n
; ++i
)
4554 builtin_type a
= (builtin_type
) va_arg (list
, int);
4555 t
= builtin_types
[a
];
4556 if (t
== error_mark_node
)
4558 args
= tree_cons (NULL_TREE
, t
, args
);
4562 args
= nreverse (args
);
4564 args
= chainon (args
, void_list_node
);
4566 t
= builtin_types
[ret
];
4567 if (t
== error_mark_node
)
4569 t
= build_function_type (t
, args
);
4572 builtin_types
[def
] = t
;
4575 /* Build builtin functions common to both C and C++ language
4579 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
4581 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4582 builtin_types[ENUM] = VALUE;
4583 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4584 def_fn_type (ENUM, RETURN, 0, 0);
4585 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4586 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4587 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4588 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4589 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4590 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4591 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4592 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4593 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4594 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4595 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4597 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4598 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4600 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4601 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4602 def_fn_type (ENUM, RETURN, 1, 0);
4603 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4604 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4605 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4606 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4607 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4608 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4609 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4610 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4611 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4612 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4613 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4614 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4616 #include "builtin-types.def"
4618 #undef DEF_PRIMITIVE_TYPE
4619 #undef DEF_FUNCTION_TYPE_1
4620 #undef DEF_FUNCTION_TYPE_2
4621 #undef DEF_FUNCTION_TYPE_3
4622 #undef DEF_FUNCTION_TYPE_4
4623 #undef DEF_FUNCTION_TYPE_5
4624 #undef DEF_FUNCTION_TYPE_6
4625 #undef DEF_FUNCTION_TYPE_VAR_0
4626 #undef DEF_FUNCTION_TYPE_VAR_1
4627 #undef DEF_FUNCTION_TYPE_VAR_2
4628 #undef DEF_FUNCTION_TYPE_VAR_3
4629 #undef DEF_FUNCTION_TYPE_VAR_4
4630 #undef DEF_FUNCTION_TYPE_VAR_5
4631 #undef DEF_POINTER_TYPE
4632 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4634 c_init_attributes ();
4636 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4637 NONANSI_P, ATTRS, IMPLICIT, COND) \
4639 def_builtin_1 (ENUM, NAME, CLASS, \
4640 builtin_types[(int) TYPE], \
4641 builtin_types[(int) LIBTYPE], \
4642 BOTH_P, FALLBACK_P, NONANSI_P, \
4643 built_in_attributes[(int) ATTRS], IMPLICIT);
4644 #include "builtins.def"
4647 targetm
.init_builtins ();
4649 build_common_builtin_nodes ();
4655 /* Like get_identifier, but avoid warnings about null arguments when
4656 the argument may be NULL for targets where GCC lacks stdint.h type
4660 c_get_ident (const char *id
)
4662 return get_identifier (id
);
4665 /* Build tree nodes and builtin functions common to both C and C++ language
4669 c_common_nodes_and_builtins (void)
4671 int char16_type_size
;
4672 int char32_type_size
;
4673 int wchar_type_size
;
4674 tree array_domain_type
;
4675 tree va_list_ref_type_node
;
4676 tree va_list_arg_type_node
;
4678 /* Define `int' and `char' first so that dbx will output them first. */
4679 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
4680 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4682 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4683 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4684 but not C. Are the conditionals here needed? */
4685 if (c_dialect_cxx ())
4686 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
4687 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4688 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4689 record_builtin_type (RID_MAX
, "long unsigned int",
4690 long_unsigned_type_node
);
4691 if (c_dialect_cxx ())
4692 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4693 record_builtin_type (RID_MAX
, "long long int",
4694 long_long_integer_type_node
);
4695 record_builtin_type (RID_MAX
, "long long unsigned int",
4696 long_long_unsigned_type_node
);
4697 if (c_dialect_cxx ())
4698 record_builtin_type (RID_MAX
, "long long unsigned",
4699 long_long_unsigned_type_node
);
4700 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4701 record_builtin_type (RID_MAX
, "short unsigned int",
4702 short_unsigned_type_node
);
4703 if (c_dialect_cxx ())
4704 record_builtin_type (RID_MAX
, "unsigned short",
4705 short_unsigned_type_node
);
4707 /* Define both `signed char' and `unsigned char'. */
4708 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4709 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4711 /* These are types that c_common_type_for_size and
4712 c_common_type_for_mode use. */
4713 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4714 TYPE_DECL
, NULL_TREE
,
4716 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4717 TYPE_DECL
, NULL_TREE
,
4719 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4720 TYPE_DECL
, NULL_TREE
,
4722 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4723 TYPE_DECL
, NULL_TREE
,
4725 #if HOST_BITS_PER_WIDE_INT >= 64
4726 if (targetm
.scalar_mode_supported_p (TImode
))
4727 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4729 get_identifier ("__int128_t"),
4732 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4733 TYPE_DECL
, NULL_TREE
,
4734 unsigned_intQI_type_node
));
4735 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4736 TYPE_DECL
, NULL_TREE
,
4737 unsigned_intHI_type_node
));
4738 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4739 TYPE_DECL
, NULL_TREE
,
4740 unsigned_intSI_type_node
));
4741 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4742 TYPE_DECL
, NULL_TREE
,
4743 unsigned_intDI_type_node
));
4744 #if HOST_BITS_PER_WIDE_INT >= 64
4745 if (targetm
.scalar_mode_supported_p (TImode
))
4746 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4748 get_identifier ("__uint128_t"),
4749 unsigned_intTI_type_node
));
4752 /* Create the widest literal types. */
4753 widest_integer_literal_type_node
4754 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
4755 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4756 TYPE_DECL
, NULL_TREE
,
4757 widest_integer_literal_type_node
));
4759 widest_unsigned_literal_type_node
4760 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
4761 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4762 TYPE_DECL
, NULL_TREE
,
4763 widest_unsigned_literal_type_node
));
4765 /* `unsigned long' is the standard type for sizeof.
4766 Note that stddef.h uses `unsigned long',
4767 and this must agree, even if long and int are the same size. */
4769 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
4770 signed_size_type_node
= c_common_signed_type (size_type_node
);
4771 set_sizetype (size_type_node
);
4774 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4776 build_common_tree_nodes_2 (flag_short_double
);
4778 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4779 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4780 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4782 /* Only supported decimal floating point extension if the target
4783 actually supports underlying modes. */
4784 if (targetm
.scalar_mode_supported_p (SDmode
)
4785 && targetm
.scalar_mode_supported_p (DDmode
)
4786 && targetm
.scalar_mode_supported_p (TDmode
))
4788 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4789 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4790 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4793 if (targetm
.fixed_point_supported_p ())
4795 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4796 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4797 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4798 record_builtin_type (RID_MAX
, "long long _Fract",
4799 long_long_fract_type_node
);
4800 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4801 unsigned_short_fract_type_node
);
4802 record_builtin_type (RID_MAX
, "unsigned _Fract",
4803 unsigned_fract_type_node
);
4804 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4805 unsigned_long_fract_type_node
);
4806 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4807 unsigned_long_long_fract_type_node
);
4808 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4809 sat_short_fract_type_node
);
4810 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4811 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4812 sat_long_fract_type_node
);
4813 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4814 sat_long_long_fract_type_node
);
4815 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4816 sat_unsigned_short_fract_type_node
);
4817 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4818 sat_unsigned_fract_type_node
);
4819 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4820 sat_unsigned_long_fract_type_node
);
4821 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4822 sat_unsigned_long_long_fract_type_node
);
4823 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4824 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4825 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4826 record_builtin_type (RID_MAX
, "long long _Accum",
4827 long_long_accum_type_node
);
4828 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4829 unsigned_short_accum_type_node
);
4830 record_builtin_type (RID_MAX
, "unsigned _Accum",
4831 unsigned_accum_type_node
);
4832 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4833 unsigned_long_accum_type_node
);
4834 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4835 unsigned_long_long_accum_type_node
);
4836 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4837 sat_short_accum_type_node
);
4838 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4839 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4840 sat_long_accum_type_node
);
4841 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4842 sat_long_long_accum_type_node
);
4843 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4844 sat_unsigned_short_accum_type_node
);
4845 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4846 sat_unsigned_accum_type_node
);
4847 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4848 sat_unsigned_long_accum_type_node
);
4849 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4850 sat_unsigned_long_long_accum_type_node
);
4854 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4856 get_identifier ("complex int"),
4857 complex_integer_type_node
));
4858 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4860 get_identifier ("complex float"),
4861 complex_float_type_node
));
4862 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4864 get_identifier ("complex double"),
4865 complex_double_type_node
));
4866 lang_hooks
.decls
.pushdecl
4867 (build_decl (UNKNOWN_LOCATION
,
4868 TYPE_DECL
, get_identifier ("complex long double"),
4869 complex_long_double_type_node
));
4871 if (c_dialect_cxx ())
4872 /* For C++, make fileptr_type_node a distinct void * type until
4873 FILE type is defined. */
4874 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4876 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4878 /* Set the TYPE_NAME for any variants that were built before
4879 record_builtin_type gave names to the built-in types. */
4881 tree void_name
= TYPE_NAME (void_type_node
);
4882 TYPE_NAME (void_type_node
) = NULL_TREE
;
4883 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4885 TYPE_NAME (void_type_node
) = void_name
;
4888 /* This node must not be shared. */
4889 void_zero_node
= make_node (INTEGER_CST
);
4890 TREE_TYPE (void_zero_node
) = void_type_node
;
4892 void_list_node
= build_void_list_node ();
4894 /* Make a type to be the domain of a few array types
4895 whose domains don't really matter.
4896 200 is small enough that it always fits in size_t
4897 and large enough that it can hold most function names for the
4898 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4899 array_domain_type
= build_index_type (size_int (200));
4901 /* Make a type for arrays of characters.
4902 With luck nothing will ever really depend on the length of this
4904 char_array_type_node
4905 = build_array_type (char_type_node
, array_domain_type
);
4907 /* Likewise for arrays of ints. */
4909 = build_array_type (integer_type_node
, array_domain_type
);
4911 string_type_node
= build_pointer_type (char_type_node
);
4912 const_string_type_node
4913 = build_pointer_type (build_qualified_type
4914 (char_type_node
, TYPE_QUAL_CONST
));
4916 /* This is special for C++ so functions can be overloaded. */
4917 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4918 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4919 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4920 underlying_wchar_type_node
= wchar_type_node
;
4921 if (c_dialect_cxx ())
4923 if (TYPE_UNSIGNED (wchar_type_node
))
4924 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4926 wchar_type_node
= make_signed_type (wchar_type_size
);
4927 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4930 /* This is for wide string constants. */
4931 wchar_array_type_node
4932 = build_array_type (wchar_type_node
, array_domain_type
);
4934 /* Define 'char16_t'. */
4935 char16_type_node
= get_identifier (CHAR16_TYPE
);
4936 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4937 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4938 if (c_dialect_cxx ())
4940 char16_type_node
= make_unsigned_type (char16_type_size
);
4942 if (cxx_dialect
== cxx0x
)
4943 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4946 /* This is for UTF-16 string constants. */
4947 char16_array_type_node
4948 = build_array_type (char16_type_node
, array_domain_type
);
4950 /* Define 'char32_t'. */
4951 char32_type_node
= get_identifier (CHAR32_TYPE
);
4952 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4953 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4954 if (c_dialect_cxx ())
4956 char32_type_node
= make_unsigned_type (char32_type_size
);
4958 if (cxx_dialect
== cxx0x
)
4959 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4962 /* This is for UTF-32 string constants. */
4963 char32_array_type_node
4964 = build_array_type (char32_type_node
, array_domain_type
);
4967 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4970 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4972 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4974 if (SIG_ATOMIC_TYPE
)
4975 sig_atomic_type_node
=
4976 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
4979 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
4982 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
4985 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
4988 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
4991 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
4994 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
4996 c_uint32_type_node
=
4997 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
4999 c_uint64_type_node
=
5000 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
5001 if (INT_LEAST8_TYPE
)
5002 int_least8_type_node
=
5003 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
5004 if (INT_LEAST16_TYPE
)
5005 int_least16_type_node
=
5006 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
5007 if (INT_LEAST32_TYPE
)
5008 int_least32_type_node
=
5009 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
5010 if (INT_LEAST64_TYPE
)
5011 int_least64_type_node
=
5012 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
5013 if (UINT_LEAST8_TYPE
)
5014 uint_least8_type_node
=
5015 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
5016 if (UINT_LEAST16_TYPE
)
5017 uint_least16_type_node
=
5018 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
5019 if (UINT_LEAST32_TYPE
)
5020 uint_least32_type_node
=
5021 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
5022 if (UINT_LEAST64_TYPE
)
5023 uint_least64_type_node
=
5024 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
5026 int_fast8_type_node
=
5027 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
5028 if (INT_FAST16_TYPE
)
5029 int_fast16_type_node
=
5030 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
5031 if (INT_FAST32_TYPE
)
5032 int_fast32_type_node
=
5033 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
5034 if (INT_FAST64_TYPE
)
5035 int_fast64_type_node
=
5036 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
5037 if (UINT_FAST8_TYPE
)
5038 uint_fast8_type_node
=
5039 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
5040 if (UINT_FAST16_TYPE
)
5041 uint_fast16_type_node
=
5042 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
5043 if (UINT_FAST32_TYPE
)
5044 uint_fast32_type_node
=
5045 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5046 if (UINT_FAST64_TYPE
)
5047 uint_fast64_type_node
=
5048 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5051 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5054 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5056 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
5058 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5059 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5061 lang_hooks
.decls
.pushdecl
5062 (build_decl (UNKNOWN_LOCATION
,
5063 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5064 va_list_type_node
));
5065 #ifdef TARGET_ENUM_VA_LIST
5070 for (l
= 0; TARGET_ENUM_VA_LIST (l
, &pname
, &ptype
); ++l
)
5072 lang_hooks
.decls
.pushdecl
5073 (build_decl (UNKNOWN_LOCATION
,
5074 TYPE_DECL
, get_identifier (pname
),
5081 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5083 va_list_arg_type_node
= va_list_ref_type_node
=
5084 build_pointer_type (TREE_TYPE (va_list_type_node
));
5088 va_list_arg_type_node
= va_list_type_node
;
5089 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5092 if (!flag_preprocess_only
)
5093 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5095 main_identifier_node
= get_identifier ("main");
5097 /* Create the built-in __null node. It is important that this is
5099 null_node
= make_node (INTEGER_CST
);
5100 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5102 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5103 memset (builtin_types
, 0, sizeof (builtin_types
));
5106 /* The number of named compound-literals generated thus far. */
5107 static GTY(()) int compound_literal_number
;
5109 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5112 set_compound_literal_name (tree decl
)
5115 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5116 compound_literal_number
);
5117 compound_literal_number
++;
5118 DECL_NAME (decl
) = get_identifier (name
);
5122 build_va_arg (location_t loc
, tree expr
, tree type
)
5124 expr
= build1 (VA_ARG_EXPR
, type
, expr
);
5125 SET_EXPR_LOCATION (expr
, loc
);
5130 /* Linked list of disabled built-in functions. */
5132 typedef struct disabled_builtin
5135 struct disabled_builtin
*next
;
5137 static disabled_builtin
*disabled_builtins
= NULL
;
5139 static bool builtin_function_disabled_p (const char *);
5141 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5142 begins with "__builtin_", give an error. */
5145 disable_builtin_function (const char *name
)
5147 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5148 error ("cannot disable built-in function %qs", name
);
5151 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5152 new_disabled_builtin
->name
= name
;
5153 new_disabled_builtin
->next
= disabled_builtins
;
5154 disabled_builtins
= new_disabled_builtin
;
5159 /* Return true if the built-in function NAME has been disabled, false
5163 builtin_function_disabled_p (const char *name
)
5165 disabled_builtin
*p
;
5166 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
5168 if (strcmp (name
, p
->name
) == 0)
5175 /* Worker for DEF_BUILTIN.
5176 Possibly define a builtin function with one or two names.
5177 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5178 nonansi_p and flag_no_nonansi_builtin. */
5181 def_builtin_1 (enum built_in_function fncode
,
5183 enum built_in_class fnclass
,
5184 tree fntype
, tree libtype
,
5185 bool both_p
, bool fallback_p
, bool nonansi_p
,
5186 tree fnattrs
, bool implicit_p
)
5189 const char *libname
;
5191 if (fntype
== error_mark_node
)
5194 gcc_assert ((!both_p
&& !fallback_p
)
5195 || !strncmp (name
, "__builtin_",
5196 strlen ("__builtin_")));
5198 libname
= name
+ strlen ("__builtin_");
5199 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
5200 (fallback_p
? libname
: NULL
),
5203 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
5204 && !(nonansi_p
&& flag_no_nonansi_builtin
))
5205 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
5208 built_in_decls
[(int) fncode
] = decl
;
5210 implicit_built_in_decls
[(int) fncode
] = decl
;
5213 /* Nonzero if the type T promotes to int. This is (nearly) the
5214 integral promotions defined in ISO C99 6.3.1.1/2. */
5217 c_promoting_integer_type_p (const_tree t
)
5219 switch (TREE_CODE (t
))
5222 return (TYPE_MAIN_VARIANT (t
) == char_type_node
5223 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
5224 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
5225 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
5226 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
5227 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
5230 /* ??? Technically all enumerations not larger than an int
5231 promote to an int. But this is used along code paths
5232 that only want to notice a size change. */
5233 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
5243 /* Return 1 if PARMS specifies a fixed number of parameters
5244 and none of their types is affected by default promotions. */
5247 self_promoting_args_p (const_tree parms
)
5250 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
5252 tree type
= TREE_VALUE (t
);
5254 if (type
== error_mark_node
)
5257 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
5263 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
5266 if (c_promoting_integer_type_p (type
))
5272 /* Recursively remove any '*' or '&' operator from TYPE. */
5274 strip_pointer_operator (tree t
)
5276 while (POINTER_TYPE_P (t
))
5281 /* Recursively remove pointer or array type from TYPE. */
5283 strip_pointer_or_array_types (tree t
)
5285 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
5290 /* Used to compare case labels. K1 and K2 are actually tree nodes
5291 representing case labels, or NULL_TREE for a `default' label.
5292 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5293 K2, and 0 if K1 and K2 are equal. */
5296 case_compare (splay_tree_key k1
, splay_tree_key k2
)
5298 /* Consider a NULL key (such as arises with a `default' label) to be
5299 smaller than anything else. */
5305 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5308 /* Process a case label, located at LOC, for the range LOW_VALUE
5309 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5310 then this case label is actually a `default' label. If only
5311 HIGH_VALUE is NULL_TREE, then case label was declared using the
5312 usual C/C++ syntax, rather than the GNU case range extension.
5313 CASES is a tree containing all the case ranges processed so far;
5314 COND is the condition for the switch-statement itself. Returns the
5315 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5319 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
5320 tree low_value
, tree high_value
)
5325 splay_tree_node node
;
5327 /* Create the LABEL_DECL itself. */
5328 label
= create_artificial_label (loc
);
5330 /* If there was an error processing the switch condition, bail now
5331 before we get more confused. */
5332 if (!cond
|| cond
== error_mark_node
)
5335 if ((low_value
&& TREE_TYPE (low_value
)
5336 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
5337 || (high_value
&& TREE_TYPE (high_value
)
5338 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
5340 error_at (loc
, "pointers are not permitted as case values");
5344 /* Case ranges are a GNU extension. */
5346 pedwarn (loc
, OPT_pedantic
,
5347 "range expressions in switch statements are non-standard");
5349 type
= TREE_TYPE (cond
);
5352 low_value
= check_case_value (low_value
);
5353 low_value
= convert_and_check (type
, low_value
);
5354 if (low_value
== error_mark_node
)
5359 high_value
= check_case_value (high_value
);
5360 high_value
= convert_and_check (type
, high_value
);
5361 if (high_value
== error_mark_node
)
5365 if (low_value
&& high_value
)
5367 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5368 really a case range, even though it was written that way.
5369 Remove the HIGH_VALUE to simplify later processing. */
5370 if (tree_int_cst_equal (low_value
, high_value
))
5371 high_value
= NULL_TREE
;
5372 else if (!tree_int_cst_lt (low_value
, high_value
))
5373 warning_at (loc
, 0, "empty range specified");
5376 /* See if the case is in range of the type of the original testing
5377 expression. If both low_value and high_value are out of range,
5378 don't insert the case label and return NULL_TREE. */
5380 && !check_case_bounds (type
, orig_type
,
5381 &low_value
, high_value
? &high_value
: NULL
))
5384 /* Look up the LOW_VALUE in the table of case labels we already
5386 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
5387 /* If there was not an exact match, check for overlapping ranges.
5388 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5389 that's a `default' label and the only overlap is an exact match. */
5390 if (!node
&& (low_value
|| high_value
))
5392 splay_tree_node low_bound
;
5393 splay_tree_node high_bound
;
5395 /* Even though there wasn't an exact match, there might be an
5396 overlap between this case range and another case range.
5397 Since we've (inductively) not allowed any overlapping case
5398 ranges, we simply need to find the greatest low case label
5399 that is smaller that LOW_VALUE, and the smallest low case
5400 label that is greater than LOW_VALUE. If there is an overlap
5401 it will occur in one of these two ranges. */
5402 low_bound
= splay_tree_predecessor (cases
,
5403 (splay_tree_key
) low_value
);
5404 high_bound
= splay_tree_successor (cases
,
5405 (splay_tree_key
) low_value
);
5407 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5408 the LOW_VALUE, so there is no need to check unless the
5409 LOW_BOUND is in fact itself a case range. */
5411 && CASE_HIGH ((tree
) low_bound
->value
)
5412 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
5415 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5416 range is bigger than the low end of the current range, so we
5417 are only interested if the current range is a real range, and
5418 not an ordinary case label. */
5421 && (tree_int_cst_compare ((tree
) high_bound
->key
,
5426 /* If there was an overlap, issue an error. */
5429 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
5433 error_at (loc
, "duplicate (or overlapping) case value");
5434 error_at (DECL_SOURCE_LOCATION (duplicate
),
5435 "this is the first entry overlapping that value");
5439 error_at (loc
, "duplicate case value") ;
5440 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
5444 error_at (loc
, "multiple default labels in one switch");
5445 error_at (DECL_SOURCE_LOCATION (duplicate
),
5446 "this is the first default label");
5451 /* Add a CASE_LABEL to the statement-tree. */
5452 case_label
= add_stmt (build_case_label (loc
, low_value
, high_value
, label
));
5453 /* Register this case label in the splay tree. */
5454 splay_tree_insert (cases
,
5455 (splay_tree_key
) low_value
,
5456 (splay_tree_value
) case_label
);
5461 /* Add a label so that the back-end doesn't think that the beginning of
5462 the switch is unreachable. Note that we do not add a case label, as
5463 that just leads to duplicates and thence to failure later on. */
5466 tree t
= create_artificial_label (loc
);
5467 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
5469 return error_mark_node
;
5472 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5473 Used to verify that case values match up with enumerator values. */
5476 match_case_to_enum_1 (tree key
, tree type
, tree label
)
5478 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
5480 /* ??? Not working too hard to print the double-word value.
5481 Should perhaps be done with %lwd in the diagnostic routines? */
5482 if (TREE_INT_CST_HIGH (key
) == 0)
5483 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
5484 TREE_INT_CST_LOW (key
));
5485 else if (!TYPE_UNSIGNED (type
)
5486 && TREE_INT_CST_HIGH (key
) == -1
5487 && TREE_INT_CST_LOW (key
) != 0)
5488 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
5489 -TREE_INT_CST_LOW (key
));
5491 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
5492 (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (key
),
5493 (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (key
));
5495 if (TYPE_NAME (type
) == 0)
5496 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
5497 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
5498 "case value %qs not in enumerated type",
5501 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
5502 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
5503 "case value %qs not in enumerated type %qT",
5507 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5508 Used to verify that case values match up with enumerator values. */
5511 match_case_to_enum (splay_tree_node node
, void *data
)
5513 tree label
= (tree
) node
->value
;
5514 tree type
= (tree
) data
;
5516 /* Skip default case. */
5517 if (!CASE_LOW (label
))
5520 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5521 when we did our enum->case scan. Reset our scratch bit after. */
5522 if (!CASE_LOW_SEEN (label
))
5523 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
5525 CASE_LOW_SEEN (label
) = 0;
5527 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5528 not set, that means that CASE_HIGH did not appear when we did our
5529 enum->case scan. Reset our scratch bit after. */
5530 if (CASE_HIGH (label
))
5532 if (!CASE_HIGH_SEEN (label
))
5533 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
5535 CASE_HIGH_SEEN (label
) = 0;
5541 /* Handle -Wswitch*. Called from the front end after parsing the
5542 switch construct. */
5543 /* ??? Should probably be somewhere generic, since other languages
5544 besides C and C++ would want this. At the moment, however, C/C++
5545 are the only tree-ssa languages that support enumerations at all,
5546 so the point is moot. */
5549 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
5550 tree type
, tree cond
)
5552 splay_tree_node default_node
;
5553 splay_tree_node node
;
5556 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
5559 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
5561 warning_at (switch_location
, OPT_Wswitch_default
,
5562 "switch missing default case");
5564 /* From here on, we only care about about enumerated types. */
5565 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
5568 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5569 if (!warn_switch_enum
&& !warn_switch
)
5572 /* Check the cases. Warn about case values which are not members of
5573 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5574 there is no default case, check that exactly all enumeration
5575 literals are covered by the cases. */
5577 /* Clearing COND if it is not an integer constant simplifies
5578 the tests inside the loop below. */
5579 if (TREE_CODE (cond
) != INTEGER_CST
)
5582 /* The time complexity here is O(N*lg(N)) worst case, but for the
5583 common case of monotonically increasing enumerators, it is
5584 O(N), since the nature of the splay tree will keep the next
5585 element adjacent to the root at all times. */
5587 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
5589 tree value
= TREE_VALUE (chain
);
5590 if (TREE_CODE (value
) == CONST_DECL
)
5591 value
= DECL_INITIAL (value
);
5592 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
5595 /* Mark the CASE_LOW part of the case entry as seen. */
5596 tree label
= (tree
) node
->value
;
5597 CASE_LOW_SEEN (label
) = 1;
5601 /* Even though there wasn't an exact match, there might be a
5602 case range which includes the enumerator's value. */
5603 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
5604 if (node
&& CASE_HIGH ((tree
) node
->value
))
5606 tree label
= (tree
) node
->value
;
5607 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
5610 /* If we match the upper bound exactly, mark the CASE_HIGH
5611 part of the case entry as seen. */
5613 CASE_HIGH_SEEN (label
) = 1;
5618 /* We've now determined that this enumerated literal isn't
5619 handled by the case labels of the switch statement. */
5621 /* If the switch expression is a constant, we only really care
5622 about whether that constant is handled by the switch. */
5623 if (cond
&& tree_int_cst_compare (cond
, value
))
5626 /* If there is a default_node, the only relevant option is
5627 Wswitch-enum. Otherwise, if both are enabled then we prefer
5628 to warn using -Wswitch because -Wswitch is enabled by -Wall
5629 while -Wswitch-enum is explicit. */
5630 warning_at (switch_location
,
5631 (default_node
|| !warn_switch
5634 "enumeration value %qE not handled in switch",
5635 TREE_PURPOSE (chain
));
5638 /* Warn if there are case expressions that don't correspond to
5639 enumerators. This can occur since C and C++ don't enforce
5640 type-checking of assignments to enumeration variables.
5642 The time complexity here is now always O(N) worst case, since
5643 we should have marked both the lower bound and upper bound of
5644 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5645 above. This scan also resets those fields. */
5647 splay_tree_foreach (cases
, match_case_to_enum
, type
);
5650 /* Finish an expression taking the address of LABEL (an
5651 IDENTIFIER_NODE). Returns an expression for the address.
5653 LOC is the location for the expression returned. */
5656 finish_label_address_expr (tree label
, location_t loc
)
5660 pedwarn (input_location
, OPT_pedantic
, "taking the address of a label is non-standard");
5662 if (label
== error_mark_node
)
5663 return error_mark_node
;
5665 label
= lookup_label (label
);
5666 if (label
== NULL_TREE
)
5667 result
= null_pointer_node
;
5670 TREE_USED (label
) = 1;
5671 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
5672 /* The current function is not necessarily uninlinable.
5673 Computed gotos are incompatible with inlining, but the value
5674 here could be used only in a diagnostic, for example. */
5675 protected_set_expr_location (result
, loc
);
5682 /* Given a boolean expression ARG, return a tree representing an increment
5683 or decrement (as indicated by CODE) of ARG. The front end must check for
5684 invalid cases (e.g., decrement in C++). */
5686 boolean_increment (enum tree_code code
, tree arg
)
5689 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
5691 arg
= stabilize_reference (arg
);
5694 case PREINCREMENT_EXPR
:
5695 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5697 case POSTINCREMENT_EXPR
:
5698 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5699 arg
= save_expr (arg
);
5700 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5701 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5703 case PREDECREMENT_EXPR
:
5704 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5705 invert_truthvalue_loc (input_location
, arg
));
5707 case POSTDECREMENT_EXPR
:
5708 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5709 invert_truthvalue_loc (input_location
, arg
));
5710 arg
= save_expr (arg
);
5711 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5712 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5717 TREE_SIDE_EFFECTS (val
) = 1;
5721 /* Built-in macros for stddef.h and stdint.h, that require macros
5722 defined in this file. */
5724 c_stddef_cpp_builtins(void)
5726 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
5727 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
5728 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
5729 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
5730 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
5731 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
5732 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
5733 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
5734 if (SIG_ATOMIC_TYPE
)
5735 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
5737 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
5739 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
5741 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
5743 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
5745 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
5747 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
5749 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
5751 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
5752 if (INT_LEAST8_TYPE
)
5753 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
5754 if (INT_LEAST16_TYPE
)
5755 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
5756 if (INT_LEAST32_TYPE
)
5757 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
5758 if (INT_LEAST64_TYPE
)
5759 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
5760 if (UINT_LEAST8_TYPE
)
5761 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
5762 if (UINT_LEAST16_TYPE
)
5763 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
5764 if (UINT_LEAST32_TYPE
)
5765 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
5766 if (UINT_LEAST64_TYPE
)
5767 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
5769 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
5770 if (INT_FAST16_TYPE
)
5771 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
5772 if (INT_FAST32_TYPE
)
5773 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
5774 if (INT_FAST64_TYPE
)
5775 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
5776 if (UINT_FAST8_TYPE
)
5777 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
5778 if (UINT_FAST16_TYPE
)
5779 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
5780 if (UINT_FAST32_TYPE
)
5781 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
5782 if (UINT_FAST64_TYPE
)
5783 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
5785 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
5787 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
5791 c_init_attributes (void)
5793 /* Fill in the built_in_attributes array. */
5794 #define DEF_ATTR_NULL_TREE(ENUM) \
5795 built_in_attributes[(int) ENUM] = NULL_TREE;
5796 #define DEF_ATTR_INT(ENUM, VALUE) \
5797 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5798 #define DEF_ATTR_IDENT(ENUM, STRING) \
5799 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5800 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5801 built_in_attributes[(int) ENUM] \
5802 = tree_cons (built_in_attributes[(int) PURPOSE], \
5803 built_in_attributes[(int) VALUE], \
5804 built_in_attributes[(int) CHAIN]);
5805 #include "builtin-attrs.def"
5806 #undef DEF_ATTR_NULL_TREE
5808 #undef DEF_ATTR_IDENT
5809 #undef DEF_ATTR_TREE_LIST
5812 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5813 identifier as an argument, so the front end shouldn't look it up. */
5816 attribute_takes_identifier_p (tree attr_id
)
5818 return (is_attribute_p ("mode", attr_id
)
5819 || is_attribute_p ("format", attr_id
)
5820 || is_attribute_p ("cleanup", attr_id
));
5823 /* Attribute handlers common to C front ends. */
5825 /* Handle a "packed" attribute; arguments as in
5826 struct attribute_spec.handler. */
5829 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5830 int flags
, bool *no_add_attrs
)
5834 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5835 *node
= build_variant_type_copy (*node
);
5836 TYPE_PACKED (*node
) = 1;
5838 else if (TREE_CODE (*node
) == FIELD_DECL
)
5840 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
5841 /* Still pack bitfields. */
5842 && ! DECL_INITIAL (*node
))
5843 warning (OPT_Wattributes
,
5844 "%qE attribute ignored for field of type %qT",
5845 name
, TREE_TYPE (*node
));
5847 DECL_PACKED (*node
) = 1;
5849 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5850 used for DECL_REGISTER. It wouldn't mean anything anyway.
5851 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5852 that changes what the typedef is typing. */
5855 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5856 *no_add_attrs
= true;
5862 /* Handle a "nocommon" attribute; arguments as in
5863 struct attribute_spec.handler. */
5866 handle_nocommon_attribute (tree
*node
, tree name
,
5867 tree
ARG_UNUSED (args
),
5868 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5870 if (TREE_CODE (*node
) == VAR_DECL
)
5871 DECL_COMMON (*node
) = 0;
5874 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5875 *no_add_attrs
= true;
5881 /* Handle a "common" attribute; arguments as in
5882 struct attribute_spec.handler. */
5885 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5886 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5888 if (TREE_CODE (*node
) == VAR_DECL
)
5889 DECL_COMMON (*node
) = 1;
5892 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5893 *no_add_attrs
= true;
5899 /* Handle a "noreturn" attribute; arguments as in
5900 struct attribute_spec.handler. */
5903 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5904 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5906 tree type
= TREE_TYPE (*node
);
5908 /* See FIXME comment in c_common_attribute_table. */
5909 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5910 TREE_THIS_VOLATILE (*node
) = 1;
5911 else if (TREE_CODE (type
) == POINTER_TYPE
5912 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5914 = build_pointer_type
5915 (build_type_variant (TREE_TYPE (type
),
5916 TYPE_READONLY (TREE_TYPE (type
)), 1));
5919 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5920 *no_add_attrs
= true;
5926 /* Handle a "hot" and attribute; arguments as in
5927 struct attribute_spec.handler. */
5930 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5931 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5933 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5935 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
5937 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5939 *no_add_attrs
= true;
5941 /* Most of the rest of the hot processing is done later with
5942 lookup_attribute. */
5946 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5947 *no_add_attrs
= true;
5952 /* Handle a "cold" and attribute; arguments as in
5953 struct attribute_spec.handler. */
5956 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5957 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5959 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5961 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
5963 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5965 *no_add_attrs
= true;
5967 /* Most of the rest of the cold processing is done later with
5968 lookup_attribute. */
5972 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5973 *no_add_attrs
= true;
5979 /* Handle a "noinline" attribute; arguments as in
5980 struct attribute_spec.handler. */
5983 handle_noinline_attribute (tree
*node
, tree name
,
5984 tree
ARG_UNUSED (args
),
5985 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5987 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5988 DECL_UNINLINABLE (*node
) = 1;
5991 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5992 *no_add_attrs
= true;
5998 /* Handle a "noclone" attribute; arguments as in
5999 struct attribute_spec.handler. */
6002 handle_noclone_attribute (tree
*node
, tree name
,
6003 tree
ARG_UNUSED (args
),
6004 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6006 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6008 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6009 *no_add_attrs
= true;
6015 /* Handle a "always_inline" attribute; arguments as in
6016 struct attribute_spec.handler. */
6019 handle_always_inline_attribute (tree
*node
, tree name
,
6020 tree
ARG_UNUSED (args
),
6021 int ARG_UNUSED (flags
),
6024 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6026 /* Set the attribute and mark it for disregarding inline
6028 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
6032 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6033 *no_add_attrs
= true;
6039 /* Handle a "gnu_inline" attribute; arguments as in
6040 struct attribute_spec.handler. */
6043 handle_gnu_inline_attribute (tree
*node
, tree name
,
6044 tree
ARG_UNUSED (args
),
6045 int ARG_UNUSED (flags
),
6048 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
6050 /* Do nothing else, just set the attribute. We'll get at
6051 it later with lookup_attribute. */
6055 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6056 *no_add_attrs
= true;
6062 /* Handle an "artificial" attribute; arguments as in
6063 struct attribute_spec.handler. */
6066 handle_artificial_attribute (tree
*node
, tree name
,
6067 tree
ARG_UNUSED (args
),
6068 int ARG_UNUSED (flags
),
6071 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
6073 /* Do nothing else, just set the attribute. We'll get at
6074 it later with lookup_attribute. */
6078 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6079 *no_add_attrs
= true;
6085 /* Handle a "flatten" attribute; arguments as in
6086 struct attribute_spec.handler. */
6089 handle_flatten_attribute (tree
*node
, tree name
,
6090 tree args ATTRIBUTE_UNUSED
,
6091 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
6093 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6094 /* Do nothing else, just set the attribute. We'll get at
6095 it later with lookup_attribute. */
6099 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6100 *no_add_attrs
= true;
6106 /* Handle a "warning" or "error" attribute; arguments as in
6107 struct attribute_spec.handler. */
6110 handle_error_attribute (tree
*node
, tree name
, tree args
,
6111 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6113 if (TREE_CODE (*node
) == FUNCTION_DECL
6114 || TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
6115 /* Do nothing else, just set the attribute. We'll get at
6116 it later with lookup_attribute. */
6120 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6121 *no_add_attrs
= true;
6127 /* Handle a "used" attribute; arguments as in
6128 struct attribute_spec.handler. */
6131 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
6132 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6136 if (TREE_CODE (node
) == FUNCTION_DECL
6137 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
6139 TREE_USED (node
) = 1;
6140 DECL_PRESERVE_P (node
) = 1;
6141 if (TREE_CODE (node
) == VAR_DECL
)
6142 DECL_READ_P (node
) = 1;
6146 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6147 *no_add_attrs
= true;
6153 /* Handle a "unused" attribute; arguments as in
6154 struct attribute_spec.handler. */
6157 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6158 int flags
, bool *no_add_attrs
)
6164 if (TREE_CODE (decl
) == PARM_DECL
6165 || TREE_CODE (decl
) == VAR_DECL
6166 || TREE_CODE (decl
) == FUNCTION_DECL
6167 || TREE_CODE (decl
) == LABEL_DECL
6168 || TREE_CODE (decl
) == TYPE_DECL
)
6170 TREE_USED (decl
) = 1;
6171 if (TREE_CODE (decl
) == VAR_DECL
6172 || TREE_CODE (decl
) == PARM_DECL
)
6173 DECL_READ_P (decl
) = 1;
6177 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6178 *no_add_attrs
= true;
6183 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6184 *node
= build_variant_type_copy (*node
);
6185 TREE_USED (*node
) = 1;
6191 /* Handle a "externally_visible" attribute; arguments as in
6192 struct attribute_spec.handler. */
6195 handle_externally_visible_attribute (tree
*pnode
, tree name
,
6196 tree
ARG_UNUSED (args
),
6197 int ARG_UNUSED (flags
),
6202 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
6204 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
6205 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
6207 warning (OPT_Wattributes
,
6208 "%qE attribute have effect only on public objects", name
);
6209 *no_add_attrs
= true;
6214 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6215 *no_add_attrs
= true;
6221 /* Handle a "const" attribute; arguments as in
6222 struct attribute_spec.handler. */
6225 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6226 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6228 tree type
= TREE_TYPE (*node
);
6230 /* See FIXME comment on noreturn in c_common_attribute_table. */
6231 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6232 TREE_READONLY (*node
) = 1;
6233 else if (TREE_CODE (type
) == POINTER_TYPE
6234 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6236 = build_pointer_type
6237 (build_type_variant (TREE_TYPE (type
), 1,
6238 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
6241 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6242 *no_add_attrs
= true;
6248 /* Handle a "transparent_union" attribute; arguments as in
6249 struct attribute_spec.handler. */
6252 handle_transparent_union_attribute (tree
*node
, tree name
,
6253 tree
ARG_UNUSED (args
), int flags
,
6258 *no_add_attrs
= true;
6260 if (TREE_CODE (*node
) == TYPE_DECL
)
6261 node
= &TREE_TYPE (*node
);
6264 if (TREE_CODE (type
) == UNION_TYPE
)
6266 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6267 the code in finish_struct. */
6268 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6270 if (TYPE_FIELDS (type
) == NULL_TREE
6271 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
6274 /* A type variant isn't good enough, since we don't a cast
6275 to such a type removed as a no-op. */
6276 *node
= type
= build_duplicate_type (type
);
6279 TYPE_TRANSPARENT_AGGR (type
) = 1;
6284 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6288 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6289 get the requested priority for a constructor or destructor,
6290 possibly issuing diagnostics for invalid or reserved
6293 static priority_type
6294 get_priority (tree args
, bool is_destructor
)
6300 return DEFAULT_INIT_PRIORITY
;
6302 if (!SUPPORTS_INIT_PRIORITY
)
6305 error ("destructor priorities are not supported");
6307 error ("constructor priorities are not supported");
6308 return DEFAULT_INIT_PRIORITY
;
6311 arg
= TREE_VALUE (args
);
6312 if (!host_integerp (arg
, /*pos=*/0)
6313 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6316 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
6317 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
6320 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
6324 "destructor priorities from 0 to %d are reserved "
6325 "for the implementation",
6326 MAX_RESERVED_INIT_PRIORITY
);
6329 "constructor priorities from 0 to %d are reserved "
6330 "for the implementation",
6331 MAX_RESERVED_INIT_PRIORITY
);
6337 error ("destructor priorities must be integers from 0 to %d inclusive",
6340 error ("constructor priorities must be integers from 0 to %d inclusive",
6342 return DEFAULT_INIT_PRIORITY
;
6345 /* Handle a "constructor" attribute; arguments as in
6346 struct attribute_spec.handler. */
6349 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
6350 int ARG_UNUSED (flags
),
6354 tree type
= TREE_TYPE (decl
);
6356 if (TREE_CODE (decl
) == FUNCTION_DECL
6357 && TREE_CODE (type
) == FUNCTION_TYPE
6358 && decl_function_context (decl
) == 0)
6360 priority_type priority
;
6361 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
6362 priority
= get_priority (args
, /*is_destructor=*/false);
6363 SET_DECL_INIT_PRIORITY (decl
, priority
);
6364 TREE_USED (decl
) = 1;
6368 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6369 *no_add_attrs
= true;
6375 /* Handle a "destructor" attribute; arguments as in
6376 struct attribute_spec.handler. */
6379 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
6380 int ARG_UNUSED (flags
),
6384 tree type
= TREE_TYPE (decl
);
6386 if (TREE_CODE (decl
) == FUNCTION_DECL
6387 && TREE_CODE (type
) == FUNCTION_TYPE
6388 && decl_function_context (decl
) == 0)
6390 priority_type priority
;
6391 DECL_STATIC_DESTRUCTOR (decl
) = 1;
6392 priority
= get_priority (args
, /*is_destructor=*/true);
6393 SET_DECL_FINI_PRIORITY (decl
, priority
);
6394 TREE_USED (decl
) = 1;
6398 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6399 *no_add_attrs
= true;
6405 /* Handle a "mode" attribute; arguments as in
6406 struct attribute_spec.handler. */
6409 handle_mode_attribute (tree
*node
, tree name
, tree args
,
6410 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6413 tree ident
= TREE_VALUE (args
);
6415 *no_add_attrs
= true;
6417 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
6418 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6422 const char *p
= IDENTIFIER_POINTER (ident
);
6423 int len
= strlen (p
);
6424 enum machine_mode mode
= VOIDmode
;
6428 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
6429 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
6431 char *newp
= (char *) alloca (len
- 1);
6433 strcpy (newp
, &p
[2]);
6434 newp
[len
- 4] = '\0';
6438 /* Change this type to have a type with the specified mode.
6439 First check for the special modes. */
6440 if (!strcmp (p
, "byte"))
6442 else if (!strcmp (p
, "word"))
6444 else if (!strcmp (p
, "pointer"))
6446 else if (!strcmp (p
, "libgcc_cmp_return"))
6447 mode
= targetm
.libgcc_cmp_return_mode ();
6448 else if (!strcmp (p
, "libgcc_shift_count"))
6449 mode
= targetm
.libgcc_shift_count_mode ();
6450 else if (!strcmp (p
, "unwind_word"))
6451 mode
= targetm
.unwind_word_mode ();
6453 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
6454 if (!strcmp (p
, GET_MODE_NAME (j
)))
6456 mode
= (enum machine_mode
) j
;
6460 if (mode
== VOIDmode
)
6462 error ("unknown machine mode %qE", ident
);
6467 switch (GET_MODE_CLASS (mode
))
6470 case MODE_PARTIAL_INT
:
6472 case MODE_DECIMAL_FLOAT
:
6477 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
6480 case MODE_COMPLEX_INT
:
6481 case MODE_COMPLEX_FLOAT
:
6482 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
6485 case MODE_VECTOR_INT
:
6486 case MODE_VECTOR_FLOAT
:
6487 case MODE_VECTOR_FRACT
:
6488 case MODE_VECTOR_UFRACT
:
6489 case MODE_VECTOR_ACCUM
:
6490 case MODE_VECTOR_UACCUM
:
6491 warning (OPT_Wattributes
, "specifying vector types with "
6492 "__attribute__ ((mode)) is deprecated");
6493 warning (OPT_Wattributes
,
6494 "use __attribute__ ((vector_size)) instead");
6495 valid_mode
= vector_mode_valid_p (mode
);
6503 error ("unable to emulate %qs", p
);
6507 if (POINTER_TYPE_P (type
))
6509 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
6510 tree (*fn
)(tree
, enum machine_mode
, bool);
6512 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
6514 error ("invalid pointer mode %qs", p
);
6518 if (TREE_CODE (type
) == POINTER_TYPE
)
6519 fn
= build_pointer_type_for_mode
;
6521 fn
= build_reference_type_for_mode
;
6522 typefm
= fn (TREE_TYPE (type
), mode
, false);
6526 /* For fixed-point modes, we need to test if the signness of type
6527 and the machine mode are consistent. */
6528 if (ALL_FIXED_POINT_MODE_P (mode
)
6529 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
6531 error ("signness of type and machine mode %qs don't match", p
);
6534 /* For fixed-point modes, we need to pass saturating info. */
6535 typefm
= lang_hooks
.types
.type_for_mode (mode
,
6536 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
6537 : TYPE_UNSIGNED (type
));
6540 if (typefm
== NULL_TREE
)
6542 error ("no data type for mode %qs", p
);
6545 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
6547 /* For enumeral types, copy the precision from the integer
6548 type returned above. If not an INTEGER_TYPE, we can't use
6549 this mode for this type. */
6550 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
6552 error ("cannot use mode %qs for enumeral types", p
);
6556 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
6558 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
6563 /* We cannot build a type variant, as there's code that assumes
6564 that TYPE_MAIN_VARIANT has the same mode. This includes the
6565 debug generators. Instead, create a subrange type. This
6566 results in all of the enumeral values being emitted only once
6567 in the original, and the subtype gets them by reference. */
6568 if (TYPE_UNSIGNED (type
))
6569 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
6571 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
6572 TREE_TYPE (typefm
) = type
;
6575 else if (VECTOR_MODE_P (mode
)
6576 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
6577 : TREE_CODE (type
) != TREE_CODE (typefm
))
6579 error ("mode %qs applied to inappropriate type", p
);
6589 /* Handle a "section" attribute; arguments as in
6590 struct attribute_spec.handler. */
6593 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6594 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6598 if (targetm
.have_named_sections
)
6600 user_defined_section_attribute
= true;
6602 if ((TREE_CODE (decl
) == FUNCTION_DECL
6603 || TREE_CODE (decl
) == VAR_DECL
)
6604 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
6606 if (TREE_CODE (decl
) == VAR_DECL
6607 && current_function_decl
!= NULL_TREE
6608 && !TREE_STATIC (decl
))
6610 error_at (DECL_SOURCE_LOCATION (decl
),
6611 "section attribute cannot be specified for "
6613 *no_add_attrs
= true;
6616 /* The decl may have already been given a section attribute
6617 from a previous declaration. Ensure they match. */
6618 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
6619 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
6620 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
6622 error ("section of %q+D conflicts with previous declaration",
6624 *no_add_attrs
= true;
6626 else if (TREE_CODE (decl
) == VAR_DECL
6627 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
6628 && DECL_THREAD_LOCAL_P (decl
))
6630 error ("section of %q+D cannot be overridden", *node
);
6631 *no_add_attrs
= true;
6634 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
6638 error ("section attribute not allowed for %q+D", *node
);
6639 *no_add_attrs
= true;
6644 error_at (DECL_SOURCE_LOCATION (*node
),
6645 "section attributes are not supported for this target");
6646 *no_add_attrs
= true;
6652 /* Handle a "aligned" attribute; arguments as in
6653 struct attribute_spec.handler. */
6656 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6657 int flags
, bool *no_add_attrs
)
6659 tree decl
= NULL_TREE
;
6662 tree align_expr
= (args
? TREE_VALUE (args
)
6663 : size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
));
6669 type
= &TREE_TYPE (decl
);
6670 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
6672 else if (TYPE_P (*node
))
6673 type
= node
, is_type
= 1;
6675 if (TREE_CODE (align_expr
) != INTEGER_CST
)
6677 error ("requested alignment is not a constant");
6678 *no_add_attrs
= true;
6680 else if ((i
= tree_log2 (align_expr
)) == -1)
6682 error ("requested alignment is not a power of 2");
6683 *no_add_attrs
= true;
6685 else if (i
>= HOST_BITS_PER_INT
- BITS_PER_UNIT_LOG
)
6687 error ("requested alignment is too large");
6688 *no_add_attrs
= true;
6692 /* If we have a TYPE_DECL, then copy the type, so that we
6693 don't accidentally modify a builtin type. See pushdecl. */
6694 if (decl
&& TREE_TYPE (decl
) != error_mark_node
6695 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
6697 tree tt
= TREE_TYPE (decl
);
6698 *type
= build_variant_type_copy (*type
);
6699 DECL_ORIGINAL_TYPE (decl
) = tt
;
6700 TYPE_NAME (*type
) = decl
;
6701 TREE_USED (*type
) = TREE_USED (decl
);
6702 TREE_TYPE (decl
) = *type
;
6704 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6705 *type
= build_variant_type_copy (*type
);
6707 TYPE_ALIGN (*type
) = (1U << i
) * BITS_PER_UNIT
;
6708 TYPE_USER_ALIGN (*type
) = 1;
6710 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
6711 && TREE_CODE (decl
) != FIELD_DECL
)
6713 error ("alignment may not be specified for %q+D", decl
);
6714 *no_add_attrs
= true;
6716 else if (TREE_CODE (decl
) == FUNCTION_DECL
6717 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
6719 if (DECL_USER_ALIGN (decl
))
6720 error ("alignment for %q+D was previously specified as %d "
6721 "and may not be decreased", decl
,
6722 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6724 error ("alignment for %q+D must be at least %d", decl
,
6725 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6726 *no_add_attrs
= true;
6730 DECL_ALIGN (decl
) = (1U << i
) * BITS_PER_UNIT
;
6731 DECL_USER_ALIGN (decl
) = 1;
6737 /* Handle a "weak" attribute; arguments as in
6738 struct attribute_spec.handler. */
6741 handle_weak_attribute (tree
*node
, tree name
,
6742 tree
ARG_UNUSED (args
),
6743 int ARG_UNUSED (flags
),
6744 bool * ARG_UNUSED (no_add_attrs
))
6746 if (TREE_CODE (*node
) == FUNCTION_DECL
6747 && DECL_DECLARED_INLINE_P (*node
))
6749 error ("inline function %q+D cannot be declared weak", *node
);
6750 *no_add_attrs
= true;
6752 else if (TREE_CODE (*node
) == FUNCTION_DECL
6753 || TREE_CODE (*node
) == VAR_DECL
)
6754 declare_weak (*node
);
6756 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6761 /* Handle an "alias" attribute; arguments as in
6762 struct attribute_spec.handler. */
6765 handle_alias_attribute (tree
*node
, tree name
, tree args
,
6766 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6770 if (TREE_CODE (decl
) != FUNCTION_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
6772 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6773 *no_add_attrs
= true;
6775 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
6776 || (TREE_CODE (decl
) != FUNCTION_DECL
6777 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
6778 /* A static variable declaration is always a tentative definition,
6779 but the alias is a non-tentative definition which overrides. */
6780 || (TREE_CODE (decl
) != FUNCTION_DECL
6781 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
6783 error ("%q+D defined both normally and as an alias", decl
);
6784 *no_add_attrs
= true;
6787 /* Note that the very first time we process a nested declaration,
6788 decl_function_context will not be set. Indeed, *would* never
6789 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6790 we do below. After such frobbery, pushdecl would set the context.
6791 In any case, this is never what we want. */
6792 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
6796 id
= TREE_VALUE (args
);
6797 if (TREE_CODE (id
) != STRING_CST
)
6799 error ("alias argument not a string");
6800 *no_add_attrs
= true;
6803 id
= get_identifier (TREE_STRING_POINTER (id
));
6804 /* This counts as a use of the object pointed to. */
6807 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6808 DECL_INITIAL (decl
) = error_mark_node
;
6811 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
6812 DECL_EXTERNAL (decl
) = 1;
6814 DECL_EXTERNAL (decl
) = 0;
6815 TREE_STATIC (decl
) = 1;
6820 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6821 *no_add_attrs
= true;
6827 /* Handle a "weakref" attribute; arguments as in struct
6828 attribute_spec.handler. */
6831 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6832 int flags
, bool *no_add_attrs
)
6834 tree attr
= NULL_TREE
;
6836 /* We must ignore the attribute when it is associated with
6837 local-scoped decls, since attribute alias is ignored and many
6838 such symbols do not even have a DECL_WEAK field. */
6839 if (decl_function_context (*node
)
6840 || current_function_decl
6841 || (TREE_CODE (*node
) != VAR_DECL
&& TREE_CODE (*node
) != FUNCTION_DECL
))
6843 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6844 *no_add_attrs
= true;
6848 /* The idea here is that `weakref("name")' mutates into `weakref,
6849 alias("name")', and weakref without arguments, in turn,
6850 implicitly adds weak. */
6854 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
6855 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
6857 *no_add_attrs
= true;
6859 decl_attributes (node
, attr
, flags
);
6863 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
6864 error_at (DECL_SOURCE_LOCATION (*node
),
6865 "weakref attribute must appear before alias attribute");
6867 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6868 and that isn't supported; and because it wants to add it to
6869 the list of weak decls, which isn't helpful. */
6870 DECL_WEAK (*node
) = 1;
6876 /* Handle an "visibility" attribute; arguments as in
6877 struct attribute_spec.handler. */
6880 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
6881 int ARG_UNUSED (flags
),
6882 bool *ARG_UNUSED (no_add_attrs
))
6885 tree id
= TREE_VALUE (args
);
6886 enum symbol_visibility vis
;
6890 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
6892 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
6894 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
6898 else if (TYPE_FIELDS (*node
))
6900 error ("%qE attribute ignored because %qT is already defined",
6905 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
6907 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6911 if (TREE_CODE (id
) != STRING_CST
)
6913 error ("visibility argument not a string");
6917 /* If this is a type, set the visibility on the type decl. */
6920 decl
= TYPE_NAME (decl
);
6923 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6925 warning (OPT_Wattributes
, "%qE attribute ignored on types",
6931 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
6932 vis
= VISIBILITY_DEFAULT
;
6933 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
6934 vis
= VISIBILITY_INTERNAL
;
6935 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
6936 vis
= VISIBILITY_HIDDEN
;
6937 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
6938 vis
= VISIBILITY_PROTECTED
;
6941 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6942 vis
= VISIBILITY_DEFAULT
;
6945 if (DECL_VISIBILITY_SPECIFIED (decl
)
6946 && vis
!= DECL_VISIBILITY (decl
))
6948 tree attributes
= (TYPE_P (*node
)
6949 ? TYPE_ATTRIBUTES (*node
)
6950 : DECL_ATTRIBUTES (decl
));
6951 if (lookup_attribute ("visibility", attributes
))
6952 error ("%qD redeclared with different visibility", decl
);
6953 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6954 && lookup_attribute ("dllimport", attributes
))
6955 error ("%qD was declared %qs which implies default visibility",
6957 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6958 && lookup_attribute ("dllexport", attributes
))
6959 error ("%qD was declared %qs which implies default visibility",
6963 DECL_VISIBILITY (decl
) = vis
;
6964 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
6966 /* Go ahead and attach the attribute to the node as well. This is needed
6967 so we can determine whether we have VISIBILITY_DEFAULT because the
6968 visibility was not specified, or because it was explicitly overridden
6969 from the containing scope. */
6974 /* Determine the ELF symbol visibility for DECL, which is either a
6975 variable or a function. It is an error to use this function if a
6976 definition of DECL is not available in this translation unit.
6977 Returns true if the final visibility has been determined by this
6978 function; false if the caller is free to make additional
6982 c_determine_visibility (tree decl
)
6984 gcc_assert (TREE_CODE (decl
) == VAR_DECL
6985 || TREE_CODE (decl
) == FUNCTION_DECL
);
6987 /* If the user explicitly specified the visibility with an
6988 attribute, honor that. DECL_VISIBILITY will have been set during
6989 the processing of the attribute. We check for an explicit
6990 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6991 to distinguish the use of an attribute from the use of a "#pragma
6992 GCC visibility push(...)"; in the latter case we still want other
6993 considerations to be able to overrule the #pragma. */
6994 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
6995 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6996 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
6997 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
7000 /* Set default visibility to whatever the user supplied with
7001 visibility_specified depending on #pragma GCC visibility. */
7002 if (!DECL_VISIBILITY_SPECIFIED (decl
))
7004 if (visibility_options
.inpragma
7005 || DECL_VISIBILITY (decl
) != default_visibility
)
7007 DECL_VISIBILITY (decl
) = default_visibility
;
7008 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
7009 /* If visibility changed and DECL already has DECL_RTL, ensure
7010 symbol flags are updated. */
7011 if (((TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
))
7012 || TREE_CODE (decl
) == FUNCTION_DECL
)
7013 && DECL_RTL_SET_P (decl
))
7014 make_decl_rtl (decl
);
7020 /* Handle an "tls_model" attribute; arguments as in
7021 struct attribute_spec.handler. */
7024 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
7025 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7029 enum tls_model kind
;
7031 *no_add_attrs
= true;
7033 if (TREE_CODE (decl
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (decl
))
7035 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7039 kind
= DECL_TLS_MODEL (decl
);
7040 id
= TREE_VALUE (args
);
7041 if (TREE_CODE (id
) != STRING_CST
)
7043 error ("tls_model argument not a string");
7047 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
7048 kind
= TLS_MODEL_LOCAL_EXEC
;
7049 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
7050 kind
= TLS_MODEL_INITIAL_EXEC
;
7051 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
7052 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
7053 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
7054 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
7056 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7058 DECL_TLS_MODEL (decl
) = kind
;
7062 /* Handle a "no_instrument_function" attribute; arguments as in
7063 struct attribute_spec.handler. */
7066 handle_no_instrument_function_attribute (tree
*node
, tree name
,
7067 tree
ARG_UNUSED (args
),
7068 int ARG_UNUSED (flags
),
7073 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7075 error_at (DECL_SOURCE_LOCATION (decl
),
7076 "%qE attribute applies only to functions", name
);
7077 *no_add_attrs
= true;
7079 else if (DECL_INITIAL (decl
))
7081 error_at (DECL_SOURCE_LOCATION (decl
),
7082 "can%'t set %qE attribute after definition", name
);
7083 *no_add_attrs
= true;
7086 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
7091 /* Handle a "malloc" attribute; arguments as in
7092 struct attribute_spec.handler. */
7095 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7096 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7098 if (TREE_CODE (*node
) == FUNCTION_DECL
7099 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
7100 DECL_IS_MALLOC (*node
) = 1;
7103 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7104 *no_add_attrs
= true;
7110 /* Handle a "alloc_size" attribute; arguments as in
7111 struct attribute_spec.handler. */
7114 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7115 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7117 unsigned arg_count
= type_num_arguments (*node
);
7118 for (; args
; args
= TREE_CHAIN (args
))
7120 tree position
= TREE_VALUE (args
);
7122 if (TREE_CODE (position
) != INTEGER_CST
7123 || TREE_INT_CST_HIGH (position
)
7124 || TREE_INT_CST_LOW (position
) < 1
7125 || TREE_INT_CST_LOW (position
) > arg_count
)
7127 warning (OPT_Wattributes
,
7128 "alloc_size parameter outside range");
7129 *no_add_attrs
= true;
7136 /* Handle a "returns_twice" attribute; arguments as in
7137 struct attribute_spec.handler. */
7140 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7141 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7143 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7144 DECL_IS_RETURNS_TWICE (*node
) = 1;
7147 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7148 *no_add_attrs
= true;
7154 /* Handle a "no_limit_stack" attribute; arguments as in
7155 struct attribute_spec.handler. */
7158 handle_no_limit_stack_attribute (tree
*node
, tree name
,
7159 tree
ARG_UNUSED (args
),
7160 int ARG_UNUSED (flags
),
7165 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7167 error_at (DECL_SOURCE_LOCATION (decl
),
7168 "%qE attribute applies only to functions", name
);
7169 *no_add_attrs
= true;
7171 else if (DECL_INITIAL (decl
))
7173 error_at (DECL_SOURCE_LOCATION (decl
),
7174 "can%'t set %qE attribute after definition", name
);
7175 *no_add_attrs
= true;
7178 DECL_NO_LIMIT_STACK (decl
) = 1;
7183 /* Handle a "pure" attribute; arguments as in
7184 struct attribute_spec.handler. */
7187 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7188 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7190 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7191 DECL_PURE_P (*node
) = 1;
7192 /* ??? TODO: Support types. */
7195 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7196 *no_add_attrs
= true;
7202 /* Handle a "no vops" attribute; arguments as in
7203 struct attribute_spec.handler. */
7206 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7207 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
7208 bool *ARG_UNUSED (no_add_attrs
))
7210 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
7211 DECL_IS_NOVOPS (*node
) = 1;
7215 /* Handle a "deprecated" attribute; arguments as in
7216 struct attribute_spec.handler. */
7219 handle_deprecated_attribute (tree
*node
, tree name
,
7220 tree args
, int flags
,
7223 tree type
= NULL_TREE
;
7225 tree what
= NULL_TREE
;
7228 *no_add_attrs
= true;
7229 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7231 error ("deprecated message is not a string");
7232 *no_add_attrs
= true;
7238 type
= TREE_TYPE (decl
);
7240 if (TREE_CODE (decl
) == TYPE_DECL
7241 || TREE_CODE (decl
) == PARM_DECL
7242 || TREE_CODE (decl
) == VAR_DECL
7243 || TREE_CODE (decl
) == FUNCTION_DECL
7244 || TREE_CODE (decl
) == FIELD_DECL
)
7245 TREE_DEPRECATED (decl
) = 1;
7249 else if (TYPE_P (*node
))
7251 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7252 *node
= build_variant_type_copy (*node
);
7253 TREE_DEPRECATED (*node
) = 1;
7261 *no_add_attrs
= true;
7262 if (type
&& TYPE_NAME (type
))
7264 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
7265 what
= TYPE_NAME (*node
);
7266 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
7267 && DECL_NAME (TYPE_NAME (type
)))
7268 what
= DECL_NAME (TYPE_NAME (type
));
7271 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
7273 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7279 /* Handle a "vector_size" attribute; arguments as in
7280 struct attribute_spec.handler. */
7283 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
7284 int ARG_UNUSED (flags
),
7287 unsigned HOST_WIDE_INT vecsize
, nunits
;
7288 enum machine_mode orig_mode
;
7289 tree type
= *node
, new_type
, size
;
7291 *no_add_attrs
= true;
7293 size
= TREE_VALUE (args
);
7295 if (!host_integerp (size
, 1))
7297 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7301 /* Get the vector size (in bytes). */
7302 vecsize
= tree_low_cst (size
, 1);
7304 /* We need to provide for vector pointers, vector arrays, and
7305 functions returning vectors. For example:
7307 __attribute__((vector_size(16))) short *foo;
7309 In this case, the mode is SI, but the type being modified is
7310 HI, so we need to look further. */
7312 while (POINTER_TYPE_P (type
)
7313 || TREE_CODE (type
) == FUNCTION_TYPE
7314 || TREE_CODE (type
) == METHOD_TYPE
7315 || TREE_CODE (type
) == ARRAY_TYPE
7316 || TREE_CODE (type
) == OFFSET_TYPE
)
7317 type
= TREE_TYPE (type
);
7319 /* Get the mode of the type being modified. */
7320 orig_mode
= TYPE_MODE (type
);
7322 if ((!INTEGRAL_TYPE_P (type
)
7323 && !SCALAR_FLOAT_TYPE_P (type
)
7324 && !FIXED_POINT_TYPE_P (type
))
7325 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
7326 && GET_MODE_CLASS (orig_mode
) != MODE_INT
7327 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
7328 || !host_integerp (TYPE_SIZE_UNIT (type
), 1)
7329 || TREE_CODE (type
) == BOOLEAN_TYPE
)
7331 error ("invalid vector type for attribute %qE", name
);
7335 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
7337 error ("vector size not an integral multiple of component size");
7343 error ("zero vector size");
7347 /* Calculate how many units fit in the vector. */
7348 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
7349 if (nunits
& (nunits
- 1))
7351 error ("number of components of the vector not a power of two");
7355 new_type
= build_vector_type (type
, nunits
);
7357 /* Build back pointers if needed. */
7358 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
7363 /* Handle the "nonnull" attribute. */
7365 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7366 tree args
, int ARG_UNUSED (flags
),
7370 unsigned HOST_WIDE_INT attr_arg_num
;
7372 /* If no arguments are specified, all pointer arguments should be
7373 non-null. Verify a full prototype is given so that the arguments
7374 will have the correct types when we actually check them later. */
7377 if (!TYPE_ARG_TYPES (type
))
7379 error ("nonnull attribute without arguments on a non-prototype");
7380 *no_add_attrs
= true;
7385 /* Argument list specified. Verify that each argument number references
7386 a pointer argument. */
7387 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
7390 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
7392 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
7394 error ("nonnull argument has invalid operand number (argument %lu)",
7395 (unsigned long) attr_arg_num
);
7396 *no_add_attrs
= true;
7400 argument
= TYPE_ARG_TYPES (type
);
7403 for (ck_num
= 1; ; ck_num
++)
7405 if (!argument
|| ck_num
== arg_num
)
7407 argument
= TREE_CHAIN (argument
);
7411 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
7413 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
7414 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
7415 *no_add_attrs
= true;
7419 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
7421 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
7422 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
7423 *no_add_attrs
= true;
7432 /* Check the argument list of a function call for null in argument slots
7433 that are marked as requiring a non-null pointer argument. The NARGS
7434 arguments are passed in the array ARGARRAY.
7438 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
7443 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
7445 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
7447 args
= TREE_VALUE (a
);
7449 /* Walk the argument list. If we encounter an argument number we
7450 should check for non-null, do it. If the attribute has no args,
7451 then every pointer argument is checked (in which case the check
7452 for pointer type is done in check_nonnull_arg). */
7453 for (i
= 0; i
< nargs
; i
++)
7455 if (!args
|| nonnull_check_p (args
, i
+ 1))
7456 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
7464 /* Check that the Nth argument of a function call (counting backwards
7465 from the end) is a (pointer)0. The NARGS arguments are passed in the
7469 check_function_sentinel (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
7471 tree attr
= lookup_attribute ("sentinel", attrs
);
7479 /* Skip over the named arguments. */
7480 while (typelist
&& len
< nargs
)
7482 typelist
= TREE_CHAIN (typelist
);
7486 if (TREE_VALUE (attr
))
7488 tree p
= TREE_VALUE (TREE_VALUE (attr
));
7489 pos
= TREE_INT_CST_LOW (p
);
7492 /* The sentinel must be one of the varargs, i.e.
7493 in position >= the number of fixed arguments. */
7494 if ((nargs
- 1 - pos
) < len
)
7496 warning (OPT_Wformat
,
7497 "not enough variable arguments to fit a sentinel");
7501 /* Validate the sentinel. */
7502 sentinel
= argarray
[nargs
- 1 - pos
];
7503 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
7504 || !integer_zerop (sentinel
))
7505 /* Although __null (in C++) is only an integer we allow it
7506 nevertheless, as we are guaranteed that it's exactly
7507 as wide as a pointer, and we don't want to force
7508 users to cast the NULL they have written there.
7509 We warn with -Wstrict-null-sentinel, though. */
7510 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
7511 warning (OPT_Wformat
, "missing sentinel in function call");
7515 /* Helper for check_function_nonnull; given a list of operands which
7516 must be non-null in ARGS, determine if operand PARAM_NUM should be
7520 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
7522 unsigned HOST_WIDE_INT arg_num
= 0;
7524 for (; args
; args
= TREE_CHAIN (args
))
7526 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
7530 if (arg_num
== param_num
)
7536 /* Check that the function argument PARAM (which is operand number
7537 PARAM_NUM) is non-null. This is called by check_function_nonnull
7538 via check_function_arguments_recurse. */
7541 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
7542 unsigned HOST_WIDE_INT param_num
)
7544 /* Just skip checking the argument if it's not a pointer. This can
7545 happen if the "nonnull" attribute was given without an operand
7546 list (which means to check every pointer argument). */
7548 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
7551 if (integer_zerop (param
))
7552 warning (OPT_Wnonnull
, "null argument where non-null required "
7553 "(argument %lu)", (unsigned long) param_num
);
7556 /* Helper for nonnull attribute handling; fetch the operand number
7557 from the attribute argument list. */
7560 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
7562 /* Verify the arg number is a constant. */
7563 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
7564 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
7567 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
7571 /* Handle a "nothrow" attribute; arguments as in
7572 struct attribute_spec.handler. */
7575 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7576 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7578 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7579 TREE_NOTHROW (*node
) = 1;
7580 /* ??? TODO: Support types. */
7583 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7584 *no_add_attrs
= true;
7590 /* Handle a "cleanup" attribute; arguments as in
7591 struct attribute_spec.handler. */
7594 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
7595 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7598 tree cleanup_id
, cleanup_decl
;
7600 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7601 for global destructors in C++. This requires infrastructure that
7602 we don't have generically at the moment. It's also not a feature
7603 we'd be missing too much, since we do have attribute constructor. */
7604 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
7606 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7607 *no_add_attrs
= true;
7611 /* Verify that the argument is a function in scope. */
7612 /* ??? We could support pointers to functions here as well, if
7613 that was considered desirable. */
7614 cleanup_id
= TREE_VALUE (args
);
7615 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
7617 error ("cleanup argument not an identifier");
7618 *no_add_attrs
= true;
7621 cleanup_decl
= lookup_name (cleanup_id
);
7622 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
7624 error ("cleanup argument not a function");
7625 *no_add_attrs
= true;
7629 /* That the function has proper type is checked with the
7630 eventual call to build_function_call. */
7635 /* Handle a "warn_unused_result" attribute. No special handling. */
7638 handle_warn_unused_result_attribute (tree
*node
, tree name
,
7639 tree
ARG_UNUSED (args
),
7640 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7642 /* Ignore the attribute for functions not returning any value. */
7643 if (VOID_TYPE_P (TREE_TYPE (*node
)))
7645 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7646 *no_add_attrs
= true;
7652 /* Handle a "sentinel" attribute. */
7655 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
7656 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7658 tree params
= TYPE_ARG_TYPES (*node
);
7662 warning (OPT_Wattributes
,
7663 "%qE attribute requires prototypes with named arguments", name
);
7664 *no_add_attrs
= true;
7668 while (TREE_CHAIN (params
))
7669 params
= TREE_CHAIN (params
);
7671 if (VOID_TYPE_P (TREE_VALUE (params
)))
7673 warning (OPT_Wattributes
,
7674 "%qE attribute only applies to variadic functions", name
);
7675 *no_add_attrs
= true;
7681 tree position
= TREE_VALUE (args
);
7683 if (TREE_CODE (position
) != INTEGER_CST
)
7685 warning (OPT_Wattributes
,
7686 "requested position is not an integer constant");
7687 *no_add_attrs
= true;
7691 if (tree_int_cst_lt (position
, integer_zero_node
))
7693 warning (OPT_Wattributes
,
7694 "requested position is less than zero");
7695 *no_add_attrs
= true;
7703 /* Handle a "type_generic" attribute. */
7706 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7707 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
7708 bool * ARG_UNUSED (no_add_attrs
))
7712 /* Ensure we have a function type. */
7713 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
7715 params
= TYPE_ARG_TYPES (*node
);
7716 while (params
&& ! VOID_TYPE_P (TREE_VALUE (params
)))
7717 params
= TREE_CHAIN (params
);
7719 /* Ensure we have a variadic function. */
7720 gcc_assert (!params
);
7725 /* Handle a "target" attribute. */
7728 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
7731 /* Ensure we have a function type. */
7732 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7734 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7735 *no_add_attrs
= true;
7737 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
7739 *no_add_attrs
= true;
7744 /* Arguments being collected for optimization. */
7745 typedef const char *const_char_p
; /* For DEF_VEC_P. */
7746 DEF_VEC_P(const_char_p
);
7747 DEF_VEC_ALLOC_P(const_char_p
, gc
);
7748 static GTY(()) VEC(const_char_p
, gc
) *optimize_args
;
7751 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7752 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7753 false for #pragma GCC optimize. */
7756 parse_optimize_options (tree args
, bool attr_p
)
7761 int saved_flag_strict_aliasing
;
7762 const char **opt_argv
;
7765 /* Build up argv vector. Just in case the string is stored away, use garbage
7766 collected strings. */
7767 VEC_truncate (const_char_p
, optimize_args
, 0);
7768 VEC_safe_push (const_char_p
, gc
, optimize_args
, NULL
);
7770 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
7772 tree value
= TREE_VALUE (ap
);
7774 if (TREE_CODE (value
) == INTEGER_CST
)
7777 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
7778 VEC_safe_push (const_char_p
, gc
, optimize_args
, ggc_strdup (buffer
));
7781 else if (TREE_CODE (value
) == STRING_CST
)
7783 /* Split string into multiple substrings. */
7784 size_t len
= TREE_STRING_LENGTH (value
);
7785 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
7786 char *end
= p
+ len
;
7790 while (next_p
!= NULL
)
7796 comma
= strchr (p
, ',');
7809 r
= q
= (char *) ggc_alloc (len2
+ 3);
7811 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7813 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
7817 warning (OPT_Wattributes
,
7818 "Bad option %s to optimize attribute.", p
);
7820 warning (OPT_Wpragmas
,
7821 "Bad option %s to pragma attribute", p
);
7829 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7830 itself is -Os, and any other switch begins with a -f. */
7831 if ((*p
>= '0' && *p
<= '9')
7832 || (p
[0] == 's' && p
[1] == '\0'))
7838 memcpy (r
, p
, len2
);
7840 VEC_safe_push (const_char_p
, gc
, optimize_args
, q
);
7846 opt_argc
= VEC_length (const_char_p
, optimize_args
);
7847 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
7849 for (i
= 1; i
< opt_argc
; i
++)
7850 opt_argv
[i
] = VEC_index (const_char_p
, optimize_args
, i
);
7852 saved_flag_strict_aliasing
= flag_strict_aliasing
;
7854 /* Now parse the options. */
7855 decode_options (opt_argc
, opt_argv
);
7857 targetm
.override_options_after_change();
7859 /* Don't allow changing -fstrict-aliasing. */
7860 flag_strict_aliasing
= saved_flag_strict_aliasing
;
7862 VEC_truncate (const_char_p
, optimize_args
, 0);
7866 /* For handling "optimize" attribute. arguments as in
7867 struct attribute_spec.handler. */
7870 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
7871 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7873 /* Ensure we have a function type. */
7874 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7876 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7877 *no_add_attrs
= true;
7881 struct cl_optimization cur_opts
;
7882 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
7884 /* Save current options. */
7885 cl_optimization_save (&cur_opts
);
7887 /* If we previously had some optimization options, use them as the
7890 cl_optimization_restore (TREE_OPTIMIZATION (old_opts
));
7892 /* Parse options, and update the vector. */
7893 parse_optimize_options (args
, true);
7894 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
7895 = build_optimization_node ();
7897 /* Restore current options. */
7898 cl_optimization_restore (&cur_opts
);
7904 /* Check for valid arguments being passed to a function.
7905 ATTRS is a list of attributes. There are NARGS arguments in the array
7906 ARGARRAY. TYPELIST is the list of argument types for the function.
7909 check_function_arguments (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
7911 /* Check for null being passed in a pointer argument that must be
7912 non-null. We also need to do this if format checking is enabled. */
7915 check_function_nonnull (attrs
, nargs
, argarray
);
7917 /* Check for errors in format strings. */
7919 if (warn_format
|| warn_missing_format_attribute
)
7920 check_function_format (attrs
, nargs
, argarray
);
7923 check_function_sentinel (attrs
, nargs
, argarray
, typelist
);
7926 /* Generic argument checking recursion routine. PARAM is the argument to
7927 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7928 once the argument is resolved. CTX is context for the callback. */
7930 check_function_arguments_recurse (void (*callback
)
7931 (void *, tree
, unsigned HOST_WIDE_INT
),
7932 void *ctx
, tree param
,
7933 unsigned HOST_WIDE_INT param_num
)
7935 if (CONVERT_EXPR_P (param
)
7936 && (TYPE_PRECISION (TREE_TYPE (param
))
7937 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
7939 /* Strip coercion. */
7940 check_function_arguments_recurse (callback
, ctx
,
7941 TREE_OPERAND (param
, 0), param_num
);
7945 if (TREE_CODE (param
) == CALL_EXPR
)
7947 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
7949 bool found_format_arg
= false;
7951 /* See if this is a call to a known internationalization function
7952 that modifies a format arg. Such a function may have multiple
7953 format_arg attributes (for example, ngettext). */
7955 for (attrs
= TYPE_ATTRIBUTES (type
);
7957 attrs
= TREE_CHAIN (attrs
))
7958 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
7961 tree format_num_expr
;
7964 call_expr_arg_iterator iter
;
7966 /* Extract the argument number, which was previously checked
7968 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
7970 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
7971 && !TREE_INT_CST_HIGH (format_num_expr
));
7973 format_num
= TREE_INT_CST_LOW (format_num_expr
);
7975 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
7977 inner_arg
= next_call_expr_arg (&iter
), i
++)
7978 if (i
== format_num
)
7980 check_function_arguments_recurse (callback
, ctx
,
7981 inner_arg
, param_num
);
7982 found_format_arg
= true;
7987 /* If we found a format_arg attribute and did a recursive check,
7988 we are done with checking this argument. Otherwise, we continue
7989 and this will be considered a non-literal. */
7990 if (found_format_arg
)
7994 if (TREE_CODE (param
) == COND_EXPR
)
7996 /* Check both halves of the conditional expression. */
7997 check_function_arguments_recurse (callback
, ctx
,
7998 TREE_OPERAND (param
, 1), param_num
);
7999 check_function_arguments_recurse (callback
, ctx
,
8000 TREE_OPERAND (param
, 2), param_num
);
8004 (*callback
) (ctx
, param
, param_num
);
8007 /* Checks for a builtin function FNDECL that the number of arguments
8008 NARGS against the required number REQUIRED and issues an error if
8009 there is a mismatch. Returns true if the number of arguments is
8010 correct, otherwise false. */
8013 builtin_function_validate_nargs (tree fndecl
, int nargs
, int required
)
8015 if (nargs
< required
)
8017 error_at (input_location
,
8018 "not enough arguments to function %qE", fndecl
);
8021 else if (nargs
> required
)
8023 error_at (input_location
,
8024 "too many arguments to function %qE", fndecl
);
8030 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8031 Returns false if there was an error, otherwise true. */
8034 check_builtin_function_arguments (tree fndecl
, int nargs
, tree
*args
)
8036 if (!DECL_BUILT_IN (fndecl
)
8037 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
8040 switch (DECL_FUNCTION_CODE (fndecl
))
8042 case BUILT_IN_CONSTANT_P
:
8043 return builtin_function_validate_nargs (fndecl
, nargs
, 1);
8045 case BUILT_IN_ISFINITE
:
8046 case BUILT_IN_ISINF
:
8047 case BUILT_IN_ISINF_SIGN
:
8048 case BUILT_IN_ISNAN
:
8049 case BUILT_IN_ISNORMAL
:
8050 if (builtin_function_validate_nargs (fndecl
, nargs
, 1))
8052 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
8054 error ("non-floating-point argument in call to "
8055 "function %qE", fndecl
);
8062 case BUILT_IN_ISGREATER
:
8063 case BUILT_IN_ISGREATEREQUAL
:
8064 case BUILT_IN_ISLESS
:
8065 case BUILT_IN_ISLESSEQUAL
:
8066 case BUILT_IN_ISLESSGREATER
:
8067 case BUILT_IN_ISUNORDERED
:
8068 if (builtin_function_validate_nargs (fndecl
, nargs
, 2))
8070 enum tree_code code0
, code1
;
8071 code0
= TREE_CODE (TREE_TYPE (args
[0]));
8072 code1
= TREE_CODE (TREE_TYPE (args
[1]));
8073 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
8074 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
8075 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
8077 error ("non-floating-point arguments in call to "
8078 "function %qE", fndecl
);
8085 case BUILT_IN_FPCLASSIFY
:
8086 if (builtin_function_validate_nargs (fndecl
, nargs
, 6))
8091 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
8093 error ("non-const integer argument %u in call to function %qE",
8098 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
8100 error ("non-floating-point argument in call to function %qE",
8113 /* Function to help qsort sort FIELD_DECLs by name order. */
8116 field_decl_cmp (const void *x_p
, const void *y_p
)
8118 const tree
*const x
= (const tree
*const) x_p
;
8119 const tree
*const y
= (const tree
*const) y_p
;
8121 if (DECL_NAME (*x
) == DECL_NAME (*y
))
8122 /* A nontype is "greater" than a type. */
8123 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
8124 if (DECL_NAME (*x
) == NULL_TREE
)
8126 if (DECL_NAME (*y
) == NULL_TREE
)
8128 if (DECL_NAME (*x
) < DECL_NAME (*y
))
8134 gt_pointer_operator new_value
;
8138 /* This routine compares two fields like field_decl_cmp but using the
8139 pointer operator in resort_data. */
8142 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
8144 const tree
*const x
= (const tree
*const) x_p
;
8145 const tree
*const y
= (const tree
*const) y_p
;
8147 if (DECL_NAME (*x
) == DECL_NAME (*y
))
8148 /* A nontype is "greater" than a type. */
8149 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
8150 if (DECL_NAME (*x
) == NULL_TREE
)
8152 if (DECL_NAME (*y
) == NULL_TREE
)
8155 tree d1
= DECL_NAME (*x
);
8156 tree d2
= DECL_NAME (*y
);
8157 resort_data
.new_value (&d1
, resort_data
.cookie
);
8158 resort_data
.new_value (&d2
, resort_data
.cookie
);
8165 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8168 resort_sorted_fields (void *obj
,
8169 void * ARG_UNUSED (orig_obj
),
8170 gt_pointer_operator new_value
,
8173 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
8174 resort_data
.new_value
= new_value
;
8175 resort_data
.cookie
= cookie
;
8176 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
8177 resort_field_decl_cmp
);
8180 /* Subroutine of c_parse_error.
8181 Return the result of concatenating LHS and RHS. RHS is really
8182 a string literal, its first character is indicated by RHS_START and
8183 RHS_SIZE is its length (including the terminating NUL character).
8185 The caller is responsible for deleting the returned pointer. */
8188 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
8190 const int lhs_size
= strlen (lhs
);
8191 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
8192 strncpy (result
, lhs
, lhs_size
);
8193 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
8197 /* Issue the error given by GMSGID, indicating that it occurred before
8198 TOKEN, which had the associated VALUE. */
8201 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
8202 tree value
, unsigned char token_flags
)
8204 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8206 char *message
= NULL
;
8208 if (token_type
== CPP_EOF
)
8209 message
= catenate_messages (gmsgid
, " at end of input");
8210 else if (token_type
== CPP_CHAR
8211 || token_type
== CPP_WCHAR
8212 || token_type
== CPP_CHAR16
8213 || token_type
== CPP_CHAR32
)
8215 unsigned int val
= TREE_INT_CST_LOW (value
);
8234 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
8235 message
= catenate_messages (gmsgid
, " before %s'%c'");
8237 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
8239 error (message
, prefix
, val
);
8243 else if (token_type
== CPP_STRING
8244 || token_type
== CPP_WSTRING
8245 || token_type
== CPP_STRING16
8246 || token_type
== CPP_STRING32
8247 || token_type
== CPP_UTF8STRING
)
8248 message
= catenate_messages (gmsgid
, " before string constant");
8249 else if (token_type
== CPP_NUMBER
)
8250 message
= catenate_messages (gmsgid
, " before numeric constant");
8251 else if (token_type
== CPP_NAME
)
8253 message
= catenate_messages (gmsgid
, " before %qE");
8254 error (message
, value
);
8258 else if (token_type
== CPP_PRAGMA
)
8259 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
8260 else if (token_type
== CPP_PRAGMA_EOL
)
8261 message
= catenate_messages (gmsgid
, " before end of line");
8262 else if (token_type
< N_TTYPES
)
8264 message
= catenate_messages (gmsgid
, " before %qs token");
8265 error (message
, cpp_type2name (token_type
, token_flags
));
8277 #undef catenate_messages
8280 /* Mapping for cpp message reasons to the options that enable them. */
8282 struct reason_option_codes_t
8284 const int reason
; /* cpplib message reason. */
8285 const int option_code
; /* gcc option that controls this message. */
8288 static const struct reason_option_codes_t option_codes
[] = {
8289 {CPP_W_DEPRECATED
, OPT_Wdeprecated
},
8290 {CPP_W_COMMENTS
, OPT_Wcomments
},
8291 {CPP_W_TRIGRAPHS
, OPT_Wtrigraphs
},
8292 {CPP_W_MULTICHAR
, OPT_Wmultichar
},
8293 {CPP_W_TRADITIONAL
, OPT_Wtraditional
},
8294 {CPP_W_LONG_LONG
, OPT_Wlong_long
},
8295 {CPP_W_ENDIF_LABELS
, OPT_Wendif_labels
},
8296 {CPP_W_VARIADIC_MACROS
, OPT_Wvariadic_macros
},
8297 {CPP_W_BUILTIN_MACRO_REDEFINED
, OPT_Wbuiltin_macro_redefined
},
8298 {CPP_W_UNDEF
, OPT_Wundef
},
8299 {CPP_W_UNUSED_MACROS
, OPT_Wunused_macros
},
8300 {CPP_W_CXX_OPERATOR_NAMES
, OPT_Wc___compat
},
8301 {CPP_W_NORMALIZE
, OPT_Wnormalized_
},
8302 {CPP_W_INVALID_PCH
, OPT_Winvalid_pch
},
8303 {CPP_W_WARNING_DIRECTIVE
, OPT_Wcpp
},
8307 /* Return the gcc option code associated with the reason for a cpp
8308 message, or 0 if none. */
8311 c_option_controlling_cpp_error (int reason
)
8313 const struct reason_option_codes_t
*entry
;
8315 for (entry
= option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
8317 if (entry
->reason
== reason
)
8318 return entry
->option_code
;
8323 /* Callback from cpp_error for PFILE to print diagnostics from the
8324 preprocessor. The diagnostic is of type LEVEL, with REASON set
8325 to the reason code if LEVEL is represents a warning, at location
8326 LOCATION unless this is after lexing and the compiler's location
8327 should be used instead, with column number possibly overridden by
8328 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8329 the arguments. Returns true if a diagnostic was emitted, false
8333 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
8334 location_t location
, unsigned int column_override
,
8335 const char *msg
, va_list *ap
)
8337 diagnostic_info diagnostic
;
8338 diagnostic_t dlevel
;
8339 int save_warn_system_headers
= warn_system_headers
;
8344 case CPP_DL_WARNING_SYSHDR
:
8347 warn_system_headers
= 1;
8349 case CPP_DL_WARNING
:
8352 dlevel
= DK_WARNING
;
8354 case CPP_DL_PEDWARN
:
8355 if (flag_no_output
&& !flag_pedantic_errors
)
8357 dlevel
= DK_PEDWARN
;
8375 location
= input_location
;
8376 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
8378 if (column_override
)
8379 diagnostic_override_column (&diagnostic
, column_override
);
8380 diagnostic_override_option_index (&diagnostic
,
8381 c_option_controlling_cpp_error (reason
));
8382 ret
= report_diagnostic (&diagnostic
);
8383 if (level
== CPP_DL_WARNING_SYSHDR
)
8384 warn_system_headers
= save_warn_system_headers
;
8388 /* Convert a character from the host to the target execution character
8389 set. cpplib handles this, mostly. */
8392 c_common_to_target_charset (HOST_WIDE_INT c
)
8394 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8395 zero-extended under -fno-signed-char. cpplib insists that characters
8396 and character constants are always unsigned. Hence we must convert
8398 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
8400 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
8402 if (flag_signed_char
)
8403 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
8404 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
8409 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
8410 component references, with STOP_REF, or alternatively an INDIRECT_REF of
8411 NULL, at the bottom; much like the traditional rendering of offsetof as a
8412 macro. Returns the folded and properly cast result. */
8415 fold_offsetof_1 (tree expr
, tree stop_ref
)
8417 enum tree_code code
= PLUS_EXPR
;
8420 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
8421 return size_zero_node
;
8423 switch (TREE_CODE (expr
))
8429 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
8430 return error_mark_node
;
8434 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
8435 return error_mark_node
;
8439 if (!integer_zerop (TREE_OPERAND (expr
, 0)))
8441 error ("cannot apply %<offsetof%> to a non constant address");
8442 return error_mark_node
;
8444 return size_zero_node
;
8447 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
8448 if (base
== error_mark_node
)
8451 t
= TREE_OPERAND (expr
, 1);
8452 if (DECL_C_BIT_FIELD (t
))
8454 error ("attempt to take address of bit-field structure "
8456 return error_mark_node
;
8458 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
8459 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
),
8465 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
8466 if (base
== error_mark_node
)
8469 t
= TREE_OPERAND (expr
, 1);
8470 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
8473 t
= fold_build1_loc (input_location
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
8475 t
= convert (sizetype
, t
);
8476 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
8478 /* Check if the offset goes beyond the upper bound of the array. */
8479 if (code
== PLUS_EXPR
&& TREE_CODE (t
) == INTEGER_CST
)
8481 tree upbound
= array_ref_up_bound (expr
);
8482 if (upbound
!= NULL_TREE
8483 && TREE_CODE (upbound
) == INTEGER_CST
8484 && !tree_int_cst_equal (upbound
,
8485 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
8487 upbound
= size_binop (PLUS_EXPR
, upbound
,
8488 build_int_cst (TREE_TYPE (upbound
), 1));
8489 if (tree_int_cst_lt (upbound
, t
))
8493 for (v
= TREE_OPERAND (expr
, 0);
8494 TREE_CODE (v
) == COMPONENT_REF
;
8495 v
= TREE_OPERAND (v
, 0))
8496 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
8499 tree fld_chain
= TREE_CHAIN (TREE_OPERAND (v
, 1));
8500 for (; fld_chain
; fld_chain
= TREE_CHAIN (fld_chain
))
8501 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
8507 /* Don't warn if the array might be considered a poor
8508 man's flexible array member with a very permissive
8509 definition thereof. */
8510 if (TREE_CODE (v
) == ARRAY_REF
8511 || TREE_CODE (v
) == COMPONENT_REF
)
8512 warning (OPT_Warray_bounds
,
8513 "index %E denotes an offset "
8514 "greater than size of %qT",
8515 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
8522 /* Handle static members of volatile structs. */
8523 t
= TREE_OPERAND (expr
, 1);
8524 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
8525 return fold_offsetof_1 (t
, stop_ref
);
8531 return size_binop (code
, base
, off
);
8535 fold_offsetof (tree expr
, tree stop_ref
)
8537 /* Convert back from the internal sizetype to size_t. */
8538 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
8541 /* Print an error message for an invalid lvalue. USE says
8542 how the lvalue is being used and so selects the error message. */
8545 lvalue_error (enum lvalue_use use
)
8550 error ("lvalue required as left operand of assignment");
8553 error ("lvalue required as increment operand");
8556 error ("lvalue required as decrement operand");
8559 error ("lvalue required as unary %<&%> operand");
8562 error ("lvalue required in asm statement");
8569 /* *PTYPE is an incomplete array. Complete it with a domain based on
8570 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8571 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8572 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8575 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
8577 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
8578 int failure
= 0, quals
;
8579 hashval_t hashcode
= 0;
8581 maxindex
= size_zero_node
;
8584 if (TREE_CODE (initial_value
) == STRING_CST
)
8587 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8588 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
8590 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8592 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
8594 if (VEC_empty (constructor_elt
, v
))
8598 maxindex
= integer_minus_one_node
;
8603 unsigned HOST_WIDE_INT cnt
;
8604 constructor_elt
*ce
;
8605 bool fold_p
= false;
8607 if (VEC_index (constructor_elt
, v
, 0)->index
)
8608 maxindex
= fold_convert_loc (input_location
, sizetype
,
8609 VEC_index (constructor_elt
,
8611 curindex
= maxindex
;
8614 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
8617 bool curfold_p
= false;
8619 curindex
= ce
->index
, curfold_p
= true;
8623 curindex
= fold_convert (sizetype
, curindex
);
8624 curindex
= size_binop (PLUS_EXPR
, curindex
,
8627 if (tree_int_cst_lt (maxindex
, curindex
))
8628 maxindex
= curindex
, fold_p
= curfold_p
;
8631 maxindex
= fold_convert (sizetype
, maxindex
);
8636 /* Make an error message unless that happened already. */
8637 if (initial_value
!= error_mark_node
)
8649 elt
= TREE_TYPE (type
);
8650 quals
= TYPE_QUALS (strip_array_types (elt
));
8654 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
8656 /* Using build_distinct_type_copy and modifying things afterward instead
8657 of using build_array_type to create a new type preserves all of the
8658 TYPE_LANG_FLAG_? bits that the front end may have set. */
8659 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
8660 TREE_TYPE (main_type
) = unqual_elt
;
8661 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
8662 layout_type (main_type
);
8664 /* Make sure we have the canonical MAIN_TYPE. */
8665 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
8666 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
8668 main_type
= type_hash_canon (hashcode
, main_type
);
8670 /* Fix the canonical type. */
8671 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
8672 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
8673 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
8674 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
8675 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
8676 != TYPE_DOMAIN (main_type
)))
8677 TYPE_CANONICAL (main_type
)
8678 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
8679 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
8681 TYPE_CANONICAL (main_type
) = main_type
;
8686 type
= c_build_qualified_type (main_type
, quals
);
8688 if (COMPLETE_TYPE_P (type
)
8689 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
8690 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type
)))
8692 error ("size of array is too large");
8693 /* If we proceed with the array type as it is, we'll eventually
8694 crash in tree_low_cst(). */
8695 type
= error_mark_node
;
8703 /* Used to help initialize the builtin-types.def table. When a type of
8704 the correct size doesn't exist, use error_mark_node instead of NULL.
8705 The later results in segfaults even when a decl using the type doesn't
8709 builtin_type_for_size (int size
, bool unsignedp
)
8711 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
8712 return type
? type
: error_mark_node
;
8715 /* A helper function for resolve_overloaded_builtin in resolving the
8716 overloaded __sync_ builtins. Returns a positive power of 2 if the
8717 first operand of PARAMS is a pointer to a supported data type.
8718 Returns 0 if an error is encountered. */
8721 sync_resolve_size (tree function
, VEC(tree
,gc
) *params
)
8726 if (VEC_empty (tree
, params
))
8728 error ("too few arguments to function %qE", function
);
8732 type
= TREE_TYPE (VEC_index (tree
, params
, 0));
8733 if (TREE_CODE (type
) != POINTER_TYPE
)
8736 type
= TREE_TYPE (type
);
8737 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
8740 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
8741 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
8745 error ("incompatible type for argument %d of %qE", 1, function
);
8749 /* A helper function for resolve_overloaded_builtin. Adds casts to
8750 PARAMS to make arguments match up with those of FUNCTION. Drops
8751 the variadic arguments at the end. Returns false if some error
8752 was encountered; true on success. */
8755 sync_resolve_params (tree orig_function
, tree function
, VEC(tree
, gc
) *params
)
8757 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
8760 unsigned int parmnum
;
8762 /* We've declared the implementation functions to use "volatile void *"
8763 as the pointer parameter, so we shouldn't get any complaints from the
8764 call to check_function_arguments what ever type the user used. */
8765 arg_types
= TREE_CHAIN (arg_types
);
8766 ptype
= TREE_TYPE (TREE_TYPE (VEC_index (tree
, params
, 0)));
8769 /* For the rest of the values, we need to cast these to FTYPE, so that we
8770 don't get warnings for passing pointer types, etc. */
8772 while (arg_types
!= void_list_node
)
8777 if (VEC_length (tree
, params
) <= parmnum
)
8779 error ("too few arguments to function %qE", orig_function
);
8783 /* ??? Ideally for the first conversion we'd use convert_for_assignment
8784 so that we get warnings for anything that doesn't match the pointer
8785 type. This isn't portable across the C and C++ front ends atm. */
8786 val
= VEC_index (tree
, params
, parmnum
);
8787 val
= convert (ptype
, val
);
8788 val
= convert (TREE_VALUE (arg_types
), val
);
8789 VEC_replace (tree
, params
, parmnum
, val
);
8791 arg_types
= TREE_CHAIN (arg_types
);
8795 /* The definition of these primitives is variadic, with the remaining
8796 being "an optional list of variables protected by the memory barrier".
8797 No clue what that's supposed to mean, precisely, but we consider all
8798 call-clobbered variables to be protected so we're safe. */
8799 VEC_truncate (tree
, params
, parmnum
+ 1);
8804 /* A helper function for resolve_overloaded_builtin. Adds a cast to
8805 RESULT to make it match the type of the first pointer argument in
8809 sync_resolve_return (tree first_param
, tree result
)
8811 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
8812 ptype
= TYPE_MAIN_VARIANT (ptype
);
8813 return convert (ptype
, result
);
8816 /* Some builtin functions are placeholders for other expressions. This
8817 function should be called immediately after parsing the call expression
8818 before surrounding code has committed to the type of the expression.
8820 LOC is the location of the builtin call.
8822 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
8823 PARAMS is the argument list for the call. The return value is non-null
8824 when expansion is complete, and null if normal processing should
8828 resolve_overloaded_builtin (location_t loc
, tree function
, VEC(tree
,gc
) *params
)
8830 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
8831 switch (DECL_BUILT_IN_CLASS (function
))
8833 case BUILT_IN_NORMAL
:
8836 if (targetm
.resolve_overloaded_builtin
)
8837 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
8844 /* Handle BUILT_IN_NORMAL here. */
8847 case BUILT_IN_FETCH_AND_ADD_N
:
8848 case BUILT_IN_FETCH_AND_SUB_N
:
8849 case BUILT_IN_FETCH_AND_OR_N
:
8850 case BUILT_IN_FETCH_AND_AND_N
:
8851 case BUILT_IN_FETCH_AND_XOR_N
:
8852 case BUILT_IN_FETCH_AND_NAND_N
:
8853 case BUILT_IN_ADD_AND_FETCH_N
:
8854 case BUILT_IN_SUB_AND_FETCH_N
:
8855 case BUILT_IN_OR_AND_FETCH_N
:
8856 case BUILT_IN_AND_AND_FETCH_N
:
8857 case BUILT_IN_XOR_AND_FETCH_N
:
8858 case BUILT_IN_NAND_AND_FETCH_N
:
8859 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
8860 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
8861 case BUILT_IN_LOCK_TEST_AND_SET_N
:
8862 case BUILT_IN_LOCK_RELEASE_N
:
8864 int n
= sync_resolve_size (function
, params
);
8865 tree new_function
, first_param
, result
;
8868 return error_mark_node
;
8870 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
8871 if (!sync_resolve_params (function
, new_function
, params
))
8872 return error_mark_node
;
8874 first_param
= VEC_index (tree
, params
, 0);
8875 result
= build_function_call_vec (loc
, new_function
, params
, NULL
);
8876 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
8877 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
8878 result
= sync_resolve_return (first_param
, result
);
8888 /* Ignoring their sign, return true if two scalar types are the same. */
8890 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
8892 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
8894 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
8895 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
8896 || c2
== FIXED_POINT_TYPE
));
8898 /* Equality works here because c_common_signed_type uses
8899 TYPE_MAIN_VARIANT. */
8900 return c_common_signed_type (t1
)
8901 == c_common_signed_type (t2
);
8904 /* Check for missing format attributes on function pointers. LTYPE is
8905 the new type or left-hand side type. RTYPE is the old type or
8906 right-hand side type. Returns TRUE if LTYPE is missing the desired
8910 check_missing_format_attribute (tree ltype
, tree rtype
)
8912 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
8915 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
8916 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
8921 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
8922 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
8930 /* Subscripting with type char is likely to lose on a machine where
8931 chars are signed. So warn on any machine, but optionally. Don't
8932 warn for unsigned char since that type is safe. Don't warn for
8933 signed char because anyone who uses that must have done so
8934 deliberately. Furthermore, we reduce the false positive load by
8935 warning only for non-constant value of type char. */
8938 warn_array_subscript_with_type_char (tree index
)
8940 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
8941 && TREE_CODE (index
) != INTEGER_CST
)
8942 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
8945 /* Implement -Wparentheses for the unexpected C precedence rules, to
8946 cover cases like x + y << z which readers are likely to
8947 misinterpret. We have seen an expression in which CODE is a binary
8948 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
8949 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
8950 CODE_RIGHT may be ERROR_MARK, which means that that side of the
8951 expression was not formed using a binary or unary operator, or it
8952 was enclosed in parentheses. */
8955 warn_about_parentheses (enum tree_code code
,
8956 enum tree_code code_left
, tree arg_left
,
8957 enum tree_code code_right
, tree arg_right
)
8959 if (!warn_parentheses
)
8962 /* This macro tests that the expression ARG with original tree code
8963 CODE appears to be a boolean expression. or the result of folding a
8964 boolean expression. */
8965 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
8966 (truth_value_p (TREE_CODE (ARG)) \
8967 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
8968 /* Folding may create 0 or 1 integers from other expressions. */ \
8969 || ((CODE) != INTEGER_CST \
8970 && (integer_onep (ARG) || integer_zerop (ARG))))
8975 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8976 warning (OPT_Wparentheses
,
8977 "suggest parentheses around %<+%> inside %<<<%>");
8978 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8979 warning (OPT_Wparentheses
,
8980 "suggest parentheses around %<-%> inside %<<<%>");
8984 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8985 warning (OPT_Wparentheses
,
8986 "suggest parentheses around %<+%> inside %<>>%>");
8987 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8988 warning (OPT_Wparentheses
,
8989 "suggest parentheses around %<-%> inside %<>>%>");
8992 case TRUTH_ORIF_EXPR
:
8993 if (code_left
== TRUTH_ANDIF_EXPR
|| code_right
== TRUTH_ANDIF_EXPR
)
8994 warning (OPT_Wparentheses
,
8995 "suggest parentheses around %<&&%> within %<||%>");
8999 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
9000 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
9001 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
9002 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
9003 warning (OPT_Wparentheses
,
9004 "suggest parentheses around arithmetic in operand of %<|%>");
9005 /* Check cases like x|y==z */
9006 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9007 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9008 warning (OPT_Wparentheses
,
9009 "suggest parentheses around comparison in operand of %<|%>");
9010 /* Check cases like !x | y */
9011 else if (code_left
== TRUTH_NOT_EXPR
9012 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
9013 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
9014 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
9018 if (code_left
== BIT_AND_EXPR
9019 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
9020 || code_right
== BIT_AND_EXPR
9021 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
9022 warning (OPT_Wparentheses
,
9023 "suggest parentheses around arithmetic in operand of %<^%>");
9024 /* Check cases like x^y==z */
9025 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9026 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9027 warning (OPT_Wparentheses
,
9028 "suggest parentheses around comparison in operand of %<^%>");
9032 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
9033 warning (OPT_Wparentheses
,
9034 "suggest parentheses around %<+%> in operand of %<&%>");
9035 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
9036 warning (OPT_Wparentheses
,
9037 "suggest parentheses around %<-%> in operand of %<&%>");
9038 /* Check cases like x&y==z */
9039 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9040 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9041 warning (OPT_Wparentheses
,
9042 "suggest parentheses around comparison in operand of %<&%>");
9043 /* Check cases like !x & y */
9044 else if (code_left
== TRUTH_NOT_EXPR
9045 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
9046 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
9047 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
9051 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9052 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9053 warning (OPT_Wparentheses
,
9054 "suggest parentheses around comparison in operand of %<==%>");
9057 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9058 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9059 warning (OPT_Wparentheses
,
9060 "suggest parentheses around comparison in operand of %<!=%>");
9064 if (TREE_CODE_CLASS (code
) == tcc_comparison
9065 && ((TREE_CODE_CLASS (code_left
) == tcc_comparison
9066 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
9067 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
9068 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
9069 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
9070 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))))
9071 warning (OPT_Wparentheses
, "comparisons like %<X<=Y<=Z%> do not "
9072 "have their mathematical meaning");
9075 #undef NOT_A_BOOLEAN_EXPR_P
9078 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9081 warn_for_unused_label (tree label
)
9083 if (!TREE_USED (label
))
9085 if (DECL_INITIAL (label
))
9086 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
9088 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
9092 #ifndef TARGET_HAS_TARGETCM
9093 struct gcc_targetcm targetcm
= TARGETCM_INITIALIZER
;
9096 /* Warn for division by zero according to the value of DIVISOR. LOC
9097 is the location of the division operator. */
9100 warn_for_div_by_zero (location_t loc
, tree divisor
)
9102 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9103 about division by zero. Do not issue a warning if DIVISOR has a
9104 floating-point type, since we consider 0.0/0.0 a valid way of
9105 generating a NaN. */
9106 if (c_inhibit_evaluation_warnings
== 0
9107 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
9108 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
9111 /* Subroutine of build_binary_op. Give warnings for comparisons
9112 between signed and unsigned quantities that may fail. Do the
9113 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9114 so that casts will be considered, but default promotions won't
9117 LOCATION is the location of the comparison operator.
9119 The arguments of this function map directly to local variables
9120 of build_binary_op. */
9123 warn_for_sign_compare (location_t location
,
9124 tree orig_op0
, tree orig_op1
,
9126 tree result_type
, enum tree_code resultcode
)
9128 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
9129 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
9130 int unsignedp0
, unsignedp1
;
9132 /* In C++, check for comparison of different enum types. */
9134 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
9135 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
9136 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
9137 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
9139 warning_at (location
,
9140 OPT_Wsign_compare
, "comparison between types %qT and %qT",
9141 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
9144 /* Do not warn if the comparison is being done in a signed type,
9145 since the signed type will only be chosen if it can represent
9146 all the values of the unsigned type. */
9147 if (!TYPE_UNSIGNED (result_type
))
9149 /* Do not warn if both operands are unsigned. */
9150 else if (op0_signed
== op1_signed
)
9154 tree sop
, uop
, base_type
;
9158 sop
= orig_op0
, uop
= orig_op1
;
9160 sop
= orig_op1
, uop
= orig_op0
;
9162 STRIP_TYPE_NOPS (sop
);
9163 STRIP_TYPE_NOPS (uop
);
9164 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
9165 ? TREE_TYPE (result_type
) : result_type
);
9167 /* Do not warn if the signed quantity is an unsuffixed integer
9168 literal (or some static constant expression involving such
9169 literals or a conditional expression involving such literals)
9170 and it is non-negative. */
9171 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
9173 /* Do not warn if the comparison is an equality operation, the
9174 unsigned quantity is an integral constant, and it would fit
9175 in the result if the result were signed. */
9176 else if (TREE_CODE (uop
) == INTEGER_CST
9177 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
9178 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
9180 /* In C, do not warn if the unsigned quantity is an enumeration
9181 constant and its maximum value would fit in the result if the
9182 result were signed. */
9183 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
9184 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
9185 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
9186 c_common_signed_type (base_type
)))
9189 warning_at (location
,
9191 "comparison between signed and unsigned integer expressions");
9194 /* Warn if two unsigned values are being compared in a size larger
9195 than their original size, and one (and only one) is the result of
9196 a `~' operator. This comparison will always fail.
9198 Also warn if one operand is a constant, and the constant does not
9199 have all bits set that are set in the ~ operand when it is
9202 op0
= get_narrower (op0
, &unsignedp0
);
9203 op1
= get_narrower (op1
, &unsignedp1
);
9205 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
9206 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
9208 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
9209 op0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
9210 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
9211 op1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
9213 if (host_integerp (op0
, 0) || host_integerp (op1
, 0))
9216 HOST_WIDE_INT constant
, mask
;
9220 if (host_integerp (op0
, 0))
9223 unsignedp
= unsignedp1
;
9224 constant
= tree_low_cst (op0
, 0);
9229 unsignedp
= unsignedp0
;
9230 constant
= tree_low_cst (op1
, 0);
9233 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
9234 if (bits
< TYPE_PRECISION (result_type
)
9235 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
9237 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
9238 if ((mask
& constant
) != mask
)
9241 warning (OPT_Wsign_compare
,
9242 "promoted ~unsigned is always non-zero");
9244 warning_at (location
, OPT_Wsign_compare
,
9245 "comparison of promoted ~unsigned with constant");
9249 else if (unsignedp0
&& unsignedp1
9250 && (TYPE_PRECISION (TREE_TYPE (op0
))
9251 < TYPE_PRECISION (result_type
))
9252 && (TYPE_PRECISION (TREE_TYPE (op1
))
9253 < TYPE_PRECISION (result_type
)))
9254 warning_at (location
, OPT_Wsign_compare
,
9255 "comparison of promoted ~unsigned with unsigned");
9259 /* Setup a TYPE_DECL node as a typedef representation.
9261 X is a TYPE_DECL for a typedef statement. Create a brand new
9262 ..._TYPE node (which will be just a variant of the existing
9263 ..._TYPE node with identical properties) and then install X
9264 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
9266 The whole point here is to end up with a situation where each
9267 and every ..._TYPE node the compiler creates will be uniquely
9268 associated with AT MOST one node representing a typedef name.
9269 This way, even though the compiler substitutes corresponding
9270 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
9271 early on, later parts of the compiler can always do the reverse
9272 translation and get back the corresponding typedef name. For
9275 typedef struct S MY_TYPE;
9278 Later parts of the compiler might only know that `object' was of
9279 type `struct S' if it were not for code just below. With this
9280 code however, later parts of the compiler see something like:
9282 struct S' == struct S
9283 typedef struct S' MY_TYPE;
9286 And they can then deduce (from the node for type struct S') that
9287 the original object declaration was:
9291 Being able to do this is important for proper support of protoize,
9292 and also for generating precise symbolic debugging information
9293 which takes full account of the programmer's (typedef) vocabulary.
9295 Obviously, we don't want to generate a duplicate ..._TYPE node if
9296 the TYPE_DECL node that we are now processing really represents a
9297 standard built-in type. */
9300 set_underlying_type (tree x
)
9302 if (x
== error_mark_node
)
9304 if (DECL_IS_BUILTIN (x
))
9306 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
9307 TYPE_NAME (TREE_TYPE (x
)) = x
;
9309 else if (TREE_TYPE (x
) != error_mark_node
9310 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
9312 tree tt
= TREE_TYPE (x
);
9313 DECL_ORIGINAL_TYPE (x
) = tt
;
9314 tt
= build_variant_type_copy (tt
);
9315 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
9317 TREE_USED (tt
) = TREE_USED (x
);
9322 /* Returns true if X is a typedef decl. */
9325 is_typedef_decl (tree x
)
9327 return (x
&& TREE_CODE (x
) == TYPE_DECL
9328 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
9331 /* Record the types used by the current global variable declaration
9332 being parsed, so that we can decide later to emit their debug info.
9333 Those types are in types_used_by_cur_var_decl, and we are going to
9334 store them in the types_used_by_vars_hash hash table.
9335 DECL is the declaration of the global variable that has been parsed. */
9338 record_types_used_by_current_var_decl (tree decl
)
9340 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
9342 if (types_used_by_cur_var_decl
)
9345 for (node
= types_used_by_cur_var_decl
;
9347 node
= TREE_CHAIN (node
))
9349 tree type
= TREE_PURPOSE (node
);
9350 types_used_by_var_decl_insert (type
, decl
);
9352 types_used_by_cur_var_decl
= NULL
;
9356 /* The C and C++ parsers both use vectors to hold function arguments.
9357 For efficiency, we keep a cache of unused vectors. This is the
9360 typedef VEC(tree
,gc
)* tree_gc_vec
;
9361 DEF_VEC_P(tree_gc_vec
);
9362 DEF_VEC_ALLOC_P(tree_gc_vec
,gc
);
9363 static GTY((deletable
)) VEC(tree_gc_vec
,gc
) *tree_vector_cache
;
9365 /* Return a new vector from the cache. If the cache is empty,
9366 allocate a new vector. These vectors are GC'ed, so it is OK if the
9367 pointer is not released.. */
9370 make_tree_vector (void)
9372 if (!VEC_empty (tree_gc_vec
, tree_vector_cache
))
9373 return VEC_pop (tree_gc_vec
, tree_vector_cache
);
9376 /* Passing 0 to VEC_alloc returns NULL, and our callers require
9377 that we always return a non-NULL value. The vector code uses
9378 4 when growing a NULL vector, so we do too. */
9379 return VEC_alloc (tree
, gc
, 4);
9383 /* Release a vector of trees back to the cache. */
9386 release_tree_vector (VEC(tree
,gc
) *vec
)
9390 VEC_truncate (tree
, vec
, 0);
9391 VEC_safe_push (tree_gc_vec
, gc
, tree_vector_cache
, vec
);
9395 /* Get a new tree vector holding a single tree. */
9398 make_tree_vector_single (tree t
)
9400 VEC(tree
,gc
) *ret
= make_tree_vector ();
9401 VEC_quick_push (tree
, ret
, t
);
9405 /* Get a new tree vector which is a copy of an existing one. */
9408 make_tree_vector_copy (const VEC(tree
,gc
) *orig
)
9414 ret
= make_tree_vector ();
9415 VEC_reserve (tree
, gc
, ret
, VEC_length (tree
, orig
));
9416 for (ix
= 0; VEC_iterate (tree
, orig
, ix
, t
); ++ix
)
9417 VEC_quick_push (tree
, ret
, t
);
9421 #include "gt-c-common.h"