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 (or C1X) dialect of C. */
287 /* Nonzero means use the ISO C1X dialect of C. */
291 /* Nonzero means that we have builtin functions, and main is an int. */
296 /* ObjC language option variables. */
299 /* Open and close the file for outputting class declarations, if
302 int flag_gen_declaration
;
304 /* Tells the compiler that this is a special run. Do not perform any
305 compiling, instead we are to test some platform dependent features
306 and output a C header file with appropriate definitions. */
308 int print_struct_values
;
310 /* Tells the compiler what is the constant string class for ObjC. */
312 const char *constant_string_class_name
;
315 /* C++ language option variables. */
318 /* Nonzero means don't recognize any extension keywords. */
320 int flag_no_gnu_keywords
;
322 /* Nonzero means do emit exported implementations of functions even if
323 they can be inlined. */
325 int flag_implement_inlines
= 1;
327 /* Nonzero means that implicit instantiations will be emitted if needed. */
329 int flag_implicit_templates
= 1;
331 /* Nonzero means that implicit instantiations of inline templates will be
332 emitted if needed, even if instantiations of non-inline templates
335 int flag_implicit_inline_templates
= 1;
337 /* Nonzero means generate separate instantiation control files and
338 juggle them at link time. */
340 int flag_use_repository
;
342 /* Nonzero if we want to issue diagnostics that the standard says are not
345 int flag_optional_diags
= 1;
347 /* Nonzero means we should attempt to elide constructors when possible. */
349 int flag_elide_constructors
= 1;
351 /* Nonzero means that member functions defined in class scope are
352 inline by default. */
354 int flag_default_inline
= 1;
356 /* Controls whether compiler generates 'type descriptor' that give
357 run-time type information. */
361 /* Nonzero if we want to conserve space in the .o files. We do this
362 by putting uninitialized data and runtime initialized data into
363 .common instead of .data at the expense of not flagging multiple
366 int flag_conserve_space
;
368 /* Nonzero if we want to obey access control semantics. */
370 int flag_access_control
= 1;
372 /* Nonzero if we want to check the return value of new and avoid calling
373 constructors if it is a null pointer. */
377 /* The C++ dialect being used. C++98 is the default. */
379 enum cxx_dialect cxx_dialect
= cxx98
;
381 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
382 initialization variables.
383 0: Old rules, set by -fno-for-scope.
384 2: New ISO rules, set by -ffor-scope.
385 1: Try to implement new ISO rules, but with backup compatibility
386 (and warnings). This is the default, for now. */
388 int flag_new_for_scope
= 1;
390 /* Nonzero if we want to emit defined symbols with common-like linkage as
391 weak symbols where possible, in order to conform to C++ semantics.
392 Otherwise, emit them as local symbols. */
396 /* 0 means we want the preprocessor to not emit line directives for
397 the current working directory. 1 means we want it to do it. -1
398 means we should decide depending on whether debugging information
399 is being emitted or not. */
401 int flag_working_directory
= -1;
403 /* Nonzero to use __cxa_atexit, rather than atexit, to register
404 destructors for local statics and global objects. '2' means it has been
405 set nonzero as a default, not by a command-line flag. */
407 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
409 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
410 code. '2' means it has not been set explicitly on the command line. */
412 int flag_use_cxa_get_exception_ptr
= 2;
414 /* Nonzero means to implement standard semantics for exception
415 specifications, calling unexpected if an exception is thrown that
416 doesn't match the specification. Zero means to treat them as
417 assertions and optimize accordingly, but not check them. */
419 int flag_enforce_eh_specs
= 1;
421 /* Nonzero means to generate thread-safe code for initializing local
424 int flag_threadsafe_statics
= 1;
426 /* Nonzero if we want to pretty-print template specializations as the
427 template signature followed by the arguments. */
429 int flag_pretty_templates
= 1;
431 /* Nonzero means warn about implicit declarations. */
433 int warn_implicit
= 1;
435 /* Maximum template instantiation depth. This limit exists to limit the
436 time it takes to notice infinite template instantiations; the default
437 value of 1024 is likely to be in the next C++ standard. */
439 int max_tinst_depth
= 1024;
443 /* The elements of `ridpointers' are identifier nodes for the reserved
444 type names and storage classes. It is indexed by a RID_... value. */
447 tree (*make_fname_decl
) (location_t
, tree
, int);
449 /* Nonzero means don't warn about problems that occur when the code is
451 int c_inhibit_evaluation_warnings
;
453 /* Whether lexing has been completed, so subsequent preprocessor
454 errors should use the compiler's input_location. */
455 bool done_lexing
= false;
457 /* Information about how a function name is generated. */
460 tree
*const decl
; /* pointer to the VAR_DECL. */
461 const unsigned rid
; /* RID number for the identifier. */
462 const int pretty
; /* How pretty is it? */
465 /* The three ways of getting then name of the current function. */
467 const struct fname_var_t fname_vars
[] =
469 /* C99 compliant __func__, must be first. */
470 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
471 /* GCC __FUNCTION__ compliant. */
472 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
473 /* GCC __PRETTY_FUNCTION__ compliant. */
474 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
478 static tree
c_fully_fold_internal (tree expr
, bool, bool *, bool *);
479 static tree
check_case_value (tree
);
480 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
482 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
483 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
484 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
485 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
486 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
487 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
488 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
489 static tree
handle_noclone_attribute (tree
*, tree
, tree
, int, bool *);
490 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
492 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int, bool *);
493 static tree
handle_artificial_attribute (tree
*, tree
, tree
, int, bool *);
494 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
495 static tree
handle_error_attribute (tree
*, tree
, tree
, int, bool *);
496 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
497 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
498 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
500 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
501 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
503 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
504 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
505 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
506 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
507 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
508 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
509 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
510 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
511 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
513 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
515 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
517 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
518 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
519 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
521 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
522 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
523 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
525 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
527 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
528 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
529 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
530 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
532 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
533 static tree
handle_type_generic_attribute (tree
*, tree
, tree
, int, bool *);
534 static tree
handle_alloc_size_attribute (tree
*, tree
, tree
, int, bool *);
535 static tree
handle_target_attribute (tree
*, tree
, tree
, int, bool *);
536 static tree
handle_optimize_attribute (tree
*, tree
, tree
, int, bool *);
538 static void check_function_nonnull (tree
, int, tree
*);
539 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
540 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
541 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
542 static int resort_field_decl_cmp (const void *, const void *);
544 /* Reserved words. The third field is a mask: keywords are disabled
545 if they match the mask.
548 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
549 C --std=c99: D_CXXONLY | D_OBJC
550 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
551 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
552 C++ --std=c0x: D_CONLY | D_OBJC
553 ObjC++ is like C++ except that D_OBJC is not set
555 If -fno-asm is used, D_ASM is added to the mask. If
556 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
557 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
558 In C with -Wc++-compat, we warn if D_CXXWARN is set. */
560 const struct c_common_resword c_common_reswords
[] =
562 { "_Bool", RID_BOOL
, D_CONLY
},
563 { "_Complex", RID_COMPLEX
, 0 },
564 { "_Imaginary", RID_IMAGINARY
, D_CONLY
},
565 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
566 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
567 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
568 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
569 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
570 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
571 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
572 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
573 { "__alignof", RID_ALIGNOF
, 0 },
574 { "__alignof__", RID_ALIGNOF
, 0 },
575 { "__asm", RID_ASM
, 0 },
576 { "__asm__", RID_ASM
, 0 },
577 { "__attribute", RID_ATTRIBUTE
, 0 },
578 { "__attribute__", RID_ATTRIBUTE
, 0 },
579 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
580 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
581 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
582 { "__builtin_va_arg", RID_VA_ARG
, 0 },
583 { "__complex", RID_COMPLEX
, 0 },
584 { "__complex__", RID_COMPLEX
, 0 },
585 { "__const", RID_CONST
, 0 },
586 { "__const__", RID_CONST
, 0 },
587 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
588 { "__extension__", RID_EXTENSION
, 0 },
589 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
590 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
591 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
592 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
593 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
594 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
595 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
596 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
597 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
598 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
599 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
600 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
601 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO
, D_CXXONLY
},
602 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
603 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
604 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
605 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
606 { "__is_standard_layout", RID_IS_STD_LAYOUT
, D_CXXONLY
},
607 { "__is_trivial", RID_IS_TRIVIAL
, D_CXXONLY
},
608 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
609 { "__imag", RID_IMAGPART
, 0 },
610 { "__imag__", RID_IMAGPART
, 0 },
611 { "__inline", RID_INLINE
, 0 },
612 { "__inline__", RID_INLINE
, 0 },
613 { "__label__", RID_LABEL
, 0 },
614 { "__null", RID_NULL
, 0 },
615 { "__real", RID_REALPART
, 0 },
616 { "__real__", RID_REALPART
, 0 },
617 { "__restrict", RID_RESTRICT
, 0 },
618 { "__restrict__", RID_RESTRICT
, 0 },
619 { "__signed", RID_SIGNED
, 0 },
620 { "__signed__", RID_SIGNED
, 0 },
621 { "__thread", RID_THREAD
, 0 },
622 { "__typeof", RID_TYPEOF
, 0 },
623 { "__typeof__", RID_TYPEOF
, 0 },
624 { "__volatile", RID_VOLATILE
, 0 },
625 { "__volatile__", RID_VOLATILE
, 0 },
626 { "alignof", RID_ALIGNOF
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
627 { "asm", RID_ASM
, D_ASM
},
628 { "auto", RID_AUTO
, 0 },
629 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
630 { "break", RID_BREAK
, 0 },
631 { "case", RID_CASE
, 0 },
632 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
633 { "char", RID_CHAR
, 0 },
634 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
635 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
636 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
637 { "const", RID_CONST
, 0 },
638 { "constexpr", RID_CONSTEXPR
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
639 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
640 { "continue", RID_CONTINUE
, 0 },
641 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
642 { "default", RID_DEFAULT
, 0 },
643 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
645 { "double", RID_DOUBLE
, 0 },
646 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
647 { "else", RID_ELSE
, 0 },
648 { "enum", RID_ENUM
, 0 },
649 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
650 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
651 { "extern", RID_EXTERN
, 0 },
652 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
653 { "float", RID_FLOAT
, 0 },
654 { "for", RID_FOR
, 0 },
655 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
656 { "goto", RID_GOTO
, 0 },
658 { "inline", RID_INLINE
, D_EXT89
},
659 { "int", RID_INT
, 0 },
660 { "long", RID_LONG
, 0 },
661 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
662 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
663 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
664 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
665 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
666 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
667 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
668 { "register", RID_REGISTER
, 0 },
669 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
670 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
671 { "return", RID_RETURN
, 0 },
672 { "short", RID_SHORT
, 0 },
673 { "signed", RID_SIGNED
, 0 },
674 { "sizeof", RID_SIZEOF
, 0 },
675 { "static", RID_STATIC
, 0 },
676 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
677 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
678 { "struct", RID_STRUCT
, 0 },
679 { "switch", RID_SWITCH
, 0 },
680 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
681 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
682 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
683 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
684 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
685 { "typedef", RID_TYPEDEF
, 0 },
686 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
687 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
688 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
689 { "union", RID_UNION
, 0 },
690 { "unsigned", RID_UNSIGNED
, 0 },
691 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
692 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
693 { "void", RID_VOID
, 0 },
694 { "volatile", RID_VOLATILE
, 0 },
695 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
696 { "while", RID_WHILE
, 0 },
697 /* These Objective-C keywords are recognized only immediately after
699 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
700 { "defs", RID_AT_DEFS
, D_OBJC
},
701 { "encode", RID_AT_ENCODE
, D_OBJC
},
702 { "end", RID_AT_END
, D_OBJC
},
703 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
704 { "interface", RID_AT_INTERFACE
, D_OBJC
},
705 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
706 { "selector", RID_AT_SELECTOR
, D_OBJC
},
707 { "finally", RID_AT_FINALLY
, D_OBJC
},
708 { "synchronized", RID_AT_SYNCHRONIZED
, D_OBJC
},
709 /* These are recognized only in protocol-qualifier context
711 { "bycopy", RID_BYCOPY
, D_OBJC
},
712 { "byref", RID_BYREF
, D_OBJC
},
713 { "in", RID_IN
, D_OBJC
},
714 { "inout", RID_INOUT
, D_OBJC
},
715 { "oneway", RID_ONEWAY
, D_OBJC
},
716 { "out", RID_OUT
, D_OBJC
},
718 #ifdef TARGET_ADDR_SPACE_KEYWORDS
719 /* Any address space keywords recognized by the target. */
720 TARGET_ADDR_SPACE_KEYWORDS
,
724 const unsigned int num_c_common_reswords
=
725 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
727 /* Table of machine-independent attributes common to all C-like languages. */
728 const struct attribute_spec c_common_attribute_table
[] =
730 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
731 { "packed", 0, 0, false, false, false,
732 handle_packed_attribute
},
733 { "nocommon", 0, 0, true, false, false,
734 handle_nocommon_attribute
},
735 { "common", 0, 0, true, false, false,
736 handle_common_attribute
},
737 /* FIXME: logically, noreturn attributes should be listed as
738 "false, true, true" and apply to function types. But implementing this
739 would require all the places in the compiler that use TREE_THIS_VOLATILE
740 on a decl to identify non-returning functions to be located and fixed
741 to check the function type instead. */
742 { "noreturn", 0, 0, true, false, false,
743 handle_noreturn_attribute
},
744 { "volatile", 0, 0, true, false, false,
745 handle_noreturn_attribute
},
746 { "noinline", 0, 0, true, false, false,
747 handle_noinline_attribute
},
748 { "noclone", 0, 0, true, false, false,
749 handle_noclone_attribute
},
750 { "always_inline", 0, 0, true, false, false,
751 handle_always_inline_attribute
},
752 { "gnu_inline", 0, 0, true, false, false,
753 handle_gnu_inline_attribute
},
754 { "artificial", 0, 0, true, false, false,
755 handle_artificial_attribute
},
756 { "flatten", 0, 0, true, false, false,
757 handle_flatten_attribute
},
758 { "used", 0, 0, true, false, false,
759 handle_used_attribute
},
760 { "unused", 0, 0, false, false, false,
761 handle_unused_attribute
},
762 { "externally_visible", 0, 0, true, false, false,
763 handle_externally_visible_attribute
},
764 /* The same comments as for noreturn attributes apply to const ones. */
765 { "const", 0, 0, true, false, false,
766 handle_const_attribute
},
767 { "transparent_union", 0, 0, false, false, false,
768 handle_transparent_union_attribute
},
769 { "constructor", 0, 1, true, false, false,
770 handle_constructor_attribute
},
771 { "destructor", 0, 1, true, false, false,
772 handle_destructor_attribute
},
773 { "mode", 1, 1, false, true, false,
774 handle_mode_attribute
},
775 { "section", 1, 1, true, false, false,
776 handle_section_attribute
},
777 { "aligned", 0, 1, false, false, false,
778 handle_aligned_attribute
},
779 { "weak", 0, 0, true, false, false,
780 handle_weak_attribute
},
781 { "alias", 1, 1, true, false, false,
782 handle_alias_attribute
},
783 { "weakref", 0, 1, true, false, false,
784 handle_weakref_attribute
},
785 { "no_instrument_function", 0, 0, true, false, false,
786 handle_no_instrument_function_attribute
},
787 { "malloc", 0, 0, true, false, false,
788 handle_malloc_attribute
},
789 { "returns_twice", 0, 0, true, false, false,
790 handle_returns_twice_attribute
},
791 { "no_stack_limit", 0, 0, true, false, false,
792 handle_no_limit_stack_attribute
},
793 { "pure", 0, 0, true, false, false,
794 handle_pure_attribute
},
795 /* For internal use (marking of builtins) only. The name contains space
796 to prevent its usage in source code. */
797 { "no vops", 0, 0, true, false, false,
798 handle_novops_attribute
},
799 { "deprecated", 0, 1, false, false, false,
800 handle_deprecated_attribute
},
801 { "vector_size", 1, 1, false, true, false,
802 handle_vector_size_attribute
},
803 { "visibility", 1, 1, false, false, false,
804 handle_visibility_attribute
},
805 { "tls_model", 1, 1, true, false, false,
806 handle_tls_model_attribute
},
807 { "nonnull", 0, -1, false, true, true,
808 handle_nonnull_attribute
},
809 { "nothrow", 0, 0, true, false, false,
810 handle_nothrow_attribute
},
811 { "may_alias", 0, 0, false, true, false, NULL
},
812 { "cleanup", 1, 1, true, false, false,
813 handle_cleanup_attribute
},
814 { "warn_unused_result", 0, 0, false, true, true,
815 handle_warn_unused_result_attribute
},
816 { "sentinel", 0, 1, false, true, true,
817 handle_sentinel_attribute
},
818 /* For internal use (marking of builtins) only. The name contains space
819 to prevent its usage in source code. */
820 { "type generic", 0, 0, false, true, true,
821 handle_type_generic_attribute
},
822 { "alloc_size", 1, 2, false, true, true,
823 handle_alloc_size_attribute
},
824 { "cold", 0, 0, true, false, false,
825 handle_cold_attribute
},
826 { "hot", 0, 0, true, false, false,
827 handle_hot_attribute
},
828 { "warning", 1, 1, true, false, false,
829 handle_error_attribute
},
830 { "error", 1, 1, true, false, false,
831 handle_error_attribute
},
832 { "target", 1, -1, true, false, false,
833 handle_target_attribute
},
834 { "optimize", 1, -1, true, false, false,
835 handle_optimize_attribute
},
836 { NULL
, 0, 0, false, false, false, NULL
}
839 /* Give the specifications for the format attributes, used by C and all
842 const struct attribute_spec c_common_format_attribute_table
[] =
844 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
845 { "format", 3, 3, false, true, true,
846 handle_format_attribute
},
847 { "format_arg", 1, 1, false, true, true,
848 handle_format_arg_attribute
},
849 { NULL
, 0, 0, false, false, false, NULL
}
852 /* Return identifier for address space AS. */
854 c_addr_space_name (addr_space_t as
)
858 for (i
= 0; i
< num_c_common_reswords
; i
++)
859 if (c_common_reswords
[i
].rid
== RID_FIRST_ADDR_SPACE
+ as
)
860 return c_common_reswords
[i
].word
;
865 /* Push current bindings for the function name VAR_DECLS. */
868 start_fname_decls (void)
871 tree saved
= NULL_TREE
;
873 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
875 tree decl
= *fname_vars
[ix
].decl
;
879 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
880 *fname_vars
[ix
].decl
= NULL_TREE
;
883 if (saved
|| saved_function_name_decls
)
884 /* Normally they'll have been NULL, so only push if we've got a
885 stack, or they are non-NULL. */
886 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
887 saved_function_name_decls
);
890 /* Finish up the current bindings, adding them into the current function's
891 statement tree. This must be done _before_ finish_stmt_tree is called.
892 If there is no current function, we must be at file scope and no statements
893 are involved. Pop the previous bindings. */
896 finish_fname_decls (void)
899 tree stmts
= NULL_TREE
;
900 tree stack
= saved_function_name_decls
;
902 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
903 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
907 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
909 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
910 bodyp
= &BIND_EXPR_BODY (*bodyp
);
912 append_to_statement_list_force (*bodyp
, &stmts
);
916 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
917 *fname_vars
[ix
].decl
= NULL_TREE
;
921 /* We had saved values, restore them. */
924 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
926 tree decl
= TREE_PURPOSE (saved
);
927 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
929 *fname_vars
[ix
].decl
= decl
;
931 stack
= TREE_CHAIN (stack
);
933 saved_function_name_decls
= stack
;
936 /* Return the text name of the current function, suitably prettified
937 by PRETTY_P. Return string must be freed by caller. */
940 fname_as_string (int pretty_p
)
942 const char *name
= "top level";
945 cpp_string cstr
= { 0, 0 }, strname
;
953 if (current_function_decl
)
954 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
956 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
958 namep
= XNEWVEC (char, len
);
959 snprintf (namep
, len
, "\"%s\"", name
);
960 strname
.text
= (unsigned char *) namep
;
961 strname
.len
= len
- 1;
963 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
966 return (const char *) cstr
.text
;
972 /* Return the VAR_DECL for a const char array naming the current
973 function. If the VAR_DECL has not yet been created, create it
974 now. RID indicates how it should be formatted and IDENTIFIER_NODE
975 ID is its name (unfortunately C and C++ hold the RID values of
976 keywords in different places, so we can't derive RID from ID in
977 this language independent code. LOC is the location of the
981 fname_decl (location_t loc
, unsigned int rid
, tree id
)
984 tree decl
= NULL_TREE
;
986 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
987 if (fname_vars
[ix
].rid
== rid
)
990 decl
= *fname_vars
[ix
].decl
;
993 /* If a tree is built here, it would normally have the lineno of
994 the current statement. Later this tree will be moved to the
995 beginning of the function and this line number will be wrong.
996 To avoid this problem set the lineno to 0 here; that prevents
997 it from appearing in the RTL. */
999 location_t saved_location
= input_location
;
1000 input_location
= UNKNOWN_LOCATION
;
1002 stmts
= push_stmt_list ();
1003 decl
= (*make_fname_decl
) (loc
, id
, fname_vars
[ix
].pretty
);
1004 stmts
= pop_stmt_list (stmts
);
1005 if (!IS_EMPTY_STMT (stmts
))
1006 saved_function_name_decls
1007 = tree_cons (decl
, stmts
, saved_function_name_decls
);
1008 *fname_vars
[ix
].decl
= decl
;
1009 input_location
= saved_location
;
1011 if (!ix
&& !current_function_decl
)
1012 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
1017 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1020 fix_string_type (tree value
)
1022 int length
= TREE_STRING_LENGTH (value
);
1024 tree e_type
, i_type
, a_type
;
1026 /* Compute the number of elements, for the array type. */
1027 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
1030 e_type
= char_type_node
;
1032 else if (TREE_TYPE (value
) == char16_array_type_node
)
1034 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
1035 e_type
= char16_type_node
;
1037 else if (TREE_TYPE (value
) == char32_array_type_node
)
1039 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
1040 e_type
= char32_type_node
;
1044 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
1045 e_type
= wchar_type_node
;
1048 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1049 limit in C++98 Annex B is very large (65536) and is not normative,
1050 so we do not diagnose it (warn_overlength_strings is forced off
1051 in c_common_post_options). */
1052 if (warn_overlength_strings
)
1054 const int nchars_max
= flag_isoc99
? 4095 : 509;
1055 const int relevant_std
= flag_isoc99
? 99 : 90;
1056 if (nchars
- 1 > nchars_max
)
1057 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1058 separate the %d from the 'C'. 'ISO' should not be
1059 translated, but it may be moved after 'C%d' in languages
1060 where modifiers follow nouns. */
1061 pedwarn (input_location
, OPT_Woverlength_strings
,
1062 "string length %qd is greater than the length %qd "
1063 "ISO C%d compilers are required to support",
1064 nchars
- 1, nchars_max
, relevant_std
);
1067 /* Create the array type for the string constant. The ISO C++
1068 standard says that a string literal has type `const char[N]' or
1069 `const wchar_t[N]'. We use the same logic when invoked as a C
1070 front-end with -Wwrite-strings.
1071 ??? We should change the type of an expression depending on the
1072 state of a warning flag. We should just be warning -- see how
1073 this is handled in the C++ front-end for the deprecated implicit
1074 conversion from string literals to `char*' or `wchar_t*'.
1076 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1077 array type being the unqualified version of that type.
1078 Therefore, if we are constructing an array of const char, we must
1079 construct the matching unqualified array type first. The C front
1080 end does not require this, but it does no harm, so we do it
1082 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
1083 a_type
= build_array_type (e_type
, i_type
);
1084 if (c_dialect_cxx() || warn_write_strings
)
1085 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
1087 TREE_TYPE (value
) = a_type
;
1088 TREE_CONSTANT (value
) = 1;
1089 TREE_READONLY (value
) = 1;
1090 TREE_STATIC (value
) = 1;
1094 /* Fully fold EXPR, an expression that was not folded (beyond integer
1095 constant expressions and null pointer constants) when being built
1096 up. If IN_INIT, this is in a static initializer and certain
1097 changes are made to the folding done. Clear *MAYBE_CONST if
1098 MAYBE_CONST is not NULL and EXPR is definitely not a constant
1099 expression because it contains an evaluated operator (in C99) or an
1100 operator outside of sizeof returning an integer constant (in C90)
1101 not permitted in constant expressions, or because it contains an
1102 evaluated arithmetic overflow. (*MAYBE_CONST should typically be
1103 set to true by callers before calling this function.) Return the
1104 folded expression. Function arguments have already been folded
1105 before calling this function, as have the contents of SAVE_EXPR,
1106 TARGET_EXPR, BIND_EXPR, VA_ARG_EXPR, OBJ_TYPE_REF and
1107 C_MAYBE_CONST_EXPR. */
1110 c_fully_fold (tree expr
, bool in_init
, bool *maybe_const
)
1113 tree eptype
= NULL_TREE
;
1115 bool maybe_const_itself
= true;
1116 location_t loc
= EXPR_LOCATION (expr
);
1118 /* This function is not relevant to C++ because C++ folds while
1119 parsing, and may need changes to be correct for C++ when C++
1120 stops folding while parsing. */
1121 if (c_dialect_cxx ())
1125 maybe_const
= &dummy
;
1126 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
1128 eptype
= TREE_TYPE (expr
);
1129 expr
= TREE_OPERAND (expr
, 0);
1131 ret
= c_fully_fold_internal (expr
, in_init
, maybe_const
,
1132 &maybe_const_itself
);
1134 ret
= fold_convert_loc (loc
, eptype
, ret
);
1135 *maybe_const
&= maybe_const_itself
;
1139 /* Internal helper for c_fully_fold. EXPR and IN_INIT are as for
1140 c_fully_fold. *MAYBE_CONST_OPERANDS is cleared because of operands
1141 not permitted, while *MAYBE_CONST_ITSELF is cleared because of
1142 arithmetic overflow (for C90, *MAYBE_CONST_OPERANDS is carried from
1143 both evaluated and unevaluated subexpressions while
1144 *MAYBE_CONST_ITSELF is carried from only evaluated
1148 c_fully_fold_internal (tree expr
, bool in_init
, bool *maybe_const_operands
,
1149 bool *maybe_const_itself
)
1152 enum tree_code code
= TREE_CODE (expr
);
1153 enum tree_code_class kind
= TREE_CODE_CLASS (code
);
1154 location_t loc
= EXPR_LOCATION (expr
);
1155 tree op0
, op1
, op2
, op3
;
1156 tree orig_op0
, orig_op1
, orig_op2
;
1157 bool op0_const
= true, op1_const
= true, op2_const
= true;
1158 bool op0_const_self
= true, op1_const_self
= true, op2_const_self
= true;
1159 bool nowarning
= TREE_NO_WARNING (expr
);
1162 /* This function is not relevant to C++ because C++ folds while
1163 parsing, and may need changes to be correct for C++ when C++
1164 stops folding while parsing. */
1165 if (c_dialect_cxx ())
1168 /* Constants, declarations, statements, errors, SAVE_EXPRs and
1169 anything else not counted as an expression cannot usefully be
1170 folded further at this point. */
1171 if (!IS_EXPR_CODE_CLASS (kind
)
1172 || kind
== tcc_statement
1173 || code
== SAVE_EXPR
)
1176 /* Operands of variable-length expressions (function calls) have
1177 already been folded, as have __builtin_* function calls, and such
1178 expressions cannot occur in constant expressions. */
1179 if (kind
== tcc_vl_exp
)
1181 *maybe_const_operands
= false;
1186 if (code
== C_MAYBE_CONST_EXPR
)
1188 tree pre
= C_MAYBE_CONST_EXPR_PRE (expr
);
1189 tree inner
= C_MAYBE_CONST_EXPR_EXPR (expr
);
1190 if (C_MAYBE_CONST_EXPR_NON_CONST (expr
))
1191 *maybe_const_operands
= false;
1192 if (C_MAYBE_CONST_EXPR_INT_OPERANDS (expr
))
1193 *maybe_const_itself
= false;
1194 if (pre
&& !in_init
)
1195 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), pre
, inner
);
1201 /* Assignment, increment, decrement, function call and comma
1202 operators, and statement expressions, cannot occur in constant
1203 expressions if evaluated / outside of sizeof. (Function calls
1204 were handled above, though VA_ARG_EXPR is treated like a function
1205 call here, and statement expressions are handled through
1206 C_MAYBE_CONST_EXPR to avoid folding inside them.) */
1210 case PREDECREMENT_EXPR
:
1211 case PREINCREMENT_EXPR
:
1212 case POSTDECREMENT_EXPR
:
1213 case POSTINCREMENT_EXPR
:
1215 *maybe_const_operands
= false;
1222 *maybe_const_operands
= false;
1230 /* Fold individual tree codes as appropriate. */
1233 case COMPOUND_LITERAL_EXPR
:
1234 /* Any non-constancy will have been marked in a containing
1235 C_MAYBE_CONST_EXPR; there is no more folding to do here. */
1239 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1240 op1
= TREE_OPERAND (expr
, 1);
1241 op2
= TREE_OPERAND (expr
, 2);
1242 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1243 maybe_const_itself
);
1244 STRIP_TYPE_NOPS (op0
);
1245 if (op0
!= orig_op0
)
1246 ret
= build3 (COMPONENT_REF
, TREE_TYPE (expr
), op0
, op1
, op2
);
1249 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1250 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1255 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1256 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1257 op2
= TREE_OPERAND (expr
, 2);
1258 op3
= TREE_OPERAND (expr
, 3);
1259 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1260 maybe_const_itself
);
1261 STRIP_TYPE_NOPS (op0
);
1262 op1
= c_fully_fold_internal (op1
, in_init
, maybe_const_operands
,
1263 maybe_const_itself
);
1264 STRIP_TYPE_NOPS (op1
);
1265 op1
= decl_constant_value_for_optimization (op1
);
1266 if (op0
!= orig_op0
|| op1
!= orig_op1
)
1267 ret
= build4 (ARRAY_REF
, TREE_TYPE (expr
), op0
, op1
, op2
, op3
);
1270 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1271 TREE_SIDE_EFFECTS (ret
) = TREE_SIDE_EFFECTS (expr
);
1272 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1279 case PREDECREMENT_EXPR
:
1280 case PREINCREMENT_EXPR
:
1281 case POSTDECREMENT_EXPR
:
1282 case POSTINCREMENT_EXPR
:
1286 case POINTER_PLUS_EXPR
:
1287 case TRUNC_DIV_EXPR
:
1289 case FLOOR_DIV_EXPR
:
1290 case TRUNC_MOD_EXPR
:
1292 case EXACT_DIV_EXPR
:
1305 case TRUTH_AND_EXPR
:
1307 case TRUTH_XOR_EXPR
:
1308 case UNORDERED_EXPR
:
1315 /* Binary operations evaluating both arguments (increment and
1316 decrement are binary internally in GCC). */
1317 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1318 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1319 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1320 maybe_const_itself
);
1321 STRIP_TYPE_NOPS (op0
);
1322 if (code
!= MODIFY_EXPR
1323 && code
!= PREDECREMENT_EXPR
1324 && code
!= PREINCREMENT_EXPR
1325 && code
!= POSTDECREMENT_EXPR
1326 && code
!= POSTINCREMENT_EXPR
)
1327 op0
= decl_constant_value_for_optimization (op0
);
1328 /* The RHS of a MODIFY_EXPR was fully folded when building that
1329 expression for the sake of conversion warnings. */
1330 if (code
!= MODIFY_EXPR
)
1331 op1
= c_fully_fold_internal (op1
, in_init
, maybe_const_operands
,
1332 maybe_const_itself
);
1333 STRIP_TYPE_NOPS (op1
);
1334 op1
= decl_constant_value_for_optimization (op1
);
1335 if (op0
!= orig_op0
|| op1
!= orig_op1
|| in_init
)
1337 ? fold_build2_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
)
1338 : fold_build2_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
);
1341 if (TREE_OVERFLOW_P (ret
)
1342 && !TREE_OVERFLOW_P (op0
)
1343 && !TREE_OVERFLOW_P (op1
))
1344 overflow_warning (EXPR_LOCATION (expr
), ret
);
1348 case FIX_TRUNC_EXPR
:
1351 case NON_LVALUE_EXPR
:
1354 case TRUTH_NOT_EXPR
:
1359 /* Unary operations. */
1360 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1361 op0
= c_fully_fold_internal (op0
, in_init
, maybe_const_operands
,
1362 maybe_const_itself
);
1363 STRIP_TYPE_NOPS (op0
);
1364 if (code
!= ADDR_EXPR
&& code
!= REALPART_EXPR
&& code
!= IMAGPART_EXPR
)
1365 op0
= decl_constant_value_for_optimization (op0
);
1366 if (op0
!= orig_op0
|| in_init
)
1368 ? fold_build1_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
)
1369 : fold_build1_loc (loc
, code
, TREE_TYPE (expr
), op0
);
1372 if (code
== INDIRECT_REF
1374 && TREE_CODE (ret
) == INDIRECT_REF
)
1376 TREE_READONLY (ret
) = TREE_READONLY (expr
);
1377 TREE_SIDE_EFFECTS (ret
) = TREE_SIDE_EFFECTS (expr
);
1378 TREE_THIS_VOLATILE (ret
) = TREE_THIS_VOLATILE (expr
);
1382 case FIX_TRUNC_EXPR
:
1385 /* Don't warn about explicit conversions. We will already
1386 have warned about suspect implicit conversions. */
1390 if (TREE_OVERFLOW_P (ret
) && !TREE_OVERFLOW_P (op0
))
1391 overflow_warning (EXPR_LOCATION (expr
), ret
);
1396 case TRUTH_ANDIF_EXPR
:
1397 case TRUTH_ORIF_EXPR
:
1398 /* Binary operations not necessarily evaluating both
1400 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1401 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1402 op0
= c_fully_fold_internal (op0
, in_init
, &op0_const
, &op0_const_self
);
1403 STRIP_TYPE_NOPS (op0
);
1405 unused_p
= (op0
== (code
== TRUTH_ANDIF_EXPR
1406 ? truthvalue_false_node
1407 : truthvalue_true_node
));
1408 c_inhibit_evaluation_warnings
+= unused_p
;
1409 op1
= c_fully_fold_internal (op1
, in_init
, &op1_const
, &op1_const_self
);
1410 STRIP_TYPE_NOPS (op1
);
1411 c_inhibit_evaluation_warnings
-= unused_p
;
1413 if (op0
!= orig_op0
|| op1
!= orig_op1
|| in_init
)
1415 ? fold_build2_initializer_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
)
1416 : fold_build2_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
);
1419 *maybe_const_operands
&= op0_const
;
1420 *maybe_const_itself
&= op0_const_self
;
1424 && (code
== TRUTH_ANDIF_EXPR
1425 ? op0
== truthvalue_false_node
1426 : op0
== truthvalue_true_node
)))
1427 *maybe_const_operands
&= op1_const
;
1430 && (code
== TRUTH_ANDIF_EXPR
1431 ? op0
== truthvalue_false_node
1432 : op0
== truthvalue_true_node
)))
1433 *maybe_const_itself
&= op1_const_self
;
1437 orig_op0
= op0
= TREE_OPERAND (expr
, 0);
1438 orig_op1
= op1
= TREE_OPERAND (expr
, 1);
1439 orig_op2
= op2
= TREE_OPERAND (expr
, 2);
1440 op0
= c_fully_fold_internal (op0
, in_init
, &op0_const
, &op0_const_self
);
1442 STRIP_TYPE_NOPS (op0
);
1443 c_inhibit_evaluation_warnings
+= (op0
== truthvalue_false_node
);
1444 op1
= c_fully_fold_internal (op1
, in_init
, &op1_const
, &op1_const_self
);
1445 STRIP_TYPE_NOPS (op1
);
1446 c_inhibit_evaluation_warnings
-= (op0
== truthvalue_false_node
);
1448 c_inhibit_evaluation_warnings
+= (op0
== truthvalue_true_node
);
1449 op2
= c_fully_fold_internal (op2
, in_init
, &op2_const
, &op2_const_self
);
1450 STRIP_TYPE_NOPS (op2
);
1451 c_inhibit_evaluation_warnings
-= (op0
== truthvalue_true_node
);
1453 if (op0
!= orig_op0
|| op1
!= orig_op1
|| op2
!= orig_op2
)
1454 ret
= fold_build3_loc (loc
, code
, TREE_TYPE (expr
), op0
, op1
, op2
);
1457 *maybe_const_operands
&= op0_const
;
1458 *maybe_const_itself
&= op0_const_self
;
1462 && op0
== truthvalue_false_node
))
1463 *maybe_const_operands
&= op1_const
;
1466 && op0
== truthvalue_false_node
))
1467 *maybe_const_itself
&= op1_const_self
;
1471 && op0
== truthvalue_true_node
))
1472 *maybe_const_operands
&= op2_const
;
1475 && op0
== truthvalue_true_node
))
1476 *maybe_const_itself
&= op2_const_self
;
1479 case EXCESS_PRECISION_EXPR
:
1480 /* Each case where an operand with excess precision may be
1481 encountered must remove the EXCESS_PRECISION_EXPR around
1482 inner operands and possibly put one around the whole
1483 expression or possibly convert to the semantic type (which
1484 c_fully_fold does); we cannot tell at this stage which is
1485 appropriate in any particular case. */
1489 /* Various codes may appear through folding built-in functions
1490 and their arguments. */
1495 /* Some folding may introduce NON_LVALUE_EXPRs; all lvalue checks
1496 have been done by this point, so remove them again. */
1497 nowarning
|= TREE_NO_WARNING (ret
);
1498 STRIP_TYPE_NOPS (ret
);
1499 if (nowarning
&& !TREE_NO_WARNING (ret
))
1501 if (!CAN_HAVE_LOCATION_P (ret
))
1502 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
1503 TREE_NO_WARNING (ret
) = 1;
1506 protected_set_expr_location (ret
, loc
);
1510 /* If not optimizing, EXP is not a VAR_DECL, or EXP has array type,
1511 return EXP. Otherwise, return either EXP or its known constant
1512 value (if it has one), but return EXP if EXP has mode BLKmode. ???
1513 Is the BLKmode test appropriate? */
1516 decl_constant_value_for_optimization (tree exp
)
1520 /* This function is only used by C, for c_fully_fold and other
1521 optimization, and may not be correct for C++. */
1522 if (c_dialect_cxx ())
1526 || TREE_CODE (exp
) != VAR_DECL
1527 || TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
1528 || DECL_MODE (exp
) == BLKmode
)
1531 ret
= decl_constant_value (exp
);
1532 /* Avoid unwanted tree sharing between the initializer and current
1533 function's body where the tree can be modified e.g. by the
1535 if (ret
!= exp
&& TREE_STATIC (exp
))
1536 ret
= unshare_expr (ret
);
1540 /* Print a warning if a constant expression had overflow in folding.
1541 Invoke this function on every expression that the language
1542 requires to be a constant expression.
1543 Note the ANSI C standard says it is erroneous for a
1544 constant expression to overflow. */
1547 constant_expression_warning (tree value
)
1549 if (warn_overflow
&& pedantic
1550 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1551 || TREE_CODE (value
) == FIXED_CST
1552 || TREE_CODE (value
) == VECTOR_CST
1553 || TREE_CODE (value
) == COMPLEX_CST
)
1554 && TREE_OVERFLOW (value
))
1555 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1558 /* The same as above but print an unconditional error. */
1560 constant_expression_error (tree value
)
1562 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1563 || TREE_CODE (value
) == FIXED_CST
1564 || TREE_CODE (value
) == VECTOR_CST
1565 || TREE_CODE (value
) == COMPLEX_CST
)
1566 && TREE_OVERFLOW (value
))
1567 error ("overflow in constant expression");
1570 /* Print a warning if an expression had overflow in folding and its
1573 Invoke this function on every expression that
1574 (1) appears in the source code, and
1575 (2) is a constant expression that overflowed, and
1576 (3) is not already checked by convert_and_check;
1577 however, do not invoke this function on operands of explicit casts
1578 or when the expression is the result of an operator and any operand
1579 already overflowed. */
1582 overflow_warning (location_t loc
, tree value
)
1584 if (c_inhibit_evaluation_warnings
!= 0)
1587 switch (TREE_CODE (value
))
1590 warning_at (loc
, OPT_Woverflow
, "integer overflow in expression");
1594 warning_at (loc
, OPT_Woverflow
,
1595 "floating point overflow in expression");
1599 warning_at (loc
, OPT_Woverflow
, "fixed-point overflow in expression");
1603 warning_at (loc
, OPT_Woverflow
, "vector overflow in expression");
1607 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1608 warning_at (loc
, OPT_Woverflow
,
1609 "complex integer overflow in expression");
1610 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1611 warning_at (loc
, OPT_Woverflow
,
1612 "complex floating point overflow in expression");
1620 /* Warn about uses of logical || / && operator in a context where it
1621 is likely that the bitwise equivalent was intended by the
1622 programmer. We have seen an expression in which CODE is a binary
1623 operator used to combine expressions OP_LEFT and OP_RIGHT, which before folding
1624 had CODE_LEFT and CODE_RIGHT, into an expression of type TYPE. */
1626 warn_logical_operator (location_t location
, enum tree_code code
, tree type
,
1627 enum tree_code code_left
, tree op_left
,
1628 enum tree_code
ARG_UNUSED (code_right
), tree op_right
)
1630 int or_op
= (code
== TRUTH_ORIF_EXPR
|| code
== TRUTH_OR_EXPR
);
1631 int in0_p
, in1_p
, in_p
;
1632 tree low0
, low1
, low
, high0
, high1
, high
, lhs
, rhs
, tem
;
1633 bool strict_overflow_p
= false;
1635 if (code
!= TRUTH_ANDIF_EXPR
1636 && code
!= TRUTH_AND_EXPR
1637 && code
!= TRUTH_ORIF_EXPR
1638 && code
!= TRUTH_OR_EXPR
)
1641 /* Warn if &&/|| are being used in a context where it is
1642 likely that the bitwise equivalent was intended by the
1643 programmer. That is, an expression such as op && MASK
1644 where op should not be any boolean expression, nor a
1645 constant, and mask seems to be a non-boolean integer constant. */
1646 if (!truth_value_p (code_left
)
1647 && INTEGRAL_TYPE_P (TREE_TYPE (op_left
))
1648 && !CONSTANT_CLASS_P (op_left
)
1649 && !TREE_NO_WARNING (op_left
)
1650 && TREE_CODE (op_right
) == INTEGER_CST
1651 && !integer_zerop (op_right
)
1652 && !integer_onep (op_right
))
1655 warning_at (location
, OPT_Wlogical_op
, "logical %<or%>"
1656 " applied to non-boolean constant");
1658 warning_at (location
, OPT_Wlogical_op
, "logical %<and%>"
1659 " applied to non-boolean constant");
1660 TREE_NO_WARNING (op_left
) = true;
1664 /* We do not warn for constants because they are typical of macro
1665 expansions that test for features. */
1666 if (CONSTANT_CLASS_P (op_left
) || CONSTANT_CLASS_P (op_right
))
1669 /* This warning only makes sense with logical operands. */
1670 if (!(truth_value_p (TREE_CODE (op_left
))
1671 || INTEGRAL_TYPE_P (TREE_TYPE (op_left
)))
1672 || !(truth_value_p (TREE_CODE (op_right
))
1673 || INTEGRAL_TYPE_P (TREE_TYPE (op_right
))))
1676 lhs
= make_range (op_left
, &in0_p
, &low0
, &high0
, &strict_overflow_p
);
1677 rhs
= make_range (op_right
, &in1_p
, &low1
, &high1
, &strict_overflow_p
);
1679 if (lhs
&& TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
1680 lhs
= C_MAYBE_CONST_EXPR_EXPR (lhs
);
1682 if (rhs
&& TREE_CODE (rhs
) == C_MAYBE_CONST_EXPR
)
1683 rhs
= C_MAYBE_CONST_EXPR_EXPR (rhs
);
1685 /* If this is an OR operation, invert both sides; we will invert
1686 again at the end. */
1688 in0_p
= !in0_p
, in1_p
= !in1_p
;
1690 /* If both expressions are the same, if we can merge the ranges, and we
1691 can build the range test, return it or it inverted. */
1692 if (lhs
&& rhs
&& operand_equal_p (lhs
, rhs
, 0)
1693 && merge_ranges (&in_p
, &low
, &high
, in0_p
, low0
, high0
,
1695 && 0 != (tem
= build_range_check (UNKNOWN_LOCATION
,
1696 type
, lhs
, in_p
, low
, high
)))
1698 if (TREE_CODE (tem
) != INTEGER_CST
)
1702 warning_at (location
, OPT_Wlogical_op
,
1704 "of collectively exhaustive tests is always true");
1706 warning_at (location
, OPT_Wlogical_op
,
1708 "of mutually exclusive tests is always false");
1713 /* Print a warning about casts that might indicate violation
1714 of strict aliasing rules if -Wstrict-aliasing is used and
1715 strict aliasing mode is in effect. OTYPE is the original
1716 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1719 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1721 /* Strip pointer conversion chains and get to the correct original type. */
1723 otype
= TREE_TYPE (expr
);
1725 if (!(flag_strict_aliasing
1726 && POINTER_TYPE_P (type
)
1727 && POINTER_TYPE_P (otype
)
1728 && !VOID_TYPE_P (TREE_TYPE (type
)))
1729 /* If the type we are casting to is a ref-all pointer
1730 dereferencing it is always valid. */
1731 || TYPE_REF_CAN_ALIAS_ALL (type
))
1734 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1735 && (DECL_P (TREE_OPERAND (expr
, 0))
1736 || handled_component_p (TREE_OPERAND (expr
, 0))))
1738 /* Casting the address of an object to non void pointer. Warn
1739 if the cast breaks type based aliasing. */
1740 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1742 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1743 "might break strict-aliasing rules");
1748 /* warn_strict_aliasing >= 3. This includes the default (3).
1749 Only warn if the cast is dereferenced immediately. */
1750 alias_set_type set1
=
1751 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1752 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1754 if (set1
!= set2
&& set2
!= 0
1755 && (set1
== 0 || !alias_sets_conflict_p (set1
, set2
)))
1757 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1758 "pointer will break strict-aliasing rules");
1761 else if (warn_strict_aliasing
== 2
1762 && !alias_sets_must_conflict_p (set1
, set2
))
1764 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1765 "pointer might break strict-aliasing rules");
1771 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1773 /* At this level, warn for any conversions, even if an address is
1774 not taken in the same statement. This will likely produce many
1775 false positives, but could be useful to pinpoint problems that
1776 are not revealed at higher levels. */
1777 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1778 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1779 if (!COMPLETE_TYPE_P (type
)
1780 || !alias_sets_must_conflict_p (set1
, set2
))
1782 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1783 "pointer might break strict-aliasing rules");
1791 /* Warn for unlikely, improbable, or stupid DECL declarations
1795 check_main_parameter_types (tree decl
)
1800 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1801 args
= TREE_CHAIN (args
))
1803 tree type
= args
? TREE_VALUE (args
) : 0;
1805 if (type
== void_type_node
|| type
== error_mark_node
)
1812 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1813 pedwarn (input_location
, OPT_Wmain
, "first argument of %q+D should be %<int%>",
1818 if (TREE_CODE (type
) != POINTER_TYPE
1819 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1820 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1822 pedwarn (input_location
, OPT_Wmain
, "second argument of %q+D should be %<char **%>",
1827 if (TREE_CODE (type
) != POINTER_TYPE
1828 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1829 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1831 pedwarn (input_location
, OPT_Wmain
, "third argument of %q+D should probably be "
1832 "%<char **%>", decl
);
1837 /* It is intentional that this message does not mention the third
1838 argument because it's only mentioned in an appendix of the
1840 if (argct
> 0 && (argct
< 2 || argct
> 3))
1841 pedwarn (input_location
, OPT_Wmain
, "%q+D takes only zero or two arguments", decl
);
1844 /* True if pointers to distinct types T1 and T2 can be converted to
1845 each other without an explicit cast. Only returns true for opaque
1848 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
1850 if (TREE_CODE (t1
) == VECTOR_TYPE
&& TREE_CODE (t2
) == VECTOR_TYPE
1851 && (TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
1852 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1858 /* True if vector types T1 and T2 can be converted to each other
1859 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1860 can only be converted with -flax-vector-conversions yet that is not
1861 in effect, emit a note telling the user about that option if such
1862 a note has not previously been emitted. */
1864 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
1866 static bool emitted_lax_note
= false;
1867 bool convertible_lax
;
1869 if ((TYPE_VECTOR_OPAQUE (t1
) || TYPE_VECTOR_OPAQUE (t2
))
1870 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1874 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1875 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1876 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1877 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1878 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1880 if (!convertible_lax
|| flag_lax_vector_conversions
)
1881 return convertible_lax
;
1883 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1884 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1887 if (emit_lax_note
&& !emitted_lax_note
)
1889 emitted_lax_note
= true;
1890 inform (input_location
, "use -flax-vector-conversions to permit "
1891 "conversions between vectors with differing "
1892 "element types or numbers of subparts");
1898 /* This is a helper function of build_binary_op.
1900 For certain operations if both args were extended from the same
1901 smaller type, do the arithmetic in that type and then extend.
1903 BITWISE indicates a bitwise operation.
1904 For them, this optimization is safe only if
1905 both args are zero-extended or both are sign-extended.
1906 Otherwise, we might change the result.
1907 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1908 but calculated in (unsigned short) it would be (unsigned short)-1.
1910 tree
shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1912 int unsigned0
, unsigned1
;
1917 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1918 excessive narrowing when we call get_narrower below. For
1919 example, suppose that OP0 is of unsigned int extended
1920 from signed char and that RESULT_TYPE is long long int.
1921 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1924 (long long int) (unsigned int) signed_char
1926 which get_narrower would narrow down to
1928 (unsigned int) signed char
1930 If we do not cast OP0 first, get_narrower would return
1931 signed_char, which is inconsistent with the case of the
1933 op0
= convert (result_type
, op0
);
1934 op1
= convert (result_type
, op1
);
1936 arg0
= get_narrower (op0
, &unsigned0
);
1937 arg1
= get_narrower (op1
, &unsigned1
);
1939 /* UNS is 1 if the operation to be done is an unsigned one. */
1940 uns
= TYPE_UNSIGNED (result_type
);
1942 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1943 but it *requires* conversion to FINAL_TYPE. */
1945 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1946 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1947 && TREE_TYPE (op0
) != result_type
)
1948 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1949 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1950 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1951 && TREE_TYPE (op1
) != result_type
)
1952 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1954 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1956 /* For bitwise operations, signedness of nominal type
1957 does not matter. Consider only how operands were extended. */
1961 /* Note that in all three cases below we refrain from optimizing
1962 an unsigned operation on sign-extended args.
1963 That would not be valid. */
1965 /* Both args variable: if both extended in same way
1966 from same width, do it in that width.
1967 Do it unsigned if args were zero-extended. */
1968 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1969 < TYPE_PRECISION (result_type
))
1970 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1971 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1972 && unsigned0
== unsigned1
1973 && (unsigned0
|| !uns
))
1974 return c_common_signed_or_unsigned_type
1975 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1977 else if (TREE_CODE (arg0
) == INTEGER_CST
1978 && (unsigned1
|| !uns
)
1979 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1980 < TYPE_PRECISION (result_type
))
1982 = c_common_signed_or_unsigned_type (unsigned1
,
1984 && !POINTER_TYPE_P (type
)
1985 && int_fits_type_p (arg0
, type
))
1988 else if (TREE_CODE (arg1
) == INTEGER_CST
1989 && (unsigned0
|| !uns
)
1990 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1991 < TYPE_PRECISION (result_type
))
1993 = c_common_signed_or_unsigned_type (unsigned0
,
1995 && !POINTER_TYPE_P (type
)
1996 && int_fits_type_p (arg1
, type
))
2002 /* Warns if the conversion of EXPR to TYPE may alter a value.
2003 This is a helper function for warnings_for_convert_and_check. */
2006 conversion_warning (tree type
, tree expr
)
2008 bool give_warning
= false;
2011 const int expr_num_operands
= TREE_OPERAND_LENGTH (expr
);
2012 tree expr_type
= TREE_TYPE (expr
);
2014 if (!warn_conversion
&& !warn_sign_conversion
)
2017 /* If any operand is artificial, then this expression was generated
2018 by the compiler and we do not warn. */
2019 for (i
= 0; i
< expr_num_operands
; i
++)
2021 tree op
= TREE_OPERAND (expr
, i
);
2022 if (op
&& DECL_P (op
) && DECL_ARTIFICIAL (op
))
2026 switch (TREE_CODE (expr
))
2034 case TRUTH_ANDIF_EXPR
:
2035 case TRUTH_ORIF_EXPR
:
2036 case TRUTH_AND_EXPR
:
2038 case TRUTH_XOR_EXPR
:
2039 case TRUTH_NOT_EXPR
:
2040 /* Conversion from boolean to a signed:1 bit-field (which only
2041 can hold the values 0 and -1) doesn't lose information - but
2042 it does change the value. */
2043 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
2044 warning (OPT_Wconversion
,
2045 "conversion to %qT from boolean expression", type
);
2051 /* Warn for real constant that is not an exact integer converted
2053 if (TREE_CODE (expr_type
) == REAL_TYPE
2054 && TREE_CODE (type
) == INTEGER_TYPE
)
2056 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
2057 give_warning
= true;
2059 /* Warn for an integer constant that does not fit into integer type. */
2060 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2061 && TREE_CODE (type
) == INTEGER_TYPE
2062 && !int_fits_type_p (expr
, type
))
2064 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
2065 && tree_int_cst_sgn (expr
) < 0)
2066 warning (OPT_Wsign_conversion
,
2067 "negative integer implicitly converted to unsigned type");
2068 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
2069 warning (OPT_Wsign_conversion
, "conversion of unsigned constant "
2070 "value to negative integer");
2072 give_warning
= true;
2074 else if (TREE_CODE (type
) == REAL_TYPE
)
2076 /* Warn for an integer constant that does not fit into real type. */
2077 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
2079 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
2080 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2081 give_warning
= true;
2083 /* Warn for a real constant that does not fit into a smaller
2085 else if (TREE_CODE (expr_type
) == REAL_TYPE
2086 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2088 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
2089 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
2090 give_warning
= true;
2095 warning (OPT_Wconversion
,
2096 "conversion to %qT alters %qT constant value",
2103 /* In case of COND_EXPR, if both operands are constants or
2104 COND_EXPR, then we do not care about the type of COND_EXPR,
2105 only about the conversion of each operand. */
2106 tree op1
= TREE_OPERAND (expr
, 1);
2107 tree op2
= TREE_OPERAND (expr
, 2);
2109 if ((TREE_CODE (op1
) == REAL_CST
|| TREE_CODE (op1
) == INTEGER_CST
2110 || TREE_CODE (op1
) == COND_EXPR
)
2111 && (TREE_CODE (op2
) == REAL_CST
|| TREE_CODE (op2
) == INTEGER_CST
2112 || TREE_CODE (op2
) == COND_EXPR
))
2114 conversion_warning (type
, op1
);
2115 conversion_warning (type
, op2
);
2121 default: /* 'expr' is not a constant. */
2123 /* Warn for real types converted to integer types. */
2124 if (TREE_CODE (expr_type
) == REAL_TYPE
2125 && TREE_CODE (type
) == INTEGER_TYPE
)
2126 give_warning
= true;
2128 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2129 && TREE_CODE (type
) == INTEGER_TYPE
)
2131 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
2132 expr
= get_unwidened (expr
, 0);
2133 expr_type
= TREE_TYPE (expr
);
2135 /* Don't warn for short y; short x = ((int)y & 0xff); */
2136 if (TREE_CODE (expr
) == BIT_AND_EXPR
2137 || TREE_CODE (expr
) == BIT_IOR_EXPR
2138 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
2140 /* If both args were extended from a shortest type,
2141 use that type if that is safe. */
2142 expr_type
= shorten_binary_op (expr_type
,
2143 TREE_OPERAND (expr
, 0),
2144 TREE_OPERAND (expr
, 1),
2147 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
2149 tree op0
= TREE_OPERAND (expr
, 0);
2150 tree op1
= TREE_OPERAND (expr
, 1);
2151 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2152 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2154 /* If one of the operands is a non-negative constant
2155 that fits in the target type, then the type of the
2156 other operand does not matter. */
2157 if ((TREE_CODE (op0
) == INTEGER_CST
2158 && int_fits_type_p (op0
, c_common_signed_type (type
))
2159 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
2160 || (TREE_CODE (op1
) == INTEGER_CST
2161 && int_fits_type_p (op1
, c_common_signed_type (type
))
2162 && int_fits_type_p (op1
,
2163 c_common_unsigned_type (type
))))
2165 /* If constant is unsigned and fits in the target
2166 type, then the result will also fit. */
2167 else if ((TREE_CODE (op0
) == INTEGER_CST
2169 && int_fits_type_p (op0
, type
))
2170 || (TREE_CODE (op1
) == INTEGER_CST
2172 && int_fits_type_p (op1
, type
)))
2176 /* Warn for integer types converted to smaller integer types. */
2177 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2178 give_warning
= true;
2180 /* When they are the same width but different signedness,
2181 then the value may change. */
2182 else if ((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
2183 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
2184 /* Even when converted to a bigger type, if the type is
2185 unsigned but expr is signed, then negative values
2187 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
2188 warning (OPT_Wsign_conversion
, "conversion to %qT from %qT "
2189 "may change the sign of the result",
2193 /* Warn for integer types converted to real types if and only if
2194 all the range of values of the integer type cannot be
2195 represented by the real type. */
2196 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
2197 && TREE_CODE (type
) == REAL_TYPE
)
2199 tree type_low_bound
, type_high_bound
;
2200 REAL_VALUE_TYPE real_low_bound
, real_high_bound
;
2202 /* Don't warn about char y = 0xff; float x = (int) y; */
2203 expr
= get_unwidened (expr
, 0);
2204 expr_type
= TREE_TYPE (expr
);
2206 type_low_bound
= TYPE_MIN_VALUE (expr_type
);
2207 type_high_bound
= TYPE_MAX_VALUE (expr_type
);
2208 real_low_bound
= real_value_from_int_cst (0, type_low_bound
);
2209 real_high_bound
= real_value_from_int_cst (0, type_high_bound
);
2211 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
2212 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
2213 give_warning
= true;
2216 /* Warn for real types converted to smaller real types. */
2217 else if (TREE_CODE (expr_type
) == REAL_TYPE
2218 && TREE_CODE (type
) == REAL_TYPE
2219 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
2220 give_warning
= true;
2224 warning (OPT_Wconversion
,
2225 "conversion to %qT from %qT may alter its value",
2230 /* Produce warnings after a conversion. RESULT is the result of
2231 converting EXPR to TYPE. This is a helper function for
2232 convert_and_check and cp_convert_and_check. */
2235 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
2237 if (TREE_CODE (expr
) == INTEGER_CST
2238 && (TREE_CODE (type
) == INTEGER_TYPE
2239 || TREE_CODE (type
) == ENUMERAL_TYPE
)
2240 && !int_fits_type_p (expr
, type
))
2242 /* Do not diagnose overflow in a constant expression merely
2243 because a conversion overflowed. */
2244 if (TREE_OVERFLOW (result
))
2245 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
2247 if (TYPE_UNSIGNED (type
))
2249 /* This detects cases like converting -129 or 256 to
2251 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
2252 warning (OPT_Woverflow
,
2253 "large integer implicitly truncated to unsigned type");
2255 conversion_warning (type
, expr
);
2257 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
2258 warning (OPT_Woverflow
,
2259 "overflow in implicit constant conversion");
2260 /* No warning for converting 0x80000000 to int. */
2262 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
2263 || TYPE_PRECISION (TREE_TYPE (expr
))
2264 != TYPE_PRECISION (type
)))
2265 warning (OPT_Woverflow
,
2266 "overflow in implicit constant conversion");
2269 conversion_warning (type
, expr
);
2271 else if ((TREE_CODE (result
) == INTEGER_CST
2272 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
2273 warning (OPT_Woverflow
,
2274 "overflow in implicit constant conversion");
2276 conversion_warning (type
, expr
);
2280 /* Convert EXPR to TYPE, warning about conversion problems with constants.
2281 Invoke this function on every expression that is converted implicitly,
2282 i.e. because of language rules and not because of an explicit cast. */
2285 convert_and_check (tree type
, tree expr
)
2288 tree expr_for_warning
;
2290 /* Convert from a value with possible excess precision rather than
2291 via the semantic type, but do not warn about values not fitting
2292 exactly in the semantic type. */
2293 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
2295 tree orig_type
= TREE_TYPE (expr
);
2296 expr
= TREE_OPERAND (expr
, 0);
2297 expr_for_warning
= convert (orig_type
, expr
);
2298 if (orig_type
== type
)
2299 return expr_for_warning
;
2302 expr_for_warning
= expr
;
2304 if (TREE_TYPE (expr
) == type
)
2307 result
= convert (type
, expr
);
2309 if (c_inhibit_evaluation_warnings
== 0
2310 && !TREE_OVERFLOW_P (expr
)
2311 && result
!= error_mark_node
)
2312 warnings_for_convert_and_check (type
, expr_for_warning
, result
);
2317 /* A node in a list that describes references to variables (EXPR), which are
2318 either read accesses if WRITER is zero, or write accesses, in which case
2319 WRITER is the parent of EXPR. */
2326 /* Used to implement a cache the results of a call to verify_tree. We only
2327 use this for SAVE_EXPRs. */
2330 struct tlist_cache
*next
;
2331 struct tlist
*cache_before_sp
;
2332 struct tlist
*cache_after_sp
;
2336 /* Obstack to use when allocating tlist structures, and corresponding
2338 static struct obstack tlist_obstack
;
2339 static char *tlist_firstobj
= 0;
2341 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
2343 static struct tlist
*warned_ids
;
2344 /* SAVE_EXPRs need special treatment. We process them only once and then
2345 cache the results. */
2346 static struct tlist_cache
*save_expr_cache
;
2348 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
2349 static void merge_tlist (struct tlist
**, struct tlist
*, int);
2350 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
2351 static int warning_candidate_p (tree
);
2352 static bool candidate_equal_p (const_tree
, const_tree
);
2353 static void warn_for_collisions (struct tlist
*);
2354 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
2355 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
2357 /* Create a new struct tlist and fill in its fields. */
2358 static struct tlist
*
2359 new_tlist (struct tlist
*next
, tree t
, tree writer
)
2362 l
= XOBNEW (&tlist_obstack
, struct tlist
);
2369 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
2370 is nonnull, we ignore any node we find which has a writer equal to it. */
2373 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
2377 struct tlist
*next
= add
->next
;
2380 if (!exclude_writer
|| !candidate_equal_p (add
->writer
, exclude_writer
))
2381 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
2386 /* Merge the nodes of ADD into TO. This merging process is done so that for
2387 each variable that already exists in TO, no new node is added; however if
2388 there is a write access recorded in ADD, and an occurrence on TO is only
2389 a read access, then the occurrence in TO will be modified to record the
2393 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
2395 struct tlist
**end
= to
;
2398 end
= &(*end
)->next
;
2404 struct tlist
*next
= add
->next
;
2406 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
2407 if (candidate_equal_p (tmp2
->expr
, add
->expr
))
2411 tmp2
->writer
= add
->writer
;
2415 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
2416 end
= &(*end
)->next
;
2423 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
2424 references in list LIST conflict with it, excluding reads if ONLY writers
2428 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
2433 /* Avoid duplicate warnings. */
2434 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
2435 if (candidate_equal_p (tmp
->expr
, written
))
2440 if (candidate_equal_p (list
->expr
, written
)
2441 && !candidate_equal_p (list
->writer
, writer
)
2442 && (!only_writes
|| list
->writer
))
2444 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
2445 warning_at (EXPR_HAS_LOCATION (writer
)
2446 ? EXPR_LOCATION (writer
) : input_location
,
2447 OPT_Wsequence_point
, "operation on %qE may be undefined",
2454 /* Given a list LIST of references to variables, find whether any of these
2455 can cause conflicts due to missing sequence points. */
2458 warn_for_collisions (struct tlist
*list
)
2462 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
2465 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
2469 /* Return nonzero if X is a tree that can be verified by the sequence point
2472 warning_candidate_p (tree x
)
2474 /* !VOID_TYPE_P (TREE_TYPE (x)) is workaround for cp/tree.c
2475 (lvalue_p) crash on TRY/CATCH. */
2476 return !(DECL_P (x
) && DECL_ARTIFICIAL (x
))
2477 && TREE_TYPE (x
) && !VOID_TYPE_P (TREE_TYPE (x
)) && lvalue_p (x
);
2480 /* Return nonzero if X and Y appear to be the same candidate (or NULL) */
2482 candidate_equal_p (const_tree x
, const_tree y
)
2484 return (x
== y
) || (x
&& y
&& operand_equal_p (x
, y
, 0));
2487 /* Walk the tree X, and record accesses to variables. If X is written by the
2488 parent tree, WRITER is the parent.
2489 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2490 expression or its only operand forces a sequence point, then everything up
2491 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2493 Once we return, we will have emitted warnings if any subexpression before
2494 such a sequence point could be undefined. On a higher level, however, the
2495 sequence point may not be relevant, and we'll merge the two lists.
2497 Example: (b++, a) + b;
2498 The call that processes the COMPOUND_EXPR will store the increment of B
2499 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2500 processes the PLUS_EXPR will need to merge the two lists so that
2501 eventually, all accesses end up on the same list (and we'll warn about the
2502 unordered subexpressions b++ and b.
2504 A note on merging. If we modify the former example so that our expression
2507 care must be taken not simply to add all three expressions into the final
2508 PNO_SP list. The function merge_tlist takes care of that by merging the
2509 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2510 way, so that no more than one access to B is recorded. */
2513 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
2516 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
2517 enum tree_code code
;
2518 enum tree_code_class cl
;
2520 /* X may be NULL if it is the operand of an empty statement expression
2526 code
= TREE_CODE (x
);
2527 cl
= TREE_CODE_CLASS (code
);
2529 if (warning_candidate_p (x
))
2530 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
2538 case TRUTH_ANDIF_EXPR
:
2539 case TRUTH_ORIF_EXPR
:
2540 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2541 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2542 warn_for_collisions (tmp_nosp
);
2543 merge_tlist (pbefore_sp
, tmp_before
, 0);
2544 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
2545 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
2546 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2550 tmp_before
= tmp_list2
= 0;
2551 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
2552 warn_for_collisions (tmp_list2
);
2553 merge_tlist (pbefore_sp
, tmp_before
, 0);
2554 merge_tlist (pbefore_sp
, tmp_list2
, 1);
2556 tmp_list3
= tmp_nosp
= 0;
2557 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
2558 warn_for_collisions (tmp_nosp
);
2559 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2561 tmp_list3
= tmp_list2
= 0;
2562 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
2563 warn_for_collisions (tmp_list2
);
2564 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2565 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2566 two first, to avoid warning for (a ? b++ : b++). */
2567 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
2568 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2571 case PREDECREMENT_EXPR
:
2572 case PREINCREMENT_EXPR
:
2573 case POSTDECREMENT_EXPR
:
2574 case POSTINCREMENT_EXPR
:
2575 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
2579 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2580 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2581 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
2582 /* Expressions inside the LHS are not ordered wrt. the sequence points
2583 in the RHS. Example:
2585 Despite the fact that the modification of "a" is in the before_sp
2586 list (tmp_before), it conflicts with the use of "a" in the LHS.
2587 We can handle this by adding the contents of tmp_list3
2588 to those of tmp_before, and redoing the collision warnings for that
2590 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
2591 warn_for_collisions (tmp_before
);
2592 /* Exclude the LHS itself here; we first have to merge it into the
2593 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2594 didn't exclude the LHS, we'd get it twice, once as a read and once
2596 add_tlist (pno_sp
, tmp_list3
, x
, 0);
2597 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
2599 merge_tlist (pbefore_sp
, tmp_before
, 0);
2600 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
2601 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
2602 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
2606 /* We need to warn about conflicts among arguments and conflicts between
2607 args and the function address. Side effects of the function address,
2608 however, are not ordered by the sequence point of the call. */
2610 call_expr_arg_iterator iter
;
2612 tmp_before
= tmp_nosp
= 0;
2613 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2614 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
2616 tmp_list2
= tmp_list3
= 0;
2617 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
2618 merge_tlist (&tmp_list3
, tmp_list2
, 0);
2619 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
2621 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
2622 warn_for_collisions (tmp_before
);
2623 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
2628 /* Scan all the list, e.g. indices of multi dimensional array. */
2631 tmp_before
= tmp_nosp
= 0;
2632 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2633 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2634 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2641 struct tlist_cache
*t
;
2642 for (t
= save_expr_cache
; t
; t
= t
->next
)
2643 if (candidate_equal_p (t
->expr
, x
))
2648 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
2649 t
->next
= save_expr_cache
;
2651 save_expr_cache
= t
;
2653 tmp_before
= tmp_nosp
= 0;
2654 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2655 warn_for_collisions (tmp_nosp
);
2660 struct tlist
*t
= tmp_nosp
;
2662 merge_tlist (&tmp_list3
, t
, 0);
2664 t
->cache_before_sp
= tmp_before
;
2665 t
->cache_after_sp
= tmp_list3
;
2667 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
2668 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
2673 x
= TREE_OPERAND (x
, 0);
2680 /* For other expressions, simply recurse on their operands.
2681 Manual tail recursion for unary expressions.
2682 Other non-expressions need not be processed. */
2683 if (cl
== tcc_unary
)
2685 x
= TREE_OPERAND (x
, 0);
2689 else if (IS_EXPR_CODE_CLASS (cl
))
2692 int max
= TREE_OPERAND_LENGTH (x
);
2693 for (lp
= 0; lp
< max
; lp
++)
2695 tmp_before
= tmp_nosp
= 0;
2696 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
2697 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2698 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2705 /* Try to warn for undefined behavior in EXPR due to missing sequence
2709 verify_sequence_points (tree expr
)
2711 struct tlist
*before_sp
= 0, *after_sp
= 0;
2714 save_expr_cache
= 0;
2715 if (tlist_firstobj
== 0)
2717 gcc_obstack_init (&tlist_obstack
);
2718 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
2721 verify_tree (expr
, &before_sp
, &after_sp
, 0);
2722 warn_for_collisions (after_sp
);
2723 obstack_free (&tlist_obstack
, tlist_firstobj
);
2726 /* Validate the expression after `case' and apply default promotions. */
2729 check_case_value (tree value
)
2731 if (value
== NULL_TREE
)
2734 /* ??? Can we ever get nops here for a valid case value? We
2736 STRIP_TYPE_NOPS (value
);
2737 /* In C++, the following is allowed:
2740 switch (...) { case i: ... }
2742 So, we try to reduce the VALUE to a constant that way. */
2743 if (c_dialect_cxx ())
2745 value
= decl_constant_value (value
);
2746 STRIP_TYPE_NOPS (value
);
2747 value
= fold (value
);
2750 if (TREE_CODE (value
) == INTEGER_CST
)
2751 /* Promote char or short to int. */
2752 value
= perform_integral_promotions (value
);
2753 else if (value
!= error_mark_node
)
2755 error ("case label does not reduce to an integer constant");
2756 value
= error_mark_node
;
2759 constant_expression_warning (value
);
2764 /* See if the case values LOW and HIGH are in the range of the original
2765 type (i.e. before the default conversion to int) of the switch testing
2767 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2768 the type before promoting it. CASE_LOW_P is a pointer to the lower
2769 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2770 if the case is not a case range.
2771 The caller has to make sure that we are not called with NULL for
2772 CASE_LOW_P (i.e. the default case).
2773 Returns true if the case label is in range of ORIG_TYPE (saturated or
2774 untouched) or false if the label is out of range. */
2777 check_case_bounds (tree type
, tree orig_type
,
2778 tree
*case_low_p
, tree
*case_high_p
)
2780 tree min_value
, max_value
;
2781 tree case_low
= *case_low_p
;
2782 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2784 /* If there was a problem with the original type, do nothing. */
2785 if (orig_type
== error_mark_node
)
2788 min_value
= TYPE_MIN_VALUE (orig_type
);
2789 max_value
= TYPE_MAX_VALUE (orig_type
);
2791 /* Case label is less than minimum for type. */
2792 if (tree_int_cst_compare (case_low
, min_value
) < 0
2793 && tree_int_cst_compare (case_high
, min_value
) < 0)
2795 warning (0, "case label value is less than minimum value for type");
2799 /* Case value is greater than maximum for type. */
2800 if (tree_int_cst_compare (case_low
, max_value
) > 0
2801 && tree_int_cst_compare (case_high
, max_value
) > 0)
2803 warning (0, "case label value exceeds maximum value for type");
2807 /* Saturate lower case label value to minimum. */
2808 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2809 && tree_int_cst_compare (case_low
, min_value
) < 0)
2811 warning (0, "lower value in case label range"
2812 " less than minimum value for type");
2813 case_low
= min_value
;
2816 /* Saturate upper case label value to maximum. */
2817 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2818 && tree_int_cst_compare (case_high
, max_value
) > 0)
2820 warning (0, "upper value in case label range"
2821 " exceeds maximum value for type");
2822 case_high
= max_value
;
2825 if (*case_low_p
!= case_low
)
2826 *case_low_p
= convert (type
, case_low
);
2827 if (case_high_p
&& *case_high_p
!= case_high
)
2828 *case_high_p
= convert (type
, case_high
);
2833 /* Return an integer type with BITS bits of precision,
2834 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2837 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2839 if (bits
== TYPE_PRECISION (integer_type_node
))
2840 return unsignedp
? unsigned_type_node
: integer_type_node
;
2842 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2843 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2845 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2846 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2848 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2849 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2851 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2852 return (unsignedp
? long_long_unsigned_type_node
2853 : long_long_integer_type_node
);
2855 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2856 return (unsignedp
? widest_unsigned_literal_type_node
2857 : widest_integer_literal_type_node
);
2859 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2860 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2862 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2863 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2865 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2866 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2868 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2869 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2874 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2875 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2876 and saturating if SATP is nonzero, otherwise not saturating. */
2879 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2880 int unsignedp
, int satp
)
2882 enum machine_mode mode
;
2884 mode
= unsignedp
? UQQmode
: QQmode
;
2886 mode
= unsignedp
? UHAmode
: HAmode
;
2888 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2889 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2892 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2894 sorry ("GCC cannot support operators with integer types and "
2895 "fixed-point types that have too many integral and "
2896 "fractional bits together");
2900 return c_common_type_for_mode (mode
, satp
);
2903 /* Used for communication between c_common_type_for_mode and
2904 c_register_builtin_type. */
2905 static GTY(()) tree registered_builtin_types
;
2907 /* Return a data type that has machine mode MODE.
2908 If the mode is an integer,
2909 then UNSIGNEDP selects between signed and unsigned types.
2910 If the mode is a fixed-point mode,
2911 then UNSIGNEDP selects between saturating and nonsaturating types. */
2914 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
2918 if (mode
== TYPE_MODE (integer_type_node
))
2919 return unsignedp
? unsigned_type_node
: integer_type_node
;
2921 if (mode
== TYPE_MODE (signed_char_type_node
))
2922 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2924 if (mode
== TYPE_MODE (short_integer_type_node
))
2925 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2927 if (mode
== TYPE_MODE (long_integer_type_node
))
2928 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2930 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2931 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2933 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2934 return unsignedp
? widest_unsigned_literal_type_node
2935 : widest_integer_literal_type_node
;
2938 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2941 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2944 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2947 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2949 #if HOST_BITS_PER_WIDE_INT >= 64
2950 if (mode
== TYPE_MODE (intTI_type_node
))
2951 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2954 if (mode
== TYPE_MODE (float_type_node
))
2955 return float_type_node
;
2957 if (mode
== TYPE_MODE (double_type_node
))
2958 return double_type_node
;
2960 if (mode
== TYPE_MODE (long_double_type_node
))
2961 return long_double_type_node
;
2963 if (mode
== TYPE_MODE (void_type_node
))
2964 return void_type_node
;
2966 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2968 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2969 : make_signed_type (GET_MODE_PRECISION (mode
)));
2971 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2973 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2974 : make_signed_type (GET_MODE_PRECISION (mode
)));
2976 if (COMPLEX_MODE_P (mode
))
2978 enum machine_mode inner_mode
;
2981 if (mode
== TYPE_MODE (complex_float_type_node
))
2982 return complex_float_type_node
;
2983 if (mode
== TYPE_MODE (complex_double_type_node
))
2984 return complex_double_type_node
;
2985 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2986 return complex_long_double_type_node
;
2988 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2989 return complex_integer_type_node
;
2991 inner_mode
= GET_MODE_INNER (mode
);
2992 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2993 if (inner_type
!= NULL_TREE
)
2994 return build_complex_type (inner_type
);
2996 else if (VECTOR_MODE_P (mode
))
2998 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2999 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
3000 if (inner_type
!= NULL_TREE
)
3001 return build_vector_type_for_mode (inner_type
, mode
);
3004 if (mode
== TYPE_MODE (dfloat32_type_node
))
3005 return dfloat32_type_node
;
3006 if (mode
== TYPE_MODE (dfloat64_type_node
))
3007 return dfloat64_type_node
;
3008 if (mode
== TYPE_MODE (dfloat128_type_node
))
3009 return dfloat128_type_node
;
3011 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
3013 if (mode
== TYPE_MODE (short_fract_type_node
))
3014 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
3015 if (mode
== TYPE_MODE (fract_type_node
))
3016 return unsignedp
? sat_fract_type_node
: fract_type_node
;
3017 if (mode
== TYPE_MODE (long_fract_type_node
))
3018 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
3019 if (mode
== TYPE_MODE (long_long_fract_type_node
))
3020 return unsignedp
? sat_long_long_fract_type_node
3021 : long_long_fract_type_node
;
3023 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
3024 return unsignedp
? sat_unsigned_short_fract_type_node
3025 : unsigned_short_fract_type_node
;
3026 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
3027 return unsignedp
? sat_unsigned_fract_type_node
3028 : unsigned_fract_type_node
;
3029 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
3030 return unsignedp
? sat_unsigned_long_fract_type_node
3031 : unsigned_long_fract_type_node
;
3032 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
3033 return unsignedp
? sat_unsigned_long_long_fract_type_node
3034 : unsigned_long_long_fract_type_node
;
3036 if (mode
== TYPE_MODE (short_accum_type_node
))
3037 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
3038 if (mode
== TYPE_MODE (accum_type_node
))
3039 return unsignedp
? sat_accum_type_node
: accum_type_node
;
3040 if (mode
== TYPE_MODE (long_accum_type_node
))
3041 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
3042 if (mode
== TYPE_MODE (long_long_accum_type_node
))
3043 return unsignedp
? sat_long_long_accum_type_node
3044 : long_long_accum_type_node
;
3046 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
3047 return unsignedp
? sat_unsigned_short_accum_type_node
3048 : unsigned_short_accum_type_node
;
3049 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
3050 return unsignedp
? sat_unsigned_accum_type_node
3051 : unsigned_accum_type_node
;
3052 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
3053 return unsignedp
? sat_unsigned_long_accum_type_node
3054 : unsigned_long_accum_type_node
;
3055 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
3056 return unsignedp
? sat_unsigned_long_long_accum_type_node
3057 : unsigned_long_long_accum_type_node
;
3060 return unsignedp
? sat_qq_type_node
: qq_type_node
;
3062 return unsignedp
? sat_hq_type_node
: hq_type_node
;
3064 return unsignedp
? sat_sq_type_node
: sq_type_node
;
3066 return unsignedp
? sat_dq_type_node
: dq_type_node
;
3068 return unsignedp
? sat_tq_type_node
: tq_type_node
;
3070 if (mode
== UQQmode
)
3071 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
3072 if (mode
== UHQmode
)
3073 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
3074 if (mode
== USQmode
)
3075 return unsignedp
? sat_usq_type_node
: usq_type_node
;
3076 if (mode
== UDQmode
)
3077 return unsignedp
? sat_udq_type_node
: udq_type_node
;
3078 if (mode
== UTQmode
)
3079 return unsignedp
? sat_utq_type_node
: utq_type_node
;
3082 return unsignedp
? sat_ha_type_node
: ha_type_node
;
3084 return unsignedp
? sat_sa_type_node
: sa_type_node
;
3086 return unsignedp
? sat_da_type_node
: da_type_node
;
3088 return unsignedp
? sat_ta_type_node
: ta_type_node
;
3090 if (mode
== UHAmode
)
3091 return unsignedp
? sat_uha_type_node
: uha_type_node
;
3092 if (mode
== USAmode
)
3093 return unsignedp
? sat_usa_type_node
: usa_type_node
;
3094 if (mode
== UDAmode
)
3095 return unsignedp
? sat_uda_type_node
: uda_type_node
;
3096 if (mode
== UTAmode
)
3097 return unsignedp
? sat_uta_type_node
: uta_type_node
;
3100 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
3101 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
3102 return TREE_VALUE (t
);
3108 c_common_unsigned_type (tree type
)
3110 return c_common_signed_or_unsigned_type (1, type
);
3113 /* Return a signed type the same as TYPE in other respects. */
3116 c_common_signed_type (tree type
)
3118 return c_common_signed_or_unsigned_type (0, type
);
3121 /* Return a type the same as TYPE except unsigned or
3122 signed according to UNSIGNEDP. */
3125 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
3129 /* This block of code emulates the behavior of the old
3130 c_common_unsigned_type. In particular, it returns
3131 long_unsigned_type_node if passed a long, even when a int would
3132 have the same size. This is necessary for warnings to work
3133 correctly in archs where sizeof(int) == sizeof(long) */
3135 type1
= TYPE_MAIN_VARIANT (type
);
3136 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
3137 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3138 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3139 return unsignedp
? unsigned_type_node
: integer_type_node
;
3140 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3141 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3142 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3143 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3144 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
3145 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
3146 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
3147 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
3148 #if HOST_BITS_PER_WIDE_INT >= 64
3149 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3150 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3152 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3153 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3154 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3155 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3156 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3157 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3158 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3159 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3161 #define C_COMMON_FIXED_TYPES(NAME) \
3162 if (type1 == short_ ## NAME ## _type_node \
3163 || type1 == unsigned_short_ ## NAME ## _type_node) \
3164 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3165 : short_ ## NAME ## _type_node; \
3166 if (type1 == NAME ## _type_node \
3167 || type1 == unsigned_ ## NAME ## _type_node) \
3168 return unsignedp ? unsigned_ ## NAME ## _type_node \
3169 : NAME ## _type_node; \
3170 if (type1 == long_ ## NAME ## _type_node \
3171 || type1 == unsigned_long_ ## NAME ## _type_node) \
3172 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3173 : long_ ## NAME ## _type_node; \
3174 if (type1 == long_long_ ## NAME ## _type_node \
3175 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3176 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3177 : long_long_ ## NAME ## _type_node;
3179 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
3180 if (type1 == NAME ## _type_node \
3181 || type1 == u ## NAME ## _type_node) \
3182 return unsignedp ? u ## NAME ## _type_node \
3183 : NAME ## _type_node;
3185 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
3186 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3187 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3188 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3189 : sat_ ## short_ ## NAME ## _type_node; \
3190 if (type1 == sat_ ## NAME ## _type_node \
3191 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3192 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3193 : sat_ ## NAME ## _type_node; \
3194 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3195 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3196 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3197 : sat_ ## long_ ## NAME ## _type_node; \
3198 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3199 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3200 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3201 : sat_ ## long_long_ ## NAME ## _type_node;
3203 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
3204 if (type1 == sat_ ## NAME ## _type_node \
3205 || type1 == sat_ ## u ## NAME ## _type_node) \
3206 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3207 : sat_ ## NAME ## _type_node;
3209 C_COMMON_FIXED_TYPES (fract
);
3210 C_COMMON_FIXED_TYPES_SAT (fract
);
3211 C_COMMON_FIXED_TYPES (accum
);
3212 C_COMMON_FIXED_TYPES_SAT (accum
);
3214 C_COMMON_FIXED_MODE_TYPES (qq
);
3215 C_COMMON_FIXED_MODE_TYPES (hq
);
3216 C_COMMON_FIXED_MODE_TYPES (sq
);
3217 C_COMMON_FIXED_MODE_TYPES (dq
);
3218 C_COMMON_FIXED_MODE_TYPES (tq
);
3219 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
3220 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
3221 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
3222 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
3223 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
3224 C_COMMON_FIXED_MODE_TYPES (ha
);
3225 C_COMMON_FIXED_MODE_TYPES (sa
);
3226 C_COMMON_FIXED_MODE_TYPES (da
);
3227 C_COMMON_FIXED_MODE_TYPES (ta
);
3228 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
3229 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
3230 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
3231 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
3233 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3234 the precision; they have precision set to match their range, but
3235 may use a wider mode to match an ABI. If we change modes, we may
3236 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3237 the precision as well, so as to yield correct results for
3238 bit-field types. C++ does not have these separate bit-field
3239 types, and producing a signed or unsigned variant of an
3240 ENUMERAL_TYPE may cause other problems as well. */
3242 if (!INTEGRAL_TYPE_P (type
)
3243 || TYPE_UNSIGNED (type
) == unsignedp
)
3246 #define TYPE_OK(node) \
3247 (TYPE_MODE (type) == TYPE_MODE (node) \
3248 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3249 if (TYPE_OK (signed_char_type_node
))
3250 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3251 if (TYPE_OK (integer_type_node
))
3252 return unsignedp
? unsigned_type_node
: integer_type_node
;
3253 if (TYPE_OK (short_integer_type_node
))
3254 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3255 if (TYPE_OK (long_integer_type_node
))
3256 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3257 if (TYPE_OK (long_long_integer_type_node
))
3258 return (unsignedp
? long_long_unsigned_type_node
3259 : long_long_integer_type_node
);
3260 if (TYPE_OK (widest_integer_literal_type_node
))
3261 return (unsignedp
? widest_unsigned_literal_type_node
3262 : widest_integer_literal_type_node
);
3264 #if HOST_BITS_PER_WIDE_INT >= 64
3265 if (TYPE_OK (intTI_type_node
))
3266 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3268 if (TYPE_OK (intDI_type_node
))
3269 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3270 if (TYPE_OK (intSI_type_node
))
3271 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3272 if (TYPE_OK (intHI_type_node
))
3273 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3274 if (TYPE_OK (intQI_type_node
))
3275 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3278 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3281 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
3284 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
3286 /* Extended integer types of the same width as a standard type have
3287 lesser rank, so those of the same width as int promote to int or
3288 unsigned int and are valid for printf formats expecting int or
3289 unsigned int. To avoid such special cases, avoid creating
3290 extended integer types for bit-fields if a standard integer type
3292 if (width
== TYPE_PRECISION (integer_type_node
))
3293 return unsignedp
? unsigned_type_node
: integer_type_node
;
3294 if (width
== TYPE_PRECISION (signed_char_type_node
))
3295 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3296 if (width
== TYPE_PRECISION (short_integer_type_node
))
3297 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3298 if (width
== TYPE_PRECISION (long_integer_type_node
))
3299 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3300 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
3301 return (unsignedp
? long_long_unsigned_type_node
3302 : long_long_integer_type_node
);
3303 return build_nonstandard_integer_type (width
, unsignedp
);
3306 /* The C version of the register_builtin_type langhook. */
3309 c_register_builtin_type (tree type
, const char* name
)
3313 decl
= build_decl (UNKNOWN_LOCATION
,
3314 TYPE_DECL
, get_identifier (name
), type
);
3315 DECL_ARTIFICIAL (decl
) = 1;
3316 if (!TYPE_NAME (type
))
3317 TYPE_NAME (type
) = decl
;
3320 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
3323 /* Print an error message for invalid operands to arith operation
3324 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
3325 LOCATION is the location of the message. */
3328 binary_op_error (location_t location
, enum tree_code code
,
3329 tree type0
, tree type1
)
3336 opname
= "+"; break;
3338 opname
= "-"; break;
3340 opname
= "*"; break;
3342 opname
= "max"; break;
3344 opname
= "min"; break;
3346 opname
= "=="; break;
3348 opname
= "!="; break;
3350 opname
= "<="; break;
3352 opname
= ">="; break;
3354 opname
= "<"; break;
3356 opname
= ">"; break;
3358 opname
= "<<"; break;
3360 opname
= ">>"; break;
3361 case TRUNC_MOD_EXPR
:
3362 case FLOOR_MOD_EXPR
:
3363 opname
= "%"; break;
3364 case TRUNC_DIV_EXPR
:
3365 case FLOOR_DIV_EXPR
:
3366 opname
= "/"; break;
3368 opname
= "&"; break;
3370 opname
= "|"; break;
3371 case TRUTH_ANDIF_EXPR
:
3372 opname
= "&&"; break;
3373 case TRUTH_ORIF_EXPR
:
3374 opname
= "||"; break;
3376 opname
= "^"; break;
3381 "invalid operands to binary %s (have %qT and %qT)", opname
,
3385 /* Subroutine of build_binary_op, used for comparison operations.
3386 See if the operands have both been converted from subword integer types
3387 and, if so, perhaps change them both back to their original type.
3388 This function is also responsible for converting the two operands
3389 to the proper common type for comparison.
3391 The arguments of this function are all pointers to local variables
3392 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
3393 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
3395 If this function returns nonzero, it means that the comparison has
3396 a constant value. What this function returns is an expression for
3400 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
3401 enum tree_code
*rescode_ptr
)
3404 tree op0
= *op0_ptr
;
3405 tree op1
= *op1_ptr
;
3406 int unsignedp0
, unsignedp1
;
3408 tree primop0
, primop1
;
3409 enum tree_code code
= *rescode_ptr
;
3411 /* Throw away any conversions to wider types
3412 already present in the operands. */
3414 primop0
= get_narrower (op0
, &unsignedp0
);
3415 primop1
= get_narrower (op1
, &unsignedp1
);
3417 /* Handle the case that OP0 does not *contain* a conversion
3418 but it *requires* conversion to FINAL_TYPE. */
3420 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
3421 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
3422 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
3423 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
3425 /* If one of the operands must be floated, we cannot optimize. */
3426 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
3427 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
3429 /* If first arg is constant, swap the args (changing operation
3430 so value is preserved), for canonicalization. Don't do this if
3431 the second arg is 0. */
3433 if (TREE_CONSTANT (primop0
)
3434 && !integer_zerop (primop1
) && !real_zerop (primop1
)
3435 && !fixed_zerop (primop1
))
3438 int temi
= unsignedp0
;
3446 unsignedp0
= unsignedp1
;
3469 *rescode_ptr
= code
;
3472 /* If comparing an integer against a constant more bits wide,
3473 maybe we can deduce a value of 1 or 0 independent of the data.
3474 Or else truncate the constant now
3475 rather than extend the variable at run time.
3477 This is only interesting if the constant is the wider arg.
3478 Also, it is not safe if the constant is unsigned and the
3479 variable arg is signed, since in this case the variable
3480 would be sign-extended and then regarded as unsigned.
3481 Our technique fails in this case because the lowest/highest
3482 possible unsigned results don't follow naturally from the
3483 lowest/highest possible values of the variable operand.
3484 For just EQ_EXPR and NE_EXPR there is another technique that
3485 could be used: see if the constant can be faithfully represented
3486 in the other operand's type, by truncating it and reextending it
3487 and see if that preserves the constant's value. */
3489 if (!real1
&& !real2
3490 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
3491 && TREE_CODE (primop1
) == INTEGER_CST
3492 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
3494 int min_gt
, max_gt
, min_lt
, max_lt
;
3495 tree maxval
, minval
;
3496 /* 1 if comparison is nominally unsigned. */
3497 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
3500 type
= c_common_signed_or_unsigned_type (unsignedp0
,
3501 TREE_TYPE (primop0
));
3503 maxval
= TYPE_MAX_VALUE (type
);
3504 minval
= TYPE_MIN_VALUE (type
);
3506 if (unsignedp
&& !unsignedp0
)
3507 *restype_ptr
= c_common_signed_type (*restype_ptr
);
3509 if (TREE_TYPE (primop1
) != *restype_ptr
)
3511 /* Convert primop1 to target type, but do not introduce
3512 additional overflow. We know primop1 is an int_cst. */
3513 primop1
= force_fit_type_double (*restype_ptr
,
3514 TREE_INT_CST_LOW (primop1
),
3515 TREE_INT_CST_HIGH (primop1
), 0,
3516 TREE_OVERFLOW (primop1
));
3518 if (type
!= *restype_ptr
)
3520 minval
= convert (*restype_ptr
, minval
);
3521 maxval
= convert (*restype_ptr
, maxval
);
3524 if (unsignedp
&& unsignedp0
)
3526 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
3527 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
3528 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
3529 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
3533 min_gt
= INT_CST_LT (primop1
, minval
);
3534 max_gt
= INT_CST_LT (primop1
, maxval
);
3535 min_lt
= INT_CST_LT (minval
, primop1
);
3536 max_lt
= INT_CST_LT (maxval
, primop1
);
3540 /* This used to be a switch, but Genix compiler can't handle that. */
3541 if (code
== NE_EXPR
)
3543 if (max_lt
|| min_gt
)
3544 val
= truthvalue_true_node
;
3546 else if (code
== EQ_EXPR
)
3548 if (max_lt
|| min_gt
)
3549 val
= truthvalue_false_node
;
3551 else if (code
== LT_EXPR
)
3554 val
= truthvalue_true_node
;
3556 val
= truthvalue_false_node
;
3558 else if (code
== GT_EXPR
)
3561 val
= truthvalue_true_node
;
3563 val
= truthvalue_false_node
;
3565 else if (code
== LE_EXPR
)
3568 val
= truthvalue_true_node
;
3570 val
= truthvalue_false_node
;
3572 else if (code
== GE_EXPR
)
3575 val
= truthvalue_true_node
;
3577 val
= truthvalue_false_node
;
3580 /* If primop0 was sign-extended and unsigned comparison specd,
3581 we did a signed comparison above using the signed type bounds.
3582 But the comparison we output must be unsigned.
3584 Also, for inequalities, VAL is no good; but if the signed
3585 comparison had *any* fixed result, it follows that the
3586 unsigned comparison just tests the sign in reverse
3587 (positive values are LE, negative ones GE).
3588 So we can generate an unsigned comparison
3589 against an extreme value of the signed type. */
3591 if (unsignedp
&& !unsignedp0
)
3598 primop1
= TYPE_MIN_VALUE (type
);
3604 primop1
= TYPE_MAX_VALUE (type
);
3611 type
= c_common_unsigned_type (type
);
3614 if (TREE_CODE (primop0
) != INTEGER_CST
)
3616 if (val
== truthvalue_false_node
)
3617 warning (OPT_Wtype_limits
, "comparison is always false due to limited range of data type");
3618 if (val
== truthvalue_true_node
)
3619 warning (OPT_Wtype_limits
, "comparison is always true due to limited range of data type");
3624 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3625 if (TREE_SIDE_EFFECTS (primop0
))
3626 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
3630 /* Value is not predetermined, but do the comparison
3631 in the type of the operand that is not constant.
3632 TYPE is already properly set. */
3635 /* If either arg is decimal float and the other is float, find the
3636 proper common type to use for comparison. */
3637 else if (real1
&& real2
3638 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
3639 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
3640 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3642 else if (real1
&& real2
3643 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3644 == TYPE_PRECISION (TREE_TYPE (primop1
))))
3645 type
= TREE_TYPE (primop0
);
3647 /* If args' natural types are both narrower than nominal type
3648 and both extend in the same manner, compare them
3649 in the type of the wider arg.
3650 Otherwise must actually extend both to the nominal
3651 common type lest different ways of extending
3653 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3655 else if (unsignedp0
== unsignedp1
&& real1
== real2
3656 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
3657 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
3659 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3660 type
= c_common_signed_or_unsigned_type (unsignedp0
3661 || TYPE_UNSIGNED (*restype_ptr
),
3663 /* Make sure shorter operand is extended the right way
3664 to match the longer operand. */
3666 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
3667 TREE_TYPE (primop0
)),
3670 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
3671 TREE_TYPE (primop1
)),
3676 /* Here we must do the comparison on the nominal type
3677 using the args exactly as we received them. */
3678 type
= *restype_ptr
;
3682 if (!real1
&& !real2
&& integer_zerop (primop1
)
3683 && TYPE_UNSIGNED (*restype_ptr
))
3689 /* All unsigned values are >= 0, so we warn. However,
3690 if OP0 is a constant that is >= 0, the signedness of
3691 the comparison isn't an issue, so suppress the
3693 if (warn_type_limits
&& !in_system_header
3694 && !(TREE_CODE (primop0
) == INTEGER_CST
3695 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3697 warning (OPT_Wtype_limits
,
3698 "comparison of unsigned expression >= 0 is always true");
3699 value
= truthvalue_true_node
;
3703 if (warn_type_limits
&& !in_system_header
3704 && !(TREE_CODE (primop0
) == INTEGER_CST
3705 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3707 warning (OPT_Wtype_limits
,
3708 "comparison of unsigned expression < 0 is always false");
3709 value
= truthvalue_false_node
;
3718 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3719 if (TREE_SIDE_EFFECTS (primop0
))
3720 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3727 *op0_ptr
= convert (type
, primop0
);
3728 *op1_ptr
= convert (type
, primop1
);
3730 *restype_ptr
= truthvalue_type_node
;
3735 /* Return a tree for the sum or difference (RESULTCODE says which)
3736 of pointer PTROP and integer INTOP. */
3739 pointer_int_sum (location_t loc
, enum tree_code resultcode
,
3740 tree ptrop
, tree intop
)
3744 /* The result is a pointer of the same type that is being added. */
3745 tree result_type
= TREE_TYPE (ptrop
);
3747 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3749 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3750 "pointer of type %<void *%> used in arithmetic");
3751 size_exp
= integer_one_node
;
3753 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3755 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3756 "pointer to a function used in arithmetic");
3757 size_exp
= integer_one_node
;
3759 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
3761 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3762 "pointer to member function used in arithmetic");
3763 size_exp
= integer_one_node
;
3766 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
3768 /* We are manipulating pointer values, so we don't need to warn
3769 about relying on undefined signed overflow. We disable the
3770 warning here because we use integer types so fold won't know that
3771 they are really pointers. */
3772 fold_defer_overflow_warnings ();
3774 /* If what we are about to multiply by the size of the elements
3775 contains a constant term, apply distributive law
3776 and multiply that constant term separately.
3777 This helps produce common subexpressions. */
3778 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3779 && !TREE_CONSTANT (intop
)
3780 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3781 && TREE_CONSTANT (size_exp
)
3782 /* If the constant comes from pointer subtraction,
3783 skip this optimization--it would cause an error. */
3784 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3785 /* If the constant is unsigned, and smaller than the pointer size,
3786 then we must skip this optimization. This is because it could cause
3787 an overflow error if the constant is negative but INTOP is not. */
3788 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3789 || (TYPE_PRECISION (TREE_TYPE (intop
))
3790 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3792 enum tree_code subcode
= resultcode
;
3793 tree int_type
= TREE_TYPE (intop
);
3794 if (TREE_CODE (intop
) == MINUS_EXPR
)
3795 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3796 /* Convert both subexpression types to the type of intop,
3797 because weird cases involving pointer arithmetic
3798 can result in a sum or difference with different type args. */
3799 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3801 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3802 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3805 /* Convert the integer argument to a type the same size as sizetype
3806 so the multiply won't overflow spuriously. */
3807 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3808 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3809 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3810 TYPE_UNSIGNED (sizetype
)), intop
);
3812 /* Replace the integer argument with a suitable product by the object size.
3813 Do this multiplication as signed, then convert to the appropriate type
3814 for the pointer operation and disregard an overflow that occured only
3815 because of the sign-extension change in the latter conversion. */
3817 tree t
= build_binary_op (loc
,
3819 convert (TREE_TYPE (intop
), size_exp
), 1);
3820 intop
= convert (sizetype
, t
);
3821 if (TREE_OVERFLOW_P (intop
) && !TREE_OVERFLOW (t
))
3822 intop
= build_int_cst_wide (TREE_TYPE (intop
), TREE_INT_CST_LOW (intop
),
3823 TREE_INT_CST_HIGH (intop
));
3826 /* Create the sum or difference. */
3827 if (resultcode
== MINUS_EXPR
)
3828 intop
= fold_build1_loc (loc
, NEGATE_EXPR
, sizetype
, intop
);
3830 ret
= fold_build2_loc (loc
, POINTER_PLUS_EXPR
, result_type
, ptrop
, intop
);
3832 fold_undefer_and_ignore_overflow_warnings ();
3837 /* Wrap a C_MAYBE_CONST_EXPR around an expression that is fully folded
3838 and if NON_CONST is known not to be permitted in an evaluated part
3839 of a constant expression. */
3842 c_wrap_maybe_const (tree expr
, bool non_const
)
3844 bool nowarning
= TREE_NO_WARNING (expr
);
3845 location_t loc
= EXPR_LOCATION (expr
);
3847 /* This should never be called for C++. */
3848 if (c_dialect_cxx ())
3851 /* The result of folding may have a NOP_EXPR to set TREE_NO_WARNING. */
3852 STRIP_TYPE_NOPS (expr
);
3853 expr
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL
, expr
);
3854 C_MAYBE_CONST_EXPR_NON_CONST (expr
) = non_const
;
3856 TREE_NO_WARNING (expr
) = 1;
3857 protected_set_expr_location (expr
, loc
);
3862 /* Wrap a SAVE_EXPR around EXPR, if appropriate. Like save_expr, but
3863 for C folds the inside expression and wraps a C_MAYBE_CONST_EXPR
3864 around the SAVE_EXPR if needed so that c_fully_fold does not need
3865 to look inside SAVE_EXPRs. */
3868 c_save_expr (tree expr
)
3870 bool maybe_const
= true;
3871 if (c_dialect_cxx ())
3872 return save_expr (expr
);
3873 expr
= c_fully_fold (expr
, false, &maybe_const
);
3874 expr
= save_expr (expr
);
3876 expr
= c_wrap_maybe_const (expr
, true);
3880 /* Return whether EXPR is a declaration whose address can never be
3884 decl_with_nonnull_addr_p (const_tree expr
)
3886 return (DECL_P (expr
)
3887 && (TREE_CODE (expr
) == PARM_DECL
3888 || TREE_CODE (expr
) == LABEL_DECL
3889 || !DECL_WEAK (expr
)));
3892 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3893 or for an `if' or `while' statement or ?..: exp. It should already
3894 have been validated to be of suitable type; otherwise, a bad
3895 diagnostic may result.
3897 The EXPR is located at LOCATION.
3899 This preparation consists of taking the ordinary
3900 representation of an expression expr and producing a valid tree
3901 boolean expression describing whether expr is nonzero. We could
3902 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3903 but we optimize comparisons, &&, ||, and !.
3905 The resulting type should always be `truthvalue_type_node'. */
3908 c_common_truthvalue_conversion (location_t location
, tree expr
)
3910 switch (TREE_CODE (expr
))
3912 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3913 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3914 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3915 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3916 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3918 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3919 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3922 case TRUTH_ANDIF_EXPR
:
3923 case TRUTH_ORIF_EXPR
:
3924 case TRUTH_AND_EXPR
:
3926 case TRUTH_XOR_EXPR
:
3927 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3929 expr
= build2 (TREE_CODE (expr
), truthvalue_type_node
,
3930 c_common_truthvalue_conversion (location
,
3931 TREE_OPERAND (expr
, 0)),
3932 c_common_truthvalue_conversion (location
,
3933 TREE_OPERAND (expr
, 1)));
3936 case TRUTH_NOT_EXPR
:
3937 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3939 expr
= build1 (TREE_CODE (expr
), truthvalue_type_node
,
3940 c_common_truthvalue_conversion (location
,
3941 TREE_OPERAND (expr
, 0)));
3948 return integer_zerop (expr
) ? truthvalue_false_node
3949 : truthvalue_true_node
;
3952 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3953 ? truthvalue_true_node
3954 : truthvalue_false_node
;
3957 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3958 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3959 ? truthvalue_true_node
3960 : truthvalue_false_node
;
3963 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
3968 tree inner
= TREE_OPERAND (expr
, 0);
3969 if (decl_with_nonnull_addr_p (inner
))
3971 /* Common Ada/Pascal programmer's mistake. */
3972 warning_at (location
,
3974 "the address of %qD will always evaluate as %<true%>",
3976 return truthvalue_true_node
;
3979 /* If we still have a decl, it is possible for its address to
3980 be NULL, so we cannot optimize. */
3983 gcc_assert (DECL_WEAK (inner
));
3987 if (TREE_SIDE_EFFECTS (inner
))
3989 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3990 inner
, truthvalue_true_node
);
3994 return truthvalue_true_node
;
3998 expr
= build_binary_op (EXPR_LOCATION (expr
),
3999 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
4000 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4001 c_common_truthvalue_conversion (location
,
4002 TREE_OPERAND (expr
, 0)),
4003 c_common_truthvalue_conversion (location
,
4004 TREE_OPERAND (expr
, 1)),
4011 case EXCESS_PRECISION_EXPR
:
4012 /* These don't change whether an object is nonzero or zero. */
4013 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
4017 /* These don't change whether an object is zero or nonzero, but
4018 we can't ignore them if their second arg has side-effects. */
4019 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
4021 expr
= build2 (COMPOUND_EXPR
, truthvalue_type_node
,
4022 TREE_OPERAND (expr
, 1),
4023 c_common_truthvalue_conversion
4024 (location
, TREE_OPERAND (expr
, 0)));
4028 return c_common_truthvalue_conversion (location
,
4029 TREE_OPERAND (expr
, 0));
4032 /* Distribute the conversion into the arms of a COND_EXPR. */
4033 if (c_dialect_cxx ())
4035 expr
= fold_build3_loc (location
, COND_EXPR
, truthvalue_type_node
,
4036 TREE_OPERAND (expr
, 0),
4037 c_common_truthvalue_conversion (location
,
4040 c_common_truthvalue_conversion (location
,
4047 /* Folding will happen later for C. */
4048 expr
= build3 (COND_EXPR
, truthvalue_type_node
,
4049 TREE_OPERAND (expr
, 0),
4050 c_common_truthvalue_conversion (location
,
4051 TREE_OPERAND (expr
, 1)),
4052 c_common_truthvalue_conversion (location
,
4053 TREE_OPERAND (expr
, 2)));
4058 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
4059 since that affects how `default_conversion' will behave. */
4060 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
4061 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
4063 /* If this is widening the argument, we can ignore it. */
4064 if (TYPE_PRECISION (TREE_TYPE (expr
))
4065 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
4066 return c_common_truthvalue_conversion (location
,
4067 TREE_OPERAND (expr
, 0));
4071 if (!TREE_NO_WARNING (expr
)
4072 && warn_parentheses
)
4074 warning (OPT_Wparentheses
,
4075 "suggest parentheses around assignment used as truth value");
4076 TREE_NO_WARNING (expr
) = 1;
4084 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
4086 tree t
= c_save_expr (expr
);
4087 expr
= (build_binary_op
4088 (EXPR_LOCATION (expr
),
4089 (TREE_SIDE_EFFECTS (expr
)
4090 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
4091 c_common_truthvalue_conversion
4093 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
4094 c_common_truthvalue_conversion
4096 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
4101 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
4103 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
4105 (TREE_TYPE (expr
))));
4106 return build_binary_op (location
, NE_EXPR
, expr
, fixed_zero_node
, 1);
4109 return build_binary_op (location
, NE_EXPR
, expr
, integer_zero_node
, 1);
4112 protected_set_expr_location (expr
, location
);
4116 static void def_builtin_1 (enum built_in_function fncode
,
4118 enum built_in_class fnclass
,
4119 tree fntype
, tree libtype
,
4120 bool both_p
, bool fallback_p
, bool nonansi_p
,
4121 tree fnattrs
, bool implicit_p
);
4124 /* Apply the TYPE_QUALS to the new DECL. */
4127 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
4129 tree type
= TREE_TYPE (decl
);
4131 if (type
== error_mark_node
)
4134 if (((type_quals
& TYPE_QUAL_CONST
)
4135 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
4136 /* An object declared 'const' is only readonly after it is
4137 initialized. We don't have any way of expressing this currently,
4138 so we need to be conservative and unset TREE_READONLY for types
4139 with constructors. Otherwise aliasing code will ignore stores in
4140 an inline constructor. */
4141 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
4142 TREE_READONLY (decl
) = 1;
4143 if (type_quals
& TYPE_QUAL_VOLATILE
)
4145 TREE_SIDE_EFFECTS (decl
) = 1;
4146 TREE_THIS_VOLATILE (decl
) = 1;
4148 if (type_quals
& TYPE_QUAL_RESTRICT
)
4150 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
4151 /* Allow 'restrict' on arrays of pointers.
4152 FIXME currently we just ignore it. */
4153 type
= TREE_TYPE (type
);
4155 || !POINTER_TYPE_P (type
)
4156 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
4157 error ("invalid use of %<restrict%>");
4161 /* Hash function for the problem of multiple type definitions in
4162 different files. This must hash all types that will compare
4163 equal via comptypes to the same value. In practice it hashes
4164 on some of the simple stuff and leaves the details to comptypes. */
4167 c_type_hash (const void *p
)
4171 const_tree
const t
= (const_tree
) p
;
4173 switch (TREE_CODE (t
))
4175 /* For pointers, hash on pointee type plus some swizzling. */
4177 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
4178 /* Hash on number of elements and total size. */
4181 t2
= TYPE_VALUES (t
);
4185 t2
= TYPE_FIELDS (t
);
4187 case QUAL_UNION_TYPE
:
4189 t2
= TYPE_FIELDS (t
);
4193 t2
= TYPE_FIELDS (t
);
4198 for (; t2
; t2
= TREE_CHAIN (t2
))
4200 /* We might have a VLA here. */
4201 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
4204 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
4205 return ((size
<< 24) | (i
<< shift
));
4208 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
4210 /* Return the typed-based alias set for T, which may be an expression
4211 or a type. Return -1 if we don't do anything special. */
4214 c_common_get_alias_set (tree t
)
4219 /* For VLAs, use the alias set of the element type rather than the
4220 default of alias set 0 for types compared structurally. */
4221 if (TYPE_P (t
) && TYPE_STRUCTURAL_EQUALITY_P (t
))
4223 if (TREE_CODE (t
) == ARRAY_TYPE
)
4224 return get_alias_set (TREE_TYPE (t
));
4228 /* Permit type-punning when accessing a union, provided the access
4229 is directly through the union. For example, this code does not
4230 permit taking the address of a union member and then storing
4231 through it. Even the type-punning allowed here is a GCC
4232 extension, albeit a common and useful one; the C standard says
4233 that such accesses have implementation-defined behavior. */
4235 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
4236 u
= TREE_OPERAND (u
, 0))
4237 if (TREE_CODE (u
) == COMPONENT_REF
4238 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
4241 /* That's all the expressions we handle specially. */
4245 /* The C standard guarantees that any object may be accessed via an
4246 lvalue that has character type. */
4247 if (t
== char_type_node
4248 || t
== signed_char_type_node
4249 || t
== unsigned_char_type_node
)
4252 /* The C standard specifically allows aliasing between signed and
4253 unsigned variants of the same type. We treat the signed
4254 variant as canonical. */
4255 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4257 tree t1
= c_common_signed_type (t
);
4259 /* t1 == t can happen for boolean nodes which are always unsigned. */
4261 return get_alias_set (t1
);
4263 else if (POINTER_TYPE_P (t
))
4267 /* Unfortunately, there is no canonical form of a pointer type.
4268 In particular, if we have `typedef int I', then `int *', and
4269 `I *' are different types. So, we have to pick a canonical
4270 representative. We do this below.
4272 Technically, this approach is actually more conservative that
4273 it needs to be. In particular, `const int *' and `int *'
4274 should be in different alias sets, according to the C and C++
4275 standard, since their types are not the same, and so,
4276 technically, an `int **' and `const int **' cannot point at
4279 But, the standard is wrong. In particular, this code is
4284 const int* const* cipp = ipp;
4286 And, it doesn't make sense for that to be legal unless you
4287 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
4288 the pointed-to types. This issue has been reported to the
4290 t1
= build_type_no_quals (t
);
4292 return get_alias_set (t1
);
4295 /* Handle the case of multiple type nodes referring to "the same" type,
4296 which occurs with IMA. These share an alias set. FIXME: Currently only
4297 C90 is handled. (In C99 type compatibility is not transitive, which
4298 complicates things mightily. The alias set splay trees can theoretically
4299 represent this, but insertion is tricky when you consider all the
4300 different orders things might arrive in.) */
4302 if (c_language
!= clk_c
|| flag_isoc99
)
4305 /* Save time if there's only one input file. */
4306 if (num_in_fnames
== 1)
4309 /* Pointers need special handling if they point to any type that
4310 needs special handling (below). */
4311 if (TREE_CODE (t
) == POINTER_TYPE
)
4314 /* Find bottom type under any nested POINTERs. */
4315 for (t2
= TREE_TYPE (t
);
4316 TREE_CODE (t2
) == POINTER_TYPE
;
4317 t2
= TREE_TYPE (t2
))
4319 if (TREE_CODE (t2
) != RECORD_TYPE
4320 && TREE_CODE (t2
) != ENUMERAL_TYPE
4321 && TREE_CODE (t2
) != QUAL_UNION_TYPE
4322 && TREE_CODE (t2
) != UNION_TYPE
)
4324 if (TYPE_SIZE (t2
) == 0)
4327 /* These are the only cases that need special handling. */
4328 if (TREE_CODE (t
) != RECORD_TYPE
4329 && TREE_CODE (t
) != ENUMERAL_TYPE
4330 && TREE_CODE (t
) != QUAL_UNION_TYPE
4331 && TREE_CODE (t
) != UNION_TYPE
4332 && TREE_CODE (t
) != POINTER_TYPE
)
4335 if (TYPE_SIZE (t
) == 0)
4338 /* Look up t in hash table. Only one of the compatible types within each
4339 alias set is recorded in the table. */
4340 if (!type_hash_table
)
4341 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
4342 (htab_eq
) lang_hooks
.types_compatible_p
,
4344 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
4347 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
4348 return TYPE_ALIAS_SET ((tree
)*slot
);
4351 /* Our caller will assign and record (in t) a new alias set; all we need
4352 to do is remember t in the hash table. */
4358 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where
4359 the second parameter indicates which OPERATOR is being applied.
4360 The COMPLAIN flag controls whether we should diagnose possibly
4361 ill-formed constructs or not. LOC is the location of the SIZEOF or
4365 c_sizeof_or_alignof_type (location_t loc
,
4366 tree type
, bool is_sizeof
, int complain
)
4368 const char *op_name
;
4370 enum tree_code type_code
= TREE_CODE (type
);
4372 op_name
= is_sizeof
? "sizeof" : "__alignof__";
4374 if (type_code
== FUNCTION_TYPE
)
4378 if (complain
&& (pedantic
|| warn_pointer_arith
))
4379 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
4380 "invalid application of %<sizeof%> to a function type");
4382 return error_mark_node
;
4383 value
= size_one_node
;
4386 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
4388 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
4390 if (type_code
== VOID_TYPE
4391 && complain
&& (pedantic
|| warn_pointer_arith
))
4392 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
4393 "invalid application of %qs to a void type", op_name
);
4395 return error_mark_node
;
4396 value
= size_one_node
;
4398 else if (!COMPLETE_TYPE_P (type
))
4401 error_at (loc
, "invalid application of %qs to incomplete type %qT ",
4403 return error_mark_node
;
4408 /* Convert in case a char is more than one unit. */
4409 value
= size_binop_loc (loc
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
4410 size_int (TYPE_PRECISION (char_type_node
)
4413 value
= size_int (TYPE_ALIGN_UNIT (type
));
4416 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
4417 TYPE_IS_SIZETYPE means that certain things (like overflow) will
4418 never happen. However, this node should really have type
4419 `size_t', which is just a typedef for an ordinary integer type. */
4420 value
= fold_convert_loc (loc
, size_type_node
, value
);
4421 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
4426 /* Implement the __alignof keyword: Return the minimum required
4427 alignment of EXPR, measured in bytes. For VAR_DECLs,
4428 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
4429 from an "aligned" __attribute__ specification). LOC is the
4430 location of the ALIGNOF operator. */
4433 c_alignof_expr (location_t loc
, tree expr
)
4437 if (VAR_OR_FUNCTION_DECL_P (expr
))
4438 t
= size_int (DECL_ALIGN_UNIT (expr
));
4440 else if (TREE_CODE (expr
) == COMPONENT_REF
4441 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
4443 error_at (loc
, "%<__alignof%> applied to a bit-field");
4446 else if (TREE_CODE (expr
) == COMPONENT_REF
4447 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
4448 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
4450 else if (TREE_CODE (expr
) == INDIRECT_REF
)
4452 tree t
= TREE_OPERAND (expr
, 0);
4454 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
4456 while (CONVERT_EXPR_P (t
)
4457 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
4461 t
= TREE_OPERAND (t
, 0);
4462 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
4463 if (thisalign
> bestalign
)
4464 best
= t
, bestalign
= thisalign
;
4466 return c_alignof (loc
, TREE_TYPE (TREE_TYPE (best
)));
4469 return c_alignof (loc
, TREE_TYPE (expr
));
4471 return fold_convert_loc (loc
, size_type_node
, t
);
4474 /* Handle C and C++ default attributes. */
4476 enum built_in_attribute
4478 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
4479 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
4480 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
4481 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
4482 #include "builtin-attrs.def"
4483 #undef DEF_ATTR_NULL_TREE
4485 #undef DEF_ATTR_IDENT
4486 #undef DEF_ATTR_TREE_LIST
4490 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
4492 static void c_init_attributes (void);
4496 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
4497 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
4498 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
4499 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
4500 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4501 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4502 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
4503 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
4504 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
4505 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
4506 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
4507 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
4508 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
4509 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
4510 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
4512 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
4513 #include "builtin-types.def"
4514 #undef DEF_PRIMITIVE_TYPE
4515 #undef DEF_FUNCTION_TYPE_0
4516 #undef DEF_FUNCTION_TYPE_1
4517 #undef DEF_FUNCTION_TYPE_2
4518 #undef DEF_FUNCTION_TYPE_3
4519 #undef DEF_FUNCTION_TYPE_4
4520 #undef DEF_FUNCTION_TYPE_5
4521 #undef DEF_FUNCTION_TYPE_6
4522 #undef DEF_FUNCTION_TYPE_7
4523 #undef DEF_FUNCTION_TYPE_VAR_0
4524 #undef DEF_FUNCTION_TYPE_VAR_1
4525 #undef DEF_FUNCTION_TYPE_VAR_2
4526 #undef DEF_FUNCTION_TYPE_VAR_3
4527 #undef DEF_FUNCTION_TYPE_VAR_4
4528 #undef DEF_FUNCTION_TYPE_VAR_5
4529 #undef DEF_POINTER_TYPE
4533 typedef enum c_builtin_type builtin_type
;
4535 /* A temporary array for c_common_nodes_and_builtins. Used in
4536 communication with def_fn_type. */
4537 static tree builtin_types
[(int) BT_LAST
+ 1];
4539 /* A helper function for c_common_nodes_and_builtins. Build function type
4540 for DEF with return type RET and N arguments. If VAR is true, then the
4541 function should be variadic after those N arguments.
4543 Takes special care not to ICE if any of the types involved are
4544 error_mark_node, which indicates that said type is not in fact available
4545 (see builtin_type_for_size). In which case the function type as a whole
4546 should be error_mark_node. */
4549 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
4551 tree args
= NULL
, t
;
4556 for (i
= 0; i
< n
; ++i
)
4558 builtin_type a
= (builtin_type
) va_arg (list
, int);
4559 t
= builtin_types
[a
];
4560 if (t
== error_mark_node
)
4562 args
= tree_cons (NULL_TREE
, t
, args
);
4566 args
= nreverse (args
);
4568 args
= chainon (args
, void_list_node
);
4570 t
= builtin_types
[ret
];
4571 if (t
== error_mark_node
)
4573 t
= build_function_type (t
, args
);
4576 builtin_types
[def
] = t
;
4579 /* Build builtin functions common to both C and C++ language
4583 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
4585 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4586 builtin_types[ENUM] = VALUE;
4587 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4588 def_fn_type (ENUM, RETURN, 0, 0);
4589 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4590 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4591 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4592 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4593 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4594 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4595 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4596 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4597 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4598 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4599 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4601 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4602 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4604 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4605 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4606 def_fn_type (ENUM, RETURN, 1, 0);
4607 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4608 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4609 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4610 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4611 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4612 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4613 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4614 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4615 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4616 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4617 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4618 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4620 #include "builtin-types.def"
4622 #undef DEF_PRIMITIVE_TYPE
4623 #undef DEF_FUNCTION_TYPE_1
4624 #undef DEF_FUNCTION_TYPE_2
4625 #undef DEF_FUNCTION_TYPE_3
4626 #undef DEF_FUNCTION_TYPE_4
4627 #undef DEF_FUNCTION_TYPE_5
4628 #undef DEF_FUNCTION_TYPE_6
4629 #undef DEF_FUNCTION_TYPE_VAR_0
4630 #undef DEF_FUNCTION_TYPE_VAR_1
4631 #undef DEF_FUNCTION_TYPE_VAR_2
4632 #undef DEF_FUNCTION_TYPE_VAR_3
4633 #undef DEF_FUNCTION_TYPE_VAR_4
4634 #undef DEF_FUNCTION_TYPE_VAR_5
4635 #undef DEF_POINTER_TYPE
4636 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4638 c_init_attributes ();
4640 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4641 NONANSI_P, ATTRS, IMPLICIT, COND) \
4643 def_builtin_1 (ENUM, NAME, CLASS, \
4644 builtin_types[(int) TYPE], \
4645 builtin_types[(int) LIBTYPE], \
4646 BOTH_P, FALLBACK_P, NONANSI_P, \
4647 built_in_attributes[(int) ATTRS], IMPLICIT);
4648 #include "builtins.def"
4651 targetm
.init_builtins ();
4653 build_common_builtin_nodes ();
4659 /* Like get_identifier, but avoid warnings about null arguments when
4660 the argument may be NULL for targets where GCC lacks stdint.h type
4664 c_get_ident (const char *id
)
4666 return get_identifier (id
);
4669 /* Build tree nodes and builtin functions common to both C and C++ language
4673 c_common_nodes_and_builtins (void)
4675 int char16_type_size
;
4676 int char32_type_size
;
4677 int wchar_type_size
;
4678 tree array_domain_type
;
4679 tree va_list_ref_type_node
;
4680 tree va_list_arg_type_node
;
4682 /* Define `int' and `char' first so that dbx will output them first. */
4683 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
4684 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4686 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4687 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4688 but not C. Are the conditionals here needed? */
4689 if (c_dialect_cxx ())
4690 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
4691 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4692 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4693 record_builtin_type (RID_MAX
, "long unsigned int",
4694 long_unsigned_type_node
);
4695 if (c_dialect_cxx ())
4696 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4697 record_builtin_type (RID_MAX
, "long long int",
4698 long_long_integer_type_node
);
4699 record_builtin_type (RID_MAX
, "long long unsigned int",
4700 long_long_unsigned_type_node
);
4701 if (c_dialect_cxx ())
4702 record_builtin_type (RID_MAX
, "long long unsigned",
4703 long_long_unsigned_type_node
);
4704 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4705 record_builtin_type (RID_MAX
, "short unsigned int",
4706 short_unsigned_type_node
);
4707 if (c_dialect_cxx ())
4708 record_builtin_type (RID_MAX
, "unsigned short",
4709 short_unsigned_type_node
);
4711 /* Define both `signed char' and `unsigned char'. */
4712 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4713 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4715 /* These are types that c_common_type_for_size and
4716 c_common_type_for_mode use. */
4717 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4718 TYPE_DECL
, NULL_TREE
,
4720 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4721 TYPE_DECL
, NULL_TREE
,
4723 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4724 TYPE_DECL
, NULL_TREE
,
4726 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4727 TYPE_DECL
, NULL_TREE
,
4729 #if HOST_BITS_PER_WIDE_INT >= 64
4730 if (targetm
.scalar_mode_supported_p (TImode
))
4731 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4733 get_identifier ("__int128_t"),
4736 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4737 TYPE_DECL
, NULL_TREE
,
4738 unsigned_intQI_type_node
));
4739 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4740 TYPE_DECL
, NULL_TREE
,
4741 unsigned_intHI_type_node
));
4742 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4743 TYPE_DECL
, NULL_TREE
,
4744 unsigned_intSI_type_node
));
4745 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4746 TYPE_DECL
, NULL_TREE
,
4747 unsigned_intDI_type_node
));
4748 #if HOST_BITS_PER_WIDE_INT >= 64
4749 if (targetm
.scalar_mode_supported_p (TImode
))
4750 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4752 get_identifier ("__uint128_t"),
4753 unsigned_intTI_type_node
));
4756 /* Create the widest literal types. */
4757 widest_integer_literal_type_node
4758 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
4759 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4760 TYPE_DECL
, NULL_TREE
,
4761 widest_integer_literal_type_node
));
4763 widest_unsigned_literal_type_node
4764 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
4765 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4766 TYPE_DECL
, NULL_TREE
,
4767 widest_unsigned_literal_type_node
));
4769 /* `unsigned long' is the standard type for sizeof.
4770 Note that stddef.h uses `unsigned long',
4771 and this must agree, even if long and int are the same size. */
4773 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
4774 signed_size_type_node
= c_common_signed_type (size_type_node
);
4775 set_sizetype (size_type_node
);
4778 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4780 build_common_tree_nodes_2 (flag_short_double
);
4782 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4783 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4784 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4786 /* Only supported decimal floating point extension if the target
4787 actually supports underlying modes. */
4788 if (targetm
.scalar_mode_supported_p (SDmode
)
4789 && targetm
.scalar_mode_supported_p (DDmode
)
4790 && targetm
.scalar_mode_supported_p (TDmode
))
4792 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4793 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4794 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4797 if (targetm
.fixed_point_supported_p ())
4799 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4800 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4801 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4802 record_builtin_type (RID_MAX
, "long long _Fract",
4803 long_long_fract_type_node
);
4804 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4805 unsigned_short_fract_type_node
);
4806 record_builtin_type (RID_MAX
, "unsigned _Fract",
4807 unsigned_fract_type_node
);
4808 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4809 unsigned_long_fract_type_node
);
4810 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4811 unsigned_long_long_fract_type_node
);
4812 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4813 sat_short_fract_type_node
);
4814 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4815 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4816 sat_long_fract_type_node
);
4817 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4818 sat_long_long_fract_type_node
);
4819 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4820 sat_unsigned_short_fract_type_node
);
4821 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4822 sat_unsigned_fract_type_node
);
4823 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4824 sat_unsigned_long_fract_type_node
);
4825 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4826 sat_unsigned_long_long_fract_type_node
);
4827 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4828 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4829 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4830 record_builtin_type (RID_MAX
, "long long _Accum",
4831 long_long_accum_type_node
);
4832 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4833 unsigned_short_accum_type_node
);
4834 record_builtin_type (RID_MAX
, "unsigned _Accum",
4835 unsigned_accum_type_node
);
4836 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4837 unsigned_long_accum_type_node
);
4838 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4839 unsigned_long_long_accum_type_node
);
4840 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4841 sat_short_accum_type_node
);
4842 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4843 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4844 sat_long_accum_type_node
);
4845 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4846 sat_long_long_accum_type_node
);
4847 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4848 sat_unsigned_short_accum_type_node
);
4849 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4850 sat_unsigned_accum_type_node
);
4851 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4852 sat_unsigned_long_accum_type_node
);
4853 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4854 sat_unsigned_long_long_accum_type_node
);
4858 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4860 get_identifier ("complex int"),
4861 complex_integer_type_node
));
4862 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4864 get_identifier ("complex float"),
4865 complex_float_type_node
));
4866 lang_hooks
.decls
.pushdecl (build_decl (UNKNOWN_LOCATION
,
4868 get_identifier ("complex double"),
4869 complex_double_type_node
));
4870 lang_hooks
.decls
.pushdecl
4871 (build_decl (UNKNOWN_LOCATION
,
4872 TYPE_DECL
, get_identifier ("complex long double"),
4873 complex_long_double_type_node
));
4875 if (c_dialect_cxx ())
4876 /* For C++, make fileptr_type_node a distinct void * type until
4877 FILE type is defined. */
4878 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4880 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4882 /* Set the TYPE_NAME for any variants that were built before
4883 record_builtin_type gave names to the built-in types. */
4885 tree void_name
= TYPE_NAME (void_type_node
);
4886 TYPE_NAME (void_type_node
) = NULL_TREE
;
4887 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4889 TYPE_NAME (void_type_node
) = void_name
;
4892 /* This node must not be shared. */
4893 void_zero_node
= make_node (INTEGER_CST
);
4894 TREE_TYPE (void_zero_node
) = void_type_node
;
4896 void_list_node
= build_void_list_node ();
4898 /* Make a type to be the domain of a few array types
4899 whose domains don't really matter.
4900 200 is small enough that it always fits in size_t
4901 and large enough that it can hold most function names for the
4902 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4903 array_domain_type
= build_index_type (size_int (200));
4905 /* Make a type for arrays of characters.
4906 With luck nothing will ever really depend on the length of this
4908 char_array_type_node
4909 = build_array_type (char_type_node
, array_domain_type
);
4911 /* Likewise for arrays of ints. */
4913 = build_array_type (integer_type_node
, array_domain_type
);
4915 string_type_node
= build_pointer_type (char_type_node
);
4916 const_string_type_node
4917 = build_pointer_type (build_qualified_type
4918 (char_type_node
, TYPE_QUAL_CONST
));
4920 /* This is special for C++ so functions can be overloaded. */
4921 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4922 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4923 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4924 underlying_wchar_type_node
= wchar_type_node
;
4925 if (c_dialect_cxx ())
4927 if (TYPE_UNSIGNED (wchar_type_node
))
4928 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4930 wchar_type_node
= make_signed_type (wchar_type_size
);
4931 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4934 /* This is for wide string constants. */
4935 wchar_array_type_node
4936 = build_array_type (wchar_type_node
, array_domain_type
);
4938 /* Define 'char16_t'. */
4939 char16_type_node
= get_identifier (CHAR16_TYPE
);
4940 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4941 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4942 if (c_dialect_cxx ())
4944 char16_type_node
= make_unsigned_type (char16_type_size
);
4946 if (cxx_dialect
== cxx0x
)
4947 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4950 /* This is for UTF-16 string constants. */
4951 char16_array_type_node
4952 = build_array_type (char16_type_node
, array_domain_type
);
4954 /* Define 'char32_t'. */
4955 char32_type_node
= get_identifier (CHAR32_TYPE
);
4956 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4957 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4958 if (c_dialect_cxx ())
4960 char32_type_node
= make_unsigned_type (char32_type_size
);
4962 if (cxx_dialect
== cxx0x
)
4963 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4966 /* This is for UTF-32 string constants. */
4967 char32_array_type_node
4968 = build_array_type (char32_type_node
, array_domain_type
);
4971 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4974 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4976 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4978 if (SIG_ATOMIC_TYPE
)
4979 sig_atomic_type_node
=
4980 TREE_TYPE (identifier_global_value (c_get_ident (SIG_ATOMIC_TYPE
)));
4983 TREE_TYPE (identifier_global_value (c_get_ident (INT8_TYPE
)));
4986 TREE_TYPE (identifier_global_value (c_get_ident (INT16_TYPE
)));
4989 TREE_TYPE (identifier_global_value (c_get_ident (INT32_TYPE
)));
4992 TREE_TYPE (identifier_global_value (c_get_ident (INT64_TYPE
)));
4995 TREE_TYPE (identifier_global_value (c_get_ident (UINT8_TYPE
)));
4998 TREE_TYPE (identifier_global_value (c_get_ident (UINT16_TYPE
)));
5000 c_uint32_type_node
=
5001 TREE_TYPE (identifier_global_value (c_get_ident (UINT32_TYPE
)));
5003 c_uint64_type_node
=
5004 TREE_TYPE (identifier_global_value (c_get_ident (UINT64_TYPE
)));
5005 if (INT_LEAST8_TYPE
)
5006 int_least8_type_node
=
5007 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST8_TYPE
)));
5008 if (INT_LEAST16_TYPE
)
5009 int_least16_type_node
=
5010 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST16_TYPE
)));
5011 if (INT_LEAST32_TYPE
)
5012 int_least32_type_node
=
5013 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST32_TYPE
)));
5014 if (INT_LEAST64_TYPE
)
5015 int_least64_type_node
=
5016 TREE_TYPE (identifier_global_value (c_get_ident (INT_LEAST64_TYPE
)));
5017 if (UINT_LEAST8_TYPE
)
5018 uint_least8_type_node
=
5019 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST8_TYPE
)));
5020 if (UINT_LEAST16_TYPE
)
5021 uint_least16_type_node
=
5022 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST16_TYPE
)));
5023 if (UINT_LEAST32_TYPE
)
5024 uint_least32_type_node
=
5025 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST32_TYPE
)));
5026 if (UINT_LEAST64_TYPE
)
5027 uint_least64_type_node
=
5028 TREE_TYPE (identifier_global_value (c_get_ident (UINT_LEAST64_TYPE
)));
5030 int_fast8_type_node
=
5031 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST8_TYPE
)));
5032 if (INT_FAST16_TYPE
)
5033 int_fast16_type_node
=
5034 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST16_TYPE
)));
5035 if (INT_FAST32_TYPE
)
5036 int_fast32_type_node
=
5037 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST32_TYPE
)));
5038 if (INT_FAST64_TYPE
)
5039 int_fast64_type_node
=
5040 TREE_TYPE (identifier_global_value (c_get_ident (INT_FAST64_TYPE
)));
5041 if (UINT_FAST8_TYPE
)
5042 uint_fast8_type_node
=
5043 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST8_TYPE
)));
5044 if (UINT_FAST16_TYPE
)
5045 uint_fast16_type_node
=
5046 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST16_TYPE
)));
5047 if (UINT_FAST32_TYPE
)
5048 uint_fast32_type_node
=
5049 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST32_TYPE
)));
5050 if (UINT_FAST64_TYPE
)
5051 uint_fast64_type_node
=
5052 TREE_TYPE (identifier_global_value (c_get_ident (UINT_FAST64_TYPE
)));
5055 TREE_TYPE (identifier_global_value (c_get_ident (INTPTR_TYPE
)));
5058 TREE_TYPE (identifier_global_value (c_get_ident (UINTPTR_TYPE
)));
5060 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
5062 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
5063 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
5065 lang_hooks
.decls
.pushdecl
5066 (build_decl (UNKNOWN_LOCATION
,
5067 TYPE_DECL
, get_identifier ("__builtin_va_list"),
5068 va_list_type_node
));
5069 #ifdef TARGET_ENUM_VA_LIST
5074 for (l
= 0; TARGET_ENUM_VA_LIST (l
, &pname
, &ptype
); ++l
)
5076 lang_hooks
.decls
.pushdecl
5077 (build_decl (UNKNOWN_LOCATION
,
5078 TYPE_DECL
, get_identifier (pname
),
5085 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
5087 va_list_arg_type_node
= va_list_ref_type_node
=
5088 build_pointer_type (TREE_TYPE (va_list_type_node
));
5092 va_list_arg_type_node
= va_list_type_node
;
5093 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
5096 if (!flag_preprocess_only
)
5097 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
5099 main_identifier_node
= get_identifier ("main");
5101 /* Create the built-in __null node. It is important that this is
5103 null_node
= make_node (INTEGER_CST
);
5104 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
5106 /* Since builtin_types isn't gc'ed, don't export these nodes. */
5107 memset (builtin_types
, 0, sizeof (builtin_types
));
5110 /* The number of named compound-literals generated thus far. */
5111 static GTY(()) int compound_literal_number
;
5113 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
5116 set_compound_literal_name (tree decl
)
5119 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
5120 compound_literal_number
);
5121 compound_literal_number
++;
5122 DECL_NAME (decl
) = get_identifier (name
);
5126 build_va_arg (location_t loc
, tree expr
, tree type
)
5128 expr
= build1 (VA_ARG_EXPR
, type
, expr
);
5129 SET_EXPR_LOCATION (expr
, loc
);
5134 /* Linked list of disabled built-in functions. */
5136 typedef struct disabled_builtin
5139 struct disabled_builtin
*next
;
5141 static disabled_builtin
*disabled_builtins
= NULL
;
5143 static bool builtin_function_disabled_p (const char *);
5145 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
5146 begins with "__builtin_", give an error. */
5149 disable_builtin_function (const char *name
)
5151 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
5152 error ("cannot disable built-in function %qs", name
);
5155 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
5156 new_disabled_builtin
->name
= name
;
5157 new_disabled_builtin
->next
= disabled_builtins
;
5158 disabled_builtins
= new_disabled_builtin
;
5163 /* Return true if the built-in function NAME has been disabled, false
5167 builtin_function_disabled_p (const char *name
)
5169 disabled_builtin
*p
;
5170 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
5172 if (strcmp (name
, p
->name
) == 0)
5179 /* Worker for DEF_BUILTIN.
5180 Possibly define a builtin function with one or two names.
5181 Does not declare a non-__builtin_ function if flag_no_builtin, or if
5182 nonansi_p and flag_no_nonansi_builtin. */
5185 def_builtin_1 (enum built_in_function fncode
,
5187 enum built_in_class fnclass
,
5188 tree fntype
, tree libtype
,
5189 bool both_p
, bool fallback_p
, bool nonansi_p
,
5190 tree fnattrs
, bool implicit_p
)
5193 const char *libname
;
5195 if (fntype
== error_mark_node
)
5198 gcc_assert ((!both_p
&& !fallback_p
)
5199 || !strncmp (name
, "__builtin_",
5200 strlen ("__builtin_")));
5202 libname
= name
+ strlen ("__builtin_");
5203 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
5204 (fallback_p
? libname
: NULL
),
5207 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
5208 && !(nonansi_p
&& flag_no_nonansi_builtin
))
5209 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
5212 built_in_decls
[(int) fncode
] = decl
;
5214 implicit_built_in_decls
[(int) fncode
] = decl
;
5217 /* Nonzero if the type T promotes to int. This is (nearly) the
5218 integral promotions defined in ISO C99 6.3.1.1/2. */
5221 c_promoting_integer_type_p (const_tree t
)
5223 switch (TREE_CODE (t
))
5226 return (TYPE_MAIN_VARIANT (t
) == char_type_node
5227 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
5228 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
5229 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
5230 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
5231 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
5234 /* ??? Technically all enumerations not larger than an int
5235 promote to an int. But this is used along code paths
5236 that only want to notice a size change. */
5237 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
5247 /* Return 1 if PARMS specifies a fixed number of parameters
5248 and none of their types is affected by default promotions. */
5251 self_promoting_args_p (const_tree parms
)
5254 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
5256 tree type
= TREE_VALUE (t
);
5258 if (type
== error_mark_node
)
5261 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
5267 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
5270 if (c_promoting_integer_type_p (type
))
5276 /* Recursively remove any '*' or '&' operator from TYPE. */
5278 strip_pointer_operator (tree t
)
5280 while (POINTER_TYPE_P (t
))
5285 /* Recursively remove pointer or array type from TYPE. */
5287 strip_pointer_or_array_types (tree t
)
5289 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
5294 /* Used to compare case labels. K1 and K2 are actually tree nodes
5295 representing case labels, or NULL_TREE for a `default' label.
5296 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
5297 K2, and 0 if K1 and K2 are equal. */
5300 case_compare (splay_tree_key k1
, splay_tree_key k2
)
5302 /* Consider a NULL key (such as arises with a `default' label) to be
5303 smaller than anything else. */
5309 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5312 /* Process a case label, located at LOC, for the range LOW_VALUE
5313 ... HIGH_VALUE. If LOW_VALUE and HIGH_VALUE are both NULL_TREE
5314 then this case label is actually a `default' label. If only
5315 HIGH_VALUE is NULL_TREE, then case label was declared using the
5316 usual C/C++ syntax, rather than the GNU case range extension.
5317 CASES is a tree containing all the case ranges processed so far;
5318 COND is the condition for the switch-statement itself. Returns the
5319 CASE_LABEL_EXPR created, or ERROR_MARK_NODE if no CASE_LABEL_EXPR
5323 c_add_case_label (location_t loc
, splay_tree cases
, tree cond
, tree orig_type
,
5324 tree low_value
, tree high_value
)
5329 splay_tree_node node
;
5331 /* Create the LABEL_DECL itself. */
5332 label
= create_artificial_label (loc
);
5334 /* If there was an error processing the switch condition, bail now
5335 before we get more confused. */
5336 if (!cond
|| cond
== error_mark_node
)
5339 if ((low_value
&& TREE_TYPE (low_value
)
5340 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
5341 || (high_value
&& TREE_TYPE (high_value
)
5342 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
5344 error_at (loc
, "pointers are not permitted as case values");
5348 /* Case ranges are a GNU extension. */
5350 pedwarn (loc
, OPT_pedantic
,
5351 "range expressions in switch statements are non-standard");
5353 type
= TREE_TYPE (cond
);
5356 low_value
= check_case_value (low_value
);
5357 low_value
= convert_and_check (type
, low_value
);
5358 if (low_value
== error_mark_node
)
5363 high_value
= check_case_value (high_value
);
5364 high_value
= convert_and_check (type
, high_value
);
5365 if (high_value
== error_mark_node
)
5369 if (low_value
&& high_value
)
5371 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
5372 really a case range, even though it was written that way.
5373 Remove the HIGH_VALUE to simplify later processing. */
5374 if (tree_int_cst_equal (low_value
, high_value
))
5375 high_value
= NULL_TREE
;
5376 else if (!tree_int_cst_lt (low_value
, high_value
))
5377 warning_at (loc
, 0, "empty range specified");
5380 /* See if the case is in range of the type of the original testing
5381 expression. If both low_value and high_value are out of range,
5382 don't insert the case label and return NULL_TREE. */
5384 && !check_case_bounds (type
, orig_type
,
5385 &low_value
, high_value
? &high_value
: NULL
))
5388 /* Look up the LOW_VALUE in the table of case labels we already
5390 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
5391 /* If there was not an exact match, check for overlapping ranges.
5392 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
5393 that's a `default' label and the only overlap is an exact match. */
5394 if (!node
&& (low_value
|| high_value
))
5396 splay_tree_node low_bound
;
5397 splay_tree_node high_bound
;
5399 /* Even though there wasn't an exact match, there might be an
5400 overlap between this case range and another case range.
5401 Since we've (inductively) not allowed any overlapping case
5402 ranges, we simply need to find the greatest low case label
5403 that is smaller that LOW_VALUE, and the smallest low case
5404 label that is greater than LOW_VALUE. If there is an overlap
5405 it will occur in one of these two ranges. */
5406 low_bound
= splay_tree_predecessor (cases
,
5407 (splay_tree_key
) low_value
);
5408 high_bound
= splay_tree_successor (cases
,
5409 (splay_tree_key
) low_value
);
5411 /* Check to see if the LOW_BOUND overlaps. It is smaller than
5412 the LOW_VALUE, so there is no need to check unless the
5413 LOW_BOUND is in fact itself a case range. */
5415 && CASE_HIGH ((tree
) low_bound
->value
)
5416 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
5419 /* Check to see if the HIGH_BOUND overlaps. The low end of that
5420 range is bigger than the low end of the current range, so we
5421 are only interested if the current range is a real range, and
5422 not an ordinary case label. */
5425 && (tree_int_cst_compare ((tree
) high_bound
->key
,
5430 /* If there was an overlap, issue an error. */
5433 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
5437 error_at (loc
, "duplicate (or overlapping) case value");
5438 error_at (DECL_SOURCE_LOCATION (duplicate
),
5439 "this is the first entry overlapping that value");
5443 error_at (loc
, "duplicate case value") ;
5444 error_at (DECL_SOURCE_LOCATION (duplicate
), "previously used here");
5448 error_at (loc
, "multiple default labels in one switch");
5449 error_at (DECL_SOURCE_LOCATION (duplicate
),
5450 "this is the first default label");
5455 /* Add a CASE_LABEL to the statement-tree. */
5456 case_label
= add_stmt (build_case_label (loc
, low_value
, high_value
, label
));
5457 /* Register this case label in the splay tree. */
5458 splay_tree_insert (cases
,
5459 (splay_tree_key
) low_value
,
5460 (splay_tree_value
) case_label
);
5465 /* Add a label so that the back-end doesn't think that the beginning of
5466 the switch is unreachable. Note that we do not add a case label, as
5467 that just leads to duplicates and thence to failure later on. */
5470 tree t
= create_artificial_label (loc
);
5471 add_stmt (build_stmt (loc
, LABEL_EXPR
, t
));
5473 return error_mark_node
;
5476 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
5477 Used to verify that case values match up with enumerator values. */
5480 match_case_to_enum_1 (tree key
, tree type
, tree label
)
5482 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
5484 /* ??? Not working too hard to print the double-word value.
5485 Should perhaps be done with %lwd in the diagnostic routines? */
5486 if (TREE_INT_CST_HIGH (key
) == 0)
5487 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
5488 TREE_INT_CST_LOW (key
));
5489 else if (!TYPE_UNSIGNED (type
)
5490 && TREE_INT_CST_HIGH (key
) == -1
5491 && TREE_INT_CST_LOW (key
) != 0)
5492 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
5493 -TREE_INT_CST_LOW (key
));
5495 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
5496 (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (key
),
5497 (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (key
));
5499 if (TYPE_NAME (type
) == 0)
5500 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
5501 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
5502 "case value %qs not in enumerated type",
5505 warning_at (DECL_SOURCE_LOCATION (CASE_LABEL (label
)),
5506 warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
5507 "case value %qs not in enumerated type %qT",
5511 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
5512 Used to verify that case values match up with enumerator values. */
5515 match_case_to_enum (splay_tree_node node
, void *data
)
5517 tree label
= (tree
) node
->value
;
5518 tree type
= (tree
) data
;
5520 /* Skip default case. */
5521 if (!CASE_LOW (label
))
5524 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
5525 when we did our enum->case scan. Reset our scratch bit after. */
5526 if (!CASE_LOW_SEEN (label
))
5527 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
5529 CASE_LOW_SEEN (label
) = 0;
5531 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
5532 not set, that means that CASE_HIGH did not appear when we did our
5533 enum->case scan. Reset our scratch bit after. */
5534 if (CASE_HIGH (label
))
5536 if (!CASE_HIGH_SEEN (label
))
5537 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
5539 CASE_HIGH_SEEN (label
) = 0;
5545 /* Handle -Wswitch*. Called from the front end after parsing the
5546 switch construct. */
5547 /* ??? Should probably be somewhere generic, since other languages
5548 besides C and C++ would want this. At the moment, however, C/C++
5549 are the only tree-ssa languages that support enumerations at all,
5550 so the point is moot. */
5553 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
5554 tree type
, tree cond
)
5556 splay_tree_node default_node
;
5557 splay_tree_node node
;
5560 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
5563 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
5565 warning_at (switch_location
, OPT_Wswitch_default
,
5566 "switch missing default case");
5568 /* From here on, we only care about about enumerated types. */
5569 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
5572 /* From here on, we only care about -Wswitch and -Wswitch-enum. */
5573 if (!warn_switch_enum
&& !warn_switch
)
5576 /* Check the cases. Warn about case values which are not members of
5577 the enumerated type. For -Wswitch-enum, or for -Wswitch when
5578 there is no default case, check that exactly all enumeration
5579 literals are covered by the cases. */
5581 /* Clearing COND if it is not an integer constant simplifies
5582 the tests inside the loop below. */
5583 if (TREE_CODE (cond
) != INTEGER_CST
)
5586 /* The time complexity here is O(N*lg(N)) worst case, but for the
5587 common case of monotonically increasing enumerators, it is
5588 O(N), since the nature of the splay tree will keep the next
5589 element adjacent to the root at all times. */
5591 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
5593 tree value
= TREE_VALUE (chain
);
5594 if (TREE_CODE (value
) == CONST_DECL
)
5595 value
= DECL_INITIAL (value
);
5596 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
5599 /* Mark the CASE_LOW part of the case entry as seen. */
5600 tree label
= (tree
) node
->value
;
5601 CASE_LOW_SEEN (label
) = 1;
5605 /* Even though there wasn't an exact match, there might be a
5606 case range which includes the enumerator's value. */
5607 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
5608 if (node
&& CASE_HIGH ((tree
) node
->value
))
5610 tree label
= (tree
) node
->value
;
5611 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
5614 /* If we match the upper bound exactly, mark the CASE_HIGH
5615 part of the case entry as seen. */
5617 CASE_HIGH_SEEN (label
) = 1;
5622 /* We've now determined that this enumerated literal isn't
5623 handled by the case labels of the switch statement. */
5625 /* If the switch expression is a constant, we only really care
5626 about whether that constant is handled by the switch. */
5627 if (cond
&& tree_int_cst_compare (cond
, value
))
5630 /* If there is a default_node, the only relevant option is
5631 Wswitch-enum. Otherwise, if both are enabled then we prefer
5632 to warn using -Wswitch because -Wswitch is enabled by -Wall
5633 while -Wswitch-enum is explicit. */
5634 warning_at (switch_location
,
5635 (default_node
|| !warn_switch
5638 "enumeration value %qE not handled in switch",
5639 TREE_PURPOSE (chain
));
5642 /* Warn if there are case expressions that don't correspond to
5643 enumerators. This can occur since C and C++ don't enforce
5644 type-checking of assignments to enumeration variables.
5646 The time complexity here is now always O(N) worst case, since
5647 we should have marked both the lower bound and upper bound of
5648 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
5649 above. This scan also resets those fields. */
5651 splay_tree_foreach (cases
, match_case_to_enum
, type
);
5654 /* Finish an expression taking the address of LABEL (an
5655 IDENTIFIER_NODE). Returns an expression for the address.
5657 LOC is the location for the expression returned. */
5660 finish_label_address_expr (tree label
, location_t loc
)
5664 pedwarn (input_location
, OPT_pedantic
, "taking the address of a label is non-standard");
5666 if (label
== error_mark_node
)
5667 return error_mark_node
;
5669 label
= lookup_label (label
);
5670 if (label
== NULL_TREE
)
5671 result
= null_pointer_node
;
5674 TREE_USED (label
) = 1;
5675 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
5676 /* The current function is not necessarily uninlinable.
5677 Computed gotos are incompatible with inlining, but the value
5678 here could be used only in a diagnostic, for example. */
5679 protected_set_expr_location (result
, loc
);
5686 /* Given a boolean expression ARG, return a tree representing an increment
5687 or decrement (as indicated by CODE) of ARG. The front end must check for
5688 invalid cases (e.g., decrement in C++). */
5690 boolean_increment (enum tree_code code
, tree arg
)
5693 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
5695 arg
= stabilize_reference (arg
);
5698 case PREINCREMENT_EXPR
:
5699 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5701 case POSTINCREMENT_EXPR
:
5702 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5703 arg
= save_expr (arg
);
5704 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5705 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5707 case PREDECREMENT_EXPR
:
5708 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5709 invert_truthvalue_loc (input_location
, arg
));
5711 case POSTDECREMENT_EXPR
:
5712 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5713 invert_truthvalue_loc (input_location
, arg
));
5714 arg
= save_expr (arg
);
5715 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5716 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5721 TREE_SIDE_EFFECTS (val
) = 1;
5725 /* Built-in macros for stddef.h and stdint.h, that require macros
5726 defined in this file. */
5728 c_stddef_cpp_builtins(void)
5730 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
5731 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
5732 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
5733 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
5734 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
5735 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
5736 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
5737 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
5738 if (SIG_ATOMIC_TYPE
)
5739 builtin_define_with_value ("__SIG_ATOMIC_TYPE__", SIG_ATOMIC_TYPE
, 0);
5741 builtin_define_with_value ("__INT8_TYPE__", INT8_TYPE
, 0);
5743 builtin_define_with_value ("__INT16_TYPE__", INT16_TYPE
, 0);
5745 builtin_define_with_value ("__INT32_TYPE__", INT32_TYPE
, 0);
5747 builtin_define_with_value ("__INT64_TYPE__", INT64_TYPE
, 0);
5749 builtin_define_with_value ("__UINT8_TYPE__", UINT8_TYPE
, 0);
5751 builtin_define_with_value ("__UINT16_TYPE__", UINT16_TYPE
, 0);
5753 builtin_define_with_value ("__UINT32_TYPE__", UINT32_TYPE
, 0);
5755 builtin_define_with_value ("__UINT64_TYPE__", UINT64_TYPE
, 0);
5756 if (INT_LEAST8_TYPE
)
5757 builtin_define_with_value ("__INT_LEAST8_TYPE__", INT_LEAST8_TYPE
, 0);
5758 if (INT_LEAST16_TYPE
)
5759 builtin_define_with_value ("__INT_LEAST16_TYPE__", INT_LEAST16_TYPE
, 0);
5760 if (INT_LEAST32_TYPE
)
5761 builtin_define_with_value ("__INT_LEAST32_TYPE__", INT_LEAST32_TYPE
, 0);
5762 if (INT_LEAST64_TYPE
)
5763 builtin_define_with_value ("__INT_LEAST64_TYPE__", INT_LEAST64_TYPE
, 0);
5764 if (UINT_LEAST8_TYPE
)
5765 builtin_define_with_value ("__UINT_LEAST8_TYPE__", UINT_LEAST8_TYPE
, 0);
5766 if (UINT_LEAST16_TYPE
)
5767 builtin_define_with_value ("__UINT_LEAST16_TYPE__", UINT_LEAST16_TYPE
, 0);
5768 if (UINT_LEAST32_TYPE
)
5769 builtin_define_with_value ("__UINT_LEAST32_TYPE__", UINT_LEAST32_TYPE
, 0);
5770 if (UINT_LEAST64_TYPE
)
5771 builtin_define_with_value ("__UINT_LEAST64_TYPE__", UINT_LEAST64_TYPE
, 0);
5773 builtin_define_with_value ("__INT_FAST8_TYPE__", INT_FAST8_TYPE
, 0);
5774 if (INT_FAST16_TYPE
)
5775 builtin_define_with_value ("__INT_FAST16_TYPE__", INT_FAST16_TYPE
, 0);
5776 if (INT_FAST32_TYPE
)
5777 builtin_define_with_value ("__INT_FAST32_TYPE__", INT_FAST32_TYPE
, 0);
5778 if (INT_FAST64_TYPE
)
5779 builtin_define_with_value ("__INT_FAST64_TYPE__", INT_FAST64_TYPE
, 0);
5780 if (UINT_FAST8_TYPE
)
5781 builtin_define_with_value ("__UINT_FAST8_TYPE__", UINT_FAST8_TYPE
, 0);
5782 if (UINT_FAST16_TYPE
)
5783 builtin_define_with_value ("__UINT_FAST16_TYPE__", UINT_FAST16_TYPE
, 0);
5784 if (UINT_FAST32_TYPE
)
5785 builtin_define_with_value ("__UINT_FAST32_TYPE__", UINT_FAST32_TYPE
, 0);
5786 if (UINT_FAST64_TYPE
)
5787 builtin_define_with_value ("__UINT_FAST64_TYPE__", UINT_FAST64_TYPE
, 0);
5789 builtin_define_with_value ("__INTPTR_TYPE__", INTPTR_TYPE
, 0);
5791 builtin_define_with_value ("__UINTPTR_TYPE__", UINTPTR_TYPE
, 0);
5795 c_init_attributes (void)
5797 /* Fill in the built_in_attributes array. */
5798 #define DEF_ATTR_NULL_TREE(ENUM) \
5799 built_in_attributes[(int) ENUM] = NULL_TREE;
5800 #define DEF_ATTR_INT(ENUM, VALUE) \
5801 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5802 #define DEF_ATTR_IDENT(ENUM, STRING) \
5803 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5804 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5805 built_in_attributes[(int) ENUM] \
5806 = tree_cons (built_in_attributes[(int) PURPOSE], \
5807 built_in_attributes[(int) VALUE], \
5808 built_in_attributes[(int) CHAIN]);
5809 #include "builtin-attrs.def"
5810 #undef DEF_ATTR_NULL_TREE
5812 #undef DEF_ATTR_IDENT
5813 #undef DEF_ATTR_TREE_LIST
5816 /* Returns TRUE iff the attribute indicated by ATTR_ID takes a plain
5817 identifier as an argument, so the front end shouldn't look it up. */
5820 attribute_takes_identifier_p (tree attr_id
)
5822 return (is_attribute_p ("mode", attr_id
)
5823 || is_attribute_p ("format", attr_id
)
5824 || is_attribute_p ("cleanup", attr_id
));
5827 /* Attribute handlers common to C front ends. */
5829 /* Handle a "packed" attribute; arguments as in
5830 struct attribute_spec.handler. */
5833 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5834 int flags
, bool *no_add_attrs
)
5838 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5839 *node
= build_variant_type_copy (*node
);
5840 TYPE_PACKED (*node
) = 1;
5842 else if (TREE_CODE (*node
) == FIELD_DECL
)
5844 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
5845 /* Still pack bitfields. */
5846 && ! DECL_INITIAL (*node
))
5847 warning (OPT_Wattributes
,
5848 "%qE attribute ignored for field of type %qT",
5849 name
, TREE_TYPE (*node
));
5851 DECL_PACKED (*node
) = 1;
5853 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5854 used for DECL_REGISTER. It wouldn't mean anything anyway.
5855 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5856 that changes what the typedef is typing. */
5859 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5860 *no_add_attrs
= true;
5866 /* Handle a "nocommon" attribute; arguments as in
5867 struct attribute_spec.handler. */
5870 handle_nocommon_attribute (tree
*node
, tree name
,
5871 tree
ARG_UNUSED (args
),
5872 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5874 if (TREE_CODE (*node
) == VAR_DECL
)
5875 DECL_COMMON (*node
) = 0;
5878 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5879 *no_add_attrs
= true;
5885 /* Handle a "common" attribute; arguments as in
5886 struct attribute_spec.handler. */
5889 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5890 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5892 if (TREE_CODE (*node
) == VAR_DECL
)
5893 DECL_COMMON (*node
) = 1;
5896 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5897 *no_add_attrs
= true;
5903 /* Handle a "noreturn" attribute; arguments as in
5904 struct attribute_spec.handler. */
5907 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5908 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5910 tree type
= TREE_TYPE (*node
);
5912 /* See FIXME comment in c_common_attribute_table. */
5913 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5914 TREE_THIS_VOLATILE (*node
) = 1;
5915 else if (TREE_CODE (type
) == POINTER_TYPE
5916 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5918 = build_pointer_type
5919 (build_type_variant (TREE_TYPE (type
),
5920 TYPE_READONLY (TREE_TYPE (type
)), 1));
5923 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5924 *no_add_attrs
= true;
5930 /* Handle a "hot" and attribute; arguments as in
5931 struct attribute_spec.handler. */
5934 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5935 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5937 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5939 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
5941 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5943 *no_add_attrs
= true;
5945 /* Most of the rest of the hot processing is done later with
5946 lookup_attribute. */
5950 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5951 *no_add_attrs
= true;
5956 /* Handle a "cold" and attribute; arguments as in
5957 struct attribute_spec.handler. */
5960 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5961 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5963 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5965 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
5967 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5969 *no_add_attrs
= true;
5971 /* Most of the rest of the cold processing is done later with
5972 lookup_attribute. */
5976 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5977 *no_add_attrs
= true;
5983 /* Handle a "noinline" attribute; arguments as in
5984 struct attribute_spec.handler. */
5987 handle_noinline_attribute (tree
*node
, tree name
,
5988 tree
ARG_UNUSED (args
),
5989 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5991 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5992 DECL_UNINLINABLE (*node
) = 1;
5995 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5996 *no_add_attrs
= true;
6002 /* Handle a "noclone" attribute; arguments as in
6003 struct attribute_spec.handler. */
6006 handle_noclone_attribute (tree
*node
, tree name
,
6007 tree
ARG_UNUSED (args
),
6008 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6010 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6012 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6013 *no_add_attrs
= true;
6019 /* Handle a "always_inline" attribute; arguments as in
6020 struct attribute_spec.handler. */
6023 handle_always_inline_attribute (tree
*node
, tree name
,
6024 tree
ARG_UNUSED (args
),
6025 int ARG_UNUSED (flags
),
6028 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6030 /* Set the attribute and mark it for disregarding inline
6032 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
6036 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6037 *no_add_attrs
= true;
6043 /* Handle a "gnu_inline" attribute; arguments as in
6044 struct attribute_spec.handler. */
6047 handle_gnu_inline_attribute (tree
*node
, tree name
,
6048 tree
ARG_UNUSED (args
),
6049 int ARG_UNUSED (flags
),
6052 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
6054 /* Do nothing else, just set the attribute. We'll get at
6055 it later with lookup_attribute. */
6059 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6060 *no_add_attrs
= true;
6066 /* Handle an "artificial" attribute; arguments as in
6067 struct attribute_spec.handler. */
6070 handle_artificial_attribute (tree
*node
, tree name
,
6071 tree
ARG_UNUSED (args
),
6072 int ARG_UNUSED (flags
),
6075 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
6077 /* Do nothing else, just set the attribute. We'll get at
6078 it later with lookup_attribute. */
6082 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6083 *no_add_attrs
= true;
6089 /* Handle a "flatten" attribute; arguments as in
6090 struct attribute_spec.handler. */
6093 handle_flatten_attribute (tree
*node
, tree name
,
6094 tree args ATTRIBUTE_UNUSED
,
6095 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
6097 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6098 /* Do nothing else, just set the attribute. We'll get at
6099 it later with lookup_attribute. */
6103 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6104 *no_add_attrs
= true;
6110 /* Handle a "warning" or "error" attribute; arguments as in
6111 struct attribute_spec.handler. */
6114 handle_error_attribute (tree
*node
, tree name
, tree args
,
6115 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6117 if (TREE_CODE (*node
) == FUNCTION_DECL
6118 || TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
6119 /* Do nothing else, just set the attribute. We'll get at
6120 it later with lookup_attribute. */
6124 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6125 *no_add_attrs
= true;
6131 /* Handle a "used" attribute; arguments as in
6132 struct attribute_spec.handler. */
6135 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
6136 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6140 if (TREE_CODE (node
) == FUNCTION_DECL
6141 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
6143 TREE_USED (node
) = 1;
6144 DECL_PRESERVE_P (node
) = 1;
6145 if (TREE_CODE (node
) == VAR_DECL
)
6146 DECL_READ_P (node
) = 1;
6150 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6151 *no_add_attrs
= true;
6157 /* Handle a "unused" attribute; arguments as in
6158 struct attribute_spec.handler. */
6161 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6162 int flags
, bool *no_add_attrs
)
6168 if (TREE_CODE (decl
) == PARM_DECL
6169 || TREE_CODE (decl
) == VAR_DECL
6170 || TREE_CODE (decl
) == FUNCTION_DECL
6171 || TREE_CODE (decl
) == LABEL_DECL
6172 || TREE_CODE (decl
) == TYPE_DECL
)
6174 TREE_USED (decl
) = 1;
6175 if (TREE_CODE (decl
) == VAR_DECL
6176 || TREE_CODE (decl
) == PARM_DECL
)
6177 DECL_READ_P (decl
) = 1;
6181 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6182 *no_add_attrs
= true;
6187 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6188 *node
= build_variant_type_copy (*node
);
6189 TREE_USED (*node
) = 1;
6195 /* Handle a "externally_visible" attribute; arguments as in
6196 struct attribute_spec.handler. */
6199 handle_externally_visible_attribute (tree
*pnode
, tree name
,
6200 tree
ARG_UNUSED (args
),
6201 int ARG_UNUSED (flags
),
6206 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
6208 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
6209 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
6211 warning (OPT_Wattributes
,
6212 "%qE attribute have effect only on public objects", name
);
6213 *no_add_attrs
= true;
6218 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6219 *no_add_attrs
= true;
6225 /* Handle a "const" attribute; arguments as in
6226 struct attribute_spec.handler. */
6229 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6230 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6232 tree type
= TREE_TYPE (*node
);
6234 /* See FIXME comment on noreturn in c_common_attribute_table. */
6235 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6236 TREE_READONLY (*node
) = 1;
6237 else if (TREE_CODE (type
) == POINTER_TYPE
6238 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
6240 = build_pointer_type
6241 (build_type_variant (TREE_TYPE (type
), 1,
6242 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
6245 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6246 *no_add_attrs
= true;
6252 /* Handle a "transparent_union" attribute; arguments as in
6253 struct attribute_spec.handler. */
6256 handle_transparent_union_attribute (tree
*node
, tree name
,
6257 tree
ARG_UNUSED (args
), int flags
,
6262 *no_add_attrs
= true;
6264 if (TREE_CODE (*node
) == TYPE_DECL
)
6265 node
= &TREE_TYPE (*node
);
6268 if (TREE_CODE (type
) == UNION_TYPE
)
6270 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
6271 the code in finish_struct. */
6272 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6274 if (TYPE_FIELDS (type
) == NULL_TREE
6275 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
6278 /* A type variant isn't good enough, since we don't a cast
6279 to such a type removed as a no-op. */
6280 *node
= type
= build_duplicate_type (type
);
6283 TYPE_TRANSPARENT_AGGR (type
) = 1;
6288 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6292 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
6293 get the requested priority for a constructor or destructor,
6294 possibly issuing diagnostics for invalid or reserved
6297 static priority_type
6298 get_priority (tree args
, bool is_destructor
)
6304 return DEFAULT_INIT_PRIORITY
;
6306 if (!SUPPORTS_INIT_PRIORITY
)
6309 error ("destructor priorities are not supported");
6311 error ("constructor priorities are not supported");
6312 return DEFAULT_INIT_PRIORITY
;
6315 arg
= TREE_VALUE (args
);
6316 if (!host_integerp (arg
, /*pos=*/0)
6317 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
6320 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
6321 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
6324 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
6328 "destructor priorities from 0 to %d are reserved "
6329 "for the implementation",
6330 MAX_RESERVED_INIT_PRIORITY
);
6333 "constructor priorities from 0 to %d are reserved "
6334 "for the implementation",
6335 MAX_RESERVED_INIT_PRIORITY
);
6341 error ("destructor priorities must be integers from 0 to %d inclusive",
6344 error ("constructor priorities must be integers from 0 to %d inclusive",
6346 return DEFAULT_INIT_PRIORITY
;
6349 /* Handle a "constructor" attribute; arguments as in
6350 struct attribute_spec.handler. */
6353 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
6354 int ARG_UNUSED (flags
),
6358 tree type
= TREE_TYPE (decl
);
6360 if (TREE_CODE (decl
) == FUNCTION_DECL
6361 && TREE_CODE (type
) == FUNCTION_TYPE
6362 && decl_function_context (decl
) == 0)
6364 priority_type priority
;
6365 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
6366 priority
= get_priority (args
, /*is_destructor=*/false);
6367 SET_DECL_INIT_PRIORITY (decl
, priority
);
6368 TREE_USED (decl
) = 1;
6372 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6373 *no_add_attrs
= true;
6379 /* Handle a "destructor" attribute; arguments as in
6380 struct attribute_spec.handler. */
6383 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
6384 int ARG_UNUSED (flags
),
6388 tree type
= TREE_TYPE (decl
);
6390 if (TREE_CODE (decl
) == FUNCTION_DECL
6391 && TREE_CODE (type
) == FUNCTION_TYPE
6392 && decl_function_context (decl
) == 0)
6394 priority_type priority
;
6395 DECL_STATIC_DESTRUCTOR (decl
) = 1;
6396 priority
= get_priority (args
, /*is_destructor=*/true);
6397 SET_DECL_FINI_PRIORITY (decl
, priority
);
6398 TREE_USED (decl
) = 1;
6402 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6403 *no_add_attrs
= true;
6409 /* Handle a "mode" attribute; arguments as in
6410 struct attribute_spec.handler. */
6413 handle_mode_attribute (tree
*node
, tree name
, tree args
,
6414 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6417 tree ident
= TREE_VALUE (args
);
6419 *no_add_attrs
= true;
6421 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
6422 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6426 const char *p
= IDENTIFIER_POINTER (ident
);
6427 int len
= strlen (p
);
6428 enum machine_mode mode
= VOIDmode
;
6432 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
6433 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
6435 char *newp
= (char *) alloca (len
- 1);
6437 strcpy (newp
, &p
[2]);
6438 newp
[len
- 4] = '\0';
6442 /* Change this type to have a type with the specified mode.
6443 First check for the special modes. */
6444 if (!strcmp (p
, "byte"))
6446 else if (!strcmp (p
, "word"))
6448 else if (!strcmp (p
, "pointer"))
6450 else if (!strcmp (p
, "libgcc_cmp_return"))
6451 mode
= targetm
.libgcc_cmp_return_mode ();
6452 else if (!strcmp (p
, "libgcc_shift_count"))
6453 mode
= targetm
.libgcc_shift_count_mode ();
6454 else if (!strcmp (p
, "unwind_word"))
6455 mode
= targetm
.unwind_word_mode ();
6457 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
6458 if (!strcmp (p
, GET_MODE_NAME (j
)))
6460 mode
= (enum machine_mode
) j
;
6464 if (mode
== VOIDmode
)
6466 error ("unknown machine mode %qE", ident
);
6471 switch (GET_MODE_CLASS (mode
))
6474 case MODE_PARTIAL_INT
:
6476 case MODE_DECIMAL_FLOAT
:
6481 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
6484 case MODE_COMPLEX_INT
:
6485 case MODE_COMPLEX_FLOAT
:
6486 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
6489 case MODE_VECTOR_INT
:
6490 case MODE_VECTOR_FLOAT
:
6491 case MODE_VECTOR_FRACT
:
6492 case MODE_VECTOR_UFRACT
:
6493 case MODE_VECTOR_ACCUM
:
6494 case MODE_VECTOR_UACCUM
:
6495 warning (OPT_Wattributes
, "specifying vector types with "
6496 "__attribute__ ((mode)) is deprecated");
6497 warning (OPT_Wattributes
,
6498 "use __attribute__ ((vector_size)) instead");
6499 valid_mode
= vector_mode_valid_p (mode
);
6507 error ("unable to emulate %qs", p
);
6511 if (POINTER_TYPE_P (type
))
6513 addr_space_t as
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
6514 tree (*fn
)(tree
, enum machine_mode
, bool);
6516 if (!targetm
.addr_space
.valid_pointer_mode (mode
, as
))
6518 error ("invalid pointer mode %qs", p
);
6522 if (TREE_CODE (type
) == POINTER_TYPE
)
6523 fn
= build_pointer_type_for_mode
;
6525 fn
= build_reference_type_for_mode
;
6526 typefm
= fn (TREE_TYPE (type
), mode
, false);
6530 /* For fixed-point modes, we need to test if the signness of type
6531 and the machine mode are consistent. */
6532 if (ALL_FIXED_POINT_MODE_P (mode
)
6533 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
6535 error ("signness of type and machine mode %qs don't match", p
);
6538 /* For fixed-point modes, we need to pass saturating info. */
6539 typefm
= lang_hooks
.types
.type_for_mode (mode
,
6540 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
6541 : TYPE_UNSIGNED (type
));
6544 if (typefm
== NULL_TREE
)
6546 error ("no data type for mode %qs", p
);
6549 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
6551 /* For enumeral types, copy the precision from the integer
6552 type returned above. If not an INTEGER_TYPE, we can't use
6553 this mode for this type. */
6554 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
6556 error ("cannot use mode %qs for enumeral types", p
);
6560 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
6562 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
6567 /* We cannot build a type variant, as there's code that assumes
6568 that TYPE_MAIN_VARIANT has the same mode. This includes the
6569 debug generators. Instead, create a subrange type. This
6570 results in all of the enumeral values being emitted only once
6571 in the original, and the subtype gets them by reference. */
6572 if (TYPE_UNSIGNED (type
))
6573 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
6575 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
6576 TREE_TYPE (typefm
) = type
;
6579 else if (VECTOR_MODE_P (mode
)
6580 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
6581 : TREE_CODE (type
) != TREE_CODE (typefm
))
6583 error ("mode %qs applied to inappropriate type", p
);
6593 /* Handle a "section" attribute; arguments as in
6594 struct attribute_spec.handler. */
6597 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6598 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6602 if (targetm
.have_named_sections
)
6604 user_defined_section_attribute
= true;
6606 if ((TREE_CODE (decl
) == FUNCTION_DECL
6607 || TREE_CODE (decl
) == VAR_DECL
)
6608 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
6610 if (TREE_CODE (decl
) == VAR_DECL
6611 && current_function_decl
!= NULL_TREE
6612 && !TREE_STATIC (decl
))
6614 error_at (DECL_SOURCE_LOCATION (decl
),
6615 "section attribute cannot be specified for "
6617 *no_add_attrs
= true;
6620 /* The decl may have already been given a section attribute
6621 from a previous declaration. Ensure they match. */
6622 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
6623 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
6624 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
6626 error ("section of %q+D conflicts with previous declaration",
6628 *no_add_attrs
= true;
6630 else if (TREE_CODE (decl
) == VAR_DECL
6631 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
6632 && DECL_THREAD_LOCAL_P (decl
))
6634 error ("section of %q+D cannot be overridden", *node
);
6635 *no_add_attrs
= true;
6638 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
6642 error ("section attribute not allowed for %q+D", *node
);
6643 *no_add_attrs
= true;
6648 error_at (DECL_SOURCE_LOCATION (*node
),
6649 "section attributes are not supported for this target");
6650 *no_add_attrs
= true;
6656 /* Handle a "aligned" attribute; arguments as in
6657 struct attribute_spec.handler. */
6660 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6661 int flags
, bool *no_add_attrs
)
6663 tree decl
= NULL_TREE
;
6666 tree align_expr
= (args
? TREE_VALUE (args
)
6667 : size_int (ATTRIBUTE_ALIGNED_VALUE
/ BITS_PER_UNIT
));
6673 type
= &TREE_TYPE (decl
);
6674 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
6676 else if (TYPE_P (*node
))
6677 type
= node
, is_type
= 1;
6679 if (TREE_CODE (align_expr
) != INTEGER_CST
)
6681 error ("requested alignment is not a constant");
6682 *no_add_attrs
= true;
6684 else if ((i
= tree_log2 (align_expr
)) == -1)
6686 error ("requested alignment is not a power of 2");
6687 *no_add_attrs
= true;
6689 else if (i
>= HOST_BITS_PER_INT
- BITS_PER_UNIT_LOG
)
6691 error ("requested alignment is too large");
6692 *no_add_attrs
= true;
6696 /* If we have a TYPE_DECL, then copy the type, so that we
6697 don't accidentally modify a builtin type. See pushdecl. */
6698 if (decl
&& TREE_TYPE (decl
) != error_mark_node
6699 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
6701 tree tt
= TREE_TYPE (decl
);
6702 *type
= build_variant_type_copy (*type
);
6703 DECL_ORIGINAL_TYPE (decl
) = tt
;
6704 TYPE_NAME (*type
) = decl
;
6705 TREE_USED (*type
) = TREE_USED (decl
);
6706 TREE_TYPE (decl
) = *type
;
6708 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6709 *type
= build_variant_type_copy (*type
);
6711 TYPE_ALIGN (*type
) = (1U << i
) * BITS_PER_UNIT
;
6712 TYPE_USER_ALIGN (*type
) = 1;
6714 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
6715 && TREE_CODE (decl
) != FIELD_DECL
)
6717 error ("alignment may not be specified for %q+D", decl
);
6718 *no_add_attrs
= true;
6720 else if (TREE_CODE (decl
) == FUNCTION_DECL
6721 && DECL_ALIGN (decl
) > (1U << i
) * BITS_PER_UNIT
)
6723 if (DECL_USER_ALIGN (decl
))
6724 error ("alignment for %q+D was previously specified as %d "
6725 "and may not be decreased", decl
,
6726 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6728 error ("alignment for %q+D must be at least %d", decl
,
6729 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6730 *no_add_attrs
= true;
6734 DECL_ALIGN (decl
) = (1U << i
) * BITS_PER_UNIT
;
6735 DECL_USER_ALIGN (decl
) = 1;
6741 /* Handle a "weak" attribute; arguments as in
6742 struct attribute_spec.handler. */
6745 handle_weak_attribute (tree
*node
, tree name
,
6746 tree
ARG_UNUSED (args
),
6747 int ARG_UNUSED (flags
),
6748 bool * ARG_UNUSED (no_add_attrs
))
6750 if (TREE_CODE (*node
) == FUNCTION_DECL
6751 && DECL_DECLARED_INLINE_P (*node
))
6753 error ("inline function %q+D cannot be declared weak", *node
);
6754 *no_add_attrs
= true;
6756 else if (TREE_CODE (*node
) == FUNCTION_DECL
6757 || TREE_CODE (*node
) == VAR_DECL
)
6758 declare_weak (*node
);
6760 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6765 /* Handle an "alias" attribute; arguments as in
6766 struct attribute_spec.handler. */
6769 handle_alias_attribute (tree
*node
, tree name
, tree args
,
6770 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6774 if (TREE_CODE (decl
) != FUNCTION_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
6776 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6777 *no_add_attrs
= true;
6779 else if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
6780 || (TREE_CODE (decl
) != FUNCTION_DECL
6781 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
6782 /* A static variable declaration is always a tentative definition,
6783 but the alias is a non-tentative definition which overrides. */
6784 || (TREE_CODE (decl
) != FUNCTION_DECL
6785 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
6787 error ("%q+D defined both normally and as an alias", decl
);
6788 *no_add_attrs
= true;
6791 /* Note that the very first time we process a nested declaration,
6792 decl_function_context will not be set. Indeed, *would* never
6793 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6794 we do below. After such frobbery, pushdecl would set the context.
6795 In any case, this is never what we want. */
6796 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
6800 id
= TREE_VALUE (args
);
6801 if (TREE_CODE (id
) != STRING_CST
)
6803 error ("alias argument not a string");
6804 *no_add_attrs
= true;
6807 id
= get_identifier (TREE_STRING_POINTER (id
));
6808 /* This counts as a use of the object pointed to. */
6811 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6812 DECL_INITIAL (decl
) = error_mark_node
;
6815 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
6816 DECL_EXTERNAL (decl
) = 1;
6818 DECL_EXTERNAL (decl
) = 0;
6819 TREE_STATIC (decl
) = 1;
6824 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6825 *no_add_attrs
= true;
6831 /* Handle a "weakref" attribute; arguments as in struct
6832 attribute_spec.handler. */
6835 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6836 int flags
, bool *no_add_attrs
)
6838 tree attr
= NULL_TREE
;
6840 /* We must ignore the attribute when it is associated with
6841 local-scoped decls, since attribute alias is ignored and many
6842 such symbols do not even have a DECL_WEAK field. */
6843 if (decl_function_context (*node
)
6844 || current_function_decl
6845 || (TREE_CODE (*node
) != VAR_DECL
&& TREE_CODE (*node
) != FUNCTION_DECL
))
6847 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6848 *no_add_attrs
= true;
6852 /* The idea here is that `weakref("name")' mutates into `weakref,
6853 alias("name")', and weakref without arguments, in turn,
6854 implicitly adds weak. */
6858 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
6859 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
6861 *no_add_attrs
= true;
6863 decl_attributes (node
, attr
, flags
);
6867 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
6868 error_at (DECL_SOURCE_LOCATION (*node
),
6869 "weakref attribute must appear before alias attribute");
6871 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6872 and that isn't supported; and because it wants to add it to
6873 the list of weak decls, which isn't helpful. */
6874 DECL_WEAK (*node
) = 1;
6880 /* Handle an "visibility" attribute; arguments as in
6881 struct attribute_spec.handler. */
6884 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
6885 int ARG_UNUSED (flags
),
6886 bool *ARG_UNUSED (no_add_attrs
))
6889 tree id
= TREE_VALUE (args
);
6890 enum symbol_visibility vis
;
6894 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
6896 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
6898 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
6902 else if (TYPE_FIELDS (*node
))
6904 error ("%qE attribute ignored because %qT is already defined",
6909 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
6911 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6915 if (TREE_CODE (id
) != STRING_CST
)
6917 error ("visibility argument not a string");
6921 /* If this is a type, set the visibility on the type decl. */
6924 decl
= TYPE_NAME (decl
);
6927 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6929 warning (OPT_Wattributes
, "%qE attribute ignored on types",
6935 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
6936 vis
= VISIBILITY_DEFAULT
;
6937 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
6938 vis
= VISIBILITY_INTERNAL
;
6939 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
6940 vis
= VISIBILITY_HIDDEN
;
6941 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
6942 vis
= VISIBILITY_PROTECTED
;
6945 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6946 vis
= VISIBILITY_DEFAULT
;
6949 if (DECL_VISIBILITY_SPECIFIED (decl
)
6950 && vis
!= DECL_VISIBILITY (decl
))
6952 tree attributes
= (TYPE_P (*node
)
6953 ? TYPE_ATTRIBUTES (*node
)
6954 : DECL_ATTRIBUTES (decl
));
6955 if (lookup_attribute ("visibility", attributes
))
6956 error ("%qD redeclared with different visibility", decl
);
6957 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6958 && lookup_attribute ("dllimport", attributes
))
6959 error ("%qD was declared %qs which implies default visibility",
6961 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6962 && lookup_attribute ("dllexport", attributes
))
6963 error ("%qD was declared %qs which implies default visibility",
6967 DECL_VISIBILITY (decl
) = vis
;
6968 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
6970 /* Go ahead and attach the attribute to the node as well. This is needed
6971 so we can determine whether we have VISIBILITY_DEFAULT because the
6972 visibility was not specified, or because it was explicitly overridden
6973 from the containing scope. */
6978 /* Determine the ELF symbol visibility for DECL, which is either a
6979 variable or a function. It is an error to use this function if a
6980 definition of DECL is not available in this translation unit.
6981 Returns true if the final visibility has been determined by this
6982 function; false if the caller is free to make additional
6986 c_determine_visibility (tree decl
)
6988 gcc_assert (TREE_CODE (decl
) == VAR_DECL
6989 || TREE_CODE (decl
) == FUNCTION_DECL
);
6991 /* If the user explicitly specified the visibility with an
6992 attribute, honor that. DECL_VISIBILITY will have been set during
6993 the processing of the attribute. We check for an explicit
6994 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6995 to distinguish the use of an attribute from the use of a "#pragma
6996 GCC visibility push(...)"; in the latter case we still want other
6997 considerations to be able to overrule the #pragma. */
6998 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
6999 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
7000 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
7001 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
7004 /* Set default visibility to whatever the user supplied with
7005 visibility_specified depending on #pragma GCC visibility. */
7006 if (!DECL_VISIBILITY_SPECIFIED (decl
))
7008 if (visibility_options
.inpragma
7009 || DECL_VISIBILITY (decl
) != default_visibility
)
7011 DECL_VISIBILITY (decl
) = default_visibility
;
7012 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
7013 /* If visibility changed and DECL already has DECL_RTL, ensure
7014 symbol flags are updated. */
7015 if (((TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
))
7016 || TREE_CODE (decl
) == FUNCTION_DECL
)
7017 && DECL_RTL_SET_P (decl
))
7018 make_decl_rtl (decl
);
7024 /* Handle an "tls_model" attribute; arguments as in
7025 struct attribute_spec.handler. */
7028 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
7029 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7033 enum tls_model kind
;
7035 *no_add_attrs
= true;
7037 if (TREE_CODE (decl
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (decl
))
7039 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7043 kind
= DECL_TLS_MODEL (decl
);
7044 id
= TREE_VALUE (args
);
7045 if (TREE_CODE (id
) != STRING_CST
)
7047 error ("tls_model argument not a string");
7051 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
7052 kind
= TLS_MODEL_LOCAL_EXEC
;
7053 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
7054 kind
= TLS_MODEL_INITIAL_EXEC
;
7055 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
7056 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
7057 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
7058 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
7060 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
7062 DECL_TLS_MODEL (decl
) = kind
;
7066 /* Handle a "no_instrument_function" attribute; arguments as in
7067 struct attribute_spec.handler. */
7070 handle_no_instrument_function_attribute (tree
*node
, tree name
,
7071 tree
ARG_UNUSED (args
),
7072 int ARG_UNUSED (flags
),
7077 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7079 error_at (DECL_SOURCE_LOCATION (decl
),
7080 "%qE attribute applies only to functions", name
);
7081 *no_add_attrs
= true;
7083 else if (DECL_INITIAL (decl
))
7085 error_at (DECL_SOURCE_LOCATION (decl
),
7086 "can%'t set %qE attribute after definition", name
);
7087 *no_add_attrs
= true;
7090 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
7095 /* Handle a "malloc" attribute; arguments as in
7096 struct attribute_spec.handler. */
7099 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7100 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7102 if (TREE_CODE (*node
) == FUNCTION_DECL
7103 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
7104 DECL_IS_MALLOC (*node
) = 1;
7107 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7108 *no_add_attrs
= true;
7114 /* Handle a "alloc_size" attribute; arguments as in
7115 struct attribute_spec.handler. */
7118 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
7119 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7121 unsigned arg_count
= type_num_arguments (*node
);
7122 for (; args
; args
= TREE_CHAIN (args
))
7124 tree position
= TREE_VALUE (args
);
7126 if (TREE_CODE (position
) != INTEGER_CST
7127 || TREE_INT_CST_HIGH (position
)
7128 || TREE_INT_CST_LOW (position
) < 1
7129 || TREE_INT_CST_LOW (position
) > arg_count
)
7131 warning (OPT_Wattributes
,
7132 "alloc_size parameter outside range");
7133 *no_add_attrs
= true;
7140 /* Handle a "returns_twice" attribute; arguments as in
7141 struct attribute_spec.handler. */
7144 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7145 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7147 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7148 DECL_IS_RETURNS_TWICE (*node
) = 1;
7151 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7152 *no_add_attrs
= true;
7158 /* Handle a "no_limit_stack" attribute; arguments as in
7159 struct attribute_spec.handler. */
7162 handle_no_limit_stack_attribute (tree
*node
, tree name
,
7163 tree
ARG_UNUSED (args
),
7164 int ARG_UNUSED (flags
),
7169 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7171 error_at (DECL_SOURCE_LOCATION (decl
),
7172 "%qE attribute applies only to functions", name
);
7173 *no_add_attrs
= true;
7175 else if (DECL_INITIAL (decl
))
7177 error_at (DECL_SOURCE_LOCATION (decl
),
7178 "can%'t set %qE attribute after definition", name
);
7179 *no_add_attrs
= true;
7182 DECL_NO_LIMIT_STACK (decl
) = 1;
7187 /* Handle a "pure" attribute; arguments as in
7188 struct attribute_spec.handler. */
7191 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7192 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7194 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7195 DECL_PURE_P (*node
) = 1;
7196 /* ??? TODO: Support types. */
7199 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7200 *no_add_attrs
= true;
7206 /* Handle a "no vops" attribute; arguments as in
7207 struct attribute_spec.handler. */
7210 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7211 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
7212 bool *ARG_UNUSED (no_add_attrs
))
7214 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
7215 DECL_IS_NOVOPS (*node
) = 1;
7219 /* Handle a "deprecated" attribute; arguments as in
7220 struct attribute_spec.handler. */
7223 handle_deprecated_attribute (tree
*node
, tree name
,
7224 tree args
, int flags
,
7227 tree type
= NULL_TREE
;
7229 tree what
= NULL_TREE
;
7232 *no_add_attrs
= true;
7233 else if (TREE_CODE (TREE_VALUE (args
)) != STRING_CST
)
7235 error ("deprecated message is not a string");
7236 *no_add_attrs
= true;
7242 type
= TREE_TYPE (decl
);
7244 if (TREE_CODE (decl
) == TYPE_DECL
7245 || TREE_CODE (decl
) == PARM_DECL
7246 || TREE_CODE (decl
) == VAR_DECL
7247 || TREE_CODE (decl
) == FUNCTION_DECL
7248 || TREE_CODE (decl
) == FIELD_DECL
)
7249 TREE_DEPRECATED (decl
) = 1;
7253 else if (TYPE_P (*node
))
7255 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
7256 *node
= build_variant_type_copy (*node
);
7257 TREE_DEPRECATED (*node
) = 1;
7265 *no_add_attrs
= true;
7266 if (type
&& TYPE_NAME (type
))
7268 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
7269 what
= TYPE_NAME (*node
);
7270 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
7271 && DECL_NAME (TYPE_NAME (type
)))
7272 what
= DECL_NAME (TYPE_NAME (type
));
7275 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
7277 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7283 /* Handle a "vector_size" attribute; arguments as in
7284 struct attribute_spec.handler. */
7287 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
7288 int ARG_UNUSED (flags
),
7291 unsigned HOST_WIDE_INT vecsize
, nunits
;
7292 enum machine_mode orig_mode
;
7293 tree type
= *node
, new_type
, size
;
7295 *no_add_attrs
= true;
7297 size
= TREE_VALUE (args
);
7299 if (!host_integerp (size
, 1))
7301 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7305 /* Get the vector size (in bytes). */
7306 vecsize
= tree_low_cst (size
, 1);
7308 /* We need to provide for vector pointers, vector arrays, and
7309 functions returning vectors. For example:
7311 __attribute__((vector_size(16))) short *foo;
7313 In this case, the mode is SI, but the type being modified is
7314 HI, so we need to look further. */
7316 while (POINTER_TYPE_P (type
)
7317 || TREE_CODE (type
) == FUNCTION_TYPE
7318 || TREE_CODE (type
) == METHOD_TYPE
7319 || TREE_CODE (type
) == ARRAY_TYPE
7320 || TREE_CODE (type
) == OFFSET_TYPE
)
7321 type
= TREE_TYPE (type
);
7323 /* Get the mode of the type being modified. */
7324 orig_mode
= TYPE_MODE (type
);
7326 if ((!INTEGRAL_TYPE_P (type
)
7327 && !SCALAR_FLOAT_TYPE_P (type
)
7328 && !FIXED_POINT_TYPE_P (type
))
7329 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
7330 && GET_MODE_CLASS (orig_mode
) != MODE_INT
7331 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
7332 || !host_integerp (TYPE_SIZE_UNIT (type
), 1)
7333 || TREE_CODE (type
) == BOOLEAN_TYPE
)
7335 error ("invalid vector type for attribute %qE", name
);
7339 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
7341 error ("vector size not an integral multiple of component size");
7347 error ("zero vector size");
7351 /* Calculate how many units fit in the vector. */
7352 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
7353 if (nunits
& (nunits
- 1))
7355 error ("number of components of the vector not a power of two");
7359 new_type
= build_vector_type (type
, nunits
);
7361 /* Build back pointers if needed. */
7362 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
7367 /* Handle the "nonnull" attribute. */
7369 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7370 tree args
, int ARG_UNUSED (flags
),
7374 unsigned HOST_WIDE_INT attr_arg_num
;
7376 /* If no arguments are specified, all pointer arguments should be
7377 non-null. Verify a full prototype is given so that the arguments
7378 will have the correct types when we actually check them later. */
7381 if (!TYPE_ARG_TYPES (type
))
7383 error ("nonnull attribute without arguments on a non-prototype");
7384 *no_add_attrs
= true;
7389 /* Argument list specified. Verify that each argument number references
7390 a pointer argument. */
7391 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
7394 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
7396 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
7398 error ("nonnull argument has invalid operand number (argument %lu)",
7399 (unsigned long) attr_arg_num
);
7400 *no_add_attrs
= true;
7404 argument
= TYPE_ARG_TYPES (type
);
7407 for (ck_num
= 1; ; ck_num
++)
7409 if (!argument
|| ck_num
== arg_num
)
7411 argument
= TREE_CHAIN (argument
);
7415 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
7417 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
7418 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
7419 *no_add_attrs
= true;
7423 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
7425 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
7426 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
7427 *no_add_attrs
= true;
7436 /* Check the argument list of a function call for null in argument slots
7437 that are marked as requiring a non-null pointer argument. The NARGS
7438 arguments are passed in the array ARGARRAY.
7442 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
7447 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
7449 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
7451 args
= TREE_VALUE (a
);
7453 /* Walk the argument list. If we encounter an argument number we
7454 should check for non-null, do it. If the attribute has no args,
7455 then every pointer argument is checked (in which case the check
7456 for pointer type is done in check_nonnull_arg). */
7457 for (i
= 0; i
< nargs
; i
++)
7459 if (!args
|| nonnull_check_p (args
, i
+ 1))
7460 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
7468 /* Check that the Nth argument of a function call (counting backwards
7469 from the end) is a (pointer)0. The NARGS arguments are passed in the
7473 check_function_sentinel (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
7475 tree attr
= lookup_attribute ("sentinel", attrs
);
7483 /* Skip over the named arguments. */
7484 while (typelist
&& len
< nargs
)
7486 typelist
= TREE_CHAIN (typelist
);
7490 if (TREE_VALUE (attr
))
7492 tree p
= TREE_VALUE (TREE_VALUE (attr
));
7493 pos
= TREE_INT_CST_LOW (p
);
7496 /* The sentinel must be one of the varargs, i.e.
7497 in position >= the number of fixed arguments. */
7498 if ((nargs
- 1 - pos
) < len
)
7500 warning (OPT_Wformat
,
7501 "not enough variable arguments to fit a sentinel");
7505 /* Validate the sentinel. */
7506 sentinel
= argarray
[nargs
- 1 - pos
];
7507 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
7508 || !integer_zerop (sentinel
))
7509 /* Although __null (in C++) is only an integer we allow it
7510 nevertheless, as we are guaranteed that it's exactly
7511 as wide as a pointer, and we don't want to force
7512 users to cast the NULL they have written there.
7513 We warn with -Wstrict-null-sentinel, though. */
7514 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
7515 warning (OPT_Wformat
, "missing sentinel in function call");
7519 /* Helper for check_function_nonnull; given a list of operands which
7520 must be non-null in ARGS, determine if operand PARAM_NUM should be
7524 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
7526 unsigned HOST_WIDE_INT arg_num
= 0;
7528 for (; args
; args
= TREE_CHAIN (args
))
7530 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
7534 if (arg_num
== param_num
)
7540 /* Check that the function argument PARAM (which is operand number
7541 PARAM_NUM) is non-null. This is called by check_function_nonnull
7542 via check_function_arguments_recurse. */
7545 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
7546 unsigned HOST_WIDE_INT param_num
)
7548 /* Just skip checking the argument if it's not a pointer. This can
7549 happen if the "nonnull" attribute was given without an operand
7550 list (which means to check every pointer argument). */
7552 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
7555 if (integer_zerop (param
))
7556 warning (OPT_Wnonnull
, "null argument where non-null required "
7557 "(argument %lu)", (unsigned long) param_num
);
7560 /* Helper for nonnull attribute handling; fetch the operand number
7561 from the attribute argument list. */
7564 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
7566 /* Verify the arg number is a constant. */
7567 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
7568 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
7571 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
7575 /* Handle a "nothrow" attribute; arguments as in
7576 struct attribute_spec.handler. */
7579 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
7580 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7582 if (TREE_CODE (*node
) == FUNCTION_DECL
)
7583 TREE_NOTHROW (*node
) = 1;
7584 /* ??? TODO: Support types. */
7587 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7588 *no_add_attrs
= true;
7594 /* Handle a "cleanup" attribute; arguments as in
7595 struct attribute_spec.handler. */
7598 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
7599 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7602 tree cleanup_id
, cleanup_decl
;
7604 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
7605 for global destructors in C++. This requires infrastructure that
7606 we don't have generically at the moment. It's also not a feature
7607 we'd be missing too much, since we do have attribute constructor. */
7608 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
7610 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7611 *no_add_attrs
= true;
7615 /* Verify that the argument is a function in scope. */
7616 /* ??? We could support pointers to functions here as well, if
7617 that was considered desirable. */
7618 cleanup_id
= TREE_VALUE (args
);
7619 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
7621 error ("cleanup argument not an identifier");
7622 *no_add_attrs
= true;
7625 cleanup_decl
= lookup_name (cleanup_id
);
7626 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
7628 error ("cleanup argument not a function");
7629 *no_add_attrs
= true;
7633 /* That the function has proper type is checked with the
7634 eventual call to build_function_call. */
7639 /* Handle a "warn_unused_result" attribute. No special handling. */
7642 handle_warn_unused_result_attribute (tree
*node
, tree name
,
7643 tree
ARG_UNUSED (args
),
7644 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7646 /* Ignore the attribute for functions not returning any value. */
7647 if (VOID_TYPE_P (TREE_TYPE (*node
)))
7649 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7650 *no_add_attrs
= true;
7656 /* Handle a "sentinel" attribute. */
7659 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
7660 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7662 tree params
= TYPE_ARG_TYPES (*node
);
7666 warning (OPT_Wattributes
,
7667 "%qE attribute requires prototypes with named arguments", name
);
7668 *no_add_attrs
= true;
7672 while (TREE_CHAIN (params
))
7673 params
= TREE_CHAIN (params
);
7675 if (VOID_TYPE_P (TREE_VALUE (params
)))
7677 warning (OPT_Wattributes
,
7678 "%qE attribute only applies to variadic functions", name
);
7679 *no_add_attrs
= true;
7685 tree position
= TREE_VALUE (args
);
7687 if (TREE_CODE (position
) != INTEGER_CST
)
7689 warning (OPT_Wattributes
,
7690 "requested position is not an integer constant");
7691 *no_add_attrs
= true;
7695 if (tree_int_cst_lt (position
, integer_zero_node
))
7697 warning (OPT_Wattributes
,
7698 "requested position is less than zero");
7699 *no_add_attrs
= true;
7707 /* Handle a "type_generic" attribute. */
7710 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
7711 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
7712 bool * ARG_UNUSED (no_add_attrs
))
7716 /* Ensure we have a function type. */
7717 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
7719 params
= TYPE_ARG_TYPES (*node
);
7720 while (params
&& ! VOID_TYPE_P (TREE_VALUE (params
)))
7721 params
= TREE_CHAIN (params
);
7723 /* Ensure we have a variadic function. */
7724 gcc_assert (!params
);
7729 /* Handle a "target" attribute. */
7732 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
7735 /* Ensure we have a function type. */
7736 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7738 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7739 *no_add_attrs
= true;
7741 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
7743 *no_add_attrs
= true;
7748 /* Arguments being collected for optimization. */
7749 typedef const char *const_char_p
; /* For DEF_VEC_P. */
7750 DEF_VEC_P(const_char_p
);
7751 DEF_VEC_ALLOC_P(const_char_p
, gc
);
7752 static GTY(()) VEC(const_char_p
, gc
) *optimize_args
;
7755 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7756 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7757 false for #pragma GCC optimize. */
7760 parse_optimize_options (tree args
, bool attr_p
)
7765 int saved_flag_strict_aliasing
;
7766 const char **opt_argv
;
7769 /* Build up argv vector. Just in case the string is stored away, use garbage
7770 collected strings. */
7771 VEC_truncate (const_char_p
, optimize_args
, 0);
7772 VEC_safe_push (const_char_p
, gc
, optimize_args
, NULL
);
7774 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
7776 tree value
= TREE_VALUE (ap
);
7778 if (TREE_CODE (value
) == INTEGER_CST
)
7781 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
7782 VEC_safe_push (const_char_p
, gc
, optimize_args
, ggc_strdup (buffer
));
7785 else if (TREE_CODE (value
) == STRING_CST
)
7787 /* Split string into multiple substrings. */
7788 size_t len
= TREE_STRING_LENGTH (value
);
7789 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
7790 char *end
= p
+ len
;
7794 while (next_p
!= NULL
)
7800 comma
= strchr (p
, ',');
7813 r
= q
= (char *) ggc_alloc (len2
+ 3);
7815 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7817 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
7821 warning (OPT_Wattributes
,
7822 "Bad option %s to optimize attribute.", p
);
7824 warning (OPT_Wpragmas
,
7825 "Bad option %s to pragma attribute", p
);
7833 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7834 itself is -Os, and any other switch begins with a -f. */
7835 if ((*p
>= '0' && *p
<= '9')
7836 || (p
[0] == 's' && p
[1] == '\0'))
7842 memcpy (r
, p
, len2
);
7844 VEC_safe_push (const_char_p
, gc
, optimize_args
, q
);
7850 opt_argc
= VEC_length (const_char_p
, optimize_args
);
7851 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
7853 for (i
= 1; i
< opt_argc
; i
++)
7854 opt_argv
[i
] = VEC_index (const_char_p
, optimize_args
, i
);
7856 saved_flag_strict_aliasing
= flag_strict_aliasing
;
7858 /* Now parse the options. */
7859 decode_options (opt_argc
, opt_argv
);
7861 targetm
.override_options_after_change();
7863 /* Don't allow changing -fstrict-aliasing. */
7864 flag_strict_aliasing
= saved_flag_strict_aliasing
;
7866 VEC_truncate (const_char_p
, optimize_args
, 0);
7870 /* For handling "optimize" attribute. arguments as in
7871 struct attribute_spec.handler. */
7874 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
7875 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7877 /* Ensure we have a function type. */
7878 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7880 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7881 *no_add_attrs
= true;
7885 struct cl_optimization cur_opts
;
7886 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
7888 /* Save current options. */
7889 cl_optimization_save (&cur_opts
);
7891 /* If we previously had some optimization options, use them as the
7894 cl_optimization_restore (TREE_OPTIMIZATION (old_opts
));
7896 /* Parse options, and update the vector. */
7897 parse_optimize_options (args
, true);
7898 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
7899 = build_optimization_node ();
7901 /* Restore current options. */
7902 cl_optimization_restore (&cur_opts
);
7908 /* Check for valid arguments being passed to a function.
7909 ATTRS is a list of attributes. There are NARGS arguments in the array
7910 ARGARRAY. TYPELIST is the list of argument types for the function.
7913 check_function_arguments (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
7915 /* Check for null being passed in a pointer argument that must be
7916 non-null. We also need to do this if format checking is enabled. */
7919 check_function_nonnull (attrs
, nargs
, argarray
);
7921 /* Check for errors in format strings. */
7923 if (warn_format
|| warn_missing_format_attribute
)
7924 check_function_format (attrs
, nargs
, argarray
);
7927 check_function_sentinel (attrs
, nargs
, argarray
, typelist
);
7930 /* Generic argument checking recursion routine. PARAM is the argument to
7931 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7932 once the argument is resolved. CTX is context for the callback. */
7934 check_function_arguments_recurse (void (*callback
)
7935 (void *, tree
, unsigned HOST_WIDE_INT
),
7936 void *ctx
, tree param
,
7937 unsigned HOST_WIDE_INT param_num
)
7939 if (CONVERT_EXPR_P (param
)
7940 && (TYPE_PRECISION (TREE_TYPE (param
))
7941 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
7943 /* Strip coercion. */
7944 check_function_arguments_recurse (callback
, ctx
,
7945 TREE_OPERAND (param
, 0), param_num
);
7949 if (TREE_CODE (param
) == CALL_EXPR
)
7951 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
7953 bool found_format_arg
= false;
7955 /* See if this is a call to a known internationalization function
7956 that modifies a format arg. Such a function may have multiple
7957 format_arg attributes (for example, ngettext). */
7959 for (attrs
= TYPE_ATTRIBUTES (type
);
7961 attrs
= TREE_CHAIN (attrs
))
7962 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
7965 tree format_num_expr
;
7968 call_expr_arg_iterator iter
;
7970 /* Extract the argument number, which was previously checked
7972 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
7974 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
7975 && !TREE_INT_CST_HIGH (format_num_expr
));
7977 format_num
= TREE_INT_CST_LOW (format_num_expr
);
7979 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
7981 inner_arg
= next_call_expr_arg (&iter
), i
++)
7982 if (i
== format_num
)
7984 check_function_arguments_recurse (callback
, ctx
,
7985 inner_arg
, param_num
);
7986 found_format_arg
= true;
7991 /* If we found a format_arg attribute and did a recursive check,
7992 we are done with checking this argument. Otherwise, we continue
7993 and this will be considered a non-literal. */
7994 if (found_format_arg
)
7998 if (TREE_CODE (param
) == COND_EXPR
)
8000 /* Check both halves of the conditional expression. */
8001 check_function_arguments_recurse (callback
, ctx
,
8002 TREE_OPERAND (param
, 1), param_num
);
8003 check_function_arguments_recurse (callback
, ctx
,
8004 TREE_OPERAND (param
, 2), param_num
);
8008 (*callback
) (ctx
, param
, param_num
);
8011 /* Checks for a builtin function FNDECL that the number of arguments
8012 NARGS against the required number REQUIRED and issues an error if
8013 there is a mismatch. Returns true if the number of arguments is
8014 correct, otherwise false. */
8017 builtin_function_validate_nargs (tree fndecl
, int nargs
, int required
)
8019 if (nargs
< required
)
8021 error_at (input_location
,
8022 "not enough arguments to function %qE", fndecl
);
8025 else if (nargs
> required
)
8027 error_at (input_location
,
8028 "too many arguments to function %qE", fndecl
);
8034 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
8035 Returns false if there was an error, otherwise true. */
8038 check_builtin_function_arguments (tree fndecl
, int nargs
, tree
*args
)
8040 if (!DECL_BUILT_IN (fndecl
)
8041 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
8044 switch (DECL_FUNCTION_CODE (fndecl
))
8046 case BUILT_IN_CONSTANT_P
:
8047 return builtin_function_validate_nargs (fndecl
, nargs
, 1);
8049 case BUILT_IN_ISFINITE
:
8050 case BUILT_IN_ISINF
:
8051 case BUILT_IN_ISINF_SIGN
:
8052 case BUILT_IN_ISNAN
:
8053 case BUILT_IN_ISNORMAL
:
8054 if (builtin_function_validate_nargs (fndecl
, nargs
, 1))
8056 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
8058 error ("non-floating-point argument in call to "
8059 "function %qE", fndecl
);
8066 case BUILT_IN_ISGREATER
:
8067 case BUILT_IN_ISGREATEREQUAL
:
8068 case BUILT_IN_ISLESS
:
8069 case BUILT_IN_ISLESSEQUAL
:
8070 case BUILT_IN_ISLESSGREATER
:
8071 case BUILT_IN_ISUNORDERED
:
8072 if (builtin_function_validate_nargs (fndecl
, nargs
, 2))
8074 enum tree_code code0
, code1
;
8075 code0
= TREE_CODE (TREE_TYPE (args
[0]));
8076 code1
= TREE_CODE (TREE_TYPE (args
[1]));
8077 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
8078 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
8079 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
8081 error ("non-floating-point arguments in call to "
8082 "function %qE", fndecl
);
8089 case BUILT_IN_FPCLASSIFY
:
8090 if (builtin_function_validate_nargs (fndecl
, nargs
, 6))
8095 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
8097 error ("non-const integer argument %u in call to function %qE",
8102 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
8104 error ("non-floating-point argument in call to function %qE",
8117 /* Function to help qsort sort FIELD_DECLs by name order. */
8120 field_decl_cmp (const void *x_p
, const void *y_p
)
8122 const tree
*const x
= (const tree
*const) x_p
;
8123 const tree
*const y
= (const tree
*const) y_p
;
8125 if (DECL_NAME (*x
) == DECL_NAME (*y
))
8126 /* A nontype is "greater" than a type. */
8127 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
8128 if (DECL_NAME (*x
) == NULL_TREE
)
8130 if (DECL_NAME (*y
) == NULL_TREE
)
8132 if (DECL_NAME (*x
) < DECL_NAME (*y
))
8138 gt_pointer_operator new_value
;
8142 /* This routine compares two fields like field_decl_cmp but using the
8143 pointer operator in resort_data. */
8146 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
8148 const tree
*const x
= (const tree
*const) x_p
;
8149 const tree
*const y
= (const tree
*const) y_p
;
8151 if (DECL_NAME (*x
) == DECL_NAME (*y
))
8152 /* A nontype is "greater" than a type. */
8153 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
8154 if (DECL_NAME (*x
) == NULL_TREE
)
8156 if (DECL_NAME (*y
) == NULL_TREE
)
8159 tree d1
= DECL_NAME (*x
);
8160 tree d2
= DECL_NAME (*y
);
8161 resort_data
.new_value (&d1
, resort_data
.cookie
);
8162 resort_data
.new_value (&d2
, resort_data
.cookie
);
8169 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
8172 resort_sorted_fields (void *obj
,
8173 void * ARG_UNUSED (orig_obj
),
8174 gt_pointer_operator new_value
,
8177 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
8178 resort_data
.new_value
= new_value
;
8179 resort_data
.cookie
= cookie
;
8180 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
8181 resort_field_decl_cmp
);
8184 /* Subroutine of c_parse_error.
8185 Return the result of concatenating LHS and RHS. RHS is really
8186 a string literal, its first character is indicated by RHS_START and
8187 RHS_SIZE is its length (including the terminating NUL character).
8189 The caller is responsible for deleting the returned pointer. */
8192 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
8194 const int lhs_size
= strlen (lhs
);
8195 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
8196 strncpy (result
, lhs
, lhs_size
);
8197 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
8201 /* Issue the error given by GMSGID, indicating that it occurred before
8202 TOKEN, which had the associated VALUE. */
8205 c_parse_error (const char *gmsgid
, enum cpp_ttype token_type
,
8206 tree value
, unsigned char token_flags
)
8208 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
8210 char *message
= NULL
;
8212 if (token_type
== CPP_EOF
)
8213 message
= catenate_messages (gmsgid
, " at end of input");
8214 else if (token_type
== CPP_CHAR
8215 || token_type
== CPP_WCHAR
8216 || token_type
== CPP_CHAR16
8217 || token_type
== CPP_CHAR32
)
8219 unsigned int val
= TREE_INT_CST_LOW (value
);
8238 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
8239 message
= catenate_messages (gmsgid
, " before %s'%c'");
8241 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
8243 error (message
, prefix
, val
);
8247 else if (token_type
== CPP_STRING
8248 || token_type
== CPP_WSTRING
8249 || token_type
== CPP_STRING16
8250 || token_type
== CPP_STRING32
8251 || token_type
== CPP_UTF8STRING
)
8252 message
= catenate_messages (gmsgid
, " before string constant");
8253 else if (token_type
== CPP_NUMBER
)
8254 message
= catenate_messages (gmsgid
, " before numeric constant");
8255 else if (token_type
== CPP_NAME
)
8257 message
= catenate_messages (gmsgid
, " before %qE");
8258 error (message
, value
);
8262 else if (token_type
== CPP_PRAGMA
)
8263 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
8264 else if (token_type
== CPP_PRAGMA_EOL
)
8265 message
= catenate_messages (gmsgid
, " before end of line");
8266 else if (token_type
< N_TTYPES
)
8268 message
= catenate_messages (gmsgid
, " before %qs token");
8269 error (message
, cpp_type2name (token_type
, token_flags
));
8281 #undef catenate_messages
8284 /* Mapping for cpp message reasons to the options that enable them. */
8286 struct reason_option_codes_t
8288 const int reason
; /* cpplib message reason. */
8289 const int option_code
; /* gcc option that controls this message. */
8292 static const struct reason_option_codes_t option_codes
[] = {
8293 {CPP_W_DEPRECATED
, OPT_Wdeprecated
},
8294 {CPP_W_COMMENTS
, OPT_Wcomments
},
8295 {CPP_W_TRIGRAPHS
, OPT_Wtrigraphs
},
8296 {CPP_W_MULTICHAR
, OPT_Wmultichar
},
8297 {CPP_W_TRADITIONAL
, OPT_Wtraditional
},
8298 {CPP_W_LONG_LONG
, OPT_Wlong_long
},
8299 {CPP_W_ENDIF_LABELS
, OPT_Wendif_labels
},
8300 {CPP_W_VARIADIC_MACROS
, OPT_Wvariadic_macros
},
8301 {CPP_W_BUILTIN_MACRO_REDEFINED
, OPT_Wbuiltin_macro_redefined
},
8302 {CPP_W_UNDEF
, OPT_Wundef
},
8303 {CPP_W_UNUSED_MACROS
, OPT_Wunused_macros
},
8304 {CPP_W_CXX_OPERATOR_NAMES
, OPT_Wc___compat
},
8305 {CPP_W_NORMALIZE
, OPT_Wnormalized_
},
8306 {CPP_W_INVALID_PCH
, OPT_Winvalid_pch
},
8307 {CPP_W_WARNING_DIRECTIVE
, OPT_Wcpp
},
8311 /* Return the gcc option code associated with the reason for a cpp
8312 message, or 0 if none. */
8315 c_option_controlling_cpp_error (int reason
)
8317 const struct reason_option_codes_t
*entry
;
8319 for (entry
= option_codes
; entry
->reason
!= CPP_W_NONE
; entry
++)
8321 if (entry
->reason
== reason
)
8322 return entry
->option_code
;
8327 /* Callback from cpp_error for PFILE to print diagnostics from the
8328 preprocessor. The diagnostic is of type LEVEL, with REASON set
8329 to the reason code if LEVEL is represents a warning, at location
8330 LOCATION unless this is after lexing and the compiler's location
8331 should be used instead, with column number possibly overridden by
8332 COLUMN_OVERRIDE if not zero; MSG is the translated message and AP
8333 the arguments. Returns true if a diagnostic was emitted, false
8337 c_cpp_error (cpp_reader
*pfile ATTRIBUTE_UNUSED
, int level
, int reason
,
8338 location_t location
, unsigned int column_override
,
8339 const char *msg
, va_list *ap
)
8341 diagnostic_info diagnostic
;
8342 diagnostic_t dlevel
;
8343 int save_warn_system_headers
= warn_system_headers
;
8348 case CPP_DL_WARNING_SYSHDR
:
8351 warn_system_headers
= 1;
8353 case CPP_DL_WARNING
:
8356 dlevel
= DK_WARNING
;
8358 case CPP_DL_PEDWARN
:
8359 if (flag_no_output
&& !flag_pedantic_errors
)
8361 dlevel
= DK_PEDWARN
;
8379 location
= input_location
;
8380 diagnostic_set_info_translated (&diagnostic
, msg
, ap
,
8382 if (column_override
)
8383 diagnostic_override_column (&diagnostic
, column_override
);
8384 diagnostic_override_option_index (&diagnostic
,
8385 c_option_controlling_cpp_error (reason
));
8386 ret
= report_diagnostic (&diagnostic
);
8387 if (level
== CPP_DL_WARNING_SYSHDR
)
8388 warn_system_headers
= save_warn_system_headers
;
8392 /* Convert a character from the host to the target execution character
8393 set. cpplib handles this, mostly. */
8396 c_common_to_target_charset (HOST_WIDE_INT c
)
8398 /* Character constants in GCC proper are sign-extended under -fsigned-char,
8399 zero-extended under -fno-signed-char. cpplib insists that characters
8400 and character constants are always unsigned. Hence we must convert
8402 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
8404 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
8406 if (flag_signed_char
)
8407 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
8408 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
8413 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
8414 component references, with STOP_REF, or alternatively an INDIRECT_REF of
8415 NULL, at the bottom; much like the traditional rendering of offsetof as a
8416 macro. Returns the folded and properly cast result. */
8419 fold_offsetof_1 (tree expr
, tree stop_ref
)
8421 enum tree_code code
= PLUS_EXPR
;
8424 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
8425 return size_zero_node
;
8427 switch (TREE_CODE (expr
))
8433 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
8434 return error_mark_node
;
8438 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
8439 return error_mark_node
;
8443 if (!integer_zerop (TREE_OPERAND (expr
, 0)))
8445 error ("cannot apply %<offsetof%> to a non constant address");
8446 return error_mark_node
;
8448 return size_zero_node
;
8451 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
8452 if (base
== error_mark_node
)
8455 t
= TREE_OPERAND (expr
, 1);
8456 if (DECL_C_BIT_FIELD (t
))
8458 error ("attempt to take address of bit-field structure "
8460 return error_mark_node
;
8462 off
= size_binop_loc (input_location
, PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
8463 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
),
8469 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
8470 if (base
== error_mark_node
)
8473 t
= TREE_OPERAND (expr
, 1);
8474 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
8477 t
= fold_build1_loc (input_location
, NEGATE_EXPR
, TREE_TYPE (t
), t
);
8479 t
= convert (sizetype
, t
);
8480 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
8482 /* Check if the offset goes beyond the upper bound of the array. */
8483 if (code
== PLUS_EXPR
&& TREE_CODE (t
) == INTEGER_CST
)
8485 tree upbound
= array_ref_up_bound (expr
);
8486 if (upbound
!= NULL_TREE
8487 && TREE_CODE (upbound
) == INTEGER_CST
8488 && !tree_int_cst_equal (upbound
,
8489 TYPE_MAX_VALUE (TREE_TYPE (upbound
))))
8491 upbound
= size_binop (PLUS_EXPR
, upbound
,
8492 build_int_cst (TREE_TYPE (upbound
), 1));
8493 if (tree_int_cst_lt (upbound
, t
))
8497 for (v
= TREE_OPERAND (expr
, 0);
8498 TREE_CODE (v
) == COMPONENT_REF
;
8499 v
= TREE_OPERAND (v
, 0))
8500 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (v
, 0)))
8503 tree fld_chain
= TREE_CHAIN (TREE_OPERAND (v
, 1));
8504 for (; fld_chain
; fld_chain
= TREE_CHAIN (fld_chain
))
8505 if (TREE_CODE (fld_chain
) == FIELD_DECL
)
8511 /* Don't warn if the array might be considered a poor
8512 man's flexible array member with a very permissive
8513 definition thereof. */
8514 if (TREE_CODE (v
) == ARRAY_REF
8515 || TREE_CODE (v
) == COMPONENT_REF
)
8516 warning (OPT_Warray_bounds
,
8517 "index %E denotes an offset "
8518 "greater than size of %qT",
8519 t
, TREE_TYPE (TREE_OPERAND (expr
, 0)));
8526 /* Handle static members of volatile structs. */
8527 t
= TREE_OPERAND (expr
, 1);
8528 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
8529 return fold_offsetof_1 (t
, stop_ref
);
8535 return size_binop (code
, base
, off
);
8539 fold_offsetof (tree expr
, tree stop_ref
)
8541 /* Convert back from the internal sizetype to size_t. */
8542 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
8545 /* Print an error message for an invalid lvalue. USE says
8546 how the lvalue is being used and so selects the error message. */
8549 lvalue_error (enum lvalue_use use
)
8554 error ("lvalue required as left operand of assignment");
8557 error ("lvalue required as increment operand");
8560 error ("lvalue required as decrement operand");
8563 error ("lvalue required as unary %<&%> operand");
8566 error ("lvalue required in asm statement");
8573 /* *PTYPE is an incomplete array. Complete it with a domain based on
8574 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
8575 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8576 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
8579 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
8581 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
8582 int failure
= 0, quals
;
8583 hashval_t hashcode
= 0;
8585 maxindex
= size_zero_node
;
8588 if (TREE_CODE (initial_value
) == STRING_CST
)
8591 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8592 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
8594 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8596 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
8598 if (VEC_empty (constructor_elt
, v
))
8602 maxindex
= integer_minus_one_node
;
8607 unsigned HOST_WIDE_INT cnt
;
8608 constructor_elt
*ce
;
8609 bool fold_p
= false;
8611 if (VEC_index (constructor_elt
, v
, 0)->index
)
8612 maxindex
= fold_convert_loc (input_location
, sizetype
,
8613 VEC_index (constructor_elt
,
8615 curindex
= maxindex
;
8618 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
8621 bool curfold_p
= false;
8623 curindex
= ce
->index
, curfold_p
= true;
8627 curindex
= fold_convert (sizetype
, curindex
);
8628 curindex
= size_binop (PLUS_EXPR
, curindex
,
8631 if (tree_int_cst_lt (maxindex
, curindex
))
8632 maxindex
= curindex
, fold_p
= curfold_p
;
8635 maxindex
= fold_convert (sizetype
, maxindex
);
8640 /* Make an error message unless that happened already. */
8641 if (initial_value
!= error_mark_node
)
8653 elt
= TREE_TYPE (type
);
8654 quals
= TYPE_QUALS (strip_array_types (elt
));
8658 unqual_elt
= c_build_qualified_type (elt
, KEEP_QUAL_ADDR_SPACE (quals
));
8660 /* Using build_distinct_type_copy and modifying things afterward instead
8661 of using build_array_type to create a new type preserves all of the
8662 TYPE_LANG_FLAG_? bits that the front end may have set. */
8663 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
8664 TREE_TYPE (main_type
) = unqual_elt
;
8665 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
8666 layout_type (main_type
);
8668 /* Make sure we have the canonical MAIN_TYPE. */
8669 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
8670 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
8672 main_type
= type_hash_canon (hashcode
, main_type
);
8674 /* Fix the canonical type. */
8675 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
8676 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
8677 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
8678 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
8679 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
8680 != TYPE_DOMAIN (main_type
)))
8681 TYPE_CANONICAL (main_type
)
8682 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
8683 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
8685 TYPE_CANONICAL (main_type
) = main_type
;
8690 type
= c_build_qualified_type (main_type
, quals
);
8692 if (COMPLETE_TYPE_P (type
)
8693 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
8694 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type
)))
8696 error ("size of array is too large");
8697 /* If we proceed with the array type as it is, we'll eventually
8698 crash in tree_low_cst(). */
8699 type
= error_mark_node
;
8707 /* Used to help initialize the builtin-types.def table. When a type of
8708 the correct size doesn't exist, use error_mark_node instead of NULL.
8709 The later results in segfaults even when a decl using the type doesn't
8713 builtin_type_for_size (int size
, bool unsignedp
)
8715 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
8716 return type
? type
: error_mark_node
;
8719 /* A helper function for resolve_overloaded_builtin in resolving the
8720 overloaded __sync_ builtins. Returns a positive power of 2 if the
8721 first operand of PARAMS is a pointer to a supported data type.
8722 Returns 0 if an error is encountered. */
8725 sync_resolve_size (tree function
, VEC(tree
,gc
) *params
)
8730 if (VEC_empty (tree
, params
))
8732 error ("too few arguments to function %qE", function
);
8736 type
= TREE_TYPE (VEC_index (tree
, params
, 0));
8737 if (TREE_CODE (type
) != POINTER_TYPE
)
8740 type
= TREE_TYPE (type
);
8741 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
8744 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
8745 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
8749 error ("incompatible type for argument %d of %qE", 1, function
);
8753 /* A helper function for resolve_overloaded_builtin. Adds casts to
8754 PARAMS to make arguments match up with those of FUNCTION. Drops
8755 the variadic arguments at the end. Returns false if some error
8756 was encountered; true on success. */
8759 sync_resolve_params (tree orig_function
, tree function
, VEC(tree
, gc
) *params
)
8761 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
8764 unsigned int parmnum
;
8766 /* We've declared the implementation functions to use "volatile void *"
8767 as the pointer parameter, so we shouldn't get any complaints from the
8768 call to check_function_arguments what ever type the user used. */
8769 arg_types
= TREE_CHAIN (arg_types
);
8770 ptype
= TREE_TYPE (TREE_TYPE (VEC_index (tree
, params
, 0)));
8773 /* For the rest of the values, we need to cast these to FTYPE, so that we
8774 don't get warnings for passing pointer types, etc. */
8776 while (arg_types
!= void_list_node
)
8781 if (VEC_length (tree
, params
) <= parmnum
)
8783 error ("too few arguments to function %qE", orig_function
);
8787 /* ??? Ideally for the first conversion we'd use convert_for_assignment
8788 so that we get warnings for anything that doesn't match the pointer
8789 type. This isn't portable across the C and C++ front ends atm. */
8790 val
= VEC_index (tree
, params
, parmnum
);
8791 val
= convert (ptype
, val
);
8792 val
= convert (TREE_VALUE (arg_types
), val
);
8793 VEC_replace (tree
, params
, parmnum
, val
);
8795 arg_types
= TREE_CHAIN (arg_types
);
8799 /* The definition of these primitives is variadic, with the remaining
8800 being "an optional list of variables protected by the memory barrier".
8801 No clue what that's supposed to mean, precisely, but we consider all
8802 call-clobbered variables to be protected so we're safe. */
8803 VEC_truncate (tree
, params
, parmnum
+ 1);
8808 /* A helper function for resolve_overloaded_builtin. Adds a cast to
8809 RESULT to make it match the type of the first pointer argument in
8813 sync_resolve_return (tree first_param
, tree result
)
8815 tree ptype
= TREE_TYPE (TREE_TYPE (first_param
));
8816 ptype
= TYPE_MAIN_VARIANT (ptype
);
8817 return convert (ptype
, result
);
8820 /* Some builtin functions are placeholders for other expressions. This
8821 function should be called immediately after parsing the call expression
8822 before surrounding code has committed to the type of the expression.
8824 LOC is the location of the builtin call.
8826 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
8827 PARAMS is the argument list for the call. The return value is non-null
8828 when expansion is complete, and null if normal processing should
8832 resolve_overloaded_builtin (location_t loc
, tree function
, VEC(tree
,gc
) *params
)
8834 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
8835 switch (DECL_BUILT_IN_CLASS (function
))
8837 case BUILT_IN_NORMAL
:
8840 if (targetm
.resolve_overloaded_builtin
)
8841 return targetm
.resolve_overloaded_builtin (loc
, function
, params
);
8848 /* Handle BUILT_IN_NORMAL here. */
8851 case BUILT_IN_FETCH_AND_ADD_N
:
8852 case BUILT_IN_FETCH_AND_SUB_N
:
8853 case BUILT_IN_FETCH_AND_OR_N
:
8854 case BUILT_IN_FETCH_AND_AND_N
:
8855 case BUILT_IN_FETCH_AND_XOR_N
:
8856 case BUILT_IN_FETCH_AND_NAND_N
:
8857 case BUILT_IN_ADD_AND_FETCH_N
:
8858 case BUILT_IN_SUB_AND_FETCH_N
:
8859 case BUILT_IN_OR_AND_FETCH_N
:
8860 case BUILT_IN_AND_AND_FETCH_N
:
8861 case BUILT_IN_XOR_AND_FETCH_N
:
8862 case BUILT_IN_NAND_AND_FETCH_N
:
8863 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
8864 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
8865 case BUILT_IN_LOCK_TEST_AND_SET_N
:
8866 case BUILT_IN_LOCK_RELEASE_N
:
8868 int n
= sync_resolve_size (function
, params
);
8869 tree new_function
, first_param
, result
;
8872 return error_mark_node
;
8874 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
8875 if (!sync_resolve_params (function
, new_function
, params
))
8876 return error_mark_node
;
8878 first_param
= VEC_index (tree
, params
, 0);
8879 result
= build_function_call_vec (loc
, new_function
, params
, NULL
);
8880 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
8881 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
8882 result
= sync_resolve_return (first_param
, result
);
8892 /* Ignoring their sign, return true if two scalar types are the same. */
8894 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
8896 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
8898 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
8899 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
8900 || c2
== FIXED_POINT_TYPE
));
8902 /* Equality works here because c_common_signed_type uses
8903 TYPE_MAIN_VARIANT. */
8904 return c_common_signed_type (t1
)
8905 == c_common_signed_type (t2
);
8908 /* Check for missing format attributes on function pointers. LTYPE is
8909 the new type or left-hand side type. RTYPE is the old type or
8910 right-hand side type. Returns TRUE if LTYPE is missing the desired
8914 check_missing_format_attribute (tree ltype
, tree rtype
)
8916 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
8919 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
8920 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
8925 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
8926 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
8934 /* Subscripting with type char is likely to lose on a machine where
8935 chars are signed. So warn on any machine, but optionally. Don't
8936 warn for unsigned char since that type is safe. Don't warn for
8937 signed char because anyone who uses that must have done so
8938 deliberately. Furthermore, we reduce the false positive load by
8939 warning only for non-constant value of type char. */
8942 warn_array_subscript_with_type_char (tree index
)
8944 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
8945 && TREE_CODE (index
) != INTEGER_CST
)
8946 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
8949 /* Implement -Wparentheses for the unexpected C precedence rules, to
8950 cover cases like x + y << z which readers are likely to
8951 misinterpret. We have seen an expression in which CODE is a binary
8952 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
8953 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
8954 CODE_RIGHT may be ERROR_MARK, which means that that side of the
8955 expression was not formed using a binary or unary operator, or it
8956 was enclosed in parentheses. */
8959 warn_about_parentheses (enum tree_code code
,
8960 enum tree_code code_left
, tree arg_left
,
8961 enum tree_code code_right
, tree arg_right
)
8963 if (!warn_parentheses
)
8966 /* This macro tests that the expression ARG with original tree code
8967 CODE appears to be a boolean expression. or the result of folding a
8968 boolean expression. */
8969 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
8970 (truth_value_p (TREE_CODE (ARG)) \
8971 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
8972 /* Folding may create 0 or 1 integers from other expressions. */ \
8973 || ((CODE) != INTEGER_CST \
8974 && (integer_onep (ARG) || integer_zerop (ARG))))
8979 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8980 warning (OPT_Wparentheses
,
8981 "suggest parentheses around %<+%> inside %<<<%>");
8982 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8983 warning (OPT_Wparentheses
,
8984 "suggest parentheses around %<-%> inside %<<<%>");
8988 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8989 warning (OPT_Wparentheses
,
8990 "suggest parentheses around %<+%> inside %<>>%>");
8991 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8992 warning (OPT_Wparentheses
,
8993 "suggest parentheses around %<-%> inside %<>>%>");
8996 case TRUTH_ORIF_EXPR
:
8997 if (code_left
== TRUTH_ANDIF_EXPR
|| code_right
== TRUTH_ANDIF_EXPR
)
8998 warning (OPT_Wparentheses
,
8999 "suggest parentheses around %<&&%> within %<||%>");
9003 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
9004 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
9005 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
9006 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
9007 warning (OPT_Wparentheses
,
9008 "suggest parentheses around arithmetic in operand of %<|%>");
9009 /* Check cases like x|y==z */
9010 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9011 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9012 warning (OPT_Wparentheses
,
9013 "suggest parentheses around comparison in operand of %<|%>");
9014 /* Check cases like !x | y */
9015 else if (code_left
== TRUTH_NOT_EXPR
9016 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
9017 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
9018 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
9022 if (code_left
== BIT_AND_EXPR
9023 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
9024 || code_right
== BIT_AND_EXPR
9025 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
9026 warning (OPT_Wparentheses
,
9027 "suggest parentheses around arithmetic in operand of %<^%>");
9028 /* Check cases like x^y==z */
9029 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9030 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9031 warning (OPT_Wparentheses
,
9032 "suggest parentheses around comparison in operand of %<^%>");
9036 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
9037 warning (OPT_Wparentheses
,
9038 "suggest parentheses around %<+%> in operand of %<&%>");
9039 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
9040 warning (OPT_Wparentheses
,
9041 "suggest parentheses around %<-%> in operand of %<&%>");
9042 /* Check cases like x&y==z */
9043 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9044 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9045 warning (OPT_Wparentheses
,
9046 "suggest parentheses around comparison in operand of %<&%>");
9047 /* Check cases like !x & y */
9048 else if (code_left
== TRUTH_NOT_EXPR
9049 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
9050 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
9051 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
9055 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9056 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9057 warning (OPT_Wparentheses
,
9058 "suggest parentheses around comparison in operand of %<==%>");
9061 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
9062 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
9063 warning (OPT_Wparentheses
,
9064 "suggest parentheses around comparison in operand of %<!=%>");
9068 if (TREE_CODE_CLASS (code
) == tcc_comparison
9069 && ((TREE_CODE_CLASS (code_left
) == tcc_comparison
9070 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
9071 && INTEGRAL_TYPE_P (TREE_TYPE (arg_left
)))
9072 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
9073 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
9074 && INTEGRAL_TYPE_P (TREE_TYPE (arg_right
)))))
9075 warning (OPT_Wparentheses
, "comparisons like %<X<=Y<=Z%> do not "
9076 "have their mathematical meaning");
9079 #undef NOT_A_BOOLEAN_EXPR_P
9082 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
9085 warn_for_unused_label (tree label
)
9087 if (!TREE_USED (label
))
9089 if (DECL_INITIAL (label
))
9090 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
9092 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
9096 #ifndef TARGET_HAS_TARGETCM
9097 struct gcc_targetcm targetcm
= TARGETCM_INITIALIZER
;
9100 /* Warn for division by zero according to the value of DIVISOR. LOC
9101 is the location of the division operator. */
9104 warn_for_div_by_zero (location_t loc
, tree divisor
)
9106 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
9107 about division by zero. Do not issue a warning if DIVISOR has a
9108 floating-point type, since we consider 0.0/0.0 a valid way of
9109 generating a NaN. */
9110 if (c_inhibit_evaluation_warnings
== 0
9111 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
9112 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
9115 /* Subroutine of build_binary_op. Give warnings for comparisons
9116 between signed and unsigned quantities that may fail. Do the
9117 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
9118 so that casts will be considered, but default promotions won't
9121 LOCATION is the location of the comparison operator.
9123 The arguments of this function map directly to local variables
9124 of build_binary_op. */
9127 warn_for_sign_compare (location_t location
,
9128 tree orig_op0
, tree orig_op1
,
9130 tree result_type
, enum tree_code resultcode
)
9132 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
9133 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
9134 int unsignedp0
, unsignedp1
;
9136 /* In C++, check for comparison of different enum types. */
9138 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
9139 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
9140 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
9141 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
9143 warning_at (location
,
9144 OPT_Wsign_compare
, "comparison between types %qT and %qT",
9145 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
9148 /* Do not warn if the comparison is being done in a signed type,
9149 since the signed type will only be chosen if it can represent
9150 all the values of the unsigned type. */
9151 if (!TYPE_UNSIGNED (result_type
))
9153 /* Do not warn if both operands are unsigned. */
9154 else if (op0_signed
== op1_signed
)
9158 tree sop
, uop
, base_type
;
9162 sop
= orig_op0
, uop
= orig_op1
;
9164 sop
= orig_op1
, uop
= orig_op0
;
9166 STRIP_TYPE_NOPS (sop
);
9167 STRIP_TYPE_NOPS (uop
);
9168 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
9169 ? TREE_TYPE (result_type
) : result_type
);
9171 /* Do not warn if the signed quantity is an unsuffixed integer
9172 literal (or some static constant expression involving such
9173 literals or a conditional expression involving such literals)
9174 and it is non-negative. */
9175 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
9177 /* Do not warn if the comparison is an equality operation, the
9178 unsigned quantity is an integral constant, and it would fit
9179 in the result if the result were signed. */
9180 else if (TREE_CODE (uop
) == INTEGER_CST
9181 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
9182 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
9184 /* In C, do not warn if the unsigned quantity is an enumeration
9185 constant and its maximum value would fit in the result if the
9186 result were signed. */
9187 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
9188 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
9189 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
9190 c_common_signed_type (base_type
)))
9193 warning_at (location
,
9195 "comparison between signed and unsigned integer expressions");
9198 /* Warn if two unsigned values are being compared in a size larger
9199 than their original size, and one (and only one) is the result of
9200 a `~' operator. This comparison will always fail.
9202 Also warn if one operand is a constant, and the constant does not
9203 have all bits set that are set in the ~ operand when it is
9206 op0
= get_narrower (op0
, &unsignedp0
);
9207 op1
= get_narrower (op1
, &unsignedp1
);
9209 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
9210 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
9212 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
9213 op0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
9214 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
9215 op1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
9217 if (host_integerp (op0
, 0) || host_integerp (op1
, 0))
9220 HOST_WIDE_INT constant
, mask
;
9224 if (host_integerp (op0
, 0))
9227 unsignedp
= unsignedp1
;
9228 constant
= tree_low_cst (op0
, 0);
9233 unsignedp
= unsignedp0
;
9234 constant
= tree_low_cst (op1
, 0);
9237 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
9238 if (bits
< TYPE_PRECISION (result_type
)
9239 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
9241 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
9242 if ((mask
& constant
) != mask
)
9245 warning (OPT_Wsign_compare
,
9246 "promoted ~unsigned is always non-zero");
9248 warning_at (location
, OPT_Wsign_compare
,
9249 "comparison of promoted ~unsigned with constant");
9253 else if (unsignedp0
&& unsignedp1
9254 && (TYPE_PRECISION (TREE_TYPE (op0
))
9255 < TYPE_PRECISION (result_type
))
9256 && (TYPE_PRECISION (TREE_TYPE (op1
))
9257 < TYPE_PRECISION (result_type
)))
9258 warning_at (location
, OPT_Wsign_compare
,
9259 "comparison of promoted ~unsigned with unsigned");
9263 /* Setup a TYPE_DECL node as a typedef representation.
9265 X is a TYPE_DECL for a typedef statement. Create a brand new
9266 ..._TYPE node (which will be just a variant of the existing
9267 ..._TYPE node with identical properties) and then install X
9268 as the TYPE_NAME of this brand new (duplicate) ..._TYPE node.
9270 The whole point here is to end up with a situation where each
9271 and every ..._TYPE node the compiler creates will be uniquely
9272 associated with AT MOST one node representing a typedef name.
9273 This way, even though the compiler substitutes corresponding
9274 ..._TYPE nodes for TYPE_DECL (i.e. "typedef name") nodes very
9275 early on, later parts of the compiler can always do the reverse
9276 translation and get back the corresponding typedef name. For
9279 typedef struct S MY_TYPE;
9282 Later parts of the compiler might only know that `object' was of
9283 type `struct S' if it were not for code just below. With this
9284 code however, later parts of the compiler see something like:
9286 struct S' == struct S
9287 typedef struct S' MY_TYPE;
9290 And they can then deduce (from the node for type struct S') that
9291 the original object declaration was:
9295 Being able to do this is important for proper support of protoize,
9296 and also for generating precise symbolic debugging information
9297 which takes full account of the programmer's (typedef) vocabulary.
9299 Obviously, we don't want to generate a duplicate ..._TYPE node if
9300 the TYPE_DECL node that we are now processing really represents a
9301 standard built-in type. */
9304 set_underlying_type (tree x
)
9306 if (x
== error_mark_node
)
9308 if (DECL_IS_BUILTIN (x
))
9310 if (TYPE_NAME (TREE_TYPE (x
)) == 0)
9311 TYPE_NAME (TREE_TYPE (x
)) = x
;
9313 else if (TREE_TYPE (x
) != error_mark_node
9314 && DECL_ORIGINAL_TYPE (x
) == NULL_TREE
)
9316 tree tt
= TREE_TYPE (x
);
9317 DECL_ORIGINAL_TYPE (x
) = tt
;
9318 tt
= build_variant_type_copy (tt
);
9319 TYPE_STUB_DECL (tt
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
9321 TREE_USED (tt
) = TREE_USED (x
);
9326 /* Returns true if X is a typedef decl. */
9329 is_typedef_decl (tree x
)
9331 return (x
&& TREE_CODE (x
) == TYPE_DECL
9332 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
9335 /* Record the types used by the current global variable declaration
9336 being parsed, so that we can decide later to emit their debug info.
9337 Those types are in types_used_by_cur_var_decl, and we are going to
9338 store them in the types_used_by_vars_hash hash table.
9339 DECL is the declaration of the global variable that has been parsed. */
9342 record_types_used_by_current_var_decl (tree decl
)
9344 gcc_assert (decl
&& DECL_P (decl
) && TREE_STATIC (decl
));
9346 if (types_used_by_cur_var_decl
)
9349 for (node
= types_used_by_cur_var_decl
;
9351 node
= TREE_CHAIN (node
))
9353 tree type
= TREE_PURPOSE (node
);
9354 types_used_by_var_decl_insert (type
, decl
);
9356 types_used_by_cur_var_decl
= NULL
;
9360 /* The C and C++ parsers both use vectors to hold function arguments.
9361 For efficiency, we keep a cache of unused vectors. This is the
9364 typedef VEC(tree
,gc
)* tree_gc_vec
;
9365 DEF_VEC_P(tree_gc_vec
);
9366 DEF_VEC_ALLOC_P(tree_gc_vec
,gc
);
9367 static GTY((deletable
)) VEC(tree_gc_vec
,gc
) *tree_vector_cache
;
9369 /* Return a new vector from the cache. If the cache is empty,
9370 allocate a new vector. These vectors are GC'ed, so it is OK if the
9371 pointer is not released.. */
9374 make_tree_vector (void)
9376 if (!VEC_empty (tree_gc_vec
, tree_vector_cache
))
9377 return VEC_pop (tree_gc_vec
, tree_vector_cache
);
9380 /* Passing 0 to VEC_alloc returns NULL, and our callers require
9381 that we always return a non-NULL value. The vector code uses
9382 4 when growing a NULL vector, so we do too. */
9383 return VEC_alloc (tree
, gc
, 4);
9387 /* Release a vector of trees back to the cache. */
9390 release_tree_vector (VEC(tree
,gc
) *vec
)
9394 VEC_truncate (tree
, vec
, 0);
9395 VEC_safe_push (tree_gc_vec
, gc
, tree_vector_cache
, vec
);
9399 /* Get a new tree vector holding a single tree. */
9402 make_tree_vector_single (tree t
)
9404 VEC(tree
,gc
) *ret
= make_tree_vector ();
9405 VEC_quick_push (tree
, ret
, t
);
9409 /* Get a new tree vector which is a copy of an existing one. */
9412 make_tree_vector_copy (const VEC(tree
,gc
) *orig
)
9418 ret
= make_tree_vector ();
9419 VEC_reserve (tree
, gc
, ret
, VEC_length (tree
, orig
));
9420 for (ix
= 0; VEC_iterate (tree
, orig
, ix
, t
); ++ix
)
9421 VEC_quick_push (tree
, ret
, t
);
9425 #include "gt-c-common.h"