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 /* Expand DECL if it declares an entity not handled by the
990 c_expand_decl (tree decl
)
992 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
994 /* Let the back-end know about this variable. */
995 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
996 emit_local_var (decl
);
998 expand_anon_union_decl (decl
, NULL_TREE
,
999 DECL_ANON_UNION_ELEMS (decl
));
1008 /* Return the VAR_DECL for a const char array naming the current
1009 function. If the VAR_DECL has not yet been created, create it
1010 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1011 ID is its name (unfortunately C and C++ hold the RID values of
1012 keywords in different places, so we can't derive RID from ID in
1013 this language independent code. */
1016 fname_decl (unsigned int rid
, tree id
)
1019 tree decl
= NULL_TREE
;
1021 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
1022 if (fname_vars
[ix
].rid
== rid
)
1025 decl
= *fname_vars
[ix
].decl
;
1028 /* If a tree is built here, it would normally have the lineno of
1029 the current statement. Later this tree will be moved to the
1030 beginning of the function and this line number will be wrong.
1031 To avoid this problem set the lineno to 0 here; that prevents
1032 it from appearing in the RTL. */
1034 location_t saved_location
= input_location
;
1035 input_location
= UNKNOWN_LOCATION
;
1037 stmts
= push_stmt_list ();
1038 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
1039 stmts
= pop_stmt_list (stmts
);
1040 if (!IS_EMPTY_STMT (stmts
))
1041 saved_function_name_decls
1042 = tree_cons (decl
, stmts
, saved_function_name_decls
);
1043 *fname_vars
[ix
].decl
= decl
;
1044 input_location
= saved_location
;
1046 if (!ix
&& !current_function_decl
)
1047 pedwarn (input_location
, 0, "%qD is not defined outside of function scope", decl
);
1052 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1055 fix_string_type (tree value
)
1057 int length
= TREE_STRING_LENGTH (value
);
1059 tree e_type
, i_type
, a_type
;
1061 /* Compute the number of elements, for the array type. */
1062 if (TREE_TYPE (value
) == char_array_type_node
|| !TREE_TYPE (value
))
1065 e_type
= char_type_node
;
1067 else if (TREE_TYPE (value
) == char16_array_type_node
)
1069 nchars
= length
/ (TYPE_PRECISION (char16_type_node
) / BITS_PER_UNIT
);
1070 e_type
= char16_type_node
;
1072 else if (TREE_TYPE (value
) == char32_array_type_node
)
1074 nchars
= length
/ (TYPE_PRECISION (char32_type_node
) / BITS_PER_UNIT
);
1075 e_type
= char32_type_node
;
1079 nchars
= length
/ (TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
);
1080 e_type
= wchar_type_node
;
1083 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
1084 limit in C++98 Annex B is very large (65536) and is not normative,
1085 so we do not diagnose it (warn_overlength_strings is forced off
1086 in c_common_post_options). */
1087 if (warn_overlength_strings
)
1089 const int nchars_max
= flag_isoc99
? 4095 : 509;
1090 const int relevant_std
= flag_isoc99
? 99 : 90;
1091 if (nchars
- 1 > nchars_max
)
1092 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
1093 separate the %d from the 'C'. 'ISO' should not be
1094 translated, but it may be moved after 'C%d' in languages
1095 where modifiers follow nouns. */
1096 pedwarn (input_location
, OPT_Woverlength_strings
,
1097 "string length %qd is greater than the length %qd "
1098 "ISO C%d compilers are required to support",
1099 nchars
- 1, nchars_max
, relevant_std
);
1102 /* Create the array type for the string constant. The ISO C++
1103 standard says that a string literal has type `const char[N]' or
1104 `const wchar_t[N]'. We use the same logic when invoked as a C
1105 front-end with -Wwrite-strings.
1106 ??? We should change the type of an expression depending on the
1107 state of a warning flag. We should just be warning -- see how
1108 this is handled in the C++ front-end for the deprecated implicit
1109 conversion from string literals to `char*' or `wchar_t*'.
1111 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
1112 array type being the unqualified version of that type.
1113 Therefore, if we are constructing an array of const char, we must
1114 construct the matching unqualified array type first. The C front
1115 end does not require this, but it does no harm, so we do it
1117 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
1118 a_type
= build_array_type (e_type
, i_type
);
1119 if (c_dialect_cxx() || warn_write_strings
)
1120 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
1122 TREE_TYPE (value
) = a_type
;
1123 TREE_CONSTANT (value
) = 1;
1124 TREE_READONLY (value
) = 1;
1125 TREE_STATIC (value
) = 1;
1129 /* Print a warning if a constant expression had overflow in folding.
1130 Invoke this function on every expression that the language
1131 requires to be a constant expression.
1132 Note the ANSI C standard says it is erroneous for a
1133 constant expression to overflow. */
1136 constant_expression_warning (tree value
)
1138 if (warn_overflow
&& pedantic
1139 && (TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1140 || TREE_CODE (value
) == FIXED_CST
1141 || TREE_CODE (value
) == VECTOR_CST
1142 || TREE_CODE (value
) == COMPLEX_CST
)
1143 && TREE_OVERFLOW (value
))
1144 pedwarn (input_location
, OPT_Woverflow
, "overflow in constant expression");
1147 /* The same as above but print an unconditional error. */
1149 constant_expression_error (tree value
)
1151 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
1152 || TREE_CODE (value
) == FIXED_CST
1153 || TREE_CODE (value
) == VECTOR_CST
1154 || TREE_CODE (value
) == COMPLEX_CST
)
1155 && TREE_OVERFLOW (value
))
1156 error ("overflow in constant expression");
1159 /* Print a warning if an expression had overflow in folding and its
1162 Invoke this function on every expression that
1163 (1) appears in the source code, and
1164 (2) is a constant expression that overflowed, and
1165 (3) is not already checked by convert_and_check;
1166 however, do not invoke this function on operands of explicit casts
1167 or when the expression is the result of an operator and any operand
1168 already overflowed. */
1171 overflow_warning (tree value
)
1173 if (skip_evaluation
) return;
1175 switch (TREE_CODE (value
))
1178 warning (OPT_Woverflow
, "integer overflow in expression");
1182 warning (OPT_Woverflow
, "floating point overflow in expression");
1186 warning (OPT_Woverflow
, "fixed-point overflow in expression");
1190 warning (OPT_Woverflow
, "vector overflow in expression");
1194 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
1195 warning (OPT_Woverflow
, "complex integer overflow in expression");
1196 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
1197 warning (OPT_Woverflow
, "complex floating point overflow in expression");
1206 /* Warn about use of a logical || / && operator being used in a
1207 context where it is likely that the bitwise equivalent was intended
1208 by the programmer. CODE is the TREE_CODE of the operator, ARG1
1209 and ARG2 the arguments. */
1212 warn_logical_operator (enum tree_code code
, tree arg1
, tree
1217 case TRUTH_ANDIF_EXPR
:
1218 case TRUTH_ORIF_EXPR
:
1220 case TRUTH_AND_EXPR
:
1221 if (!TREE_NO_WARNING (arg1
)
1222 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
1223 && !CONSTANT_CLASS_P (arg1
)
1224 && TREE_CODE (arg2
) == INTEGER_CST
1225 && !integer_zerop (arg2
))
1227 warning (OPT_Wlogical_op
,
1228 "logical %<%s%> with non-zero constant "
1229 "will always evaluate as true",
1230 ((code
== TRUTH_ANDIF_EXPR
)
1231 || (code
== TRUTH_AND_EXPR
)) ? "&&" : "||");
1232 TREE_NO_WARNING (arg1
) = true;
1241 /* Print a warning about casts that might indicate violation
1242 of strict aliasing rules if -Wstrict-aliasing is used and
1243 strict aliasing mode is in effect. OTYPE is the original
1244 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1247 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1249 if (!(flag_strict_aliasing
1250 && POINTER_TYPE_P (type
)
1251 && POINTER_TYPE_P (otype
)
1252 && !VOID_TYPE_P (TREE_TYPE (type
)))
1253 /* If the type we are casting to is a ref-all pointer
1254 dereferencing it is always valid. */
1255 || TYPE_REF_CAN_ALIAS_ALL (type
))
1258 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1259 && (DECL_P (TREE_OPERAND (expr
, 0))
1260 || handled_component_p (TREE_OPERAND (expr
, 0))))
1262 /* Casting the address of an object to non void pointer. Warn
1263 if the cast breaks type based aliasing. */
1264 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1266 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1267 "might break strict-aliasing rules");
1272 /* warn_strict_aliasing >= 3. This includes the default (3).
1273 Only warn if the cast is dereferenced immediately. */
1274 alias_set_type set1
=
1275 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1276 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1278 if (set1
!= set2
&& set2
!= 0
1279 && (set1
== 0 || !alias_sets_conflict_p (set1
, set2
)))
1281 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1282 "pointer will break strict-aliasing rules");
1285 else if (warn_strict_aliasing
== 2
1286 && !alias_sets_must_conflict_p (set1
, set2
))
1288 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1289 "pointer might break strict-aliasing rules");
1295 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1297 /* At this level, warn for any conversions, even if an address is
1298 not taken in the same statement. This will likely produce many
1299 false positives, but could be useful to pinpoint problems that
1300 are not revealed at higher levels. */
1301 alias_set_type set1
= get_alias_set (TREE_TYPE (otype
));
1302 alias_set_type set2
= get_alias_set (TREE_TYPE (type
));
1303 if (!COMPLETE_TYPE_P (type
)
1304 || !alias_sets_must_conflict_p (set1
, set2
))
1306 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1307 "pointer might break strict-aliasing rules");
1315 /* Print a warning about if (); or if () .. else; constructs
1316 via the special empty statement node that we create. INNER_THEN
1317 and INNER_ELSE are the statement lists of the if and the else
1321 empty_if_body_warning (tree inner_then
, tree inner_else
)
1323 if (TREE_CODE (inner_then
) == STATEMENT_LIST
1324 && STATEMENT_LIST_TAIL (inner_then
))
1325 inner_then
= STATEMENT_LIST_TAIL (inner_then
)->stmt
;
1327 if (inner_else
&& TREE_CODE (inner_else
) == STATEMENT_LIST
1328 && STATEMENT_LIST_TAIL (inner_else
))
1329 inner_else
= STATEMENT_LIST_TAIL (inner_else
)->stmt
;
1331 if (IS_EMPTY_STMT (inner_then
) && !inner_else
)
1332 warning (OPT_Wempty_body
, "%Hsuggest braces around empty body "
1333 "in an %<if%> statement", EXPR_LOCUS (inner_then
));
1335 else if (inner_else
&& IS_EMPTY_STMT (inner_else
))
1336 warning (OPT_Wempty_body
, "%Hsuggest braces around empty body "
1337 "in an %<else%> statement", EXPR_LOCUS (inner_else
));
1340 /* Warn for unlikely, improbable, or stupid DECL declarations
1344 check_main_parameter_types (tree decl
)
1349 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1350 args
= TREE_CHAIN (args
))
1352 tree type
= args
? TREE_VALUE (args
) : 0;
1354 if (type
== void_type_node
|| type
== error_mark_node
)
1361 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1362 pedwarn (input_location
, OPT_Wmain
, "first argument of %q+D should be %<int%>",
1367 if (TREE_CODE (type
) != POINTER_TYPE
1368 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1369 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1371 pedwarn (input_location
, OPT_Wmain
, "second argument of %q+D should be %<char **%>",
1376 if (TREE_CODE (type
) != POINTER_TYPE
1377 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1378 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1380 pedwarn (input_location
, OPT_Wmain
, "third argument of %q+D should probably be "
1381 "%<char **%>", decl
);
1386 /* It is intentional that this message does not mention the third
1387 argument because it's only mentioned in an appendix of the
1389 if (argct
> 0 && (argct
< 2 || argct
> 3))
1390 pedwarn (input_location
, OPT_Wmain
, "%q+D takes only zero or two arguments", decl
);
1393 /* True if pointers to distinct types T1 and T2 can be converted to
1394 each other without an explicit cast. Only returns true for opaque
1397 vector_targets_convertible_p (const_tree t1
, const_tree t2
)
1399 if (TREE_CODE (t1
) == VECTOR_TYPE
&& TREE_CODE (t2
) == VECTOR_TYPE
1400 && (targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1401 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1407 /* True if vector types T1 and T2 can be converted to each other
1408 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1409 can only be converted with -flax-vector-conversions yet that is not
1410 in effect, emit a note telling the user about that option if such
1411 a note has not previously been emitted. */
1413 vector_types_convertible_p (const_tree t1
, const_tree t2
, bool emit_lax_note
)
1415 static bool emitted_lax_note
= false;
1416 bool convertible_lax
;
1418 if ((targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1419 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1423 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1424 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1425 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1426 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1427 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1429 if (!convertible_lax
|| flag_lax_vector_conversions
)
1430 return convertible_lax
;
1432 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1433 && lang_hooks
.types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1436 if (emit_lax_note
&& !emitted_lax_note
)
1438 emitted_lax_note
= true;
1439 inform (input_location
, "use -flax-vector-conversions to permit "
1440 "conversions between vectors with differing "
1441 "element types or numbers of subparts");
1447 /* This is a helper function of build_binary_op.
1449 For certain operations if both args were extended from the same
1450 smaller type, do the arithmetic in that type and then extend.
1452 BITWISE indicates a bitwise operation.
1453 For them, this optimization is safe only if
1454 both args are zero-extended or both are sign-extended.
1455 Otherwise, we might change the result.
1456 Eg, (short)-1 | (unsigned short)-1 is (int)-1
1457 but calculated in (unsigned short) it would be (unsigned short)-1.
1459 tree
shorten_binary_op (tree result_type
, tree op0
, tree op1
, bool bitwise
)
1461 int unsigned0
, unsigned1
;
1466 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
1467 excessive narrowing when we call get_narrower below. For
1468 example, suppose that OP0 is of unsigned int extended
1469 from signed char and that RESULT_TYPE is long long int.
1470 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
1473 (long long int) (unsigned int) signed_char
1475 which get_narrower would narrow down to
1477 (unsigned int) signed char
1479 If we do not cast OP0 first, get_narrower would return
1480 signed_char, which is inconsistent with the case of the
1482 op0
= convert (result_type
, op0
);
1483 op1
= convert (result_type
, op1
);
1485 arg0
= get_narrower (op0
, &unsigned0
);
1486 arg1
= get_narrower (op1
, &unsigned1
);
1488 /* UNS is 1 if the operation to be done is an unsigned one. */
1489 uns
= TYPE_UNSIGNED (result_type
);
1491 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
1492 but it *requires* conversion to FINAL_TYPE. */
1494 if ((TYPE_PRECISION (TREE_TYPE (op0
))
1495 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1496 && TREE_TYPE (op0
) != result_type
)
1497 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1498 if ((TYPE_PRECISION (TREE_TYPE (op1
))
1499 == TYPE_PRECISION (TREE_TYPE (arg1
)))
1500 && TREE_TYPE (op1
) != result_type
)
1501 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1503 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
1505 /* For bitwise operations, signedness of nominal type
1506 does not matter. Consider only how operands were extended. */
1510 /* Note that in all three cases below we refrain from optimizing
1511 an unsigned operation on sign-extended args.
1512 That would not be valid. */
1514 /* Both args variable: if both extended in same way
1515 from same width, do it in that width.
1516 Do it unsigned if args were zero-extended. */
1517 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
1518 < TYPE_PRECISION (result_type
))
1519 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1520 == TYPE_PRECISION (TREE_TYPE (arg0
)))
1521 && unsigned0
== unsigned1
1522 && (unsigned0
|| !uns
))
1523 return c_common_signed_or_unsigned_type
1524 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
1526 else if (TREE_CODE (arg0
) == INTEGER_CST
1527 && (unsigned1
|| !uns
)
1528 && (TYPE_PRECISION (TREE_TYPE (arg1
))
1529 < TYPE_PRECISION (result_type
))
1531 = c_common_signed_or_unsigned_type (unsigned1
,
1533 && !POINTER_TYPE_P (type
)
1534 && int_fits_type_p (arg0
, type
))
1537 else if (TREE_CODE (arg1
) == INTEGER_CST
1538 && (unsigned0
|| !uns
)
1539 && (TYPE_PRECISION (TREE_TYPE (arg0
))
1540 < TYPE_PRECISION (result_type
))
1542 = c_common_signed_or_unsigned_type (unsigned0
,
1544 && !POINTER_TYPE_P (type
)
1545 && int_fits_type_p (arg1
, type
))
1551 /* Warns if the conversion of EXPR to TYPE may alter a value.
1552 This is a helper function for warnings_for_convert_and_check. */
1555 conversion_warning (tree type
, tree expr
)
1557 bool give_warning
= false;
1560 const int expr_num_operands
= TREE_OPERAND_LENGTH (expr
);
1561 tree expr_type
= TREE_TYPE (expr
);
1563 if (!warn_conversion
&& !warn_sign_conversion
)
1566 /* If any operand is artificial, then this expression was generated
1567 by the compiler and we do not warn. */
1568 for (i
= 0; i
< expr_num_operands
; i
++)
1570 tree op
= TREE_OPERAND (expr
, i
);
1571 if (op
&& DECL_P (op
) && DECL_ARTIFICIAL (op
))
1575 switch (TREE_CODE (expr
))
1583 case TRUTH_ANDIF_EXPR
:
1584 case TRUTH_ORIF_EXPR
:
1585 case TRUTH_AND_EXPR
:
1587 case TRUTH_XOR_EXPR
:
1588 case TRUTH_NOT_EXPR
:
1589 /* Conversion from boolean to a signed:1 bit-field (which only
1590 can hold the values 0 and -1) doesn't lose information - but
1591 it does change the value. */
1592 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
1593 warning (OPT_Wconversion
,
1594 "conversion to %qT from boolean expression", type
);
1600 /* Warn for real constant that is not an exact integer converted
1602 if (TREE_CODE (expr_type
) == REAL_TYPE
1603 && TREE_CODE (type
) == INTEGER_TYPE
)
1605 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (expr_type
)))
1606 give_warning
= true;
1608 /* Warn for an integer constant that does not fit into integer type. */
1609 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1610 && TREE_CODE (type
) == INTEGER_TYPE
1611 && !int_fits_type_p (expr
, type
))
1613 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)
1614 && tree_int_cst_sgn (expr
) < 0)
1615 warning (OPT_Wsign_conversion
,
1616 "negative integer implicitly converted to unsigned type");
1617 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (expr_type
))
1618 warning (OPT_Wsign_conversion
, "conversion of unsigned constant "
1619 "value to negative integer");
1621 give_warning
= true;
1623 else if (TREE_CODE (type
) == REAL_TYPE
)
1625 /* Warn for an integer constant that does not fit into real type. */
1626 if (TREE_CODE (expr_type
) == INTEGER_TYPE
)
1628 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1629 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1630 give_warning
= true;
1632 /* Warn for a real constant that does not fit into a smaller
1634 else if (TREE_CODE (expr_type
) == REAL_TYPE
1635 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1637 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1638 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1639 give_warning
= true;
1644 warning (OPT_Wconversion
,
1645 "conversion to %qT alters %qT constant value",
1652 /* In case of COND_EXPR, if both operands are constants or
1653 COND_EXPR, then we do not care about the type of COND_EXPR,
1654 only about the conversion of each operand. */
1655 tree op1
= TREE_OPERAND (expr
, 1);
1656 tree op2
= TREE_OPERAND (expr
, 2);
1658 if ((TREE_CODE (op1
) == REAL_CST
|| TREE_CODE (op1
) == INTEGER_CST
1659 || TREE_CODE (op1
) == COND_EXPR
)
1660 && (TREE_CODE (op2
) == REAL_CST
|| TREE_CODE (op2
) == INTEGER_CST
1661 || TREE_CODE (op2
) == COND_EXPR
))
1663 conversion_warning (type
, op1
);
1664 conversion_warning (type
, op2
);
1670 default: /* 'expr' is not a constant. */
1672 /* Warn for real types converted to integer types. */
1673 if (TREE_CODE (expr_type
) == REAL_TYPE
1674 && TREE_CODE (type
) == INTEGER_TYPE
)
1675 give_warning
= true;
1677 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1678 && TREE_CODE (type
) == INTEGER_TYPE
)
1680 /* Don't warn about unsigned char y = 0xff, x = (int) y; */
1681 expr
= get_unwidened (expr
, 0);
1682 expr_type
= TREE_TYPE (expr
);
1684 /* Don't warn for short y; short x = ((int)y & 0xff); */
1685 if (TREE_CODE (expr
) == BIT_AND_EXPR
1686 || TREE_CODE (expr
) == BIT_IOR_EXPR
1687 || TREE_CODE (expr
) == BIT_XOR_EXPR
)
1689 /* If both args were extended from a shortest type,
1690 use that type if that is safe. */
1691 expr_type
= shorten_binary_op (expr_type
,
1692 TREE_OPERAND (expr
, 0),
1693 TREE_OPERAND (expr
, 1),
1696 if (TREE_CODE (expr
) == BIT_AND_EXPR
)
1698 tree op0
= TREE_OPERAND (expr
, 0);
1699 tree op1
= TREE_OPERAND (expr
, 1);
1700 bool unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
1701 bool unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
1703 /* If one of the operands is a non-negative constant
1704 that fits in the target type, then the type of the
1705 other operand does not matter. */
1706 if ((TREE_CODE (op0
) == INTEGER_CST
1707 && int_fits_type_p (op0
, c_common_signed_type (type
))
1708 && int_fits_type_p (op0
, c_common_unsigned_type (type
)))
1709 || (TREE_CODE (op1
) == INTEGER_CST
1710 && int_fits_type_p (op1
, c_common_signed_type (type
))
1711 && int_fits_type_p (op1
,
1712 c_common_unsigned_type (type
))))
1714 /* If constant is unsigned and fits in the target
1715 type, then the result will also fit. */
1716 else if ((TREE_CODE (op0
) == INTEGER_CST
1718 && int_fits_type_p (op0
, type
))
1719 || (TREE_CODE (op1
) == INTEGER_CST
1721 && int_fits_type_p (op1
, type
)))
1725 /* Warn for integer types converted to smaller integer types. */
1726 if (TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1727 give_warning
= true;
1729 /* When they are the same width but different signedness,
1730 then the value may change. */
1731 else if ((TYPE_PRECISION (type
) == TYPE_PRECISION (expr_type
)
1732 && TYPE_UNSIGNED (expr_type
) != TYPE_UNSIGNED (type
))
1733 /* Even when converted to a bigger type, if the type is
1734 unsigned but expr is signed, then negative values
1736 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (expr_type
)))
1737 warning (OPT_Wsign_conversion
, "conversion to %qT from %qT "
1738 "may change the sign of the result",
1742 /* Warn for integer types converted to real types if and only if
1743 all the range of values of the integer type cannot be
1744 represented by the real type. */
1745 else if (TREE_CODE (expr_type
) == INTEGER_TYPE
1746 && TREE_CODE (type
) == REAL_TYPE
)
1748 tree type_low_bound
= TYPE_MIN_VALUE (expr_type
);
1749 tree type_high_bound
= TYPE_MAX_VALUE (expr_type
);
1750 REAL_VALUE_TYPE real_low_bound
1751 = real_value_from_int_cst (0, type_low_bound
);
1752 REAL_VALUE_TYPE real_high_bound
1753 = real_value_from_int_cst (0, type_high_bound
);
1755 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
1756 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
1757 give_warning
= true;
1760 /* Warn for real types converted to smaller real types. */
1761 else if (TREE_CODE (expr_type
) == REAL_TYPE
1762 && TREE_CODE (type
) == REAL_TYPE
1763 && TYPE_PRECISION (type
) < TYPE_PRECISION (expr_type
))
1764 give_warning
= true;
1768 warning (OPT_Wconversion
,
1769 "conversion to %qT from %qT may alter its value",
1774 /* Produce warnings after a conversion. RESULT is the result of
1775 converting EXPR to TYPE. This is a helper function for
1776 convert_and_check and cp_convert_and_check. */
1779 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
1781 if (TREE_CODE (expr
) == INTEGER_CST
1782 && (TREE_CODE (type
) == INTEGER_TYPE
1783 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1784 && !int_fits_type_p (expr
, type
))
1786 /* Do not diagnose overflow in a constant expression merely
1787 because a conversion overflowed. */
1788 if (TREE_OVERFLOW (result
))
1789 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
1791 if (TYPE_UNSIGNED (type
))
1793 /* This detects cases like converting -129 or 256 to
1795 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
1796 warning (OPT_Woverflow
,
1797 "large integer implicitly truncated to unsigned type");
1799 conversion_warning (type
, expr
);
1801 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
1802 warning (OPT_Woverflow
,
1803 "overflow in implicit constant conversion");
1804 /* No warning for converting 0x80000000 to int. */
1806 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
1807 || TYPE_PRECISION (TREE_TYPE (expr
))
1808 != TYPE_PRECISION (type
)))
1809 warning (OPT_Woverflow
,
1810 "overflow in implicit constant conversion");
1813 conversion_warning (type
, expr
);
1815 else if ((TREE_CODE (result
) == INTEGER_CST
1816 || TREE_CODE (result
) == FIXED_CST
) && TREE_OVERFLOW (result
))
1817 warning (OPT_Woverflow
,
1818 "overflow in implicit constant conversion");
1820 conversion_warning (type
, expr
);
1824 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1825 Invoke this function on every expression that is converted implicitly,
1826 i.e. because of language rules and not because of an explicit cast. */
1829 convert_and_check (tree type
, tree expr
)
1833 if (TREE_TYPE (expr
) == type
)
1836 result
= convert (type
, expr
);
1838 if (!skip_evaluation
&& !TREE_OVERFLOW_P (expr
) && result
!= error_mark_node
)
1839 warnings_for_convert_and_check (type
, expr
, result
);
1844 /* A node in a list that describes references to variables (EXPR), which are
1845 either read accesses if WRITER is zero, or write accesses, in which case
1846 WRITER is the parent of EXPR. */
1853 /* Used to implement a cache the results of a call to verify_tree. We only
1854 use this for SAVE_EXPRs. */
1857 struct tlist_cache
*next
;
1858 struct tlist
*cache_before_sp
;
1859 struct tlist
*cache_after_sp
;
1863 /* Obstack to use when allocating tlist structures, and corresponding
1865 static struct obstack tlist_obstack
;
1866 static char *tlist_firstobj
= 0;
1868 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1870 static struct tlist
*warned_ids
;
1871 /* SAVE_EXPRs need special treatment. We process them only once and then
1872 cache the results. */
1873 static struct tlist_cache
*save_expr_cache
;
1875 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1876 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1877 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1878 static int warning_candidate_p (tree
);
1879 static void warn_for_collisions (struct tlist
*);
1880 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1881 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1883 /* Create a new struct tlist and fill in its fields. */
1884 static struct tlist
*
1885 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1888 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1895 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1896 is nonnull, we ignore any node we find which has a writer equal to it. */
1899 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1903 struct tlist
*next
= add
->next
;
1906 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1907 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1912 /* Merge the nodes of ADD into TO. This merging process is done so that for
1913 each variable that already exists in TO, no new node is added; however if
1914 there is a write access recorded in ADD, and an occurrence on TO is only
1915 a read access, then the occurrence in TO will be modified to record the
1919 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1921 struct tlist
**end
= to
;
1924 end
= &(*end
)->next
;
1930 struct tlist
*next
= add
->next
;
1932 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1933 if (tmp2
->expr
== add
->expr
)
1937 tmp2
->writer
= add
->writer
;
1941 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1942 end
= &(*end
)->next
;
1949 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1950 references in list LIST conflict with it, excluding reads if ONLY writers
1954 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1959 /* Avoid duplicate warnings. */
1960 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1961 if (tmp
->expr
== written
)
1966 if (list
->expr
== written
1967 && list
->writer
!= writer
1968 && (!only_writes
|| list
->writer
)
1969 && DECL_NAME (list
->expr
))
1971 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1972 warning_at (EXPR_HAS_LOCATION (writer
)
1973 ? EXPR_LOCATION (writer
) : input_location
,
1974 OPT_Wsequence_point
, "operation on %qE may be undefined",
1981 /* Given a list LIST of references to variables, find whether any of these
1982 can cause conflicts due to missing sequence points. */
1985 warn_for_collisions (struct tlist
*list
)
1989 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1992 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1996 /* Return nonzero if X is a tree that can be verified by the sequence point
1999 warning_candidate_p (tree x
)
2001 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
2004 /* Walk the tree X, and record accesses to variables. If X is written by the
2005 parent tree, WRITER is the parent.
2006 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
2007 expression or its only operand forces a sequence point, then everything up
2008 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
2010 Once we return, we will have emitted warnings if any subexpression before
2011 such a sequence point could be undefined. On a higher level, however, the
2012 sequence point may not be relevant, and we'll merge the two lists.
2014 Example: (b++, a) + b;
2015 The call that processes the COMPOUND_EXPR will store the increment of B
2016 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
2017 processes the PLUS_EXPR will need to merge the two lists so that
2018 eventually, all accesses end up on the same list (and we'll warn about the
2019 unordered subexpressions b++ and b.
2021 A note on merging. If we modify the former example so that our expression
2024 care must be taken not simply to add all three expressions into the final
2025 PNO_SP list. The function merge_tlist takes care of that by merging the
2026 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
2027 way, so that no more than one access to B is recorded. */
2030 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
2033 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
2034 enum tree_code code
;
2035 enum tree_code_class cl
;
2037 /* X may be NULL if it is the operand of an empty statement expression
2043 code
= TREE_CODE (x
);
2044 cl
= TREE_CODE_CLASS (code
);
2046 if (warning_candidate_p (x
))
2048 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
2058 case TRUTH_ANDIF_EXPR
:
2059 case TRUTH_ORIF_EXPR
:
2060 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2061 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2062 warn_for_collisions (tmp_nosp
);
2063 merge_tlist (pbefore_sp
, tmp_before
, 0);
2064 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
2065 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
2066 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2070 tmp_before
= tmp_list2
= 0;
2071 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
2072 warn_for_collisions (tmp_list2
);
2073 merge_tlist (pbefore_sp
, tmp_before
, 0);
2074 merge_tlist (pbefore_sp
, tmp_list2
, 1);
2076 tmp_list3
= tmp_nosp
= 0;
2077 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
2078 warn_for_collisions (tmp_nosp
);
2079 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2081 tmp_list3
= tmp_list2
= 0;
2082 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
2083 warn_for_collisions (tmp_list2
);
2084 merge_tlist (pbefore_sp
, tmp_list3
, 0);
2085 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
2086 two first, to avoid warning for (a ? b++ : b++). */
2087 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
2088 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2091 case PREDECREMENT_EXPR
:
2092 case PREINCREMENT_EXPR
:
2093 case POSTDECREMENT_EXPR
:
2094 case POSTINCREMENT_EXPR
:
2095 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
2099 tmp_before
= tmp_nosp
= tmp_list3
= 0;
2100 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2101 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
2102 /* Expressions inside the LHS are not ordered wrt. the sequence points
2103 in the RHS. Example:
2105 Despite the fact that the modification of "a" is in the before_sp
2106 list (tmp_before), it conflicts with the use of "a" in the LHS.
2107 We can handle this by adding the contents of tmp_list3
2108 to those of tmp_before, and redoing the collision warnings for that
2110 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
2111 warn_for_collisions (tmp_before
);
2112 /* Exclude the LHS itself here; we first have to merge it into the
2113 tmp_nosp list. This is done to avoid warning for "a = a"; if we
2114 didn't exclude the LHS, we'd get it twice, once as a read and once
2116 add_tlist (pno_sp
, tmp_list3
, x
, 0);
2117 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
2119 merge_tlist (pbefore_sp
, tmp_before
, 0);
2120 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
2121 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
2122 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
2126 /* We need to warn about conflicts among arguments and conflicts between
2127 args and the function address. Side effects of the function address,
2128 however, are not ordered by the sequence point of the call. */
2130 call_expr_arg_iterator iter
;
2132 tmp_before
= tmp_nosp
= 0;
2133 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2134 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
2136 tmp_list2
= tmp_list3
= 0;
2137 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
2138 merge_tlist (&tmp_list3
, tmp_list2
, 0);
2139 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
2141 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
2142 warn_for_collisions (tmp_before
);
2143 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
2148 /* Scan all the list, e.g. indices of multi dimensional array. */
2151 tmp_before
= tmp_nosp
= 0;
2152 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2153 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2154 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2161 struct tlist_cache
*t
;
2162 for (t
= save_expr_cache
; t
; t
= t
->next
)
2168 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
2169 t
->next
= save_expr_cache
;
2171 save_expr_cache
= t
;
2173 tmp_before
= tmp_nosp
= 0;
2174 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
2175 warn_for_collisions (tmp_nosp
);
2180 struct tlist
*t
= tmp_nosp
;
2182 merge_tlist (&tmp_list3
, t
, 0);
2184 t
->cache_before_sp
= tmp_before
;
2185 t
->cache_after_sp
= tmp_list3
;
2187 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
2188 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
2193 x
= TREE_OPERAND (x
, 0);
2200 /* For other expressions, simply recurse on their operands.
2201 Manual tail recursion for unary expressions.
2202 Other non-expressions need not be processed. */
2203 if (cl
== tcc_unary
)
2205 x
= TREE_OPERAND (x
, 0);
2209 else if (IS_EXPR_CODE_CLASS (cl
))
2212 int max
= TREE_OPERAND_LENGTH (x
);
2213 for (lp
= 0; lp
< max
; lp
++)
2215 tmp_before
= tmp_nosp
= 0;
2216 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
2217 merge_tlist (&tmp_nosp
, tmp_before
, 0);
2218 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
2225 /* Try to warn for undefined behavior in EXPR due to missing sequence
2229 verify_sequence_points (tree expr
)
2231 struct tlist
*before_sp
= 0, *after_sp
= 0;
2234 save_expr_cache
= 0;
2235 if (tlist_firstobj
== 0)
2237 gcc_obstack_init (&tlist_obstack
);
2238 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
2241 verify_tree (expr
, &before_sp
, &after_sp
, 0);
2242 warn_for_collisions (after_sp
);
2243 obstack_free (&tlist_obstack
, tlist_firstobj
);
2246 /* Validate the expression after `case' and apply default promotions. */
2249 check_case_value (tree value
)
2251 if (value
== NULL_TREE
)
2254 /* ??? Can we ever get nops here for a valid case value? We
2256 STRIP_TYPE_NOPS (value
);
2257 /* In C++, the following is allowed:
2260 switch (...) { case i: ... }
2262 So, we try to reduce the VALUE to a constant that way. */
2263 if (c_dialect_cxx ())
2265 value
= decl_constant_value (value
);
2266 STRIP_TYPE_NOPS (value
);
2267 value
= fold (value
);
2270 if (TREE_CODE (value
) == INTEGER_CST
)
2271 /* Promote char or short to int. */
2272 value
= perform_integral_promotions (value
);
2273 else if (value
!= error_mark_node
)
2275 error ("case label does not reduce to an integer constant");
2276 value
= error_mark_node
;
2279 constant_expression_warning (value
);
2284 /* See if the case values LOW and HIGH are in the range of the original
2285 type (i.e. before the default conversion to int) of the switch testing
2287 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
2288 the type before promoting it. CASE_LOW_P is a pointer to the lower
2289 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
2290 if the case is not a case range.
2291 The caller has to make sure that we are not called with NULL for
2292 CASE_LOW_P (i.e. the default case).
2293 Returns true if the case label is in range of ORIG_TYPE (saturated or
2294 untouched) or false if the label is out of range. */
2297 check_case_bounds (tree type
, tree orig_type
,
2298 tree
*case_low_p
, tree
*case_high_p
)
2300 tree min_value
, max_value
;
2301 tree case_low
= *case_low_p
;
2302 tree case_high
= case_high_p
? *case_high_p
: case_low
;
2304 /* If there was a problem with the original type, do nothing. */
2305 if (orig_type
== error_mark_node
)
2308 min_value
= TYPE_MIN_VALUE (orig_type
);
2309 max_value
= TYPE_MAX_VALUE (orig_type
);
2311 /* Case label is less than minimum for type. */
2312 if (tree_int_cst_compare (case_low
, min_value
) < 0
2313 && tree_int_cst_compare (case_high
, min_value
) < 0)
2315 warning (0, "case label value is less than minimum value for type");
2319 /* Case value is greater than maximum for type. */
2320 if (tree_int_cst_compare (case_low
, max_value
) > 0
2321 && tree_int_cst_compare (case_high
, max_value
) > 0)
2323 warning (0, "case label value exceeds maximum value for type");
2327 /* Saturate lower case label value to minimum. */
2328 if (tree_int_cst_compare (case_high
, min_value
) >= 0
2329 && tree_int_cst_compare (case_low
, min_value
) < 0)
2331 warning (0, "lower value in case label range"
2332 " less than minimum value for type");
2333 case_low
= min_value
;
2336 /* Saturate upper case label value to maximum. */
2337 if (tree_int_cst_compare (case_low
, max_value
) <= 0
2338 && tree_int_cst_compare (case_high
, max_value
) > 0)
2340 warning (0, "upper value in case label range"
2341 " exceeds maximum value for type");
2342 case_high
= max_value
;
2345 if (*case_low_p
!= case_low
)
2346 *case_low_p
= convert (type
, case_low
);
2347 if (case_high_p
&& *case_high_p
!= case_high
)
2348 *case_high_p
= convert (type
, case_high
);
2353 /* Return an integer type with BITS bits of precision,
2354 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2357 c_common_type_for_size (unsigned int bits
, int unsignedp
)
2359 if (bits
== TYPE_PRECISION (integer_type_node
))
2360 return unsignedp
? unsigned_type_node
: integer_type_node
;
2362 if (bits
== TYPE_PRECISION (signed_char_type_node
))
2363 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2365 if (bits
== TYPE_PRECISION (short_integer_type_node
))
2366 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2368 if (bits
== TYPE_PRECISION (long_integer_type_node
))
2369 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2371 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
2372 return (unsignedp
? long_long_unsigned_type_node
2373 : long_long_integer_type_node
);
2375 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
2376 return (unsignedp
? widest_unsigned_literal_type_node
2377 : widest_integer_literal_type_node
);
2379 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2380 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2382 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2383 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2385 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2386 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2388 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2389 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2394 /* Return a fixed-point type that has at least IBIT ibits and FBIT fbits
2395 that is unsigned if UNSIGNEDP is nonzero, otherwise signed;
2396 and saturating if SATP is nonzero, otherwise not saturating. */
2399 c_common_fixed_point_type_for_size (unsigned int ibit
, unsigned int fbit
,
2400 int unsignedp
, int satp
)
2402 enum machine_mode mode
;
2404 mode
= unsignedp
? UQQmode
: QQmode
;
2406 mode
= unsignedp
? UHAmode
: HAmode
;
2408 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
2409 if (GET_MODE_IBIT (mode
) >= ibit
&& GET_MODE_FBIT (mode
) >= fbit
)
2412 if (mode
== VOIDmode
|| !targetm
.scalar_mode_supported_p (mode
))
2414 sorry ("GCC cannot support operators with integer types and "
2415 "fixed-point types that have too many integral and "
2416 "fractional bits together");
2420 return c_common_type_for_mode (mode
, satp
);
2423 /* Used for communication between c_common_type_for_mode and
2424 c_register_builtin_type. */
2425 static GTY(()) tree registered_builtin_types
;
2427 /* Return a data type that has machine mode MODE.
2428 If the mode is an integer,
2429 then UNSIGNEDP selects between signed and unsigned types.
2430 If the mode is a fixed-point mode,
2431 then UNSIGNEDP selects between saturating and nonsaturating types. */
2434 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
2438 if (mode
== TYPE_MODE (integer_type_node
))
2439 return unsignedp
? unsigned_type_node
: integer_type_node
;
2441 if (mode
== TYPE_MODE (signed_char_type_node
))
2442 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2444 if (mode
== TYPE_MODE (short_integer_type_node
))
2445 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2447 if (mode
== TYPE_MODE (long_integer_type_node
))
2448 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2450 if (mode
== TYPE_MODE (long_long_integer_type_node
))
2451 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2453 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
2454 return unsignedp
? widest_unsigned_literal_type_node
2455 : widest_integer_literal_type_node
;
2458 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2461 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2464 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2467 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2469 #if HOST_BITS_PER_WIDE_INT >= 64
2470 if (mode
== TYPE_MODE (intTI_type_node
))
2471 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2474 if (mode
== TYPE_MODE (float_type_node
))
2475 return float_type_node
;
2477 if (mode
== TYPE_MODE (double_type_node
))
2478 return double_type_node
;
2480 if (mode
== TYPE_MODE (long_double_type_node
))
2481 return long_double_type_node
;
2483 if (mode
== TYPE_MODE (void_type_node
))
2484 return void_type_node
;
2486 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
2488 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2489 : make_signed_type (GET_MODE_PRECISION (mode
)));
2491 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
2493 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
2494 : make_signed_type (GET_MODE_PRECISION (mode
)));
2496 if (COMPLEX_MODE_P (mode
))
2498 enum machine_mode inner_mode
;
2501 if (mode
== TYPE_MODE (complex_float_type_node
))
2502 return complex_float_type_node
;
2503 if (mode
== TYPE_MODE (complex_double_type_node
))
2504 return complex_double_type_node
;
2505 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2506 return complex_long_double_type_node
;
2508 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2509 return complex_integer_type_node
;
2511 inner_mode
= GET_MODE_INNER (mode
);
2512 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2513 if (inner_type
!= NULL_TREE
)
2514 return build_complex_type (inner_type
);
2516 else if (VECTOR_MODE_P (mode
))
2518 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2519 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2520 if (inner_type
!= NULL_TREE
)
2521 return build_vector_type_for_mode (inner_type
, mode
);
2524 if (mode
== TYPE_MODE (dfloat32_type_node
))
2525 return dfloat32_type_node
;
2526 if (mode
== TYPE_MODE (dfloat64_type_node
))
2527 return dfloat64_type_node
;
2528 if (mode
== TYPE_MODE (dfloat128_type_node
))
2529 return dfloat128_type_node
;
2531 if (ALL_SCALAR_FIXED_POINT_MODE_P (mode
))
2533 if (mode
== TYPE_MODE (short_fract_type_node
))
2534 return unsignedp
? sat_short_fract_type_node
: short_fract_type_node
;
2535 if (mode
== TYPE_MODE (fract_type_node
))
2536 return unsignedp
? sat_fract_type_node
: fract_type_node
;
2537 if (mode
== TYPE_MODE (long_fract_type_node
))
2538 return unsignedp
? sat_long_fract_type_node
: long_fract_type_node
;
2539 if (mode
== TYPE_MODE (long_long_fract_type_node
))
2540 return unsignedp
? sat_long_long_fract_type_node
2541 : long_long_fract_type_node
;
2543 if (mode
== TYPE_MODE (unsigned_short_fract_type_node
))
2544 return unsignedp
? sat_unsigned_short_fract_type_node
2545 : unsigned_short_fract_type_node
;
2546 if (mode
== TYPE_MODE (unsigned_fract_type_node
))
2547 return unsignedp
? sat_unsigned_fract_type_node
2548 : unsigned_fract_type_node
;
2549 if (mode
== TYPE_MODE (unsigned_long_fract_type_node
))
2550 return unsignedp
? sat_unsigned_long_fract_type_node
2551 : unsigned_long_fract_type_node
;
2552 if (mode
== TYPE_MODE (unsigned_long_long_fract_type_node
))
2553 return unsignedp
? sat_unsigned_long_long_fract_type_node
2554 : unsigned_long_long_fract_type_node
;
2556 if (mode
== TYPE_MODE (short_accum_type_node
))
2557 return unsignedp
? sat_short_accum_type_node
: short_accum_type_node
;
2558 if (mode
== TYPE_MODE (accum_type_node
))
2559 return unsignedp
? sat_accum_type_node
: accum_type_node
;
2560 if (mode
== TYPE_MODE (long_accum_type_node
))
2561 return unsignedp
? sat_long_accum_type_node
: long_accum_type_node
;
2562 if (mode
== TYPE_MODE (long_long_accum_type_node
))
2563 return unsignedp
? sat_long_long_accum_type_node
2564 : long_long_accum_type_node
;
2566 if (mode
== TYPE_MODE (unsigned_short_accum_type_node
))
2567 return unsignedp
? sat_unsigned_short_accum_type_node
2568 : unsigned_short_accum_type_node
;
2569 if (mode
== TYPE_MODE (unsigned_accum_type_node
))
2570 return unsignedp
? sat_unsigned_accum_type_node
2571 : unsigned_accum_type_node
;
2572 if (mode
== TYPE_MODE (unsigned_long_accum_type_node
))
2573 return unsignedp
? sat_unsigned_long_accum_type_node
2574 : unsigned_long_accum_type_node
;
2575 if (mode
== TYPE_MODE (unsigned_long_long_accum_type_node
))
2576 return unsignedp
? sat_unsigned_long_long_accum_type_node
2577 : unsigned_long_long_accum_type_node
;
2580 return unsignedp
? sat_qq_type_node
: qq_type_node
;
2582 return unsignedp
? sat_hq_type_node
: hq_type_node
;
2584 return unsignedp
? sat_sq_type_node
: sq_type_node
;
2586 return unsignedp
? sat_dq_type_node
: dq_type_node
;
2588 return unsignedp
? sat_tq_type_node
: tq_type_node
;
2590 if (mode
== UQQmode
)
2591 return unsignedp
? sat_uqq_type_node
: uqq_type_node
;
2592 if (mode
== UHQmode
)
2593 return unsignedp
? sat_uhq_type_node
: uhq_type_node
;
2594 if (mode
== USQmode
)
2595 return unsignedp
? sat_usq_type_node
: usq_type_node
;
2596 if (mode
== UDQmode
)
2597 return unsignedp
? sat_udq_type_node
: udq_type_node
;
2598 if (mode
== UTQmode
)
2599 return unsignedp
? sat_utq_type_node
: utq_type_node
;
2602 return unsignedp
? sat_ha_type_node
: ha_type_node
;
2604 return unsignedp
? sat_sa_type_node
: sa_type_node
;
2606 return unsignedp
? sat_da_type_node
: da_type_node
;
2608 return unsignedp
? sat_ta_type_node
: ta_type_node
;
2610 if (mode
== UHAmode
)
2611 return unsignedp
? sat_uha_type_node
: uha_type_node
;
2612 if (mode
== USAmode
)
2613 return unsignedp
? sat_usa_type_node
: usa_type_node
;
2614 if (mode
== UDAmode
)
2615 return unsignedp
? sat_uda_type_node
: uda_type_node
;
2616 if (mode
== UTAmode
)
2617 return unsignedp
? sat_uta_type_node
: uta_type_node
;
2620 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2621 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
2622 return TREE_VALUE (t
);
2628 c_common_unsigned_type (tree type
)
2630 return c_common_signed_or_unsigned_type (1, type
);
2633 /* Return a signed type the same as TYPE in other respects. */
2636 c_common_signed_type (tree type
)
2638 return c_common_signed_or_unsigned_type (0, type
);
2641 /* Return a type the same as TYPE except unsigned or
2642 signed according to UNSIGNEDP. */
2645 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2649 /* This block of code emulates the behavior of the old
2650 c_common_unsigned_type. In particular, it returns
2651 long_unsigned_type_node if passed a long, even when a int would
2652 have the same size. This is necessary for warnings to work
2653 correctly in archs where sizeof(int) == sizeof(long) */
2655 type1
= TYPE_MAIN_VARIANT (type
);
2656 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
2657 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2658 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2659 return unsignedp
? unsigned_type_node
: integer_type_node
;
2660 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2661 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2662 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2663 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2664 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
2665 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2666 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
2667 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
2668 #if HOST_BITS_PER_WIDE_INT >= 64
2669 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2670 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2672 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2673 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2674 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2675 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2676 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2677 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2678 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2679 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2681 #define C_COMMON_FIXED_TYPES(NAME) \
2682 if (type1 == short_ ## NAME ## _type_node \
2683 || type1 == unsigned_short_ ## NAME ## _type_node) \
2684 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2685 : short_ ## NAME ## _type_node; \
2686 if (type1 == NAME ## _type_node \
2687 || type1 == unsigned_ ## NAME ## _type_node) \
2688 return unsignedp ? unsigned_ ## NAME ## _type_node \
2689 : NAME ## _type_node; \
2690 if (type1 == long_ ## NAME ## _type_node \
2691 || type1 == unsigned_long_ ## NAME ## _type_node) \
2692 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2693 : long_ ## NAME ## _type_node; \
2694 if (type1 == long_long_ ## NAME ## _type_node \
2695 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2696 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2697 : long_long_ ## NAME ## _type_node;
2699 #define C_COMMON_FIXED_MODE_TYPES(NAME) \
2700 if (type1 == NAME ## _type_node \
2701 || type1 == u ## NAME ## _type_node) \
2702 return unsignedp ? u ## NAME ## _type_node \
2703 : NAME ## _type_node;
2705 #define C_COMMON_FIXED_TYPES_SAT(NAME) \
2706 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2707 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2708 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2709 : sat_ ## short_ ## NAME ## _type_node; \
2710 if (type1 == sat_ ## NAME ## _type_node \
2711 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2712 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2713 : sat_ ## NAME ## _type_node; \
2714 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2715 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2716 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2717 : sat_ ## long_ ## NAME ## _type_node; \
2718 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2719 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2720 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2721 : sat_ ## long_long_ ## NAME ## _type_node;
2723 #define C_COMMON_FIXED_MODE_TYPES_SAT(NAME) \
2724 if (type1 == sat_ ## NAME ## _type_node \
2725 || type1 == sat_ ## u ## NAME ## _type_node) \
2726 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2727 : sat_ ## NAME ## _type_node;
2729 C_COMMON_FIXED_TYPES (fract
);
2730 C_COMMON_FIXED_TYPES_SAT (fract
);
2731 C_COMMON_FIXED_TYPES (accum
);
2732 C_COMMON_FIXED_TYPES_SAT (accum
);
2734 C_COMMON_FIXED_MODE_TYPES (qq
);
2735 C_COMMON_FIXED_MODE_TYPES (hq
);
2736 C_COMMON_FIXED_MODE_TYPES (sq
);
2737 C_COMMON_FIXED_MODE_TYPES (dq
);
2738 C_COMMON_FIXED_MODE_TYPES (tq
);
2739 C_COMMON_FIXED_MODE_TYPES_SAT (qq
);
2740 C_COMMON_FIXED_MODE_TYPES_SAT (hq
);
2741 C_COMMON_FIXED_MODE_TYPES_SAT (sq
);
2742 C_COMMON_FIXED_MODE_TYPES_SAT (dq
);
2743 C_COMMON_FIXED_MODE_TYPES_SAT (tq
);
2744 C_COMMON_FIXED_MODE_TYPES (ha
);
2745 C_COMMON_FIXED_MODE_TYPES (sa
);
2746 C_COMMON_FIXED_MODE_TYPES (da
);
2747 C_COMMON_FIXED_MODE_TYPES (ta
);
2748 C_COMMON_FIXED_MODE_TYPES_SAT (ha
);
2749 C_COMMON_FIXED_MODE_TYPES_SAT (sa
);
2750 C_COMMON_FIXED_MODE_TYPES_SAT (da
);
2751 C_COMMON_FIXED_MODE_TYPES_SAT (ta
);
2753 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2754 the precision; they have precision set to match their range, but
2755 may use a wider mode to match an ABI. If we change modes, we may
2756 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2757 the precision as well, so as to yield correct results for
2758 bit-field types. C++ does not have these separate bit-field
2759 types, and producing a signed or unsigned variant of an
2760 ENUMERAL_TYPE may cause other problems as well. */
2762 if (!INTEGRAL_TYPE_P (type
)
2763 || TYPE_UNSIGNED (type
) == unsignedp
)
2766 #define TYPE_OK(node) \
2767 (TYPE_MODE (type) == TYPE_MODE (node) \
2768 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2769 if (TYPE_OK (signed_char_type_node
))
2770 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2771 if (TYPE_OK (integer_type_node
))
2772 return unsignedp
? unsigned_type_node
: integer_type_node
;
2773 if (TYPE_OK (short_integer_type_node
))
2774 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2775 if (TYPE_OK (long_integer_type_node
))
2776 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2777 if (TYPE_OK (long_long_integer_type_node
))
2778 return (unsignedp
? long_long_unsigned_type_node
2779 : long_long_integer_type_node
);
2780 if (TYPE_OK (widest_integer_literal_type_node
))
2781 return (unsignedp
? widest_unsigned_literal_type_node
2782 : widest_integer_literal_type_node
);
2784 #if HOST_BITS_PER_WIDE_INT >= 64
2785 if (TYPE_OK (intTI_type_node
))
2786 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2788 if (TYPE_OK (intDI_type_node
))
2789 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2790 if (TYPE_OK (intSI_type_node
))
2791 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2792 if (TYPE_OK (intHI_type_node
))
2793 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2794 if (TYPE_OK (intQI_type_node
))
2795 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2798 if (c_dialect_cxx ())
2801 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2804 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2807 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2809 /* Extended integer types of the same width as a standard type have
2810 lesser rank, so those of the same width as int promote to int or
2811 unsigned int and are valid for printf formats expecting int or
2812 unsigned int. To avoid such special cases, avoid creating
2813 extended integer types for bit-fields if a standard integer type
2815 if (width
== TYPE_PRECISION (integer_type_node
))
2816 return unsignedp
? unsigned_type_node
: integer_type_node
;
2817 if (width
== TYPE_PRECISION (signed_char_type_node
))
2818 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2819 if (width
== TYPE_PRECISION (short_integer_type_node
))
2820 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2821 if (width
== TYPE_PRECISION (long_integer_type_node
))
2822 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2823 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2824 return (unsignedp
? long_long_unsigned_type_node
2825 : long_long_integer_type_node
);
2826 return build_nonstandard_integer_type (width
, unsignedp
);
2829 /* The C version of the register_builtin_type langhook. */
2832 c_register_builtin_type (tree type
, const char* name
)
2836 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
2837 DECL_ARTIFICIAL (decl
) = 1;
2838 if (!TYPE_NAME (type
))
2839 TYPE_NAME (type
) = decl
;
2842 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2846 /* Return the minimum number of bits needed to represent VALUE in a
2847 signed or unsigned type, UNSIGNEDP says which. */
2850 min_precision (tree value
, int unsignedp
)
2854 /* If the value is negative, compute its negative minus 1. The latter
2855 adjustment is because the absolute value of the largest negative value
2856 is one larger than the largest positive value. This is equivalent to
2857 a bit-wise negation, so use that operation instead. */
2859 if (tree_int_cst_sgn (value
) < 0)
2860 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
2862 /* Return the number of bits needed, taking into account the fact
2863 that we need one more bit for a signed than unsigned type. */
2865 if (integer_zerop (value
))
2868 log
= tree_floor_log2 (value
);
2870 return log
+ 1 + !unsignedp
;
2873 /* Print an error message for invalid operands to arith operation
2874 CODE with TYPE0 for operand 0, and TYPE1 for operand 1. */
2877 binary_op_error (enum tree_code code
, tree type0
, tree type1
)
2884 opname
= "+"; break;
2886 opname
= "-"; break;
2888 opname
= "*"; break;
2890 opname
= "max"; break;
2892 opname
= "min"; break;
2894 opname
= "=="; break;
2896 opname
= "!="; break;
2898 opname
= "<="; break;
2900 opname
= ">="; break;
2902 opname
= "<"; break;
2904 opname
= ">"; break;
2906 opname
= "<<"; break;
2908 opname
= ">>"; break;
2909 case TRUNC_MOD_EXPR
:
2910 case FLOOR_MOD_EXPR
:
2911 opname
= "%"; break;
2912 case TRUNC_DIV_EXPR
:
2913 case FLOOR_DIV_EXPR
:
2914 opname
= "/"; break;
2916 opname
= "&"; break;
2918 opname
= "|"; break;
2919 case TRUTH_ANDIF_EXPR
:
2920 opname
= "&&"; break;
2921 case TRUTH_ORIF_EXPR
:
2922 opname
= "||"; break;
2924 opname
= "^"; break;
2928 error ("invalid operands to binary %s (have %qT and %qT)", opname
,
2932 /* Subroutine of build_binary_op, used for comparison operations.
2933 See if the operands have both been converted from subword integer types
2934 and, if so, perhaps change them both back to their original type.
2935 This function is also responsible for converting the two operands
2936 to the proper common type for comparison.
2938 The arguments of this function are all pointers to local variables
2939 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2940 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2942 If this function returns nonzero, it means that the comparison has
2943 a constant value. What this function returns is an expression for
2947 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
2948 enum tree_code
*rescode_ptr
)
2951 tree op0
= *op0_ptr
;
2952 tree op1
= *op1_ptr
;
2953 int unsignedp0
, unsignedp1
;
2955 tree primop0
, primop1
;
2956 enum tree_code code
= *rescode_ptr
;
2958 /* Throw away any conversions to wider types
2959 already present in the operands. */
2961 primop0
= get_narrower (op0
, &unsignedp0
);
2962 primop1
= get_narrower (op1
, &unsignedp1
);
2964 /* Handle the case that OP0 does not *contain* a conversion
2965 but it *requires* conversion to FINAL_TYPE. */
2967 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2968 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2969 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2970 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2972 /* If one of the operands must be floated, we cannot optimize. */
2973 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2974 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2976 /* If first arg is constant, swap the args (changing operation
2977 so value is preserved), for canonicalization. Don't do this if
2978 the second arg is 0. */
2980 if (TREE_CONSTANT (primop0
)
2981 && !integer_zerop (primop1
) && !real_zerop (primop1
)
2982 && !fixed_zerop (primop1
))
2985 int temi
= unsignedp0
;
2993 unsignedp0
= unsignedp1
;
3016 *rescode_ptr
= code
;
3019 /* If comparing an integer against a constant more bits wide,
3020 maybe we can deduce a value of 1 or 0 independent of the data.
3021 Or else truncate the constant now
3022 rather than extend the variable at run time.
3024 This is only interesting if the constant is the wider arg.
3025 Also, it is not safe if the constant is unsigned and the
3026 variable arg is signed, since in this case the variable
3027 would be sign-extended and then regarded as unsigned.
3028 Our technique fails in this case because the lowest/highest
3029 possible unsigned results don't follow naturally from the
3030 lowest/highest possible values of the variable operand.
3031 For just EQ_EXPR and NE_EXPR there is another technique that
3032 could be used: see if the constant can be faithfully represented
3033 in the other operand's type, by truncating it and reextending it
3034 and see if that preserves the constant's value. */
3036 if (!real1
&& !real2
3037 && TREE_CODE (TREE_TYPE (primop0
)) != FIXED_POINT_TYPE
3038 && TREE_CODE (primop1
) == INTEGER_CST
3039 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
3041 int min_gt
, max_gt
, min_lt
, max_lt
;
3042 tree maxval
, minval
;
3043 /* 1 if comparison is nominally unsigned. */
3044 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
3047 type
= c_common_signed_or_unsigned_type (unsignedp0
,
3048 TREE_TYPE (primop0
));
3050 maxval
= TYPE_MAX_VALUE (type
);
3051 minval
= TYPE_MIN_VALUE (type
);
3053 if (unsignedp
&& !unsignedp0
)
3054 *restype_ptr
= c_common_signed_type (*restype_ptr
);
3056 if (TREE_TYPE (primop1
) != *restype_ptr
)
3058 /* Convert primop1 to target type, but do not introduce
3059 additional overflow. We know primop1 is an int_cst. */
3060 primop1
= force_fit_type_double (*restype_ptr
,
3061 TREE_INT_CST_LOW (primop1
),
3062 TREE_INT_CST_HIGH (primop1
), 0,
3063 TREE_OVERFLOW (primop1
));
3065 if (type
!= *restype_ptr
)
3067 minval
= convert (*restype_ptr
, minval
);
3068 maxval
= convert (*restype_ptr
, maxval
);
3071 if (unsignedp
&& unsignedp0
)
3073 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
3074 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
3075 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
3076 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
3080 min_gt
= INT_CST_LT (primop1
, minval
);
3081 max_gt
= INT_CST_LT (primop1
, maxval
);
3082 min_lt
= INT_CST_LT (minval
, primop1
);
3083 max_lt
= INT_CST_LT (maxval
, primop1
);
3087 /* This used to be a switch, but Genix compiler can't handle that. */
3088 if (code
== NE_EXPR
)
3090 if (max_lt
|| min_gt
)
3091 val
= truthvalue_true_node
;
3093 else if (code
== EQ_EXPR
)
3095 if (max_lt
|| min_gt
)
3096 val
= truthvalue_false_node
;
3098 else if (code
== LT_EXPR
)
3101 val
= truthvalue_true_node
;
3103 val
= truthvalue_false_node
;
3105 else if (code
== GT_EXPR
)
3108 val
= truthvalue_true_node
;
3110 val
= truthvalue_false_node
;
3112 else if (code
== LE_EXPR
)
3115 val
= truthvalue_true_node
;
3117 val
= truthvalue_false_node
;
3119 else if (code
== GE_EXPR
)
3122 val
= truthvalue_true_node
;
3124 val
= truthvalue_false_node
;
3127 /* If primop0 was sign-extended and unsigned comparison specd,
3128 we did a signed comparison above using the signed type bounds.
3129 But the comparison we output must be unsigned.
3131 Also, for inequalities, VAL is no good; but if the signed
3132 comparison had *any* fixed result, it follows that the
3133 unsigned comparison just tests the sign in reverse
3134 (positive values are LE, negative ones GE).
3135 So we can generate an unsigned comparison
3136 against an extreme value of the signed type. */
3138 if (unsignedp
&& !unsignedp0
)
3145 primop1
= TYPE_MIN_VALUE (type
);
3151 primop1
= TYPE_MAX_VALUE (type
);
3158 type
= c_common_unsigned_type (type
);
3161 if (TREE_CODE (primop0
) != INTEGER_CST
)
3163 if (val
== truthvalue_false_node
)
3164 warning (OPT_Wtype_limits
, "comparison is always false due to limited range of data type");
3165 if (val
== truthvalue_true_node
)
3166 warning (OPT_Wtype_limits
, "comparison is always true due to limited range of data type");
3171 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3172 if (TREE_SIDE_EFFECTS (primop0
))
3173 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
3177 /* Value is not predetermined, but do the comparison
3178 in the type of the operand that is not constant.
3179 TYPE is already properly set. */
3182 /* If either arg is decimal float and the other is float, find the
3183 proper common type to use for comparison. */
3184 else if (real1
&& real2
3185 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
3186 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
3187 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3189 else if (real1
&& real2
3190 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3191 == TYPE_PRECISION (TREE_TYPE (primop1
))))
3192 type
= TREE_TYPE (primop0
);
3194 /* If args' natural types are both narrower than nominal type
3195 and both extend in the same manner, compare them
3196 in the type of the wider arg.
3197 Otherwise must actually extend both to the nominal
3198 common type lest different ways of extending
3200 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
3202 else if (unsignedp0
== unsignedp1
&& real1
== real2
3203 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
3204 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
3206 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
3207 type
= c_common_signed_or_unsigned_type (unsignedp0
3208 || TYPE_UNSIGNED (*restype_ptr
),
3210 /* Make sure shorter operand is extended the right way
3211 to match the longer operand. */
3213 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
3214 TREE_TYPE (primop0
)),
3217 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
3218 TREE_TYPE (primop1
)),
3223 /* Here we must do the comparison on the nominal type
3224 using the args exactly as we received them. */
3225 type
= *restype_ptr
;
3229 if (!real1
&& !real2
&& integer_zerop (primop1
)
3230 && TYPE_UNSIGNED (*restype_ptr
))
3236 /* All unsigned values are >= 0, so we warn. However,
3237 if OP0 is a constant that is >= 0, the signedness of
3238 the comparison isn't an issue, so suppress the
3240 if (warn_type_limits
&& !in_system_header
3241 && !(TREE_CODE (primop0
) == INTEGER_CST
3242 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3244 warning (OPT_Wtype_limits
,
3245 "comparison of unsigned expression >= 0 is always true");
3246 value
= truthvalue_true_node
;
3250 if (warn_type_limits
&& !in_system_header
3251 && !(TREE_CODE (primop0
) == INTEGER_CST
3252 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
3254 warning (OPT_Wtype_limits
,
3255 "comparison of unsigned expression < 0 is always false");
3256 value
= truthvalue_false_node
;
3265 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
3266 if (TREE_SIDE_EFFECTS (primop0
))
3267 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3274 *op0_ptr
= convert (type
, primop0
);
3275 *op1_ptr
= convert (type
, primop1
);
3277 *restype_ptr
= truthvalue_type_node
;
3282 /* Return a tree for the sum or difference (RESULTCODE says which)
3283 of pointer PTROP and integer INTOP. */
3286 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
3290 /* The result is a pointer of the same type that is being added. */
3291 tree result_type
= TREE_TYPE (ptrop
);
3293 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
3295 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3296 "pointer of type %<void *%> used in arithmetic");
3297 size_exp
= integer_one_node
;
3299 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
3301 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3302 "pointer to a function used in arithmetic");
3303 size_exp
= integer_one_node
;
3305 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
3307 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3308 "pointer to member function used in arithmetic");
3309 size_exp
= integer_one_node
;
3312 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
3314 /* We are manipulating pointer values, so we don't need to warn
3315 about relying on undefined signed overflow. We disable the
3316 warning here because we use integer types so fold won't know that
3317 they are really pointers. */
3318 fold_defer_overflow_warnings ();
3320 /* If what we are about to multiply by the size of the elements
3321 contains a constant term, apply distributive law
3322 and multiply that constant term separately.
3323 This helps produce common subexpressions. */
3324 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
3325 && !TREE_CONSTANT (intop
)
3326 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
3327 && TREE_CONSTANT (size_exp
)
3328 /* If the constant comes from pointer subtraction,
3329 skip this optimization--it would cause an error. */
3330 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
3331 /* If the constant is unsigned, and smaller than the pointer size,
3332 then we must skip this optimization. This is because it could cause
3333 an overflow error if the constant is negative but INTOP is not. */
3334 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
3335 || (TYPE_PRECISION (TREE_TYPE (intop
))
3336 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
3338 enum tree_code subcode
= resultcode
;
3339 tree int_type
= TREE_TYPE (intop
);
3340 if (TREE_CODE (intop
) == MINUS_EXPR
)
3341 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
3342 /* Convert both subexpression types to the type of intop,
3343 because weird cases involving pointer arithmetic
3344 can result in a sum or difference with different type args. */
3345 ptrop
= build_binary_op (subcode
, ptrop
,
3346 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
3347 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
3350 /* Convert the integer argument to a type the same size as sizetype
3351 so the multiply won't overflow spuriously. */
3352 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
3353 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
3354 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
3355 TYPE_UNSIGNED (sizetype
)), intop
);
3357 /* Replace the integer argument with a suitable product by the object size.
3358 Do this multiplication as signed, then convert to the appropriate
3359 type for the pointer operation. */
3360 intop
= convert (sizetype
,
3361 build_binary_op (MULT_EXPR
, intop
,
3362 convert (TREE_TYPE (intop
), size_exp
), 1));
3364 /* Create the sum or difference. */
3365 if (resultcode
== MINUS_EXPR
)
3366 intop
= fold_build1 (NEGATE_EXPR
, sizetype
, intop
);
3368 ret
= fold_build2 (POINTER_PLUS_EXPR
, result_type
, ptrop
, intop
);
3370 fold_undefer_and_ignore_overflow_warnings ();
3375 /* Return whether EXPR is a declaration whose address can never be
3379 decl_with_nonnull_addr_p (const_tree expr
)
3381 return (DECL_P (expr
)
3382 && (TREE_CODE (expr
) == PARM_DECL
3383 || TREE_CODE (expr
) == LABEL_DECL
3384 || !DECL_WEAK (expr
)));
3387 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
3388 or for an `if' or `while' statement or ?..: exp. It should already
3389 have been validated to be of suitable type; otherwise, a bad
3390 diagnostic may result.
3392 This preparation consists of taking the ordinary
3393 representation of an expression expr and producing a valid tree
3394 boolean expression describing whether expr is nonzero. We could
3395 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
3396 but we optimize comparisons, &&, ||, and !.
3398 The resulting type should always be `truthvalue_type_node'. */
3401 c_common_truthvalue_conversion (tree expr
)
3403 switch (TREE_CODE (expr
))
3405 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
3406 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
3407 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
3408 case ORDERED_EXPR
: case UNORDERED_EXPR
:
3409 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3411 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
3412 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
3414 case TRUTH_ANDIF_EXPR
:
3415 case TRUTH_ORIF_EXPR
:
3416 case TRUTH_AND_EXPR
:
3418 case TRUTH_XOR_EXPR
:
3419 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3421 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
3422 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
3423 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)));
3425 case TRUTH_NOT_EXPR
:
3426 if (TREE_TYPE (expr
) == truthvalue_type_node
)
3428 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
3429 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
3435 return integer_zerop (expr
) ? truthvalue_false_node
3436 : truthvalue_true_node
;
3439 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
3440 ? truthvalue_true_node
3441 : truthvalue_false_node
;
3444 return fixed_compare (NE_EXPR
, &TREE_FIXED_CST (expr
),
3445 &FCONST0 (TYPE_MODE (TREE_TYPE (expr
))))
3446 ? truthvalue_true_node
3447 : truthvalue_false_node
;
3450 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
3455 tree inner
= TREE_OPERAND (expr
, 0);
3456 if (decl_with_nonnull_addr_p (inner
))
3458 /* Common Ada/Pascal programmer's mistake. */
3459 warning (OPT_Waddress
,
3460 "the address of %qD will always evaluate as %<true%>",
3462 return truthvalue_true_node
;
3465 /* If we still have a decl, it is possible for its address to
3466 be NULL, so we cannot optimize. */
3469 gcc_assert (DECL_WEAK (inner
));
3473 if (TREE_SIDE_EFFECTS (inner
))
3474 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3475 inner
, truthvalue_true_node
);
3477 return truthvalue_true_node
;
3481 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
3482 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3483 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
3484 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
3490 /* These don't change whether an object is nonzero or zero. */
3491 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
3495 /* These don't change whether an object is zero or nonzero, but
3496 we can't ignore them if their second arg has side-effects. */
3497 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
3498 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
3499 TREE_OPERAND (expr
, 1),
3500 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
3502 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
3505 /* Distribute the conversion into the arms of a COND_EXPR. */
3506 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
3507 TREE_OPERAND (expr
, 0),
3508 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
3509 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2)));
3512 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
3513 since that affects how `default_conversion' will behave. */
3514 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
3515 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
3517 /* If this is widening the argument, we can ignore it. */
3518 if (TYPE_PRECISION (TREE_TYPE (expr
))
3519 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
3520 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
3524 if (!TREE_NO_WARNING (expr
)
3525 && warn_parentheses
)
3527 warning (OPT_Wparentheses
,
3528 "suggest parentheses around assignment used as truth value");
3529 TREE_NO_WARNING (expr
) = 1;
3537 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
3539 tree t
= save_expr (expr
);
3540 return (build_binary_op
3541 ((TREE_SIDE_EFFECTS (expr
)
3542 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
3543 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
3544 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
3548 if (TREE_CODE (TREE_TYPE (expr
)) == FIXED_POINT_TYPE
)
3550 tree fixed_zero_node
= build_fixed (TREE_TYPE (expr
),
3552 (TREE_TYPE (expr
))));
3553 return build_binary_op (NE_EXPR
, expr
, fixed_zero_node
, 1);
3556 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
3559 static void def_builtin_1 (enum built_in_function fncode
,
3561 enum built_in_class fnclass
,
3562 tree fntype
, tree libtype
,
3563 bool both_p
, bool fallback_p
, bool nonansi_p
,
3564 tree fnattrs
, bool implicit_p
);
3567 /* Apply the TYPE_QUALS to the new DECL. */
3570 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
3572 tree type
= TREE_TYPE (decl
);
3574 if (type
== error_mark_node
)
3577 if (((type_quals
& TYPE_QUAL_CONST
)
3578 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
3579 /* An object declared 'const' is only readonly after it is
3580 initialized. We don't have any way of expressing this currently,
3581 so we need to be conservative and unset TREE_READONLY for types
3582 with constructors. Otherwise aliasing code will ignore stores in
3583 an inline constructor. */
3584 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
3585 TREE_READONLY (decl
) = 1;
3586 if (type_quals
& TYPE_QUAL_VOLATILE
)
3588 TREE_SIDE_EFFECTS (decl
) = 1;
3589 TREE_THIS_VOLATILE (decl
) = 1;
3591 if (type_quals
& TYPE_QUAL_RESTRICT
)
3593 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
3594 /* Allow 'restrict' on arrays of pointers.
3595 FIXME currently we just ignore it. */
3596 type
= TREE_TYPE (type
);
3598 || !POINTER_TYPE_P (type
)
3599 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
3600 error ("invalid use of %<restrict%>");
3601 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
3602 /* Indicate we need to make a unique alias set for this pointer.
3603 We can't do it here because it might be pointing to an
3605 DECL_POINTER_ALIAS_SET (decl
) = -2;
3609 /* Hash function for the problem of multiple type definitions in
3610 different files. This must hash all types that will compare
3611 equal via comptypes to the same value. In practice it hashes
3612 on some of the simple stuff and leaves the details to comptypes. */
3615 c_type_hash (const void *p
)
3619 const_tree
const t
= (const_tree
) p
;
3621 switch (TREE_CODE (t
))
3623 /* For pointers, hash on pointee type plus some swizzling. */
3625 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
3626 /* Hash on number of elements and total size. */
3629 t2
= TYPE_VALUES (t
);
3633 t2
= TYPE_FIELDS (t
);
3635 case QUAL_UNION_TYPE
:
3637 t2
= TYPE_FIELDS (t
);
3641 t2
= TYPE_FIELDS (t
);
3646 for (; t2
; t2
= TREE_CHAIN (t2
))
3648 /* We might have a VLA here. */
3649 if (TREE_CODE (TYPE_SIZE (t
)) != INTEGER_CST
)
3652 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
3653 return ((size
<< 24) | (i
<< shift
));
3656 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
3658 /* Return the typed-based alias set for T, which may be an expression
3659 or a type. Return -1 if we don't do anything special. */
3662 c_common_get_alias_set (tree t
)
3667 /* Permit type-punning when accessing a union, provided the access
3668 is directly through the union. For example, this code does not
3669 permit taking the address of a union member and then storing
3670 through it. Even the type-punning allowed here is a GCC
3671 extension, albeit a common and useful one; the C standard says
3672 that such accesses have implementation-defined behavior. */
3674 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
3675 u
= TREE_OPERAND (u
, 0))
3676 if (TREE_CODE (u
) == COMPONENT_REF
3677 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
3680 /* That's all the expressions we handle specially. */
3684 /* The C standard guarantees that any object may be accessed via an
3685 lvalue that has character type. */
3686 if (t
== char_type_node
3687 || t
== signed_char_type_node
3688 || t
== unsigned_char_type_node
)
3691 /* The C standard specifically allows aliasing between signed and
3692 unsigned variants of the same type. We treat the signed
3693 variant as canonical. */
3694 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3696 tree t1
= c_common_signed_type (t
);
3698 /* t1 == t can happen for boolean nodes which are always unsigned. */
3700 return get_alias_set (t1
);
3702 else if (POINTER_TYPE_P (t
))
3706 /* Unfortunately, there is no canonical form of a pointer type.
3707 In particular, if we have `typedef int I', then `int *', and
3708 `I *' are different types. So, we have to pick a canonical
3709 representative. We do this below.
3711 Technically, this approach is actually more conservative that
3712 it needs to be. In particular, `const int *' and `int *'
3713 should be in different alias sets, according to the C and C++
3714 standard, since their types are not the same, and so,
3715 technically, an `int **' and `const int **' cannot point at
3718 But, the standard is wrong. In particular, this code is
3723 const int* const* cipp = ipp;
3725 And, it doesn't make sense for that to be legal unless you
3726 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3727 the pointed-to types. This issue has been reported to the
3729 t1
= build_type_no_quals (t
);
3731 return get_alias_set (t1
);
3734 /* Handle the case of multiple type nodes referring to "the same" type,
3735 which occurs with IMA. These share an alias set. FIXME: Currently only
3736 C90 is handled. (In C99 type compatibility is not transitive, which
3737 complicates things mightily. The alias set splay trees can theoretically
3738 represent this, but insertion is tricky when you consider all the
3739 different orders things might arrive in.) */
3741 if (c_language
!= clk_c
|| flag_isoc99
)
3744 /* Save time if there's only one input file. */
3745 if (num_in_fnames
== 1)
3748 /* Pointers need special handling if they point to any type that
3749 needs special handling (below). */
3750 if (TREE_CODE (t
) == POINTER_TYPE
)
3753 /* Find bottom type under any nested POINTERs. */
3754 for (t2
= TREE_TYPE (t
);
3755 TREE_CODE (t2
) == POINTER_TYPE
;
3756 t2
= TREE_TYPE (t2
))
3758 if (TREE_CODE (t2
) != RECORD_TYPE
3759 && TREE_CODE (t2
) != ENUMERAL_TYPE
3760 && TREE_CODE (t2
) != QUAL_UNION_TYPE
3761 && TREE_CODE (t2
) != UNION_TYPE
)
3763 if (TYPE_SIZE (t2
) == 0)
3766 /* These are the only cases that need special handling. */
3767 if (TREE_CODE (t
) != RECORD_TYPE
3768 && TREE_CODE (t
) != ENUMERAL_TYPE
3769 && TREE_CODE (t
) != QUAL_UNION_TYPE
3770 && TREE_CODE (t
) != UNION_TYPE
3771 && TREE_CODE (t
) != POINTER_TYPE
)
3774 if (TYPE_SIZE (t
) == 0)
3777 /* Look up t in hash table. Only one of the compatible types within each
3778 alias set is recorded in the table. */
3779 if (!type_hash_table
)
3780 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
3781 (htab_eq
) lang_hooks
.types_compatible_p
,
3783 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
3786 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
3787 return TYPE_ALIAS_SET ((tree
)*slot
);
3790 /* Our caller will assign and record (in t) a new alias set; all we need
3791 to do is remember t in the hash table. */
3797 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3798 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3799 flag controls whether we should diagnose possibly ill-formed
3800 constructs or not. */
3803 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
3805 const char *op_name
;
3807 enum tree_code type_code
= TREE_CODE (type
);
3809 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3811 if (type_code
== FUNCTION_TYPE
)
3815 if (complain
&& (pedantic
|| warn_pointer_arith
))
3816 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3817 "invalid application of %<sizeof%> to a function type");
3819 return error_mark_node
;
3820 value
= size_one_node
;
3823 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3825 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3827 if (type_code
== VOID_TYPE
3828 && complain
&& (pedantic
|| warn_pointer_arith
))
3829 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3830 "invalid application of %qs to a void type", op_name
);
3832 return error_mark_node
;
3833 value
= size_one_node
;
3835 else if (!COMPLETE_TYPE_P (type
))
3838 error ("invalid application of %qs to incomplete type %qT ",
3840 value
= size_zero_node
;
3845 /* Convert in case a char is more than one unit. */
3846 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3847 size_int (TYPE_PRECISION (char_type_node
)
3850 value
= size_int (TYPE_ALIGN_UNIT (type
));
3853 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3854 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3855 never happen. However, this node should really have type
3856 `size_t', which is just a typedef for an ordinary integer type. */
3857 value
= fold_convert (size_type_node
, value
);
3858 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
3863 /* Implement the __alignof keyword: Return the minimum required
3864 alignment of EXPR, measured in bytes. For VAR_DECLs,
3865 FUNCTION_DECLs and FIELD_DECLs return DECL_ALIGN (which can be set
3866 from an "aligned" __attribute__ specification). */
3869 c_alignof_expr (tree expr
)
3873 if (VAR_OR_FUNCTION_DECL_P (expr
))
3874 t
= size_int (DECL_ALIGN_UNIT (expr
));
3876 else if (TREE_CODE (expr
) == COMPONENT_REF
3877 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3879 error ("%<__alignof%> applied to a bit-field");
3882 else if (TREE_CODE (expr
) == COMPONENT_REF
3883 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3884 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3886 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3888 tree t
= TREE_OPERAND (expr
, 0);
3890 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3892 while (CONVERT_EXPR_P (t
)
3893 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3897 t
= TREE_OPERAND (t
, 0);
3898 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3899 if (thisalign
> bestalign
)
3900 best
= t
, bestalign
= thisalign
;
3902 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3905 return c_alignof (TREE_TYPE (expr
));
3907 return fold_convert (size_type_node
, t
);
3910 /* Handle C and C++ default attributes. */
3912 enum built_in_attribute
3914 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3915 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3916 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3917 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3918 #include "builtin-attrs.def"
3919 #undef DEF_ATTR_NULL_TREE
3921 #undef DEF_ATTR_IDENT
3922 #undef DEF_ATTR_TREE_LIST
3926 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3928 static void c_init_attributes (void);
3932 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3933 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3934 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3935 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3936 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3937 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3938 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3939 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3940 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3941 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3942 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3943 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3944 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3945 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3946 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3948 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3949 #include "builtin-types.def"
3950 #undef DEF_PRIMITIVE_TYPE
3951 #undef DEF_FUNCTION_TYPE_0
3952 #undef DEF_FUNCTION_TYPE_1
3953 #undef DEF_FUNCTION_TYPE_2
3954 #undef DEF_FUNCTION_TYPE_3
3955 #undef DEF_FUNCTION_TYPE_4
3956 #undef DEF_FUNCTION_TYPE_5
3957 #undef DEF_FUNCTION_TYPE_6
3958 #undef DEF_FUNCTION_TYPE_7
3959 #undef DEF_FUNCTION_TYPE_VAR_0
3960 #undef DEF_FUNCTION_TYPE_VAR_1
3961 #undef DEF_FUNCTION_TYPE_VAR_2
3962 #undef DEF_FUNCTION_TYPE_VAR_3
3963 #undef DEF_FUNCTION_TYPE_VAR_4
3964 #undef DEF_FUNCTION_TYPE_VAR_5
3965 #undef DEF_POINTER_TYPE
3969 typedef enum c_builtin_type builtin_type
;
3971 /* A temporary array for c_common_nodes_and_builtins. Used in
3972 communication with def_fn_type. */
3973 static tree builtin_types
[(int) BT_LAST
+ 1];
3975 /* A helper function for c_common_nodes_and_builtins. Build function type
3976 for DEF with return type RET and N arguments. If VAR is true, then the
3977 function should be variadic after those N arguments.
3979 Takes special care not to ICE if any of the types involved are
3980 error_mark_node, which indicates that said type is not in fact available
3981 (see builtin_type_for_size). In which case the function type as a whole
3982 should be error_mark_node. */
3985 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3987 tree args
= NULL
, t
;
3992 for (i
= 0; i
< n
; ++i
)
3994 builtin_type a
= (builtin_type
) va_arg (list
, int);
3995 t
= builtin_types
[a
];
3996 if (t
== error_mark_node
)
3998 args
= tree_cons (NULL_TREE
, t
, args
);
4002 args
= nreverse (args
);
4004 args
= chainon (args
, void_list_node
);
4006 t
= builtin_types
[ret
];
4007 if (t
== error_mark_node
)
4009 t
= build_function_type (t
, args
);
4012 builtin_types
[def
] = t
;
4015 /* Build builtin functions common to both C and C++ language
4019 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
4021 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
4022 builtin_types[ENUM] = VALUE;
4023 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
4024 def_fn_type (ENUM, RETURN, 0, 0);
4025 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
4026 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
4027 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
4028 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
4029 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4030 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
4031 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4032 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
4033 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4034 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4035 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4037 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
4038 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
4040 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
4041 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
4042 def_fn_type (ENUM, RETURN, 1, 0);
4043 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
4044 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
4045 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
4046 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
4047 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
4048 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
4049 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
4050 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
4051 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
4052 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
4053 #define DEF_POINTER_TYPE(ENUM, TYPE) \
4054 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
4056 #include "builtin-types.def"
4058 #undef DEF_PRIMITIVE_TYPE
4059 #undef DEF_FUNCTION_TYPE_1
4060 #undef DEF_FUNCTION_TYPE_2
4061 #undef DEF_FUNCTION_TYPE_3
4062 #undef DEF_FUNCTION_TYPE_4
4063 #undef DEF_FUNCTION_TYPE_5
4064 #undef DEF_FUNCTION_TYPE_6
4065 #undef DEF_FUNCTION_TYPE_VAR_0
4066 #undef DEF_FUNCTION_TYPE_VAR_1
4067 #undef DEF_FUNCTION_TYPE_VAR_2
4068 #undef DEF_FUNCTION_TYPE_VAR_3
4069 #undef DEF_FUNCTION_TYPE_VAR_4
4070 #undef DEF_FUNCTION_TYPE_VAR_5
4071 #undef DEF_POINTER_TYPE
4072 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
4074 c_init_attributes ();
4076 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
4077 NONANSI_P, ATTRS, IMPLICIT, COND) \
4079 def_builtin_1 (ENUM, NAME, CLASS, \
4080 builtin_types[(int) TYPE], \
4081 builtin_types[(int) LIBTYPE], \
4082 BOTH_P, FALLBACK_P, NONANSI_P, \
4083 built_in_attributes[(int) ATTRS], IMPLICIT);
4084 #include "builtins.def"
4087 targetm
.init_builtins ();
4089 build_common_builtin_nodes ();
4095 /* Build tree nodes and builtin functions common to both C and C++ language
4099 c_common_nodes_and_builtins (void)
4101 int char16_type_size
;
4102 int char32_type_size
;
4103 int wchar_type_size
;
4104 tree array_domain_type
;
4105 tree va_list_ref_type_node
;
4106 tree va_list_arg_type_node
;
4108 /* Define `int' and `char' first so that dbx will output them first. */
4109 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
4110 record_builtin_type (RID_CHAR
, "char", char_type_node
);
4112 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
4113 "unsigned long", "long long unsigned" and "unsigned short" were in C++
4114 but not C. Are the conditionals here needed? */
4115 if (c_dialect_cxx ())
4116 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
4117 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
4118 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
4119 record_builtin_type (RID_MAX
, "long unsigned int",
4120 long_unsigned_type_node
);
4121 if (c_dialect_cxx ())
4122 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
4123 record_builtin_type (RID_MAX
, "long long int",
4124 long_long_integer_type_node
);
4125 record_builtin_type (RID_MAX
, "long long unsigned int",
4126 long_long_unsigned_type_node
);
4127 if (c_dialect_cxx ())
4128 record_builtin_type (RID_MAX
, "long long unsigned",
4129 long_long_unsigned_type_node
);
4130 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
4131 record_builtin_type (RID_MAX
, "short unsigned int",
4132 short_unsigned_type_node
);
4133 if (c_dialect_cxx ())
4134 record_builtin_type (RID_MAX
, "unsigned short",
4135 short_unsigned_type_node
);
4137 /* Define both `signed char' and `unsigned char'. */
4138 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
4139 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
4141 /* These are types that c_common_type_for_size and
4142 c_common_type_for_mode use. */
4143 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4145 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4147 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4149 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4151 #if HOST_BITS_PER_WIDE_INT >= 64
4152 if (targetm
.scalar_mode_supported_p (TImode
))
4153 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4154 get_identifier ("__int128_t"),
4157 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4158 unsigned_intQI_type_node
));
4159 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4160 unsigned_intHI_type_node
));
4161 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4162 unsigned_intSI_type_node
));
4163 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4164 unsigned_intDI_type_node
));
4165 #if HOST_BITS_PER_WIDE_INT >= 64
4166 if (targetm
.scalar_mode_supported_p (TImode
))
4167 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4168 get_identifier ("__uint128_t"),
4169 unsigned_intTI_type_node
));
4172 /* Create the widest literal types. */
4173 widest_integer_literal_type_node
4174 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
4175 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4176 widest_integer_literal_type_node
));
4178 widest_unsigned_literal_type_node
4179 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
4180 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
4181 widest_unsigned_literal_type_node
));
4183 /* `unsigned long' is the standard type for sizeof.
4184 Note that stddef.h uses `unsigned long',
4185 and this must agree, even if long and int are the same size. */
4187 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
4188 signed_size_type_node
= c_common_signed_type (size_type_node
);
4189 set_sizetype (size_type_node
);
4192 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
4194 build_common_tree_nodes_2 (flag_short_double
);
4196 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
4197 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
4198 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
4200 /* Only supported decimal floating point extension if the target
4201 actually supports underlying modes. */
4202 if (targetm
.scalar_mode_supported_p (SDmode
)
4203 && targetm
.scalar_mode_supported_p (DDmode
)
4204 && targetm
.scalar_mode_supported_p (TDmode
))
4206 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
4207 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
4208 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
4211 if (targetm
.fixed_point_supported_p ())
4213 record_builtin_type (RID_MAX
, "short _Fract", short_fract_type_node
);
4214 record_builtin_type (RID_FRACT
, NULL
, fract_type_node
);
4215 record_builtin_type (RID_MAX
, "long _Fract", long_fract_type_node
);
4216 record_builtin_type (RID_MAX
, "long long _Fract",
4217 long_long_fract_type_node
);
4218 record_builtin_type (RID_MAX
, "unsigned short _Fract",
4219 unsigned_short_fract_type_node
);
4220 record_builtin_type (RID_MAX
, "unsigned _Fract",
4221 unsigned_fract_type_node
);
4222 record_builtin_type (RID_MAX
, "unsigned long _Fract",
4223 unsigned_long_fract_type_node
);
4224 record_builtin_type (RID_MAX
, "unsigned long long _Fract",
4225 unsigned_long_long_fract_type_node
);
4226 record_builtin_type (RID_MAX
, "_Sat short _Fract",
4227 sat_short_fract_type_node
);
4228 record_builtin_type (RID_MAX
, "_Sat _Fract", sat_fract_type_node
);
4229 record_builtin_type (RID_MAX
, "_Sat long _Fract",
4230 sat_long_fract_type_node
);
4231 record_builtin_type (RID_MAX
, "_Sat long long _Fract",
4232 sat_long_long_fract_type_node
);
4233 record_builtin_type (RID_MAX
, "_Sat unsigned short _Fract",
4234 sat_unsigned_short_fract_type_node
);
4235 record_builtin_type (RID_MAX
, "_Sat unsigned _Fract",
4236 sat_unsigned_fract_type_node
);
4237 record_builtin_type (RID_MAX
, "_Sat unsigned long _Fract",
4238 sat_unsigned_long_fract_type_node
);
4239 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Fract",
4240 sat_unsigned_long_long_fract_type_node
);
4241 record_builtin_type (RID_MAX
, "short _Accum", short_accum_type_node
);
4242 record_builtin_type (RID_ACCUM
, NULL
, accum_type_node
);
4243 record_builtin_type (RID_MAX
, "long _Accum", long_accum_type_node
);
4244 record_builtin_type (RID_MAX
, "long long _Accum",
4245 long_long_accum_type_node
);
4246 record_builtin_type (RID_MAX
, "unsigned short _Accum",
4247 unsigned_short_accum_type_node
);
4248 record_builtin_type (RID_MAX
, "unsigned _Accum",
4249 unsigned_accum_type_node
);
4250 record_builtin_type (RID_MAX
, "unsigned long _Accum",
4251 unsigned_long_accum_type_node
);
4252 record_builtin_type (RID_MAX
, "unsigned long long _Accum",
4253 unsigned_long_long_accum_type_node
);
4254 record_builtin_type (RID_MAX
, "_Sat short _Accum",
4255 sat_short_accum_type_node
);
4256 record_builtin_type (RID_MAX
, "_Sat _Accum", sat_accum_type_node
);
4257 record_builtin_type (RID_MAX
, "_Sat long _Accum",
4258 sat_long_accum_type_node
);
4259 record_builtin_type (RID_MAX
, "_Sat long long _Accum",
4260 sat_long_long_accum_type_node
);
4261 record_builtin_type (RID_MAX
, "_Sat unsigned short _Accum",
4262 sat_unsigned_short_accum_type_node
);
4263 record_builtin_type (RID_MAX
, "_Sat unsigned _Accum",
4264 sat_unsigned_accum_type_node
);
4265 record_builtin_type (RID_MAX
, "_Sat unsigned long _Accum",
4266 sat_unsigned_long_accum_type_node
);
4267 record_builtin_type (RID_MAX
, "_Sat unsigned long long _Accum",
4268 sat_unsigned_long_long_accum_type_node
);
4272 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4273 get_identifier ("complex int"),
4274 complex_integer_type_node
));
4275 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4276 get_identifier ("complex float"),
4277 complex_float_type_node
));
4278 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
4279 get_identifier ("complex double"),
4280 complex_double_type_node
));
4281 lang_hooks
.decls
.pushdecl
4282 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
4283 complex_long_double_type_node
));
4285 if (c_dialect_cxx ())
4286 /* For C++, make fileptr_type_node a distinct void * type until
4287 FILE type is defined. */
4288 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
4290 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
4292 /* Set the TYPE_NAME for any variants that were built before
4293 record_builtin_type gave names to the built-in types. */
4295 tree void_name
= TYPE_NAME (void_type_node
);
4296 TYPE_NAME (void_type_node
) = NULL_TREE
;
4297 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
4299 TYPE_NAME (void_type_node
) = void_name
;
4302 /* This node must not be shared. */
4303 void_zero_node
= make_node (INTEGER_CST
);
4304 TREE_TYPE (void_zero_node
) = void_type_node
;
4306 void_list_node
= build_void_list_node ();
4308 /* Make a type to be the domain of a few array types
4309 whose domains don't really matter.
4310 200 is small enough that it always fits in size_t
4311 and large enough that it can hold most function names for the
4312 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
4313 array_domain_type
= build_index_type (size_int (200));
4315 /* Make a type for arrays of characters.
4316 With luck nothing will ever really depend on the length of this
4318 char_array_type_node
4319 = build_array_type (char_type_node
, array_domain_type
);
4321 /* Likewise for arrays of ints. */
4323 = build_array_type (integer_type_node
, array_domain_type
);
4325 string_type_node
= build_pointer_type (char_type_node
);
4326 const_string_type_node
4327 = build_pointer_type (build_qualified_type
4328 (char_type_node
, TYPE_QUAL_CONST
));
4330 /* This is special for C++ so functions can be overloaded. */
4331 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
4332 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
4333 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
4334 if (c_dialect_cxx ())
4336 if (TYPE_UNSIGNED (wchar_type_node
))
4337 wchar_type_node
= make_unsigned_type (wchar_type_size
);
4339 wchar_type_node
= make_signed_type (wchar_type_size
);
4340 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
4344 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
4345 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
4348 /* This is for wide string constants. */
4349 wchar_array_type_node
4350 = build_array_type (wchar_type_node
, array_domain_type
);
4352 /* Define 'char16_t'. */
4353 char16_type_node
= get_identifier (CHAR16_TYPE
);
4354 char16_type_node
= TREE_TYPE (identifier_global_value (char16_type_node
));
4355 char16_type_size
= TYPE_PRECISION (char16_type_node
);
4356 if (c_dialect_cxx ())
4358 char16_type_node
= make_unsigned_type (char16_type_size
);
4360 if (cxx_dialect
== cxx0x
)
4361 record_builtin_type (RID_CHAR16
, "char16_t", char16_type_node
);
4364 /* This is for UTF-16 string constants. */
4365 char16_array_type_node
4366 = build_array_type (char16_type_node
, array_domain_type
);
4368 /* Define 'char32_t'. */
4369 char32_type_node
= get_identifier (CHAR32_TYPE
);
4370 char32_type_node
= TREE_TYPE (identifier_global_value (char32_type_node
));
4371 char32_type_size
= TYPE_PRECISION (char32_type_node
);
4372 if (c_dialect_cxx ())
4374 char32_type_node
= make_unsigned_type (char32_type_size
);
4376 if (cxx_dialect
== cxx0x
)
4377 record_builtin_type (RID_CHAR32
, "char32_t", char32_type_node
);
4380 /* This is for UTF-32 string constants. */
4381 char32_array_type_node
4382 = build_array_type (char32_type_node
, array_domain_type
);
4385 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
4388 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
4390 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
4392 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
4394 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
4395 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
4397 lang_hooks
.decls
.pushdecl
4398 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
4399 va_list_type_node
));
4400 #ifdef TARGET_ENUM_VA_LIST
4405 for (l
= 0; TARGET_ENUM_VA_LIST (l
, &pname
, &ptype
); ++l
)
4407 lang_hooks
.decls
.pushdecl
4408 (build_decl (TYPE_DECL
, get_identifier (pname
),
4415 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
4417 va_list_arg_type_node
= va_list_ref_type_node
=
4418 build_pointer_type (TREE_TYPE (va_list_type_node
));
4422 va_list_arg_type_node
= va_list_type_node
;
4423 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
4426 if (!flag_preprocess_only
)
4427 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
4429 main_identifier_node
= get_identifier ("main");
4431 /* Create the built-in __null node. It is important that this is
4433 null_node
= make_node (INTEGER_CST
);
4434 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
4436 /* Since builtin_types isn't gc'ed, don't export these nodes. */
4437 memset (builtin_types
, 0, sizeof (builtin_types
));
4440 /* Look up the function in built_in_decls that corresponds to DECL
4441 and set ASMSPEC as its user assembler name. DECL must be a
4442 function decl that declares a builtin. */
4445 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
4448 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
4449 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
4452 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
4453 set_user_assembler_name (builtin
, asmspec
);
4454 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
4455 init_block_move_fn (asmspec
);
4456 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
4457 init_block_clear_fn (asmspec
);
4460 /* The number of named compound-literals generated thus far. */
4461 static GTY(()) int compound_literal_number
;
4463 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
4466 set_compound_literal_name (tree decl
)
4469 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
4470 compound_literal_number
);
4471 compound_literal_number
++;
4472 DECL_NAME (decl
) = get_identifier (name
);
4476 build_va_arg (tree expr
, tree type
)
4478 return build1 (VA_ARG_EXPR
, type
, expr
);
4482 /* Linked list of disabled built-in functions. */
4484 typedef struct disabled_builtin
4487 struct disabled_builtin
*next
;
4489 static disabled_builtin
*disabled_builtins
= NULL
;
4491 static bool builtin_function_disabled_p (const char *);
4493 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
4494 begins with "__builtin_", give an error. */
4497 disable_builtin_function (const char *name
)
4499 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
4500 error ("cannot disable built-in function %qs", name
);
4503 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
4504 new_disabled_builtin
->name
= name
;
4505 new_disabled_builtin
->next
= disabled_builtins
;
4506 disabled_builtins
= new_disabled_builtin
;
4511 /* Return true if the built-in function NAME has been disabled, false
4515 builtin_function_disabled_p (const char *name
)
4517 disabled_builtin
*p
;
4518 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
4520 if (strcmp (name
, p
->name
) == 0)
4527 /* Worker for DEF_BUILTIN.
4528 Possibly define a builtin function with one or two names.
4529 Does not declare a non-__builtin_ function if flag_no_builtin, or if
4530 nonansi_p and flag_no_nonansi_builtin. */
4533 def_builtin_1 (enum built_in_function fncode
,
4535 enum built_in_class fnclass
,
4536 tree fntype
, tree libtype
,
4537 bool both_p
, bool fallback_p
, bool nonansi_p
,
4538 tree fnattrs
, bool implicit_p
)
4541 const char *libname
;
4543 if (fntype
== error_mark_node
)
4546 gcc_assert ((!both_p
&& !fallback_p
)
4547 || !strncmp (name
, "__builtin_",
4548 strlen ("__builtin_")));
4550 libname
= name
+ strlen ("__builtin_");
4551 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
4552 (fallback_p
? libname
: NULL
),
4555 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
4556 && !(nonansi_p
&& flag_no_nonansi_builtin
))
4557 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
4560 built_in_decls
[(int) fncode
] = decl
;
4562 implicit_built_in_decls
[(int) fncode
] = decl
;
4565 /* Nonzero if the type T promotes to int. This is (nearly) the
4566 integral promotions defined in ISO C99 6.3.1.1/2. */
4569 c_promoting_integer_type_p (const_tree t
)
4571 switch (TREE_CODE (t
))
4574 return (TYPE_MAIN_VARIANT (t
) == char_type_node
4575 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
4576 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
4577 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
4578 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
4579 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
4582 /* ??? Technically all enumerations not larger than an int
4583 promote to an int. But this is used along code paths
4584 that only want to notice a size change. */
4585 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
4595 /* Return 1 if PARMS specifies a fixed number of parameters
4596 and none of their types is affected by default promotions. */
4599 self_promoting_args_p (const_tree parms
)
4602 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
4604 tree type
= TREE_VALUE (t
);
4606 if (type
== error_mark_node
)
4609 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
4615 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
4618 if (c_promoting_integer_type_p (type
))
4624 /* Recursively remove any '*' or '&' operator from TYPE. */
4626 strip_pointer_operator (tree t
)
4628 while (POINTER_TYPE_P (t
))
4633 /* Recursively remove pointer or array type from TYPE. */
4635 strip_pointer_or_array_types (tree t
)
4637 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
4642 /* Used to compare case labels. K1 and K2 are actually tree nodes
4643 representing case labels, or NULL_TREE for a `default' label.
4644 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
4645 K2, and 0 if K1 and K2 are equal. */
4648 case_compare (splay_tree_key k1
, splay_tree_key k2
)
4650 /* Consider a NULL key (such as arises with a `default' label) to be
4651 smaller than anything else. */
4657 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
4660 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
4661 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
4662 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
4663 case label was declared using the usual C/C++ syntax, rather than
4664 the GNU case range extension. CASES is a tree containing all the
4665 case ranges processed so far; COND is the condition for the
4666 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
4667 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
4670 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
4671 tree low_value
, tree high_value
)
4676 splay_tree_node node
;
4678 /* Create the LABEL_DECL itself. */
4679 label
= create_artificial_label ();
4681 /* If there was an error processing the switch condition, bail now
4682 before we get more confused. */
4683 if (!cond
|| cond
== error_mark_node
)
4686 if ((low_value
&& TREE_TYPE (low_value
)
4687 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
4688 || (high_value
&& TREE_TYPE (high_value
)
4689 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
4691 error ("pointers are not permitted as case values");
4695 /* Case ranges are a GNU extension. */
4697 pedwarn (input_location
, OPT_pedantic
,
4698 "range expressions in switch statements are non-standard");
4700 type
= TREE_TYPE (cond
);
4703 low_value
= check_case_value (low_value
);
4704 low_value
= convert_and_check (type
, low_value
);
4705 if (low_value
== error_mark_node
)
4710 high_value
= check_case_value (high_value
);
4711 high_value
= convert_and_check (type
, high_value
);
4712 if (high_value
== error_mark_node
)
4716 if (low_value
&& high_value
)
4718 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4719 really a case range, even though it was written that way.
4720 Remove the HIGH_VALUE to simplify later processing. */
4721 if (tree_int_cst_equal (low_value
, high_value
))
4722 high_value
= NULL_TREE
;
4723 else if (!tree_int_cst_lt (low_value
, high_value
))
4724 warning (0, "empty range specified");
4727 /* See if the case is in range of the type of the original testing
4728 expression. If both low_value and high_value are out of range,
4729 don't insert the case label and return NULL_TREE. */
4731 && !check_case_bounds (type
, orig_type
,
4732 &low_value
, high_value
? &high_value
: NULL
))
4735 /* Look up the LOW_VALUE in the table of case labels we already
4737 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4738 /* If there was not an exact match, check for overlapping ranges.
4739 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4740 that's a `default' label and the only overlap is an exact match. */
4741 if (!node
&& (low_value
|| high_value
))
4743 splay_tree_node low_bound
;
4744 splay_tree_node high_bound
;
4746 /* Even though there wasn't an exact match, there might be an
4747 overlap between this case range and another case range.
4748 Since we've (inductively) not allowed any overlapping case
4749 ranges, we simply need to find the greatest low case label
4750 that is smaller that LOW_VALUE, and the smallest low case
4751 label that is greater than LOW_VALUE. If there is an overlap
4752 it will occur in one of these two ranges. */
4753 low_bound
= splay_tree_predecessor (cases
,
4754 (splay_tree_key
) low_value
);
4755 high_bound
= splay_tree_successor (cases
,
4756 (splay_tree_key
) low_value
);
4758 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4759 the LOW_VALUE, so there is no need to check unless the
4760 LOW_BOUND is in fact itself a case range. */
4762 && CASE_HIGH ((tree
) low_bound
->value
)
4763 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4766 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4767 range is bigger than the low end of the current range, so we
4768 are only interested if the current range is a real range, and
4769 not an ordinary case label. */
4772 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4777 /* If there was an overlap, issue an error. */
4780 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4784 error ("duplicate (or overlapping) case value");
4785 error ("%Jthis is the first entry overlapping that value", duplicate
);
4789 error ("duplicate case value") ;
4790 error ("%Jpreviously used here", duplicate
);
4794 error ("multiple default labels in one switch");
4795 error ("%Jthis is the first default label", duplicate
);
4800 /* Add a CASE_LABEL to the statement-tree. */
4801 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4802 /* Register this case label in the splay tree. */
4803 splay_tree_insert (cases
,
4804 (splay_tree_key
) low_value
,
4805 (splay_tree_value
) case_label
);
4810 /* Add a label so that the back-end doesn't think that the beginning of
4811 the switch is unreachable. Note that we do not add a case label, as
4812 that just leads to duplicates and thence to failure later on. */
4815 tree t
= create_artificial_label ();
4816 add_stmt (build_stmt (LABEL_EXPR
, t
));
4818 return error_mark_node
;
4821 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4822 Used to verify that case values match up with enumerator values. */
4825 match_case_to_enum_1 (tree key
, tree type
, tree label
)
4827 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
4829 /* ??? Not working too hard to print the double-word value.
4830 Should perhaps be done with %lwd in the diagnostic routines? */
4831 if (TREE_INT_CST_HIGH (key
) == 0)
4832 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
4833 TREE_INT_CST_LOW (key
));
4834 else if (!TYPE_UNSIGNED (type
)
4835 && TREE_INT_CST_HIGH (key
) == -1
4836 && TREE_INT_CST_LOW (key
) != 0)
4837 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
4838 -TREE_INT_CST_LOW (key
));
4840 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
4841 (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (key
),
4842 (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (key
));
4844 if (TYPE_NAME (type
) == 0)
4845 warning (warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
4846 "%Jcase value %qs not in enumerated type",
4847 CASE_LABEL (label
), buf
);
4849 warning (warn_switch
? OPT_Wswitch
: OPT_Wswitch_enum
,
4850 "%Jcase value %qs not in enumerated type %qT",
4851 CASE_LABEL (label
), buf
, type
);
4854 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4855 Used to verify that case values match up with enumerator values. */
4858 match_case_to_enum (splay_tree_node node
, void *data
)
4860 tree label
= (tree
) node
->value
;
4861 tree type
= (tree
) data
;
4863 /* Skip default case. */
4864 if (!CASE_LOW (label
))
4867 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4868 when we did our enum->case scan. Reset our scratch bit after. */
4869 if (!CASE_LOW_SEEN (label
))
4870 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
4872 CASE_LOW_SEEN (label
) = 0;
4874 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4875 not set, that means that CASE_HIGH did not appear when we did our
4876 enum->case scan. Reset our scratch bit after. */
4877 if (CASE_HIGH (label
))
4879 if (!CASE_HIGH_SEEN (label
))
4880 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
4882 CASE_HIGH_SEEN (label
) = 0;
4888 /* Handle -Wswitch*. Called from the front end after parsing the
4889 switch construct. */
4890 /* ??? Should probably be somewhere generic, since other languages
4891 besides C and C++ would want this. At the moment, however, C/C++
4892 are the only tree-ssa languages that support enumerations at all,
4893 so the point is moot. */
4896 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
4897 tree type
, tree cond
)
4899 splay_tree_node default_node
;
4900 splay_tree_node node
;
4902 int saved_warn_switch
;
4904 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
4907 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
4909 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
4912 /* From here on, we only care about about enumerated types. */
4913 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
4916 /* If the switch expression was an enumerated type, check that
4917 exactly all enumeration literals are covered by the cases.
4918 The check is made when -Wswitch was specified and there is no
4919 default case, or when -Wswitch-enum was specified. */
4921 if (!warn_switch_enum
4922 && !(warn_switch
&& !default_node
))
4925 /* Clearing COND if it is not an integer constant simplifies
4926 the tests inside the loop below. */
4927 if (TREE_CODE (cond
) != INTEGER_CST
)
4930 /* The time complexity here is O(N*lg(N)) worst case, but for the
4931 common case of monotonically increasing enumerators, it is
4932 O(N), since the nature of the splay tree will keep the next
4933 element adjacent to the root at all times. */
4935 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
4937 tree value
= TREE_VALUE (chain
);
4938 if (TREE_CODE (value
) == CONST_DECL
)
4939 value
= DECL_INITIAL (value
);
4940 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
4943 /* Mark the CASE_LOW part of the case entry as seen. */
4944 tree label
= (tree
) node
->value
;
4945 CASE_LOW_SEEN (label
) = 1;
4949 /* Even though there wasn't an exact match, there might be a
4950 case range which includes the enumerator's value. */
4951 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
4952 if (node
&& CASE_HIGH ((tree
) node
->value
))
4954 tree label
= (tree
) node
->value
;
4955 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
4958 /* If we match the upper bound exactly, mark the CASE_HIGH
4959 part of the case entry as seen. */
4961 CASE_HIGH_SEEN (label
) = 1;
4966 /* We've now determined that this enumerated literal isn't
4967 handled by the case labels of the switch statement. */
4969 /* If the switch expression is a constant, we only really care
4970 about whether that constant is handled by the switch. */
4971 if (cond
&& tree_int_cst_compare (cond
, value
))
4974 /* If there is a default_node, the only relevant option is
4975 Wswitch-enum. Otherwise, if both are enabled then we prefer
4976 to warn using -Wswitch because -Wswitch is enabled by -Wall
4977 while -Wswitch-enum is explicit. */
4978 warning ((default_node
|| !warn_switch
)
4979 ? OPT_Wswitch_enum
: OPT_Wswitch
,
4980 "%Henumeration value %qE not handled in switch",
4981 &switch_location
, TREE_PURPOSE (chain
));
4984 /* Warn if there are case expressions that don't correspond to
4985 enumerators. This can occur since C and C++ don't enforce
4986 type-checking of assignments to enumeration variables.
4988 The time complexity here is now always O(N) worst case, since
4989 we should have marked both the lower bound and upper bound of
4990 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4991 above. This scan also resets those fields. */
4993 /* If there is a default_node, the only relevant option is
4994 Wswitch-enum. Otherwise, if both are enabled then we prefer
4995 to warn using -Wswitch because -Wswitch is enabled by -Wall
4996 while -Wswitch-enum is explicit. */
4997 saved_warn_switch
= warn_switch
;
5000 splay_tree_foreach (cases
, match_case_to_enum
, type
);
5001 warn_switch
= saved_warn_switch
;
5005 /* Finish an expression taking the address of LABEL (an
5006 IDENTIFIER_NODE). Returns an expression for the address. */
5009 finish_label_address_expr (tree label
)
5013 pedwarn (input_location
, OPT_pedantic
, "taking the address of a label is non-standard");
5015 if (label
== error_mark_node
)
5016 return error_mark_node
;
5018 label
= lookup_label (label
);
5019 if (label
== NULL_TREE
)
5020 result
= null_pointer_node
;
5023 TREE_USED (label
) = 1;
5024 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
5025 /* The current function in not necessarily uninlinable.
5026 Computed gotos are incompatible with inlining, but the value
5027 here could be used only in a diagnostic, for example. */
5033 /* Hook used by expand_expr to expand language-specific tree codes. */
5034 /* The only things that should go here are bits needed to expand
5035 constant initializers. Everything else should be handled by the
5036 gimplification routines. */
5039 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
5040 int modifiera
/* Actually enum expand_modifier. */,
5043 enum expand_modifier modifier
= (enum expand_modifier
) modifiera
;
5044 switch (TREE_CODE (exp
))
5046 case COMPOUND_LITERAL_EXPR
:
5048 /* Initialize the anonymous variable declared in the compound
5049 literal, then return the variable. */
5050 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
5051 emit_local_var (decl
);
5052 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
5060 /* Hook used by staticp to handle language-specific tree codes. */
5063 c_staticp (tree exp
)
5065 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
5066 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
5071 /* Given a boolean expression ARG, return a tree representing an increment
5072 or decrement (as indicated by CODE) of ARG. The front end must check for
5073 invalid cases (e.g., decrement in C++). */
5075 boolean_increment (enum tree_code code
, tree arg
)
5078 tree true_res
= build_int_cst (TREE_TYPE (arg
), 1);
5080 arg
= stabilize_reference (arg
);
5083 case PREINCREMENT_EXPR
:
5084 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5086 case POSTINCREMENT_EXPR
:
5087 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
5088 arg
= save_expr (arg
);
5089 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5090 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5092 case PREDECREMENT_EXPR
:
5093 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5094 invert_truthvalue (arg
));
5096 case POSTDECREMENT_EXPR
:
5097 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
5098 invert_truthvalue (arg
));
5099 arg
= save_expr (arg
);
5100 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
5101 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
5106 TREE_SIDE_EFFECTS (val
) = 1;
5110 /* Built-in macros for stddef.h, that require macros defined in this
5113 c_stddef_cpp_builtins(void)
5115 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
5116 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
5117 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
5118 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
5119 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
5120 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
5121 builtin_define_with_value ("__CHAR16_TYPE__", CHAR16_TYPE
, 0);
5122 builtin_define_with_value ("__CHAR32_TYPE__", CHAR32_TYPE
, 0);
5126 c_init_attributes (void)
5128 /* Fill in the built_in_attributes array. */
5129 #define DEF_ATTR_NULL_TREE(ENUM) \
5130 built_in_attributes[(int) ENUM] = NULL_TREE;
5131 #define DEF_ATTR_INT(ENUM, VALUE) \
5132 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
5133 #define DEF_ATTR_IDENT(ENUM, STRING) \
5134 built_in_attributes[(int) ENUM] = get_identifier (STRING);
5135 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
5136 built_in_attributes[(int) ENUM] \
5137 = tree_cons (built_in_attributes[(int) PURPOSE], \
5138 built_in_attributes[(int) VALUE], \
5139 built_in_attributes[(int) CHAIN]);
5140 #include "builtin-attrs.def"
5141 #undef DEF_ATTR_NULL_TREE
5143 #undef DEF_ATTR_IDENT
5144 #undef DEF_ATTR_TREE_LIST
5147 /* Attribute handlers common to C front ends. */
5149 /* Handle a "packed" attribute; arguments as in
5150 struct attribute_spec.handler. */
5153 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5154 int flags
, bool *no_add_attrs
)
5158 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5159 *node
= build_variant_type_copy (*node
);
5160 TYPE_PACKED (*node
) = 1;
5162 else if (TREE_CODE (*node
) == FIELD_DECL
)
5164 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
)
5165 warning (OPT_Wattributes
,
5166 "%qE attribute ignored for field of type %qT",
5167 name
, TREE_TYPE (*node
));
5169 DECL_PACKED (*node
) = 1;
5171 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
5172 used for DECL_REGISTER. It wouldn't mean anything anyway.
5173 We can't set DECL_PACKED on the type of a TYPE_DECL, because
5174 that changes what the typedef is typing. */
5177 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5178 *no_add_attrs
= true;
5184 /* Handle a "nocommon" attribute; arguments as in
5185 struct attribute_spec.handler. */
5188 handle_nocommon_attribute (tree
*node
, tree name
,
5189 tree
ARG_UNUSED (args
),
5190 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5192 if (TREE_CODE (*node
) == VAR_DECL
)
5193 DECL_COMMON (*node
) = 0;
5196 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5197 *no_add_attrs
= true;
5203 /* Handle a "common" attribute; arguments as in
5204 struct attribute_spec.handler. */
5207 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5208 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5210 if (TREE_CODE (*node
) == VAR_DECL
)
5211 DECL_COMMON (*node
) = 1;
5214 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5215 *no_add_attrs
= true;
5221 /* Handle a "noreturn" attribute; arguments as in
5222 struct attribute_spec.handler. */
5225 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5226 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5228 tree type
= TREE_TYPE (*node
);
5230 /* See FIXME comment in c_common_attribute_table. */
5231 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5232 TREE_THIS_VOLATILE (*node
) = 1;
5233 else if (TREE_CODE (type
) == POINTER_TYPE
5234 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5236 = build_pointer_type
5237 (build_type_variant (TREE_TYPE (type
),
5238 TYPE_READONLY (TREE_TYPE (type
)), 1));
5241 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5242 *no_add_attrs
= true;
5248 /* Handle a "hot" and attribute; arguments as in
5249 struct attribute_spec.handler. */
5252 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5253 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5255 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5257 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
5259 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5261 *no_add_attrs
= true;
5263 /* Most of the rest of the hot processing is done later with
5264 lookup_attribute. */
5268 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5269 *no_add_attrs
= true;
5274 /* Handle a "cold" and attribute; arguments as in
5275 struct attribute_spec.handler. */
5278 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5279 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5281 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5283 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
5285 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
5287 *no_add_attrs
= true;
5289 /* Most of the rest of the cold processing is done later with
5290 lookup_attribute. */
5294 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5295 *no_add_attrs
= true;
5301 /* Handle a "noinline" attribute; arguments as in
5302 struct attribute_spec.handler. */
5305 handle_noinline_attribute (tree
*node
, tree name
,
5306 tree
ARG_UNUSED (args
),
5307 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5309 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5310 DECL_UNINLINABLE (*node
) = 1;
5313 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5314 *no_add_attrs
= true;
5320 /* Handle a "always_inline" attribute; arguments as in
5321 struct attribute_spec.handler. */
5324 handle_always_inline_attribute (tree
*node
, tree name
,
5325 tree
ARG_UNUSED (args
),
5326 int ARG_UNUSED (flags
),
5329 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5331 /* Set the attribute and mark it for disregarding inline
5333 DECL_DISREGARD_INLINE_LIMITS (*node
) = 1;
5337 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5338 *no_add_attrs
= true;
5344 /* Handle a "gnu_inline" attribute; arguments as in
5345 struct attribute_spec.handler. */
5348 handle_gnu_inline_attribute (tree
*node
, tree name
,
5349 tree
ARG_UNUSED (args
),
5350 int ARG_UNUSED (flags
),
5353 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
5355 /* Do nothing else, just set the attribute. We'll get at
5356 it later with lookup_attribute. */
5360 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5361 *no_add_attrs
= true;
5367 /* Handle an "artificial" attribute; arguments as in
5368 struct attribute_spec.handler. */
5371 handle_artificial_attribute (tree
*node
, tree name
,
5372 tree
ARG_UNUSED (args
),
5373 int ARG_UNUSED (flags
),
5376 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
5378 /* Do nothing else, just set the attribute. We'll get at
5379 it later with lookup_attribute. */
5383 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5384 *no_add_attrs
= true;
5390 /* Handle a "flatten" attribute; arguments as in
5391 struct attribute_spec.handler. */
5394 handle_flatten_attribute (tree
*node
, tree name
,
5395 tree args ATTRIBUTE_UNUSED
,
5396 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
5398 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5399 /* Do nothing else, just set the attribute. We'll get at
5400 it later with lookup_attribute. */
5404 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5405 *no_add_attrs
= true;
5411 /* Handle a "warning" or "error" attribute; arguments as in
5412 struct attribute_spec.handler. */
5415 handle_error_attribute (tree
*node
, tree name
, tree args
,
5416 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5418 if (TREE_CODE (*node
) == FUNCTION_DECL
5419 || TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5420 /* Do nothing else, just set the attribute. We'll get at
5421 it later with lookup_attribute. */
5425 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5426 *no_add_attrs
= true;
5432 /* Handle a "used" attribute; arguments as in
5433 struct attribute_spec.handler. */
5436 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
5437 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5441 if (TREE_CODE (node
) == FUNCTION_DECL
5442 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
5444 TREE_USED (node
) = 1;
5445 DECL_PRESERVE_P (node
) = 1;
5449 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5450 *no_add_attrs
= true;
5456 /* Handle a "unused" attribute; arguments as in
5457 struct attribute_spec.handler. */
5460 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5461 int flags
, bool *no_add_attrs
)
5467 if (TREE_CODE (decl
) == PARM_DECL
5468 || TREE_CODE (decl
) == VAR_DECL
5469 || TREE_CODE (decl
) == FUNCTION_DECL
5470 || TREE_CODE (decl
) == LABEL_DECL
5471 || TREE_CODE (decl
) == TYPE_DECL
)
5472 TREE_USED (decl
) = 1;
5475 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5476 *no_add_attrs
= true;
5481 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5482 *node
= build_variant_type_copy (*node
);
5483 TREE_USED (*node
) = 1;
5489 /* Handle a "externally_visible" attribute; arguments as in
5490 struct attribute_spec.handler. */
5493 handle_externally_visible_attribute (tree
*pnode
, tree name
,
5494 tree
ARG_UNUSED (args
),
5495 int ARG_UNUSED (flags
),
5500 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
5502 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
5503 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
5505 warning (OPT_Wattributes
,
5506 "%qE attribute have effect only on public objects", name
);
5507 *no_add_attrs
= true;
5512 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5513 *no_add_attrs
= true;
5519 /* Handle a "const" attribute; arguments as in
5520 struct attribute_spec.handler. */
5523 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5524 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5526 tree type
= TREE_TYPE (*node
);
5528 /* See FIXME comment on noreturn in c_common_attribute_table. */
5529 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5530 TREE_READONLY (*node
) = 1;
5531 else if (TREE_CODE (type
) == POINTER_TYPE
5532 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5534 = build_pointer_type
5535 (build_type_variant (TREE_TYPE (type
), 1,
5536 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
5539 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5540 *no_add_attrs
= true;
5546 /* Handle a "transparent_union" attribute; arguments as in
5547 struct attribute_spec.handler. */
5550 handle_transparent_union_attribute (tree
*node
, tree name
,
5551 tree
ARG_UNUSED (args
), int flags
,
5556 *no_add_attrs
= true;
5558 if (TREE_CODE (*node
) == TYPE_DECL
)
5559 node
= &TREE_TYPE (*node
);
5562 if (TREE_CODE (type
) == UNION_TYPE
)
5564 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
5565 the code in finish_struct. */
5566 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5568 if (TYPE_FIELDS (type
) == NULL_TREE
5569 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
5572 /* A type variant isn't good enough, since we don't a cast
5573 to such a type removed as a no-op. */
5574 *node
= type
= build_duplicate_type (type
);
5577 TYPE_TRANSPARENT_UNION (type
) = 1;
5582 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5586 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
5587 get the requested priority for a constructor or destructor,
5588 possibly issuing diagnostics for invalid or reserved
5591 static priority_type
5592 get_priority (tree args
, bool is_destructor
)
5598 return DEFAULT_INIT_PRIORITY
;
5600 if (!SUPPORTS_INIT_PRIORITY
)
5603 error ("destructor priorities are not supported");
5605 error ("constructor priorities are not supported");
5606 return DEFAULT_INIT_PRIORITY
;
5609 arg
= TREE_VALUE (args
);
5610 if (!host_integerp (arg
, /*pos=*/0)
5611 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5614 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
5615 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
5618 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
5622 "destructor priorities from 0 to %d are reserved "
5623 "for the implementation",
5624 MAX_RESERVED_INIT_PRIORITY
);
5627 "constructor priorities from 0 to %d are reserved "
5628 "for the implementation",
5629 MAX_RESERVED_INIT_PRIORITY
);
5635 error ("destructor priorities must be integers from 0 to %d inclusive",
5638 error ("constructor priorities must be integers from 0 to %d inclusive",
5640 return DEFAULT_INIT_PRIORITY
;
5643 /* Handle a "constructor" attribute; arguments as in
5644 struct attribute_spec.handler. */
5647 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
5648 int ARG_UNUSED (flags
),
5652 tree type
= TREE_TYPE (decl
);
5654 if (TREE_CODE (decl
) == FUNCTION_DECL
5655 && TREE_CODE (type
) == FUNCTION_TYPE
5656 && decl_function_context (decl
) == 0)
5658 priority_type priority
;
5659 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
5660 priority
= get_priority (args
, /*is_destructor=*/false);
5661 SET_DECL_INIT_PRIORITY (decl
, priority
);
5662 TREE_USED (decl
) = 1;
5666 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5667 *no_add_attrs
= true;
5673 /* Handle a "destructor" attribute; arguments as in
5674 struct attribute_spec.handler. */
5677 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
5678 int ARG_UNUSED (flags
),
5682 tree type
= TREE_TYPE (decl
);
5684 if (TREE_CODE (decl
) == FUNCTION_DECL
5685 && TREE_CODE (type
) == FUNCTION_TYPE
5686 && decl_function_context (decl
) == 0)
5688 priority_type priority
;
5689 DECL_STATIC_DESTRUCTOR (decl
) = 1;
5690 priority
= get_priority (args
, /*is_destructor=*/true);
5691 SET_DECL_FINI_PRIORITY (decl
, priority
);
5692 TREE_USED (decl
) = 1;
5696 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5697 *no_add_attrs
= true;
5703 /* Handle a "mode" attribute; arguments as in
5704 struct attribute_spec.handler. */
5707 handle_mode_attribute (tree
*node
, tree name
, tree args
,
5708 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5712 *no_add_attrs
= true;
5714 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
5715 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5719 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
5720 int len
= strlen (p
);
5721 enum machine_mode mode
= VOIDmode
;
5725 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
5726 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
5728 char *newp
= (char *) alloca (len
- 1);
5730 strcpy (newp
, &p
[2]);
5731 newp
[len
- 4] = '\0';
5735 /* Change this type to have a type with the specified mode.
5736 First check for the special modes. */
5737 if (!strcmp (p
, "byte"))
5739 else if (!strcmp (p
, "word"))
5741 else if (!strcmp (p
, "pointer"))
5743 else if (!strcmp (p
, "libgcc_cmp_return"))
5744 mode
= targetm
.libgcc_cmp_return_mode ();
5745 else if (!strcmp (p
, "libgcc_shift_count"))
5746 mode
= targetm
.libgcc_shift_count_mode ();
5747 else if (!strcmp (p
, "unwind_word"))
5748 mode
= targetm
.unwind_word_mode ();
5750 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
5751 if (!strcmp (p
, GET_MODE_NAME (j
)))
5753 mode
= (enum machine_mode
) j
;
5757 if (mode
== VOIDmode
)
5759 error ("unknown machine mode %qs", p
);
5764 switch (GET_MODE_CLASS (mode
))
5767 case MODE_PARTIAL_INT
:
5769 case MODE_DECIMAL_FLOAT
:
5774 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
5777 case MODE_COMPLEX_INT
:
5778 case MODE_COMPLEX_FLOAT
:
5779 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
5782 case MODE_VECTOR_INT
:
5783 case MODE_VECTOR_FLOAT
:
5784 case MODE_VECTOR_FRACT
:
5785 case MODE_VECTOR_UFRACT
:
5786 case MODE_VECTOR_ACCUM
:
5787 case MODE_VECTOR_UACCUM
:
5788 warning (OPT_Wattributes
, "specifying vector types with "
5789 "__attribute__ ((mode)) is deprecated");
5790 warning (OPT_Wattributes
,
5791 "use __attribute__ ((vector_size)) instead");
5792 valid_mode
= vector_mode_valid_p (mode
);
5800 error ("unable to emulate %qs", p
);
5804 if (POINTER_TYPE_P (type
))
5806 tree (*fn
)(tree
, enum machine_mode
, bool);
5808 if (!targetm
.valid_pointer_mode (mode
))
5810 error ("invalid pointer mode %qs", p
);
5814 if (TREE_CODE (type
) == POINTER_TYPE
)
5815 fn
= build_pointer_type_for_mode
;
5817 fn
= build_reference_type_for_mode
;
5818 typefm
= fn (TREE_TYPE (type
), mode
, false);
5822 /* For fixed-point modes, we need to test if the signness of type
5823 and the machine mode are consistent. */
5824 if (ALL_FIXED_POINT_MODE_P (mode
)
5825 && TYPE_UNSIGNED (type
) != UNSIGNED_FIXED_POINT_MODE_P (mode
))
5827 error ("signness of type and machine mode %qs don't match", p
);
5830 /* For fixed-point modes, we need to pass saturating info. */
5831 typefm
= lang_hooks
.types
.type_for_mode (mode
,
5832 ALL_FIXED_POINT_MODE_P (mode
) ? TYPE_SATURATING (type
)
5833 : TYPE_UNSIGNED (type
));
5836 if (typefm
== NULL_TREE
)
5838 error ("no data type for mode %qs", p
);
5841 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5843 /* For enumeral types, copy the precision from the integer
5844 type returned above. If not an INTEGER_TYPE, we can't use
5845 this mode for this type. */
5846 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
5848 error ("cannot use mode %qs for enumeral types", p
);
5852 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
5854 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
5859 /* We cannot build a type variant, as there's code that assumes
5860 that TYPE_MAIN_VARIANT has the same mode. This includes the
5861 debug generators. Instead, create a subrange type. This
5862 results in all of the enumeral values being emitted only once
5863 in the original, and the subtype gets them by reference. */
5864 if (TYPE_UNSIGNED (type
))
5865 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
5867 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
5868 TREE_TYPE (typefm
) = type
;
5871 else if (VECTOR_MODE_P (mode
)
5872 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
5873 : TREE_CODE (type
) != TREE_CODE (typefm
))
5875 error ("mode %qs applied to inappropriate type", p
);
5885 /* Handle a "section" attribute; arguments as in
5886 struct attribute_spec.handler. */
5889 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5890 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5894 if (targetm
.have_named_sections
)
5896 user_defined_section_attribute
= true;
5898 if ((TREE_CODE (decl
) == FUNCTION_DECL
5899 || TREE_CODE (decl
) == VAR_DECL
)
5900 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5902 if (TREE_CODE (decl
) == VAR_DECL
5903 && current_function_decl
!= NULL_TREE
5904 && !TREE_STATIC (decl
))
5906 error ("%Jsection attribute cannot be specified for "
5907 "local variables", decl
);
5908 *no_add_attrs
= true;
5911 /* The decl may have already been given a section attribute
5912 from a previous declaration. Ensure they match. */
5913 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5914 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5915 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5917 error ("section of %q+D conflicts with previous declaration",
5919 *no_add_attrs
= true;
5921 else if (TREE_CODE (decl
) == VAR_DECL
5922 && !targetm
.have_tls
&& targetm
.emutls
.tmpl_section
5923 && DECL_THREAD_LOCAL_P (decl
))
5925 error ("section of %q+D cannot be overridden", *node
);
5926 *no_add_attrs
= true;
5929 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5933 error ("section attribute not allowed for %q+D", *node
);
5934 *no_add_attrs
= true;
5939 error ("%Jsection attributes are not supported for this target", *node
);
5940 *no_add_attrs
= true;
5946 /* Handle a "aligned" attribute; arguments as in
5947 struct attribute_spec.handler. */
5950 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5951 int flags
, bool *no_add_attrs
)
5953 tree decl
= NULL_TREE
;
5956 tree align_expr
= (args
? TREE_VALUE (args
)
5957 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5963 type
= &TREE_TYPE (decl
);
5964 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5966 else if (TYPE_P (*node
))
5967 type
= node
, is_type
= 1;
5969 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5971 error ("requested alignment is not a constant");
5972 *no_add_attrs
= true;
5974 else if ((i
= tree_log2 (align_expr
)) == -1)
5976 error ("requested alignment is not a power of 2");
5977 *no_add_attrs
= true;
5979 else if (i
> HOST_BITS_PER_INT
- 2)
5981 error ("requested alignment is too large");
5982 *no_add_attrs
= true;
5986 /* If we have a TYPE_DECL, then copy the type, so that we
5987 don't accidentally modify a builtin type. See pushdecl. */
5988 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5989 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5991 tree tt
= TREE_TYPE (decl
);
5992 *type
= build_variant_type_copy (*type
);
5993 DECL_ORIGINAL_TYPE (decl
) = tt
;
5994 TYPE_NAME (*type
) = decl
;
5995 TREE_USED (*type
) = TREE_USED (decl
);
5996 TREE_TYPE (decl
) = *type
;
5998 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5999 *type
= build_variant_type_copy (*type
);
6001 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
6002 TYPE_USER_ALIGN (*type
) = 1;
6004 else if (! VAR_OR_FUNCTION_DECL_P (decl
)
6005 && TREE_CODE (decl
) != FIELD_DECL
)
6007 error ("alignment may not be specified for %q+D", decl
);
6008 *no_add_attrs
= true;
6010 else if (TREE_CODE (decl
) == FUNCTION_DECL
6011 && DECL_ALIGN (decl
) > (1 << i
) * BITS_PER_UNIT
)
6013 if (DECL_USER_ALIGN (decl
))
6014 error ("alignment for %q+D was previously specified as %d "
6015 "and may not be decreased", decl
,
6016 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6018 error ("alignment for %q+D must be at least %d", decl
,
6019 DECL_ALIGN (decl
) / BITS_PER_UNIT
);
6020 *no_add_attrs
= true;
6024 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
6025 DECL_USER_ALIGN (decl
) = 1;
6031 /* Handle a "weak" attribute; arguments as in
6032 struct attribute_spec.handler. */
6035 handle_weak_attribute (tree
*node
, tree name
,
6036 tree
ARG_UNUSED (args
),
6037 int ARG_UNUSED (flags
),
6038 bool * ARG_UNUSED (no_add_attrs
))
6040 if (TREE_CODE (*node
) == FUNCTION_DECL
6041 && DECL_DECLARED_INLINE_P (*node
))
6043 error ("inline function %q+D cannot be declared weak", *node
);
6044 *no_add_attrs
= true;
6046 else if (TREE_CODE (*node
) == FUNCTION_DECL
6047 || TREE_CODE (*node
) == VAR_DECL
)
6048 declare_weak (*node
);
6050 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6055 /* Handle an "alias" attribute; arguments as in
6056 struct attribute_spec.handler. */
6059 handle_alias_attribute (tree
*node
, tree name
, tree args
,
6060 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6064 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
6065 || (TREE_CODE (decl
) != FUNCTION_DECL
6066 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
6067 /* A static variable declaration is always a tentative definition,
6068 but the alias is a non-tentative definition which overrides. */
6069 || (TREE_CODE (decl
) != FUNCTION_DECL
6070 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
6072 error ("%q+D defined both normally and as an alias", decl
);
6073 *no_add_attrs
= true;
6076 /* Note that the very first time we process a nested declaration,
6077 decl_function_context will not be set. Indeed, *would* never
6078 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
6079 we do below. After such frobbery, pushdecl would set the context.
6080 In any case, this is never what we want. */
6081 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
6085 id
= TREE_VALUE (args
);
6086 if (TREE_CODE (id
) != STRING_CST
)
6088 error ("alias argument not a string");
6089 *no_add_attrs
= true;
6092 id
= get_identifier (TREE_STRING_POINTER (id
));
6093 /* This counts as a use of the object pointed to. */
6096 if (TREE_CODE (decl
) == FUNCTION_DECL
)
6097 DECL_INITIAL (decl
) = error_mark_node
;
6100 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
6101 DECL_EXTERNAL (decl
) = 1;
6103 DECL_EXTERNAL (decl
) = 0;
6104 TREE_STATIC (decl
) = 1;
6109 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6110 *no_add_attrs
= true;
6116 /* Handle a "weakref" attribute; arguments as in struct
6117 attribute_spec.handler. */
6120 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6121 int flags
, bool *no_add_attrs
)
6123 tree attr
= NULL_TREE
;
6125 /* We must ignore the attribute when it is associated with
6126 local-scoped decls, since attribute alias is ignored and many
6127 such symbols do not even have a DECL_WEAK field. */
6128 if (decl_function_context (*node
) || current_function_decl
)
6130 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6131 *no_add_attrs
= true;
6135 /* The idea here is that `weakref("name")' mutates into `weakref,
6136 alias("name")', and weakref without arguments, in turn,
6137 implicitly adds weak. */
6141 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
6142 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
6144 *no_add_attrs
= true;
6146 decl_attributes (node
, attr
, flags
);
6150 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
6151 error ("%Jweakref attribute must appear before alias attribute",
6154 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
6155 and that isn't supported; and because it wants to add it to
6156 the list of weak decls, which isn't helpful. */
6157 DECL_WEAK (*node
) = 1;
6163 /* Handle an "visibility" attribute; arguments as in
6164 struct attribute_spec.handler. */
6167 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
6168 int ARG_UNUSED (flags
),
6169 bool *ARG_UNUSED (no_add_attrs
))
6172 tree id
= TREE_VALUE (args
);
6173 enum symbol_visibility vis
;
6177 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
6179 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
6181 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
6185 else if (TYPE_FIELDS (*node
))
6187 error ("%qE attribute ignored because %qT is already defined",
6192 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
6194 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6198 if (TREE_CODE (id
) != STRING_CST
)
6200 error ("visibility argument not a string");
6204 /* If this is a type, set the visibility on the type decl. */
6207 decl
= TYPE_NAME (decl
);
6210 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
6212 warning (OPT_Wattributes
, "%qE attribute ignored on types",
6218 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
6219 vis
= VISIBILITY_DEFAULT
;
6220 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
6221 vis
= VISIBILITY_INTERNAL
;
6222 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
6223 vis
= VISIBILITY_HIDDEN
;
6224 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
6225 vis
= VISIBILITY_PROTECTED
;
6228 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
6229 vis
= VISIBILITY_DEFAULT
;
6232 if (DECL_VISIBILITY_SPECIFIED (decl
)
6233 && vis
!= DECL_VISIBILITY (decl
))
6235 tree attributes
= (TYPE_P (*node
)
6236 ? TYPE_ATTRIBUTES (*node
)
6237 : DECL_ATTRIBUTES (decl
));
6238 if (lookup_attribute ("visibility", attributes
))
6239 error ("%qD redeclared with different visibility", decl
);
6240 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6241 && lookup_attribute ("dllimport", attributes
))
6242 error ("%qD was declared %qs which implies default visibility",
6244 else if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6245 && lookup_attribute ("dllexport", attributes
))
6246 error ("%qD was declared %qs which implies default visibility",
6250 DECL_VISIBILITY (decl
) = vis
;
6251 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
6253 /* Go ahead and attach the attribute to the node as well. This is needed
6254 so we can determine whether we have VISIBILITY_DEFAULT because the
6255 visibility was not specified, or because it was explicitly overridden
6256 from the containing scope. */
6261 /* Determine the ELF symbol visibility for DECL, which is either a
6262 variable or a function. It is an error to use this function if a
6263 definition of DECL is not available in this translation unit.
6264 Returns true if the final visibility has been determined by this
6265 function; false if the caller is free to make additional
6269 c_determine_visibility (tree decl
)
6271 gcc_assert (TREE_CODE (decl
) == VAR_DECL
6272 || TREE_CODE (decl
) == FUNCTION_DECL
);
6274 /* If the user explicitly specified the visibility with an
6275 attribute, honor that. DECL_VISIBILITY will have been set during
6276 the processing of the attribute. We check for an explicit
6277 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
6278 to distinguish the use of an attribute from the use of a "#pragma
6279 GCC visibility push(...)"; in the latter case we still want other
6280 considerations to be able to overrule the #pragma. */
6281 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
))
6282 || (TARGET_DLLIMPORT_DECL_ATTRIBUTES
6283 && (lookup_attribute ("dllimport", DECL_ATTRIBUTES (decl
))
6284 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))))
6287 /* Set default visibility to whatever the user supplied with
6288 visibility_specified depending on #pragma GCC visibility. */
6289 if (!DECL_VISIBILITY_SPECIFIED (decl
))
6291 DECL_VISIBILITY (decl
) = default_visibility
;
6292 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
6297 /* Handle an "tls_model" attribute; arguments as in
6298 struct attribute_spec.handler. */
6301 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
6302 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6306 enum tls_model kind
;
6308 *no_add_attrs
= true;
6310 if (!DECL_THREAD_LOCAL_P (decl
))
6312 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6316 kind
= DECL_TLS_MODEL (decl
);
6317 id
= TREE_VALUE (args
);
6318 if (TREE_CODE (id
) != STRING_CST
)
6320 error ("tls_model argument not a string");
6324 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
6325 kind
= TLS_MODEL_LOCAL_EXEC
;
6326 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
6327 kind
= TLS_MODEL_INITIAL_EXEC
;
6328 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
6329 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
6330 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
6331 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
6333 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
6335 DECL_TLS_MODEL (decl
) = kind
;
6339 /* Handle a "no_instrument_function" attribute; arguments as in
6340 struct attribute_spec.handler. */
6343 handle_no_instrument_function_attribute (tree
*node
, tree name
,
6344 tree
ARG_UNUSED (args
),
6345 int ARG_UNUSED (flags
),
6350 if (TREE_CODE (decl
) != FUNCTION_DECL
)
6352 error ("%J%qE attribute applies only to functions", decl
, name
);
6353 *no_add_attrs
= true;
6355 else if (DECL_INITIAL (decl
))
6357 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
6358 *no_add_attrs
= true;
6361 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
6366 /* Handle a "malloc" attribute; arguments as in
6367 struct attribute_spec.handler. */
6370 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6371 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6373 if (TREE_CODE (*node
) == FUNCTION_DECL
6374 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
6375 DECL_IS_MALLOC (*node
) = 1;
6378 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6379 *no_add_attrs
= true;
6385 /* Handle a "alloc_size" attribute; arguments as in
6386 struct attribute_spec.handler. */
6389 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
6390 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6392 unsigned arg_count
= type_num_arguments (*node
);
6393 for (; args
; args
= TREE_CHAIN (args
))
6395 tree position
= TREE_VALUE (args
);
6397 if (TREE_CODE (position
) != INTEGER_CST
6398 || TREE_INT_CST_HIGH (position
)
6399 || TREE_INT_CST_LOW (position
) < 1
6400 || TREE_INT_CST_LOW (position
) > arg_count
)
6402 warning (OPT_Wattributes
,
6403 "alloc_size parameter outside range");
6404 *no_add_attrs
= true;
6411 /* Handle a "returns_twice" attribute; arguments as in
6412 struct attribute_spec.handler. */
6415 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6416 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6418 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6419 DECL_IS_RETURNS_TWICE (*node
) = 1;
6422 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6423 *no_add_attrs
= true;
6429 /* Handle a "no_limit_stack" attribute; arguments as in
6430 struct attribute_spec.handler. */
6433 handle_no_limit_stack_attribute (tree
*node
, tree name
,
6434 tree
ARG_UNUSED (args
),
6435 int ARG_UNUSED (flags
),
6440 if (TREE_CODE (decl
) != FUNCTION_DECL
)
6442 error ("%J%qE attribute applies only to functions", decl
, name
);
6443 *no_add_attrs
= true;
6445 else if (DECL_INITIAL (decl
))
6447 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
6448 *no_add_attrs
= true;
6451 DECL_NO_LIMIT_STACK (decl
) = 1;
6456 /* Handle a "pure" attribute; arguments as in
6457 struct attribute_spec.handler. */
6460 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6461 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6463 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6464 DECL_PURE_P (*node
) = 1;
6465 /* ??? TODO: Support types. */
6468 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6469 *no_add_attrs
= true;
6475 /* Handle a "no vops" attribute; arguments as in
6476 struct attribute_spec.handler. */
6479 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
6480 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
6481 bool *ARG_UNUSED (no_add_attrs
))
6483 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
6484 DECL_IS_NOVOPS (*node
) = 1;
6488 /* Handle a "deprecated" attribute; arguments as in
6489 struct attribute_spec.handler. */
6492 handle_deprecated_attribute (tree
*node
, tree name
,
6493 tree
ARG_UNUSED (args
), int flags
,
6496 tree type
= NULL_TREE
;
6498 tree what
= NULL_TREE
;
6503 type
= TREE_TYPE (decl
);
6505 if (TREE_CODE (decl
) == TYPE_DECL
6506 || TREE_CODE (decl
) == PARM_DECL
6507 || TREE_CODE (decl
) == VAR_DECL
6508 || TREE_CODE (decl
) == FUNCTION_DECL
6509 || TREE_CODE (decl
) == FIELD_DECL
)
6510 TREE_DEPRECATED (decl
) = 1;
6514 else if (TYPE_P (*node
))
6516 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
6517 *node
= build_variant_type_copy (*node
);
6518 TREE_DEPRECATED (*node
) = 1;
6526 *no_add_attrs
= true;
6527 if (type
&& TYPE_NAME (type
))
6529 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
6530 what
= TYPE_NAME (*node
);
6531 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
6532 && DECL_NAME (TYPE_NAME (type
)))
6533 what
= DECL_NAME (TYPE_NAME (type
));
6536 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
6538 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6544 /* Handle a "vector_size" attribute; arguments as in
6545 struct attribute_spec.handler. */
6548 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
6549 int ARG_UNUSED (flags
),
6552 unsigned HOST_WIDE_INT vecsize
, nunits
;
6553 enum machine_mode orig_mode
;
6554 tree type
= *node
, new_type
, size
;
6556 *no_add_attrs
= true;
6558 size
= TREE_VALUE (args
);
6560 if (!host_integerp (size
, 1))
6562 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6566 /* Get the vector size (in bytes). */
6567 vecsize
= tree_low_cst (size
, 1);
6569 /* We need to provide for vector pointers, vector arrays, and
6570 functions returning vectors. For example:
6572 __attribute__((vector_size(16))) short *foo;
6574 In this case, the mode is SI, but the type being modified is
6575 HI, so we need to look further. */
6577 while (POINTER_TYPE_P (type
)
6578 || TREE_CODE (type
) == FUNCTION_TYPE
6579 || TREE_CODE (type
) == METHOD_TYPE
6580 || TREE_CODE (type
) == ARRAY_TYPE
6581 || TREE_CODE (type
) == OFFSET_TYPE
)
6582 type
= TREE_TYPE (type
);
6584 /* Get the mode of the type being modified. */
6585 orig_mode
= TYPE_MODE (type
);
6587 if ((!INTEGRAL_TYPE_P (type
)
6588 && !SCALAR_FLOAT_TYPE_P (type
)
6589 && !FIXED_POINT_TYPE_P (type
))
6590 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
6591 && GET_MODE_CLASS (orig_mode
) != MODE_INT
6592 && !ALL_SCALAR_FIXED_POINT_MODE_P (orig_mode
))
6593 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
6595 error ("invalid vector type for attribute %qE", name
);
6599 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
6601 error ("vector size not an integral multiple of component size");
6607 error ("zero vector size");
6611 /* Calculate how many units fit in the vector. */
6612 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6613 if (nunits
& (nunits
- 1))
6615 error ("number of components of the vector not a power of two");
6619 new_type
= build_vector_type (type
, nunits
);
6621 /* Build back pointers if needed. */
6622 *node
= lang_hooks
.types
.reconstruct_complex_type (*node
, new_type
);
6627 /* Handle the "nonnull" attribute. */
6629 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
6630 tree args
, int ARG_UNUSED (flags
),
6634 unsigned HOST_WIDE_INT attr_arg_num
;
6636 /* If no arguments are specified, all pointer arguments should be
6637 non-null. Verify a full prototype is given so that the arguments
6638 will have the correct types when we actually check them later. */
6641 if (!TYPE_ARG_TYPES (type
))
6643 error ("nonnull attribute without arguments on a non-prototype");
6644 *no_add_attrs
= true;
6649 /* Argument list specified. Verify that each argument number references
6650 a pointer argument. */
6651 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
6654 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
6656 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
6658 error ("nonnull argument has invalid operand number (argument %lu)",
6659 (unsigned long) attr_arg_num
);
6660 *no_add_attrs
= true;
6664 argument
= TYPE_ARG_TYPES (type
);
6667 for (ck_num
= 1; ; ck_num
++)
6669 if (!argument
|| ck_num
== arg_num
)
6671 argument
= TREE_CHAIN (argument
);
6675 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
6677 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
6678 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
6679 *no_add_attrs
= true;
6683 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
6685 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
6686 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
6687 *no_add_attrs
= true;
6696 /* Check the argument list of a function call for null in argument slots
6697 that are marked as requiring a non-null pointer argument. The NARGS
6698 arguments are passed in the array ARGARRAY.
6702 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
6707 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
6709 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
6711 args
= TREE_VALUE (a
);
6713 /* Walk the argument list. If we encounter an argument number we
6714 should check for non-null, do it. If the attribute has no args,
6715 then every pointer argument is checked (in which case the check
6716 for pointer type is done in check_nonnull_arg). */
6717 for (i
= 0; i
< nargs
; i
++)
6719 if (!args
|| nonnull_check_p (args
, i
+ 1))
6720 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
6728 /* Check that the Nth argument of a function call (counting backwards
6729 from the end) is a (pointer)0. The NARGS arguments are passed in the
6733 check_function_sentinel (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
6735 tree attr
= lookup_attribute ("sentinel", attrs
);
6743 /* Skip over the named arguments. */
6744 while (typelist
&& len
< nargs
)
6746 typelist
= TREE_CHAIN (typelist
);
6750 if (TREE_VALUE (attr
))
6752 tree p
= TREE_VALUE (TREE_VALUE (attr
));
6753 pos
= TREE_INT_CST_LOW (p
);
6756 /* The sentinel must be one of the varargs, i.e.
6757 in position >= the number of fixed arguments. */
6758 if ((nargs
- 1 - pos
) < len
)
6760 warning (OPT_Wformat
,
6761 "not enough variable arguments to fit a sentinel");
6765 /* Validate the sentinel. */
6766 sentinel
= argarray
[nargs
- 1 - pos
];
6767 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
6768 || !integer_zerop (sentinel
))
6769 /* Although __null (in C++) is only an integer we allow it
6770 nevertheless, as we are guaranteed that it's exactly
6771 as wide as a pointer, and we don't want to force
6772 users to cast the NULL they have written there.
6773 We warn with -Wstrict-null-sentinel, though. */
6774 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
6775 warning (OPT_Wformat
, "missing sentinel in function call");
6779 /* Helper for check_function_nonnull; given a list of operands which
6780 must be non-null in ARGS, determine if operand PARAM_NUM should be
6784 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
6786 unsigned HOST_WIDE_INT arg_num
= 0;
6788 for (; args
; args
= TREE_CHAIN (args
))
6790 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
6794 if (arg_num
== param_num
)
6800 /* Check that the function argument PARAM (which is operand number
6801 PARAM_NUM) is non-null. This is called by check_function_nonnull
6802 via check_function_arguments_recurse. */
6805 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
6806 unsigned HOST_WIDE_INT param_num
)
6808 /* Just skip checking the argument if it's not a pointer. This can
6809 happen if the "nonnull" attribute was given without an operand
6810 list (which means to check every pointer argument). */
6812 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
6815 if (integer_zerop (param
))
6816 warning (OPT_Wnonnull
, "null argument where non-null required "
6817 "(argument %lu)", (unsigned long) param_num
);
6820 /* Helper for nonnull attribute handling; fetch the operand number
6821 from the attribute argument list. */
6824 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
6826 /* Verify the arg number is a constant. */
6827 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
6828 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
6831 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
6835 /* Handle a "nothrow" attribute; arguments as in
6836 struct attribute_spec.handler. */
6839 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6840 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6842 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6843 TREE_NOTHROW (*node
) = 1;
6844 /* ??? TODO: Support types. */
6847 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6848 *no_add_attrs
= true;
6854 /* Handle a "cleanup" attribute; arguments as in
6855 struct attribute_spec.handler. */
6858 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
6859 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6862 tree cleanup_id
, cleanup_decl
;
6864 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
6865 for global destructors in C++. This requires infrastructure that
6866 we don't have generically at the moment. It's also not a feature
6867 we'd be missing too much, since we do have attribute constructor. */
6868 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
6870 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6871 *no_add_attrs
= true;
6875 /* Verify that the argument is a function in scope. */
6876 /* ??? We could support pointers to functions here as well, if
6877 that was considered desirable. */
6878 cleanup_id
= TREE_VALUE (args
);
6879 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
6881 error ("cleanup argument not an identifier");
6882 *no_add_attrs
= true;
6885 cleanup_decl
= lookup_name (cleanup_id
);
6886 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
6888 error ("cleanup argument not a function");
6889 *no_add_attrs
= true;
6893 /* That the function has proper type is checked with the
6894 eventual call to build_function_call. */
6899 /* Handle a "warn_unused_result" attribute. No special handling. */
6902 handle_warn_unused_result_attribute (tree
*node
, tree name
,
6903 tree
ARG_UNUSED (args
),
6904 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6906 /* Ignore the attribute for functions not returning any value. */
6907 if (VOID_TYPE_P (TREE_TYPE (*node
)))
6909 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6910 *no_add_attrs
= true;
6916 /* Handle a "sentinel" attribute. */
6919 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
6920 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6922 tree params
= TYPE_ARG_TYPES (*node
);
6926 warning (OPT_Wattributes
,
6927 "%qE attribute requires prototypes with named arguments", name
);
6928 *no_add_attrs
= true;
6932 while (TREE_CHAIN (params
))
6933 params
= TREE_CHAIN (params
);
6935 if (VOID_TYPE_P (TREE_VALUE (params
)))
6937 warning (OPT_Wattributes
,
6938 "%qE attribute only applies to variadic functions", name
);
6939 *no_add_attrs
= true;
6945 tree position
= TREE_VALUE (args
);
6947 if (TREE_CODE (position
) != INTEGER_CST
)
6949 warning (OPT_Wattributes
,
6950 "requested position is not an integer constant");
6951 *no_add_attrs
= true;
6955 if (tree_int_cst_lt (position
, integer_zero_node
))
6957 warning (OPT_Wattributes
,
6958 "requested position is less than zero");
6959 *no_add_attrs
= true;
6967 /* Handle a "type_generic" attribute. */
6970 handle_type_generic_attribute (tree
*node
, tree
ARG_UNUSED (name
),
6971 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
6972 bool * ARG_UNUSED (no_add_attrs
))
6976 /* Ensure we have a function type. */
6977 gcc_assert (TREE_CODE (*node
) == FUNCTION_TYPE
);
6979 params
= TYPE_ARG_TYPES (*node
);
6980 while (params
&& ! VOID_TYPE_P (TREE_VALUE (params
)))
6981 params
= TREE_CHAIN (params
);
6983 /* Ensure we have a variadic function. */
6984 gcc_assert (!params
);
6989 /* Handle a "target" attribute. */
6992 handle_target_attribute (tree
*node
, tree name
, tree args
, int flags
,
6995 /* Ensure we have a function type. */
6996 if (TREE_CODE (*node
) != FUNCTION_DECL
)
6998 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6999 *no_add_attrs
= true;
7001 else if (! targetm
.target_option
.valid_attribute_p (*node
, name
, args
,
7003 *no_add_attrs
= true;
7008 /* Arguments being collected for optimization. */
7009 typedef const char *const_char_p
; /* For DEF_VEC_P. */
7010 DEF_VEC_P(const_char_p
);
7011 DEF_VEC_ALLOC_P(const_char_p
, gc
);
7012 static GTY(()) VEC(const_char_p
, gc
) *optimize_args
;
7015 /* Inner function to convert a TREE_LIST to argv string to parse the optimize
7016 options in ARGS. ATTR_P is true if this is for attribute(optimize), and
7017 false for #pragma GCC optimize. */
7020 parse_optimize_options (tree args
, bool attr_p
)
7025 const char **opt_argv
;
7028 /* Build up argv vector. Just in case the string is stored away, use garbage
7029 collected strings. */
7030 VEC_truncate (const_char_p
, optimize_args
, 0);
7031 VEC_safe_push (const_char_p
, gc
, optimize_args
, NULL
);
7033 for (ap
= args
; ap
!= NULL_TREE
; ap
= TREE_CHAIN (ap
))
7035 tree value
= TREE_VALUE (ap
);
7037 if (TREE_CODE (value
) == INTEGER_CST
)
7040 sprintf (buffer
, "-O%ld", (long) TREE_INT_CST_LOW (value
));
7041 VEC_safe_push (const_char_p
, gc
, optimize_args
, ggc_strdup (buffer
));
7044 else if (TREE_CODE (value
) == STRING_CST
)
7046 /* Split string into multiple substrings. */
7047 size_t len
= TREE_STRING_LENGTH (value
);
7048 char *p
= ASTRDUP (TREE_STRING_POINTER (value
));
7049 char *end
= p
+ len
;
7053 while (next_p
!= NULL
)
7059 comma
= strchr (p
, ',');
7072 r
= q
= (char *) ggc_alloc (len2
+ 3);
7074 /* If the user supplied -Oxxx or -fxxx, only allow -Oxxx or -fxxx
7076 if (*p
== '-' && p
[1] != 'O' && p
[1] != 'f')
7080 warning (OPT_Wattributes
,
7081 "Bad option %s to optimize attribute.", p
);
7083 warning (OPT_Wpragmas
,
7084 "Bad option %s to pragma attribute", p
);
7092 /* Assume that Ox is -Ox, a numeric value is -Ox, a s by
7093 itself is -Os, and any other switch begins with a -f. */
7094 if ((*p
>= '0' && *p
<= '9')
7095 || (p
[0] == 's' && p
[1] == '\0'))
7101 memcpy (r
, p
, len2
);
7103 VEC_safe_push (const_char_p
, gc
, optimize_args
, q
);
7109 opt_argc
= VEC_length (const_char_p
, optimize_args
);
7110 opt_argv
= (const char **) alloca (sizeof (char *) * (opt_argc
+ 1));
7112 for (i
= 1; i
< opt_argc
; i
++)
7113 opt_argv
[i
] = VEC_index (const_char_p
, optimize_args
, i
);
7115 /* Now parse the options. */
7116 decode_options (opt_argc
, opt_argv
);
7118 VEC_truncate (const_char_p
, optimize_args
, 0);
7122 /* For handling "optimize" attribute. arguments as in
7123 struct attribute_spec.handler. */
7126 handle_optimize_attribute (tree
*node
, tree name
, tree args
,
7127 int ARG_UNUSED (flags
), bool *no_add_attrs
)
7129 /* Ensure we have a function type. */
7130 if (TREE_CODE (*node
) != FUNCTION_DECL
)
7132 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
7133 *no_add_attrs
= true;
7137 struct cl_optimization cur_opts
;
7138 tree old_opts
= DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
);
7140 /* Save current options. */
7141 cl_optimization_save (&cur_opts
);
7143 /* If we previously had some optimization options, use them as the
7146 cl_optimization_restore (TREE_OPTIMIZATION (old_opts
));
7148 /* Parse options, and update the vector. */
7149 parse_optimize_options (args
, true);
7150 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (*node
)
7151 = build_optimization_node ();
7153 /* Restore current options. */
7154 cl_optimization_restore (&cur_opts
);
7160 /* Check for valid arguments being passed to a function.
7161 ATTRS is a list of attributes. There are NARGS arguments in the array
7162 ARGARRAY. TYPELIST is the list of argument types for the function.
7165 check_function_arguments (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
7167 /* Check for null being passed in a pointer argument that must be
7168 non-null. We also need to do this if format checking is enabled. */
7171 check_function_nonnull (attrs
, nargs
, argarray
);
7173 /* Check for errors in format strings. */
7175 if (warn_format
|| warn_missing_format_attribute
)
7176 check_function_format (attrs
, nargs
, argarray
);
7179 check_function_sentinel (attrs
, nargs
, argarray
, typelist
);
7182 /* Generic argument checking recursion routine. PARAM is the argument to
7183 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
7184 once the argument is resolved. CTX is context for the callback. */
7186 check_function_arguments_recurse (void (*callback
)
7187 (void *, tree
, unsigned HOST_WIDE_INT
),
7188 void *ctx
, tree param
,
7189 unsigned HOST_WIDE_INT param_num
)
7191 if (CONVERT_EXPR_P (param
)
7192 && (TYPE_PRECISION (TREE_TYPE (param
))
7193 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
7195 /* Strip coercion. */
7196 check_function_arguments_recurse (callback
, ctx
,
7197 TREE_OPERAND (param
, 0), param_num
);
7201 if (TREE_CODE (param
) == CALL_EXPR
)
7203 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
7205 bool found_format_arg
= false;
7207 /* See if this is a call to a known internationalization function
7208 that modifies a format arg. Such a function may have multiple
7209 format_arg attributes (for example, ngettext). */
7211 for (attrs
= TYPE_ATTRIBUTES (type
);
7213 attrs
= TREE_CHAIN (attrs
))
7214 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
7217 tree format_num_expr
;
7220 call_expr_arg_iterator iter
;
7222 /* Extract the argument number, which was previously checked
7224 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
7226 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
7227 && !TREE_INT_CST_HIGH (format_num_expr
));
7229 format_num
= TREE_INT_CST_LOW (format_num_expr
);
7231 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
7233 inner_arg
= next_call_expr_arg (&iter
), i
++)
7234 if (i
== format_num
)
7236 check_function_arguments_recurse (callback
, ctx
,
7237 inner_arg
, param_num
);
7238 found_format_arg
= true;
7243 /* If we found a format_arg attribute and did a recursive check,
7244 we are done with checking this argument. Otherwise, we continue
7245 and this will be considered a non-literal. */
7246 if (found_format_arg
)
7250 if (TREE_CODE (param
) == COND_EXPR
)
7252 /* Check both halves of the conditional expression. */
7253 check_function_arguments_recurse (callback
, ctx
,
7254 TREE_OPERAND (param
, 1), param_num
);
7255 check_function_arguments_recurse (callback
, ctx
,
7256 TREE_OPERAND (param
, 2), param_num
);
7260 (*callback
) (ctx
, param
, param_num
);
7263 /* Checks the number of arguments NARGS against the required number
7264 REQUIRED and issues an error if there is a mismatch. Returns true
7265 if the number of arguments is correct, otherwise false. */
7268 validate_nargs (tree fndecl
, int nargs
, int required
)
7270 if (nargs
< required
)
7272 error ("not enough arguments to function %qE", fndecl
);
7275 else if (nargs
> required
)
7277 error ("too many arguments to function %qE", fndecl
);
7283 /* Verifies the NARGS arguments ARGS to the builtin function FNDECL.
7284 Returns false if there was an error, otherwise true. */
7287 check_builtin_function_arguments (tree fndecl
, int nargs
, tree
*args
)
7289 if (!DECL_BUILT_IN (fndecl
)
7290 || DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_NORMAL
)
7293 switch (DECL_FUNCTION_CODE (fndecl
))
7295 case BUILT_IN_CONSTANT_P
:
7296 return validate_nargs (fndecl
, nargs
, 1);
7298 case BUILT_IN_ISFINITE
:
7299 case BUILT_IN_ISINF
:
7300 case BUILT_IN_ISINF_SIGN
:
7301 case BUILT_IN_ISNAN
:
7302 case BUILT_IN_ISNORMAL
:
7303 if (validate_nargs (fndecl
, nargs
, 1))
7305 if (TREE_CODE (TREE_TYPE (args
[0])) != REAL_TYPE
)
7307 error ("non-floating-point argument in call to "
7308 "function %qE", fndecl
);
7315 case BUILT_IN_ISGREATER
:
7316 case BUILT_IN_ISGREATEREQUAL
:
7317 case BUILT_IN_ISLESS
:
7318 case BUILT_IN_ISLESSEQUAL
:
7319 case BUILT_IN_ISLESSGREATER
:
7320 case BUILT_IN_ISUNORDERED
:
7321 if (validate_nargs (fndecl
, nargs
, 2))
7323 enum tree_code code0
, code1
;
7324 code0
= TREE_CODE (TREE_TYPE (args
[0]));
7325 code1
= TREE_CODE (TREE_TYPE (args
[1]));
7326 if (!((code0
== REAL_TYPE
&& code1
== REAL_TYPE
)
7327 || (code0
== REAL_TYPE
&& code1
== INTEGER_TYPE
)
7328 || (code0
== INTEGER_TYPE
&& code1
== REAL_TYPE
)))
7330 error ("non-floating-point arguments in call to "
7331 "function %qE", fndecl
);
7338 case BUILT_IN_FPCLASSIFY
:
7339 if (validate_nargs (fndecl
, nargs
, 6))
7344 if (TREE_CODE (args
[i
]) != INTEGER_CST
)
7346 error ("non-const integer argument %u in call to function %qE",
7351 if (TREE_CODE (TREE_TYPE (args
[5])) != REAL_TYPE
)
7353 error ("non-floating-point argument in call to function %qE",
7366 /* Function to help qsort sort FIELD_DECLs by name order. */
7369 field_decl_cmp (const void *x_p
, const void *y_p
)
7371 const tree
*const x
= (const tree
*const) x_p
;
7372 const tree
*const y
= (const tree
*const) y_p
;
7374 if (DECL_NAME (*x
) == DECL_NAME (*y
))
7375 /* A nontype is "greater" than a type. */
7376 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
7377 if (DECL_NAME (*x
) == NULL_TREE
)
7379 if (DECL_NAME (*y
) == NULL_TREE
)
7381 if (DECL_NAME (*x
) < DECL_NAME (*y
))
7387 gt_pointer_operator new_value
;
7391 /* This routine compares two fields like field_decl_cmp but using the
7392 pointer operator in resort_data. */
7395 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
7397 const tree
*const x
= (const tree
*const) x_p
;
7398 const tree
*const y
= (const tree
*const) y_p
;
7400 if (DECL_NAME (*x
) == DECL_NAME (*y
))
7401 /* A nontype is "greater" than a type. */
7402 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
7403 if (DECL_NAME (*x
) == NULL_TREE
)
7405 if (DECL_NAME (*y
) == NULL_TREE
)
7408 tree d1
= DECL_NAME (*x
);
7409 tree d2
= DECL_NAME (*y
);
7410 resort_data
.new_value (&d1
, resort_data
.cookie
);
7411 resort_data
.new_value (&d2
, resort_data
.cookie
);
7418 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
7421 resort_sorted_fields (void *obj
,
7422 void * ARG_UNUSED (orig_obj
),
7423 gt_pointer_operator new_value
,
7426 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
7427 resort_data
.new_value
= new_value
;
7428 resort_data
.cookie
= cookie
;
7429 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
7430 resort_field_decl_cmp
);
7433 /* Subroutine of c_parse_error.
7434 Return the result of concatenating LHS and RHS. RHS is really
7435 a string literal, its first character is indicated by RHS_START and
7436 RHS_SIZE is its length (including the terminating NUL character).
7438 The caller is responsible for deleting the returned pointer. */
7441 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
7443 const int lhs_size
= strlen (lhs
);
7444 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
7445 strncpy (result
, lhs
, lhs_size
);
7446 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
7450 /* Issue the error given by GMSGID, indicating that it occurred before
7451 TOKEN, which had the associated VALUE. */
7454 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
7456 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
7458 char *message
= NULL
;
7460 if (token
== CPP_EOF
)
7461 message
= catenate_messages (gmsgid
, " at end of input");
7462 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
|| token
== CPP_CHAR16
7463 || token
== CPP_CHAR32
)
7465 unsigned int val
= TREE_INT_CST_LOW (value
);
7484 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
7485 message
= catenate_messages (gmsgid
, " before %s'%c'");
7487 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
7489 error (message
, prefix
, val
);
7493 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
|| token
== CPP_STRING16
7494 || token
== CPP_STRING32
)
7495 message
= catenate_messages (gmsgid
, " before string constant");
7496 else if (token
== CPP_NUMBER
)
7497 message
= catenate_messages (gmsgid
, " before numeric constant");
7498 else if (token
== CPP_NAME
)
7500 message
= catenate_messages (gmsgid
, " before %qE");
7501 error (message
, value
);
7505 else if (token
== CPP_PRAGMA
)
7506 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
7507 else if (token
== CPP_PRAGMA_EOL
)
7508 message
= catenate_messages (gmsgid
, " before end of line");
7509 else if (token
< N_TTYPES
)
7511 message
= catenate_messages (gmsgid
, " before %qs token");
7512 error (message
, cpp_type2name (token
));
7524 #undef catenate_messages
7527 /* Walk a gimplified function and warn for functions whose return value is
7528 ignored and attribute((warn_unused_result)) is set. This is done before
7529 inlining, so we don't have to worry about that. */
7532 c_warn_unused_result (gimple_seq seq
)
7535 gimple_stmt_iterator i
;
7537 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
7539 gimple g
= gsi_stmt (i
);
7541 switch (gimple_code (g
))
7544 c_warn_unused_result (gimple_bind_body (g
));
7547 c_warn_unused_result (gimple_try_eval (g
));
7548 c_warn_unused_result (gimple_try_cleanup (g
));
7551 c_warn_unused_result (gimple_catch_handler (g
));
7553 case GIMPLE_EH_FILTER
:
7554 c_warn_unused_result (gimple_eh_filter_failure (g
));
7558 if (gimple_call_lhs (g
))
7561 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7562 LHS. All calls whose value is ignored should be
7563 represented like this. Look for the attribute. */
7564 fdecl
= gimple_call_fndecl (g
);
7565 ftype
= TREE_TYPE (TREE_TYPE (gimple_call_fn (g
)));
7567 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
7569 location_t loc
= gimple_location (g
);
7572 warning (0, "%Hignoring return value of %qD, "
7573 "declared with attribute warn_unused_result",
7576 warning (0, "%Hignoring return value of function "
7577 "declared with attribute warn_unused_result",
7583 /* Not a container, not a call, or a call whose value is used. */
7589 /* Convert a character from the host to the target execution character
7590 set. cpplib handles this, mostly. */
7593 c_common_to_target_charset (HOST_WIDE_INT c
)
7595 /* Character constants in GCC proper are sign-extended under -fsigned-char,
7596 zero-extended under -fno-signed-char. cpplib insists that characters
7597 and character constants are always unsigned. Hence we must convert
7599 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
7601 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
7603 if (flag_signed_char
)
7604 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
7605 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
7610 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
7611 component references, with STOP_REF, or alternatively an INDIRECT_REF of
7612 NULL, at the bottom; much like the traditional rendering of offsetof as a
7613 macro. Returns the folded and properly cast result. */
7616 fold_offsetof_1 (tree expr
, tree stop_ref
)
7618 enum tree_code code
= PLUS_EXPR
;
7621 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
7622 return size_zero_node
;
7624 switch (TREE_CODE (expr
))
7630 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
7631 return error_mark_node
;
7635 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
7636 return error_mark_node
;
7639 gcc_assert (integer_zerop (expr
));
7640 return size_zero_node
;
7644 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
7645 gcc_assert (base
== error_mark_node
|| base
== size_zero_node
);
7649 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
7650 if (base
== error_mark_node
)
7653 t
= TREE_OPERAND (expr
, 1);
7654 if (DECL_C_BIT_FIELD (t
))
7656 error ("attempt to take address of bit-field structure "
7658 return error_mark_node
;
7660 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
7661 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
7666 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
7667 if (base
== error_mark_node
)
7670 t
= TREE_OPERAND (expr
, 1);
7671 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
7674 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
7676 t
= convert (sizetype
, t
);
7677 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
7681 /* Handle static members of volatile structs. */
7682 t
= TREE_OPERAND (expr
, 1);
7683 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
7684 return fold_offsetof_1 (t
, stop_ref
);
7690 return size_binop (code
, base
, off
);
7694 fold_offsetof (tree expr
, tree stop_ref
)
7696 /* Convert back from the internal sizetype to size_t. */
7697 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
7700 /* Print an error message for an invalid lvalue. USE says
7701 how the lvalue is being used and so selects the error message. */
7704 lvalue_error (enum lvalue_use use
)
7709 error ("lvalue required as left operand of assignment");
7712 error ("lvalue required as increment operand");
7715 error ("lvalue required as decrement operand");
7718 error ("lvalue required as unary %<&%> operand");
7721 error ("lvalue required in asm statement");
7728 /* *PTYPE is an incomplete array. Complete it with a domain based on
7729 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
7730 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
7731 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
7734 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
7736 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
7737 int failure
= 0, quals
;
7738 hashval_t hashcode
= 0;
7740 maxindex
= size_zero_node
;
7743 if (TREE_CODE (initial_value
) == STRING_CST
)
7746 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
7747 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
7749 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
7751 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
7753 if (VEC_empty (constructor_elt
, v
))
7757 maxindex
= integer_minus_one_node
;
7762 unsigned HOST_WIDE_INT cnt
;
7763 constructor_elt
*ce
;
7765 if (VEC_index (constructor_elt
, v
, 0)->index
)
7766 maxindex
= fold_convert (sizetype
,
7767 VEC_index (constructor_elt
,
7769 curindex
= maxindex
;
7772 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
7776 curindex
= fold_convert (sizetype
, ce
->index
);
7778 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
7780 if (tree_int_cst_lt (maxindex
, curindex
))
7781 maxindex
= curindex
;
7787 /* Make an error message unless that happened already. */
7788 if (initial_value
!= error_mark_node
)
7800 elt
= TREE_TYPE (type
);
7801 quals
= TYPE_QUALS (strip_array_types (elt
));
7805 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
7807 /* Using build_distinct_type_copy and modifying things afterward instead
7808 of using build_array_type to create a new type preserves all of the
7809 TYPE_LANG_FLAG_? bits that the front end may have set. */
7810 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
7811 TREE_TYPE (main_type
) = unqual_elt
;
7812 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
7813 layout_type (main_type
);
7815 /* Make sure we have the canonical MAIN_TYPE. */
7816 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
7817 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
7819 main_type
= type_hash_canon (hashcode
, main_type
);
7821 /* Fix the canonical type. */
7822 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (main_type
))
7823 || TYPE_STRUCTURAL_EQUALITY_P (TYPE_DOMAIN (main_type
)))
7824 SET_TYPE_STRUCTURAL_EQUALITY (main_type
);
7825 else if (TYPE_CANONICAL (TREE_TYPE (main_type
)) != TREE_TYPE (main_type
)
7826 || (TYPE_CANONICAL (TYPE_DOMAIN (main_type
))
7827 != TYPE_DOMAIN (main_type
)))
7828 TYPE_CANONICAL (main_type
)
7829 = build_array_type (TYPE_CANONICAL (TREE_TYPE (main_type
)),
7830 TYPE_CANONICAL (TYPE_DOMAIN (main_type
)));
7832 TYPE_CANONICAL (main_type
) = main_type
;
7837 type
= c_build_qualified_type (main_type
, quals
);
7839 if (COMPLETE_TYPE_P (type
)
7840 && TREE_CODE (TYPE_SIZE_UNIT (type
)) == INTEGER_CST
7841 && TREE_OVERFLOW (TYPE_SIZE_UNIT (type
)))
7843 error ("size of array is too large");
7844 /* If we proceed with the array type as it is, we'll eventually
7845 crash in tree_low_cst(). */
7846 type
= error_mark_node
;
7854 /* Used to help initialize the builtin-types.def table. When a type of
7855 the correct size doesn't exist, use error_mark_node instead of NULL.
7856 The later results in segfaults even when a decl using the type doesn't
7860 builtin_type_for_size (int size
, bool unsignedp
)
7862 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
7863 return type
? type
: error_mark_node
;
7866 /* A helper function for resolve_overloaded_builtin in resolving the
7867 overloaded __sync_ builtins. Returns a positive power of 2 if the
7868 first operand of PARAMS is a pointer to a supported data type.
7869 Returns 0 if an error is encountered. */
7872 sync_resolve_size (tree function
, tree params
)
7879 error ("too few arguments to function %qE", function
);
7883 type
= TREE_TYPE (TREE_VALUE (params
));
7884 if (TREE_CODE (type
) != POINTER_TYPE
)
7887 type
= TREE_TYPE (type
);
7888 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
7891 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
7892 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
7896 error ("incompatible type for argument %d of %qE", 1, function
);
7900 /* A helper function for resolve_overloaded_builtin. Adds casts to
7901 PARAMS to make arguments match up with those of FUNCTION. Drops
7902 the variadic arguments at the end. Returns false if some error
7903 was encountered; true on success. */
7906 sync_resolve_params (tree orig_function
, tree function
, tree params
)
7908 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
7912 /* We've declared the implementation functions to use "volatile void *"
7913 as the pointer parameter, so we shouldn't get any complaints from the
7914 call to check_function_arguments what ever type the user used. */
7915 arg_types
= TREE_CHAIN (arg_types
);
7916 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
7919 /* For the rest of the values, we need to cast these to FTYPE, so that we
7920 don't get warnings for passing pointer types, etc. */
7921 while (arg_types
!= void_list_node
)
7925 params
= TREE_CHAIN (params
);
7928 error ("too few arguments to function %qE", orig_function
);
7932 /* ??? Ideally for the first conversion we'd use convert_for_assignment
7933 so that we get warnings for anything that doesn't match the pointer
7934 type. This isn't portable across the C and C++ front ends atm. */
7935 val
= TREE_VALUE (params
);
7936 val
= convert (ptype
, val
);
7937 val
= convert (TREE_VALUE (arg_types
), val
);
7938 TREE_VALUE (params
) = val
;
7940 arg_types
= TREE_CHAIN (arg_types
);
7944 /* The definition of these primitives is variadic, with the remaining
7945 being "an optional list of variables protected by the memory barrier".
7946 No clue what that's supposed to mean, precisely, but we consider all
7947 call-clobbered variables to be protected so we're safe. */
7948 TREE_CHAIN (params
) = NULL
;
7953 /* A helper function for resolve_overloaded_builtin. Adds a cast to
7954 RESULT to make it match the type of the first pointer argument in
7958 sync_resolve_return (tree params
, tree result
)
7960 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
7961 ptype
= TYPE_MAIN_VARIANT (ptype
);
7962 return convert (ptype
, result
);
7965 /* Some builtin functions are placeholders for other expressions. This
7966 function should be called immediately after parsing the call expression
7967 before surrounding code has committed to the type of the expression.
7969 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
7970 PARAMS is the argument list for the call. The return value is non-null
7971 when expansion is complete, and null if normal processing should
7975 resolve_overloaded_builtin (tree function
, tree params
)
7977 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
7978 switch (DECL_BUILT_IN_CLASS (function
))
7980 case BUILT_IN_NORMAL
:
7983 if (targetm
.resolve_overloaded_builtin
)
7984 return targetm
.resolve_overloaded_builtin (function
, params
);
7991 /* Handle BUILT_IN_NORMAL here. */
7994 case BUILT_IN_FETCH_AND_ADD_N
:
7995 case BUILT_IN_FETCH_AND_SUB_N
:
7996 case BUILT_IN_FETCH_AND_OR_N
:
7997 case BUILT_IN_FETCH_AND_AND_N
:
7998 case BUILT_IN_FETCH_AND_XOR_N
:
7999 case BUILT_IN_FETCH_AND_NAND_N
:
8000 case BUILT_IN_ADD_AND_FETCH_N
:
8001 case BUILT_IN_SUB_AND_FETCH_N
:
8002 case BUILT_IN_OR_AND_FETCH_N
:
8003 case BUILT_IN_AND_AND_FETCH_N
:
8004 case BUILT_IN_XOR_AND_FETCH_N
:
8005 case BUILT_IN_NAND_AND_FETCH_N
:
8006 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
8007 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
8008 case BUILT_IN_LOCK_TEST_AND_SET_N
:
8009 case BUILT_IN_LOCK_RELEASE_N
:
8011 int n
= sync_resolve_size (function
, params
);
8012 tree new_function
, result
;
8015 return error_mark_node
;
8017 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
8018 if (!sync_resolve_params (function
, new_function
, params
))
8019 return error_mark_node
;
8021 result
= build_function_call (new_function
, params
);
8022 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
8023 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
8024 result
= sync_resolve_return (params
, result
);
8034 /* Ignoring their sign, return true if two scalar types are the same. */
8036 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
8038 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
8040 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
|| c1
== FIXED_POINT_TYPE
)
8041 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
8042 || c2
== FIXED_POINT_TYPE
));
8044 /* Equality works here because c_common_signed_type uses
8045 TYPE_MAIN_VARIANT. */
8046 return c_common_signed_type (t1
)
8047 == c_common_signed_type (t2
);
8050 /* Check for missing format attributes on function pointers. LTYPE is
8051 the new type or left-hand side type. RTYPE is the old type or
8052 right-hand side type. Returns TRUE if LTYPE is missing the desired
8056 check_missing_format_attribute (tree ltype
, tree rtype
)
8058 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
8061 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
8062 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
8067 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
8068 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
8076 /* Subscripting with type char is likely to lose on a machine where
8077 chars are signed. So warn on any machine, but optionally. Don't
8078 warn for unsigned char since that type is safe. Don't warn for
8079 signed char because anyone who uses that must have done so
8080 deliberately. Furthermore, we reduce the false positive load by
8081 warning only for non-constant value of type char. */
8084 warn_array_subscript_with_type_char (tree index
)
8086 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
8087 && TREE_CODE (index
) != INTEGER_CST
)
8088 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
8091 /* Implement -Wparentheses for the unexpected C precedence rules, to
8092 cover cases like x + y << z which readers are likely to
8093 misinterpret. We have seen an expression in which CODE is a binary
8094 operator used to combine expressions headed by CODE_LEFT and
8095 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
8096 means that that side of the expression was not formed using a
8097 binary operator, or it was enclosed in parentheses. */
8100 warn_about_parentheses (enum tree_code code
, enum tree_code code_left
,
8101 enum tree_code code_right
)
8103 if (!warn_parentheses
)
8106 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
8108 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
8109 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
8110 warning (OPT_Wparentheses
,
8111 "suggest parentheses around + or - inside shift");
8114 if (code
== TRUTH_ORIF_EXPR
)
8116 if (code_left
== TRUTH_ANDIF_EXPR
8117 || code_right
== TRUTH_ANDIF_EXPR
)
8118 warning (OPT_Wparentheses
,
8119 "suggest parentheses around && within ||");
8122 if (code
== BIT_IOR_EXPR
)
8124 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
8125 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
8126 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_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 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 |");
8137 if (code
== BIT_XOR_EXPR
)
8139 if (code_left
== BIT_AND_EXPR
8140 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
8141 || code_right
== BIT_AND_EXPR
8142 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
8143 warning (OPT_Wparentheses
,
8144 "suggest parentheses around arithmetic in operand of ^");
8145 /* Check cases like x^y==z */
8146 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8147 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8148 warning (OPT_Wparentheses
,
8149 "suggest parentheses around comparison in operand of ^");
8152 if (code
== BIT_AND_EXPR
)
8154 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
8155 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
8156 warning (OPT_Wparentheses
,
8157 "suggest parentheses around + or - in operand of &");
8158 /* Check cases like x&y==z */
8159 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8160 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8161 warning (OPT_Wparentheses
,
8162 "suggest parentheses around comparison in operand of &");
8165 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
8167 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
8168 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
8169 warning (OPT_Wparentheses
,
8170 "suggest parentheses around comparison in operand of %s",
8171 code
== EQ_EXPR
? "==" : "!=");
8173 else if (TREE_CODE_CLASS (code
) == tcc_comparison
)
8175 if ((TREE_CODE_CLASS (code_left
) == tcc_comparison
8176 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
)
8177 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
8178 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
))
8179 warning (OPT_Wparentheses
, "comparisons like X<=Y<=Z do not "
8180 "have their mathematical meaning");
8184 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
8187 warn_for_unused_label (tree label
)
8189 if (!TREE_USED (label
))
8191 if (DECL_INITIAL (label
))
8192 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
8194 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
8198 #ifndef TARGET_HAS_TARGETCM
8199 struct gcc_targetcm targetcm
= TARGETCM_INITIALIZER
;
8202 /* Warn for division by zero according to the value of DIVISOR. */
8205 warn_for_div_by_zero (tree divisor
)
8207 /* If DIVISOR is zero, and has integral or fixed-point type, issue a warning
8208 about division by zero. Do not issue a warning if DIVISOR has a
8209 floating-point type, since we consider 0.0/0.0 a valid way of
8210 generating a NaN. */
8211 if (skip_evaluation
== 0
8212 && (integer_zerop (divisor
) || fixed_zerop (divisor
)))
8213 warning (OPT_Wdiv_by_zero
, "division by zero");
8216 /* Subroutine of build_binary_op. Give warnings for comparisons
8217 between signed and unsigned quantities that may fail. Do the
8218 checking based on the original operand trees ORIG_OP0 and ORIG_OP1,
8219 so that casts will be considered, but default promotions won't
8222 The arguments of this function map directly to local variables
8223 of build_binary_op. */
8226 warn_for_sign_compare (tree orig_op0
, tree orig_op1
,
8228 tree result_type
, enum tree_code resultcode
)
8230 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
8231 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
8232 int unsignedp0
, unsignedp1
;
8234 /* In C++, check for comparison of different enum types. */
8236 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
8237 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
8238 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
8239 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
8241 warning (OPT_Wsign_compare
, "comparison between types %qT and %qT",
8242 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
8245 /* Do not warn if the comparison is being done in a signed type,
8246 since the signed type will only be chosen if it can represent
8247 all the values of the unsigned type. */
8248 if (!TYPE_UNSIGNED (result_type
))
8250 /* Do not warn if both operands are unsigned. */
8251 else if (op0_signed
== op1_signed
)
8259 sop
= orig_op0
, uop
= orig_op1
;
8261 sop
= orig_op1
, uop
= orig_op0
;
8263 STRIP_TYPE_NOPS (sop
);
8264 STRIP_TYPE_NOPS (uop
);
8266 /* Do not warn if the signed quantity is an unsuffixed integer
8267 literal (or some static constant expression involving such
8268 literals or a conditional expression involving such literals)
8269 and it is non-negative. */
8270 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
8272 /* Do not warn if the comparison is an equality operation, the
8273 unsigned quantity is an integral constant, and it would fit
8274 in the result if the result were signed. */
8275 else if (TREE_CODE (uop
) == INTEGER_CST
8276 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
8277 && int_fits_type_p (uop
, c_common_signed_type (result_type
)))
8279 /* In C, do not warn if the unsigned quantity is an enumeration
8280 constant and its maximum value would fit in the result if the
8281 result were signed. */
8282 else if (!c_dialect_cxx() && TREE_CODE (uop
) == INTEGER_CST
8283 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
8284 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
8285 c_common_signed_type (result_type
)))
8288 warning (OPT_Wsign_compare
,
8289 "comparison between signed and unsigned integer expressions");
8292 /* Warn if two unsigned values are being compared in a size larger
8293 than their original size, and one (and only one) is the result of
8294 a `~' operator. This comparison will always fail.
8296 Also warn if one operand is a constant, and the constant does not
8297 have all bits set that are set in the ~ operand when it is
8300 op0
= get_narrower (op0
, &unsignedp0
);
8301 op1
= get_narrower (op1
, &unsignedp1
);
8303 if ((TREE_CODE (op0
) == BIT_NOT_EXPR
)
8304 ^ (TREE_CODE (op1
) == BIT_NOT_EXPR
))
8306 if (TREE_CODE (op0
) == BIT_NOT_EXPR
)
8307 op0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
8308 if (TREE_CODE (op1
) == BIT_NOT_EXPR
)
8309 op1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
8311 if (host_integerp (op0
, 0) || host_integerp (op1
, 0))
8314 HOST_WIDE_INT constant
, mask
;
8318 if (host_integerp (op0
, 0))
8321 unsignedp
= unsignedp1
;
8322 constant
= tree_low_cst (op0
, 0);
8327 unsignedp
= unsignedp0
;
8328 constant
= tree_low_cst (op1
, 0);
8331 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
8332 if (bits
< TYPE_PRECISION (result_type
)
8333 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
8335 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
8336 if ((mask
& constant
) != mask
)
8339 warning (OPT_Wsign_compare
,
8340 "promoted ~unsigned is always non-zero");
8342 warning (OPT_Wsign_compare
,
8343 "comparison of promoted ~unsigned with constant");
8347 else if (unsignedp0
&& unsignedp1
8348 && (TYPE_PRECISION (TREE_TYPE (op0
))
8349 < TYPE_PRECISION (result_type
))
8350 && (TYPE_PRECISION (TREE_TYPE (op1
))
8351 < TYPE_PRECISION (result_type
)))
8352 warning (OPT_Wsign_compare
,
8353 "comparison of promoted ~unsigned with unsigned");
8357 #include "gt-c-common.h"