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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
35 #include "diagnostic.h"
40 #include "langhooks.h"
41 #include "tree-inline.h"
44 #include "tree-iterator.h"
46 #include "tree-mudflap.h"
50 #include "target-def.h"
52 #include "fixed-value.h"
54 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
56 /* We let tm.h override the types used here, to handle trivial differences
57 such as the choice of unsigned int or long unsigned int for size_t.
58 When machines start needing nontrivial differences in the size type,
59 it would be best to do something here to figure out automatically
60 from other information what type to use. */
63 #define SIZE_TYPE "long unsigned int"
67 #define PID_TYPE "int"
71 #define CHAR16_TYPE "short unsigned int"
75 #define CHAR32_TYPE "unsigned int"
79 #define WCHAR_TYPE "int"
82 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
83 #define MODIFIED_WCHAR_TYPE \
84 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
87 #define PTRDIFF_TYPE "long int"
91 #define WINT_TYPE "unsigned int"
95 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
97 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
103 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
105 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
106 ? "long unsigned int" \
107 : "long long unsigned int"))
110 /* The following symbols are subsumed in the c_global_trees array, and
111 listed here individually for documentation purposes.
113 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
115 tree short_integer_type_node;
116 tree long_integer_type_node;
117 tree long_long_integer_type_node;
119 tree short_unsigned_type_node;
120 tree long_unsigned_type_node;
121 tree long_long_unsigned_type_node;
123 tree truthvalue_type_node;
124 tree truthvalue_false_node;
125 tree truthvalue_true_node;
127 tree ptrdiff_type_node;
129 tree unsigned_char_type_node;
130 tree signed_char_type_node;
131 tree wchar_type_node;
132 tree signed_wchar_type_node;
133 tree unsigned_wchar_type_node;
135 tree char16_type_node;
136 tree char32_type_node;
138 tree float_type_node;
139 tree double_type_node;
140 tree long_double_type_node;
142 tree complex_integer_type_node;
143 tree complex_float_type_node;
144 tree complex_double_type_node;
145 tree complex_long_double_type_node;
147 tree dfloat32_type_node;
148 tree dfloat64_type_node;
149 tree_dfloat128_type_node;
151 tree intQI_type_node;
152 tree intHI_type_node;
153 tree intSI_type_node;
154 tree intDI_type_node;
155 tree intTI_type_node;
157 tree unsigned_intQI_type_node;
158 tree unsigned_intHI_type_node;
159 tree unsigned_intSI_type_node;
160 tree unsigned_intDI_type_node;
161 tree unsigned_intTI_type_node;
163 tree widest_integer_literal_type_node;
164 tree widest_unsigned_literal_type_node;
166 Nodes for types `void *' and `const void *'.
168 tree ptr_type_node, const_ptr_type_node;
170 Nodes for types `char *' and `const char *'.
172 tree string_type_node, const_string_type_node;
174 Type `char[SOMENUMBER]'.
175 Used when an array of char is needed and the size is irrelevant.
177 tree char_array_type_node;
179 Type `int[SOMENUMBER]' or something like it.
180 Used when an array of int needed and the size is irrelevant.
182 tree int_array_type_node;
184 Type `wchar_t[SOMENUMBER]' or something like it.
185 Used when a wide string literal is created.
187 tree wchar_array_type_node;
189 Type `char16_t[SOMENUMBER]' or something like it.
190 Used when a UTF-16 string literal is created.
192 tree char16_array_type_node;
194 Type `char32_t[SOMENUMBER]' or something like it.
195 Used when a UTF-32 string literal is created.
197 tree char32_array_type_node;
199 Type `int ()' -- used for implicit declaration of functions.
201 tree default_function_type;
203 A VOID_TYPE node, packaged in a TREE_LIST.
207 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
208 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
209 VAR_DECLS, but C++ does.)
211 tree function_name_decl_node;
212 tree pretty_function_name_decl_node;
213 tree c99_function_name_decl_node;
215 Stack of nested function name VAR_DECLs.
217 tree saved_function_name_decls;
221 tree c_global_trees
[CTI_MAX
];
223 /* Switches common to the C front ends. */
225 /* Nonzero if preprocessing only. */
227 int flag_preprocess_only
;
229 /* Nonzero means don't output line number information. */
231 char flag_no_line_commands
;
233 /* Nonzero causes -E output not to be done, but directives such as
234 #define that have side effects are still obeyed. */
238 /* Nonzero means dump macros in some fashion. */
240 char flag_dump_macros
;
242 /* Nonzero means pass #include lines through to the output. */
244 char flag_dump_includes
;
246 /* Nonzero means process PCH files while preprocessing. */
248 bool flag_pch_preprocess
;
250 /* The file name to which we should write a precompiled header, or
251 NULL if no header will be written in this compile. */
253 const char *pch_file
;
255 /* Nonzero if an ISO standard was selected. It rejects macros in the
259 /* Nonzero if -undef was given. It suppresses target built-in macros
263 /* Nonzero means don't recognize the non-ANSI builtin functions. */
267 /* Nonzero means don't recognize the non-ANSI builtin functions.
270 int flag_no_nonansi_builtin
;
272 /* Nonzero means give `double' the same size as `float'. */
274 int flag_short_double
;
276 /* Nonzero means give `wchar_t' the same size as `short'. */
278 int flag_short_wchar
;
280 /* Nonzero means allow implicit conversions between vectors with
281 differing numbers of subparts and/or differing element types. */
282 int flag_lax_vector_conversions
;
284 /* Nonzero means allow Microsoft extensions without warnings or errors. */
285 int flag_ms_extensions
;
287 /* Nonzero means don't recognize the keyword `asm'. */
291 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
293 int flag_signed_bitfields
= 1;
295 /* Warn about #pragma directives that are not recognized. */
297 int warn_unknown_pragmas
; /* Tri state variable. */
299 /* Warn about format/argument anomalies in calls to formatted I/O functions
300 (*printf, *scanf, strftime, strfmon, etc.). */
304 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
305 with GCC this doesn't matter as __null is guaranteed to have the right
308 int warn_strict_null_sentinel
;
310 /* Zero means that faster, ...NonNil variants of objc_msgSend...
311 calls will be used in ObjC; passing nil receivers to such calls
312 will most likely result in crashes. */
313 int flag_nil_receivers
= 1;
315 /* Nonzero means that code generation will be altered to support
316 "zero-link" execution. This currently affects ObjC only, but may
317 affect other languages in the future. */
318 int flag_zero_link
= 0;
320 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
321 unit. It will inform the ObjC runtime that class definition(s) herein
322 contained are to replace one(s) previously loaded. */
323 int flag_replace_objc_classes
= 0;
325 /* C/ObjC language option variables. */
328 /* Nonzero means allow type mismatches in conditional expressions;
329 just make their values `void'. */
331 int flag_cond_mismatch
;
333 /* Nonzero means enable C89 Amendment 1 features. */
337 /* Nonzero means use the ISO C99 dialect of C. */
341 /* Nonzero means that we have builtin functions, and main is an int. */
346 /* ObjC language option variables. */
349 /* Open and close the file for outputting class declarations, if
352 int flag_gen_declaration
;
354 /* Tells the compiler that this is a special run. Do not perform any
355 compiling, instead we are to test some platform dependent features
356 and output a C header file with appropriate definitions. */
358 int print_struct_values
;
360 /* Tells the compiler what is the constant string class for ObjC. */
362 const char *constant_string_class_name
;
365 /* C++ language option variables. */
368 /* Nonzero means don't recognize any extension keywords. */
370 int flag_no_gnu_keywords
;
372 /* Nonzero means do emit exported implementations of functions even if
373 they can be inlined. */
375 int flag_implement_inlines
= 1;
377 /* Nonzero means that implicit instantiations will be emitted if needed. */
379 int flag_implicit_templates
= 1;
381 /* Nonzero means that implicit instantiations of inline templates will be
382 emitted if needed, even if instantiations of non-inline templates
385 int flag_implicit_inline_templates
= 1;
387 /* Nonzero means generate separate instantiation control files and
388 juggle them at link time. */
390 int flag_use_repository
;
392 /* Nonzero if we want to issue diagnostics that the standard says are not
395 int flag_optional_diags
= 1;
397 /* Nonzero means we should attempt to elide constructors when possible. */
399 int flag_elide_constructors
= 1;
401 /* Nonzero means that member functions defined in class scope are
402 inline by default. */
404 int flag_default_inline
= 1;
406 /* Controls whether compiler generates 'type descriptor' that give
407 run-time type information. */
411 /* Nonzero if we want to conserve space in the .o files. We do this
412 by putting uninitialized data and runtime initialized data into
413 .common instead of .data at the expense of not flagging multiple
416 int flag_conserve_space
;
418 /* Nonzero if we want to obey access control semantics. */
420 int flag_access_control
= 1;
422 /* Nonzero if we want to check the return value of new and avoid calling
423 constructors if it is a null pointer. */
427 /* The C++ dialect being used. C++98 is the default. */
429 enum cxx_dialect cxx_dialect
= cxx98
;
431 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
432 initialization variables.
433 0: Old rules, set by -fno-for-scope.
434 2: New ISO rules, set by -ffor-scope.
435 1: Try to implement new ISO rules, but with backup compatibility
436 (and warnings). This is the default, for now. */
438 int flag_new_for_scope
= 1;
440 /* Nonzero if we want to emit defined symbols with common-like linkage as
441 weak symbols where possible, in order to conform to C++ semantics.
442 Otherwise, emit them as local symbols. */
446 /* 0 means we want the preprocessor to not emit line directives for
447 the current working directory. 1 means we want it to do it. -1
448 means we should decide depending on whether debugging information
449 is being emitted or not. */
451 int flag_working_directory
= -1;
453 /* Nonzero to use __cxa_atexit, rather than atexit, to register
454 destructors for local statics and global objects. '2' means it has been
455 set nonzero as a default, not by a command-line flag. */
457 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
459 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
460 code. '2' means it has not been set explicitly on the command line. */
462 int flag_use_cxa_get_exception_ptr
= 2;
464 /* Nonzero means to implement standard semantics for exception
465 specifications, calling unexpected if an exception is thrown that
466 doesn't match the specification. Zero means to treat them as
467 assertions and optimize accordingly, but not check them. */
469 int flag_enforce_eh_specs
= 1;
471 /* Nonzero means to generate thread-safe code for initializing local
474 int flag_threadsafe_statics
= 1;
476 /* Nonzero means warn about implicit declarations. */
478 int warn_implicit
= 1;
480 /* Maximum template instantiation depth. This limit is rather
481 arbitrary, but it exists to limit the time it takes to notice
482 infinite template instantiations. */
484 int max_tinst_depth
= 500;
488 /* The elements of `ridpointers' are identifier nodes for the reserved
489 type names and storage classes. It is indexed by a RID_... value. */
492 tree (*make_fname_decl
) (tree
, int);
494 /* Nonzero means the expression being parsed will never be evaluated.
495 This is a count, since unevaluated expressions can nest. */
498 /* Information about how a function name is generated. */
501 tree
*const decl
; /* pointer to the VAR_DECL. */
502 const unsigned rid
; /* RID number for the identifier. */
503 const int pretty
; /* How pretty is it? */
506 /* The three ways of getting then name of the current function. */
508 const struct fname_var_t fname_vars
[] =
510 /* C99 compliant __func__, must be first. */
511 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
512 /* GCC __FUNCTION__ compliant. */
513 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
514 /* GCC __PRETTY_FUNCTION__ compliant. */
515 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
519 static tree
check_case_value (tree
);
520 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
522 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
523 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
524 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
525 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
526 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
527 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
528 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
529 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
531 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int, bool *);
532 static tree
handle_artificial_attribute (tree
*, tree
, tree
, int, bool *);
533 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
534 static tree
handle_error_attribute (tree
*, tree
, tree
, int, bool *);
535 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
536 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
537 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
539 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
540 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
542 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
543 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
544 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
545 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
546 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
547 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
548 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
549 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
550 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
552 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
554 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
556 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
557 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
558 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
560 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
561 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
562 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
564 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
566 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
567 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
568 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
569 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
571 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
572 static tree
handle_type_generic_attribute (tree
*, tree
, tree
, int, bool *);
573 static tree
handle_alloc_size_attribute (tree
*, tree
, tree
, int, bool *);
574 static tree
handle_target_attribute (tree
*, tree
, tree
, int, bool *);
575 static tree
handle_optimize_attribute (tree
*, tree
, tree
, int, bool *);
577 static void check_function_nonnull (tree
, int, tree
*);
578 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
579 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
580 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
581 static int resort_field_decl_cmp (const void *, const void *);
583 /* Reserved words. The third field is a mask: keywords are disabled
584 if they match the mask.
587 C --std=c89: D_C99 | D_CXXONLY | D_OBJC | D_CXX_OBJC
588 C --std=c99: D_CXXONLY | D_OBJC
589 ObjC is like C except that D_OBJC and D_CXX_OBJC are not set
590 C++ --std=c98: D_CONLY | D_CXXOX | D_OBJC
591 C++ --std=c0x: D_CONLY | D_OBJC
592 ObjC++ is like C++ except that D_OBJC is not set
594 If -fno-asm is used, D_ASM is added to the mask. If
595 -fno-gnu-keywords is used, D_EXT is added. If -fno-asm and C in
596 C89 mode, D_EXT89 is added for both -fno-asm and -fno-gnu-keywords.
597 In C with -Wc++-compat, we warn if D_CXXWARN is set. */
599 const struct c_common_resword c_common_reswords
[] =
601 { "_Bool", RID_BOOL
, D_CONLY
},
602 { "_Complex", RID_COMPLEX
, 0 },
603 { "_Decimal32", RID_DFLOAT32
, D_CONLY
| D_EXT
},
604 { "_Decimal64", RID_DFLOAT64
, D_CONLY
| D_EXT
},
605 { "_Decimal128", RID_DFLOAT128
, D_CONLY
| D_EXT
},
606 { "_Fract", RID_FRACT
, D_CONLY
| D_EXT
},
607 { "_Accum", RID_ACCUM
, D_CONLY
| D_EXT
},
608 { "_Sat", RID_SAT
, D_CONLY
| D_EXT
},
609 { "__FUNCTION__", RID_FUNCTION_NAME
, 0 },
610 { "__PRETTY_FUNCTION__", RID_PRETTY_FUNCTION_NAME
, 0 },
611 { "__alignof", RID_ALIGNOF
, 0 },
612 { "__alignof__", RID_ALIGNOF
, 0 },
613 { "__asm", RID_ASM
, 0 },
614 { "__asm__", RID_ASM
, 0 },
615 { "__attribute", RID_ATTRIBUTE
, 0 },
616 { "__attribute__", RID_ATTRIBUTE
, 0 },
617 { "__builtin_choose_expr", RID_CHOOSE_EXPR
, D_CONLY
},
618 { "__builtin_offsetof", RID_OFFSETOF
, 0 },
619 { "__builtin_types_compatible_p", RID_TYPES_COMPATIBLE_P
, D_CONLY
},
620 { "__builtin_va_arg", RID_VA_ARG
, 0 },
621 { "__complex", RID_COMPLEX
, 0 },
622 { "__complex__", RID_COMPLEX
, 0 },
623 { "__const", RID_CONST
, 0 },
624 { "__const__", RID_CONST
, 0 },
625 { "__decltype", RID_DECLTYPE
, D_CXXONLY
},
626 { "__extension__", RID_EXTENSION
, 0 },
627 { "__func__", RID_C99_FUNCTION_NAME
, 0 },
628 { "__has_nothrow_assign", RID_HAS_NOTHROW_ASSIGN
, D_CXXONLY
},
629 { "__has_nothrow_constructor", RID_HAS_NOTHROW_CONSTRUCTOR
, D_CXXONLY
},
630 { "__has_nothrow_copy", RID_HAS_NOTHROW_COPY
, D_CXXONLY
},
631 { "__has_trivial_assign", RID_HAS_TRIVIAL_ASSIGN
, D_CXXONLY
},
632 { "__has_trivial_constructor", RID_HAS_TRIVIAL_CONSTRUCTOR
, D_CXXONLY
},
633 { "__has_trivial_copy", RID_HAS_TRIVIAL_COPY
, D_CXXONLY
},
634 { "__has_trivial_destructor", RID_HAS_TRIVIAL_DESTRUCTOR
, D_CXXONLY
},
635 { "__has_virtual_destructor", RID_HAS_VIRTUAL_DESTRUCTOR
, D_CXXONLY
},
636 { "__is_abstract", RID_IS_ABSTRACT
, D_CXXONLY
},
637 { "__is_base_of", RID_IS_BASE_OF
, D_CXXONLY
},
638 { "__is_class", RID_IS_CLASS
, D_CXXONLY
},
639 { "__is_convertible_to", RID_IS_CONVERTIBLE_TO
, D_CXXONLY
},
640 { "__is_empty", RID_IS_EMPTY
, D_CXXONLY
},
641 { "__is_enum", RID_IS_ENUM
, D_CXXONLY
},
642 { "__is_pod", RID_IS_POD
, D_CXXONLY
},
643 { "__is_polymorphic", RID_IS_POLYMORPHIC
, D_CXXONLY
},
644 { "__is_union", RID_IS_UNION
, D_CXXONLY
},
645 { "__imag", RID_IMAGPART
, 0 },
646 { "__imag__", RID_IMAGPART
, 0 },
647 { "__inline", RID_INLINE
, 0 },
648 { "__inline__", RID_INLINE
, 0 },
649 { "__label__", RID_LABEL
, 0 },
650 { "__null", RID_NULL
, 0 },
651 { "__real", RID_REALPART
, 0 },
652 { "__real__", RID_REALPART
, 0 },
653 { "__restrict", RID_RESTRICT
, 0 },
654 { "__restrict__", RID_RESTRICT
, 0 },
655 { "__signed", RID_SIGNED
, 0 },
656 { "__signed__", RID_SIGNED
, 0 },
657 { "__thread", RID_THREAD
, 0 },
658 { "__typeof", RID_TYPEOF
, 0 },
659 { "__typeof__", RID_TYPEOF
, 0 },
660 { "__volatile", RID_VOLATILE
, 0 },
661 { "__volatile__", RID_VOLATILE
, 0 },
662 { "asm", RID_ASM
, D_ASM
},
663 { "auto", RID_AUTO
, 0 },
664 { "bool", RID_BOOL
, D_CXXONLY
| D_CXXWARN
},
665 { "break", RID_BREAK
, 0 },
666 { "case", RID_CASE
, 0 },
667 { "catch", RID_CATCH
, D_CXX_OBJC
| D_CXXWARN
},
668 { "char", RID_CHAR
, 0 },
669 { "char16_t", RID_CHAR16
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
670 { "char32_t", RID_CHAR32
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
671 { "class", RID_CLASS
, D_CXX_OBJC
| D_CXXWARN
},
672 { "const", RID_CONST
, 0 },
673 { "const_cast", RID_CONSTCAST
, D_CXXONLY
| D_CXXWARN
},
674 { "continue", RID_CONTINUE
, 0 },
675 { "decltype", RID_DECLTYPE
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
676 { "default", RID_DEFAULT
, 0 },
677 { "delete", RID_DELETE
, D_CXXONLY
| D_CXXWARN
},
679 { "double", RID_DOUBLE
, 0 },
680 { "dynamic_cast", RID_DYNCAST
, D_CXXONLY
| D_CXXWARN
},
681 { "else", RID_ELSE
, 0 },
682 { "enum", RID_ENUM
, 0 },
683 { "explicit", RID_EXPLICIT
, D_CXXONLY
| D_CXXWARN
},
684 { "export", RID_EXPORT
, D_CXXONLY
| D_CXXWARN
},
685 { "extern", RID_EXTERN
, 0 },
686 { "false", RID_FALSE
, D_CXXONLY
| D_CXXWARN
},
687 { "float", RID_FLOAT
, 0 },
688 { "for", RID_FOR
, 0 },
689 { "friend", RID_FRIEND
, D_CXXONLY
| D_CXXWARN
},
690 { "goto", RID_GOTO
, 0 },
692 { "inline", RID_INLINE
, D_EXT89
},
693 { "int", RID_INT
, 0 },
694 { "long", RID_LONG
, 0 },
695 { "mutable", RID_MUTABLE
, D_CXXONLY
| D_CXXWARN
},
696 { "namespace", RID_NAMESPACE
, D_CXXONLY
| D_CXXWARN
},
697 { "new", RID_NEW
, D_CXXONLY
| D_CXXWARN
},
698 { "operator", RID_OPERATOR
, D_CXXONLY
| D_CXXWARN
},
699 { "private", RID_PRIVATE
, D_CXX_OBJC
| D_CXXWARN
},
700 { "protected", RID_PROTECTED
, D_CXX_OBJC
| D_CXXWARN
},
701 { "public", RID_PUBLIC
, D_CXX_OBJC
| D_CXXWARN
},
702 { "register", RID_REGISTER
, 0 },
703 { "reinterpret_cast", RID_REINTCAST
, D_CXXONLY
| D_CXXWARN
},
704 { "restrict", RID_RESTRICT
, D_CONLY
| D_C99
},
705 { "return", RID_RETURN
, 0 },
706 { "short", RID_SHORT
, 0 },
707 { "signed", RID_SIGNED
, 0 },
708 { "sizeof", RID_SIZEOF
, 0 },
709 { "static", RID_STATIC
, 0 },
710 { "static_assert", RID_STATIC_ASSERT
, D_CXXONLY
| D_CXX0X
| D_CXXWARN
},
711 { "static_cast", RID_STATCAST
, D_CXXONLY
| D_CXXWARN
},
712 { "struct", RID_STRUCT
, 0 },
713 { "switch", RID_SWITCH
, 0 },
714 { "template", RID_TEMPLATE
, D_CXXONLY
| D_CXXWARN
},
715 { "this", RID_THIS
, D_CXXONLY
| D_CXXWARN
},
716 { "throw", RID_THROW
, D_CXX_OBJC
| D_CXXWARN
},
717 { "true", RID_TRUE
, D_CXXONLY
| D_CXXWARN
},
718 { "try", RID_TRY
, D_CXX_OBJC
| D_CXXWARN
},
719 { "typedef", RID_TYPEDEF
, 0 },
720 { "typename", RID_TYPENAME
, D_CXXONLY
| D_CXXWARN
},
721 { "typeid", RID_TYPEID
, D_CXXONLY
| D_CXXWARN
},
722 { "typeof", RID_TYPEOF
, D_ASM
| D_EXT
},
723 { "union", RID_UNION
, 0 },
724 { "unsigned", RID_UNSIGNED
, 0 },
725 { "using", RID_USING
, D_CXXONLY
| D_CXXWARN
},
726 { "virtual", RID_VIRTUAL
, D_CXXONLY
| D_CXXWARN
},
727 { "void", RID_VOID
, 0 },
728 { "volatile", RID_VOLATILE
, 0 },
729 { "wchar_t", RID_WCHAR
, D_CXXONLY
},
730 { "while", RID_WHILE
, 0 },
731 /* These Objective-C keywords are recognized only immediately after
733 { "compatibility_alias", RID_AT_ALIAS
, D_OBJC
},
734 { "defs", RID_AT_DEFS
, D_OBJC
},
735 { "encode", RID_AT_ENCODE
, D_OBJC
},
736 { "end", RID_AT_END
, D_OBJC
},
737 { "implementation", RID_AT_IMPLEMENTATION
, D_OBJC
},
738 { "interface", RID_AT_INTERFACE
, D_OBJC
},
739 { "protocol", RID_AT_PROTOCOL
, D_OBJC
},
740 { "selector", RID_AT_SELECTOR
, D_OBJC
},
741 { "finally", RID_AT_FINALLY
, D_OBJC
},
742 { "synchronized", RID_AT_SYNCHRONIZED
, D_OBJC
},
743 /* These are recognized only in protocol-qualifier context
745 { "bycopy", RID_BYCOPY
, D_OBJC
},
746 { "byref", RID_BYREF
, D_OBJC
},
747 { "in", RID_IN
, D_OBJC
},
748 { "inout", RID_INOUT
, D_OBJC
},
749 { "oneway", RID_ONEWAY
, D_OBJC
},
750 { "out", RID_OUT
, D_OBJC
},
753 const unsigned int num_c_common_reswords
=
754 sizeof c_common_reswords
/ sizeof (struct c_common_resword
);
756 /* Table of machine-independent attributes common to all C-like languages. */
757 const struct attribute_spec c_common_attribute_table
[] =
759 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
760 { "packed", 0, 0, false, false, false,
761 handle_packed_attribute
},
762 { "nocommon", 0, 0, true, false, false,
763 handle_nocommon_attribute
},
764 { "common", 0, 0, true, false, false,
765 handle_common_attribute
},
766 /* FIXME: logically, noreturn attributes should be listed as
767 "false, true, true" and apply to function types. But implementing this
768 would require all the places in the compiler that use TREE_THIS_VOLATILE
769 on a decl to identify non-returning functions to be located and fixed
770 to check the function type instead. */
771 { "noreturn", 0, 0, true, false, false,
772 handle_noreturn_attribute
},
773 { "volatile", 0, 0, true, false, false,
774 handle_noreturn_attribute
},
775 { "noinline", 0, 0, true, false, false,
776 handle_noinline_attribute
},
777 { "always_inline", 0, 0, true, false, false,
778 handle_always_inline_attribute
},
779 { "gnu_inline", 0, 0, true, false, false,
780 handle_gnu_inline_attribute
},
781 { "artificial", 0, 0, true, false, false,
782 handle_artificial_attribute
},
783 { "flatten", 0, 0, true, false, false,
784 handle_flatten_attribute
},
785 { "used", 0, 0, true, false, false,
786 handle_used_attribute
},
787 { "unused", 0, 0, false, false, false,
788 handle_unused_attribute
},
789 { "externally_visible", 0, 0, true, false, false,
790 handle_externally_visible_attribute
},
791 /* The same comments as for noreturn attributes apply to const ones. */
792 { "const", 0, 0, true, false, false,
793 handle_const_attribute
},
794 { "transparent_union", 0, 0, false, false, false,
795 handle_transparent_union_attribute
},
796 { "constructor", 0, 1, true, false, false,
797 handle_constructor_attribute
},
798 { "destructor", 0, 1, true, false, false,
799 handle_destructor_attribute
},
800 { "mode", 1, 1, false, true, false,
801 handle_mode_attribute
},
802 { "section", 1, 1, true, false, false,
803 handle_section_attribute
},
804 { "aligned", 0, 1, false, false, false,
805 handle_aligned_attribute
},
806 { "weak", 0, 0, true, false, false,
807 handle_weak_attribute
},
808 { "alias", 1, 1, true, false, false,
809 handle_alias_attribute
},
810 { "weakref", 0, 1, true, false, false,
811 handle_weakref_attribute
},
812 { "no_instrument_function", 0, 0, true, false, false,
813 handle_no_instrument_function_attribute
},
814 { "malloc", 0, 0, true, false, false,
815 handle_malloc_attribute
},
816 { "returns_twice", 0, 0, true, false, false,
817 handle_returns_twice_attribute
},
818 { "no_stack_limit", 0, 0, true, false, false,
819 handle_no_limit_stack_attribute
},
820 { "pure", 0, 0, true, false, false,
821 handle_pure_attribute
},
822 /* For internal use (marking of builtins) only. The name contains space
823 to prevent its usage in source code. */
824 { "no vops", 0, 0, true, false, false,
825 handle_novops_attribute
},
826 { "deprecated", 0, 0, false, false, false,
827 handle_deprecated_attribute
},
828 { "vector_size", 1, 1, false, true, false,
829 handle_vector_size_attribute
},
830 { "visibility", 1, 1, false, false, false,
831 handle_visibility_attribute
},
832 { "tls_model", 1, 1, true, false, false,
833 handle_tls_model_attribute
},
834 { "nonnull", 0, -1, false, true, true,
835 handle_nonnull_attribute
},
836 { "nothrow", 0, 0, true, false, false,
837 handle_nothrow_attribute
},
838 { "may_alias", 0, 0, false, true, false, NULL
},
839 { "cleanup", 1, 1, true, false, false,
840 handle_cleanup_attribute
},
841 { "warn_unused_result", 0, 0, false, true, true,
842 handle_warn_unused_result_attribute
},
843 { "sentinel", 0, 1, false, true, true,
844 handle_sentinel_attribute
},
845 /* For internal use (marking of builtins) only. The name contains space
846 to prevent its usage in source code. */
847 { "type generic", 0, 0, false, true, true,
848 handle_type_generic_attribute
},
849 { "alloc_size", 1, 2, false, true, true,
850 handle_alloc_size_attribute
},
851 { "cold", 0, 0, true, false, false,
852 handle_cold_attribute
},
853 { "hot", 0, 0, true, false, false,
854 handle_hot_attribute
},
855 { "warning", 1, 1, true, false, false,
856 handle_error_attribute
},
857 { "error", 1, 1, true, false, false,
858 handle_error_attribute
},
859 { "target", 1, -1, true, false, false,
860 handle_target_attribute
},
861 { "optimize", 1, -1, true, false, false,
862 handle_optimize_attribute
},
863 { NULL
, 0, 0, false, false, false, NULL
}
866 /* Give the specifications for the format attributes, used by C and all
869 const struct attribute_spec c_common_format_attribute_table
[] =
871 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
872 { "format", 3, 3, false, true, true,
873 handle_format_attribute
},
874 { "format_arg", 1, 1, false, true, true,
875 handle_format_arg_attribute
},
876 { NULL
, 0, 0, false, false, false, NULL
}
879 /* Push current bindings for the function name VAR_DECLS. */
882 start_fname_decls (void)
885 tree saved
= NULL_TREE
;
887 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
889 tree decl
= *fname_vars
[ix
].decl
;
893 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
894 *fname_vars
[ix
].decl
= NULL_TREE
;
897 if (saved
|| saved_function_name_decls
)
898 /* Normally they'll have been NULL, so only push if we've got a
899 stack, or they are non-NULL. */
900 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
901 saved_function_name_decls
);
904 /* Finish up the current bindings, adding them into the current function's
905 statement tree. This must be done _before_ finish_stmt_tree is called.
906 If there is no current function, we must be at file scope and no statements
907 are involved. Pop the previous bindings. */
910 finish_fname_decls (void)
913 tree stmts
= NULL_TREE
;
914 tree stack
= saved_function_name_decls
;
916 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
917 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
921 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
923 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
924 bodyp
= &BIND_EXPR_BODY (*bodyp
);
926 append_to_statement_list_force (*bodyp
, &stmts
);
930 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
931 *fname_vars
[ix
].decl
= NULL_TREE
;
935 /* We had saved values, restore them. */
938 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
940 tree decl
= TREE_PURPOSE (saved
);
941 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
943 *fname_vars
[ix
].decl
= decl
;
945 stack
= TREE_CHAIN (stack
);
947 saved_function_name_decls
= stack
;
950 /* Return the text name of the current function, suitably prettified
951 by PRETTY_P. Return string must be freed by caller. */
954 fname_as_string (int pretty_p
)
956 const char *name
= "top level";
959 cpp_string cstr
= { 0, 0 }, strname
;
967 if (current_function_decl
)
968 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
970 len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
972 namep
= XNEWVEC (char, len
);
973 snprintf (namep
, len
, "\"%s\"", name
);
974 strname
.text
= (unsigned char *) namep
;
975 strname
.len
= len
- 1;
977 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, CPP_STRING
))
980 return (const char *) cstr
.text
;
986 /* Return the VAR_DECL for a const char array naming the current
987 function. If the VAR_DECL has not yet been created, create it
988 now. RID indicates how it should be formatted and IDENTIFIER_NODE
989 ID is its name (unfortunately C and C++ hold the RID values of
990 keywords in different places, so we can't derive RID from ID in
991 this language independent code. LOC is the location of the
995 fname_decl (location_t loc
, unsigned int rid
, tree id
)
998 tree decl
= NULL_TREE
;
1000 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1001 if (fname_vars
[ix
].rid
== rid
)
1004 decl
= *fname_vars
[ix
].decl
;
1007 /* If a tree is built here, it would normally have the lineno of
1008 the current statement. Later this tree will be moved to the
1009 beginning of the function and this line number will be wrong.
1010 To avoid this problem set the lineno to 0 here; that prevents
1011 it from appearing in the RTL. */
1013 location_t saved_location
= input_location
;
1014 input_location
= UNKNOWN_LOCATION
;
1016 stmts
= push_stmt_list ();
1017 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
1018 stmts
= pop_stmt_list (stmts
);
1019 if (!IS_EMPTY_STMT (stmts
))
1020 saved_function_name_decls
1021 = tree_cons (decl
, stmts
, saved_function_name_decls
);
1022 *fname_vars
[ix
].decl
= decl
;
1023 input_location
= saved_location
;
1025 if (!ix
&& !current_function_decl
)
1026 pedwarn (loc
, 0, "%qD is not defined outside of function scope", decl
);
1031 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1034 fix_string_type (tree value
)
1036 int length
= TREE_STRING_LENGTH (value
);
1038 tree e_type
, i_type
, a_type
;
1040 /* Compute the number of elements, for the array type. */
1041 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
1044 e_type
= char_type_node
;
1046 else if (TREE_TYPE (value
) == char16_array_type_node
)
1048 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
1049 e_type
= char16_type_node
;
1051 else if (TREE_TYPE (value
) == char32_array_type_node
)
1053 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
1054 e_type
= char32_type_node
;
1058 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
1059 e_type
= wchar_type_node
;
1062 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1063 limit in C++98 Annex B is very large (65536) and is not normative,
1064 so we do not diagnose it (warn_overlength_strings is forced off
1065 in c_common_post_options). */
1066 if (warn_overlength_strings
)
1068 const int nchars_max
= flag_isoc99
? 4095 : 509;
1069 const int relevant_std
= flag_isoc99
? 99 : 90;
1070 if (nchars
- 1 > nchars_max
)
1071 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1072 separate the %d from the 'C'. 'ISO' should not be
1073 translated, but it may be moved after 'C%d' in languages
1074 where modifiers follow nouns. */
1075 pedwarn (input_location
, OPT_Woverlength_strings
,
1076 "string length %qd is greater than the length %qd "
1077 "ISO C%d compilers are required to support",
1078 nchars
- 1, nchars_max
, relevant_std
);
1081 /* Create the array type for the string constant. The ISO C++
1082 standard says that a string literal has type `const char[N]' or
1083 `const wchar_t[N]'. We use the same logic when invoked as a C
1084 front-end with -Wwrite-strings.
1085 ??? We should change the type of an expression depending on the
1086 state of a warning flag. We should just be warning -- see how
1087 this is handled in the C++ front-end for the deprecated implicit
1088 conversion from string literals to `char*' or `wchar_t*'.
1090 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1091 array type being the unqualified version of that type.
1092 Therefore, if we are constructing an array of const char, we must
1093 construct the matching unqualified array type first. The C front
1094 end does not require this, but it does no harm, so we do it
1096 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
1097 a_type
= build_array_type (e_type
, i_type
);
1098 if (c_dialect_cxx() || warn_write_strings
)
1099 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
1101 TREE_TYPE (value
) = a_type
;
1102 TREE_CONSTANT (value
) = 1;
1103 TREE_READONLY (value
) = 1;
1104 TREE_STATIC (value
) = 1;
1108 /* Print a warning if a constant expression had overflow in folding.
1109 Invoke this function on every expression that the language
1110 requires to be a constant expression.
1111 Note the ANSI C standard says it is erroneous for a
1112 constant expression to overflow. */
1115 constant_expression_warning (tree value
)
1117 if (warn_overflow
&& pedantic
1118 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1119 || TREE_CODE (value
) == FIXED_CST
1120 || TREE_CODE (value
) == VECTOR_CST
1121 || TREE_CODE (value
) == COMPLEX_CST
)
1122 && TREE_OVERFLOW (value
))
1123 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1126 /* The same as above but print an unconditional error. */
1128 constant_expression_error (tree value
)
1130 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1131 || TREE_CODE (value
) == FIXED_CST
1132 || TREE_CODE (value
) == VECTOR_CST
1133 || TREE_CODE (value
) == COMPLEX_CST
)
1134 && TREE_OVERFLOW (value
))
1135 error ("overflow in constant expression");
1138 /* Print a warning if an expression had overflow in folding and its
1141 Invoke this function on every expression that
1142 (1) appears in the source code, and
1143 (2) is a constant expression that overflowed, and
1144 (3) is not already checked by convert_and_check;
1145 however, do not invoke this function on operands of explicit casts
1146 or when the expression is the result of an operator and any operand
1147 already overflowed. */
1150 overflow_warning (tree value
)
1152 if (skip_evaluation
) return;
1154 switch (TREE_CODE (value
))
1157 warning (OPT_Woverflow
, "integer overflow in expression");
1161 warning (OPT_Woverflow
, "floating point overflow in expression");
1165 warning (OPT_Woverflow
, "fixed-point overflow in expression");
1169 warning (OPT_Woverflow
, "vector overflow in expression");
1173 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1174 warning (OPT_Woverflow
, "complex integer overflow in expression");
1175 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1176 warning (OPT_Woverflow
, "complex floating point overflow in expression");
1185 /* Warn about use of a logical || / && operator being used in a
1186 context where it is likely that the bitwise equivalent was intended
1187 by the programmer. CODE is the TREE_CODE of the operator, ARG1
1188 and ARG2 the arguments. */
1191 warn_logical_operator (enum tree_code code
, tree arg1
, tree
1196 case TRUTH_ANDIF_EXPR
:
1197 case TRUTH_ORIF_EXPR
:
1199 case TRUTH_AND_EXPR
:
1200 if (!TREE_NO_WARNING (arg1
)
1201 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
1202 && !CONSTANT_CLASS_P (arg1
)
1203 && TREE_CODE (arg2
) == INTEGER_CST
1204 && !integer_zerop (arg2
))
1206 warning (OPT_Wlogical_op
,
1207 "logical %<%s%> with non-zero constant "
1208 "will always evaluate as true",
1209 ((code
== TRUTH_ANDIF_EXPR
)
1210 || (code
== TRUTH_AND_EXPR
)) ? "&&" : "||");
1211 TREE_NO_WARNING (arg1
) = true;
1220 /* Print a warning about casts that might indicate violation
1221 of strict aliasing rules if -Wstrict-aliasing is used and
1222 strict aliasing mode is in effect. OTYPE is the original
1223 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1226 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1228 if (!(flag_strict_aliasing
1229 && POINTER_TYPE_P (type
)
1230 && POINTER_TYPE_P (otype
)
1231 && !VOID_TYPE_P (TREE_TYPE (type
)))
1232 /* If the type we are casting to is a ref-all pointer
1233 dereferencing it is always valid. */
1234 || TYPE_REF_CAN_ALIAS_ALL (type
))
1237 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1238 && (DECL_P (TREE_OPERAND (expr
, 0))
1239 || handled_component_p (TREE_OPERAND (expr
, 0))))
1241 /* Casting the address of an object to non void pointer. Warn
1242 if the cast breaks type based aliasing. */
1243 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1245 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1246 "might break strict-aliasing rules");
1251 /* warn_strict_aliasing >= 3. This includes the default (3).
1252 Only warn if the cast is dereferenced immediately. */
1253 alias_set_type set1
=
1254 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1255 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1257 if (set1
!= set2
&& set2
!= 0
1258 && (set1
== 0 || !alias_sets_conflict_p (set1
, set2
)))
1260 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1261 "pointer will break strict-aliasing rules");
1264 else if (warn_strict_aliasing
== 2
1265 && !alias_sets_must_conflict_p (set1
, set2
))
1267 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1268 "pointer might break strict-aliasing rules");
1274 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1276 /* At this level, warn for any conversions, even if an address is
1277 not taken in the same statement. This will likely produce many
1278 false positives, but could be useful to pinpoint problems that
1279 are not revealed at higher levels. */
1280 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1281 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1282 if (!COMPLETE_TYPE_P (type
)
1283 || !alias_sets_must_conflict_p (set1
, set2
))
1285 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1286 "pointer might break strict-aliasing rules");
1294 /* Warn for unlikely, improbable, or stupid DECL declarations
1298 check_main_parameter_types (tree decl
)
1303 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1304 args
= TREE_CHAIN (args
))
1306 tree type
= args
? TREE_VALUE (args
) : 0;
1308 if (type
== void_type_node
|| type
== error_mark_node
)
1315 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1316 pedwarn (input_location
, OPT_Wmain
, "first argument of %q+D should be %<int%>",
1321 if (TREE_CODE (type
) != POINTER_TYPE
1322 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1323 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1325 pedwarn (input_location
, OPT_Wmain
, "second argument of %q+D should be %<char **%>",
1330 if (TREE_CODE (type
) != POINTER_TYPE
1331 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1332 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1334 pedwarn (input_location
, OPT_Wmain
, "third argument of %q+D should probably be "
1335 "%<char **%>", decl
);
1340 /* It is intentional that this message does not mention the third
1341 argument because it's only mentioned in an appendix of the
1343 if (argct
> 0 && (argct
< 2 || argct
> 3))
1344 pedwarn (input_location
, OPT_Wmain
, "%q+D takes only zero or two arguments", decl
);
1347 /* True if pointers to distinct types T1 and T2 can be converted to
1348 each other without an explicit cast. Only returns true for opaque
1351 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
1353 if (TREE_CODE (t1
) == VECTOR_TYPE
&& TREE_CODE (t2
) == VECTOR_TYPE
1354 && (targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1355 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1361 /* True if vector types T1 and T2 can be converted to each other
1362 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1363 can only be converted with -flax-vector-conversions yet that is not
1364 in effect, emit a note telling the user about that option if such
1365 a note has not previously been emitted. */
1367 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
1369 static bool emitted_lax_note
= false;
1370 bool convertible_lax
;
1372 if ((targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1373 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1377 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1378 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1379 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1380 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1381 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1383 if (!convertible_lax
|| flag_lax_vector_conversions
)
1384 return convertible_lax
;
1386 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1387 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1390 if (emit_lax_note
&& !emitted_lax_note
)
1392 emitted_lax_note
= true;
1393 inform (input_location
, "use -flax-vector-conversions to permit "
1394 "conversions between vectors with differing "
1395 "element types or numbers of subparts");
1401 /* This is a helper function of build_binary_op.
1403 For certain operations if both args were extended from the same
1404 smaller type, do the arithmetic in that type and then extend.
1406 BITWISE indicates a bitwise operation.
1407 For them, this optimization is safe only if
1408 both args are zero-extended or both are sign-extended.
1409 Otherwise, we might change the result.
1410 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1411 but calculated in (unsigned short) it would be (unsigned short)-1.
1413 tree
shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1415 int unsigned0
, unsigned1
;
1420 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1421 excessive narrowing when we call get_narrower below. For
1422 example, suppose that OP0 is of unsigned int extended
1423 from signed char and that RESULT_TYPE is long long int.
1424 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1427 (long long int) (unsigned int) signed_char
1429 which get_narrower would narrow down to
1431 (unsigned int) signed char
1433 If we do not cast OP0 first, get_narrower would return
1434 signed_char, which is inconsistent with the case of the
1436 op0
= convert (result_type
, op0
);
1437 op1
= convert (result_type
, op1
);
1439 arg0
= get_narrower (op0
, &unsigned0
);
1440 arg1
= get_narrower (op1
, &unsigned1
);
1442 /* UNS is 1 if the operation to be done is an unsigned one. */
1443 uns
= TYPE_UNSIGNED (result_type
);
1445 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1446 but it *requires* conversion to FINAL_TYPE. */
1448 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1449 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1450 && TREE_TYPE (op0
) != result_type
)
1451 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1452 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1453 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1454 && TREE_TYPE (op1
) != result_type
)
1455 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1457 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1459 /* For bitwise operations, signedness of nominal type
1460 does not matter. Consider only how operands were extended. */
1464 /* Note that in all three cases below we refrain from optimizing
1465 an unsigned operation on sign-extended args.
1466 That would not be valid. */
1468 /* Both args variable: if both extended in same way
1469 from same width, do it in that width.
1470 Do it unsigned if args were zero-extended. */
1471 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1472 < TYPE_PRECISION (result_type
))
1473 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1474 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1475 && unsigned0
== unsigned1
1476 && (unsigned0
|| !uns
))
1477 return c_common_signed_or_unsigned_type
1478 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1480 else if (TREE_CODE (arg0
) == INTEGER_CST
1481 && (unsigned1
|| !uns
)
1482 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1483 < TYPE_PRECISION (result_type
))
1485 = c_common_signed_or_unsigned_type (unsigned1
,
1487 && !POINTER_TYPE_P (type
)
1488 && int_fits_type_p (arg0
, type
))
1491 else if (TREE_CODE (arg1
) == INTEGER_CST
1492 && (unsigned0
|| !uns
)
1493 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1494 < TYPE_PRECISION (result_type
))
1496 = c_common_signed_or_unsigned_type (unsigned0
,
1498 && !POINTER_TYPE_P (type
)
1499 && int_fits_type_p (arg1
, type
))
1505 /* Warns if the conversion of EXPR to TYPE may alter a value.
1506 This is a helper function for warnings_for_convert_and_check. */
1509 conversion_warning (tree type
, tree expr
)
1511 bool give_warning
= false;
1514 const int expr_num_operands
= TREE_OPERAND_LENGTH (expr
);
1515 tree expr_type
= TREE_TYPE (expr
);
1517 if (!warn_conversion
&& !warn_sign_conversion
)
1520 /* If any operand is artificial, then this expression was generated
1521 by the compiler and we do not warn. */
1522 for (i
= 0; i
< expr_num_operands
; i
++)
1524 tree op
= TREE_OPERAND (expr
, i
);
1525 if (op
&& DECL_P (op
) && DECL_ARTIFICIAL (op
))
1529 switch (TREE_CODE (expr
))
1537 case TRUTH_ANDIF_EXPR
:
1538 case TRUTH_ORIF_EXPR
:
1539 case TRUTH_AND_EXPR
:
1541 case TRUTH_XOR_EXPR
:
1542 case TRUTH_NOT_EXPR
:
1543 /* Conversion from boolean to a signed:1 bit-field (which only
1544 can hold the values 0 and -1) doesn't lose information - but
1545 it does change the value. */
1546 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
1547 warning (OPT_Wconversion
,
1548 "conversion to %qT from boolean expression", type
);
1554 /* Warn for real constant that is not an exact integer converted
1556 if (TREE_CODE (expr_type
) == REAL_TYPE
1557 && TREE_CODE (type
) == INTEGER_TYPE
)
1559 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
1560 give_warning
= true;
1562 /* Warn for an integer constant that does not fit into integer type. */
1563 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1564 && TREE_CODE (type
) == INTEGER_TYPE
1565 && !int_fits_type_p (expr
, type
))
1567 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
1568 && tree_int_cst_sgn (expr
) < 0)
1569 warning (OPT_Wsign_conversion
,
1570 "negative integer implicitly converted to unsigned type");
1571 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
1572 warning (OPT_Wsign_conversion
, "conversion of unsigned constant "
1573 "value to negative integer");
1575 give_warning
= true;
1577 else if (TREE_CODE (type
) == REAL_TYPE
)
1579 /* Warn for an integer constant that does not fit into real type. */
1580 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
1582 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1583 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1584 give_warning
= true;
1586 /* Warn for a real constant that does not fit into a smaller
1588 else if (TREE_CODE (expr_type
) == REAL_TYPE
1589 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1591 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1592 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1593 give_warning
= true;
1598 warning (OPT_Wconversion
,
1599 "conversion to %qT alters %qT constant value",
1606 /* In case of COND_EXPR, if both operands are constants or
1607 COND_EXPR, then we do not care about the type of COND_EXPR,
1608 only about the conversion of each operand. */
1609 tree op1
= TREE_OPERAND (expr
, 1);
1610 tree op2
= TREE_OPERAND (expr
, 2);
1612 if ((TREE_CODE (op1
) == REAL_CST
|| TREE_CODE (op1
) == INTEGER_CST
1613 || TREE_CODE (op1
) == COND_EXPR
)
1614 && (TREE_CODE (op2
) == REAL_CST
|| TREE_CODE (op2
) == INTEGER_CST
1615 || TREE_CODE (op2
) == COND_EXPR
))
1617 conversion_warning (type
, op1
);
1618 conversion_warning (type
, op2
);
1624 default: /* 'expr' is not a constant. */
1626 /* Warn for real types converted to integer types. */
1627 if (TREE_CODE (expr_type
) == REAL_TYPE
1628 && TREE_CODE (type
) == INTEGER_TYPE
)
1629 give_warning
= true;
1631 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1632 && TREE_CODE (type
) == INTEGER_TYPE
)
1634 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1635 expr
= get_unwidened (expr
, 0);
1636 expr_type
= TREE_TYPE (expr
);
1638 /* Don't warn for short y; short x = ((int)y & 0xff); */
1639 if (TREE_CODE (expr
) == BIT_AND_EXPR
1640 || TREE_CODE (expr
) == BIT_IOR_EXPR
1641 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
1643 /* If both args were extended from a shortest type,
1644 use that type if that is safe. */
1645 expr_type
= shorten_binary_op (expr_type
,
1646 TREE_OPERAND (expr
, 0),
1647 TREE_OPERAND (expr
, 1),
1650 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
1652 tree op0
= TREE_OPERAND (expr
, 0);
1653 tree op1
= TREE_OPERAND (expr
, 1);
1654 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1655 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1657 /* If one of the operands is a non-negative constant
1658 that fits in the target type, then the type of the
1659 other operand does not matter. */
1660 if ((TREE_CODE (op0
) == INTEGER_CST
1661 && int_fits_type_p (op0
, c_common_signed_type (type
))
1662 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
1663 || (TREE_CODE (op1
) == INTEGER_CST
1664 && int_fits_type_p (op1
, c_common_signed_type (type
))
1665 && int_fits_type_p (op1
,
1666 c_common_unsigned_type (type
))))
1668 /* If constant is unsigned and fits in the target
1669 type, then the result will also fit. */
1670 else if ((TREE_CODE (op0
) == INTEGER_CST
1672 && int_fits_type_p (op0
, type
))
1673 || (TREE_CODE (op1
) == INTEGER_CST
1675 && int_fits_type_p (op1
, type
)))
1679 /* Warn for integer types converted to smaller integer types. */
1680 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1681 give_warning
= true;
1683 /* When they are the same width but different signedness,
1684 then the value may change. */
1685 else if ((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
1686 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
1687 /* Even when converted to a bigger type, if the type is
1688 unsigned but expr is signed, then negative values
1690 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
1691 warning (OPT_Wsign_conversion
, "conversion to %qT from %qT "
1692 "may change the sign of the result",
1696 /* Warn for integer types converted to real types if and only if
1697 all the range of values of the integer type cannot be
1698 represented by the real type. */
1699 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1700 && TREE_CODE (type
) == REAL_TYPE
)
1702 tree type_low_bound
= TYPE_MIN_VALUE (expr_type
);
1703 tree type_high_bound
= TYPE_MAX_VALUE (expr_type
);
1704 REAL_VALUE_TYPE real_low_bound
1705 = real_value_from_int_cst (0, type_low_bound
);
1706 REAL_VALUE_TYPE real_high_bound
1707 = real_value_from_int_cst (0, type_high_bound
);
1709 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
1710 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
1711 give_warning
= true;
1714 /* Warn for real types converted to smaller real types. */
1715 else if (TREE_CODE (expr_type
) == REAL_TYPE
1716 && TREE_CODE (type
) == REAL_TYPE
1717 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1718 give_warning
= true;
1722 warning (OPT_Wconversion
,
1723 "conversion to %qT from %qT may alter its value",
1728 /* Produce warnings after a conversion. RESULT is the result of
1729 converting EXPR to TYPE. This is a helper function for
1730 convert_and_check and cp_convert_and_check. */
1733 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
1735 if (TREE_CODE (expr
) == INTEGER_CST
1736 && (TREE_CODE (type
) == INTEGER_TYPE
1737 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1738 && !int_fits_type_p (expr
, type
))
1740 /* Do not diagnose overflow in a constant expression merely
1741 because a conversion overflowed. */
1742 if (TREE_OVERFLOW (result
))
1743 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
1745 if (TYPE_UNSIGNED (type
))
1747 /* This detects cases like converting -129 or 256 to
1749 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
1750 warning (OPT_Woverflow
,
1751 "large integer implicitly truncated to unsigned type");
1753 conversion_warning (type
, expr
);
1755 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
1756 warning (OPT_Woverflow
,
1757 "overflow in implicit constant conversion");
1758 /* No warning for converting 0x80000000 to int. */
1760 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
1761 || TYPE_PRECISION (TREE_TYPE (expr
))
1762 != TYPE_PRECISION (type
)))
1763 warning (OPT_Woverflow
,
1764 "overflow in implicit constant conversion");
1767 conversion_warning (type
, expr
);
1769 else if ((TREE_CODE (result
) == INTEGER_CST
1770 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
1771 warning (OPT_Woverflow
,
1772 "overflow in implicit constant conversion");
1774 conversion_warning (type
, expr
);
1778 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1779 Invoke this function on every expression that is converted implicitly,
1780 i.e. because of language rules and not because of an explicit cast. */
1783 convert_and_check (tree type
, tree expr
)
1787 if (TREE_TYPE (expr
) == type
)
1790 result
= convert (type
, expr
);
1792 if (!skip_evaluation
&& !TREE_OVERFLOW_P (expr
) && result
!= error_mark_node
)
1793 warnings_for_convert_and_check (type
, expr
, result
);
1798 /* A node in a list that describes references to variables (EXPR), which are
1799 either read accesses if WRITER is zero, or write accesses, in which case
1800 WRITER is the parent of EXPR. */
1807 /* Used to implement a cache the results of a call to verify_tree. We only
1808 use this for SAVE_EXPRs. */
1811 struct tlist_cache
*next
;
1812 struct tlist
*cache_before_sp
;
1813 struct tlist
*cache_after_sp
;
1817 /* Obstack to use when allocating tlist structures, and corresponding
1819 static struct obstack tlist_obstack
;
1820 static char *tlist_firstobj
= 0;
1822 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1824 static struct tlist
*warned_ids
;
1825 /* SAVE_EXPRs need special treatment. We process them only once and then
1826 cache the results. */
1827 static struct tlist_cache
*save_expr_cache
;
1829 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1830 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1831 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1832 static int warning_candidate_p (tree
);
1833 static void warn_for_collisions (struct tlist
*);
1834 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1835 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1837 /* Create a new struct tlist and fill in its fields. */
1838 static struct tlist
*
1839 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1842 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1849 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1850 is nonnull, we ignore any node we find which has a writer equal to it. */
1853 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1857 struct tlist
*next
= add
->next
;
1860 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1861 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1866 /* Merge the nodes of ADD into TO. This merging process is done so that for
1867 each variable that already exists in TO, no new node is added; however if
1868 there is a write access recorded in ADD, and an occurrence on TO is only
1869 a read access, then the occurrence in TO will be modified to record the
1873 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1875 struct tlist
**end
= to
;
1878 end
= &(*end
)->next
;
1884 struct tlist
*next
= add
->next
;
1886 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1887 if (tmp2
->expr
== add
->expr
)
1891 tmp2
->writer
= add
->writer
;
1895 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1896 end
= &(*end
)->next
;
1903 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1904 references in list LIST conflict with it, excluding reads if ONLY writers
1908 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1913 /* Avoid duplicate warnings. */
1914 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1915 if (tmp
->expr
== written
)
1920 if (list
->expr
== written
1921 && list
->writer
!= writer
1922 && (!only_writes
|| list
->writer
)
1923 && DECL_NAME (list
->expr
))
1925 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1926 warning_at (EXPR_HAS_LOCATION (writer
)
1927 ? EXPR_LOCATION (writer
) : input_location
,
1928 OPT_Wsequence_point
, "operation on %qE may be undefined",
1935 /* Given a list LIST of references to variables, find whether any of these
1936 can cause conflicts due to missing sequence points. */
1939 warn_for_collisions (struct tlist
*list
)
1943 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1946 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1950 /* Return nonzero if X is a tree that can be verified by the sequence point
1953 warning_candidate_p (tree x
)
1955 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1958 /* Walk the tree X, and record accesses to variables. If X is written by the
1959 parent tree, WRITER is the parent.
1960 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1961 expression or its only operand forces a sequence point, then everything up
1962 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1964 Once we return, we will have emitted warnings if any subexpression before
1965 such a sequence point could be undefined. On a higher level, however, the
1966 sequence point may not be relevant, and we'll merge the two lists.
1968 Example: (b++, a) + b;
1969 The call that processes the COMPOUND_EXPR will store the increment of B
1970 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1971 processes the PLUS_EXPR will need to merge the two lists so that
1972 eventually, all accesses end up on the same list (and we'll warn about the
1973 unordered subexpressions b++ and b.
1975 A note on merging. If we modify the former example so that our expression
1978 care must be taken not simply to add all three expressions into the final
1979 PNO_SP list. The function merge_tlist takes care of that by merging the
1980 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1981 way, so that no more than one access to B is recorded. */
1984 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1987 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1988 enum tree_code code
;
1989 enum tree_code_class cl
;
1991 /* X may be NULL if it is the operand of an empty statement expression
1997 code
= TREE_CODE (x
);
1998 cl
= TREE_CODE_CLASS (code
);
2000 if (warning_candidate_p (x
))
2002 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
2012 case TRUTH_ANDIF_EXPR
:
2013 case TRUTH_ORIF_EXPR
:
2014 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2015 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2016 warn_for_collisions (tmp_nosp
);
2017 merge_tlist (pbefore_sp
, tmp_before
, 0);
2018 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
2019 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
2020 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2024 tmp_before
= tmp_list2
= 0;
2025 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
2026 warn_for_collisions (tmp_list2
);
2027 merge_tlist (pbefore_sp
, tmp_before
, 0);
2028 merge_tlist (pbefore_sp
, tmp_list2
, 1);
2030 tmp_list3
= tmp_nosp
= 0;
2031 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
2032 warn_for_collisions (tmp_nosp
);
2033 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2035 tmp_list3
= tmp_list2
= 0;
2036 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
2037 warn_for_collisions (tmp_list2
);
2038 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2039 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2040 two first, to avoid warning for (a ? b++ : b++). */
2041 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
2042 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2045 case PREDECREMENT_EXPR
:
2046 case PREINCREMENT_EXPR
:
2047 case POSTDECREMENT_EXPR
:
2048 case POSTINCREMENT_EXPR
:
2049 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
2053 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2054 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2055 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
2056 /* Expressions inside the LHS are not ordered wrt. the sequence points
2057 in the RHS. Example:
2059 Despite the fact that the modification of "a" is in the before_sp
2060 list (tmp_before), it conflicts with the use of "a" in the LHS.
2061 We can handle this by adding the contents of tmp_list3
2062 to those of tmp_before, and redoing the collision warnings for that
2064 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
2065 warn_for_collisions (tmp_before
);
2066 /* Exclude the LHS itself here; we first have to merge it into the
2067 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2068 didn't exclude the LHS, we'd get it twice, once as a read and once
2070 add_tlist (pno_sp
, tmp_list3
, x
, 0);
2071 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
2073 merge_tlist (pbefore_sp
, tmp_before
, 0);
2074 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
2075 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
2076 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
2080 /* We need to warn about conflicts among arguments and conflicts between
2081 args and the function address. Side effects of the function address,
2082 however, are not ordered by the sequence point of the call. */
2084 call_expr_arg_iterator iter
;
2086 tmp_before
= tmp_nosp
= 0;
2087 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2088 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
2090 tmp_list2
= tmp_list3
= 0;
2091 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
2092 merge_tlist (&tmp_list3
, tmp_list2
, 0);
2093 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
2095 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
2096 warn_for_collisions (tmp_before
);
2097 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
2102 /* Scan all the list, e.g. indices of multi dimensional array. */
2105 tmp_before
= tmp_nosp
= 0;
2106 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2107 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2108 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2115 struct tlist_cache
*t
;
2116 for (t
= save_expr_cache
; t
; t
= t
->next
)
2122 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
2123 t
->next
= save_expr_cache
;
2125 save_expr_cache
= t
;
2127 tmp_before
= tmp_nosp
= 0;
2128 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2129 warn_for_collisions (tmp_nosp
);
2134 struct tlist
*t
= tmp_nosp
;
2136 merge_tlist (&tmp_list3
, t
, 0);
2138 t
->cache_before_sp
= tmp_before
;
2139 t
->cache_after_sp
= tmp_list3
;
2141 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
2142 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
2147 x
= TREE_OPERAND (x
, 0);
2154 /* For other expressions, simply recurse on their operands.
2155 Manual tail recursion for unary expressions.
2156 Other non-expressions need not be processed. */
2157 if (cl
== tcc_unary
)
2159 x
= TREE_OPERAND (x
, 0);
2163 else if (IS_EXPR_CODE_CLASS (cl
))
2166 int max
= TREE_OPERAND_LENGTH (x
);
2167 for (lp
= 0; lp
< max
; lp
++)
2169 tmp_before
= tmp_nosp
= 0;
2170 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
2171 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2172 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2179 /* Try to warn for undefined behavior in EXPR due to missing sequence
2183 verify_sequence_points (tree expr
)
2185 struct tlist
*before_sp
= 0, *after_sp
= 0;
2188 save_expr_cache
= 0;
2189 if (tlist_firstobj
== 0)
2191 gcc_obstack_init (&tlist_obstack
);
2192 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
2195 verify_tree (expr
, &before_sp
, &after_sp
, 0);
2196 warn_for_collisions (after_sp
);
2197 obstack_free (&tlist_obstack
, tlist_firstobj
);
2200 /* Validate the expression after `case' and apply default promotions. */
2203 check_case_value (tree value
)
2205 if (value
== NULL_TREE
)
2208 /* ??? Can we ever get nops here for a valid case value? We
2210 STRIP_TYPE_NOPS (value
);
2211 /* In C++, the following is allowed:
2214 switch (...) { case i: ... }
2216 So, we try to reduce the VALUE to a constant that way. */
2217 if (c_dialect_cxx ())
2219 value
= decl_constant_value (value
);
2220 STRIP_TYPE_NOPS (value
);
2221 value
= fold (value
);
2224 if (TREE_CODE (value
) == INTEGER_CST
)
2225 /* Promote char or short to int. */
2226 value
= perform_integral_promotions (value
);
2227 else if (value
!= error_mark_node
)
2229 error ("case label does not reduce to an integer constant");
2230 value
= error_mark_node
;
2233 constant_expression_warning (value
);
2238 /* See if the case values LOW and HIGH are in the range of the original
2239 type (i.e. before the default conversion to int) of the switch testing
2241 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2242 the type before promoting it. CASE_LOW_P is a pointer to the lower
2243 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2244 if the case is not a case range.
2245 The caller has to make sure that we are not called with NULL for
2246 CASE_LOW_P (i.e. the default case).
2247 Returns true if the case label is in range of ORIG_TYPE (saturated or
2248 untouched) or false if the label is out of range. */
2251 check_case_bounds (tree type
, tree orig_type
,
2252 tree
*case_low_p
, tree
*case_high_p
)
2254 tree min_value
, max_value
;
2255 tree case_low
= *case_low_p
;
2256 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2258 /* If there was a problem with the original type, do nothing. */
2259 if (orig_type
== error_mark_node
)
2262 min_value
= TYPE_MIN_VALUE (orig_type
);
2263 max_value
= TYPE_MAX_VALUE (orig_type
);
2265 /* Case label is less than minimum for type. */
2266 if (tree_int_cst_compare (case_low
, min_value
) < 0
2267 && tree_int_cst_compare (case_high
, min_value
) < 0)
2269 warning (0, "case label value is less than minimum value for type");
2273 /* Case value is greater than maximum for type. */
2274 if (tree_int_cst_compare (case_low
, max_value
) > 0
2275 && tree_int_cst_compare (case_high
, max_value
) > 0)
2277 warning (0, "case label value exceeds maximum value for type");
2281 /* Saturate lower case label value to minimum. */
2282 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2283 && tree_int_cst_compare (case_low
, min_value
) < 0)
2285 warning (0, "lower value in case label range"
2286 " less than minimum value for type");
2287 case_low
= min_value
;
2290 /* Saturate upper case label value to maximum. */
2291 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2292 && tree_int_cst_compare (case_high
, max_value
) > 0)
2294 warning (0, "upper value in case label range"
2295 " exceeds maximum value for type");
2296 case_high
= max_value
;
2299 if (*case_low_p
!= case_low
)
2300 *case_low_p
= convert (type
, case_low
);
2301 if (case_high_p
&& *case_high_p
!= case_high
)
2302 *case_high_p
= convert (type
, case_high
);
2307 /* Return an integer type with BITS bits of precision,
2308 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2311 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2313 if (bits
== TYPE_PRECISION (integer_type_node
))
2314 return unsignedp
? unsigned_type_node
: integer_type_node
;
2316 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2317 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2319 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2320 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2322 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2323 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2325 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2326 return (unsignedp
? long_long_unsigned_type_node
2327 : long_long_integer_type_node
);
2329 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2330 return (unsignedp
? widest_unsigned_literal_type_node
2331 : widest_integer_literal_type_node
);
2333 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2334 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2336 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2337 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2339 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2340 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2342 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2343 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2348 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2349 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2350 and saturating if SATP is nonzero, otherwise not saturating. */
2353 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2354 int unsignedp
, int satp
)
2356 enum machine_mode mode
;
2358 mode
= unsignedp
? UQQmode
: QQmode
;
2360 mode
= unsignedp
? UHAmode
: HAmode
;
2362 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2363 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2366 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2368 sorry ("GCC cannot support operators with integer types and "
2369 "fixed-point types that have too many integral and "
2370 "fractional bits together");
2374 return c_common_type_for_mode (mode
, satp
);
2377 /* Used for communication between c_common_type_for_mode and
2378 c_register_builtin_type. */
2379 static GTY(()) tree registered_builtin_types
;
2381 /* Return a data type that has machine mode MODE.
2382 If the mode is an integer,
2383 then UNSIGNEDP selects between signed and unsigned types.
2384 If the mode is a fixed-point mode,
2385 then UNSIGNEDP selects between saturating and nonsaturating types. */
2388 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
2392 if (mode
== TYPE_MODE (integer_type_node
))
2393 return unsignedp
? unsigned_type_node
: integer_type_node
;
2395 if (mode
== TYPE_MODE (signed_char_type_node
))
2396 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2398 if (mode
== TYPE_MODE (short_integer_type_node
))
2399 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2401 if (mode
== TYPE_MODE (long_integer_type_node
))
2402 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2404 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2405 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2407 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2408 return unsignedp
? widest_unsigned_literal_type_node
2409 : widest_integer_literal_type_node
;
2412 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2415 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2418 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2421 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2423 #if HOST_BITS_PER_WIDE_INT >= 64
2424 if (mode
== TYPE_MODE (intTI_type_node
))
2425 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2428 if (mode
== TYPE_MODE (float_type_node
))
2429 return float_type_node
;
2431 if (mode
== TYPE_MODE (double_type_node
))
2432 return double_type_node
;
2434 if (mode
== TYPE_MODE (long_double_type_node
))
2435 return long_double_type_node
;
2437 if (mode
== TYPE_MODE (void_type_node
))
2438 return void_type_node
;
2440 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2442 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2443 : make_signed_type (GET_MODE_PRECISION (mode
)));
2445 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2447 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2448 : make_signed_type (GET_MODE_PRECISION (mode
)));
2450 if (COMPLEX_MODE_P (mode
))
2452 enum machine_mode inner_mode
;
2455 if (mode
== TYPE_MODE (complex_float_type_node
))
2456 return complex_float_type_node
;
2457 if (mode
== TYPE_MODE (complex_double_type_node
))
2458 return complex_double_type_node
;
2459 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2460 return complex_long_double_type_node
;
2462 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2463 return complex_integer_type_node
;
2465 inner_mode
= GET_MODE_INNER (mode
);
2466 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2467 if (inner_type
!= NULL_TREE
)
2468 return build_complex_type (inner_type
);
2470 else if (VECTOR_MODE_P (mode
))
2472 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2473 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2474 if (inner_type
!= NULL_TREE
)
2475 return build_vector_type_for_mode (inner_type
, mode
);
2478 if (mode
== TYPE_MODE (dfloat32_type_node
))
2479 return dfloat32_type_node
;
2480 if (mode
== TYPE_MODE (dfloat64_type_node
))
2481 return dfloat64_type_node
;
2482 if (mode
== TYPE_MODE (dfloat128_type_node
))
2483 return dfloat128_type_node
;
2485 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
2487 if (mode
== TYPE_MODE (short_fract_type_node
))
2488 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
2489 if (mode
== TYPE_MODE (fract_type_node
))
2490 return unsignedp
? sat_fract_type_node
: fract_type_node
;
2491 if (mode
== TYPE_MODE (long_fract_type_node
))
2492 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
2493 if (mode
== TYPE_MODE (long_long_fract_type_node
))
2494 return unsignedp
? sat_long_long_fract_type_node
2495 : long_long_fract_type_node
;
2497 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
2498 return unsignedp
? sat_unsigned_short_fract_type_node
2499 : unsigned_short_fract_type_node
;
2500 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
2501 return unsignedp
? sat_unsigned_fract_type_node
2502 : unsigned_fract_type_node
;
2503 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
2504 return unsignedp
? sat_unsigned_long_fract_type_node
2505 : unsigned_long_fract_type_node
;
2506 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
2507 return unsignedp
? sat_unsigned_long_long_fract_type_node
2508 : unsigned_long_long_fract_type_node
;
2510 if (mode
== TYPE_MODE (short_accum_type_node
))
2511 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
2512 if (mode
== TYPE_MODE (accum_type_node
))
2513 return unsignedp
? sat_accum_type_node
: accum_type_node
;
2514 if (mode
== TYPE_MODE (long_accum_type_node
))
2515 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
2516 if (mode
== TYPE_MODE (long_long_accum_type_node
))
2517 return unsignedp
? sat_long_long_accum_type_node
2518 : long_long_accum_type_node
;
2520 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
2521 return unsignedp
? sat_unsigned_short_accum_type_node
2522 : unsigned_short_accum_type_node
;
2523 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
2524 return unsignedp
? sat_unsigned_accum_type_node
2525 : unsigned_accum_type_node
;
2526 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
2527 return unsignedp
? sat_unsigned_long_accum_type_node
2528 : unsigned_long_accum_type_node
;
2529 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
2530 return unsignedp
? sat_unsigned_long_long_accum_type_node
2531 : unsigned_long_long_accum_type_node
;
2534 return unsignedp
? sat_qq_type_node
: qq_type_node
;
2536 return unsignedp
? sat_hq_type_node
: hq_type_node
;
2538 return unsignedp
? sat_sq_type_node
: sq_type_node
;
2540 return unsignedp
? sat_dq_type_node
: dq_type_node
;
2542 return unsignedp
? sat_tq_type_node
: tq_type_node
;
2544 if (mode
== UQQmode
)
2545 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
2546 if (mode
== UHQmode
)
2547 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
2548 if (mode
== USQmode
)
2549 return unsignedp
? sat_usq_type_node
: usq_type_node
;
2550 if (mode
== UDQmode
)
2551 return unsignedp
? sat_udq_type_node
: udq_type_node
;
2552 if (mode
== UTQmode
)
2553 return unsignedp
? sat_utq_type_node
: utq_type_node
;
2556 return unsignedp
? sat_ha_type_node
: ha_type_node
;
2558 return unsignedp
? sat_sa_type_node
: sa_type_node
;
2560 return unsignedp
? sat_da_type_node
: da_type_node
;
2562 return unsignedp
? sat_ta_type_node
: ta_type_node
;
2564 if (mode
== UHAmode
)
2565 return unsignedp
? sat_uha_type_node
: uha_type_node
;
2566 if (mode
== USAmode
)
2567 return unsignedp
? sat_usa_type_node
: usa_type_node
;
2568 if (mode
== UDAmode
)
2569 return unsignedp
? sat_uda_type_node
: uda_type_node
;
2570 if (mode
== UTAmode
)
2571 return unsignedp
? sat_uta_type_node
: uta_type_node
;
2574 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2575 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
2576 return TREE_VALUE (t
);
2582 c_common_unsigned_type (tree type
)
2584 return c_common_signed_or_unsigned_type (1, type
);
2587 /* Return a signed type the same as TYPE in other respects. */
2590 c_common_signed_type (tree type
)
2592 return c_common_signed_or_unsigned_type (0, type
);
2595 /* Return a type the same as TYPE except unsigned or
2596 signed according to UNSIGNEDP. */
2599 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2603 /* This block of code emulates the behavior of the old
2604 c_common_unsigned_type. In particular, it returns
2605 long_unsigned_type_node if passed a long, even when a int would
2606 have the same size. This is necessary for warnings to work
2607 correctly in archs where sizeof(int) == sizeof(long) */
2609 type1
= TYPE_MAIN_VARIANT (type
);
2610 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
2611 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2612 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2613 return unsignedp
? unsigned_type_node
: integer_type_node
;
2614 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2615 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2616 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2617 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2618 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
2619 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2620 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
2621 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
2622 #if HOST_BITS_PER_WIDE_INT >= 64
2623 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2624 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2626 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2627 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2628 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2629 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2630 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2631 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2632 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2633 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2635 #define C_COMMON_FIXED_TYPES(NAME) \
2636 if (type1 == short_ ## NAME ## _type_node \
2637 || type1 == unsigned_short_ ## NAME ## _type_node) \
2638 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2639 : short_ ## NAME ## _type_node; \
2640 if (type1 == NAME ## _type_node \
2641 || type1 == unsigned_ ## NAME ## _type_node) \
2642 return unsignedp ? unsigned_ ## NAME ## _type_node \
2643 : NAME ## _type_node; \
2644 if (type1 == long_ ## NAME ## _type_node \
2645 || type1 == unsigned_long_ ## NAME ## _type_node) \
2646 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2647 : long_ ## NAME ## _type_node; \
2648 if (type1 == long_long_ ## NAME ## _type_node \
2649 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2650 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2651 : long_long_ ## NAME ## _type_node;
2653 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
2654 if (type1 == NAME ## _type_node \
2655 || type1 == u ## NAME ## _type_node) \
2656 return unsignedp ? u ## NAME ## _type_node \
2657 : NAME ## _type_node;
2659 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
2660 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2661 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2662 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2663 : sat_ ## short_ ## NAME ## _type_node; \
2664 if (type1 == sat_ ## NAME ## _type_node \
2665 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2666 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2667 : sat_ ## NAME ## _type_node; \
2668 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2669 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2670 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2671 : sat_ ## long_ ## NAME ## _type_node; \
2672 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2673 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2674 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2675 : sat_ ## long_long_ ## NAME ## _type_node;
2677 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
2678 if (type1 == sat_ ## NAME ## _type_node \
2679 || type1 == sat_ ## u ## NAME ## _type_node) \
2680 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2681 : sat_ ## NAME ## _type_node;
2683 C_COMMON_FIXED_TYPES (fract
);
2684 C_COMMON_FIXED_TYPES_SAT (fract
);
2685 C_COMMON_FIXED_TYPES (accum
);
2686 C_COMMON_FIXED_TYPES_SAT (accum
);
2688 C_COMMON_FIXED_MODE_TYPES (qq
);
2689 C_COMMON_FIXED_MODE_TYPES (hq
);
2690 C_COMMON_FIXED_MODE_TYPES (sq
);
2691 C_COMMON_FIXED_MODE_TYPES (dq
);
2692 C_COMMON_FIXED_MODE_TYPES (tq
);
2693 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
2694 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
2695 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
2696 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
2697 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
2698 C_COMMON_FIXED_MODE_TYPES (ha
);
2699 C_COMMON_FIXED_MODE_TYPES (sa
);
2700 C_COMMON_FIXED_MODE_TYPES (da
);
2701 C_COMMON_FIXED_MODE_TYPES (ta
);
2702 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
2703 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
2704 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
2705 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
2707 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2708 the precision; they have precision set to match their range, but
2709 may use a wider mode to match an ABI. If we change modes, we may
2710 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2711 the precision as well, so as to yield correct results for
2712 bit-field types. C++ does not have these separate bit-field
2713 types, and producing a signed or unsigned variant of an
2714 ENUMERAL_TYPE may cause other problems as well. */
2716 if (!INTEGRAL_TYPE_P (type
)
2717 || TYPE_UNSIGNED (type
) == unsignedp
)
2720 #define TYPE_OK(node) \
2721 (TYPE_MODE (type) == TYPE_MODE (node) \
2722 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
2723 if (TYPE_OK (signed_char_type_node
))
2724 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2725 if (TYPE_OK (integer_type_node
))
2726 return unsignedp
? unsigned_type_node
: integer_type_node
;
2727 if (TYPE_OK (short_integer_type_node
))
2728 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2729 if (TYPE_OK (long_integer_type_node
))
2730 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2731 if (TYPE_OK (long_long_integer_type_node
))
2732 return (unsignedp
? long_long_unsigned_type_node
2733 : long_long_integer_type_node
);
2734 if (TYPE_OK (widest_integer_literal_type_node
))
2735 return (unsignedp
? widest_unsigned_literal_type_node
2736 : widest_integer_literal_type_node
);
2738 #if HOST_BITS_PER_WIDE_INT >= 64
2739 if (TYPE_OK (intTI_type_node
))
2740 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2742 if (TYPE_OK (intDI_type_node
))
2743 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2744 if (TYPE_OK (intSI_type_node
))
2745 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2746 if (TYPE_OK (intHI_type_node
))
2747 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2748 if (TYPE_OK (intQI_type_node
))
2749 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2752 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2755 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2758 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2760 /* Extended integer types of the same width as a standard type have
2761 lesser rank, so those of the same width as int promote to int or
2762 unsigned int and are valid for printf formats expecting int or
2763 unsigned int. To avoid such special cases, avoid creating
2764 extended integer types for bit-fields if a standard integer type
2766 if (width
== TYPE_PRECISION (integer_type_node
))
2767 return unsignedp
? unsigned_type_node
: integer_type_node
;
2768 if (width
== TYPE_PRECISION (signed_char_type_node
))
2769 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2770 if (width
== TYPE_PRECISION (short_integer_type_node
))
2771 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2772 if (width
== TYPE_PRECISION (long_integer_type_node
))
2773 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2774 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2775 return (unsignedp
? long_long_unsigned_type_node
2776 : long_long_integer_type_node
);
2777 return build_nonstandard_integer_type (width
, unsignedp
);
2780 /* The C version of the register_builtin_type langhook. */
2783 c_register_builtin_type (tree type
, const char* name
)
2787 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
2788 DECL_ARTIFICIAL (decl
) = 1;
2789 if (!TYPE_NAME (type
))
2790 TYPE_NAME (type
) = decl
;
2793 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2796 /* Print an error message for invalid operands to arith operation
2797 CODE with TYPE0 for operand 0, and TYPE1 for operand 1.
2798 LOCATION is the location of the message. */
2801 binary_op_error (location_t location
, enum tree_code code
,
2802 tree type0
, tree type1
)
2809 opname
= "+"; break;
2811 opname
= "-"; break;
2813 opname
= "*"; break;
2815 opname
= "max"; break;
2817 opname
= "min"; break;
2819 opname
= "=="; break;
2821 opname
= "!="; break;
2823 opname
= "<="; break;
2825 opname
= ">="; break;
2827 opname
= "<"; break;
2829 opname
= ">"; break;
2831 opname
= "<<"; break;
2833 opname
= ">>"; break;
2834 case TRUNC_MOD_EXPR
:
2835 case FLOOR_MOD_EXPR
:
2836 opname
= "%"; break;
2837 case TRUNC_DIV_EXPR
:
2838 case FLOOR_DIV_EXPR
:
2839 opname
= "/"; break;
2841 opname
= "&"; break;
2843 opname
= "|"; break;
2844 case TRUTH_ANDIF_EXPR
:
2845 opname
= "&&"; break;
2846 case TRUTH_ORIF_EXPR
:
2847 opname
= "||"; break;
2849 opname
= "^"; break;
2854 "invalid operands to binary %s (have %qT and %qT)", opname
,
2858 /* Subroutine of build_binary_op, used for comparison operations.
2859 See if the operands have both been converted from subword integer types
2860 and, if so, perhaps change them both back to their original type.
2861 This function is also responsible for converting the two operands
2862 to the proper common type for comparison.
2864 The arguments of this function are all pointers to local variables
2865 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2866 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2868 If this function returns nonzero, it means that the comparison has
2869 a constant value. What this function returns is an expression for
2873 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
2874 enum tree_code
*rescode_ptr
)
2877 tree op0
= *op0_ptr
;
2878 tree op1
= *op1_ptr
;
2879 int unsignedp0
, unsignedp1
;
2881 tree primop0
, primop1
;
2882 enum tree_code code
= *rescode_ptr
;
2884 /* Throw away any conversions to wider types
2885 already present in the operands. */
2887 primop0
= get_narrower (op0
, &unsignedp0
);
2888 primop1
= get_narrower (op1
, &unsignedp1
);
2890 /* Handle the case that OP0 does not *contain* a conversion
2891 but it *requires* conversion to FINAL_TYPE. */
2893 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2894 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2895 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2896 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2898 /* If one of the operands must be floated, we cannot optimize. */
2899 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2900 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2902 /* If first arg is constant, swap the args (changing operation
2903 so value is preserved), for canonicalization. Don't do this if
2904 the second arg is 0. */
2906 if (TREE_CONSTANT (primop0
)
2907 && !integer_zerop (primop1
) && !real_zerop (primop1
)
2908 && !fixed_zerop (primop1
))
2911 int temi
= unsignedp0
;
2919 unsignedp0
= unsignedp1
;
2942 *rescode_ptr
= code
;
2945 /* If comparing an integer against a constant more bits wide,
2946 maybe we can deduce a value of 1 or 0 independent of the data.
2947 Or else truncate the constant now
2948 rather than extend the variable at run time.
2950 This is only interesting if the constant is the wider arg.
2951 Also, it is not safe if the constant is unsigned and the
2952 variable arg is signed, since in this case the variable
2953 would be sign-extended and then regarded as unsigned.
2954 Our technique fails in this case because the lowest/highest
2955 possible unsigned results don't follow naturally from the
2956 lowest/highest possible values of the variable operand.
2957 For just EQ_EXPR and NE_EXPR there is another technique that
2958 could be used: see if the constant can be faithfully represented
2959 in the other operand's type, by truncating it and reextending it
2960 and see if that preserves the constant's value. */
2962 if (!real1
&& !real2
2963 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
2964 && TREE_CODE (primop1
) == INTEGER_CST
2965 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2967 int min_gt
, max_gt
, min_lt
, max_lt
;
2968 tree maxval
, minval
;
2969 /* 1 if comparison is nominally unsigned. */
2970 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2973 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2974 TREE_TYPE (primop0
));
2976 maxval
= TYPE_MAX_VALUE (type
);
2977 minval
= TYPE_MIN_VALUE (type
);
2979 if (unsignedp
&& !unsignedp0
)
2980 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2982 if (TREE_TYPE (primop1
) != *restype_ptr
)
2984 /* Convert primop1 to target type, but do not introduce
2985 additional overflow. We know primop1 is an int_cst. */
2986 primop1
= force_fit_type_double (*restype_ptr
,
2987 TREE_INT_CST_LOW (primop1
),
2988 TREE_INT_CST_HIGH (primop1
), 0,
2989 TREE_OVERFLOW (primop1
));
2991 if (type
!= *restype_ptr
)
2993 minval
= convert (*restype_ptr
, minval
);
2994 maxval
= convert (*restype_ptr
, maxval
);
2997 if (unsignedp
&& unsignedp0
)
2999 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
3000 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
3001 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
3002 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
3006 min_gt
= INT_CST_LT (primop1
, minval
);
3007 max_gt
= INT_CST_LT (primop1
, maxval
);
3008 min_lt
= INT_CST_LT (minval
, primop1
);
3009 max_lt
= INT_CST_LT (maxval
, primop1
);
3013 /* This used to be a switch, but Genix compiler can't handle that. */
3014 if (code
== NE_EXPR
)
3016 if (max_lt
|| min_gt
)
3017 val
= truthvalue_true_node
;
3019 else if (code
== EQ_EXPR
)
3021 if (max_lt
|| min_gt
)
3022 val
= truthvalue_false_node
;
3024 else if (code
== LT_EXPR
)
3027 val
= truthvalue_true_node
;
3029 val
= truthvalue_false_node
;
3031 else if (code
== GT_EXPR
)
3034 val
= truthvalue_true_node
;
3036 val
= truthvalue_false_node
;
3038 else if (code
== LE_EXPR
)
3041 val
= truthvalue_true_node
;
3043 val
= truthvalue_false_node
;
3045 else if (code
== GE_EXPR
)
3048 val
= truthvalue_true_node
;
3050 val
= truthvalue_false_node
;
3053 /* If primop0 was sign-extended and unsigned comparison specd,
3054 we did a signed comparison above using the signed type bounds.
3055 But the comparison we output must be unsigned.
3057 Also, for inequalities, VAL is no good; but if the signed
3058 comparison had *any* fixed result, it follows that the
3059 unsigned comparison just tests the sign in reverse
3060 (positive values are LE, negative ones GE).
3061 So we can generate an unsigned comparison
3062 against an extreme value of the signed type. */
3064 if (unsignedp
&& !unsignedp0
)
3071 primop1
= TYPE_MIN_VALUE (type
);
3077 primop1
= TYPE_MAX_VALUE (type
);
3084 type
= c_common_unsigned_type (type
);
3087 if (TREE_CODE (primop0
) != INTEGER_CST
)
3089 if (val
== truthvalue_false_node
)
3090 warning (OPT_Wtype_limits
, "comparison is always false due to limited range of data type");
3091 if (val
== truthvalue_true_node
)
3092 warning (OPT_Wtype_limits
, "comparison is always true due to limited range of data type");
3097 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3098 if (TREE_SIDE_EFFECTS (primop0
))
3099 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
3103 /* Value is not predetermined, but do the comparison
3104 in the type of the operand that is not constant.
3105 TYPE is already properly set. */
3108 /* If either arg is decimal float and the other is float, find the
3109 proper common type to use for comparison. */
3110 else if (real1
&& real2
3111 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
3112 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
3113 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3115 else if (real1
&& real2
3116 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3117 == TYPE_PRECISION (TREE_TYPE (primop1
))))
3118 type
= TREE_TYPE (primop0
);
3120 /* If args' natural types are both narrower than nominal type
3121 and both extend in the same manner, compare them
3122 in the type of the wider arg.
3123 Otherwise must actually extend both to the nominal
3124 common type lest different ways of extending
3126 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3128 else if (unsignedp0
== unsignedp1
&& real1
== real2
3129 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
3130 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
3132 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3133 type
= c_common_signed_or_unsigned_type (unsignedp0
3134 || TYPE_UNSIGNED (*restype_ptr
),
3136 /* Make sure shorter operand is extended the right way
3137 to match the longer operand. */
3139 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
3140 TREE_TYPE (primop0
)),
3143 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
3144 TREE_TYPE (primop1
)),
3149 /* Here we must do the comparison on the nominal type
3150 using the args exactly as we received them. */
3151 type
= *restype_ptr
;
3155 if (!real1
&& !real2
&& integer_zerop (primop1
)
3156 && TYPE_UNSIGNED (*restype_ptr
))
3162 /* All unsigned values are >= 0, so we warn. However,
3163 if OP0 is a constant that is >= 0, the signedness of
3164 the comparison isn't an issue, so suppress the
3166 if (warn_type_limits
&& !in_system_header
3167 && !(TREE_CODE (primop0
) == INTEGER_CST
3168 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3170 warning (OPT_Wtype_limits
,
3171 "comparison of unsigned expression >= 0 is always true");
3172 value
= truthvalue_true_node
;
3176 if (warn_type_limits
&& !in_system_header
3177 && !(TREE_CODE (primop0
) == INTEGER_CST
3178 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3180 warning (OPT_Wtype_limits
,
3181 "comparison of unsigned expression < 0 is always false");
3182 value
= truthvalue_false_node
;
3191 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3192 if (TREE_SIDE_EFFECTS (primop0
))
3193 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3200 *op0_ptr
= convert (type
, primop0
);
3201 *op1_ptr
= convert (type
, primop1
);
3203 *restype_ptr
= truthvalue_type_node
;
3208 /* Return a tree for the sum or difference (RESULTCODE says which)
3209 of pointer PTROP and integer INTOP. */
3212 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
3216 /* The result is a pointer of the same type that is being added. */
3217 tree result_type
= TREE_TYPE (ptrop
);
3219 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3221 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3222 "pointer of type %<void *%> used in arithmetic");
3223 size_exp
= integer_one_node
;
3225 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3227 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3228 "pointer to a function used in arithmetic");
3229 size_exp
= integer_one_node
;
3231 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
3233 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3234 "pointer to member function used in arithmetic");
3235 size_exp
= integer_one_node
;
3238 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
3240 /* We are manipulating pointer values, so we don't need to warn
3241 about relying on undefined signed overflow. We disable the
3242 warning here because we use integer types so fold won't know that
3243 they are really pointers. */
3244 fold_defer_overflow_warnings ();
3246 /* If what we are about to multiply by the size of the elements
3247 contains a constant term, apply distributive law
3248 and multiply that constant term separately.
3249 This helps produce common subexpressions. */
3250 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3251 && !TREE_CONSTANT (intop
)
3252 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3253 && TREE_CONSTANT (size_exp
)
3254 /* If the constant comes from pointer subtraction,
3255 skip this optimization--it would cause an error. */
3256 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3257 /* If the constant is unsigned, and smaller than the pointer size,
3258 then we must skip this optimization. This is because it could cause
3259 an overflow error if the constant is negative but INTOP is not. */
3260 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3261 || (TYPE_PRECISION (TREE_TYPE (intop
))
3262 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3264 enum tree_code subcode
= resultcode
;
3265 tree int_type
= TREE_TYPE (intop
);
3266 if (TREE_CODE (intop
) == MINUS_EXPR
)
3267 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3268 /* Convert both subexpression types to the type of intop,
3269 because weird cases involving pointer arithmetic
3270 can result in a sum or difference with different type args. */
3271 ptrop
= build_binary_op (EXPR_LOCATION (TREE_OPERAND (intop
, 1)),
3273 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3274 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3277 /* Convert the integer argument to a type the same size as sizetype
3278 so the multiply won't overflow spuriously. */
3279 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3280 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3281 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3282 TYPE_UNSIGNED (sizetype
)), intop
);
3284 /* Replace the integer argument with a suitable product by the object size.
3285 Do this multiplication as signed, then convert to the appropriate
3286 type for the pointer operation. */
3287 intop
= convert (sizetype
,
3288 build_binary_op (EXPR_LOCATION (intop
),
3290 convert (TREE_TYPE (intop
), size_exp
), 1));
3292 /* Create the sum or difference. */
3293 if (resultcode
== MINUS_EXPR
)
3294 intop
= fold_build1 (NEGATE_EXPR
, sizetype
, intop
);
3296 ret
= fold_build2 (POINTER_PLUS_EXPR
, result_type
, ptrop
, intop
);
3298 fold_undefer_and_ignore_overflow_warnings ();
3303 /* Return whether EXPR is a declaration whose address can never be
3307 decl_with_nonnull_addr_p (const_tree expr
)
3309 return (DECL_P (expr
)
3310 && (TREE_CODE (expr
) == PARM_DECL
3311 || TREE_CODE (expr
) == LABEL_DECL
3312 || !DECL_WEAK (expr
)));
3315 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3316 or for an `if' or `while' statement or ?..: exp. It should already
3317 have been validated to be of suitable type; otherwise, a bad
3318 diagnostic may result.
3320 The EXPR is located at LOCATION.
3322 This preparation consists of taking the ordinary
3323 representation of an expression expr and producing a valid tree
3324 boolean expression describing whether expr is nonzero. We could
3325 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3326 but we optimize comparisons, &&, ||, and !.
3328 The resulting type should always be `truthvalue_type_node'. */
3331 c_common_truthvalue_conversion (location_t location
, tree expr
)
3333 switch (TREE_CODE (expr
))
3335 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3336 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3337 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3338 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3339 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3341 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
3342 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3344 case TRUTH_ANDIF_EXPR
:
3345 case TRUTH_ORIF_EXPR
:
3346 case TRUTH_AND_EXPR
:
3348 case TRUTH_XOR_EXPR
:
3349 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3351 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
3352 c_common_truthvalue_conversion (location
,
3353 TREE_OPERAND (expr
, 0)),
3354 c_common_truthvalue_conversion (location
,
3355 TREE_OPERAND (expr
, 1)));
3357 case TRUTH_NOT_EXPR
:
3358 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3360 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
3361 c_common_truthvalue_conversion (location
,
3362 TREE_OPERAND (expr
, 0)));
3368 return integer_zerop (expr
) ? truthvalue_false_node
3369 : truthvalue_true_node
;
3372 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3373 ? truthvalue_true_node
3374 : truthvalue_false_node
;
3377 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3378 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3379 ? truthvalue_true_node
3380 : truthvalue_false_node
;
3383 expr
= build_unary_op (location
, ADDR_EXPR
, expr
, 0);
3388 tree inner
= TREE_OPERAND (expr
, 0);
3389 if (decl_with_nonnull_addr_p (inner
))
3391 /* Common Ada/Pascal programmer's mistake. */
3392 warning_at (location
,
3394 "the address of %qD will always evaluate as %<true%>",
3396 return truthvalue_true_node
;
3399 /* If we still have a decl, it is possible for its address to
3400 be NULL, so we cannot optimize. */
3403 gcc_assert (DECL_WEAK (inner
));
3407 if (TREE_SIDE_EFFECTS (inner
))
3408 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3409 inner
, truthvalue_true_node
);
3411 return truthvalue_true_node
;
3415 return build_binary_op (EXPR_LOCATION (expr
),
3416 (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3417 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3418 c_common_truthvalue_conversion (location
,
3419 TREE_OPERAND (expr
, 0)),
3420 c_common_truthvalue_conversion (location
,
3421 TREE_OPERAND (expr
, 1)),
3427 /* These don't change whether an object is nonzero or zero. */
3428 return c_common_truthvalue_conversion (location
, TREE_OPERAND (expr
, 0));
3432 /* These don't change whether an object is zero or nonzero, but
3433 we can't ignore them if their second arg has side-effects. */
3434 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
3435 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3436 TREE_OPERAND (expr
, 1),
3437 c_common_truthvalue_conversion
3438 (location
, TREE_OPERAND (expr
, 0)));
3440 return c_common_truthvalue_conversion (location
,
3441 TREE_OPERAND (expr
, 0));
3444 /* Distribute the conversion into the arms of a COND_EXPR. */
3445 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
3446 TREE_OPERAND (expr
, 0),
3447 c_common_truthvalue_conversion (location
,
3448 TREE_OPERAND (expr
, 1)),
3449 c_common_truthvalue_conversion (location
,
3450 TREE_OPERAND (expr
, 2)));
3453 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3454 since that affects how `default_conversion' will behave. */
3455 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
3456 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
3458 /* If this is widening the argument, we can ignore it. */
3459 if (TYPE_PRECISION (TREE_TYPE (expr
))
3460 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3461 return c_common_truthvalue_conversion (location
,
3462 TREE_OPERAND (expr
, 0));
3466 if (!TREE_NO_WARNING (expr
)
3467 && warn_parentheses
)
3469 warning (OPT_Wparentheses
,
3470 "suggest parentheses around assignment used as truth value");
3471 TREE_NO_WARNING (expr
) = 1;
3479 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
3481 tree t
= save_expr (expr
);
3482 return (build_binary_op
3483 (EXPR_LOCATION (expr
),
3484 (TREE_SIDE_EFFECTS (expr
)
3485 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3486 c_common_truthvalue_conversion
3488 build_unary_op (location
, REALPART_EXPR
, t
, 0)),
3489 c_common_truthvalue_conversion
3491 build_unary_op (location
, IMAGPART_EXPR
, t
, 0)),
3495 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
3497 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
3499 (TREE_TYPE (expr
))));
3500 return build_binary_op (EXPR_LOCATION (expr
),
3501 NE_EXPR
, expr
, fixed_zero_node
, 1);
3504 return build_binary_op (EXPR_LOCATION (expr
),
3505 NE_EXPR
, expr
, integer_zero_node
, 1);
3508 static void def_builtin_1 (enum built_in_function fncode
,
3510 enum built_in_class fnclass
,
3511 tree fntype
, tree libtype
,
3512 bool both_p
, bool fallback_p
, bool nonansi_p
,
3513 tree fnattrs
, bool implicit_p
);
3516 /* Apply the TYPE_QUALS to the new DECL. */
3519 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
3521 tree type
= TREE_TYPE (decl
);
3523 if (type
== error_mark_node
)
3526 if (((type_quals
& TYPE_QUAL_CONST
)
3527 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
3528 /* An object declared 'const' is only readonly after it is
3529 initialized. We don't have any way of expressing this currently,
3530 so we need to be conservative and unset TREE_READONLY for types
3531 with constructors. Otherwise aliasing code will ignore stores in
3532 an inline constructor. */
3533 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
3534 TREE_READONLY (decl
) = 1;
3535 if (type_quals
& TYPE_QUAL_VOLATILE
)
3537 TREE_SIDE_EFFECTS (decl
) = 1;
3538 TREE_THIS_VOLATILE (decl
) = 1;
3540 if (type_quals
& TYPE_QUAL_RESTRICT
)
3542 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
3543 /* Allow 'restrict' on arrays of pointers.
3544 FIXME currently we just ignore it. */
3545 type
= TREE_TYPE (type
);
3547 || !POINTER_TYPE_P (type
)
3548 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
3549 error ("invalid use of %<restrict%>");
3550 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
3551 /* Indicate we need to make a unique alias set for this pointer.
3552 We can't do it here because it might be pointing to an
3554 DECL_POINTER_ALIAS_SET (decl
) = -2;
3558 /* Hash function for the problem of multiple type definitions in
3559 different files. This must hash all types that will compare
3560 equal via comptypes to the same value. In practice it hashes
3561 on some of the simple stuff and leaves the details to comptypes. */
3564 c_type_hash (const void *p
)
3568 const_tree
const t
= (const_tree
) p
;
3570 switch (TREE_CODE (t
))
3572 /* For pointers, hash on pointee type plus some swizzling. */
3574 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
3575 /* Hash on number of elements and total size. */
3578 t2
= TYPE_VALUES (t
);
3582 t2
= TYPE_FIELDS (t
);
3584 case QUAL_UNION_TYPE
:
3586 t2
= TYPE_FIELDS (t
);
3590 t2
= TYPE_FIELDS (t
);
3595 for (; t2
; t2
= TREE_CHAIN (t2
))
3597 /* We might have a VLA here. */
3598 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
3601 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
3602 return ((size
<< 24) | (i
<< shift
));
3605 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
3607 /* Return the typed-based alias set for T, which may be an expression
3608 or a type. Return -1 if we don't do anything special. */
3611 c_common_get_alias_set (tree t
)
3616 /* Permit type-punning when accessing a union, provided the access
3617 is directly through the union. For example, this code does not
3618 permit taking the address of a union member and then storing
3619 through it. Even the type-punning allowed here is a GCC
3620 extension, albeit a common and useful one; the C standard says
3621 that such accesses have implementation-defined behavior. */
3623 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
3624 u
= TREE_OPERAND (u
, 0))
3625 if (TREE_CODE (u
) == COMPONENT_REF
3626 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
3629 /* That's all the expressions we handle specially. */
3633 /* The C standard guarantees that any object may be accessed via an
3634 lvalue that has character type. */
3635 if (t
== char_type_node
3636 || t
== signed_char_type_node
3637 || t
== unsigned_char_type_node
)
3640 /* The C standard specifically allows aliasing between signed and
3641 unsigned variants of the same type. We treat the signed
3642 variant as canonical. */
3643 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3645 tree t1
= c_common_signed_type (t
);
3647 /* t1 == t can happen for boolean nodes which are always unsigned. */
3649 return get_alias_set (t1
);
3651 else if (POINTER_TYPE_P (t
))
3655 /* Unfortunately, there is no canonical form of a pointer type.
3656 In particular, if we have `typedef int I', then `int *', and
3657 `I *' are different types. So, we have to pick a canonical
3658 representative. We do this below.
3660 Technically, this approach is actually more conservative that
3661 it needs to be. In particular, `const int *' and `int *'
3662 should be in different alias sets, according to the C and C++
3663 standard, since their types are not the same, and so,
3664 technically, an `int **' and `const int **' cannot point at
3667 But, the standard is wrong. In particular, this code is
3672 const int* const* cipp = ipp;
3674 And, it doesn't make sense for that to be legal unless you
3675 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3676 the pointed-to types. This issue has been reported to the
3678 t1
= build_type_no_quals (t
);
3680 return get_alias_set (t1
);
3683 /* Handle the case of multiple type nodes referring to "the same" type,
3684 which occurs with IMA. These share an alias set. FIXME: Currently only
3685 C90 is handled. (In C99 type compatibility is not transitive, which
3686 complicates things mightily. The alias set splay trees can theoretically
3687 represent this, but insertion is tricky when you consider all the
3688 different orders things might arrive in.) */
3690 if (c_language
!= clk_c
|| flag_isoc99
)
3693 /* Save time if there's only one input file. */
3694 if (num_in_fnames
== 1)
3697 /* Pointers need special handling if they point to any type that
3698 needs special handling (below). */
3699 if (TREE_CODE (t
) == POINTER_TYPE
)
3702 /* Find bottom type under any nested POINTERs. */
3703 for (t2
= TREE_TYPE (t
);
3704 TREE_CODE (t2
) == POINTER_TYPE
;
3705 t2
= TREE_TYPE (t2
))
3707 if (TREE_CODE (t2
) != RECORD_TYPE
3708 && TREE_CODE (t2
) != ENUMERAL_TYPE
3709 && TREE_CODE (t2
) != QUAL_UNION_TYPE
3710 && TREE_CODE (t2
) != UNION_TYPE
)
3712 if (TYPE_SIZE (t2
) == 0)
3715 /* These are the only cases that need special handling. */
3716 if (TREE_CODE (t
) != RECORD_TYPE
3717 && TREE_CODE (t
) != ENUMERAL_TYPE
3718 && TREE_CODE (t
) != QUAL_UNION_TYPE
3719 && TREE_CODE (t
) != UNION_TYPE
3720 && TREE_CODE (t
) != POINTER_TYPE
)
3723 if (TYPE_SIZE (t
) == 0)
3726 /* Look up t in hash table. Only one of the compatible types within each
3727 alias set is recorded in the table. */
3728 if (!type_hash_table
)
3729 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
3730 (htab_eq
) lang_hooks
.types_compatible_p
,
3732 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
3735 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
3736 return TYPE_ALIAS_SET ((tree
)*slot
);
3739 /* Our caller will assign and record (in t) a new alias set; all we need
3740 to do is remember t in the hash table. */
3746 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3747 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3748 flag controls whether we should diagnose possibly ill-formed
3749 constructs or not. */
3752 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
3754 const char *op_name
;
3756 enum tree_code type_code
= TREE_CODE (type
);
3758 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3760 if (type_code
== FUNCTION_TYPE
)
3764 if (complain
&& (pedantic
|| warn_pointer_arith
))
3765 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3766 "invalid application of %<sizeof%> to a function type");
3768 return error_mark_node
;
3769 value
= size_one_node
;
3772 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3774 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3776 if (type_code
== VOID_TYPE
3777 && complain
&& (pedantic
|| warn_pointer_arith
))
3778 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3779 "invalid application of %qs to a void type", op_name
);
3781 return error_mark_node
;
3782 value
= size_one_node
;
3784 else if (!COMPLETE_TYPE_P (type
))
3787 error ("invalid application of %qs to incomplete type %qT ",
3789 value
= size_zero_node
;
3794 /* Convert in case a char is more than one unit. */
3795 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3796 size_int (TYPE_PRECISION (char_type_node
)
3799 value
= size_int (TYPE_ALIGN_UNIT (type
));
3802 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3803 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3804 never happen. However, this node should really have type
3805 `size_t', which is just a typedef for an ordinary integer type. */
3806 value
= fold_convert (size_type_node
, value
);
3807 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
3812 /* Implement the __alignof keyword: Return the minimum required
3813 alignment of EXPR, measured in bytes. For VAR_DECLs,
3814 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3815 from an "aligned" __attribute__ specification). */
3818 c_alignof_expr (tree expr
)
3822 if (VAR_OR_FUNCTION_DECL_P (expr
))
3823 t
= size_int (DECL_ALIGN_UNIT (expr
));
3825 else if (TREE_CODE (expr
) == COMPONENT_REF
3826 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3828 error ("%<__alignof%> applied to a bit-field");
3831 else if (TREE_CODE (expr
) == COMPONENT_REF
3832 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3833 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3835 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3837 tree t
= TREE_OPERAND (expr
, 0);
3839 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3841 while (CONVERT_EXPR_P (t
)
3842 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3846 t
= TREE_OPERAND (t
, 0);
3847 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3848 if (thisalign
> bestalign
)
3849 best
= t
, bestalign
= thisalign
;
3851 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3854 return c_alignof (TREE_TYPE (expr
));
3856 return fold_convert (size_type_node
, t
);
3859 /* Handle C and C++ default attributes. */
3861 enum built_in_attribute
3863 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3864 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3865 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3866 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3867 #include "builtin-attrs.def"
3868 #undef DEF_ATTR_NULL_TREE
3870 #undef DEF_ATTR_IDENT
3871 #undef DEF_ATTR_TREE_LIST
3875 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3877 static void c_init_attributes (void);
3881 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3882 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3883 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3884 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3885 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3886 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3887 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3888 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3889 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3890 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3891 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3892 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3893 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3894 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3895 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3897 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3898 #include "builtin-types.def"
3899 #undef DEF_PRIMITIVE_TYPE
3900 #undef DEF_FUNCTION_TYPE_0
3901 #undef DEF_FUNCTION_TYPE_1
3902 #undef DEF_FUNCTION_TYPE_2
3903 #undef DEF_FUNCTION_TYPE_3
3904 #undef DEF_FUNCTION_TYPE_4
3905 #undef DEF_FUNCTION_TYPE_5
3906 #undef DEF_FUNCTION_TYPE_6
3907 #undef DEF_FUNCTION_TYPE_7
3908 #undef DEF_FUNCTION_TYPE_VAR_0
3909 #undef DEF_FUNCTION_TYPE_VAR_1
3910 #undef DEF_FUNCTION_TYPE_VAR_2
3911 #undef DEF_FUNCTION_TYPE_VAR_3
3912 #undef DEF_FUNCTION_TYPE_VAR_4
3913 #undef DEF_FUNCTION_TYPE_VAR_5
3914 #undef DEF_POINTER_TYPE
3918 typedef enum c_builtin_type builtin_type
;
3920 /* A temporary array for c_common_nodes_and_builtins. Used in
3921 communication with def_fn_type. */
3922 static tree builtin_types
[(int) BT_LAST
+ 1];
3924 /* A helper function for c_common_nodes_and_builtins. Build function type
3925 for DEF with return type RET and N arguments. If VAR is true, then the
3926 function should be variadic after those N arguments.
3928 Takes special care not to ICE if any of the types involved are
3929 error_mark_node, which indicates that said type is not in fact available
3930 (see builtin_type_for_size). In which case the function type as a whole
3931 should be error_mark_node. */
3934 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3936 tree args
= NULL
, t
;
3941 for (i
= 0; i
< n
; ++i
)
3943 builtin_type a
= (builtin_type
) va_arg (list
, int);
3944 t
= builtin_types
[a
];
3945 if (t
== error_mark_node
)
3947 args
= tree_cons (NULL_TREE
, t
, args
);
3951 args
= nreverse (args
);
3953 args
= chainon (args
, void_list_node
);
3955 t
= builtin_types
[ret
];
3956 if (t
== error_mark_node
)
3958 t
= build_function_type (t
, args
);
3961 builtin_types
[def
] = t
;
3964 /* Build builtin functions common to both C and C++ language
3968 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3970 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3971 builtin_types[ENUM] = VALUE;
3972 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3973 def_fn_type (ENUM, RETURN, 0, 0);
3974 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3975 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3976 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3977 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3978 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3979 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3980 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3981 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3982 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3983 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3984 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3986 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3987 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3989 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3990 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3991 def_fn_type (ENUM, RETURN, 1, 0);
3992 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3993 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3994 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3995 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3996 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3997 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3998 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3999 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4000 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4001 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4002 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4003 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4005 #include "builtin-types.def"
4007 #undef DEF_PRIMITIVE_TYPE
4008 #undef DEF_FUNCTION_TYPE_1
4009 #undef DEF_FUNCTION_TYPE_2
4010 #undef DEF_FUNCTION_TYPE_3
4011 #undef DEF_FUNCTION_TYPE_4
4012 #undef DEF_FUNCTION_TYPE_5
4013 #undef DEF_FUNCTION_TYPE_6
4014 #undef DEF_FUNCTION_TYPE_VAR_0
4015 #undef DEF_FUNCTION_TYPE_VAR_1
4016 #undef DEF_FUNCTION_TYPE_VAR_2
4017 #undef DEF_FUNCTION_TYPE_VAR_3
4018 #undef DEF_FUNCTION_TYPE_VAR_4
4019 #undef DEF_FUNCTION_TYPE_VAR_5
4020 #undef DEF_POINTER_TYPE
4021 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4023 c_init_attributes ();
4025 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4026 NONANSI_P, ATTRS, IMPLICIT, COND) \
4028 def_builtin_1 (ENUM, NAME, CLASS, \
4029 builtin_types[(int) TYPE], \
4030 builtin_types[(int) LIBTYPE], \
4031 BOTH_P, FALLBACK_P, NONANSI_P, \
4032 built_in_attributes[(int) ATTRS], IMPLICIT);
4033 #include "builtins.def"
4036 targetm
.init_builtins ();
4038 build_common_builtin_nodes ();
4044 /* Build tree nodes and builtin functions common to both C and C++ language
4048 c_common_nodes_and_builtins (void)
4050 int char16_type_size
;
4051 int char32_type_size
;
4052 int wchar_type_size
;
4053 tree array_domain_type
;
4054 tree va_list_ref_type_node
;
4055 tree va_list_arg_type_node
;
4057 /* Define `int' and `char' first so that dbx will output them first. */
4058 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
4059 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4061 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4062 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4063 but not C. Are the conditionals here needed? */
4064 if (c_dialect_cxx ())
4065 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
4066 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4067 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4068 record_builtin_type (RID_MAX
, "long unsigned int",
4069 long_unsigned_type_node
);
4070 if (c_dialect_cxx ())
4071 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4072 record_builtin_type (RID_MAX
, "long long int",
4073 long_long_integer_type_node
);
4074 record_builtin_type (RID_MAX
, "long long unsigned int",
4075 long_long_unsigned_type_node
);
4076 if (c_dialect_cxx ())
4077 record_builtin_type (RID_MAX
, "long long unsigned",
4078 long_long_unsigned_type_node
);
4079 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4080 record_builtin_type (RID_MAX
, "short unsigned int",
4081 short_unsigned_type_node
);
4082 if (c_dialect_cxx ())
4083 record_builtin_type (RID_MAX
, "unsigned short",
4084 short_unsigned_type_node
);
4086 /* Define both `signed char' and `unsigned char'. */
4087 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4088 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4090 /* These are types that c_common_type_for_size and
4091 c_common_type_for_mode use. */
4092 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4094 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4096 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4098 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4100 #if HOST_BITS_PER_WIDE_INT >= 64
4101 if (targetm
.scalar_mode_supported_p (TImode
))
4102 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4103 get_identifier ("__int128_t"),
4106 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4107 unsigned_intQI_type_node
));
4108 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4109 unsigned_intHI_type_node
));
4110 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4111 unsigned_intSI_type_node
));
4112 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4113 unsigned_intDI_type_node
));
4114 #if HOST_BITS_PER_WIDE_INT >= 64
4115 if (targetm
.scalar_mode_supported_p (TImode
))
4116 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4117 get_identifier ("__uint128_t"),
4118 unsigned_intTI_type_node
));
4121 /* Create the widest literal types. */
4122 widest_integer_literal_type_node
4123 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
4124 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4125 widest_integer_literal_type_node
));
4127 widest_unsigned_literal_type_node
4128 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
4129 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4130 widest_unsigned_literal_type_node
));
4132 /* `unsigned long' is the standard type for sizeof.
4133 Note that stddef.h uses `unsigned long',
4134 and this must agree, even if long and int are the same size. */
4136 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
4137 signed_size_type_node
= c_common_signed_type (size_type_node
);
4138 set_sizetype (size_type_node
);
4141 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4143 build_common_tree_nodes_2 (flag_short_double
);
4145 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4146 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4147 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4149 /* Only supported decimal floating point extension if the target
4150 actually supports underlying modes. */
4151 if (targetm
.scalar_mode_supported_p (SDmode
)
4152 && targetm
.scalar_mode_supported_p (DDmode
)
4153 && targetm
.scalar_mode_supported_p (TDmode
))
4155 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4156 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4157 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4160 if (targetm
.fixed_point_supported_p ())
4162 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4163 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4164 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4165 record_builtin_type (RID_MAX
, "long long _Fract",
4166 long_long_fract_type_node
);
4167 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4168 unsigned_short_fract_type_node
);
4169 record_builtin_type (RID_MAX
, "unsigned _Fract",
4170 unsigned_fract_type_node
);
4171 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4172 unsigned_long_fract_type_node
);
4173 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4174 unsigned_long_long_fract_type_node
);
4175 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4176 sat_short_fract_type_node
);
4177 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4178 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4179 sat_long_fract_type_node
);
4180 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4181 sat_long_long_fract_type_node
);
4182 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4183 sat_unsigned_short_fract_type_node
);
4184 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4185 sat_unsigned_fract_type_node
);
4186 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4187 sat_unsigned_long_fract_type_node
);
4188 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4189 sat_unsigned_long_long_fract_type_node
);
4190 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4191 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4192 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4193 record_builtin_type (RID_MAX
, "long long _Accum",
4194 long_long_accum_type_node
);
4195 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4196 unsigned_short_accum_type_node
);
4197 record_builtin_type (RID_MAX
, "unsigned _Accum",
4198 unsigned_accum_type_node
);
4199 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4200 unsigned_long_accum_type_node
);
4201 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4202 unsigned_long_long_accum_type_node
);
4203 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4204 sat_short_accum_type_node
);
4205 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4206 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4207 sat_long_accum_type_node
);
4208 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4209 sat_long_long_accum_type_node
);
4210 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4211 sat_unsigned_short_accum_type_node
);
4212 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4213 sat_unsigned_accum_type_node
);
4214 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4215 sat_unsigned_long_accum_type_node
);
4216 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4217 sat_unsigned_long_long_accum_type_node
);
4221 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4222 get_identifier ("complex int"),
4223 complex_integer_type_node
));
4224 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4225 get_identifier ("complex float"),
4226 complex_float_type_node
));
4227 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4228 get_identifier ("complex double"),
4229 complex_double_type_node
));
4230 lang_hooks
.decls
.pushdecl
4231 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
4232 complex_long_double_type_node
));
4234 if (c_dialect_cxx ())
4235 /* For C++, make fileptr_type_node a distinct void * type until
4236 FILE type is defined. */
4237 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4239 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4241 /* Set the TYPE_NAME for any variants that were built before
4242 record_builtin_type gave names to the built-in types. */
4244 tree void_name
= TYPE_NAME (void_type_node
);
4245 TYPE_NAME (void_type_node
) = NULL_TREE
;
4246 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4248 TYPE_NAME (void_type_node
) = void_name
;
4251 /* This node must not be shared. */
4252 void_zero_node
= make_node (INTEGER_CST
);
4253 TREE_TYPE (void_zero_node
) = void_type_node
;
4255 void_list_node
= build_void_list_node ();
4257 /* Make a type to be the domain of a few array types
4258 whose domains don't really matter.
4259 200 is small enough that it always fits in size_t
4260 and large enough that it can hold most function names for the
4261 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4262 array_domain_type
= build_index_type (size_int (200));
4264 /* Make a type for arrays of characters.
4265 With luck nothing will ever really depend on the length of this
4267 char_array_type_node
4268 = build_array_type (char_type_node
, array_domain_type
);
4270 /* Likewise for arrays of ints. */
4272 = build_array_type (integer_type_node
, array_domain_type
);
4274 string_type_node
= build_pointer_type (char_type_node
);
4275 const_string_type_node
4276 = build_pointer_type (build_qualified_type
4277 (char_type_node
, TYPE_QUAL_CONST
));
4279 /* This is special for C++ so functions can be overloaded. */
4280 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4281 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4282 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4283 if (c_dialect_cxx ())
4285 if (TYPE_UNSIGNED (wchar_type_node
))
4286 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4288 wchar_type_node
= make_signed_type (wchar_type_size
);
4289 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4293 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
4294 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
4297 /* This is for wide string constants. */
4298 wchar_array_type_node
4299 = build_array_type (wchar_type_node
, array_domain_type
);
4301 /* Define 'char16_t'. */
4302 char16_type_node
= get_identifier (CHAR16_TYPE
);
4303 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4304 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4305 if (c_dialect_cxx ())
4307 char16_type_node
= make_unsigned_type (char16_type_size
);
4309 if (cxx_dialect
== cxx0x
)
4310 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4313 /* This is for UTF-16 string constants. */
4314 char16_array_type_node
4315 = build_array_type (char16_type_node
, array_domain_type
);
4317 /* Define 'char32_t'. */
4318 char32_type_node
= get_identifier (CHAR32_TYPE
);
4319 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4320 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4321 if (c_dialect_cxx ())
4323 char32_type_node
= make_unsigned_type (char32_type_size
);
4325 if (cxx_dialect
== cxx0x
)
4326 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4329 /* This is for UTF-32 string constants. */
4330 char32_array_type_node
4331 = build_array_type (char32_type_node
, array_domain_type
);
4334 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4337 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4339 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4341 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
4343 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
4344 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
4346 lang_hooks
.decls
.pushdecl
4347 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
4348 va_list_type_node
));
4349 #ifdef TARGET_ENUM_VA_LIST
4354 for (l
= 0; TARGET_ENUM_VA_LIST (l
, &pname
, &ptype
); ++l
)
4356 lang_hooks
.decls
.pushdecl
4357 (build_decl (TYPE_DECL
, get_identifier (pname
),
4364 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4366 va_list_arg_type_node
= va_list_ref_type_node
=
4367 build_pointer_type (TREE_TYPE (va_list_type_node
));
4371 va_list_arg_type_node
= va_list_type_node
;
4372 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
4375 if (!flag_preprocess_only
)
4376 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
4378 main_identifier_node
= get_identifier ("main");
4380 /* Create the built-in __null node. It is important that this is
4382 null_node
= make_node (INTEGER_CST
);
4383 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
4385 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4386 memset (builtin_types
, 0, sizeof (builtin_types
));
4389 /* Look up the function in built_in_decls that corresponds to DECL
4390 and set ASMSPEC as its user assembler name. DECL must be a
4391 function decl that declares a builtin. */
4394 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
4397 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
4398 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
4401 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
4402 set_user_assembler_name (builtin
, asmspec
);
4403 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
4404 init_block_move_fn (asmspec
);
4405 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
4406 init_block_clear_fn (asmspec
);
4409 /* The number of named compound-literals generated thus far. */
4410 static GTY(()) int compound_literal_number
;
4412 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4415 set_compound_literal_name (tree decl
)
4418 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
4419 compound_literal_number
);
4420 compound_literal_number
++;
4421 DECL_NAME (decl
) = get_identifier (name
);
4425 build_va_arg (tree expr
, tree type
)
4427 return build1 (VA_ARG_EXPR
, type
, expr
);
4431 /* Linked list of disabled built-in functions. */
4433 typedef struct disabled_builtin
4436 struct disabled_builtin
*next
;
4438 static disabled_builtin
*disabled_builtins
= NULL
;
4440 static bool builtin_function_disabled_p (const char *);
4442 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4443 begins with "__builtin_", give an error. */
4446 disable_builtin_function (const char *name
)
4448 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
4449 error ("cannot disable built-in function %qs", name
);
4452 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
4453 new_disabled_builtin
->name
= name
;
4454 new_disabled_builtin
->next
= disabled_builtins
;
4455 disabled_builtins
= new_disabled_builtin
;
4460 /* Return true if the built-in function NAME has been disabled, false
4464 builtin_function_disabled_p (const char *name
)
4466 disabled_builtin
*p
;
4467 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
4469 if (strcmp (name
, p
->name
) == 0)
4476 /* Worker for DEF_BUILTIN.
4477 Possibly define a builtin function with one or two names.
4478 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4479 nonansi_p and flag_no_nonansi_builtin. */
4482 def_builtin_1 (enum built_in_function fncode
,
4484 enum built_in_class fnclass
,
4485 tree fntype
, tree libtype
,
4486 bool both_p
, bool fallback_p
, bool nonansi_p
,
4487 tree fnattrs
, bool implicit_p
)
4490 const char *libname
;
4492 if (fntype
== error_mark_node
)
4495 gcc_assert ((!both_p
&& !fallback_p
)
4496 || !strncmp (name
, "__builtin_",
4497 strlen ("__builtin_")));
4499 libname
= name
+ strlen ("__builtin_");
4500 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
4501 (fallback_p
? libname
: NULL
),
4504 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
4505 && !(nonansi_p
&& flag_no_nonansi_builtin
))
4506 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
4509 built_in_decls
[(int) fncode
] = decl
;
4511 implicit_built_in_decls
[(int) fncode
] = decl
;
4514 /* Nonzero if the type T promotes to int. This is (nearly) the
4515 integral promotions defined in ISO C99 6.3.1.1/2. */
4518 c_promoting_integer_type_p (const_tree t
)
4520 switch (TREE_CODE (t
))
4523 return (TYPE_MAIN_VARIANT (t
) == char_type_node
4524 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
4525 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
4526 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
4527 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
4528 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
4531 /* ??? Technically all enumerations not larger than an int
4532 promote to an int. But this is used along code paths
4533 that only want to notice a size change. */
4534 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
4544 /* Return 1 if PARMS specifies a fixed number of parameters
4545 and none of their types is affected by default promotions. */
4548 self_promoting_args_p (const_tree parms
)
4551 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
4553 tree type
= TREE_VALUE (t
);
4555 if (type
== error_mark_node
)
4558 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
4564 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
4567 if (c_promoting_integer_type_p (type
))
4573 /* Recursively remove any '*' or '&' operator from TYPE. */
4575 strip_pointer_operator (tree t
)
4577 while (POINTER_TYPE_P (t
))
4582 /* Recursively remove pointer or array type from TYPE. */
4584 strip_pointer_or_array_types (tree t
)
4586 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
4591 /* Used to compare case labels. K1 and K2 are actually tree nodes
4592 representing case labels, or NULL_TREE for a `default' label.
4593 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4594 K2, and 0 if K1 and K2 are equal. */
4597 case_compare (splay_tree_key k1
, splay_tree_key k2
)
4599 /* Consider a NULL key (such as arises with a `default' label) to be
4600 smaller than anything else. */
4606 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4609 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
4610 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
4611 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
4612 case label was declared using the usual C/C++ syntax, rather than
4613 the GNU case range extension. CASES is a tree containing all the
4614 case ranges processed so far; COND is the condition for the
4615 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
4616 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4619 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
4620 tree low_value
, tree high_value
)
4625 splay_tree_node node
;
4627 /* Create the LABEL_DECL itself. */
4628 label
= create_artificial_label ();
4630 /* If there was an error processing the switch condition, bail now
4631 before we get more confused. */
4632 if (!cond
|| cond
== error_mark_node
)
4635 if ((low_value
&& TREE_TYPE (low_value
)
4636 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4637 || (high_value
&& TREE_TYPE (high_value
)
4638 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4640 error ("pointers are not permitted as case values");
4644 /* Case ranges are a GNU extension. */
4646 pedwarn (input_location
, OPT_pedantic
,
4647 "range expressions in switch statements are non-standard");
4649 type
= TREE_TYPE (cond
);
4652 low_value
= check_case_value (low_value
);
4653 low_value
= convert_and_check (type
, low_value
);
4654 if (low_value
== error_mark_node
)
4659 high_value
= check_case_value (high_value
);
4660 high_value
= convert_and_check (type
, high_value
);
4661 if (high_value
== error_mark_node
)
4665 if (low_value
&& high_value
)
4667 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4668 really a case range, even though it was written that way.
4669 Remove the HIGH_VALUE to simplify later processing. */
4670 if (tree_int_cst_equal (low_value
, high_value
))
4671 high_value
= NULL_TREE
;
4672 else if (!tree_int_cst_lt (low_value
, high_value
))
4673 warning (0, "empty range specified");
4676 /* See if the case is in range of the type of the original testing
4677 expression. If both low_value and high_value are out of range,
4678 don't insert the case label and return NULL_TREE. */
4680 && !check_case_bounds (type
, orig_type
,
4681 &low_value
, high_value
? &high_value
: NULL
))
4684 /* Look up the LOW_VALUE in the table of case labels we already
4686 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4687 /* If there was not an exact match, check for overlapping ranges.
4688 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4689 that's a `default' label and the only overlap is an exact match. */
4690 if (!node
&& (low_value
|| high_value
))
4692 splay_tree_node low_bound
;
4693 splay_tree_node high_bound
;
4695 /* Even though there wasn't an exact match, there might be an
4696 overlap between this case range and another case range.
4697 Since we've (inductively) not allowed any overlapping case
4698 ranges, we simply need to find the greatest low case label
4699 that is smaller that LOW_VALUE, and the smallest low case
4700 label that is greater than LOW_VALUE. If there is an overlap
4701 it will occur in one of these two ranges. */
4702 low_bound
= splay_tree_predecessor (cases
,
4703 (splay_tree_key
) low_value
);
4704 high_bound
= splay_tree_successor (cases
,
4705 (splay_tree_key
) low_value
);
4707 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4708 the LOW_VALUE, so there is no need to check unless the
4709 LOW_BOUND is in fact itself a case range. */
4711 && CASE_HIGH ((tree
) low_bound
->value
)
4712 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4715 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4716 range is bigger than the low end of the current range, so we
4717 are only interested if the current range is a real range, and
4718 not an ordinary case label. */
4721 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4726 /* If there was an overlap, issue an error. */
4729 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4733 error ("duplicate (or overlapping) case value");
4734 error ("%Jthis is the first entry overlapping that value", duplicate
);
4738 error ("duplicate case value") ;
4739 error ("%Jpreviously used here", duplicate
);
4743 error ("multiple default labels in one switch");
4744 error ("%Jthis is the first default label", duplicate
);
4749 /* Add a CASE_LABEL to the statement-tree. */
4750 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4751 /* Register this case label in the splay tree. */
4752 splay_tree_insert (cases
,
4753 (splay_tree_key
) low_value
,
4754 (splay_tree_value
) case_label
);
4759 /* Add a label so that the back-end doesn't think that the beginning of
4760 the switch is unreachable. Note that we do not add a case label, as
4761 that just leads to duplicates and thence to failure later on. */
4764 tree t
= create_artificial_label ();
4765 add_stmt (build_stmt (LABEL_EXPR
, t
));
4767 return error_mark_node
;
4770 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4771 Used to verify that case values match up with enumerator values. */
4774 match_case_to_enum_1 (tree key
, tree type
, tree label
)
4776 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
4778 /* ??? Not working too hard to print the double-word value.
4779 Should perhaps be done with %lwd in the diagnostic routines? */
4780 if (TREE_INT_CST_HIGH (key
) == 0)
4781 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
4782 TREE_INT_CST_LOW (key
));
4783 else if (!TYPE_UNSIGNED (type
)
4784 && TREE_INT_CST_HIGH (key
) == -1
4785 && TREE_INT_CST_LOW (key
) != 0)
4786 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
4787 -TREE_INT_CST_LOW (key
));
4789 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
4790 (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (key
),
4791 (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (key
));
4793 if (TYPE_NAME (type
) == 0)
4794 warning (warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
4795 "%Jcase value %qs not in enumerated type",
4796 CASE_LABEL (label
), buf
);
4798 warning (warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
4799 "%Jcase value %qs not in enumerated type %qT",
4800 CASE_LABEL (label
), buf
, type
);
4803 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4804 Used to verify that case values match up with enumerator values. */
4807 match_case_to_enum (splay_tree_node node
, void *data
)
4809 tree label
= (tree
) node
->value
;
4810 tree type
= (tree
) data
;
4812 /* Skip default case. */
4813 if (!CASE_LOW (label
))
4816 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4817 when we did our enum->case scan. Reset our scratch bit after. */
4818 if (!CASE_LOW_SEEN (label
))
4819 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
4821 CASE_LOW_SEEN (label
) = 0;
4823 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4824 not set, that means that CASE_HIGH did not appear when we did our
4825 enum->case scan. Reset our scratch bit after. */
4826 if (CASE_HIGH (label
))
4828 if (!CASE_HIGH_SEEN (label
))
4829 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
4831 CASE_HIGH_SEEN (label
) = 0;
4837 /* Handle -Wswitch*. Called from the front end after parsing the
4838 switch construct. */
4839 /* ??? Should probably be somewhere generic, since other languages
4840 besides C and C++ would want this. At the moment, however, C/C++
4841 are the only tree-ssa languages that support enumerations at all,
4842 so the point is moot. */
4845 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
4846 tree type
, tree cond
)
4848 splay_tree_node default_node
;
4849 splay_tree_node node
;
4851 int saved_warn_switch
;
4853 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
4856 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
4858 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
4861 /* From here on, we only care about about enumerated types. */
4862 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
4865 /* If the switch expression was an enumerated type, check that
4866 exactly all enumeration literals are covered by the cases.
4867 The check is made when -Wswitch was specified and there is no
4868 default case, or when -Wswitch-enum was specified. */
4870 if (!warn_switch_enum
4871 && !(warn_switch
&& !default_node
))
4874 /* Clearing COND if it is not an integer constant simplifies
4875 the tests inside the loop below. */
4876 if (TREE_CODE (cond
) != INTEGER_CST
)
4879 /* The time complexity here is O(N*lg(N)) worst case, but for the
4880 common case of monotonically increasing enumerators, it is
4881 O(N), since the nature of the splay tree will keep the next
4882 element adjacent to the root at all times. */
4884 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
4886 tree value
= TREE_VALUE (chain
);
4887 if (TREE_CODE (value
) == CONST_DECL
)
4888 value
= DECL_INITIAL (value
);
4889 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
4892 /* Mark the CASE_LOW part of the case entry as seen. */
4893 tree label
= (tree
) node
->value
;
4894 CASE_LOW_SEEN (label
) = 1;
4898 /* Even though there wasn't an exact match, there might be a
4899 case range which includes the enumerator's value. */
4900 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
4901 if (node
&& CASE_HIGH ((tree
) node
->value
))
4903 tree label
= (tree
) node
->value
;
4904 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
4907 /* If we match the upper bound exactly, mark the CASE_HIGH
4908 part of the case entry as seen. */
4910 CASE_HIGH_SEEN (label
) = 1;
4915 /* We've now determined that this enumerated literal isn't
4916 handled by the case labels of the switch statement. */
4918 /* If the switch expression is a constant, we only really care
4919 about whether that constant is handled by the switch. */
4920 if (cond
&& tree_int_cst_compare (cond
, value
))
4923 /* If there is a default_node, the only relevant option is
4924 Wswitch-enum. Otherwise, if both are enabled then we prefer
4925 to warn using -Wswitch because -Wswitch is enabled by -Wall
4926 while -Wswitch-enum is explicit. */
4927 warning ((default_node
|| !warn_switch
)
4928 ? OPT_Wswitch_enum
: OPT_Wswitch
,
4929 "%Henumeration value %qE not handled in switch",
4930 &switch_location
, TREE_PURPOSE (chain
));
4933 /* Warn if there are case expressions that don't correspond to
4934 enumerators. This can occur since C and C++ don't enforce
4935 type-checking of assignments to enumeration variables.
4937 The time complexity here is now always O(N) worst case, since
4938 we should have marked both the lower bound and upper bound of
4939 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4940 above. This scan also resets those fields. */
4942 /* If there is a default_node, the only relevant option is
4943 Wswitch-enum. Otherwise, if both are enabled then we prefer
4944 to warn using -Wswitch because -Wswitch is enabled by -Wall
4945 while -Wswitch-enum is explicit. */
4946 saved_warn_switch
= warn_switch
;
4949 splay_tree_foreach (cases
, match_case_to_enum
, type
);
4950 warn_switch
= saved_warn_switch
;
4954 /* Finish an expression taking the address of LABEL (an
4955 IDENTIFIER_NODE). Returns an expression for the address.
4957 LOC is the location for the expression returned. */
4960 finish_label_address_expr (tree label
, location_t loc
)
4964 pedwarn (input_location
, OPT_pedantic
, "taking the address of a label is non-standard");
4966 if (label
== error_mark_node
)
4967 return error_mark_node
;
4969 label
= lookup_label (label
);
4970 if (label
== NULL_TREE
)
4971 result
= null_pointer_node
;
4974 TREE_USED (label
) = 1;
4975 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4976 /* The current function in not necessarily uninlinable.
4977 Computed gotos are incompatible with inlining, but the value
4978 here could be used only in a diagnostic, for example. */
4979 protected_set_expr_location (result
, loc
);
4985 /* Hook used by expand_expr to expand language-specific tree codes. */
4986 /* The only things that should go here are bits needed to expand
4987 constant initializers. Everything else should be handled by the
4988 gimplification routines. */
4991 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
4992 int modifiera
/* Actually enum expand_modifier. */,
4995 enum expand_modifier modifier
= (enum expand_modifier
) modifiera
;
4996 switch (TREE_CODE (exp
))
4998 case COMPOUND_LITERAL_EXPR
:
5000 /* Initialize the anonymous variable declared in the compound
5001 literal, then return the variable. */
5002 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
5003 emit_local_var (decl
);
5004 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
5012 /* Hook used by staticp to handle language-specific tree codes. */
5015 c_staticp (tree exp
)
5017 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
5018 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
5023 /* Given a boolean expression ARG, return a tree representing an increment
5024 or decrement (as indicated by CODE) of ARG. The front end must check for
5025 invalid cases (e.g., decrement in C++). */
5027 boolean_increment (enum tree_code code
, tree arg
)
5030 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
5032 arg
= stabilize_reference (arg
);
5035 case PREINCREMENT_EXPR
:
5036 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5038 case POSTINCREMENT_EXPR
:
5039 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5040 arg
= save_expr (arg
);
5041 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5042 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5044 case PREDECREMENT_EXPR
:
5045 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5046 invert_truthvalue (arg
));
5048 case POSTDECREMENT_EXPR
:
5049 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5050 invert_truthvalue (arg
));
5051 arg
= save_expr (arg
);
5052 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5053 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5058 TREE_SIDE_EFFECTS (val
) = 1;
5062 /* Built-in macros for stddef.h, that require macros defined in this
5065 c_stddef_cpp_builtins(void)
5067 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
5068 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
5069 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
5070 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
5071 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
5072 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
5073 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
5074 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
5078 c_init_attributes (void)
5080 /* Fill in the built_in_attributes array. */
5081 #define DEF_ATTR_NULL_TREE(ENUM) \
5082 built_in_attributes[(int) ENUM] = NULL_TREE;
5083 #define DEF_ATTR_INT(ENUM, VALUE) \
5084 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5085 #define DEF_ATTR_IDENT(ENUM, STRING) \
5086 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5087 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5088 built_in_attributes[(int) ENUM] \
5089 = tree_cons (built_in_attributes[(int) PURPOSE], \
5090 built_in_attributes[(int) VALUE], \
5091 built_in_attributes[(int) CHAIN]);
5092 #include "builtin-attrs.def"
5093 #undef DEF_ATTR_NULL_TREE
5095 #undef DEF_ATTR_IDENT
5096 #undef DEF_ATTR_TREE_LIST
5099 /* Attribute handlers common to C front ends. */
5101 /* Handle a "packed" attribute; arguments as in
5102 struct attribute_spec.handler. */
5105 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5106 int flags
, bool *no_add_attrs
)
5110 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5111 *node
= build_variant_type_copy (*node
);
5112 TYPE_PACKED (*node
) = 1;
5114 else if (TREE_CODE (*node
) == FIELD_DECL
)
5116 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
)
5117 warning (OPT_Wattributes
,
5118 "%qE attribute ignored for field of type %qT",
5119 name
, TREE_TYPE (*node
));
5121 DECL_PACKED (*node
) = 1;
5123 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5124 used for DECL_REGISTER. It wouldn't mean anything anyway.
5125 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5126 that changes what the typedef is typing. */
5129 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5130 *no_add_attrs
= true;
5136 /* Handle a "nocommon" attribute; arguments as in
5137 struct attribute_spec.handler. */
5140 handle_nocommon_attribute (tree
*node
, tree name
,
5141 tree
ARG_UNUSED (args
),
5142 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5144 if (TREE_CODE (*node
) == VAR_DECL
)
5145 DECL_COMMON (*node
) = 0;
5148 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5149 *no_add_attrs
= true;
5155 /* Handle a "common" attribute; arguments as in
5156 struct attribute_spec.handler. */
5159 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5160 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5162 if (TREE_CODE (*node
) == VAR_DECL
)
5163 DECL_COMMON (*node
) = 1;
5166 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5167 *no_add_attrs
= true;
5173 /* Handle a "noreturn" attribute; arguments as in
5174 struct attribute_spec.handler. */
5177 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5178 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5180 tree type
= TREE_TYPE (*node
);
5182 /* See FIXME comment in c_common_attribute_table. */
5183 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5184 TREE_THIS_VOLATILE (*node
) = 1;
5185 else if (TREE_CODE (type
) == POINTER_TYPE
5186 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5188 = build_pointer_type
5189 (build_type_variant (TREE_TYPE (type
),
5190 TYPE_READONLY (TREE_TYPE (type
)), 1));
5193 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5194 *no_add_attrs
= true;
5200 /* Handle a "hot" and attribute; arguments as in
5201 struct attribute_spec.handler. */
5204 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5205 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5207 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5209 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
5211 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5213 *no_add_attrs
= true;
5215 /* Most of the rest of the hot processing is done later with
5216 lookup_attribute. */
5220 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5221 *no_add_attrs
= true;
5226 /* Handle a "cold" and attribute; arguments as in
5227 struct attribute_spec.handler. */
5230 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5231 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5233 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5235 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
5237 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5239 *no_add_attrs
= true;
5241 /* Most of the rest of the cold processing is done later with
5242 lookup_attribute. */
5246 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5247 *no_add_attrs
= true;
5253 /* Handle a "noinline" attribute; arguments as in
5254 struct attribute_spec.handler. */
5257 handle_noinline_attribute (tree
*node
, tree name
,
5258 tree
ARG_UNUSED (args
),
5259 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5261 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5262 DECL_UNINLINABLE (*node
) = 1;
5265 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5266 *no_add_attrs
= true;
5272 /* Handle a "always_inline" attribute; arguments as in
5273 struct attribute_spec.handler. */
5276 handle_always_inline_attribute (tree
*node
, tree name
,
5277 tree
ARG_UNUSED (args
),
5278 int ARG_UNUSED (flags
),
5281 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5283 /* Set the attribute and mark it for disregarding inline
5285 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
5289 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5290 *no_add_attrs
= true;
5296 /* Handle a "gnu_inline" attribute; arguments as in
5297 struct attribute_spec.handler. */
5300 handle_gnu_inline_attribute (tree
*node
, tree name
,
5301 tree
ARG_UNUSED (args
),
5302 int ARG_UNUSED (flags
),
5305 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
5307 /* Do nothing else, just set the attribute. We'll get at
5308 it later with lookup_attribute. */
5312 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5313 *no_add_attrs
= true;
5319 /* Handle an "artificial" attribute; arguments as in
5320 struct attribute_spec.handler. */
5323 handle_artificial_attribute (tree
*node
, tree name
,
5324 tree
ARG_UNUSED (args
),
5325 int ARG_UNUSED (flags
),
5328 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
5330 /* Do nothing else, just set the attribute. We'll get at
5331 it later with lookup_attribute. */
5335 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5336 *no_add_attrs
= true;
5342 /* Handle a "flatten" attribute; arguments as in
5343 struct attribute_spec.handler. */
5346 handle_flatten_attribute (tree
*node
, tree name
,
5347 tree args ATTRIBUTE_UNUSED
,
5348 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5350 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5351 /* Do nothing else, just set the attribute. We'll get at
5352 it later with lookup_attribute. */
5356 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5357 *no_add_attrs
= true;
5363 /* Handle a "warning" or "error" attribute; arguments as in
5364 struct attribute_spec.handler. */
5367 handle_error_attribute (tree
*node
, tree name
, tree args
,
5368 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5370 if (TREE_CODE (*node
) == FUNCTION_DECL
5371 || TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5372 /* Do nothing else, just set the attribute. We'll get at
5373 it later with lookup_attribute. */
5377 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5378 *no_add_attrs
= true;
5384 /* Handle a "used" attribute; arguments as in
5385 struct attribute_spec.handler. */
5388 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
5389 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5393 if (TREE_CODE (node
) == FUNCTION_DECL
5394 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
5396 TREE_USED (node
) = 1;
5397 DECL_PRESERVE_P (node
) = 1;
5401 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5402 *no_add_attrs
= true;
5408 /* Handle a "unused" attribute; arguments as in
5409 struct attribute_spec.handler. */
5412 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5413 int flags
, bool *no_add_attrs
)
5419 if (TREE_CODE (decl
) == PARM_DECL
5420 || TREE_CODE (decl
) == VAR_DECL
5421 || TREE_CODE (decl
) == FUNCTION_DECL
5422 || TREE_CODE (decl
) == LABEL_DECL
5423 || TREE_CODE (decl
) == TYPE_DECL
)
5424 TREE_USED (decl
) = 1;
5427 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5428 *no_add_attrs
= true;
5433 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5434 *node
= build_variant_type_copy (*node
);
5435 TREE_USED (*node
) = 1;
5441 /* Handle a "externally_visible" attribute; arguments as in
5442 struct attribute_spec.handler. */
5445 handle_externally_visible_attribute (tree
*pnode
, tree name
,
5446 tree
ARG_UNUSED (args
),
5447 int ARG_UNUSED (flags
),
5452 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
5454 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
5455 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
5457 warning (OPT_Wattributes
,
5458 "%qE attribute have effect only on public objects", name
);
5459 *no_add_attrs
= true;
5464 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5465 *no_add_attrs
= true;
5471 /* Handle a "const" attribute; arguments as in
5472 struct attribute_spec.handler. */
5475 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5476 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5478 tree type
= TREE_TYPE (*node
);
5480 /* See FIXME comment on noreturn in c_common_attribute_table. */
5481 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5482 TREE_READONLY (*node
) = 1;
5483 else if (TREE_CODE (type
) == POINTER_TYPE
5484 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5486 = build_pointer_type
5487 (build_type_variant (TREE_TYPE (type
), 1,
5488 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
5491 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5492 *no_add_attrs
= true;
5498 /* Handle a "transparent_union" attribute; arguments as in
5499 struct attribute_spec.handler. */
5502 handle_transparent_union_attribute (tree
*node
, tree name
,
5503 tree
ARG_UNUSED (args
), int flags
,
5508 *no_add_attrs
= true;
5510 if (TREE_CODE (*node
) == TYPE_DECL
)
5511 node
= &TREE_TYPE (*node
);
5514 if (TREE_CODE (type
) == UNION_TYPE
)
5516 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
5517 the code in finish_struct. */
5518 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5520 if (TYPE_FIELDS (type
) == NULL_TREE
5521 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
5524 /* A type variant isn't good enough, since we don't a cast
5525 to such a type removed as a no-op. */
5526 *node
= type
= build_duplicate_type (type
);
5529 TYPE_TRANSPARENT_UNION (type
) = 1;
5534 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5538 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
5539 get the requested priority for a constructor or destructor,
5540 possibly issuing diagnostics for invalid or reserved
5543 static priority_type
5544 get_priority (tree args
, bool is_destructor
)
5550 return DEFAULT_INIT_PRIORITY
;
5552 if (!SUPPORTS_INIT_PRIORITY
)
5555 error ("destructor priorities are not supported");
5557 error ("constructor priorities are not supported");
5558 return DEFAULT_INIT_PRIORITY
;
5561 arg
= TREE_VALUE (args
);
5562 if (!host_integerp (arg
, /*pos=*/0)
5563 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5566 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
5567 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
5570 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
5574 "destructor priorities from 0 to %d are reserved "
5575 "for the implementation",
5576 MAX_RESERVED_INIT_PRIORITY
);
5579 "constructor priorities from 0 to %d are reserved "
5580 "for the implementation",
5581 MAX_RESERVED_INIT_PRIORITY
);
5587 error ("destructor priorities must be integers from 0 to %d inclusive",
5590 error ("constructor priorities must be integers from 0 to %d inclusive",
5592 return DEFAULT_INIT_PRIORITY
;
5595 /* Handle a "constructor" attribute; arguments as in
5596 struct attribute_spec.handler. */
5599 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
5600 int ARG_UNUSED (flags
),
5604 tree type
= TREE_TYPE (decl
);
5606 if (TREE_CODE (decl
) == FUNCTION_DECL
5607 && TREE_CODE (type
) == FUNCTION_TYPE
5608 && decl_function_context (decl
) == 0)
5610 priority_type priority
;
5611 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
5612 priority
= get_priority (args
, /*is_destructor=*/false);
5613 SET_DECL_INIT_PRIORITY (decl
, priority
);
5614 TREE_USED (decl
) = 1;
5618 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5619 *no_add_attrs
= true;
5625 /* Handle a "destructor" attribute; arguments as in
5626 struct attribute_spec.handler. */
5629 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
5630 int ARG_UNUSED (flags
),
5634 tree type
= TREE_TYPE (decl
);
5636 if (TREE_CODE (decl
) == FUNCTION_DECL
5637 && TREE_CODE (type
) == FUNCTION_TYPE
5638 && decl_function_context (decl
) == 0)
5640 priority_type priority
;
5641 DECL_STATIC_DESTRUCTOR (decl
) = 1;
5642 priority
= get_priority (args
, /*is_destructor=*/true);
5643 SET_DECL_FINI_PRIORITY (decl
, priority
);
5644 TREE_USED (decl
) = 1;
5648 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5649 *no_add_attrs
= true;
5655 /* Handle a "mode" attribute; arguments as in
5656 struct attribute_spec.handler. */
5659 handle_mode_attribute (tree
*node
, tree name
, tree args
,
5660 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5664 *no_add_attrs
= true;
5666 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
5667 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5671 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
5672 int len
= strlen (p
);
5673 enum machine_mode mode
= VOIDmode
;
5677 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
5678 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
5680 char *newp
= (char *) alloca (len
- 1);
5682 strcpy (newp
, &p
[2]);
5683 newp
[len
- 4] = '\0';
5687 /* Change this type to have a type with the specified mode.
5688 First check for the special modes. */
5689 if (!strcmp (p
, "byte"))
5691 else if (!strcmp (p
, "word"))
5693 else if (!strcmp (p
, "pointer"))
5695 else if (!strcmp (p
, "libgcc_cmp_return"))
5696 mode
= targetm
.libgcc_cmp_return_mode ();
5697 else if (!strcmp (p
, "libgcc_shift_count"))
5698 mode
= targetm
.libgcc_shift_count_mode ();
5699 else if (!strcmp (p
, "unwind_word"))
5700 mode
= targetm
.unwind_word_mode ();
5702 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
5703 if (!strcmp (p
, GET_MODE_NAME (j
)))
5705 mode
= (enum machine_mode
) j
;
5709 if (mode
== VOIDmode
)
5711 error ("unknown machine mode %qs", p
);
5716 switch (GET_MODE_CLASS (mode
))
5719 case MODE_PARTIAL_INT
:
5721 case MODE_DECIMAL_FLOAT
:
5726 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
5729 case MODE_COMPLEX_INT
:
5730 case MODE_COMPLEX_FLOAT
:
5731 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
5734 case MODE_VECTOR_INT
:
5735 case MODE_VECTOR_FLOAT
:
5736 case MODE_VECTOR_FRACT
:
5737 case MODE_VECTOR_UFRACT
:
5738 case MODE_VECTOR_ACCUM
:
5739 case MODE_VECTOR_UACCUM
:
5740 warning (OPT_Wattributes
, "specifying vector types with "
5741 "__attribute__ ((mode)) is deprecated");
5742 warning (OPT_Wattributes
,
5743 "use __attribute__ ((vector_size)) instead");
5744 valid_mode
= vector_mode_valid_p (mode
);
5752 error ("unable to emulate %qs", p
);
5756 if (POINTER_TYPE_P (type
))
5758 tree (*fn
)(tree
, enum machine_mode
, bool);
5760 if (!targetm
.valid_pointer_mode (mode
))
5762 error ("invalid pointer mode %qs", p
);
5766 if (TREE_CODE (type
) == POINTER_TYPE
)
5767 fn
= build_pointer_type_for_mode
;
5769 fn
= build_reference_type_for_mode
;
5770 typefm
= fn (TREE_TYPE (type
), mode
, false);
5774 /* For fixed-point modes, we need to test if the signness of type
5775 and the machine mode are consistent. */
5776 if (ALL_FIXED_POINT_MODE_P (mode
)
5777 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
5779 error ("signness of type and machine mode %qs don't match", p
);
5782 /* For fixed-point modes, we need to pass saturating info. */
5783 typefm
= lang_hooks
.types
.type_for_mode (mode
,
5784 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
5785 : TYPE_UNSIGNED (type
));
5788 if (typefm
== NULL_TREE
)
5790 error ("no data type for mode %qs", p
);
5793 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5795 /* For enumeral types, copy the precision from the integer
5796 type returned above. If not an INTEGER_TYPE, we can't use
5797 this mode for this type. */
5798 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
5800 error ("cannot use mode %qs for enumeral types", p
);
5804 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
5806 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
5811 /* We cannot build a type variant, as there's code that assumes
5812 that TYPE_MAIN_VARIANT has the same mode. This includes the
5813 debug generators. Instead, create a subrange type. This
5814 results in all of the enumeral values being emitted only once
5815 in the original, and the subtype gets them by reference. */
5816 if (TYPE_UNSIGNED (type
))
5817 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
5819 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
5820 TREE_TYPE (typefm
) = type
;
5823 else if (VECTOR_MODE_P (mode
)
5824 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
5825 : TREE_CODE (type
) != TREE_CODE (typefm
))
5827 error ("mode %qs applied to inappropriate type", p
);
5837 /* Handle a "section" attribute; arguments as in
5838 struct attribute_spec.handler. */
5841 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5842 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5846 if (targetm
.have_named_sections
)
5848 user_defined_section_attribute
= true;
5850 if ((TREE_CODE (decl
) == FUNCTION_DECL
5851 || TREE_CODE (decl
) == VAR_DECL
)
5852 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5854 if (TREE_CODE (decl
) == VAR_DECL
5855 && current_function_decl
!= NULL_TREE
5856 && !TREE_STATIC (decl
))
5858 error ("%Jsection attribute cannot be specified for "
5859 "local variables", decl
);
5860 *no_add_attrs
= true;
5863 /* The decl may have already been given a section attribute
5864 from a previous declaration. Ensure they match. */
5865 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5866 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5867 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5869 error ("section of %q+D conflicts with previous declaration",
5871 *no_add_attrs
= true;
5873 else if (TREE_CODE (decl
) == VAR_DECL
5874 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
5875 && DECL_THREAD_LOCAL_P (decl
))
5877 error ("section of %q+D cannot be overridden", *node
);
5878 *no_add_attrs
= true;
5881 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5885 error ("section attribute not allowed for %q+D", *node
);
5886 *no_add_attrs
= true;
5891 error ("%Jsection attributes are not supported for this target", *node
);
5892 *no_add_attrs
= true;
5898 /* Handle a "aligned" attribute; arguments as in
5899 struct attribute_spec.handler. */
5902 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5903 int flags
, bool *no_add_attrs
)
5905 tree decl
= NULL_TREE
;
5908 tree align_expr
= (args
? TREE_VALUE (args
)
5909 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5915 type
= &TREE_TYPE (decl
);
5916 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5918 else if (TYPE_P (*node
))
5919 type
= node
, is_type
= 1;
5921 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5923 error ("requested alignment is not a constant");
5924 *no_add_attrs
= true;
5926 else if ((i
= tree_log2 (align_expr
)) == -1)
5928 error ("requested alignment is not a power of 2");
5929 *no_add_attrs
= true;
5931 else if (i
> HOST_BITS_PER_INT
- 2)
5933 error ("requested alignment is too large");
5934 *no_add_attrs
= true;
5938 /* If we have a TYPE_DECL, then copy the type, so that we
5939 don't accidentally modify a builtin type. See pushdecl. */
5940 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5941 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5943 tree tt
= TREE_TYPE (decl
);
5944 *type
= build_variant_type_copy (*type
);
5945 DECL_ORIGINAL_TYPE (decl
) = tt
;
5946 TYPE_NAME (*type
) = decl
;
5947 TREE_USED (*type
) = TREE_USED (decl
);
5948 TREE_TYPE (decl
) = *type
;
5950 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5951 *type
= build_variant_type_copy (*type
);
5953 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5954 TYPE_USER_ALIGN (*type
) = 1;
5956 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
5957 && TREE_CODE (decl
) != FIELD_DECL
)
5959 error ("alignment may not be specified for %q+D", decl
);
5960 *no_add_attrs
= true;
5962 else if (TREE_CODE (decl
) == FUNCTION_DECL
5963 && DECL_ALIGN (decl
) > (1 << i
) * BITS_PER_UNIT
)
5965 if (DECL_USER_ALIGN (decl
))
5966 error ("alignment for %q+D was previously specified as %d "
5967 "and may not be decreased", decl
,
5968 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
5970 error ("alignment for %q+D must be at least %d", decl
,
5971 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
5972 *no_add_attrs
= true;
5976 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5977 DECL_USER_ALIGN (decl
) = 1;
5983 /* Handle a "weak" attribute; arguments as in
5984 struct attribute_spec.handler. */
5987 handle_weak_attribute (tree
*node
, tree name
,
5988 tree
ARG_UNUSED (args
),
5989 int ARG_UNUSED (flags
),
5990 bool * ARG_UNUSED (no_add_attrs
))
5992 if (TREE_CODE (*node
) == FUNCTION_DECL
5993 && DECL_DECLARED_INLINE_P (*node
))
5995 error ("inline function %q+D cannot be declared weak", *node
);
5996 *no_add_attrs
= true;
5998 else if (TREE_CODE (*node
) == FUNCTION_DECL
5999 || TREE_CODE (*node
) == VAR_DECL
)
6000 declare_weak (*node
);
6002 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6007 /* Handle an "alias" attribute; arguments as in
6008 struct attribute_spec.handler. */
6011 handle_alias_attribute (tree
*node
, tree name
, tree args
,
6012 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6016 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
6017 || (TREE_CODE (decl
) != FUNCTION_DECL
6018 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
6019 /* A static variable declaration is always a tentative definition,
6020 but the alias is a non-tentative definition which overrides. */
6021 || (TREE_CODE (decl
) != FUNCTION_DECL
6022 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
6024 error ("%q+D defined both normally and as an alias", decl
);
6025 *no_add_attrs
= true;
6028 /* Note that the very first time we process a nested declaration,
6029 decl_function_context will not be set. Indeed, *would* never
6030 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6031 we do below. After such frobbery, pushdecl would set the context.
6032 In any case, this is never what we want. */
6033 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
6037 id
= TREE_VALUE (args
);
6038 if (TREE_CODE (id
) != STRING_CST
)
6040 error ("alias argument not a string");
6041 *no_add_attrs
= true;
6044 id
= get_identifier (TREE_STRING_POINTER (id
));
6045 /* This counts as a use of the object pointed to. */
6048 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6049 DECL_INITIAL (decl
) = error_mark_node
;
6052 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
6053 DECL_EXTERNAL (decl
) = 1;
6055 DECL_EXTERNAL (decl
) = 0;
6056 TREE_STATIC (decl
) = 1;
6061 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6062 *no_add_attrs
= true;
6068 /* Handle a "weakref" attribute; arguments as in struct
6069 attribute_spec.handler. */
6072 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6073 int flags
, bool *no_add_attrs
)
6075 tree attr
= NULL_TREE
;
6077 /* We must ignore the attribute when it is associated with
6078 local-scoped decls, since attribute alias is ignored and many
6079 such symbols do not even have a DECL_WEAK field. */
6080 if (decl_function_context (*node
)
6081 || current_function_decl
6082 || (TREE_CODE (*node
) != VAR_DECL
&& TREE_CODE (*node
) != FUNCTION_DECL
))
6084 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6085 *no_add_attrs
= true;
6089 /* The idea here is that `weakref("name")' mutates into `weakref,
6090 alias("name")', and weakref without arguments, in turn,
6091 implicitly adds weak. */
6095 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
6096 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
6098 *no_add_attrs
= true;
6100 decl_attributes (node
, attr
, flags
);
6104 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
6105 error ("%Jweakref attribute must appear before alias attribute",
6108 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6109 and that isn't supported; and because it wants to add it to
6110 the list of weak decls, which isn't helpful. */
6111 DECL_WEAK (*node
) = 1;
6117 /* Handle an "visibility" attribute; arguments as in
6118 struct attribute_spec.handler. */
6121 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
6122 int ARG_UNUSED (flags
),
6123 bool *ARG_UNUSED (no_add_attrs
))
6126 tree id
= TREE_VALUE (args
);
6127 enum symbol_visibility vis
;
6131 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
6133 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
6135 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
6139 else if (TYPE_FIELDS (*node
))
6141 error ("%qE attribute ignored because %qT is already defined",
6146 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
6148 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6152 if (TREE_CODE (id
) != STRING_CST
)
6154 error ("visibility argument not a string");
6158 /* If this is a type, set the visibility on the type decl. */
6161 decl
= TYPE_NAME (decl
);
6164 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6166 warning (OPT_Wattributes
, "%qE attribute ignored on types",
6172 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
6173 vis
= VISIBILITY_DEFAULT
;
6174 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
6175 vis
= VISIBILITY_INTERNAL
;
6176 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
6177 vis
= VISIBILITY_HIDDEN
;
6178 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
6179 vis
= VISIBILITY_PROTECTED
;
6182 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6183 vis
= VISIBILITY_DEFAULT
;
6186 if (DECL_VISIBILITY_SPECIFIED (decl
)
6187 && vis
!= DECL_VISIBILITY (decl
))
6189 tree attributes
= (TYPE_P (*node
)
6190 ? TYPE_ATTRIBUTES (*node
)
6191 : DECL_ATTRIBUTES (decl
));
6192 if (lookup_attribute ("visibility", attributes
))
6193 error ("%qD redeclared with different visibility", decl
);
6194 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6195 && lookup_attribute ("dllimport", attributes
))
6196 error ("%qD was declared %qs which implies default visibility",
6198 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6199 && lookup_attribute ("dllexport", attributes
))
6200 error ("%qD was declared %qs which implies default visibility",
6204 DECL_VISIBILITY (decl
) = vis
;
6205 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
6207 /* Go ahead and attach the attribute to the node as well. This is needed
6208 so we can determine whether we have VISIBILITY_DEFAULT because the
6209 visibility was not specified, or because it was explicitly overridden
6210 from the containing scope. */
6215 /* Determine the ELF symbol visibility for DECL, which is either a
6216 variable or a function. It is an error to use this function if a
6217 definition of DECL is not available in this translation unit.
6218 Returns true if the final visibility has been determined by this
6219 function; false if the caller is free to make additional
6223 c_determine_visibility (tree decl
)
6225 gcc_assert (TREE_CODE (decl
) == VAR_DECL
6226 || TREE_CODE (decl
) == FUNCTION_DECL
);
6228 /* If the user explicitly specified the visibility with an
6229 attribute, honor that. DECL_VISIBILITY will have been set during
6230 the processing of the attribute. We check for an explicit
6231 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6232 to distinguish the use of an attribute from the use of a "#pragma
6233 GCC visibility push(...)"; in the latter case we still want other
6234 considerations to be able to overrule the #pragma. */
6235 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
6236 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6237 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
6238 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
6241 /* Set default visibility to whatever the user supplied with
6242 visibility_specified depending on #pragma GCC visibility. */
6243 if (!DECL_VISIBILITY_SPECIFIED (decl
))
6245 DECL_VISIBILITY (decl
) = default_visibility
;
6246 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
6251 /* Handle an "tls_model" attribute; arguments as in
6252 struct attribute_spec.handler. */
6255 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
6256 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6260 enum tls_model kind
;
6262 *no_add_attrs
= true;
6264 if (!DECL_THREAD_LOCAL_P (decl
))
6266 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6270 kind
= DECL_TLS_MODEL (decl
);
6271 id
= TREE_VALUE (args
);
6272 if (TREE_CODE (id
) != STRING_CST
)
6274 error ("tls_model argument not a string");
6278 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
6279 kind
= TLS_MODEL_LOCAL_EXEC
;
6280 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
6281 kind
= TLS_MODEL_INITIAL_EXEC
;
6282 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
6283 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
6284 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
6285 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
6287 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
6289 DECL_TLS_MODEL (decl
) = kind
;
6293 /* Handle a "no_instrument_function" attribute; arguments as in
6294 struct attribute_spec.handler. */
6297 handle_no_instrument_function_attribute (tree
*node
, tree name
,
6298 tree
ARG_UNUSED (args
),
6299 int ARG_UNUSED (flags
),
6304 if (TREE_CODE (decl
) != FUNCTION_DECL
)
6306 error ("%J%qE attribute applies only to functions", decl
, name
);
6307 *no_add_attrs
= true;
6309 else if (DECL_INITIAL (decl
))
6311 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
6312 *no_add_attrs
= true;
6315 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
6320 /* Handle a "malloc" attribute; arguments as in
6321 struct attribute_spec.handler. */
6324 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6325 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6327 if (TREE_CODE (*node
) == FUNCTION_DECL
6328 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
6329 DECL_IS_MALLOC (*node
) = 1;
6332 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6333 *no_add_attrs
= true;
6339 /* Handle a "alloc_size" attribute; arguments as in
6340 struct attribute_spec.handler. */
6343 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6344 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6346 unsigned arg_count
= type_num_arguments (*node
);
6347 for (; args
; args
= TREE_CHAIN (args
))
6349 tree position
= TREE_VALUE (args
);
6351 if (TREE_CODE (position
) != INTEGER_CST
6352 || TREE_INT_CST_HIGH (position
)
6353 || TREE_INT_CST_LOW (position
) < 1
6354 || TREE_INT_CST_LOW (position
) > arg_count
)
6356 warning (OPT_Wattributes
,
6357 "alloc_size parameter outside range");
6358 *no_add_attrs
= true;
6365 /* Handle a "returns_twice" attribute; arguments as in
6366 struct attribute_spec.handler. */
6369 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6370 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6372 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6373 DECL_IS_RETURNS_TWICE (*node
) = 1;
6376 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6377 *no_add_attrs
= true;
6383 /* Handle a "no_limit_stack" attribute; arguments as in
6384 struct attribute_spec.handler. */
6387 handle_no_limit_stack_attribute (tree
*node
, tree name
,
6388 tree
ARG_UNUSED (args
),
6389 int ARG_UNUSED (flags
),
6394 if (TREE_CODE (decl
) != FUNCTION_DECL
)
6396 error ("%J%qE attribute applies only to functions", decl
, name
);
6397 *no_add_attrs
= true;
6399 else if (DECL_INITIAL (decl
))
6401 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
6402 *no_add_attrs
= true;
6405 DECL_NO_LIMIT_STACK (decl
) = 1;
6410 /* Handle a "pure" attribute; arguments as in
6411 struct attribute_spec.handler. */
6414 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6415 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6417 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6418 DECL_PURE_P (*node
) = 1;
6419 /* ??? TODO: Support types. */
6422 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6423 *no_add_attrs
= true;
6429 /* Handle a "no vops" attribute; arguments as in
6430 struct attribute_spec.handler. */
6433 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
6434 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
6435 bool *ARG_UNUSED (no_add_attrs
))
6437 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
6438 DECL_IS_NOVOPS (*node
) = 1;
6442 /* Handle a "deprecated" attribute; arguments as in
6443 struct attribute_spec.handler. */
6446 handle_deprecated_attribute (tree
*node
, tree name
,
6447 tree
ARG_UNUSED (args
), int flags
,
6450 tree type
= NULL_TREE
;
6452 tree what
= NULL_TREE
;
6457 type
= TREE_TYPE (decl
);
6459 if (TREE_CODE (decl
) == TYPE_DECL
6460 || TREE_CODE (decl
) == PARM_DECL
6461 || TREE_CODE (decl
) == VAR_DECL
6462 || TREE_CODE (decl
) == FUNCTION_DECL
6463 || TREE_CODE (decl
) == FIELD_DECL
)
6464 TREE_DEPRECATED (decl
) = 1;
6468 else if (TYPE_P (*node
))
6470 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6471 *node
= build_variant_type_copy (*node
);
6472 TREE_DEPRECATED (*node
) = 1;
6480 *no_add_attrs
= true;
6481 if (type
&& TYPE_NAME (type
))
6483 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
6484 what
= TYPE_NAME (*node
);
6485 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
6486 && DECL_NAME (TYPE_NAME (type
)))
6487 what
= DECL_NAME (TYPE_NAME (type
));
6490 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
6492 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6498 /* Handle a "vector_size" attribute; arguments as in
6499 struct attribute_spec.handler. */
6502 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
6503 int ARG_UNUSED (flags
),
6506 unsigned HOST_WIDE_INT vecsize
, nunits
;
6507 enum machine_mode orig_mode
;
6508 tree type
= *node
, new_type
, size
;
6510 *no_add_attrs
= true;
6512 size
= TREE_VALUE (args
);
6514 if (!host_integerp (size
, 1))
6516 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6520 /* Get the vector size (in bytes). */
6521 vecsize
= tree_low_cst (size
, 1);
6523 /* We need to provide for vector pointers, vector arrays, and
6524 functions returning vectors. For example:
6526 __attribute__((vector_size(16))) short *foo;
6528 In this case, the mode is SI, but the type being modified is
6529 HI, so we need to look further. */
6531 while (POINTER_TYPE_P (type
)
6532 || TREE_CODE (type
) == FUNCTION_TYPE
6533 || TREE_CODE (type
) == METHOD_TYPE
6534 || TREE_CODE (type
) == ARRAY_TYPE
6535 || TREE_CODE (type
) == OFFSET_TYPE
)
6536 type
= TREE_TYPE (type
);
6538 /* Get the mode of the type being modified. */
6539 orig_mode
= TYPE_MODE (type
);
6541 if ((!INTEGRAL_TYPE_P (type
)
6542 && !SCALAR_FLOAT_TYPE_P (type
)
6543 && !FIXED_POINT_TYPE_P (type
))
6544 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
6545 && GET_MODE_CLASS (orig_mode
) != MODE_INT
6546 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
6547 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
6549 error ("invalid vector type for attribute %qE", name
);
6553 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
6555 error ("vector size not an integral multiple of component size");
6561 error ("zero vector size");
6565 /* Calculate how many units fit in the vector. */
6566 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6567 if (nunits
& (nunits
- 1))
6569 error ("number of components of the vector not a power of two");
6573 new_type
= build_vector_type (type
, nunits
);
6575 /* Build back pointers if needed. */
6576 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
6581 /* Handle the "nonnull" attribute. */
6583 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
6584 tree args
, int ARG_UNUSED (flags
),
6588 unsigned HOST_WIDE_INT attr_arg_num
;
6590 /* If no arguments are specified, all pointer arguments should be
6591 non-null. Verify a full prototype is given so that the arguments
6592 will have the correct types when we actually check them later. */
6595 if (!TYPE_ARG_TYPES (type
))
6597 error ("nonnull attribute without arguments on a non-prototype");
6598 *no_add_attrs
= true;
6603 /* Argument list specified. Verify that each argument number references
6604 a pointer argument. */
6605 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
6608 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
6610 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
6612 error ("nonnull argument has invalid operand number (argument %lu)",
6613 (unsigned long) attr_arg_num
);
6614 *no_add_attrs
= true;
6618 argument
= TYPE_ARG_TYPES (type
);
6621 for (ck_num
= 1; ; ck_num
++)
6623 if (!argument
|| ck_num
== arg_num
)
6625 argument
= TREE_CHAIN (argument
);
6629 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
6631 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
6632 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
6633 *no_add_attrs
= true;
6637 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
6639 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
6640 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
6641 *no_add_attrs
= true;
6650 /* Check the argument list of a function call for null in argument slots
6651 that are marked as requiring a non-null pointer argument. The NARGS
6652 arguments are passed in the array ARGARRAY.
6656 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
6661 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
6663 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
6665 args
= TREE_VALUE (a
);
6667 /* Walk the argument list. If we encounter an argument number we
6668 should check for non-null, do it. If the attribute has no args,
6669 then every pointer argument is checked (in which case the check
6670 for pointer type is done in check_nonnull_arg). */
6671 for (i
= 0; i
< nargs
; i
++)
6673 if (!args
|| nonnull_check_p (args
, i
+ 1))
6674 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
6682 /* Check that the Nth argument of a function call (counting backwards
6683 from the end) is a (pointer)0. The NARGS arguments are passed in the
6687 check_function_sentinel (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
6689 tree attr
= lookup_attribute ("sentinel", attrs
);
6697 /* Skip over the named arguments. */
6698 while (typelist
&& len
< nargs
)
6700 typelist
= TREE_CHAIN (typelist
);
6704 if (TREE_VALUE (attr
))
6706 tree p
= TREE_VALUE (TREE_VALUE (attr
));
6707 pos
= TREE_INT_CST_LOW (p
);
6710 /* The sentinel must be one of the varargs, i.e.
6711 in position >= the number of fixed arguments. */
6712 if ((nargs
- 1 - pos
) < len
)
6714 warning (OPT_Wformat
,
6715 "not enough variable arguments to fit a sentinel");
6719 /* Validate the sentinel. */
6720 sentinel
= argarray
[nargs
- 1 - pos
];
6721 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
6722 || !integer_zerop (sentinel
))
6723 /* Although __null (in C++) is only an integer we allow it
6724 nevertheless, as we are guaranteed that it's exactly
6725 as wide as a pointer, and we don't want to force
6726 users to cast the NULL they have written there.
6727 We warn with -Wstrict-null-sentinel, though. */
6728 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
6729 warning (OPT_Wformat
, "missing sentinel in function call");
6733 /* Helper for check_function_nonnull; given a list of operands which
6734 must be non-null in ARGS, determine if operand PARAM_NUM should be
6738 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
6740 unsigned HOST_WIDE_INT arg_num
= 0;
6742 for (; args
; args
= TREE_CHAIN (args
))
6744 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
6748 if (arg_num
== param_num
)
6754 /* Check that the function argument PARAM (which is operand number
6755 PARAM_NUM) is non-null. This is called by check_function_nonnull
6756 via check_function_arguments_recurse. */
6759 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
6760 unsigned HOST_WIDE_INT param_num
)
6762 /* Just skip checking the argument if it's not a pointer. This can
6763 happen if the "nonnull" attribute was given without an operand
6764 list (which means to check every pointer argument). */
6766 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
6769 if (integer_zerop (param
))
6770 warning (OPT_Wnonnull
, "null argument where non-null required "
6771 "(argument %lu)", (unsigned long) param_num
);
6774 /* Helper for nonnull attribute handling; fetch the operand number
6775 from the attribute argument list. */
6778 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
6780 /* Verify the arg number is a constant. */
6781 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
6782 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
6785 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
6789 /* Handle a "nothrow" attribute; arguments as in
6790 struct attribute_spec.handler. */
6793 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6794 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6796 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6797 TREE_NOTHROW (*node
) = 1;
6798 /* ??? TODO: Support types. */
6801 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6802 *no_add_attrs
= true;
6808 /* Handle a "cleanup" attribute; arguments as in
6809 struct attribute_spec.handler. */
6812 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
6813 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6816 tree cleanup_id
, cleanup_decl
;
6818 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
6819 for global destructors in C++. This requires infrastructure that
6820 we don't have generically at the moment. It's also not a feature
6821 we'd be missing too much, since we do have attribute constructor. */
6822 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
6824 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6825 *no_add_attrs
= true;
6829 /* Verify that the argument is a function in scope. */
6830 /* ??? We could support pointers to functions here as well, if
6831 that was considered desirable. */
6832 cleanup_id
= TREE_VALUE (args
);
6833 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
6835 error ("cleanup argument not an identifier");
6836 *no_add_attrs
= true;
6839 cleanup_decl
= lookup_name (cleanup_id
);
6840 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
6842 error ("cleanup argument not a function");
6843 *no_add_attrs
= true;
6847 /* That the function has proper type is checked with the
6848 eventual call to build_function_call. */
6853 /* Handle a "warn_unused_result" attribute. No special handling. */
6856 handle_warn_unused_result_attribute (tree
*node
, tree name
,
6857 tree
ARG_UNUSED (args
),
6858 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6860 /* Ignore the attribute for functions not returning any value. */
6861 if (VOID_TYPE_P (TREE_TYPE (*node
)))
6863 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6864 *no_add_attrs
= true;
6870 /* Handle a "sentinel" attribute. */
6873 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
6874 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6876 tree params
= TYPE_ARG_TYPES (*node
);
6880 warning (OPT_Wattributes
,
6881 "%qE attribute requires prototypes with named arguments", name
);
6882 *no_add_attrs
= true;
6886 while (TREE_CHAIN (params
))
6887 params
= TREE_CHAIN (params
);
6889 if (VOID_TYPE_P (TREE_VALUE (params
)))
6891 warning (OPT_Wattributes
,
6892 "%qE attribute only applies to variadic functions", name
);
6893 *no_add_attrs
= true;
6899 tree position
= TREE_VALUE (args
);
6901 if (TREE_CODE (position
) != INTEGER_CST
)
6903 warning (OPT_Wattributes
,
6904 "requested position is not an integer constant");
6905 *no_add_attrs
= true;
6909 if (tree_int_cst_lt (position
, integer_zero_node
))
6911 warning (OPT_Wattributes
,
6912 "requested position is less than zero");
6913 *no_add_attrs
= true;
6921 /* Handle a "type_generic" attribute. */
6924 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
6925 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
6926 bool * ARG_UNUSED (no_add_attrs
))
6930 /* Ensure we have a function type. */
6931 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
6933 params
= TYPE_ARG_TYPES (*node
);
6934 while (params
&& ! VOID_TYPE_P (TREE_VALUE (params
)))
6935 params
= TREE_CHAIN (params
);
6937 /* Ensure we have a variadic function. */
6938 gcc_assert (!params
);
6943 /* Handle a "target" attribute. */
6946 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
6949 /* Ensure we have a function type. */
6950 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6952 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6953 *no_add_attrs
= true;
6955 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
6957 *no_add_attrs
= true;
6962 /* Arguments being collected for optimization. */
6963 typedef const char *const_char_p
; /* For DEF_VEC_P. */
6964 DEF_VEC_P(const_char_p
);
6965 DEF_VEC_ALLOC_P(const_char_p
, gc
);
6966 static GTY(()) VEC(const_char_p
, gc
) *optimize_args
;
6969 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
6970 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
6971 false for #pragma GCC optimize. */
6974 parse_optimize_options (tree args
, bool attr_p
)
6979 int saved_flag_strict_aliasing
;
6980 const char **opt_argv
;
6983 /* Build up argv vector. Just in case the string is stored away, use garbage
6984 collected strings. */
6985 VEC_truncate (const_char_p
, optimize_args
, 0);
6986 VEC_safe_push (const_char_p
, gc
, optimize_args
, NULL
);
6988 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
6990 tree value
= TREE_VALUE (ap
);
6992 if (TREE_CODE (value
) == INTEGER_CST
)
6995 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
6996 VEC_safe_push (const_char_p
, gc
, optimize_args
, ggc_strdup (buffer
));
6999 else if (TREE_CODE (value
) == STRING_CST
)
7001 /* Split string into multiple substrings. */
7002 size_t len
= TREE_STRING_LENGTH (value
);
7003 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
7004 char *end
= p
+ len
;
7008 while (next_p
!= NULL
)
7014 comma
= strchr (p
, ',');
7027 r
= q
= (char *) ggc_alloc (len2
+ 3);
7029 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7031 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
7035 warning (OPT_Wattributes
,
7036 "Bad option %s to optimize attribute.", p
);
7038 warning (OPT_Wpragmas
,
7039 "Bad option %s to pragma attribute", p
);
7047 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7048 itself is -Os, and any other switch begins with a -f. */
7049 if ((*p
>= '0' && *p
<= '9')
7050 || (p
[0] == 's' && p
[1] == '\0'))
7056 memcpy (r
, p
, len2
);
7058 VEC_safe_push (const_char_p
, gc
, optimize_args
, q
);
7064 opt_argc
= VEC_length (const_char_p
, optimize_args
);
7065 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
7067 for (i
= 1; i
< opt_argc
; i
++)
7068 opt_argv
[i
] = VEC_index (const_char_p
, optimize_args
, i
);
7070 saved_flag_strict_aliasing
= flag_strict_aliasing
;
7072 /* Now parse the options. */
7073 decode_options (opt_argc
, opt_argv
);
7075 /* Don't allow changing -fstrict-aliasing. */
7076 flag_strict_aliasing
= saved_flag_strict_aliasing
;
7078 VEC_truncate (const_char_p
, optimize_args
, 0);
7082 /* For handling "optimize" attribute. arguments as in
7083 struct attribute_spec.handler. */
7086 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
7087 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7089 /* Ensure we have a function type. */
7090 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7092 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7093 *no_add_attrs
= true;
7097 struct cl_optimization cur_opts
;
7098 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
7100 /* Save current options. */
7101 cl_optimization_save (&cur_opts
);
7103 /* If we previously had some optimization options, use them as the
7106 cl_optimization_restore (TREE_OPTIMIZATION (old_opts
));
7108 /* Parse options, and update the vector. */
7109 parse_optimize_options (args
, true);
7110 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
7111 = build_optimization_node ();
7113 /* Restore current options. */
7114 cl_optimization_restore (&cur_opts
);
7120 /* Check for valid arguments being passed to a function.
7121 ATTRS is a list of attributes. There are NARGS arguments in the array
7122 ARGARRAY. TYPELIST is the list of argument types for the function.
7125 check_function_arguments (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
7127 /* Check for null being passed in a pointer argument that must be
7128 non-null. We also need to do this if format checking is enabled. */
7131 check_function_nonnull (attrs
, nargs
, argarray
);
7133 /* Check for errors in format strings. */
7135 if (warn_format
|| warn_missing_format_attribute
)
7136 check_function_format (attrs
, nargs
, argarray
);
7139 check_function_sentinel (attrs
, nargs
, argarray
, typelist
);
7142 /* Generic argument checking recursion routine. PARAM is the argument to
7143 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7144 once the argument is resolved. CTX is context for the callback. */
7146 check_function_arguments_recurse (void (*callback
)
7147 (void *, tree
, unsigned HOST_WIDE_INT
),
7148 void *ctx
, tree param
,
7149 unsigned HOST_WIDE_INT param_num
)
7151 if (CONVERT_EXPR_P (param
)
7152 && (TYPE_PRECISION (TREE_TYPE (param
))
7153 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
7155 /* Strip coercion. */
7156 check_function_arguments_recurse (callback
, ctx
,
7157 TREE_OPERAND (param
, 0), param_num
);
7161 if (TREE_CODE (param
) == CALL_EXPR
)
7163 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
7165 bool found_format_arg
= false;
7167 /* See if this is a call to a known internationalization function
7168 that modifies a format arg. Such a function may have multiple
7169 format_arg attributes (for example, ngettext). */
7171 for (attrs
= TYPE_ATTRIBUTES (type
);
7173 attrs
= TREE_CHAIN (attrs
))
7174 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
7177 tree format_num_expr
;
7180 call_expr_arg_iterator iter
;
7182 /* Extract the argument number, which was previously checked
7184 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
7186 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
7187 && !TREE_INT_CST_HIGH (format_num_expr
));
7189 format_num
= TREE_INT_CST_LOW (format_num_expr
);
7191 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
7193 inner_arg
= next_call_expr_arg (&iter
), i
++)
7194 if (i
== format_num
)
7196 check_function_arguments_recurse (callback
, ctx
,
7197 inner_arg
, param_num
);
7198 found_format_arg
= true;
7203 /* If we found a format_arg attribute and did a recursive check,
7204 we are done with checking this argument. Otherwise, we continue
7205 and this will be considered a non-literal. */
7206 if (found_format_arg
)
7210 if (TREE_CODE (param
) == COND_EXPR
)
7212 /* Check both halves of the conditional expression. */
7213 check_function_arguments_recurse (callback
, ctx
,
7214 TREE_OPERAND (param
, 1), param_num
);
7215 check_function_arguments_recurse (callback
, ctx
,
7216 TREE_OPERAND (param
, 2), param_num
);
7220 (*callback
) (ctx
, param
, param_num
);
7223 /* Checks the number of arguments NARGS against the required number
7224 REQUIRED and issues an error if there is a mismatch. Returns true
7225 if the number of arguments is correct, otherwise false. */
7228 validate_nargs (tree fndecl
, int nargs
, int required
)
7230 if (nargs
< required
)
7232 error ("not enough arguments to function %qE", fndecl
);
7235 else if (nargs
> required
)
7237 error ("too many arguments to function %qE", fndecl
);
7243 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
7244 Returns false if there was an error, otherwise true. */
7247 check_builtin_function_arguments (tree fndecl
, int nargs
, tree
*args
)
7249 if (!DECL_BUILT_IN (fndecl
)
7250 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
7253 switch (DECL_FUNCTION_CODE (fndecl
))
7255 case BUILT_IN_CONSTANT_P
:
7256 return validate_nargs (fndecl
, nargs
, 1);
7258 case BUILT_IN_ISFINITE
:
7259 case BUILT_IN_ISINF
:
7260 case BUILT_IN_ISINF_SIGN
:
7261 case BUILT_IN_ISNAN
:
7262 case BUILT_IN_ISNORMAL
:
7263 if (validate_nargs (fndecl
, nargs
, 1))
7265 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
7267 error ("non-floating-point argument in call to "
7268 "function %qE", fndecl
);
7275 case BUILT_IN_ISGREATER
:
7276 case BUILT_IN_ISGREATEREQUAL
:
7277 case BUILT_IN_ISLESS
:
7278 case BUILT_IN_ISLESSEQUAL
:
7279 case BUILT_IN_ISLESSGREATER
:
7280 case BUILT_IN_ISUNORDERED
:
7281 if (validate_nargs (fndecl
, nargs
, 2))
7283 enum tree_code code0
, code1
;
7284 code0
= TREE_CODE (TREE_TYPE (args
[0]));
7285 code1
= TREE_CODE (TREE_TYPE (args
[1]));
7286 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
7287 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
7288 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
7290 error ("non-floating-point arguments in call to "
7291 "function %qE", fndecl
);
7298 case BUILT_IN_FPCLASSIFY
:
7299 if (validate_nargs (fndecl
, nargs
, 6))
7304 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
7306 error ("non-const integer argument %u in call to function %qE",
7311 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
7313 error ("non-floating-point argument in call to function %qE",
7326 /* Function to help qsort sort FIELD_DECLs by name order. */
7329 field_decl_cmp (const void *x_p
, const void *y_p
)
7331 const tree
*const x
= (const tree
*const) x_p
;
7332 const tree
*const y
= (const tree
*const) y_p
;
7334 if (DECL_NAME (*x
) == DECL_NAME (*y
))
7335 /* A nontype is "greater" than a type. */
7336 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
7337 if (DECL_NAME (*x
) == NULL_TREE
)
7339 if (DECL_NAME (*y
) == NULL_TREE
)
7341 if (DECL_NAME (*x
) < DECL_NAME (*y
))
7347 gt_pointer_operator new_value
;
7351 /* This routine compares two fields like field_decl_cmp but using the
7352 pointer operator in resort_data. */
7355 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
7357 const tree
*const x
= (const tree
*const) x_p
;
7358 const tree
*const y
= (const tree
*const) y_p
;
7360 if (DECL_NAME (*x
) == DECL_NAME (*y
))
7361 /* A nontype is "greater" than a type. */
7362 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
7363 if (DECL_NAME (*x
) == NULL_TREE
)
7365 if (DECL_NAME (*y
) == NULL_TREE
)
7368 tree d1
= DECL_NAME (*x
);
7369 tree d2
= DECL_NAME (*y
);
7370 resort_data
.new_value (&d1
, resort_data
.cookie
);
7371 resort_data
.new_value (&d2
, resort_data
.cookie
);
7378 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
7381 resort_sorted_fields (void *obj
,
7382 void * ARG_UNUSED (orig_obj
),
7383 gt_pointer_operator new_value
,
7386 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
7387 resort_data
.new_value
= new_value
;
7388 resort_data
.cookie
= cookie
;
7389 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
7390 resort_field_decl_cmp
);
7393 /* Subroutine of c_parse_error.
7394 Return the result of concatenating LHS and RHS. RHS is really
7395 a string literal, its first character is indicated by RHS_START and
7396 RHS_SIZE is its length (including the terminating NUL character).
7398 The caller is responsible for deleting the returned pointer. */
7401 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
7403 const int lhs_size
= strlen (lhs
);
7404 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
7405 strncpy (result
, lhs
, lhs_size
);
7406 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
7410 /* Issue the error given by GMSGID, indicating that it occurred before
7411 TOKEN, which had the associated VALUE. */
7414 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
7416 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
7418 char *message
= NULL
;
7420 if (token
== CPP_EOF
)
7421 message
= catenate_messages (gmsgid
, " at end of input");
7422 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
|| token
== CPP_CHAR16
7423 || token
== CPP_CHAR32
)
7425 unsigned int val
= TREE_INT_CST_LOW (value
);
7444 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
7445 message
= catenate_messages (gmsgid
, " before %s'%c'");
7447 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
7449 error (message
, prefix
, val
);
7453 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
|| token
== CPP_STRING16
7454 || token
== CPP_STRING32
)
7455 message
= catenate_messages (gmsgid
, " before string constant");
7456 else if (token
== CPP_NUMBER
)
7457 message
= catenate_messages (gmsgid
, " before numeric constant");
7458 else if (token
== CPP_NAME
)
7460 message
= catenate_messages (gmsgid
, " before %qE");
7461 error (message
, value
);
7465 else if (token
== CPP_PRAGMA
)
7466 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
7467 else if (token
== CPP_PRAGMA_EOL
)
7468 message
= catenate_messages (gmsgid
, " before end of line");
7469 else if (token
< N_TTYPES
)
7471 message
= catenate_messages (gmsgid
, " before %qs token");
7472 error (message
, cpp_type2name (token
));
7484 #undef catenate_messages
7487 /* Walk a gimplified function and warn for functions whose return value is
7488 ignored and attribute((warn_unused_result)) is set. This is done before
7489 inlining, so we don't have to worry about that. */
7492 c_warn_unused_result (gimple_seq seq
)
7495 gimple_stmt_iterator i
;
7497 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
7499 gimple g
= gsi_stmt (i
);
7501 switch (gimple_code (g
))
7504 c_warn_unused_result (gimple_bind_body (g
));
7507 c_warn_unused_result (gimple_try_eval (g
));
7508 c_warn_unused_result (gimple_try_cleanup (g
));
7511 c_warn_unused_result (gimple_catch_handler (g
));
7513 case GIMPLE_EH_FILTER
:
7514 c_warn_unused_result (gimple_eh_filter_failure (g
));
7518 if (gimple_call_lhs (g
))
7521 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7522 LHS. All calls whose value is ignored should be
7523 represented like this. Look for the attribute. */
7524 fdecl
= gimple_call_fndecl (g
);
7525 ftype
= TREE_TYPE (TREE_TYPE (gimple_call_fn (g
)));
7527 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
7529 location_t loc
= gimple_location (g
);
7532 warning (0, "%Hignoring return value of %qD, "
7533 "declared with attribute warn_unused_result",
7536 warning (0, "%Hignoring return value of function "
7537 "declared with attribute warn_unused_result",
7543 /* Not a container, not a call, or a call whose value is used. */
7549 /* Convert a character from the host to the target execution character
7550 set. cpplib handles this, mostly. */
7553 c_common_to_target_charset (HOST_WIDE_INT c
)
7555 /* Character constants in GCC proper are sign-extended under -fsigned-char,
7556 zero-extended under -fno-signed-char. cpplib insists that characters
7557 and character constants are always unsigned. Hence we must convert
7559 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
7561 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
7563 if (flag_signed_char
)
7564 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
7565 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
7570 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
7571 component references, with STOP_REF, or alternatively an INDIRECT_REF of
7572 NULL, at the bottom; much like the traditional rendering of offsetof as a
7573 macro. Returns the folded and properly cast result. */
7576 fold_offsetof_1 (tree expr
, tree stop_ref
)
7578 enum tree_code code
= PLUS_EXPR
;
7581 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
7582 return size_zero_node
;
7584 switch (TREE_CODE (expr
))
7590 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
7591 return error_mark_node
;
7595 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
7596 return error_mark_node
;
7599 gcc_assert (integer_zerop (expr
));
7600 return size_zero_node
;
7604 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
7605 gcc_assert (base
== error_mark_node
|| base
== size_zero_node
);
7609 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
7610 if (base
== error_mark_node
)
7613 t
= TREE_OPERAND (expr
, 1);
7614 if (DECL_C_BIT_FIELD (t
))
7616 error ("attempt to take address of bit-field structure "
7618 return error_mark_node
;
7620 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
7621 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
7626 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
7627 if (base
== error_mark_node
)
7630 t
= TREE_OPERAND (expr
, 1);
7631 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
7634 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
7636 t
= convert (sizetype
, t
);
7637 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
7641 /* Handle static members of volatile structs. */
7642 t
= TREE_OPERAND (expr
, 1);
7643 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
7644 return fold_offsetof_1 (t
, stop_ref
);
7650 return size_binop (code
, base
, off
);
7654 fold_offsetof (tree expr
, tree stop_ref
)
7656 /* Convert back from the internal sizetype to size_t. */
7657 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
7660 /* Print an error message for an invalid lvalue. USE says
7661 how the lvalue is being used and so selects the error message. */
7664 lvalue_error (enum lvalue_use use
)
7669 error ("lvalue required as left operand of assignment");
7672 error ("lvalue required as increment operand");
7675 error ("lvalue required as decrement operand");
7678 error ("lvalue required as unary %<&%> operand");
7681 error ("lvalue required in asm statement");
7688 /* *PTYPE is an incomplete array. Complete it with a domain based on
7689 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
7690 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7691 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
7694 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
7696 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
7697 int failure
= 0, quals
;
7698 hashval_t hashcode
= 0;
7700 maxindex
= size_zero_node
;
7703 if (TREE_CODE (initial_value
) == STRING_CST
)
7706 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
7707 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
7709 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
7711 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
7713 if (VEC_empty (constructor_elt
, v
))
7717 maxindex
= integer_minus_one_node
;
7722 unsigned HOST_WIDE_INT cnt
;
7723 constructor_elt
*ce
;
7725 if (VEC_index (constructor_elt
, v
, 0)->index
)
7726 maxindex
= fold_convert (sizetype
,
7727 VEC_index (constructor_elt
,
7729 curindex
= maxindex
;
7732 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
7736 curindex
= fold_convert (sizetype
, ce
->index
);
7738 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
7740 if (tree_int_cst_lt (maxindex
, curindex
))
7741 maxindex
= curindex
;
7747 /* Make an error message unless that happened already. */
7748 if (initial_value
!= error_mark_node
)
7760 elt
= TREE_TYPE (type
);
7761 quals
= TYPE_QUALS (strip_array_types (elt
));
7765 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
7767 /* Using build_distinct_type_copy and modifying things afterward instead
7768 of using build_array_type to create a new type preserves all of the
7769 TYPE_LANG_FLAG_? bits that the front end may have set. */
7770 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
7771 TREE_TYPE (main_type
) = unqual_elt
;
7772 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
7773 layout_type (main_type
);
7775 /* Make sure we have the canonical MAIN_TYPE. */
7776 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
7777 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
7779 main_type
= type_hash_canon (hashcode
, main_type
);
7781 /* Fix the canonical type. */
7782 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
7783 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
7784 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
7785 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
7786 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
7787 != TYPE_DOMAIN (main_type
)))
7788 TYPE_CANONICAL (main_type
)
7789 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
7790 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
7792 TYPE_CANONICAL (main_type
) = main_type
;
7797 type
= c_build_qualified_type (main_type
, quals
);
7799 if (COMPLETE_TYPE_P (type
)
7800 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
7801 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type
)))
7803 error ("size of array is too large");
7804 /* If we proceed with the array type as it is, we'll eventually
7805 crash in tree_low_cst(). */
7806 type
= error_mark_node
;
7814 /* Used to help initialize the builtin-types.def table. When a type of
7815 the correct size doesn't exist, use error_mark_node instead of NULL.
7816 The later results in segfaults even when a decl using the type doesn't
7820 builtin_type_for_size (int size
, bool unsignedp
)
7822 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
7823 return type
? type
: error_mark_node
;
7826 /* A helper function for resolve_overloaded_builtin in resolving the
7827 overloaded __sync_ builtins. Returns a positive power of 2 if the
7828 first operand of PARAMS is a pointer to a supported data type.
7829 Returns 0 if an error is encountered. */
7832 sync_resolve_size (tree function
, tree params
)
7839 error ("too few arguments to function %qE", function
);
7843 type
= TREE_TYPE (TREE_VALUE (params
));
7844 if (TREE_CODE (type
) != POINTER_TYPE
)
7847 type
= TREE_TYPE (type
);
7848 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
7851 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
7852 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
7856 error ("incompatible type for argument %d of %qE", 1, function
);
7860 /* A helper function for resolve_overloaded_builtin. Adds casts to
7861 PARAMS to make arguments match up with those of FUNCTION. Drops
7862 the variadic arguments at the end. Returns false if some error
7863 was encountered; true on success. */
7866 sync_resolve_params (tree orig_function
, tree function
, tree params
)
7868 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
7872 /* We've declared the implementation functions to use "volatile void *"
7873 as the pointer parameter, so we shouldn't get any complaints from the
7874 call to check_function_arguments what ever type the user used. */
7875 arg_types
= TREE_CHAIN (arg_types
);
7876 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
7879 /* For the rest of the values, we need to cast these to FTYPE, so that we
7880 don't get warnings for passing pointer types, etc. */
7881 while (arg_types
!= void_list_node
)
7885 params
= TREE_CHAIN (params
);
7888 error ("too few arguments to function %qE", orig_function
);
7892 /* ??? Ideally for the first conversion we'd use convert_for_assignment
7893 so that we get warnings for anything that doesn't match the pointer
7894 type. This isn't portable across the C and C++ front ends atm. */
7895 val
= TREE_VALUE (params
);
7896 val
= convert (ptype
, val
);
7897 val
= convert (TREE_VALUE (arg_types
), val
);
7898 TREE_VALUE (params
) = val
;
7900 arg_types
= TREE_CHAIN (arg_types
);
7904 /* The definition of these primitives is variadic, with the remaining
7905 being "an optional list of variables protected by the memory barrier".
7906 No clue what that's supposed to mean, precisely, but we consider all
7907 call-clobbered variables to be protected so we're safe. */
7908 TREE_CHAIN (params
) = NULL
;
7913 /* A helper function for resolve_overloaded_builtin. Adds a cast to
7914 RESULT to make it match the type of the first pointer argument in
7918 sync_resolve_return (tree params
, tree result
)
7920 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
7921 ptype
= TYPE_MAIN_VARIANT (ptype
);
7922 return convert (ptype
, result
);
7925 /* Some builtin functions are placeholders for other expressions. This
7926 function should be called immediately after parsing the call expression
7927 before surrounding code has committed to the type of the expression.
7929 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7930 PARAMS is the argument list for the call. The return value is non-null
7931 when expansion is complete, and null if normal processing should
7935 resolve_overloaded_builtin (tree function
, tree params
)
7937 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
7938 switch (DECL_BUILT_IN_CLASS (function
))
7940 case BUILT_IN_NORMAL
:
7943 if (targetm
.resolve_overloaded_builtin
)
7944 return targetm
.resolve_overloaded_builtin (function
, params
);
7951 /* Handle BUILT_IN_NORMAL here. */
7954 case BUILT_IN_FETCH_AND_ADD_N
:
7955 case BUILT_IN_FETCH_AND_SUB_N
:
7956 case BUILT_IN_FETCH_AND_OR_N
:
7957 case BUILT_IN_FETCH_AND_AND_N
:
7958 case BUILT_IN_FETCH_AND_XOR_N
:
7959 case BUILT_IN_FETCH_AND_NAND_N
:
7960 case BUILT_IN_ADD_AND_FETCH_N
:
7961 case BUILT_IN_SUB_AND_FETCH_N
:
7962 case BUILT_IN_OR_AND_FETCH_N
:
7963 case BUILT_IN_AND_AND_FETCH_N
:
7964 case BUILT_IN_XOR_AND_FETCH_N
:
7965 case BUILT_IN_NAND_AND_FETCH_N
:
7966 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
7967 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
7968 case BUILT_IN_LOCK_TEST_AND_SET_N
:
7969 case BUILT_IN_LOCK_RELEASE_N
:
7971 int n
= sync_resolve_size (function
, params
);
7972 tree new_function
, result
;
7975 return error_mark_node
;
7977 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
7978 if (!sync_resolve_params (function
, new_function
, params
))
7979 return error_mark_node
;
7981 result
= build_function_call (new_function
, params
);
7982 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
7983 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
7984 result
= sync_resolve_return (params
, result
);
7994 /* Ignoring their sign, return true if two scalar types are the same. */
7996 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
7998 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
8000 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
8001 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
8002 || c2
== FIXED_POINT_TYPE
));
8004 /* Equality works here because c_common_signed_type uses
8005 TYPE_MAIN_VARIANT. */
8006 return c_common_signed_type (t1
)
8007 == c_common_signed_type (t2
);
8010 /* Check for missing format attributes on function pointers. LTYPE is
8011 the new type or left-hand side type. RTYPE is the old type or
8012 right-hand side type. Returns TRUE if LTYPE is missing the desired
8016 check_missing_format_attribute (tree ltype
, tree rtype
)
8018 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
8021 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
8022 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
8027 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
8028 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
8036 /* Subscripting with type char is likely to lose on a machine where
8037 chars are signed. So warn on any machine, but optionally. Don't
8038 warn for unsigned char since that type is safe. Don't warn for
8039 signed char because anyone who uses that must have done so
8040 deliberately. Furthermore, we reduce the false positive load by
8041 warning only for non-constant value of type char. */
8044 warn_array_subscript_with_type_char (tree index
)
8046 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
8047 && TREE_CODE (index
) != INTEGER_CST
)
8048 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
8051 /* Implement -Wparentheses for the unexpected C precedence rules, to
8052 cover cases like x + y << z which readers are likely to
8053 misinterpret. We have seen an expression in which CODE is a binary
8054 operator used to combine expressions ARG_LEFT and ARG_RIGHT, which
8055 before folding had CODE_LEFT and CODE_RIGHT. CODE_LEFT and
8056 CODE_RIGHT may be ERROR_MARK, which means that that side of the
8057 expression was not formed using a binary or unary operator, or it
8058 was enclosed in parentheses. */
8061 warn_about_parentheses (enum tree_code code
,
8062 enum tree_code code_left
, tree
ARG_UNUSED (arg_left
),
8063 enum tree_code code_right
, tree arg_right
)
8065 if (!warn_parentheses
)
8068 /* This macro tests that the expression ARG with original tree code
8069 CODE appears to be a boolean expression. or the result of folding a
8070 boolean expression. */
8071 #define APPEARS_TO_BE_BOOLEAN_EXPR_P(CODE, ARG) \
8072 (truth_value_p (TREE_CODE (ARG)) \
8073 || TREE_CODE (TREE_TYPE (ARG)) == BOOLEAN_TYPE \
8074 /* Folding may create 0 or 1 integers from other expressions. */ \
8075 || ((CODE) != INTEGER_CST \
8076 && (integer_onep (ARG) || integer_zerop (ARG))))
8081 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8082 warning (OPT_Wparentheses
,
8083 "suggest parentheses around %<+%> inside %<<<%>");
8084 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8085 warning (OPT_Wparentheses
,
8086 "suggest parentheses around %<-%> inside %<<<%>");
8090 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8091 warning (OPT_Wparentheses
,
8092 "suggest parentheses around %<+%> inside %<>>%>");
8093 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8094 warning (OPT_Wparentheses
,
8095 "suggest parentheses around %<-%> inside %<>>%>");
8098 case TRUTH_ORIF_EXPR
:
8099 if (code_left
== TRUTH_ANDIF_EXPR
|| code_right
== TRUTH_ANDIF_EXPR
)
8100 warning (OPT_Wparentheses
,
8101 "suggest parentheses around %<&&%> within %<||%>");
8105 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
8106 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
8107 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
8108 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
8109 warning (OPT_Wparentheses
,
8110 "suggest parentheses around arithmetic in operand of %<|%>");
8111 /* Check cases like x|y==z */
8112 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8113 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8114 warning (OPT_Wparentheses
,
8115 "suggest parentheses around comparison in operand of %<|%>");
8116 /* Check cases like !x | y */
8117 else if (code_left
== TRUTH_NOT_EXPR
8118 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
8119 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
8120 "%<!%> or change %<|%> to %<||%> or %<!%> to %<~%>");
8124 if (code_left
== BIT_AND_EXPR
8125 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
8126 || code_right
== BIT_AND_EXPR
8127 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
8128 warning (OPT_Wparentheses
,
8129 "suggest parentheses around arithmetic in operand of %<^%>");
8130 /* Check cases like x^y==z */
8131 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8132 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8133 warning (OPT_Wparentheses
,
8134 "suggest parentheses around comparison in operand of %<^%>");
8138 if (code_left
== PLUS_EXPR
|| code_right
== PLUS_EXPR
)
8139 warning (OPT_Wparentheses
,
8140 "suggest parentheses around %<+%> in operand of %<&%>");
8141 else if (code_left
== MINUS_EXPR
|| code_right
== MINUS_EXPR
)
8142 warning (OPT_Wparentheses
,
8143 "suggest parentheses around %<-%> in operand of %<&%>");
8144 /* Check cases like x&y==z */
8145 else if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8146 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8147 warning (OPT_Wparentheses
,
8148 "suggest parentheses around comparison in operand of %<&%>");
8149 /* Check cases like !x & y */
8150 else if (code_left
== TRUTH_NOT_EXPR
8151 && !APPEARS_TO_BE_BOOLEAN_EXPR_P (code_right
, arg_right
))
8152 warning (OPT_Wparentheses
, "suggest parentheses around operand of "
8153 "%<!%> or change %<&%> to %<&&%> or %<!%> to %<~%>");
8157 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8158 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8159 warning (OPT_Wparentheses
,
8160 "suggest parentheses around comparison in operand of %<==%>");
8163 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8164 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8165 warning (OPT_Wparentheses
,
8166 "suggest parentheses around comparison in operand of %<!=%>");
8170 if (TREE_CODE_CLASS (code
) == tcc_comparison
8171 && ((TREE_CODE_CLASS (code_left
) == tcc_comparison
8172 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
)
8173 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
8174 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
)))
8175 warning (OPT_Wparentheses
, "comparisons like %<X<=Y<=Z%> do not "
8176 "have their mathematical meaning");
8179 #undef NOT_A_BOOLEAN_EXPR_P
8182 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
8185 warn_for_unused_label (tree label
)
8187 if (!TREE_USED (label
))
8189 if (DECL_INITIAL (label
))
8190 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
8192 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
8196 #ifndef TARGET_HAS_TARGETCM
8197 struct gcc_targetcm targetcm
= TARGETCM_INITIALIZER
;
8200 /* Warn for division by zero according to the value of DIVISOR. LOC
8201 is the location of the division operator. */
8204 warn_for_div_by_zero (location_t loc
, tree divisor
)
8206 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
8207 about division by zero. Do not issue a warning if DIVISOR has a
8208 floating-point type, since we consider 0.0/0.0 a valid way of
8209 generating a NaN. */
8210 if (skip_evaluation
== 0
8211 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
8212 warning_at (loc
, OPT_Wdiv_by_zero
, "division by zero");
8215 /* Subroutine of build_binary_op. Give warnings for comparisons
8216 between signed and unsigned quantities that may fail. Do the
8217 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
8218 so that casts will be considered, but default promotions won't
8221 LOCATION is the location of the comparison operator.
8223 The arguments of this function map directly to local variables
8224 of build_binary_op. */
8227 warn_for_sign_compare (location_t location
,
8228 tree orig_op0
, tree orig_op1
,
8230 tree result_type
, enum tree_code resultcode
)
8232 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
8233 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
8234 int unsignedp0
, unsignedp1
;
8236 /* In C++, check for comparison of different enum types. */
8238 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
8239 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
8240 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
8241 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
8243 warning_at (location
,
8244 OPT_Wsign_compare
, "comparison between types %qT and %qT",
8245 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
8248 /* Do not warn if the comparison is being done in a signed type,
8249 since the signed type will only be chosen if it can represent
8250 all the values of the unsigned type. */
8251 if (!TYPE_UNSIGNED (result_type
))
8253 /* Do not warn if both operands are unsigned. */
8254 else if (op0_signed
== op1_signed
)
8258 tree sop
, uop
, base_type
;
8262 sop
= orig_op0
, uop
= orig_op1
;
8264 sop
= orig_op1
, uop
= orig_op0
;
8266 STRIP_TYPE_NOPS (sop
);
8267 STRIP_TYPE_NOPS (uop
);
8268 base_type
= (TREE_CODE (result_type
) == COMPLEX_TYPE
8269 ? TREE_TYPE (result_type
) : result_type
);
8271 /* Do not warn if the signed quantity is an unsuffixed integer
8272 literal (or some static constant expression involving such
8273 literals or a conditional expression involving such literals)
8274 and it is non-negative. */
8275 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
8277 /* Do not warn if the comparison is an equality operation, the
8278 unsigned quantity is an integral constant, and it would fit
8279 in the result if the result were signed. */
8280 else if (TREE_CODE (uop
) == INTEGER_CST
8281 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
8282 && int_fits_type_p (uop
, c_common_signed_type (base_type
)))
8284 /* In C, do not warn if the unsigned quantity is an enumeration
8285 constant and its maximum value would fit in the result if the
8286 result were signed. */
8287 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
8288 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
8289 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
8290 c_common_signed_type (base_type
)))
8293 warning_at (location
,
8295 "comparison between signed and unsigned integer expressions");
8298 /* Warn if two unsigned values are being compared in a size larger
8299 than their original size, and one (and only one) is the result of
8300 a `~' operator. This comparison will always fail.
8302 Also warn if one operand is a constant, and the constant does not
8303 have all bits set that are set in the ~ operand when it is
8306 op0
= get_narrower (op0
, &unsignedp0
);
8307 op1
= get_narrower (op1
, &unsignedp1
);
8309 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
8310 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
8312 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
8313 op0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
8314 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
8315 op1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
8317 if (host_integerp (op0
, 0) || host_integerp (op1
, 0))
8320 HOST_WIDE_INT constant
, mask
;
8324 if (host_integerp (op0
, 0))
8327 unsignedp
= unsignedp1
;
8328 constant
= tree_low_cst (op0
, 0);
8333 unsignedp
= unsignedp0
;
8334 constant
= tree_low_cst (op1
, 0);
8337 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
8338 if (bits
< TYPE_PRECISION (result_type
)
8339 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
8341 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
8342 if ((mask
& constant
) != mask
)
8345 warning (OPT_Wsign_compare
,
8346 "promoted ~unsigned is always non-zero");
8348 warning_at (location
, OPT_Wsign_compare
,
8349 "comparison of promoted ~unsigned with constant");
8353 else if (unsignedp0
&& unsignedp1
8354 && (TYPE_PRECISION (TREE_TYPE (op0
))
8355 < TYPE_PRECISION (result_type
))
8356 && (TYPE_PRECISION (TREE_TYPE (op1
))
8357 < TYPE_PRECISION (result_type
)))
8358 warning_at (location
, OPT_Wsign_compare
,
8359 "comparison of promoted ~unsigned with unsigned");
8363 #include "gt-c-common.h"