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 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 2, 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 COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
51 #include "target-def.h"
53 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
55 /* We let tm.h override the types used here, to handle trivial differences
56 such as the choice of unsigned int or long unsigned int for size_t.
57 When machines start needing nontrivial differences in the size type,
58 it would be best to do something here to figure out automatically
59 from other information what type to use. */
62 #define SIZE_TYPE "long unsigned int"
66 #define PID_TYPE "int"
70 #define WCHAR_TYPE "int"
73 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
74 #define MODIFIED_WCHAR_TYPE \
75 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
78 #define PTRDIFF_TYPE "long int"
82 #define WINT_TYPE "unsigned int"
86 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
88 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
94 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
97 ? "long unsigned int" \
98 : "long long unsigned int"))
101 /* The following symbols are subsumed in the c_global_trees array, and
102 listed here individually for documentation purposes.
104 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
106 tree short_integer_type_node;
107 tree long_integer_type_node;
108 tree long_long_integer_type_node;
110 tree short_unsigned_type_node;
111 tree long_unsigned_type_node;
112 tree long_long_unsigned_type_node;
114 tree truthvalue_type_node;
115 tree truthvalue_false_node;
116 tree truthvalue_true_node;
118 tree ptrdiff_type_node;
120 tree unsigned_char_type_node;
121 tree signed_char_type_node;
122 tree wchar_type_node;
123 tree signed_wchar_type_node;
124 tree unsigned_wchar_type_node;
126 tree float_type_node;
127 tree double_type_node;
128 tree long_double_type_node;
130 tree complex_integer_type_node;
131 tree complex_float_type_node;
132 tree complex_double_type_node;
133 tree complex_long_double_type_node;
135 tree dfloat32_type_node;
136 tree dfloat64_type_node;
137 tree_dfloat128_type_node;
139 tree intQI_type_node;
140 tree intHI_type_node;
141 tree intSI_type_node;
142 tree intDI_type_node;
143 tree intTI_type_node;
145 tree unsigned_intQI_type_node;
146 tree unsigned_intHI_type_node;
147 tree unsigned_intSI_type_node;
148 tree unsigned_intDI_type_node;
149 tree unsigned_intTI_type_node;
151 tree widest_integer_literal_type_node;
152 tree widest_unsigned_literal_type_node;
154 Nodes for types `void *' and `const void *'.
156 tree ptr_type_node, const_ptr_type_node;
158 Nodes for types `char *' and `const char *'.
160 tree string_type_node, const_string_type_node;
162 Type `char[SOMENUMBER]'.
163 Used when an array of char is needed and the size is irrelevant.
165 tree char_array_type_node;
167 Type `int[SOMENUMBER]' or something like it.
168 Used when an array of int needed and the size is irrelevant.
170 tree int_array_type_node;
172 Type `wchar_t[SOMENUMBER]' or something like it.
173 Used when a wide string literal is created.
175 tree wchar_array_type_node;
177 Type `int ()' -- used for implicit declaration of functions.
179 tree default_function_type;
181 A VOID_TYPE node, packaged in a TREE_LIST.
185 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
186 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
187 VAR_DECLS, but C++ does.)
189 tree function_name_decl_node;
190 tree pretty_function_name_decl_node;
191 tree c99_function_name_decl_node;
193 Stack of nested function name VAR_DECLs.
195 tree saved_function_name_decls;
199 tree c_global_trees
[CTI_MAX
];
201 /* Switches common to the C front ends. */
203 /* Nonzero if prepreprocessing only. */
205 int flag_preprocess_only
;
207 /* Nonzero means don't output line number information. */
209 char flag_no_line_commands
;
211 /* Nonzero causes -E output not to be done, but directives such as
212 #define that have side effects are still obeyed. */
216 /* Nonzero means dump macros in some fashion. */
218 char flag_dump_macros
;
220 /* Nonzero means pass #include lines through to the output. */
222 char flag_dump_includes
;
224 /* Nonzero means process PCH files while preprocessing. */
226 bool flag_pch_preprocess
;
228 /* The file name to which we should write a precompiled header, or
229 NULL if no header will be written in this compile. */
231 const char *pch_file
;
233 /* Nonzero if an ISO standard was selected. It rejects macros in the
237 /* Nonzero if -undef was given. It suppresses target built-in macros
241 /* Nonzero means don't recognize the non-ANSI builtin functions. */
245 /* Nonzero means don't recognize the non-ANSI builtin functions.
248 int flag_no_nonansi_builtin
;
250 /* Nonzero means give `double' the same size as `float'. */
252 int flag_short_double
;
254 /* Nonzero means give `wchar_t' the same size as `short'. */
256 int flag_short_wchar
;
258 /* Nonzero means allow implicit conversions between vectors with
259 differing numbers of subparts and/or differing element types. */
260 int flag_lax_vector_conversions
;
262 /* Nonzero means allow Microsoft extensions without warnings or errors. */
263 int flag_ms_extensions
;
265 /* Nonzero means don't recognize the keyword `asm'. */
269 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
271 int flag_signed_bitfields
= 1;
273 /* Warn about #pragma directives that are not recognized. */
275 int warn_unknown_pragmas
; /* Tri state variable. */
277 /* Warn about format/argument anomalies in calls to formatted I/O functions
278 (*printf, *scanf, strftime, strfmon, etc.). */
282 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
283 with GCC this doesn't matter as __null is guaranteed to have the right
286 int warn_strict_null_sentinel
;
288 /* Zero means that faster, ...NonNil variants of objc_msgSend...
289 calls will be used in ObjC; passing nil receivers to such calls
290 will most likely result in crashes. */
291 int flag_nil_receivers
= 1;
293 /* Nonzero means that code generation will be altered to support
294 "zero-link" execution. This currently affects ObjC only, but may
295 affect other languages in the future. */
296 int flag_zero_link
= 0;
298 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
299 unit. It will inform the ObjC runtime that class definition(s) herein
300 contained are to replace one(s) previously loaded. */
301 int flag_replace_objc_classes
= 0;
303 /* C/ObjC language option variables. */
306 /* Nonzero means allow type mismatches in conditional expressions;
307 just make their values `void'. */
309 int flag_cond_mismatch
;
311 /* Nonzero means enable C89 Amendment 1 features. */
315 /* Nonzero means use the ISO C99 dialect of C. */
319 /* Nonzero means that we have builtin functions, and main is an int. */
323 /* Warn if main is suspicious. */
328 /* ObjC language option variables. */
331 /* Open and close the file for outputting class declarations, if
334 int flag_gen_declaration
;
336 /* Tells the compiler that this is a special run. Do not perform any
337 compiling, instead we are to test some platform dependent features
338 and output a C header file with appropriate definitions. */
340 int print_struct_values
;
342 /* Tells the compiler what is the constant string class for Objc. */
344 const char *constant_string_class_name
;
347 /* C++ language option variables. */
350 /* Nonzero means don't recognize any extension keywords. */
352 int flag_no_gnu_keywords
;
354 /* Nonzero means do emit exported implementations of functions even if
355 they can be inlined. */
357 int flag_implement_inlines
= 1;
359 /* Nonzero means that implicit instantiations will be emitted if needed. */
361 int flag_implicit_templates
= 1;
363 /* Nonzero means that implicit instantiations of inline templates will be
364 emitted if needed, even if instantiations of non-inline templates
367 int flag_implicit_inline_templates
= 1;
369 /* Nonzero means generate separate instantiation control files and
370 juggle them at link time. */
372 int flag_use_repository
;
374 /* Nonzero if we want to issue diagnostics that the standard says are not
377 int flag_optional_diags
= 1;
379 /* Nonzero means we should attempt to elide constructors when possible. */
381 int flag_elide_constructors
= 1;
383 /* Nonzero means that member functions defined in class scope are
384 inline by default. */
386 int flag_default_inline
= 1;
388 /* Controls whether compiler generates 'type descriptor' that give
389 run-time type information. */
393 /* Nonzero if we want to conserve space in the .o files. We do this
394 by putting uninitialized data and runtime initialized data into
395 .common instead of .data at the expense of not flagging multiple
398 int flag_conserve_space
;
400 /* Nonzero if we want to obey access control semantics. */
402 int flag_access_control
= 1;
404 /* Nonzero if we want to check the return value of new and avoid calling
405 constructors if it is a null pointer. */
409 /* The C++ dialect being used. C++98 is the default. */
411 enum cxx_dialect cxx_dialect
= cxx98
;
413 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
414 initialization variables.
415 0: Old rules, set by -fno-for-scope.
416 2: New ISO rules, set by -ffor-scope.
417 1: Try to implement new ISO rules, but with backup compatibility
418 (and warnings). This is the default, for now. */
420 int flag_new_for_scope
= 1;
422 /* Nonzero if we want to emit defined symbols with common-like linkage as
423 weak symbols where possible, in order to conform to C++ semantics.
424 Otherwise, emit them as local symbols. */
428 /* 0 means we want the preprocessor to not emit line directives for
429 the current working directory. 1 means we want it to do it. -1
430 means we should decide depending on whether debugging information
431 is being emitted or not. */
433 int flag_working_directory
= -1;
435 /* Nonzero to use __cxa_atexit, rather than atexit, to register
436 destructors for local statics and global objects. '2' means it has been
437 set nonzero as a default, not by a command-line flag. */
439 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
441 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
442 code. '2' means it has not been set explicitly on the command line. */
444 int flag_use_cxa_get_exception_ptr
= 2;
446 /* Nonzero means make the default pedwarns warnings instead of errors.
447 The value of this flag is ignored if -pedantic is specified. */
451 /* Nonzero means to implement standard semantics for exception
452 specifications, calling unexpected if an exception is thrown that
453 doesn't match the specification. Zero means to treat them as
454 assertions and optimize accordingly, but not check them. */
456 int flag_enforce_eh_specs
= 1;
458 /* Nonzero means to generate thread-safe code for initializing local
461 int flag_threadsafe_statics
= 1;
463 /* Nonzero means warn about implicit declarations. */
465 int warn_implicit
= 1;
467 /* Maximum template instantiation depth. This limit is rather
468 arbitrary, but it exists to limit the time it takes to notice
469 infinite template instantiations. */
471 int max_tinst_depth
= 500;
475 /* The elements of `ridpointers' are identifier nodes for the reserved
476 type names and storage classes. It is indexed by a RID_... value. */
479 tree (*make_fname_decl
) (tree
, int);
481 /* Nonzero means the expression being parsed will never be evaluated.
482 This is a count, since unevaluated expressions can nest. */
485 /* Information about how a function name is generated. */
488 tree
*const decl
; /* pointer to the VAR_DECL. */
489 const unsigned rid
; /* RID number for the identifier. */
490 const int pretty
; /* How pretty is it? */
493 /* The three ways of getting then name of the current function. */
495 const struct fname_var_t fname_vars
[] =
497 /* C99 compliant __func__, must be first. */
498 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
499 /* GCC __FUNCTION__ compliant. */
500 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
501 /* GCC __PRETTY_FUNCTION__ compliant. */
502 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
506 static tree
check_case_value (tree
);
507 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
509 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
510 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
511 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
512 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
513 static tree
handle_hot_attribute (tree
*, tree
, tree
, int, bool *);
514 static tree
handle_cold_attribute (tree
*, tree
, tree
, int, bool *);
515 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
516 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
518 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int,
520 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
521 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
522 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
523 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
525 static tree
handle_const_attribute (tree
*, tree
, tree
, int, bool *);
526 static tree
handle_transparent_union_attribute (tree
*, tree
, tree
,
528 static tree
handle_constructor_attribute (tree
*, tree
, tree
, int, bool *);
529 static tree
handle_destructor_attribute (tree
*, tree
, tree
, int, bool *);
530 static tree
handle_mode_attribute (tree
*, tree
, tree
, int, bool *);
531 static tree
handle_section_attribute (tree
*, tree
, tree
, int, bool *);
532 static tree
handle_aligned_attribute (tree
*, tree
, tree
, int, bool *);
533 static tree
handle_weak_attribute (tree
*, tree
, tree
, int, bool *) ;
534 static tree
handle_alias_attribute (tree
*, tree
, tree
, int, bool *);
535 static tree
handle_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
536 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
538 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
540 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
542 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
543 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
544 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
546 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
547 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
548 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
550 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
552 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
553 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
554 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
555 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
557 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
558 static tree
handle_alloc_size_attribute (tree
*, tree
, tree
, int, bool *);
560 static void check_function_nonnull (tree
, int, tree
*);
561 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
562 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
563 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
564 static int resort_field_decl_cmp (const void *, const void *);
566 /* Table of machine-independent attributes common to all C-like languages. */
567 const struct attribute_spec c_common_attribute_table
[] =
569 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
570 { "packed", 0, 0, false, false, false,
571 handle_packed_attribute
},
572 { "nocommon", 0, 0, true, false, false,
573 handle_nocommon_attribute
},
574 { "common", 0, 0, true, false, false,
575 handle_common_attribute
},
576 /* FIXME: logically, noreturn attributes should be listed as
577 "false, true, true" and apply to function types. But implementing this
578 would require all the places in the compiler that use TREE_THIS_VOLATILE
579 on a decl to identify non-returning functions to be located and fixed
580 to check the function type instead. */
581 { "noreturn", 0, 0, true, false, false,
582 handle_noreturn_attribute
},
583 { "volatile", 0, 0, true, false, false,
584 handle_noreturn_attribute
},
585 { "noinline", 0, 0, true, false, false,
586 handle_noinline_attribute
},
587 { "always_inline", 0, 0, true, false, false,
588 handle_always_inline_attribute
},
589 { "gnu_inline", 0, 0, true, false, false,
590 handle_gnu_inline_attribute
},
591 { "flatten", 0, 0, true, false, false,
592 handle_flatten_attribute
},
593 { "used", 0, 0, true, false, false,
594 handle_used_attribute
},
595 { "unused", 0, 0, false, false, false,
596 handle_unused_attribute
},
597 { "externally_visible", 0, 0, true, false, false,
598 handle_externally_visible_attribute
},
599 /* The same comments as for noreturn attributes apply to const ones. */
600 { "const", 0, 0, true, false, false,
601 handle_const_attribute
},
602 { "transparent_union", 0, 0, false, false, false,
603 handle_transparent_union_attribute
},
604 { "constructor", 0, 1, true, false, false,
605 handle_constructor_attribute
},
606 { "destructor", 0, 1, true, false, false,
607 handle_destructor_attribute
},
608 { "mode", 1, 1, false, true, false,
609 handle_mode_attribute
},
610 { "section", 1, 1, true, false, false,
611 handle_section_attribute
},
612 { "aligned", 0, 1, false, false, false,
613 handle_aligned_attribute
},
614 { "weak", 0, 0, true, false, false,
615 handle_weak_attribute
},
616 { "alias", 1, 1, true, false, false,
617 handle_alias_attribute
},
618 { "weakref", 0, 1, true, false, false,
619 handle_weakref_attribute
},
620 { "no_instrument_function", 0, 0, true, false, false,
621 handle_no_instrument_function_attribute
},
622 { "malloc", 0, 0, true, false, false,
623 handle_malloc_attribute
},
624 { "returns_twice", 0, 0, true, false, false,
625 handle_returns_twice_attribute
},
626 { "no_stack_limit", 0, 0, true, false, false,
627 handle_no_limit_stack_attribute
},
628 { "pure", 0, 0, true, false, false,
629 handle_pure_attribute
},
630 /* For internal use (marking of builtins) only. The name contains space
631 to prevent its usage in source code. */
632 { "no vops", 0, 0, true, false, false,
633 handle_novops_attribute
},
634 { "deprecated", 0, 0, false, false, false,
635 handle_deprecated_attribute
},
636 { "vector_size", 1, 1, false, true, false,
637 handle_vector_size_attribute
},
638 { "visibility", 1, 1, false, false, false,
639 handle_visibility_attribute
},
640 { "tls_model", 1, 1, true, false, false,
641 handle_tls_model_attribute
},
642 { "nonnull", 0, -1, false, true, true,
643 handle_nonnull_attribute
},
644 { "nothrow", 0, 0, true, false, false,
645 handle_nothrow_attribute
},
646 { "may_alias", 0, 0, false, true, false, NULL
},
647 { "cleanup", 1, 1, true, false, false,
648 handle_cleanup_attribute
},
649 { "warn_unused_result", 0, 0, false, true, true,
650 handle_warn_unused_result_attribute
},
651 { "sentinel", 0, 1, false, true, true,
652 handle_sentinel_attribute
},
653 { "alloc_size", 1, 2, false, true, true,
654 handle_alloc_size_attribute
},
655 { "cold", 0, 0, true, false, false,
656 handle_cold_attribute
},
657 { "hot", 0, 0, true, false, false,
658 handle_hot_attribute
},
659 { NULL
, 0, 0, false, false, false, NULL
}
662 /* Give the specifications for the format attributes, used by C and all
665 const struct attribute_spec c_common_format_attribute_table
[] =
667 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
668 { "format", 3, 3, false, true, true,
669 handle_format_attribute
},
670 { "format_arg", 1, 1, false, true, true,
671 handle_format_arg_attribute
},
672 { NULL
, 0, 0, false, false, false, NULL
}
675 /* Push current bindings for the function name VAR_DECLS. */
678 start_fname_decls (void)
681 tree saved
= NULL_TREE
;
683 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
685 tree decl
= *fname_vars
[ix
].decl
;
689 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
690 *fname_vars
[ix
].decl
= NULL_TREE
;
693 if (saved
|| saved_function_name_decls
)
694 /* Normally they'll have been NULL, so only push if we've got a
695 stack, or they are non-NULL. */
696 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
697 saved_function_name_decls
);
700 /* Finish up the current bindings, adding them into the current function's
701 statement tree. This must be done _before_ finish_stmt_tree is called.
702 If there is no current function, we must be at file scope and no statements
703 are involved. Pop the previous bindings. */
706 finish_fname_decls (void)
709 tree stmts
= NULL_TREE
;
710 tree stack
= saved_function_name_decls
;
712 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
713 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
717 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
719 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
720 bodyp
= &BIND_EXPR_BODY (*bodyp
);
722 append_to_statement_list_force (*bodyp
, &stmts
);
726 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
727 *fname_vars
[ix
].decl
= NULL_TREE
;
731 /* We had saved values, restore them. */
734 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
736 tree decl
= TREE_PURPOSE (saved
);
737 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
739 *fname_vars
[ix
].decl
= decl
;
741 stack
= TREE_CHAIN (stack
);
743 saved_function_name_decls
= stack
;
746 /* Return the text name of the current function, suitably prettified
747 by PRETTY_P. Return string must be freed by caller. */
750 fname_as_string (int pretty_p
)
752 const char *name
= "top level";
762 if (current_function_decl
)
763 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
765 if (c_lex_string_translate
)
767 int len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
768 cpp_string cstr
= { 0, 0 }, strname
;
770 namep
= XNEWVEC (char, len
);
771 snprintf (namep
, len
, "\"%s\"", name
);
772 strname
.text
= (unsigned char *) namep
;
773 strname
.len
= len
- 1;
775 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, false))
778 return (char *) cstr
.text
;
782 namep
= xstrdup (name
);
787 /* Expand DECL if it declares an entity not handled by the
791 c_expand_decl (tree decl
)
793 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
795 /* Let the back-end know about this variable. */
796 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
797 emit_local_var (decl
);
799 expand_anon_union_decl (decl
, NULL_TREE
,
800 DECL_ANON_UNION_ELEMS (decl
));
809 /* Return the VAR_DECL for a const char array naming the current
810 function. If the VAR_DECL has not yet been created, create it
811 now. RID indicates how it should be formatted and IDENTIFIER_NODE
812 ID is its name (unfortunately C and C++ hold the RID values of
813 keywords in different places, so we can't derive RID from ID in
814 this language independent code. */
817 fname_decl (unsigned int rid
, tree id
)
820 tree decl
= NULL_TREE
;
822 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
823 if (fname_vars
[ix
].rid
== rid
)
826 decl
= *fname_vars
[ix
].decl
;
829 /* If a tree is built here, it would normally have the lineno of
830 the current statement. Later this tree will be moved to the
831 beginning of the function and this line number will be wrong.
832 To avoid this problem set the lineno to 0 here; that prevents
833 it from appearing in the RTL. */
835 location_t saved_location
= input_location
;
836 #ifdef USE_MAPPED_LOCATION
837 input_location
= UNKNOWN_LOCATION
;
842 stmts
= push_stmt_list ();
843 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
844 stmts
= pop_stmt_list (stmts
);
845 if (!IS_EMPTY_STMT (stmts
))
846 saved_function_name_decls
847 = tree_cons (decl
, stmts
, saved_function_name_decls
);
848 *fname_vars
[ix
].decl
= decl
;
849 input_location
= saved_location
;
851 if (!ix
&& !current_function_decl
)
852 pedwarn ("%qD is not defined outside of function scope", decl
);
857 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
860 fix_string_type (tree value
)
862 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
863 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
864 int length
= TREE_STRING_LENGTH (value
);
866 tree e_type
, i_type
, a_type
;
868 /* Compute the number of elements, for the array type. */
869 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
871 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
872 limit in C++98 Annex B is very large (65536) and is not normative,
873 so we do not diagnose it (warn_overlength_strings is forced off
874 in c_common_post_options). */
875 if (warn_overlength_strings
)
877 const int nchars_max
= flag_isoc99
? 4095 : 509;
878 const int relevant_std
= flag_isoc99
? 99 : 90;
879 if (nchars
- 1 > nchars_max
)
880 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
881 separate the %d from the 'C'. 'ISO' should not be
882 translated, but it may be moved after 'C%d' in languages
883 where modifiers follow nouns. */
884 pedwarn ("string length %qd is greater than the length %qd "
885 "ISO C%d compilers are required to support",
886 nchars
- 1, nchars_max
, relevant_std
);
889 /* Create the array type for the string constant. The ISO C++
890 standard says that a string literal has type `const char[N]' or
891 `const wchar_t[N]'. We use the same logic when invoked as a C
892 front-end with -Wwrite-strings.
893 ??? We should change the type of an expression depending on the
894 state of a warning flag. We should just be warning -- see how
895 this is handled in the C++ front-end for the deprecated implicit
896 conversion from string literals to `char*' or `wchar_t*'.
898 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
899 array type being the unqualified version of that type.
900 Therefore, if we are constructing an array of const char, we must
901 construct the matching unqualified array type first. The C front
902 end does not require this, but it does no harm, so we do it
904 e_type
= wide_flag
? wchar_type_node
: char_type_node
;
905 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
906 a_type
= build_array_type (e_type
, i_type
);
907 if (c_dialect_cxx() || warn_write_strings
)
908 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
910 TREE_TYPE (value
) = a_type
;
911 TREE_CONSTANT (value
) = 1;
912 TREE_INVARIANT (value
) = 1;
913 TREE_READONLY (value
) = 1;
914 TREE_STATIC (value
) = 1;
918 /* Print a warning if a constant expression had overflow in folding.
919 Invoke this function on every expression that the language
920 requires to be a constant expression.
921 Note the ANSI C standard says it is erroneous for a
922 constant expression to overflow. */
925 constant_expression_warning (tree value
)
927 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
928 || TREE_CODE (value
) == VECTOR_CST
929 || TREE_CODE (value
) == COMPLEX_CST
)
930 && TREE_OVERFLOW (value
)
933 pedwarn ("overflow in constant expression");
936 /* Print a warning if an expression had overflow in folding and its
939 Invoke this function on every expression that
940 (1) appears in the source code, and
941 (2) is a constant expression that overflowed, and
942 (3) is not already checked by convert_and_check;
943 however, do not invoke this function on operands of explicit casts
944 or when the expression is the result of an operator and any operand
945 already overflowed. */
948 overflow_warning (tree value
)
950 if (skip_evaluation
) return;
952 switch (TREE_CODE (value
))
955 warning (OPT_Woverflow
, "integer overflow in expression");
959 warning (OPT_Woverflow
, "floating point overflow in expression");
963 warning (OPT_Woverflow
, "vector overflow in expression");
967 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
968 warning (OPT_Woverflow
, "complex integer overflow in expression");
969 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
970 warning (OPT_Woverflow
, "complex floating point overflow in expression");
979 /* Warn about use of a logical || / && operator being used in a
980 context where it is likely that the bitwise equivalent was intended
981 by the programmer. CODE is the TREE_CODE of the operator, ARG1
982 and ARG2 the arguments. */
985 warn_logical_operator (enum tree_code code
, tree arg1
, tree
990 case TRUTH_ANDIF_EXPR
:
991 case TRUTH_ORIF_EXPR
:
994 if (!TREE_NO_WARNING (arg1
)
995 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
996 && !CONSTANT_CLASS_P (arg1
)
997 && TREE_CODE (arg2
) == INTEGER_CST
998 && !integer_zerop (arg2
))
1000 warning (OPT_Wlogical_op
,
1001 "logical %<%s%> with non-zero constant "
1002 "will always evaluate as true",
1003 ((code
== TRUTH_ANDIF_EXPR
)
1004 || (code
== TRUTH_AND_EXPR
)) ? "&&" : "||");
1005 TREE_NO_WARNING (arg1
) = true;
1014 /* Print a warning about casts that might indicate violation
1015 of strict aliasing rules if -Wstrict-aliasing is used and
1016 strict aliasing mode is in effect. OTYPE is the original
1017 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1020 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
1022 if (!(flag_strict_aliasing
&& POINTER_TYPE_P (type
)
1023 && POINTER_TYPE_P (otype
) && !VOID_TYPE_P (TREE_TYPE (type
))))
1026 if ((warn_strict_aliasing
> 1) && TREE_CODE (expr
) == ADDR_EXPR
1027 && (DECL_P (TREE_OPERAND (expr
, 0))
1028 || handled_component_p (TREE_OPERAND (expr
, 0))))
1030 /* Casting the address of an object to non void pointer. Warn
1031 if the cast breaks type based aliasing. */
1032 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)) && warn_strict_aliasing
== 2)
1034 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
1035 "might break strict-aliasing rules");
1040 /* warn_strict_aliasing >= 3. This includes the default (3).
1041 Only warn if the cast is dereferenced immediately. */
1042 HOST_WIDE_INT set1
=
1043 get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
1044 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
1046 if (!alias_sets_conflict_p (set1
, set2
))
1048 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1049 "pointer will break strict-aliasing rules");
1052 else if (warn_strict_aliasing
== 2
1053 && !alias_sets_might_conflict_p (set1
, set2
))
1055 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1056 "pointer might break strict-aliasing rules");
1062 if ((warn_strict_aliasing
== 1) && !VOID_TYPE_P (TREE_TYPE (otype
)))
1064 /* At this level, warn for any conversions, even if an address is
1065 not taken in the same statement. This will likely produce many
1066 false positives, but could be useful to pinpoint problems that
1067 are not revealed at higher levels. */
1068 HOST_WIDE_INT set1
= get_alias_set (TREE_TYPE (otype
));
1069 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
1070 if (!COMPLETE_TYPE_P(type
)
1071 || !alias_sets_might_conflict_p (set1
, set2
))
1073 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1074 "pointer might break strict-aliasing rules");
1082 /* Print a warning about if (); or if () .. else; constructs
1083 via the special empty statement node that we create. INNER_THEN
1084 and INNER_ELSE are the statement lists of the if and the else
1088 empty_if_body_warning (tree inner_then
, tree inner_else
)
1090 if (TREE_CODE (inner_then
) == STATEMENT_LIST
1091 && STATEMENT_LIST_TAIL (inner_then
))
1092 inner_then
= STATEMENT_LIST_TAIL (inner_then
)->stmt
;
1094 if (inner_else
&& TREE_CODE (inner_else
) == STATEMENT_LIST
1095 && STATEMENT_LIST_TAIL (inner_else
))
1096 inner_else
= STATEMENT_LIST_TAIL (inner_else
)->stmt
;
1098 if (IS_EMPTY_STMT (inner_then
) && !inner_else
)
1099 warning (OPT_Wempty_body
, "%Hsuggest braces around empty body "
1100 "in an %<if%> statement", EXPR_LOCUS (inner_then
));
1102 else if (inner_else
&& IS_EMPTY_STMT (inner_else
))
1103 warning (OPT_Wempty_body
, "%Hsuggest braces around empty body "
1104 "in an %<else%> statement", EXPR_LOCUS (inner_else
));
1107 /* Warn for unlikely, improbable, or stupid DECL declarations
1111 check_main_parameter_types (tree decl
)
1116 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1117 args
= TREE_CHAIN (args
))
1119 tree type
= args
? TREE_VALUE (args
) : 0;
1121 if (type
== void_type_node
|| type
== error_mark_node
)
1128 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1129 pedwarn ("first argument of %q+D should be %<int%>", decl
);
1133 if (TREE_CODE (type
) != POINTER_TYPE
1134 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1135 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1137 pedwarn ("second argument of %q+D should be %<char **%>",
1142 if (TREE_CODE (type
) != POINTER_TYPE
1143 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1144 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1146 pedwarn ("third argument of %q+D should probably be "
1147 "%<char **%>", decl
);
1152 /* It is intentional that this message does not mention the third
1153 argument because it's only mentioned in an appendix of the
1155 if (argct
> 0 && (argct
< 2 || argct
> 3))
1156 pedwarn ("%q+D takes only zero or two arguments", decl
);
1159 /* True if vector types T1 and T2 can be converted to each other
1160 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1161 can only be converted with -flax-vector-conversions yet that is not
1162 in effect, emit a note telling the user about that option if such
1163 a note has not previously been emitted. */
1165 vector_types_convertible_p (tree t1
, tree t2
, bool emit_lax_note
)
1167 static bool emitted_lax_note
= false;
1168 bool convertible_lax
;
1170 if ((targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1171 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1175 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1176 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1177 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1178 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1179 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1181 if (!convertible_lax
|| flag_lax_vector_conversions
)
1182 return convertible_lax
;
1184 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1185 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1188 if (emit_lax_note
&& !emitted_lax_note
)
1190 emitted_lax_note
= true;
1191 inform ("use -flax-vector-conversions to permit "
1192 "conversions between vectors with differing "
1193 "element types or numbers of subparts");
1199 /* Warns if the conversion of EXPR to TYPE may alter a value.
1200 This is a helper function for warnings_for_convert_and_check. */
1203 conversion_warning (tree type
, tree expr
)
1205 bool give_warning
= false;
1207 unsigned int formal_prec
= TYPE_PRECISION (type
);
1209 if (!warn_conversion
&& !warn_sign_conversion
)
1212 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1214 /* Warn for real constant that is not an exact integer converted
1216 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1217 && TREE_CODE (type
) == INTEGER_TYPE
)
1219 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (TREE_TYPE (expr
))))
1220 give_warning
= true;
1222 /* Warn for an integer constant that does not fit into integer type. */
1223 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1224 && TREE_CODE (type
) == INTEGER_TYPE
1225 && !int_fits_type_p (expr
, type
))
1227 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (TREE_TYPE (expr
)))
1228 warning (OPT_Wsign_conversion
,
1229 "negative integer implicitly converted to unsigned type");
1230 else if (!TYPE_UNSIGNED (type
) && TYPE_UNSIGNED (TREE_TYPE (expr
)))
1231 warning (OPT_Wsign_conversion
,
1232 "conversion of unsigned constant value to negative integer");
1234 give_warning
= true;
1236 else if (TREE_CODE (type
) == REAL_TYPE
)
1238 /* Warn for an integer constant that does not fit into real type. */
1239 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
)
1241 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1242 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1243 give_warning
= true;
1245 /* Warn for a real constant that does not fit into a smaller
1247 else if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1248 && formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1250 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1251 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1252 give_warning
= true;
1257 warning (OPT_Wconversion
,
1258 "conversion to %qT alters %qT constant value",
1259 type
, TREE_TYPE (expr
));
1261 else /* 'expr' is not a constant. */
1263 /* Warn for real types converted to integer types. */
1264 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1265 && TREE_CODE (type
) == INTEGER_TYPE
)
1266 give_warning
= true;
1268 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1269 && TREE_CODE (type
) == INTEGER_TYPE
)
1271 /* Warn for integer types converted to smaller integer types. */
1272 if (formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1273 give_warning
= true;
1275 /* When they are the same width but different signedness,
1276 then the value may change. */
1277 else if ((formal_prec
== TYPE_PRECISION (TREE_TYPE (expr
))
1278 && TYPE_UNSIGNED (TREE_TYPE (expr
)) != TYPE_UNSIGNED (type
))
1279 /* Even when converted to a bigger type, if the type is
1280 unsigned but expr is signed, then negative values
1282 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (TREE_TYPE (expr
))))
1283 warning (OPT_Wsign_conversion
,
1284 "conversion to %qT from %qT may change the sign of the result",
1285 type
, TREE_TYPE (expr
));
1288 /* Warn for integer types converted to real types if and only if
1289 all the range of values of the integer type cannot be
1290 represented by the real type. */
1291 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1292 && TREE_CODE (type
) == REAL_TYPE
)
1294 tree type_low_bound
= TYPE_MIN_VALUE (TREE_TYPE (expr
));
1295 tree type_high_bound
= TYPE_MAX_VALUE (TREE_TYPE (expr
));
1296 REAL_VALUE_TYPE real_low_bound
= real_value_from_int_cst (0, type_low_bound
);
1297 REAL_VALUE_TYPE real_high_bound
= real_value_from_int_cst (0, type_high_bound
);
1299 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
1300 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
1301 give_warning
= true;
1304 /* Warn for real types converted to smaller real types. */
1305 else if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1306 && TREE_CODE (type
) == REAL_TYPE
1307 && formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1308 give_warning
= true;
1312 warning (OPT_Wconversion
,
1313 "conversion to %qT from %qT may alter its value",
1314 type
, TREE_TYPE (expr
));
1318 /* Produce warnings after a conversion. RESULT is the result of
1319 converting EXPR to TYPE. This is a helper function for
1320 convert_and_check and cp_convert_and_check. */
1323 warnings_for_convert_and_check (tree type
, tree expr
, tree result
)
1325 if (TREE_CODE (expr
) == INTEGER_CST
1326 && (TREE_CODE (type
) == INTEGER_TYPE
1327 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1328 && !int_fits_type_p (expr
, type
))
1330 /* Do not diagnose overflow in a constant expression merely
1331 because a conversion overflowed. */
1332 if (TREE_OVERFLOW (result
))
1333 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
1335 if (TYPE_UNSIGNED (type
))
1337 /* This detects cases like converting -129 or 256 to
1339 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
1340 warning (OPT_Woverflow
,
1341 "large integer implicitly truncated to unsigned type");
1343 conversion_warning (type
, expr
);
1345 else if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
1346 warning (OPT_Woverflow
,
1347 "overflow in implicit constant conversion");
1348 /* No warning for converting 0x80000000 to int. */
1350 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
1351 || TYPE_PRECISION (TREE_TYPE (expr
))
1352 != TYPE_PRECISION (type
)))
1353 warning (OPT_Woverflow
,
1354 "overflow in implicit constant conversion");
1357 conversion_warning (type
, expr
);
1359 else if (TREE_CODE (result
) == INTEGER_CST
&& TREE_OVERFLOW (result
))
1360 warning (OPT_Woverflow
,
1361 "overflow in implicit constant conversion");
1363 conversion_warning (type
, expr
);
1367 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1368 Invoke this function on every expression that is converted implicitly,
1369 i.e. because of language rules and not because of an explicit cast. */
1372 convert_and_check (tree type
, tree expr
)
1376 if (TREE_TYPE (expr
) == type
)
1379 result
= convert (type
, expr
);
1381 if (!skip_evaluation
&& !TREE_OVERFLOW_P (expr
) && result
!= error_mark_node
)
1382 warnings_for_convert_and_check (type
, expr
, result
);
1387 /* A node in a list that describes references to variables (EXPR), which are
1388 either read accesses if WRITER is zero, or write accesses, in which case
1389 WRITER is the parent of EXPR. */
1396 /* Used to implement a cache the results of a call to verify_tree. We only
1397 use this for SAVE_EXPRs. */
1400 struct tlist_cache
*next
;
1401 struct tlist
*cache_before_sp
;
1402 struct tlist
*cache_after_sp
;
1406 /* Obstack to use when allocating tlist structures, and corresponding
1408 static struct obstack tlist_obstack
;
1409 static char *tlist_firstobj
= 0;
1411 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1413 static struct tlist
*warned_ids
;
1414 /* SAVE_EXPRs need special treatment. We process them only once and then
1415 cache the results. */
1416 static struct tlist_cache
*save_expr_cache
;
1418 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1419 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1420 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1421 static int warning_candidate_p (tree
);
1422 static void warn_for_collisions (struct tlist
*);
1423 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1424 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1426 /* Create a new struct tlist and fill in its fields. */
1427 static struct tlist
*
1428 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1431 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1438 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1439 is nonnull, we ignore any node we find which has a writer equal to it. */
1442 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1446 struct tlist
*next
= add
->next
;
1449 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1450 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1455 /* Merge the nodes of ADD into TO. This merging process is done so that for
1456 each variable that already exists in TO, no new node is added; however if
1457 there is a write access recorded in ADD, and an occurrence on TO is only
1458 a read access, then the occurrence in TO will be modified to record the
1462 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1464 struct tlist
**end
= to
;
1467 end
= &(*end
)->next
;
1473 struct tlist
*next
= add
->next
;
1475 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1476 if (tmp2
->expr
== add
->expr
)
1480 tmp2
->writer
= add
->writer
;
1484 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1485 end
= &(*end
)->next
;
1492 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1493 references in list LIST conflict with it, excluding reads if ONLY writers
1497 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1502 /* Avoid duplicate warnings. */
1503 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1504 if (tmp
->expr
== written
)
1509 if (list
->expr
== written
1510 && list
->writer
!= writer
1511 && (!only_writes
|| list
->writer
)
1512 && DECL_NAME (list
->expr
))
1514 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1515 warning (0, "operation on %qE may be undefined", list
->expr
);
1521 /* Given a list LIST of references to variables, find whether any of these
1522 can cause conflicts due to missing sequence points. */
1525 warn_for_collisions (struct tlist
*list
)
1529 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1532 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1536 /* Return nonzero if X is a tree that can be verified by the sequence point
1539 warning_candidate_p (tree x
)
1541 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1544 /* Walk the tree X, and record accesses to variables. If X is written by the
1545 parent tree, WRITER is the parent.
1546 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1547 expression or its only operand forces a sequence point, then everything up
1548 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1550 Once we return, we will have emitted warnings if any subexpression before
1551 such a sequence point could be undefined. On a higher level, however, the
1552 sequence point may not be relevant, and we'll merge the two lists.
1554 Example: (b++, a) + b;
1555 The call that processes the COMPOUND_EXPR will store the increment of B
1556 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1557 processes the PLUS_EXPR will need to merge the two lists so that
1558 eventually, all accesses end up on the same list (and we'll warn about the
1559 unordered subexpressions b++ and b.
1561 A note on merging. If we modify the former example so that our expression
1564 care must be taken not simply to add all three expressions into the final
1565 PNO_SP list. The function merge_tlist takes care of that by merging the
1566 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1567 way, so that no more than one access to B is recorded. */
1570 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1573 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1574 enum tree_code code
;
1575 enum tree_code_class cl
;
1577 /* X may be NULL if it is the operand of an empty statement expression
1583 code
= TREE_CODE (x
);
1584 cl
= TREE_CODE_CLASS (code
);
1586 if (warning_candidate_p (x
))
1588 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1598 case TRUTH_ANDIF_EXPR
:
1599 case TRUTH_ORIF_EXPR
:
1600 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1601 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1602 warn_for_collisions (tmp_nosp
);
1603 merge_tlist (pbefore_sp
, tmp_before
, 0);
1604 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1605 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1606 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1610 tmp_before
= tmp_list2
= 0;
1611 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1612 warn_for_collisions (tmp_list2
);
1613 merge_tlist (pbefore_sp
, tmp_before
, 0);
1614 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1616 tmp_list3
= tmp_nosp
= 0;
1617 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1618 warn_for_collisions (tmp_nosp
);
1619 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1621 tmp_list3
= tmp_list2
= 0;
1622 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1623 warn_for_collisions (tmp_list2
);
1624 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1625 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1626 two first, to avoid warning for (a ? b++ : b++). */
1627 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1628 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1631 case PREDECREMENT_EXPR
:
1632 case PREINCREMENT_EXPR
:
1633 case POSTDECREMENT_EXPR
:
1634 case POSTINCREMENT_EXPR
:
1635 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1639 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1640 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1641 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1642 /* Expressions inside the LHS are not ordered wrt. the sequence points
1643 in the RHS. Example:
1645 Despite the fact that the modification of "a" is in the before_sp
1646 list (tmp_before), it conflicts with the use of "a" in the LHS.
1647 We can handle this by adding the contents of tmp_list3
1648 to those of tmp_before, and redoing the collision warnings for that
1650 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1651 warn_for_collisions (tmp_before
);
1652 /* Exclude the LHS itself here; we first have to merge it into the
1653 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1654 didn't exclude the LHS, we'd get it twice, once as a read and once
1656 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1657 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1659 merge_tlist (pbefore_sp
, tmp_before
, 0);
1660 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1661 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1662 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1666 /* We need to warn about conflicts among arguments and conflicts between
1667 args and the function address. Side effects of the function address,
1668 however, are not ordered by the sequence point of the call. */
1670 call_expr_arg_iterator iter
;
1672 tmp_before
= tmp_nosp
= 0;
1673 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1674 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
1676 tmp_list2
= tmp_list3
= 0;
1677 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
1678 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1679 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1681 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1682 warn_for_collisions (tmp_before
);
1683 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1688 /* Scan all the list, e.g. indices of multi dimensional array. */
1691 tmp_before
= tmp_nosp
= 0;
1692 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1693 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1694 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1701 struct tlist_cache
*t
;
1702 for (t
= save_expr_cache
; t
; t
= t
->next
)
1708 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1709 t
->next
= save_expr_cache
;
1711 save_expr_cache
= t
;
1713 tmp_before
= tmp_nosp
= 0;
1714 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1715 warn_for_collisions (tmp_nosp
);
1720 struct tlist
*t
= tmp_nosp
;
1722 merge_tlist (&tmp_list3
, t
, 0);
1724 t
->cache_before_sp
= tmp_before
;
1725 t
->cache_after_sp
= tmp_list3
;
1727 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1728 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1733 /* For other expressions, simply recurse on their operands.
1734 Manual tail recursion for unary expressions.
1735 Other non-expressions need not be processed. */
1736 if (cl
== tcc_unary
)
1738 x
= TREE_OPERAND (x
, 0);
1742 else if (IS_EXPR_CODE_CLASS (cl
))
1745 int max
= TREE_OPERAND_LENGTH (x
);
1746 for (lp
= 0; lp
< max
; lp
++)
1748 tmp_before
= tmp_nosp
= 0;
1749 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1750 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1751 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1758 /* Try to warn for undefined behavior in EXPR due to missing sequence
1762 verify_sequence_points (tree expr
)
1764 struct tlist
*before_sp
= 0, *after_sp
= 0;
1767 save_expr_cache
= 0;
1768 if (tlist_firstobj
== 0)
1770 gcc_obstack_init (&tlist_obstack
);
1771 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1774 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1775 warn_for_collisions (after_sp
);
1776 obstack_free (&tlist_obstack
, tlist_firstobj
);
1779 /* Validate the expression after `case' and apply default promotions. */
1782 check_case_value (tree value
)
1784 if (value
== NULL_TREE
)
1787 /* ??? Can we ever get nops here for a valid case value? We
1789 STRIP_TYPE_NOPS (value
);
1790 /* In C++, the following is allowed:
1793 switch (...) { case i: ... }
1795 So, we try to reduce the VALUE to a constant that way. */
1796 if (c_dialect_cxx ())
1798 value
= decl_constant_value (value
);
1799 STRIP_TYPE_NOPS (value
);
1800 value
= fold (value
);
1803 if (TREE_CODE (value
) == INTEGER_CST
)
1804 /* Promote char or short to int. */
1805 value
= perform_integral_promotions (value
);
1806 else if (value
!= error_mark_node
)
1808 error ("case label does not reduce to an integer constant");
1809 value
= error_mark_node
;
1812 constant_expression_warning (value
);
1817 /* See if the case values LOW and HIGH are in the range of the original
1818 type (i.e. before the default conversion to int) of the switch testing
1820 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1821 the type before promoting it. CASE_LOW_P is a pointer to the lower
1822 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1823 if the case is not a case range.
1824 The caller has to make sure that we are not called with NULL for
1825 CASE_LOW_P (i.e. the default case).
1826 Returns true if the case label is in range of ORIG_TYPE (saturated or
1827 untouched) or false if the label is out of range. */
1830 check_case_bounds (tree type
, tree orig_type
,
1831 tree
*case_low_p
, tree
*case_high_p
)
1833 tree min_value
, max_value
;
1834 tree case_low
= *case_low_p
;
1835 tree case_high
= case_high_p
? *case_high_p
: case_low
;
1837 /* If there was a problem with the original type, do nothing. */
1838 if (orig_type
== error_mark_node
)
1841 min_value
= TYPE_MIN_VALUE (orig_type
);
1842 max_value
= TYPE_MAX_VALUE (orig_type
);
1844 /* Case label is less than minimum for type. */
1845 if (tree_int_cst_compare (case_low
, min_value
) < 0
1846 && tree_int_cst_compare (case_high
, min_value
) < 0)
1848 warning (0, "case label value is less than minimum value for type");
1852 /* Case value is greater than maximum for type. */
1853 if (tree_int_cst_compare (case_low
, max_value
) > 0
1854 && tree_int_cst_compare (case_high
, max_value
) > 0)
1856 warning (0, "case label value exceeds maximum value for type");
1860 /* Saturate lower case label value to minimum. */
1861 if (tree_int_cst_compare (case_high
, min_value
) >= 0
1862 && tree_int_cst_compare (case_low
, min_value
) < 0)
1864 warning (0, "lower value in case label range"
1865 " less than minimum value for type");
1866 case_low
= min_value
;
1869 /* Saturate upper case label value to maximum. */
1870 if (tree_int_cst_compare (case_low
, max_value
) <= 0
1871 && tree_int_cst_compare (case_high
, max_value
) > 0)
1873 warning (0, "upper value in case label range"
1874 " exceeds maximum value for type");
1875 case_high
= max_value
;
1878 if (*case_low_p
!= case_low
)
1879 *case_low_p
= convert (type
, case_low
);
1880 if (case_high_p
&& *case_high_p
!= case_high
)
1881 *case_high_p
= convert (type
, case_high
);
1886 /* Return an integer type with BITS bits of precision,
1887 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1890 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1892 if (bits
== TYPE_PRECISION (integer_type_node
))
1893 return unsignedp
? unsigned_type_node
: integer_type_node
;
1895 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1896 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1898 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1899 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1901 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1902 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1904 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1905 return (unsignedp
? long_long_unsigned_type_node
1906 : long_long_integer_type_node
);
1908 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1909 return (unsignedp
? widest_unsigned_literal_type_node
1910 : widest_integer_literal_type_node
);
1912 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1913 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1915 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1916 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1918 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1919 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1921 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1922 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1927 /* Used for communication between c_common_type_for_mode and
1928 c_register_builtin_type. */
1929 static GTY(()) tree registered_builtin_types
;
1931 /* Return a data type that has machine mode MODE.
1932 If the mode is an integer,
1933 then UNSIGNEDP selects between signed and unsigned types. */
1936 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1940 if (mode
== TYPE_MODE (integer_type_node
))
1941 return unsignedp
? unsigned_type_node
: integer_type_node
;
1943 if (mode
== TYPE_MODE (signed_char_type_node
))
1944 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1946 if (mode
== TYPE_MODE (short_integer_type_node
))
1947 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1949 if (mode
== TYPE_MODE (long_integer_type_node
))
1950 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1952 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1953 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1955 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1956 return unsignedp
? widest_unsigned_literal_type_node
1957 : widest_integer_literal_type_node
;
1960 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1963 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1966 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1969 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1971 #if HOST_BITS_PER_WIDE_INT >= 64
1972 if (mode
== TYPE_MODE (intTI_type_node
))
1973 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1976 if (mode
== TYPE_MODE (float_type_node
))
1977 return float_type_node
;
1979 if (mode
== TYPE_MODE (double_type_node
))
1980 return double_type_node
;
1982 if (mode
== TYPE_MODE (long_double_type_node
))
1983 return long_double_type_node
;
1985 if (mode
== TYPE_MODE (void_type_node
))
1986 return void_type_node
;
1988 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1990 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1991 : make_signed_type (GET_MODE_PRECISION (mode
)));
1993 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1995 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1996 : make_signed_type (GET_MODE_PRECISION (mode
)));
1998 if (COMPLEX_MODE_P (mode
))
2000 enum machine_mode inner_mode
;
2003 if (mode
== TYPE_MODE (complex_float_type_node
))
2004 return complex_float_type_node
;
2005 if (mode
== TYPE_MODE (complex_double_type_node
))
2006 return complex_double_type_node
;
2007 if (mode
== TYPE_MODE (complex_long_double_type_node
))
2008 return complex_long_double_type_node
;
2010 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
2011 return complex_integer_type_node
;
2013 inner_mode
= GET_MODE_INNER (mode
);
2014 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2015 if (inner_type
!= NULL_TREE
)
2016 return build_complex_type (inner_type
);
2018 else if (VECTOR_MODE_P (mode
))
2020 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2021 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
2022 if (inner_type
!= NULL_TREE
)
2023 return build_vector_type_for_mode (inner_type
, mode
);
2026 if (mode
== TYPE_MODE (dfloat32_type_node
))
2027 return dfloat32_type_node
;
2028 if (mode
== TYPE_MODE (dfloat64_type_node
))
2029 return dfloat64_type_node
;
2030 if (mode
== TYPE_MODE (dfloat128_type_node
))
2031 return dfloat128_type_node
;
2033 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
2034 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
2035 return TREE_VALUE (t
);
2041 c_common_unsigned_type (tree type
)
2043 return c_common_signed_or_unsigned_type (1, type
);
2046 /* Return a signed type the same as TYPE in other respects. */
2049 c_common_signed_type (tree type
)
2051 return c_common_signed_or_unsigned_type (0, type
);
2054 /* Return a type the same as TYPE except unsigned or
2055 signed according to UNSIGNEDP. */
2058 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2062 /* This block of code emulates the behavior of the old
2063 c_common_unsigned_type. In particular, it returns
2064 long_unsigned_type_node if passed a long, even when a int would
2065 have the same size. This is necessary for warnings to work
2066 correctly in archs where sizeof(int) == sizeof(long) */
2068 type1
= TYPE_MAIN_VARIANT (type
);
2069 if (type1
== signed_char_type_node
|| type1
== char_type_node
|| type1
== unsigned_char_type_node
)
2070 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2071 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2072 return unsignedp
? unsigned_type_node
: integer_type_node
;
2073 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2074 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2075 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2076 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2077 if (type1
== long_long_integer_type_node
|| type1
== long_long_unsigned_type_node
)
2078 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
2079 if (type1
== widest_integer_literal_type_node
|| type1
== widest_unsigned_literal_type_node
)
2080 return unsignedp
? widest_unsigned_literal_type_node
: widest_integer_literal_type_node
;
2081 #if HOST_BITS_PER_WIDE_INT >= 64
2082 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2083 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2085 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2086 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2087 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2088 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2089 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2090 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2091 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2092 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2094 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2095 the precision; they have precision set to match their range, but
2096 may use a wider mode to match an ABI. If we change modes, we may
2097 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2098 the precision as well, so as to yield correct results for
2099 bit-field types. C++ does not have these separate bit-field
2100 types, and producing a signed or unsigned variant of an
2101 ENUMERAL_TYPE may cause other problems as well. */
2103 if (!INTEGRAL_TYPE_P (type
)
2104 || TYPE_UNSIGNED (type
) == unsignedp
)
2107 #define TYPE_OK(node) \
2108 (TYPE_MODE (type) == TYPE_MODE (node) \
2109 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2110 if (TYPE_OK (signed_char_type_node
))
2111 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2112 if (TYPE_OK (integer_type_node
))
2113 return unsignedp
? unsigned_type_node
: integer_type_node
;
2114 if (TYPE_OK (short_integer_type_node
))
2115 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2116 if (TYPE_OK (long_integer_type_node
))
2117 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2118 if (TYPE_OK (long_long_integer_type_node
))
2119 return (unsignedp
? long_long_unsigned_type_node
2120 : long_long_integer_type_node
);
2121 if (TYPE_OK (widest_integer_literal_type_node
))
2122 return (unsignedp
? widest_unsigned_literal_type_node
2123 : widest_integer_literal_type_node
);
2125 #if HOST_BITS_PER_WIDE_INT >= 64
2126 if (TYPE_OK (intTI_type_node
))
2127 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2129 if (TYPE_OK (intDI_type_node
))
2130 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2131 if (TYPE_OK (intSI_type_node
))
2132 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2133 if (TYPE_OK (intHI_type_node
))
2134 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2135 if (TYPE_OK (intQI_type_node
))
2136 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2139 if (c_dialect_cxx ())
2142 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2145 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2148 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2150 /* Extended integer types of the same width as a standard type have
2151 lesser rank, so those of the same width as int promote to int or
2152 unsigned int and are valid for printf formats expecting int or
2153 unsigned int. To avoid such special cases, avoid creating
2154 extended integer types for bit-fields if a standard integer type
2156 if (width
== TYPE_PRECISION (integer_type_node
))
2157 return unsignedp
? unsigned_type_node
: integer_type_node
;
2158 if (width
== TYPE_PRECISION (signed_char_type_node
))
2159 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2160 if (width
== TYPE_PRECISION (short_integer_type_node
))
2161 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2162 if (width
== TYPE_PRECISION (long_integer_type_node
))
2163 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2164 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2165 return (unsignedp
? long_long_unsigned_type_node
2166 : long_long_integer_type_node
);
2167 return build_nonstandard_integer_type (width
, unsignedp
);
2170 /* The C version of the register_builtin_type langhook. */
2173 c_register_builtin_type (tree type
, const char* name
)
2177 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
2178 DECL_ARTIFICIAL (decl
) = 1;
2179 if (!TYPE_NAME (type
))
2180 TYPE_NAME (type
) = decl
;
2183 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2187 /* Return the minimum number of bits needed to represent VALUE in a
2188 signed or unsigned type, UNSIGNEDP says which. */
2191 min_precision (tree value
, int unsignedp
)
2195 /* If the value is negative, compute its negative minus 1. The latter
2196 adjustment is because the absolute value of the largest negative value
2197 is one larger than the largest positive value. This is equivalent to
2198 a bit-wise negation, so use that operation instead. */
2200 if (tree_int_cst_sgn (value
) < 0)
2201 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
2203 /* Return the number of bits needed, taking into account the fact
2204 that we need one more bit for a signed than unsigned type. */
2206 if (integer_zerop (value
))
2209 log
= tree_floor_log2 (value
);
2211 return log
+ 1 + !unsignedp
;
2214 /* Print an error message for invalid operands to arith operation
2215 CODE with TYPE0 for operand 0, and TYPE1 for operand 1. */
2218 binary_op_error (enum tree_code code
, tree type0
, tree type1
)
2225 opname
= "+"; break;
2227 opname
= "-"; break;
2229 opname
= "*"; break;
2231 opname
= "max"; break;
2233 opname
= "min"; break;
2235 opname
= "=="; break;
2237 opname
= "!="; break;
2239 opname
= "<="; break;
2241 opname
= ">="; break;
2243 opname
= "<"; break;
2245 opname
= ">"; break;
2247 opname
= "<<"; break;
2249 opname
= ">>"; break;
2250 case TRUNC_MOD_EXPR
:
2251 case FLOOR_MOD_EXPR
:
2252 opname
= "%"; break;
2253 case TRUNC_DIV_EXPR
:
2254 case FLOOR_DIV_EXPR
:
2255 opname
= "/"; break;
2257 opname
= "&"; break;
2259 opname
= "|"; break;
2260 case TRUTH_ANDIF_EXPR
:
2261 opname
= "&&"; break;
2262 case TRUTH_ORIF_EXPR
:
2263 opname
= "||"; break;
2265 opname
= "^"; break;
2269 error ("invalid operands to binary %s (have %qT and %qT)", opname
,
2273 /* Subroutine of build_binary_op, used for comparison operations.
2274 See if the operands have both been converted from subword integer types
2275 and, if so, perhaps change them both back to their original type.
2276 This function is also responsible for converting the two operands
2277 to the proper common type for comparison.
2279 The arguments of this function are all pointers to local variables
2280 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2281 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2283 If this function returns nonzero, it means that the comparison has
2284 a constant value. What this function returns is an expression for
2288 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
2289 enum tree_code
*rescode_ptr
)
2292 tree op0
= *op0_ptr
;
2293 tree op1
= *op1_ptr
;
2294 int unsignedp0
, unsignedp1
;
2296 tree primop0
, primop1
;
2297 enum tree_code code
= *rescode_ptr
;
2299 /* Throw away any conversions to wider types
2300 already present in the operands. */
2302 primop0
= get_narrower (op0
, &unsignedp0
);
2303 primop1
= get_narrower (op1
, &unsignedp1
);
2305 /* Handle the case that OP0 does not *contain* a conversion
2306 but it *requires* conversion to FINAL_TYPE. */
2308 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2309 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2310 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2311 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2313 /* If one of the operands must be floated, we cannot optimize. */
2314 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2315 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2317 /* If first arg is constant, swap the args (changing operation
2318 so value is preserved), for canonicalization. Don't do this if
2319 the second arg is 0. */
2321 if (TREE_CONSTANT (primop0
)
2322 && !integer_zerop (primop1
) && !real_zerop (primop1
))
2325 int temi
= unsignedp0
;
2333 unsignedp0
= unsignedp1
;
2356 *rescode_ptr
= code
;
2359 /* If comparing an integer against a constant more bits wide,
2360 maybe we can deduce a value of 1 or 0 independent of the data.
2361 Or else truncate the constant now
2362 rather than extend the variable at run time.
2364 This is only interesting if the constant is the wider arg.
2365 Also, it is not safe if the constant is unsigned and the
2366 variable arg is signed, since in this case the variable
2367 would be sign-extended and then regarded as unsigned.
2368 Our technique fails in this case because the lowest/highest
2369 possible unsigned results don't follow naturally from the
2370 lowest/highest possible values of the variable operand.
2371 For just EQ_EXPR and NE_EXPR there is another technique that
2372 could be used: see if the constant can be faithfully represented
2373 in the other operand's type, by truncating it and reextending it
2374 and see if that preserves the constant's value. */
2376 if (!real1
&& !real2
2377 && TREE_CODE (primop1
) == INTEGER_CST
2378 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2380 int min_gt
, max_gt
, min_lt
, max_lt
;
2381 tree maxval
, minval
;
2382 /* 1 if comparison is nominally unsigned. */
2383 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2386 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2387 TREE_TYPE (primop0
));
2389 maxval
= TYPE_MAX_VALUE (type
);
2390 minval
= TYPE_MIN_VALUE (type
);
2392 if (unsignedp
&& !unsignedp0
)
2393 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2395 if (TREE_TYPE (primop1
) != *restype_ptr
)
2397 /* Convert primop1 to target type, but do not introduce
2398 additional overflow. We know primop1 is an int_cst. */
2399 primop1
= force_fit_type_double (*restype_ptr
,
2400 TREE_INT_CST_LOW (primop1
),
2401 TREE_INT_CST_HIGH (primop1
), 0,
2402 TREE_OVERFLOW (primop1
));
2404 if (type
!= *restype_ptr
)
2406 minval
= convert (*restype_ptr
, minval
);
2407 maxval
= convert (*restype_ptr
, maxval
);
2410 if (unsignedp
&& unsignedp0
)
2412 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2413 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2414 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2415 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2419 min_gt
= INT_CST_LT (primop1
, minval
);
2420 max_gt
= INT_CST_LT (primop1
, maxval
);
2421 min_lt
= INT_CST_LT (minval
, primop1
);
2422 max_lt
= INT_CST_LT (maxval
, primop1
);
2426 /* This used to be a switch, but Genix compiler can't handle that. */
2427 if (code
== NE_EXPR
)
2429 if (max_lt
|| min_gt
)
2430 val
= truthvalue_true_node
;
2432 else if (code
== EQ_EXPR
)
2434 if (max_lt
|| min_gt
)
2435 val
= truthvalue_false_node
;
2437 else if (code
== LT_EXPR
)
2440 val
= truthvalue_true_node
;
2442 val
= truthvalue_false_node
;
2444 else if (code
== GT_EXPR
)
2447 val
= truthvalue_true_node
;
2449 val
= truthvalue_false_node
;
2451 else if (code
== LE_EXPR
)
2454 val
= truthvalue_true_node
;
2456 val
= truthvalue_false_node
;
2458 else if (code
== GE_EXPR
)
2461 val
= truthvalue_true_node
;
2463 val
= truthvalue_false_node
;
2466 /* If primop0 was sign-extended and unsigned comparison specd,
2467 we did a signed comparison above using the signed type bounds.
2468 But the comparison we output must be unsigned.
2470 Also, for inequalities, VAL is no good; but if the signed
2471 comparison had *any* fixed result, it follows that the
2472 unsigned comparison just tests the sign in reverse
2473 (positive values are LE, negative ones GE).
2474 So we can generate an unsigned comparison
2475 against an extreme value of the signed type. */
2477 if (unsignedp
&& !unsignedp0
)
2484 primop1
= TYPE_MIN_VALUE (type
);
2490 primop1
= TYPE_MAX_VALUE (type
);
2497 type
= c_common_unsigned_type (type
);
2500 if (TREE_CODE (primop0
) != INTEGER_CST
)
2502 if (val
== truthvalue_false_node
)
2503 warning (OPT_Wtype_limits
, "comparison is always false due to limited range of data type");
2504 if (val
== truthvalue_true_node
)
2505 warning (OPT_Wtype_limits
, "comparison is always true due to limited range of data type");
2510 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2511 if (TREE_SIDE_EFFECTS (primop0
))
2512 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2516 /* Value is not predetermined, but do the comparison
2517 in the type of the operand that is not constant.
2518 TYPE is already properly set. */
2521 /* If either arg is decimal float and the other is float, find the
2522 proper common type to use for comparison. */
2523 else if (real1
&& real2
2524 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2525 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
2526 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2528 else if (real1
&& real2
2529 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2530 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2531 type
= TREE_TYPE (primop0
);
2533 /* If args' natural types are both narrower than nominal type
2534 and both extend in the same manner, compare them
2535 in the type of the wider arg.
2536 Otherwise must actually extend both to the nominal
2537 common type lest different ways of extending
2539 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2541 else if (unsignedp0
== unsignedp1
&& real1
== real2
2542 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2543 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2545 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2546 type
= c_common_signed_or_unsigned_type (unsignedp0
2547 || TYPE_UNSIGNED (*restype_ptr
),
2549 /* Make sure shorter operand is extended the right way
2550 to match the longer operand. */
2552 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2553 TREE_TYPE (primop0
)),
2556 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2557 TREE_TYPE (primop1
)),
2562 /* Here we must do the comparison on the nominal type
2563 using the args exactly as we received them. */
2564 type
= *restype_ptr
;
2568 if (!real1
&& !real2
&& integer_zerop (primop1
)
2569 && TYPE_UNSIGNED (*restype_ptr
))
2575 /* All unsigned values are >= 0, so we warn. However,
2576 if OP0 is a constant that is >= 0, the signedness of
2577 the comparison isn't an issue, so suppress the
2579 if (warn_type_limits
&& !in_system_header
2580 && !(TREE_CODE (primop0
) == INTEGER_CST
2581 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2583 warning (OPT_Wtype_limits
,
2584 "comparison of unsigned expression >= 0 is always true");
2585 value
= truthvalue_true_node
;
2589 if (warn_type_limits
&& !in_system_header
2590 && !(TREE_CODE (primop0
) == INTEGER_CST
2591 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2593 warning (OPT_Wtype_limits
,
2594 "comparison of unsigned expression < 0 is always false");
2595 value
= truthvalue_false_node
;
2604 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2605 if (TREE_SIDE_EFFECTS (primop0
))
2606 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2613 *op0_ptr
= convert (type
, primop0
);
2614 *op1_ptr
= convert (type
, primop1
);
2616 *restype_ptr
= truthvalue_type_node
;
2621 /* Return a tree for the sum or difference (RESULTCODE says which)
2622 of pointer PTROP and integer INTOP. */
2625 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2629 /* The result is a pointer of the same type that is being added. */
2631 tree result_type
= TREE_TYPE (ptrop
);
2633 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2635 if (pedantic
|| warn_pointer_arith
)
2636 pedwarn ("pointer of type %<void *%> used in arithmetic");
2637 size_exp
= integer_one_node
;
2639 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2641 if (pedantic
|| warn_pointer_arith
)
2642 pedwarn ("pointer to a function used in arithmetic");
2643 size_exp
= integer_one_node
;
2645 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2647 if (pedantic
|| warn_pointer_arith
)
2648 pedwarn ("pointer to member function used in arithmetic");
2649 size_exp
= integer_one_node
;
2652 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2654 /* We are manipulating pointer values, so we don't need to warn
2655 about relying on undefined signed overflow. We disable the
2656 warning here because we use integer types so fold won't know that
2657 they are really pointers. */
2658 fold_defer_overflow_warnings ();
2660 /* If what we are about to multiply by the size of the elements
2661 contains a constant term, apply distributive law
2662 and multiply that constant term separately.
2663 This helps produce common subexpressions. */
2665 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2666 && !TREE_CONSTANT (intop
)
2667 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2668 && TREE_CONSTANT (size_exp
)
2669 /* If the constant comes from pointer subtraction,
2670 skip this optimization--it would cause an error. */
2671 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2672 /* If the constant is unsigned, and smaller than the pointer size,
2673 then we must skip this optimization. This is because it could cause
2674 an overflow error if the constant is negative but INTOP is not. */
2675 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
2676 || (TYPE_PRECISION (TREE_TYPE (intop
))
2677 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2679 enum tree_code subcode
= resultcode
;
2680 tree int_type
= TREE_TYPE (intop
);
2681 if (TREE_CODE (intop
) == MINUS_EXPR
)
2682 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2683 /* Convert both subexpression types to the type of intop,
2684 because weird cases involving pointer arithmetic
2685 can result in a sum or difference with different type args. */
2686 ptrop
= build_binary_op (subcode
, ptrop
,
2687 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2688 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2691 /* Convert the integer argument to a type the same size as sizetype
2692 so the multiply won't overflow spuriously. */
2694 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2695 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
2696 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2697 TYPE_UNSIGNED (sizetype
)), intop
);
2699 /* Replace the integer argument with a suitable product by the object size.
2700 Do this multiplication as signed, then convert to the appropriate
2701 pointer type (actually unsigned integral). */
2703 intop
= convert (result_type
,
2704 build_binary_op (MULT_EXPR
, intop
,
2705 convert (TREE_TYPE (intop
), size_exp
), 1));
2707 /* Create the sum or difference. */
2708 ret
= fold_build2 (resultcode
, result_type
, ptrop
, intop
);
2710 fold_undefer_and_ignore_overflow_warnings ();
2715 /* Return whether EXPR is a declaration whose address can never be
2719 decl_with_nonnull_addr_p (tree expr
)
2721 return (DECL_P (expr
)
2722 && (TREE_CODE (expr
) == PARM_DECL
2723 || TREE_CODE (expr
) == LABEL_DECL
2724 || !DECL_WEAK (expr
)));
2727 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2728 or for an `if' or `while' statement or ?..: exp. It should already
2729 have been validated to be of suitable type; otherwise, a bad
2730 diagnostic may result.
2732 This preparation consists of taking the ordinary
2733 representation of an expression expr and producing a valid tree
2734 boolean expression describing whether expr is nonzero. We could
2735 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2736 but we optimize comparisons, &&, ||, and !.
2738 The resulting type should always be `truthvalue_type_node'. */
2741 c_common_truthvalue_conversion (tree expr
)
2743 switch (TREE_CODE (expr
))
2745 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
2746 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2747 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
2748 case ORDERED_EXPR
: case UNORDERED_EXPR
:
2749 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2751 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2752 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2754 case TRUTH_ANDIF_EXPR
:
2755 case TRUTH_ORIF_EXPR
:
2756 case TRUTH_AND_EXPR
:
2758 case TRUTH_XOR_EXPR
:
2759 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2761 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2762 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2763 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)));
2765 case TRUTH_NOT_EXPR
:
2766 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2768 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
2769 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2775 return integer_zerop (expr
) ? truthvalue_false_node
2776 : truthvalue_true_node
;
2779 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
2780 ? truthvalue_true_node
2781 : truthvalue_false_node
;
2784 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2789 tree inner
= TREE_OPERAND (expr
, 0);
2790 if (decl_with_nonnull_addr_p (inner
))
2792 /* Common Ada/Pascal programmer's mistake. */
2793 warning (OPT_Waddress
,
2794 "the address of %qD will always evaluate as %<true%>",
2796 return truthvalue_true_node
;
2799 /* If we still have a decl, it is possible for its address to
2800 be NULL, so we cannot optimize. */
2803 gcc_assert (DECL_WEAK (inner
));
2807 if (TREE_SIDE_EFFECTS (inner
))
2808 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2809 inner
, truthvalue_true_node
);
2811 return truthvalue_true_node
;
2815 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2816 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2817 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2818 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2824 /* These don't change whether an object is nonzero or zero. */
2825 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2829 /* These don't change whether an object is zero or nonzero, but
2830 we can't ignore them if their second arg has side-effects. */
2831 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2832 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2833 TREE_OPERAND (expr
, 1),
2834 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2836 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2839 /* Distribute the conversion into the arms of a COND_EXPR. */
2840 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
2841 TREE_OPERAND (expr
, 0),
2842 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2843 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2)));
2847 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2848 since that affects how `default_conversion' will behave. */
2849 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2850 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2852 /* If this is widening the argument, we can ignore it. */
2853 if (TYPE_PRECISION (TREE_TYPE (expr
))
2854 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2855 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2859 if (!TREE_NO_WARNING (expr
)
2860 && warn_parentheses
)
2862 warning (OPT_Wparentheses
,
2863 "suggest parentheses around assignment used as truth value");
2864 TREE_NO_WARNING (expr
) = 1;
2872 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2874 tree t
= save_expr (expr
);
2875 return (build_binary_op
2876 ((TREE_SIDE_EFFECTS (expr
)
2877 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2878 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2879 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2883 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2886 static void def_builtin_1 (enum built_in_function fncode
,
2888 enum built_in_class fnclass
,
2889 tree fntype
, tree libtype
,
2890 bool both_p
, bool fallback_p
, bool nonansi_p
,
2891 tree fnattrs
, bool implicit_p
);
2893 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2894 down to the element type of an array. */
2897 c_build_qualified_type (tree type
, int type_quals
)
2899 if (type
== error_mark_node
)
2902 if (TREE_CODE (type
) == ARRAY_TYPE
)
2905 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
2908 /* See if we already have an identically qualified type. */
2909 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2911 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
2912 && TYPE_NAME (t
) == TYPE_NAME (type
)
2913 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
2914 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
2915 TYPE_ATTRIBUTES (type
)))
2920 tree domain
= TYPE_DOMAIN (type
);
2922 t
= build_variant_type_copy (type
);
2923 TREE_TYPE (t
) = element_type
;
2925 if (TYPE_STRUCTURAL_EQUALITY_P (element_type
)
2926 || (domain
&& TYPE_STRUCTURAL_EQUALITY_P (domain
)))
2927 SET_TYPE_STRUCTURAL_EQUALITY (t
);
2928 else if (TYPE_CANONICAL (element_type
) != element_type
2929 || (domain
&& TYPE_CANONICAL (domain
) != domain
))
2931 tree unqualified_canon
2932 = build_array_type (TYPE_CANONICAL (element_type
),
2933 domain
? TYPE_CANONICAL (domain
)
2936 = c_build_qualified_type (unqualified_canon
, type_quals
);
2939 TYPE_CANONICAL (t
) = t
;
2944 /* A restrict-qualified pointer type must be a pointer to object or
2945 incomplete type. Note that the use of POINTER_TYPE_P also allows
2946 REFERENCE_TYPEs, which is appropriate for C++. */
2947 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2948 && (!POINTER_TYPE_P (type
)
2949 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2951 error ("invalid use of %<restrict%>");
2952 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2955 return build_qualified_type (type
, type_quals
);
2958 /* Apply the TYPE_QUALS to the new DECL. */
2961 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2963 tree type
= TREE_TYPE (decl
);
2965 if (type
== error_mark_node
)
2968 if (((type_quals
& TYPE_QUAL_CONST
)
2969 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2970 /* An object declared 'const' is only readonly after it is
2971 initialized. We don't have any way of expressing this currently,
2972 so we need to be conservative and unset TREE_READONLY for types
2973 with constructors. Otherwise aliasing code will ignore stores in
2974 an inline constructor. */
2975 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2976 TREE_READONLY (decl
) = 1;
2977 if (type_quals
& TYPE_QUAL_VOLATILE
)
2979 TREE_SIDE_EFFECTS (decl
) = 1;
2980 TREE_THIS_VOLATILE (decl
) = 1;
2982 if (type_quals
& TYPE_QUAL_RESTRICT
)
2984 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2985 /* Allow 'restrict' on arrays of pointers.
2986 FIXME currently we just ignore it. */
2987 type
= TREE_TYPE (type
);
2989 || !POINTER_TYPE_P (type
)
2990 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2991 error ("invalid use of %<restrict%>");
2992 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2993 /* Indicate we need to make a unique alias set for this pointer.
2994 We can't do it here because it might be pointing to an
2996 DECL_POINTER_ALIAS_SET (decl
) = -2;
3000 /* Hash function for the problem of multiple type definitions in
3001 different files. This must hash all types that will compare
3002 equal via comptypes to the same value. In practice it hashes
3003 on some of the simple stuff and leaves the details to comptypes. */
3006 c_type_hash (const void *p
)
3012 switch (TREE_CODE (t
))
3014 /* For pointers, hash on pointee type plus some swizzling. */
3016 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
3017 /* Hash on number of elements and total size. */
3020 t2
= TYPE_VALUES (t
);
3024 t2
= TYPE_FIELDS (t
);
3026 case QUAL_UNION_TYPE
:
3028 t2
= TYPE_FIELDS (t
);
3032 t2
= TYPE_FIELDS (t
);
3037 for (; t2
; t2
= TREE_CHAIN (t2
))
3039 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
3040 return ((size
<< 24) | (i
<< shift
));
3043 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
3045 /* Return the typed-based alias set for T, which may be an expression
3046 or a type. Return -1 if we don't do anything special. */
3049 c_common_get_alias_set (tree t
)
3054 /* Permit type-punning when accessing a union, provided the access
3055 is directly through the union. For example, this code does not
3056 permit taking the address of a union member and then storing
3057 through it. Even the type-punning allowed here is a GCC
3058 extension, albeit a common and useful one; the C standard says
3059 that such accesses have implementation-defined behavior. */
3061 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
3062 u
= TREE_OPERAND (u
, 0))
3063 if (TREE_CODE (u
) == COMPONENT_REF
3064 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
3067 /* That's all the expressions we handle specially. */
3071 /* The C standard guarantees that any object may be accessed via an
3072 lvalue that has character type. */
3073 if (t
== char_type_node
3074 || t
== signed_char_type_node
3075 || t
== unsigned_char_type_node
)
3078 /* If it has the may_alias attribute, it can alias anything. */
3079 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
3082 /* The C standard specifically allows aliasing between signed and
3083 unsigned variants of the same type. We treat the signed
3084 variant as canonical. */
3085 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3087 tree t1
= c_common_signed_type (t
);
3089 /* t1 == t can happen for boolean nodes which are always unsigned. */
3091 return get_alias_set (t1
);
3093 else if (POINTER_TYPE_P (t
))
3097 /* Unfortunately, there is no canonical form of a pointer type.
3098 In particular, if we have `typedef int I', then `int *', and
3099 `I *' are different types. So, we have to pick a canonical
3100 representative. We do this below.
3102 Technically, this approach is actually more conservative that
3103 it needs to be. In particular, `const int *' and `int *'
3104 should be in different alias sets, according to the C and C++
3105 standard, since their types are not the same, and so,
3106 technically, an `int **' and `const int **' cannot point at
3109 But, the standard is wrong. In particular, this code is
3114 const int* const* cipp = ipp;
3116 And, it doesn't make sense for that to be legal unless you
3117 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3118 the pointed-to types. This issue has been reported to the
3120 t1
= build_type_no_quals (t
);
3122 return get_alias_set (t1
);
3125 /* Handle the case of multiple type nodes referring to "the same" type,
3126 which occurs with IMA. These share an alias set. FIXME: Currently only
3127 C90 is handled. (In C99 type compatibility is not transitive, which
3128 complicates things mightily. The alias set splay trees can theoretically
3129 represent this, but insertion is tricky when you consider all the
3130 different orders things might arrive in.) */
3132 if (c_language
!= clk_c
|| flag_isoc99
)
3135 /* Save time if there's only one input file. */
3136 if (num_in_fnames
== 1)
3139 /* Pointers need special handling if they point to any type that
3140 needs special handling (below). */
3141 if (TREE_CODE (t
) == POINTER_TYPE
)
3144 /* Find bottom type under any nested POINTERs. */
3145 for (t2
= TREE_TYPE (t
);
3146 TREE_CODE (t2
) == POINTER_TYPE
;
3147 t2
= TREE_TYPE (t2
))
3149 if (TREE_CODE (t2
) != RECORD_TYPE
3150 && TREE_CODE (t2
) != ENUMERAL_TYPE
3151 && TREE_CODE (t2
) != QUAL_UNION_TYPE
3152 && TREE_CODE (t2
) != UNION_TYPE
)
3154 if (TYPE_SIZE (t2
) == 0)
3157 /* These are the only cases that need special handling. */
3158 if (TREE_CODE (t
) != RECORD_TYPE
3159 && TREE_CODE (t
) != ENUMERAL_TYPE
3160 && TREE_CODE (t
) != QUAL_UNION_TYPE
3161 && TREE_CODE (t
) != UNION_TYPE
3162 && TREE_CODE (t
) != POINTER_TYPE
)
3165 if (TYPE_SIZE (t
) == 0)
3168 /* Look up t in hash table. Only one of the compatible types within each
3169 alias set is recorded in the table. */
3170 if (!type_hash_table
)
3171 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
3172 (htab_eq
) lang_hooks
.types_compatible_p
,
3174 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
3177 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
3178 return TYPE_ALIAS_SET ((tree
)*slot
);
3181 /* Our caller will assign and record (in t) a new alias set; all we need
3182 to do is remember t in the hash table. */
3188 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3189 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3190 flag controls whether we should diagnose possibly ill-formed
3191 constructs or not. */
3194 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
3196 const char *op_name
;
3198 enum tree_code type_code
= TREE_CODE (type
);
3200 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3202 if (type_code
== FUNCTION_TYPE
)
3206 if (complain
&& (pedantic
|| warn_pointer_arith
))
3207 pedwarn ("invalid application of %<sizeof%> to a function type");
3208 value
= size_one_node
;
3211 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3213 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3215 if (type_code
== VOID_TYPE
3216 && complain
&& (pedantic
|| warn_pointer_arith
))
3217 pedwarn ("invalid application of %qs to a void type", op_name
);
3218 value
= size_one_node
;
3220 else if (!COMPLETE_TYPE_P (type
))
3223 error ("invalid application of %qs to incomplete type %qT ",
3225 value
= size_zero_node
;
3230 /* Convert in case a char is more than one unit. */
3231 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3232 size_int (TYPE_PRECISION (char_type_node
)
3235 value
= size_int (TYPE_ALIGN_UNIT (type
));
3238 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3239 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3240 never happen. However, this node should really have type
3241 `size_t', which is just a typedef for an ordinary integer type. */
3242 value
= fold_convert (size_type_node
, value
);
3243 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
3248 /* Implement the __alignof keyword: Return the minimum required
3249 alignment of EXPR, measured in bytes. For VAR_DECL's and
3250 FIELD_DECL's return DECL_ALIGN (which can be set from an
3251 "aligned" __attribute__ specification). */
3254 c_alignof_expr (tree expr
)
3258 if (TREE_CODE (expr
) == VAR_DECL
)
3259 t
= size_int (DECL_ALIGN_UNIT (expr
));
3261 else if (TREE_CODE (expr
) == COMPONENT_REF
3262 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3264 error ("%<__alignof%> applied to a bit-field");
3267 else if (TREE_CODE (expr
) == COMPONENT_REF
3268 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3269 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3271 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3273 tree t
= TREE_OPERAND (expr
, 0);
3275 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3277 while ((TREE_CODE (t
) == NOP_EXPR
|| TREE_CODE (t
) == CONVERT_EXPR
)
3278 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3282 t
= TREE_OPERAND (t
, 0);
3283 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3284 if (thisalign
> bestalign
)
3285 best
= t
, bestalign
= thisalign
;
3287 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3290 return c_alignof (TREE_TYPE (expr
));
3292 return fold_convert (size_type_node
, t
);
3295 /* Handle C and C++ default attributes. */
3297 enum built_in_attribute
3299 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3300 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3301 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3302 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3303 #include "builtin-attrs.def"
3304 #undef DEF_ATTR_NULL_TREE
3306 #undef DEF_ATTR_IDENT
3307 #undef DEF_ATTR_TREE_LIST
3311 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3313 static void c_init_attributes (void);
3317 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3318 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3319 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3320 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3321 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3322 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3323 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3324 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3325 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3326 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3327 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3328 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3329 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3330 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3331 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3333 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3334 #include "builtin-types.def"
3335 #undef DEF_PRIMITIVE_TYPE
3336 #undef DEF_FUNCTION_TYPE_0
3337 #undef DEF_FUNCTION_TYPE_1
3338 #undef DEF_FUNCTION_TYPE_2
3339 #undef DEF_FUNCTION_TYPE_3
3340 #undef DEF_FUNCTION_TYPE_4
3341 #undef DEF_FUNCTION_TYPE_5
3342 #undef DEF_FUNCTION_TYPE_6
3343 #undef DEF_FUNCTION_TYPE_7
3344 #undef DEF_FUNCTION_TYPE_VAR_0
3345 #undef DEF_FUNCTION_TYPE_VAR_1
3346 #undef DEF_FUNCTION_TYPE_VAR_2
3347 #undef DEF_FUNCTION_TYPE_VAR_3
3348 #undef DEF_FUNCTION_TYPE_VAR_4
3349 #undef DEF_FUNCTION_TYPE_VAR_5
3350 #undef DEF_POINTER_TYPE
3354 typedef enum c_builtin_type builtin_type
;
3356 /* A temporary array for c_common_nodes_and_builtins. Used in
3357 communication with def_fn_type. */
3358 static tree builtin_types
[(int) BT_LAST
+ 1];
3360 /* A helper function for c_common_nodes_and_builtins. Build function type
3361 for DEF with return type RET and N arguments. If VAR is true, then the
3362 function should be variadic after those N arguments.
3364 Takes special care not to ICE if any of the types involved are
3365 error_mark_node, which indicates that said type is not in fact available
3366 (see builtin_type_for_size). In which case the function type as a whole
3367 should be error_mark_node. */
3370 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3372 tree args
= NULL
, t
;
3377 for (i
= 0; i
< n
; ++i
)
3379 builtin_type a
= va_arg (list
, builtin_type
);
3380 t
= builtin_types
[a
];
3381 if (t
== error_mark_node
)
3383 args
= tree_cons (NULL_TREE
, t
, args
);
3387 args
= nreverse (args
);
3389 args
= chainon (args
, void_list_node
);
3391 t
= builtin_types
[ret
];
3392 if (t
== error_mark_node
)
3394 t
= build_function_type (t
, args
);
3397 builtin_types
[def
] = t
;
3400 /* Build builtin functions common to both C and C++ language
3404 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3406 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3407 builtin_types[ENUM] = VALUE;
3408 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3409 def_fn_type (ENUM, RETURN, 0, 0);
3410 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3411 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3412 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3413 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3414 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3415 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3416 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3417 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3418 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3419 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3420 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3422 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3423 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3425 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3426 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3427 def_fn_type (ENUM, RETURN, 1, 0);
3428 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3429 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3430 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3431 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3432 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3433 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3434 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3435 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3436 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3437 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3438 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3439 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3441 #include "builtin-types.def"
3443 #undef DEF_PRIMITIVE_TYPE
3444 #undef DEF_FUNCTION_TYPE_1
3445 #undef DEF_FUNCTION_TYPE_2
3446 #undef DEF_FUNCTION_TYPE_3
3447 #undef DEF_FUNCTION_TYPE_4
3448 #undef DEF_FUNCTION_TYPE_5
3449 #undef DEF_FUNCTION_TYPE_6
3450 #undef DEF_FUNCTION_TYPE_VAR_0
3451 #undef DEF_FUNCTION_TYPE_VAR_1
3452 #undef DEF_FUNCTION_TYPE_VAR_2
3453 #undef DEF_FUNCTION_TYPE_VAR_3
3454 #undef DEF_FUNCTION_TYPE_VAR_4
3455 #undef DEF_FUNCTION_TYPE_VAR_5
3456 #undef DEF_POINTER_TYPE
3457 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3459 c_init_attributes ();
3461 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3462 NONANSI_P, ATTRS, IMPLICIT, COND) \
3464 def_builtin_1 (ENUM, NAME, CLASS, \
3465 builtin_types[(int) TYPE], \
3466 builtin_types[(int) LIBTYPE], \
3467 BOTH_P, FALLBACK_P, NONANSI_P, \
3468 built_in_attributes[(int) ATTRS], IMPLICIT);
3469 #include "builtins.def"
3472 targetm
.init_builtins ();
3474 build_common_builtin_nodes ();
3480 /* Build tree nodes and builtin functions common to both C and C++ language
3484 c_common_nodes_and_builtins (void)
3486 int wchar_type_size
;
3487 tree array_domain_type
;
3488 tree va_list_ref_type_node
;
3489 tree va_list_arg_type_node
;
3491 /* Define `int' and `char' first so that dbx will output them first. */
3492 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3493 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3495 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3496 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3497 but not C. Are the conditionals here needed? */
3498 if (c_dialect_cxx ())
3499 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3500 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3501 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3502 record_builtin_type (RID_MAX
, "long unsigned int",
3503 long_unsigned_type_node
);
3504 if (c_dialect_cxx ())
3505 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3506 record_builtin_type (RID_MAX
, "long long int",
3507 long_long_integer_type_node
);
3508 record_builtin_type (RID_MAX
, "long long unsigned int",
3509 long_long_unsigned_type_node
);
3510 if (c_dialect_cxx ())
3511 record_builtin_type (RID_MAX
, "long long unsigned",
3512 long_long_unsigned_type_node
);
3513 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3514 record_builtin_type (RID_MAX
, "short unsigned int",
3515 short_unsigned_type_node
);
3516 if (c_dialect_cxx ())
3517 record_builtin_type (RID_MAX
, "unsigned short",
3518 short_unsigned_type_node
);
3520 /* Define both `signed char' and `unsigned char'. */
3521 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3522 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3524 /* These are types that c_common_type_for_size and
3525 c_common_type_for_mode use. */
3526 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3528 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3530 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3532 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3534 #if HOST_BITS_PER_WIDE_INT >= 64
3535 if (targetm
.scalar_mode_supported_p (TImode
))
3536 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3537 get_identifier ("__int128_t"),
3540 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3541 unsigned_intQI_type_node
));
3542 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3543 unsigned_intHI_type_node
));
3544 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3545 unsigned_intSI_type_node
));
3546 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3547 unsigned_intDI_type_node
));
3548 #if HOST_BITS_PER_WIDE_INT >= 64
3549 if (targetm
.scalar_mode_supported_p (TImode
))
3550 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3551 get_identifier ("__uint128_t"),
3552 unsigned_intTI_type_node
));
3555 /* Create the widest literal types. */
3556 widest_integer_literal_type_node
3557 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3558 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3559 widest_integer_literal_type_node
));
3561 widest_unsigned_literal_type_node
3562 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3563 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3564 widest_unsigned_literal_type_node
));
3566 /* `unsigned long' is the standard type for sizeof.
3567 Note that stddef.h uses `unsigned long',
3568 and this must agree, even if long and int are the same size. */
3570 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3571 signed_size_type_node
= c_common_signed_type (size_type_node
);
3572 set_sizetype (size_type_node
);
3575 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
3577 build_common_tree_nodes_2 (flag_short_double
);
3579 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3580 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3581 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3583 /* Only supported decimal floating point extension if the target
3584 actually supports underlying modes. */
3585 if (targetm
.scalar_mode_supported_p (SDmode
)
3586 && targetm
.scalar_mode_supported_p (DDmode
)
3587 && targetm
.scalar_mode_supported_p (TDmode
))
3589 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
3590 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
3591 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
3594 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3595 get_identifier ("complex int"),
3596 complex_integer_type_node
));
3597 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3598 get_identifier ("complex float"),
3599 complex_float_type_node
));
3600 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3601 get_identifier ("complex double"),
3602 complex_double_type_node
));
3603 lang_hooks
.decls
.pushdecl
3604 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3605 complex_long_double_type_node
));
3607 if (c_dialect_cxx ())
3608 /* For C++, make fileptr_type_node a distinct void * type until
3609 FILE type is defined. */
3610 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
3612 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3614 /* Set the TYPE_NAME for any variants that were built before
3615 record_builtin_type gave names to the built-in types. */
3617 tree void_name
= TYPE_NAME (void_type_node
);
3618 TYPE_NAME (void_type_node
) = NULL_TREE
;
3619 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
3621 TYPE_NAME (void_type_node
) = void_name
;
3624 /* This node must not be shared. */
3625 void_zero_node
= make_node (INTEGER_CST
);
3626 TREE_TYPE (void_zero_node
) = void_type_node
;
3628 void_list_node
= build_void_list_node ();
3630 /* Make a type to be the domain of a few array types
3631 whose domains don't really matter.
3632 200 is small enough that it always fits in size_t
3633 and large enough that it can hold most function names for the
3634 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3635 array_domain_type
= build_index_type (size_int (200));
3637 /* Make a type for arrays of characters.
3638 With luck nothing will ever really depend on the length of this
3640 char_array_type_node
3641 = build_array_type (char_type_node
, array_domain_type
);
3643 /* Likewise for arrays of ints. */
3645 = build_array_type (integer_type_node
, array_domain_type
);
3647 string_type_node
= build_pointer_type (char_type_node
);
3648 const_string_type_node
3649 = build_pointer_type (build_qualified_type
3650 (char_type_node
, TYPE_QUAL_CONST
));
3652 /* This is special for C++ so functions can be overloaded. */
3653 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3654 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3655 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3656 if (c_dialect_cxx ())
3658 if (TYPE_UNSIGNED (wchar_type_node
))
3659 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3661 wchar_type_node
= make_signed_type (wchar_type_size
);
3662 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3666 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3667 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3670 /* This is for wide string constants. */
3671 wchar_array_type_node
3672 = build_array_type (wchar_type_node
, array_domain_type
);
3675 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3678 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3680 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3682 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3684 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3685 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3687 lang_hooks
.decls
.pushdecl
3688 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3689 va_list_type_node
));
3691 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3693 va_list_arg_type_node
= va_list_ref_type_node
=
3694 build_pointer_type (TREE_TYPE (va_list_type_node
));
3698 va_list_arg_type_node
= va_list_type_node
;
3699 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3702 if (!flag_preprocess_only
)
3703 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
3705 main_identifier_node
= get_identifier ("main");
3707 /* Create the built-in __null node. It is important that this is
3709 null_node
= make_node (INTEGER_CST
);
3710 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
3712 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3713 memset (builtin_types
, 0, sizeof (builtin_types
));
3716 /* Look up the function in built_in_decls that corresponds to DECL
3717 and set ASMSPEC as its user assembler name. DECL must be a
3718 function decl that declares a builtin. */
3721 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
3724 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
3725 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
3728 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
3729 set_user_assembler_name (builtin
, asmspec
);
3730 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
3731 init_block_move_fn (asmspec
);
3732 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
3733 init_block_clear_fn (asmspec
);
3736 /* The number of named compound-literals generated thus far. */
3737 static GTY(()) int compound_literal_number
;
3739 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3742 set_compound_literal_name (tree decl
)
3745 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
3746 compound_literal_number
);
3747 compound_literal_number
++;
3748 DECL_NAME (decl
) = get_identifier (name
);
3752 build_va_arg (tree expr
, tree type
)
3754 return build1 (VA_ARG_EXPR
, type
, expr
);
3758 /* Linked list of disabled built-in functions. */
3760 typedef struct disabled_builtin
3763 struct disabled_builtin
*next
;
3765 static disabled_builtin
*disabled_builtins
= NULL
;
3767 static bool builtin_function_disabled_p (const char *);
3769 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3770 begins with "__builtin_", give an error. */
3773 disable_builtin_function (const char *name
)
3775 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3776 error ("cannot disable built-in function %qs", name
);
3779 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
3780 new_disabled_builtin
->name
= name
;
3781 new_disabled_builtin
->next
= disabled_builtins
;
3782 disabled_builtins
= new_disabled_builtin
;
3787 /* Return true if the built-in function NAME has been disabled, false
3791 builtin_function_disabled_p (const char *name
)
3793 disabled_builtin
*p
;
3794 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3796 if (strcmp (name
, p
->name
) == 0)
3803 /* Worker for DEF_BUILTIN.
3804 Possibly define a builtin function with one or two names.
3805 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3806 nonansi_p and flag_no_nonansi_builtin. */
3809 def_builtin_1 (enum built_in_function fncode
,
3811 enum built_in_class fnclass
,
3812 tree fntype
, tree libtype
,
3813 bool both_p
, bool fallback_p
, bool nonansi_p
,
3814 tree fnattrs
, bool implicit_p
)
3817 const char *libname
;
3819 if (fntype
== error_mark_node
)
3822 gcc_assert ((!both_p
&& !fallback_p
)
3823 || !strncmp (name
, "__builtin_",
3824 strlen ("__builtin_")));
3826 libname
= name
+ strlen ("__builtin_");
3827 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
3828 (fallback_p
? libname
: NULL
),
3831 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
3832 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3833 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
3836 built_in_decls
[(int) fncode
] = decl
;
3838 implicit_built_in_decls
[(int) fncode
] = decl
;
3841 /* Nonzero if the type T promotes to int. This is (nearly) the
3842 integral promotions defined in ISO C99 6.3.1.1/2. */
3845 c_promoting_integer_type_p (tree t
)
3847 switch (TREE_CODE (t
))
3850 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3851 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3852 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3853 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3854 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3855 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3858 /* ??? Technically all enumerations not larger than an int
3859 promote to an int. But this is used along code paths
3860 that only want to notice a size change. */
3861 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3871 /* Return 1 if PARMS specifies a fixed number of parameters
3872 and none of their types is affected by default promotions. */
3875 self_promoting_args_p (tree parms
)
3878 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3880 tree type
= TREE_VALUE (t
);
3882 if (type
== error_mark_node
)
3885 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3891 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3894 if (c_promoting_integer_type_p (type
))
3900 /* Recursively examines the array elements of TYPE, until a non-array
3901 element type is found. */
3904 strip_array_types (tree type
)
3906 while (TREE_CODE (type
) == ARRAY_TYPE
)
3907 type
= TREE_TYPE (type
);
3912 /* Recursively remove any '*' or '&' operator from TYPE. */
3914 strip_pointer_operator (tree t
)
3916 while (POINTER_TYPE_P (t
))
3921 /* Recursively remove pointer or array type from TYPE. */
3923 strip_pointer_or_array_types (tree t
)
3925 while (TREE_CODE (t
) == ARRAY_TYPE
|| POINTER_TYPE_P (t
))
3930 /* Used to compare case labels. K1 and K2 are actually tree nodes
3931 representing case labels, or NULL_TREE for a `default' label.
3932 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3933 K2, and 0 if K1 and K2 are equal. */
3936 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3938 /* Consider a NULL key (such as arises with a `default' label) to be
3939 smaller than anything else. */
3945 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3948 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3949 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3950 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3951 case label was declared using the usual C/C++ syntax, rather than
3952 the GNU case range extension. CASES is a tree containing all the
3953 case ranges processed so far; COND is the condition for the
3954 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3955 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3958 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
3959 tree low_value
, tree high_value
)
3964 splay_tree_node node
;
3966 /* Create the LABEL_DECL itself. */
3967 label
= create_artificial_label ();
3969 /* If there was an error processing the switch condition, bail now
3970 before we get more confused. */
3971 if (!cond
|| cond
== error_mark_node
)
3974 if ((low_value
&& TREE_TYPE (low_value
)
3975 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3976 || (high_value
&& TREE_TYPE (high_value
)
3977 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3979 error ("pointers are not permitted as case values");
3983 /* Case ranges are a GNU extension. */
3984 if (high_value
&& pedantic
)
3985 pedwarn ("range expressions in switch statements are non-standard");
3987 type
= TREE_TYPE (cond
);
3990 low_value
= check_case_value (low_value
);
3991 low_value
= convert_and_check (type
, low_value
);
3992 if (low_value
== error_mark_node
)
3997 high_value
= check_case_value (high_value
);
3998 high_value
= convert_and_check (type
, high_value
);
3999 if (high_value
== error_mark_node
)
4003 if (low_value
&& high_value
)
4005 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
4006 really a case range, even though it was written that way.
4007 Remove the HIGH_VALUE to simplify later processing. */
4008 if (tree_int_cst_equal (low_value
, high_value
))
4009 high_value
= NULL_TREE
;
4010 else if (!tree_int_cst_lt (low_value
, high_value
))
4011 warning (0, "empty range specified");
4014 /* See if the case is in range of the type of the original testing
4015 expression. If both low_value and high_value are out of range,
4016 don't insert the case label and return NULL_TREE. */
4018 && !check_case_bounds (type
, orig_type
,
4019 &low_value
, high_value
? &high_value
: NULL
))
4022 /* Look up the LOW_VALUE in the table of case labels we already
4024 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
4025 /* If there was not an exact match, check for overlapping ranges.
4026 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
4027 that's a `default' label and the only overlap is an exact match. */
4028 if (!node
&& (low_value
|| high_value
))
4030 splay_tree_node low_bound
;
4031 splay_tree_node high_bound
;
4033 /* Even though there wasn't an exact match, there might be an
4034 overlap between this case range and another case range.
4035 Since we've (inductively) not allowed any overlapping case
4036 ranges, we simply need to find the greatest low case label
4037 that is smaller that LOW_VALUE, and the smallest low case
4038 label that is greater than LOW_VALUE. If there is an overlap
4039 it will occur in one of these two ranges. */
4040 low_bound
= splay_tree_predecessor (cases
,
4041 (splay_tree_key
) low_value
);
4042 high_bound
= splay_tree_successor (cases
,
4043 (splay_tree_key
) low_value
);
4045 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4046 the LOW_VALUE, so there is no need to check unless the
4047 LOW_BOUND is in fact itself a case range. */
4049 && CASE_HIGH ((tree
) low_bound
->value
)
4050 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
4053 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4054 range is bigger than the low end of the current range, so we
4055 are only interested if the current range is a real range, and
4056 not an ordinary case label. */
4059 && (tree_int_cst_compare ((tree
) high_bound
->key
,
4064 /* If there was an overlap, issue an error. */
4067 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
4071 error ("duplicate (or overlapping) case value");
4072 error ("%Jthis is the first entry overlapping that value", duplicate
);
4076 error ("duplicate case value") ;
4077 error ("%Jpreviously used here", duplicate
);
4081 error ("multiple default labels in one switch");
4082 error ("%Jthis is the first default label", duplicate
);
4087 /* Add a CASE_LABEL to the statement-tree. */
4088 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
4089 /* Register this case label in the splay tree. */
4090 splay_tree_insert (cases
,
4091 (splay_tree_key
) low_value
,
4092 (splay_tree_value
) case_label
);
4097 /* Add a label so that the back-end doesn't think that the beginning of
4098 the switch is unreachable. Note that we do not add a case label, as
4099 that just leads to duplicates and thence to failure later on. */
4102 tree t
= create_artificial_label ();
4103 add_stmt (build_stmt (LABEL_EXPR
, t
));
4105 return error_mark_node
;
4108 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4109 Used to verify that case values match up with enumerator values. */
4112 match_case_to_enum_1 (tree key
, tree type
, tree label
)
4114 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
4116 /* ??? Not working too hard to print the double-word value.
4117 Should perhaps be done with %lwd in the diagnostic routines? */
4118 if (TREE_INT_CST_HIGH (key
) == 0)
4119 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
4120 TREE_INT_CST_LOW (key
));
4121 else if (!TYPE_UNSIGNED (type
)
4122 && TREE_INT_CST_HIGH (key
) == -1
4123 && TREE_INT_CST_LOW (key
) != 0)
4124 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
4125 -TREE_INT_CST_LOW (key
));
4127 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
4128 TREE_INT_CST_HIGH (key
), TREE_INT_CST_LOW (key
));
4130 if (TYPE_NAME (type
) == 0)
4131 warning (0, "%Jcase value %qs not in enumerated type",
4132 CASE_LABEL (label
), buf
);
4134 warning (0, "%Jcase value %qs not in enumerated type %qT",
4135 CASE_LABEL (label
), buf
, type
);
4138 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4139 Used to verify that case values match up with enumerator values. */
4142 match_case_to_enum (splay_tree_node node
, void *data
)
4144 tree label
= (tree
) node
->value
;
4145 tree type
= (tree
) data
;
4147 /* Skip default case. */
4148 if (!CASE_LOW (label
))
4151 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4152 when we did our enum->case scan. Reset our scratch bit after. */
4153 if (!CASE_LOW_SEEN (label
))
4154 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
4156 CASE_LOW_SEEN (label
) = 0;
4158 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4159 not set, that means that CASE_HIGH did not appear when we did our
4160 enum->case scan. Reset our scratch bit after. */
4161 if (CASE_HIGH (label
))
4163 if (!CASE_HIGH_SEEN (label
))
4164 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
4166 CASE_HIGH_SEEN (label
) = 0;
4172 /* Handle -Wswitch*. Called from the front end after parsing the
4173 switch construct. */
4174 /* ??? Should probably be somewhere generic, since other languages
4175 besides C and C++ would want this. At the moment, however, C/C++
4176 are the only tree-ssa languages that support enumerations at all,
4177 so the point is moot. */
4180 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
4181 tree type
, tree cond
)
4183 splay_tree_node default_node
;
4184 splay_tree_node node
;
4187 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
4190 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
4192 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
4195 /* From here on, we only care about about enumerated types. */
4196 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
4199 /* If the switch expression was an enumerated type, check that
4200 exactly all enumeration literals are covered by the cases.
4201 The check is made when -Wswitch was specified and there is no
4202 default case, or when -Wswitch-enum was specified. */
4204 if (!warn_switch_enum
4205 && !(warn_switch
&& !default_node
))
4208 /* Clearing COND if it is not an integer constant simplifies
4209 the tests inside the loop below. */
4210 if (TREE_CODE (cond
) != INTEGER_CST
)
4213 /* The time complexity here is O(N*lg(N)) worst case, but for the
4214 common case of monotonically increasing enumerators, it is
4215 O(N), since the nature of the splay tree will keep the next
4216 element adjacent to the root at all times. */
4218 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
4220 tree value
= TREE_VALUE (chain
);
4221 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
4224 /* Mark the CASE_LOW part of the case entry as seen. */
4225 tree label
= (tree
) node
->value
;
4226 CASE_LOW_SEEN (label
) = 1;
4230 /* Even though there wasn't an exact match, there might be a
4231 case range which includes the enumator's value. */
4232 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
4233 if (node
&& CASE_HIGH ((tree
) node
->value
))
4235 tree label
= (tree
) node
->value
;
4236 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
4239 /* If we match the upper bound exactly, mark the CASE_HIGH
4240 part of the case entry as seen. */
4242 CASE_HIGH_SEEN (label
) = 1;
4247 /* We've now determined that this enumerated literal isn't
4248 handled by the case labels of the switch statement. */
4250 /* If the switch expression is a constant, we only really care
4251 about whether that constant is handled by the switch. */
4252 if (cond
&& tree_int_cst_compare (cond
, value
))
4255 warning (0, "%Henumeration value %qE not handled in switch",
4256 &switch_location
, TREE_PURPOSE (chain
));
4259 /* Warn if there are case expressions that don't correspond to
4260 enumerators. This can occur since C and C++ don't enforce
4261 type-checking of assignments to enumeration variables.
4263 The time complexity here is now always O(N) worst case, since
4264 we should have marked both the lower bound and upper bound of
4265 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4266 above. This scan also resets those fields. */
4267 splay_tree_foreach (cases
, match_case_to_enum
, type
);
4270 /* Finish an expression taking the address of LABEL (an
4271 IDENTIFIER_NODE). Returns an expression for the address. */
4274 finish_label_address_expr (tree label
)
4279 pedwarn ("taking the address of a label is non-standard");
4281 if (label
== error_mark_node
)
4282 return error_mark_node
;
4284 label
= lookup_label (label
);
4285 if (label
== NULL_TREE
)
4286 result
= null_pointer_node
;
4289 TREE_USED (label
) = 1;
4290 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4291 /* The current function in not necessarily uninlinable.
4292 Computed gotos are incompatible with inlining, but the value
4293 here could be used only in a diagnostic, for example. */
4299 /* Hook used by expand_expr to expand language-specific tree codes. */
4300 /* The only things that should go here are bits needed to expand
4301 constant initializers. Everything else should be handled by the
4302 gimplification routines. */
4305 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
4306 int modifier
/* Actually enum_modifier. */,
4309 switch (TREE_CODE (exp
))
4311 case COMPOUND_LITERAL_EXPR
:
4313 /* Initialize the anonymous variable declared in the compound
4314 literal, then return the variable. */
4315 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
4316 emit_local_var (decl
);
4317 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
4326 /* Generate the RTL for the body of FNDECL. */
4329 c_expand_body (tree fndecl
)
4331 tree_rest_of_compilation (fndecl
);
4334 /* Hook used by staticp to handle language-specific tree codes. */
4337 c_staticp (tree exp
)
4339 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
4340 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
4345 /* Given a boolean expression ARG, return a tree representing an increment
4346 or decrement (as indicated by CODE) of ARG. The front end must check for
4347 invalid cases (e.g., decrement in C++). */
4349 boolean_increment (enum tree_code code
, tree arg
)
4352 tree true_res
= boolean_true_node
;
4354 arg
= stabilize_reference (arg
);
4357 case PREINCREMENT_EXPR
:
4358 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4360 case POSTINCREMENT_EXPR
:
4361 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4362 arg
= save_expr (arg
);
4363 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4364 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4366 case PREDECREMENT_EXPR
:
4367 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4368 invert_truthvalue (arg
));
4370 case POSTDECREMENT_EXPR
:
4371 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4372 invert_truthvalue (arg
));
4373 arg
= save_expr (arg
);
4374 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4375 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4380 TREE_SIDE_EFFECTS (val
) = 1;
4384 /* Built-in macros for stddef.h, that require macros defined in this
4387 c_stddef_cpp_builtins(void)
4389 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4390 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4391 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4392 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4393 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
4394 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
4398 c_init_attributes (void)
4400 /* Fill in the built_in_attributes array. */
4401 #define DEF_ATTR_NULL_TREE(ENUM) \
4402 built_in_attributes[(int) ENUM] = NULL_TREE;
4403 #define DEF_ATTR_INT(ENUM, VALUE) \
4404 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4405 #define DEF_ATTR_IDENT(ENUM, STRING) \
4406 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4407 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4408 built_in_attributes[(int) ENUM] \
4409 = tree_cons (built_in_attributes[(int) PURPOSE], \
4410 built_in_attributes[(int) VALUE], \
4411 built_in_attributes[(int) CHAIN]);
4412 #include "builtin-attrs.def"
4413 #undef DEF_ATTR_NULL_TREE
4415 #undef DEF_ATTR_IDENT
4416 #undef DEF_ATTR_TREE_LIST
4419 /* Attribute handlers common to C front ends. */
4421 /* Handle a "packed" attribute; arguments as in
4422 struct attribute_spec.handler. */
4425 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4426 int flags
, bool *no_add_attrs
)
4430 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4431 *node
= build_variant_type_copy (*node
);
4432 TYPE_PACKED (*node
) = 1;
4434 else if (TREE_CODE (*node
) == FIELD_DECL
)
4436 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
)
4437 warning (OPT_Wattributes
,
4438 "%qE attribute ignored for field of type %qT",
4439 name
, TREE_TYPE (*node
));
4441 DECL_PACKED (*node
) = 1;
4443 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4444 used for DECL_REGISTER. It wouldn't mean anything anyway.
4445 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4446 that changes what the typedef is typing. */
4449 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4450 *no_add_attrs
= true;
4456 /* Handle a "nocommon" attribute; arguments as in
4457 struct attribute_spec.handler. */
4460 handle_nocommon_attribute (tree
*node
, tree name
,
4461 tree
ARG_UNUSED (args
),
4462 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4464 if (TREE_CODE (*node
) == VAR_DECL
)
4465 DECL_COMMON (*node
) = 0;
4468 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4469 *no_add_attrs
= true;
4475 /* Handle a "common" attribute; arguments as in
4476 struct attribute_spec.handler. */
4479 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4480 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4482 if (TREE_CODE (*node
) == VAR_DECL
)
4483 DECL_COMMON (*node
) = 1;
4486 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4487 *no_add_attrs
= true;
4493 /* Handle a "noreturn" attribute; arguments as in
4494 struct attribute_spec.handler. */
4497 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4498 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4500 tree type
= TREE_TYPE (*node
);
4502 /* See FIXME comment in c_common_attribute_table. */
4503 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4504 TREE_THIS_VOLATILE (*node
) = 1;
4505 else if (TREE_CODE (type
) == POINTER_TYPE
4506 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4508 = build_pointer_type
4509 (build_type_variant (TREE_TYPE (type
),
4510 TYPE_READONLY (TREE_TYPE (type
)), 1));
4513 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4514 *no_add_attrs
= true;
4520 /* Handle a "hot" and attribute; arguments as in
4521 struct attribute_spec.handler. */
4524 handle_hot_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4525 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4527 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4529 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node
)) != NULL
)
4531 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
4533 *no_add_attrs
= true;
4535 /* Do nothing else, just set the attribute. We'll get at
4536 it later with lookup_attribute. */
4540 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4541 *no_add_attrs
= true;
4546 /* Handle a "cold" and attribute; arguments as in
4547 struct attribute_spec.handler. */
4550 handle_cold_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4551 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4553 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4555 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node
)) != NULL
)
4557 warning (OPT_Wattributes
, "%qE attribute conflicts with attribute %s",
4559 *no_add_attrs
= true;
4561 /* Do nothing else, just set the attribute. We'll get at
4562 it later with lookup_attribute. */
4566 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4567 *no_add_attrs
= true;
4573 /* Handle a "noinline" attribute; arguments as in
4574 struct attribute_spec.handler. */
4577 handle_noinline_attribute (tree
*node
, tree name
,
4578 tree
ARG_UNUSED (args
),
4579 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4581 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4582 DECL_UNINLINABLE (*node
) = 1;
4585 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4586 *no_add_attrs
= true;
4592 /* Handle a "always_inline" attribute; arguments as in
4593 struct attribute_spec.handler. */
4596 handle_always_inline_attribute (tree
*node
, tree name
,
4597 tree
ARG_UNUSED (args
),
4598 int ARG_UNUSED (flags
),
4601 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4603 /* Do nothing else, just set the attribute. We'll get at
4604 it later with lookup_attribute. */
4608 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4609 *no_add_attrs
= true;
4615 /* Handle a "gnu_inline" attribute; arguments as in
4616 struct attribute_spec.handler. */
4619 handle_gnu_inline_attribute (tree
*node
, tree name
,
4620 tree
ARG_UNUSED (args
),
4621 int ARG_UNUSED (flags
),
4624 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
4626 /* Do nothing else, just set the attribute. We'll get at
4627 it later with lookup_attribute. */
4631 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4632 *no_add_attrs
= true;
4638 /* Handle a "flatten" attribute; arguments as in
4639 struct attribute_spec.handler. */
4642 handle_flatten_attribute (tree
*node
, tree name
,
4643 tree args ATTRIBUTE_UNUSED
,
4644 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4646 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4647 /* Do nothing else, just set the attribute. We'll get at
4648 it later with lookup_attribute. */
4652 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4653 *no_add_attrs
= true;
4660 /* Handle a "used" attribute; arguments as in
4661 struct attribute_spec.handler. */
4664 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
4665 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4669 if (TREE_CODE (node
) == FUNCTION_DECL
4670 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4672 TREE_USED (node
) = 1;
4673 DECL_PRESERVE_P (node
) = 1;
4677 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4678 *no_add_attrs
= true;
4684 /* Handle a "unused" attribute; arguments as in
4685 struct attribute_spec.handler. */
4688 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4689 int flags
, bool *no_add_attrs
)
4695 if (TREE_CODE (decl
) == PARM_DECL
4696 || TREE_CODE (decl
) == VAR_DECL
4697 || TREE_CODE (decl
) == FUNCTION_DECL
4698 || TREE_CODE (decl
) == LABEL_DECL
4699 || TREE_CODE (decl
) == TYPE_DECL
)
4700 TREE_USED (decl
) = 1;
4703 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4704 *no_add_attrs
= true;
4709 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4710 *node
= build_variant_type_copy (*node
);
4711 TREE_USED (*node
) = 1;
4717 /* Handle a "externally_visible" attribute; arguments as in
4718 struct attribute_spec.handler. */
4721 handle_externally_visible_attribute (tree
*pnode
, tree name
,
4722 tree
ARG_UNUSED (args
),
4723 int ARG_UNUSED (flags
),
4728 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
4730 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
4731 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
4733 warning (OPT_Wattributes
,
4734 "%qE attribute have effect only on public objects", name
);
4735 *no_add_attrs
= true;
4740 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4741 *no_add_attrs
= true;
4747 /* Handle a "const" attribute; arguments as in
4748 struct attribute_spec.handler. */
4751 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4752 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4754 tree type
= TREE_TYPE (*node
);
4756 /* See FIXME comment on noreturn in c_common_attribute_table. */
4757 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4758 TREE_READONLY (*node
) = 1;
4759 else if (TREE_CODE (type
) == POINTER_TYPE
4760 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4762 = build_pointer_type
4763 (build_type_variant (TREE_TYPE (type
), 1,
4764 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4767 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4768 *no_add_attrs
= true;
4774 /* Handle a "transparent_union" attribute; arguments as in
4775 struct attribute_spec.handler. */
4778 handle_transparent_union_attribute (tree
*node
, tree name
,
4779 tree
ARG_UNUSED (args
), int flags
,
4784 *no_add_attrs
= true;
4788 if (TREE_CODE (*node
) != TYPE_DECL
)
4790 node
= &TREE_TYPE (*node
);
4793 else if (TYPE_P (*node
))
4798 if (TREE_CODE (type
) == UNION_TYPE
)
4800 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4801 the code in finish_struct. */
4802 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4804 if (TYPE_FIELDS (type
) == NULL_TREE
4805 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
4808 /* A type variant isn't good enough, since we don't a cast
4809 to such a type removed as a no-op. */
4810 *node
= type
= build_duplicate_type (type
);
4813 TYPE_TRANSPARENT_UNION (type
) = 1;
4818 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4822 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
4823 get the requested priority for a constructor or destructor,
4824 possibly issuing diagnostics for invalid or reserved
4827 static priority_type
4828 get_priority (tree args
, bool is_destructor
)
4834 return DEFAULT_INIT_PRIORITY
;
4836 if (!SUPPORTS_INIT_PRIORITY
)
4839 error ("destructor priorities are not supported");
4841 error ("constructor priorities are not supported");
4842 return DEFAULT_INIT_PRIORITY
;
4845 arg
= TREE_VALUE (args
);
4846 if (!host_integerp (arg
, /*pos=*/0)
4847 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4850 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
4851 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
4854 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
4858 "destructor priorities from 0 to %d are reserved "
4859 "for the implementation",
4860 MAX_RESERVED_INIT_PRIORITY
);
4863 "constructor priorities from 0 to %d are reserved "
4864 "for the implementation",
4865 MAX_RESERVED_INIT_PRIORITY
);
4871 error ("destructor priorities must be integers from 0 to %d inclusive",
4874 error ("constructor priorities must be integers from 0 to %d inclusive",
4876 return DEFAULT_INIT_PRIORITY
;
4879 /* Handle a "constructor" attribute; arguments as in
4880 struct attribute_spec.handler. */
4883 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
4884 int ARG_UNUSED (flags
),
4888 tree type
= TREE_TYPE (decl
);
4890 if (TREE_CODE (decl
) == FUNCTION_DECL
4891 && TREE_CODE (type
) == FUNCTION_TYPE
4892 && decl_function_context (decl
) == 0)
4894 priority_type priority
;
4895 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4896 priority
= get_priority (args
, /*is_destructor=*/false);
4897 SET_DECL_INIT_PRIORITY (decl
, priority
);
4898 TREE_USED (decl
) = 1;
4902 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4903 *no_add_attrs
= true;
4909 /* Handle a "destructor" attribute; arguments as in
4910 struct attribute_spec.handler. */
4913 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
4914 int ARG_UNUSED (flags
),
4918 tree type
= TREE_TYPE (decl
);
4920 if (TREE_CODE (decl
) == FUNCTION_DECL
4921 && TREE_CODE (type
) == FUNCTION_TYPE
4922 && decl_function_context (decl
) == 0)
4924 priority_type priority
;
4925 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4926 priority
= get_priority (args
, /*is_destructor=*/true);
4927 SET_DECL_FINI_PRIORITY (decl
, priority
);
4928 TREE_USED (decl
) = 1;
4932 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4933 *no_add_attrs
= true;
4939 /* Handle a "mode" attribute; arguments as in
4940 struct attribute_spec.handler. */
4943 handle_mode_attribute (tree
*node
, tree name
, tree args
,
4944 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4948 *no_add_attrs
= true;
4950 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4951 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4955 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4956 int len
= strlen (p
);
4957 enum machine_mode mode
= VOIDmode
;
4961 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4962 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4964 char *newp
= (char *) alloca (len
- 1);
4966 strcpy (newp
, &p
[2]);
4967 newp
[len
- 4] = '\0';
4971 /* Change this type to have a type with the specified mode.
4972 First check for the special modes. */
4973 if (!strcmp (p
, "byte"))
4975 else if (!strcmp (p
, "word"))
4977 else if (!strcmp (p
, "pointer"))
4980 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4981 if (!strcmp (p
, GET_MODE_NAME (j
)))
4983 mode
= (enum machine_mode
) j
;
4987 if (mode
== VOIDmode
)
4989 error ("unknown machine mode %qs", p
);
4994 switch (GET_MODE_CLASS (mode
))
4997 case MODE_PARTIAL_INT
:
4999 case MODE_DECIMAL_FLOAT
:
5000 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
5003 case MODE_COMPLEX_INT
:
5004 case MODE_COMPLEX_FLOAT
:
5005 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
5008 case MODE_VECTOR_INT
:
5009 case MODE_VECTOR_FLOAT
:
5010 warning (OPT_Wattributes
, "specifying vector types with "
5011 "__attribute__ ((mode)) is deprecated");
5012 warning (OPT_Wattributes
,
5013 "use __attribute__ ((vector_size)) instead");
5014 valid_mode
= vector_mode_valid_p (mode
);
5022 error ("unable to emulate %qs", p
);
5026 if (POINTER_TYPE_P (type
))
5028 tree (*fn
)(tree
, enum machine_mode
, bool);
5030 if (!targetm
.valid_pointer_mode (mode
))
5032 error ("invalid pointer mode %qs", p
);
5036 if (TREE_CODE (type
) == POINTER_TYPE
)
5037 fn
= build_pointer_type_for_mode
;
5039 fn
= build_reference_type_for_mode
;
5040 typefm
= fn (TREE_TYPE (type
), mode
, false);
5043 typefm
= lang_hooks
.types
.type_for_mode (mode
, TYPE_UNSIGNED (type
));
5045 if (typefm
== NULL_TREE
)
5047 error ("no data type for mode %qs", p
);
5050 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5052 /* For enumeral types, copy the precision from the integer
5053 type returned above. If not an INTEGER_TYPE, we can't use
5054 this mode for this type. */
5055 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
5057 error ("cannot use mode %qs for enumeral types", p
);
5061 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
5063 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
5068 /* We cannot build a type variant, as there's code that assumes
5069 that TYPE_MAIN_VARIANT has the same mode. This includes the
5070 debug generators. Instead, create a subrange type. This
5071 results in all of the enumeral values being emitted only once
5072 in the original, and the subtype gets them by reference. */
5073 if (TYPE_UNSIGNED (type
))
5074 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
5076 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
5077 TREE_TYPE (typefm
) = type
;
5080 else if (VECTOR_MODE_P (mode
)
5081 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
5082 : TREE_CODE (type
) != TREE_CODE (typefm
))
5084 error ("mode %qs applied to inappropriate type", p
);
5094 /* Handle a "section" attribute; arguments as in
5095 struct attribute_spec.handler. */
5098 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5099 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5103 if (targetm
.have_named_sections
)
5105 user_defined_section_attribute
= true;
5107 if ((TREE_CODE (decl
) == FUNCTION_DECL
5108 || TREE_CODE (decl
) == VAR_DECL
)
5109 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
5111 if (TREE_CODE (decl
) == VAR_DECL
5112 && current_function_decl
!= NULL_TREE
5113 && !TREE_STATIC (decl
))
5115 error ("%Jsection attribute cannot be specified for "
5116 "local variables", decl
);
5117 *no_add_attrs
= true;
5120 /* The decl may have already been given a section attribute
5121 from a previous declaration. Ensure they match. */
5122 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
5123 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
5124 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
5126 error ("section of %q+D conflicts with previous declaration",
5128 *no_add_attrs
= true;
5131 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
5135 error ("section attribute not allowed for %q+D", *node
);
5136 *no_add_attrs
= true;
5141 error ("%Jsection attributes are not supported for this target", *node
);
5142 *no_add_attrs
= true;
5148 /* Handle a "aligned" attribute; arguments as in
5149 struct attribute_spec.handler. */
5152 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5153 int flags
, bool *no_add_attrs
)
5155 tree decl
= NULL_TREE
;
5158 tree align_expr
= (args
? TREE_VALUE (args
)
5159 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5165 type
= &TREE_TYPE (decl
);
5166 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5168 else if (TYPE_P (*node
))
5169 type
= node
, is_type
= 1;
5171 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5173 error ("requested alignment is not a constant");
5174 *no_add_attrs
= true;
5176 else if ((i
= tree_log2 (align_expr
)) == -1)
5178 error ("requested alignment is not a power of 2");
5179 *no_add_attrs
= true;
5181 else if (i
> HOST_BITS_PER_INT
- 2)
5183 error ("requested alignment is too large");
5184 *no_add_attrs
= true;
5188 /* If we have a TYPE_DECL, then copy the type, so that we
5189 don't accidentally modify a builtin type. See pushdecl. */
5190 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5191 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5193 tree tt
= TREE_TYPE (decl
);
5194 *type
= build_variant_type_copy (*type
);
5195 DECL_ORIGINAL_TYPE (decl
) = tt
;
5196 TYPE_NAME (*type
) = decl
;
5197 TREE_USED (*type
) = TREE_USED (decl
);
5198 TREE_TYPE (decl
) = *type
;
5200 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5201 *type
= build_variant_type_copy (*type
);
5203 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5204 TYPE_USER_ALIGN (*type
) = 1;
5206 else if (TREE_CODE (decl
) != VAR_DECL
5207 && TREE_CODE (decl
) != FIELD_DECL
)
5209 error ("alignment may not be specified for %q+D", decl
);
5210 *no_add_attrs
= true;
5214 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5215 DECL_USER_ALIGN (decl
) = 1;
5221 /* Handle a "weak" attribute; arguments as in
5222 struct attribute_spec.handler. */
5225 handle_weak_attribute (tree
*node
, tree name
,
5226 tree
ARG_UNUSED (args
),
5227 int ARG_UNUSED (flags
),
5228 bool * ARG_UNUSED (no_add_attrs
))
5230 if (TREE_CODE (*node
) == FUNCTION_DECL
5231 || TREE_CODE (*node
) == VAR_DECL
)
5232 declare_weak (*node
);
5234 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5240 /* Handle an "alias" attribute; arguments as in
5241 struct attribute_spec.handler. */
5244 handle_alias_attribute (tree
*node
, tree name
, tree args
,
5245 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5249 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
5250 || (TREE_CODE (decl
) != FUNCTION_DECL
5251 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
5252 /* A static variable declaration is always a tentative definition,
5253 but the alias is a non-tentative definition which overrides. */
5254 || (TREE_CODE (decl
) != FUNCTION_DECL
5255 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
5257 error ("%q+D defined both normally and as an alias", decl
);
5258 *no_add_attrs
= true;
5261 /* Note that the very first time we process a nested declaration,
5262 decl_function_context will not be set. Indeed, *would* never
5263 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
5264 we do below. After such frobbery, pushdecl would set the context.
5265 In any case, this is never what we want. */
5266 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
5270 id
= TREE_VALUE (args
);
5271 if (TREE_CODE (id
) != STRING_CST
)
5273 error ("alias argument not a string");
5274 *no_add_attrs
= true;
5277 id
= get_identifier (TREE_STRING_POINTER (id
));
5278 /* This counts as a use of the object pointed to. */
5281 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5282 DECL_INITIAL (decl
) = error_mark_node
;
5285 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
5286 DECL_EXTERNAL (decl
) = 1;
5288 DECL_EXTERNAL (decl
) = 0;
5289 TREE_STATIC (decl
) = 1;
5294 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5295 *no_add_attrs
= true;
5301 /* Handle a "weakref" attribute; arguments as in struct
5302 attribute_spec.handler. */
5305 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5306 int flags
, bool *no_add_attrs
)
5308 tree attr
= NULL_TREE
;
5310 /* We must ignore the attribute when it is associated with
5311 local-scoped decls, since attribute alias is ignored and many
5312 such symbols do not even have a DECL_WEAK field. */
5313 if (decl_function_context (*node
) || current_function_decl
)
5315 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5316 *no_add_attrs
= true;
5320 /* The idea here is that `weakref("name")' mutates into `weakref,
5321 alias("name")', and weakref without arguments, in turn,
5322 implicitly adds weak. */
5326 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
5327 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
5329 *no_add_attrs
= true;
5331 decl_attributes (node
, attr
, flags
);
5335 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
5336 error ("%Jweakref attribute must appear before alias attribute",
5339 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
5340 and that isn't supported; and because it wants to add it to
5341 the list of weak decls, which isn't helpful. */
5342 DECL_WEAK (*node
) = 1;
5348 /* Handle an "visibility" attribute; arguments as in
5349 struct attribute_spec.handler. */
5352 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
5353 int ARG_UNUSED (flags
),
5354 bool *ARG_UNUSED (no_add_attrs
))
5357 tree id
= TREE_VALUE (args
);
5358 enum symbol_visibility vis
;
5362 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
5364 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
5366 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
5370 else if (TYPE_FIELDS (*node
))
5372 error ("%qE attribute ignored because %qT is already defined",
5377 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
5379 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5383 if (TREE_CODE (id
) != STRING_CST
)
5385 error ("visibility argument not a string");
5389 /* If this is a type, set the visibility on the type decl. */
5392 decl
= TYPE_NAME (decl
);
5395 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
5397 warning (OPT_Wattributes
, "%qE attribute ignored on types",
5403 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
5404 vis
= VISIBILITY_DEFAULT
;
5405 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
5406 vis
= VISIBILITY_INTERNAL
;
5407 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
5408 vis
= VISIBILITY_HIDDEN
;
5409 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
5410 vis
= VISIBILITY_PROTECTED
;
5413 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5414 vis
= VISIBILITY_DEFAULT
;
5417 if (DECL_VISIBILITY_SPECIFIED (decl
)
5418 && vis
!= DECL_VISIBILITY (decl
)
5419 && lookup_attribute ("visibility", (TYPE_P (*node
)
5420 ? TYPE_ATTRIBUTES (*node
)
5421 : DECL_ATTRIBUTES (decl
))))
5422 error ("%qD redeclared with different visibility", decl
);
5424 DECL_VISIBILITY (decl
) = vis
;
5425 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5427 /* Go ahead and attach the attribute to the node as well. This is needed
5428 so we can determine whether we have VISIBILITY_DEFAULT because the
5429 visibility was not specified, or because it was explicitly overridden
5430 from the containing scope. */
5435 /* Determine the ELF symbol visibility for DECL, which is either a
5436 variable or a function. It is an error to use this function if a
5437 definition of DECL is not available in this translation unit.
5438 Returns true if the final visibility has been determined by this
5439 function; false if the caller is free to make additional
5443 c_determine_visibility (tree decl
)
5445 gcc_assert (TREE_CODE (decl
) == VAR_DECL
5446 || TREE_CODE (decl
) == FUNCTION_DECL
);
5448 /* If the user explicitly specified the visibility with an
5449 attribute, honor that. DECL_VISIBILITY will have been set during
5450 the processing of the attribute. We check for an explicit
5451 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5452 to distinguish the use of an attribute from the use of a "#pragma
5453 GCC visibility push(...)"; in the latter case we still want other
5454 considerations to be able to overrule the #pragma. */
5455 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
)))
5458 /* Anything that is exported must have default visibility. */
5459 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5460 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))
5462 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5463 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5467 /* Set default visibility to whatever the user supplied with
5468 visibility_specified depending on #pragma GCC visibility. */
5469 if (!DECL_VISIBILITY_SPECIFIED (decl
))
5471 DECL_VISIBILITY (decl
) = default_visibility
;
5472 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
5477 /* Handle an "tls_model" attribute; arguments as in
5478 struct attribute_spec.handler. */
5481 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
5482 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5486 enum tls_model kind
;
5488 *no_add_attrs
= true;
5490 if (!DECL_THREAD_LOCAL_P (decl
))
5492 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5496 kind
= DECL_TLS_MODEL (decl
);
5497 id
= TREE_VALUE (args
);
5498 if (TREE_CODE (id
) != STRING_CST
)
5500 error ("tls_model argument not a string");
5504 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
5505 kind
= TLS_MODEL_LOCAL_EXEC
;
5506 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
5507 kind
= TLS_MODEL_INITIAL_EXEC
;
5508 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
5509 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
5510 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
5511 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
5513 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5515 DECL_TLS_MODEL (decl
) = kind
;
5519 /* Handle a "no_instrument_function" attribute; arguments as in
5520 struct attribute_spec.handler. */
5523 handle_no_instrument_function_attribute (tree
*node
, tree name
,
5524 tree
ARG_UNUSED (args
),
5525 int ARG_UNUSED (flags
),
5530 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5532 error ("%J%qE attribute applies only to functions", decl
, name
);
5533 *no_add_attrs
= true;
5535 else if (DECL_INITIAL (decl
))
5537 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5538 *no_add_attrs
= true;
5541 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5546 /* Handle a "malloc" attribute; arguments as in
5547 struct attribute_spec.handler. */
5550 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5551 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5553 if (TREE_CODE (*node
) == FUNCTION_DECL
5554 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
5555 DECL_IS_MALLOC (*node
) = 1;
5558 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5559 *no_add_attrs
= true;
5565 /* Handle a "alloc_size" attribute; arguments as in
5566 struct attribute_spec.handler. */
5569 handle_alloc_size_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5570 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5572 tree params
= TYPE_ARG_TYPES (*node
);
5573 unsigned arg_count
= 0;
5575 for (; TREE_CHAIN (params
); params
= TREE_CHAIN (params
))
5578 for (; args
; args
= TREE_CHAIN (args
))
5580 tree position
= TREE_VALUE (args
);
5582 if (TREE_CODE (position
) != INTEGER_CST
5583 || TREE_INT_CST_HIGH (position
)
5584 || TREE_INT_CST_LOW (position
) < 1
5585 || TREE_INT_CST_LOW (position
) > arg_count
)
5587 warning (OPT_Wattributes
,
5588 "alloc_size parameter outside range");
5589 *no_add_attrs
= true;
5596 /* Handle a "returns_twice" attribute; arguments as in
5597 struct attribute_spec.handler. */
5600 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5601 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5603 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5604 DECL_IS_RETURNS_TWICE (*node
) = 1;
5607 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5608 *no_add_attrs
= true;
5614 /* Handle a "no_limit_stack" attribute; arguments as in
5615 struct attribute_spec.handler. */
5618 handle_no_limit_stack_attribute (tree
*node
, tree name
,
5619 tree
ARG_UNUSED (args
),
5620 int ARG_UNUSED (flags
),
5625 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5627 error ("%J%qE attribute applies only to functions", decl
, name
);
5628 *no_add_attrs
= true;
5630 else if (DECL_INITIAL (decl
))
5632 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5633 *no_add_attrs
= true;
5636 DECL_NO_LIMIT_STACK (decl
) = 1;
5641 /* Handle a "pure" attribute; arguments as in
5642 struct attribute_spec.handler. */
5645 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5646 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5648 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5649 DECL_IS_PURE (*node
) = 1;
5650 /* ??? TODO: Support types. */
5653 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5654 *no_add_attrs
= true;
5660 /* Handle a "no vops" attribute; arguments as in
5661 struct attribute_spec.handler. */
5664 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5665 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5666 bool *ARG_UNUSED (no_add_attrs
))
5668 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
5669 DECL_IS_NOVOPS (*node
) = 1;
5673 /* Handle a "deprecated" attribute; arguments as in
5674 struct attribute_spec.handler. */
5677 handle_deprecated_attribute (tree
*node
, tree name
,
5678 tree
ARG_UNUSED (args
), int flags
,
5681 tree type
= NULL_TREE
;
5683 tree what
= NULL_TREE
;
5688 type
= TREE_TYPE (decl
);
5690 if (TREE_CODE (decl
) == TYPE_DECL
5691 || TREE_CODE (decl
) == PARM_DECL
5692 || TREE_CODE (decl
) == VAR_DECL
5693 || TREE_CODE (decl
) == FUNCTION_DECL
5694 || TREE_CODE (decl
) == FIELD_DECL
)
5695 TREE_DEPRECATED (decl
) = 1;
5699 else if (TYPE_P (*node
))
5701 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5702 *node
= build_variant_type_copy (*node
);
5703 TREE_DEPRECATED (*node
) = 1;
5711 *no_add_attrs
= true;
5712 if (type
&& TYPE_NAME (type
))
5714 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5715 what
= TYPE_NAME (*node
);
5716 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5717 && DECL_NAME (TYPE_NAME (type
)))
5718 what
= DECL_NAME (TYPE_NAME (type
));
5721 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
5723 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5729 /* Handle a "vector_size" attribute; arguments as in
5730 struct attribute_spec.handler. */
5733 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5734 int ARG_UNUSED (flags
),
5737 unsigned HOST_WIDE_INT vecsize
, nunits
;
5738 enum machine_mode orig_mode
;
5739 tree type
= *node
, new_type
, size
;
5741 *no_add_attrs
= true;
5743 size
= TREE_VALUE (args
);
5745 if (!host_integerp (size
, 1))
5747 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5751 /* Get the vector size (in bytes). */
5752 vecsize
= tree_low_cst (size
, 1);
5754 /* We need to provide for vector pointers, vector arrays, and
5755 functions returning vectors. For example:
5757 __attribute__((vector_size(16))) short *foo;
5759 In this case, the mode is SI, but the type being modified is
5760 HI, so we need to look further. */
5762 while (POINTER_TYPE_P (type
)
5763 || TREE_CODE (type
) == FUNCTION_TYPE
5764 || TREE_CODE (type
) == METHOD_TYPE
5765 || TREE_CODE (type
) == ARRAY_TYPE
)
5766 type
= TREE_TYPE (type
);
5768 /* Get the mode of the type being modified. */
5769 orig_mode
= TYPE_MODE (type
);
5771 if (TREE_CODE (type
) == RECORD_TYPE
5772 || TREE_CODE (type
) == UNION_TYPE
5773 || TREE_CODE (type
) == VECTOR_TYPE
5774 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
5775 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5776 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
5778 error ("invalid vector type for attribute %qE", name
);
5782 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
5784 error ("vector size not an integral multiple of component size");
5790 error ("zero vector size");
5794 /* Calculate how many units fit in the vector. */
5795 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5796 if (nunits
& (nunits
- 1))
5798 error ("number of components of the vector not a power of two");
5802 new_type
= build_vector_type (type
, nunits
);
5804 /* Build back pointers if needed. */
5805 *node
= reconstruct_complex_type (*node
, new_type
);
5810 /* Handle the "nonnull" attribute. */
5812 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5813 tree args
, int ARG_UNUSED (flags
),
5817 unsigned HOST_WIDE_INT attr_arg_num
;
5819 /* If no arguments are specified, all pointer arguments should be
5820 non-null. Verify a full prototype is given so that the arguments
5821 will have the correct types when we actually check them later. */
5824 if (!TYPE_ARG_TYPES (type
))
5826 error ("nonnull attribute without arguments on a non-prototype");
5827 *no_add_attrs
= true;
5832 /* Argument list specified. Verify that each argument number references
5833 a pointer argument. */
5834 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5837 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
5839 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5841 error ("nonnull argument has invalid operand number (argument %lu)",
5842 (unsigned long) attr_arg_num
);
5843 *no_add_attrs
= true;
5847 argument
= TYPE_ARG_TYPES (type
);
5850 for (ck_num
= 1; ; ck_num
++)
5852 if (!argument
|| ck_num
== arg_num
)
5854 argument
= TREE_CHAIN (argument
);
5858 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5860 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5861 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5862 *no_add_attrs
= true;
5866 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5868 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5869 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5870 *no_add_attrs
= true;
5879 /* Check the argument list of a function call for null in argument slots
5880 that are marked as requiring a non-null pointer argument. The NARGS
5881 arguments are passed in the array ARGARRAY.
5885 check_function_nonnull (tree attrs
, int nargs
, tree
*argarray
)
5890 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5892 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5894 args
= TREE_VALUE (a
);
5896 /* Walk the argument list. If we encounter an argument number we
5897 should check for non-null, do it. If the attribute has no args,
5898 then every pointer argument is checked (in which case the check
5899 for pointer type is done in check_nonnull_arg). */
5900 for (i
= 0; i
< nargs
; i
++)
5902 if (!args
|| nonnull_check_p (args
, i
+ 1))
5903 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5911 /* Check that the Nth argument of a function call (counting backwards
5912 from the end) is a (pointer)0. The NARGS arguments are passed in the
5916 check_function_sentinel (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
5918 tree attr
= lookup_attribute ("sentinel", attrs
);
5926 /* Skip over the named arguments. */
5927 while (typelist
&& len
< nargs
)
5929 typelist
= TREE_CHAIN (typelist
);
5933 if (TREE_VALUE (attr
))
5935 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5936 pos
= TREE_INT_CST_LOW (p
);
5939 /* The sentinel must be one of the varargs, i.e.
5940 in position >= the number of fixed arguments. */
5941 if ((nargs
- 1 - pos
) < len
)
5943 warning (OPT_Wformat
,
5944 "not enough variable arguments to fit a sentinel");
5948 /* Validate the sentinel. */
5949 sentinel
= argarray
[nargs
- 1 - pos
];
5950 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel
))
5951 || !integer_zerop (sentinel
))
5952 /* Although __null (in C++) is only an integer we allow it
5953 nevertheless, as we are guaranteed that it's exactly
5954 as wide as a pointer, and we don't want to force
5955 users to cast the NULL they have written there.
5956 We warn with -Wstrict-null-sentinel, though. */
5957 && (warn_strict_null_sentinel
|| null_node
!= sentinel
))
5958 warning (OPT_Wformat
, "missing sentinel in function call");
5962 /* Helper for check_function_nonnull; given a list of operands which
5963 must be non-null in ARGS, determine if operand PARAM_NUM should be
5967 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5969 unsigned HOST_WIDE_INT arg_num
= 0;
5971 for (; args
; args
= TREE_CHAIN (args
))
5973 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5977 if (arg_num
== param_num
)
5983 /* Check that the function argument PARAM (which is operand number
5984 PARAM_NUM) is non-null. This is called by check_function_nonnull
5985 via check_function_arguments_recurse. */
5988 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
5989 unsigned HOST_WIDE_INT param_num
)
5991 /* Just skip checking the argument if it's not a pointer. This can
5992 happen if the "nonnull" attribute was given without an operand
5993 list (which means to check every pointer argument). */
5995 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5998 if (integer_zerop (param
))
5999 warning (OPT_Wnonnull
, "null argument where non-null required "
6000 "(argument %lu)", (unsigned long) param_num
);
6003 /* Helper for nonnull attribute handling; fetch the operand number
6004 from the attribute argument list. */
6007 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
6009 /* Verify the arg number is a constant. */
6010 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
6011 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
6014 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
6018 /* Handle a "nothrow" attribute; arguments as in
6019 struct attribute_spec.handler. */
6022 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
6023 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6025 if (TREE_CODE (*node
) == FUNCTION_DECL
)
6026 TREE_NOTHROW (*node
) = 1;
6027 /* ??? TODO: Support types. */
6030 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6031 *no_add_attrs
= true;
6037 /* Handle a "cleanup" attribute; arguments as in
6038 struct attribute_spec.handler. */
6041 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
6042 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6045 tree cleanup_id
, cleanup_decl
;
6047 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
6048 for global destructors in C++. This requires infrastructure that
6049 we don't have generically at the moment. It's also not a feature
6050 we'd be missing too much, since we do have attribute constructor. */
6051 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
6053 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6054 *no_add_attrs
= true;
6058 /* Verify that the argument is a function in scope. */
6059 /* ??? We could support pointers to functions here as well, if
6060 that was considered desirable. */
6061 cleanup_id
= TREE_VALUE (args
);
6062 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
6064 error ("cleanup argument not an identifier");
6065 *no_add_attrs
= true;
6068 cleanup_decl
= lookup_name (cleanup_id
);
6069 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
6071 error ("cleanup argument not a function");
6072 *no_add_attrs
= true;
6076 /* That the function has proper type is checked with the
6077 eventual call to build_function_call. */
6082 /* Handle a "warn_unused_result" attribute. No special handling. */
6085 handle_warn_unused_result_attribute (tree
*node
, tree name
,
6086 tree
ARG_UNUSED (args
),
6087 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6089 /* Ignore the attribute for functions not returning any value. */
6090 if (VOID_TYPE_P (TREE_TYPE (*node
)))
6092 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
6093 *no_add_attrs
= true;
6099 /* Handle a "sentinel" attribute. */
6102 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
6103 int ARG_UNUSED (flags
), bool *no_add_attrs
)
6105 tree params
= TYPE_ARG_TYPES (*node
);
6109 warning (OPT_Wattributes
,
6110 "%qE attribute requires prototypes with named arguments", name
);
6111 *no_add_attrs
= true;
6115 while (TREE_CHAIN (params
))
6116 params
= TREE_CHAIN (params
);
6118 if (VOID_TYPE_P (TREE_VALUE (params
)))
6120 warning (OPT_Wattributes
,
6121 "%qE attribute only applies to variadic functions", name
);
6122 *no_add_attrs
= true;
6128 tree position
= TREE_VALUE (args
);
6130 if (TREE_CODE (position
) != INTEGER_CST
)
6132 warning (OPT_Wattributes
,
6133 "requested position is not an integer constant");
6134 *no_add_attrs
= true;
6138 if (tree_int_cst_lt (position
, integer_zero_node
))
6140 warning (OPT_Wattributes
,
6141 "requested position is less than zero");
6142 *no_add_attrs
= true;
6150 /* Check for valid arguments being passed to a function.
6151 ATTRS is a list of attributes. There are NARGS arguments in the array
6152 ARGARRAY. TYPELIST is the list of argument types for the function.
6155 check_function_arguments (tree attrs
, int nargs
, tree
*argarray
, tree typelist
)
6157 /* Check for null being passed in a pointer argument that must be
6158 non-null. We also need to do this if format checking is enabled. */
6161 check_function_nonnull (attrs
, nargs
, argarray
);
6163 /* Check for errors in format strings. */
6165 if (warn_format
|| warn_missing_format_attribute
)
6166 check_function_format (attrs
, nargs
, argarray
);
6169 check_function_sentinel (attrs
, nargs
, argarray
, typelist
);
6172 /* Generic argument checking recursion routine. PARAM is the argument to
6173 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6174 once the argument is resolved. CTX is context for the callback. */
6176 check_function_arguments_recurse (void (*callback
)
6177 (void *, tree
, unsigned HOST_WIDE_INT
),
6178 void *ctx
, tree param
,
6179 unsigned HOST_WIDE_INT param_num
)
6181 if ((TREE_CODE (param
) == NOP_EXPR
|| TREE_CODE (param
) == CONVERT_EXPR
)
6182 && (TYPE_PRECISION (TREE_TYPE (param
))
6183 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
6185 /* Strip coercion. */
6186 check_function_arguments_recurse (callback
, ctx
,
6187 TREE_OPERAND (param
, 0), param_num
);
6191 if (TREE_CODE (param
) == CALL_EXPR
)
6193 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
6195 bool found_format_arg
= false;
6197 /* See if this is a call to a known internationalization function
6198 that modifies a format arg. Such a function may have multiple
6199 format_arg attributes (for example, ngettext). */
6201 for (attrs
= TYPE_ATTRIBUTES (type
);
6203 attrs
= TREE_CHAIN (attrs
))
6204 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
6207 tree format_num_expr
;
6210 call_expr_arg_iterator iter
;
6212 /* Extract the argument number, which was previously checked
6214 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
6216 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
6217 && !TREE_INT_CST_HIGH (format_num_expr
));
6219 format_num
= TREE_INT_CST_LOW (format_num_expr
);
6221 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
6223 inner_arg
= next_call_expr_arg (&iter
), i
++)
6224 if (i
== format_num
)
6226 check_function_arguments_recurse (callback
, ctx
,
6227 inner_arg
, param_num
);
6228 found_format_arg
= true;
6233 /* If we found a format_arg attribute and did a recursive check,
6234 we are done with checking this argument. Otherwise, we continue
6235 and this will be considered a non-literal. */
6236 if (found_format_arg
)
6240 if (TREE_CODE (param
) == COND_EXPR
)
6242 /* Check both halves of the conditional expression. */
6243 check_function_arguments_recurse (callback
, ctx
,
6244 TREE_OPERAND (param
, 1), param_num
);
6245 check_function_arguments_recurse (callback
, ctx
,
6246 TREE_OPERAND (param
, 2), param_num
);
6250 (*callback
) (ctx
, param
, param_num
);
6253 /* Function to help qsort sort FIELD_DECLs by name order. */
6256 field_decl_cmp (const void *x_p
, const void *y_p
)
6258 const tree
*const x
= (const tree
*const) x_p
;
6259 const tree
*const y
= (const tree
*const) y_p
;
6261 if (DECL_NAME (*x
) == DECL_NAME (*y
))
6262 /* A nontype is "greater" than a type. */
6263 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
6264 if (DECL_NAME (*x
) == NULL_TREE
)
6266 if (DECL_NAME (*y
) == NULL_TREE
)
6268 if (DECL_NAME (*x
) < DECL_NAME (*y
))
6274 gt_pointer_operator new_value
;
6278 /* This routine compares two fields like field_decl_cmp but using the
6279 pointer operator in resort_data. */
6282 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
6284 const tree
*const x
= (const tree
*const) x_p
;
6285 const tree
*const y
= (const tree
*const) y_p
;
6287 if (DECL_NAME (*x
) == DECL_NAME (*y
))
6288 /* A nontype is "greater" than a type. */
6289 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
6290 if (DECL_NAME (*x
) == NULL_TREE
)
6292 if (DECL_NAME (*y
) == NULL_TREE
)
6295 tree d1
= DECL_NAME (*x
);
6296 tree d2
= DECL_NAME (*y
);
6297 resort_data
.new_value (&d1
, resort_data
.cookie
);
6298 resort_data
.new_value (&d2
, resort_data
.cookie
);
6305 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
6308 resort_sorted_fields (void *obj
,
6309 void * ARG_UNUSED (orig_obj
),
6310 gt_pointer_operator new_value
,
6313 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
6314 resort_data
.new_value
= new_value
;
6315 resort_data
.cookie
= cookie
;
6316 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
6317 resort_field_decl_cmp
);
6320 /* Subroutine of c_parse_error.
6321 Return the result of concatenating LHS and RHS. RHS is really
6322 a string literal, its first character is indicated by RHS_START and
6323 RHS_SIZE is its length (including the terminating NUL character).
6325 The caller is responsible for deleting the returned pointer. */
6328 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
6330 const int lhs_size
= strlen (lhs
);
6331 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
6332 strncpy (result
, lhs
, lhs_size
);
6333 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
6337 /* Issue the error given by GMSGID, indicating that it occurred before
6338 TOKEN, which had the associated VALUE. */
6341 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
6343 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6345 char *message
= NULL
;
6347 if (token
== CPP_EOF
)
6348 message
= catenate_messages (gmsgid
, " at end of input");
6349 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
)
6351 unsigned int val
= TREE_INT_CST_LOW (value
);
6352 const char *const ell
= (token
== CPP_CHAR
) ? "" : "L";
6353 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
6354 message
= catenate_messages (gmsgid
, " before %s'%c'");
6356 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
6358 error (message
, ell
, val
);
6362 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
)
6363 message
= catenate_messages (gmsgid
, " before string constant");
6364 else if (token
== CPP_NUMBER
)
6365 message
= catenate_messages (gmsgid
, " before numeric constant");
6366 else if (token
== CPP_NAME
)
6368 message
= catenate_messages (gmsgid
, " before %qE");
6369 error (message
, value
);
6373 else if (token
== CPP_PRAGMA
)
6374 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
6375 else if (token
== CPP_PRAGMA_EOL
)
6376 message
= catenate_messages (gmsgid
, " before end of line");
6377 else if (token
< N_TTYPES
)
6379 message
= catenate_messages (gmsgid
, " before %qs token");
6380 error (message
, cpp_type2name (token
));
6392 #undef catenate_messages
6395 /* Walk a gimplified function and warn for functions whose return value is
6396 ignored and attribute((warn_unused_result)) is set. This is done before
6397 inlining, so we don't have to worry about that. */
6400 c_warn_unused_result (tree
*top_p
)
6403 tree_stmt_iterator i
;
6406 switch (TREE_CODE (t
))
6408 case STATEMENT_LIST
:
6409 for (i
= tsi_start (*top_p
); !tsi_end_p (i
); tsi_next (&i
))
6410 c_warn_unused_result (tsi_stmt_ptr (i
));
6414 c_warn_unused_result (&COND_EXPR_THEN (t
));
6415 c_warn_unused_result (&COND_EXPR_ELSE (t
));
6418 c_warn_unused_result (&BIND_EXPR_BODY (t
));
6420 case TRY_FINALLY_EXPR
:
6421 case TRY_CATCH_EXPR
:
6422 c_warn_unused_result (&TREE_OPERAND (t
, 0));
6423 c_warn_unused_result (&TREE_OPERAND (t
, 1));
6426 c_warn_unused_result (&CATCH_BODY (t
));
6428 case EH_FILTER_EXPR
:
6429 c_warn_unused_result (&EH_FILTER_FAILURE (t
));
6436 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6437 a MODIFY_EXPR. All calls whose value is ignored should be
6438 represented like this. Look for the attribute. */
6439 fdecl
= get_callee_fndecl (t
);
6441 ftype
= TREE_TYPE (fdecl
);
6444 ftype
= TREE_TYPE (CALL_EXPR_FN (t
));
6445 /* Look past pointer-to-function to the function type itself. */
6446 ftype
= TREE_TYPE (ftype
);
6449 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
6452 warning (0, "%Hignoring return value of %qD, "
6453 "declared with attribute warn_unused_result",
6454 EXPR_LOCUS (t
), fdecl
);
6456 warning (0, "%Hignoring return value of function "
6457 "declared with attribute warn_unused_result",
6463 /* Not a container, not a call, or a call whose value is used. */
6468 /* Convert a character from the host to the target execution character
6469 set. cpplib handles this, mostly. */
6472 c_common_to_target_charset (HOST_WIDE_INT c
)
6474 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6475 zero-extended under -fno-signed-char. cpplib insists that characters
6476 and character constants are always unsigned. Hence we must convert
6478 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
6480 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
6482 if (flag_signed_char
)
6483 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
6484 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
6489 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
6490 component references, with STOP_REF, or alternatively an INDIRECT_REF of
6491 NULL, at the bottom; much like the traditional rendering of offsetof as a
6492 macro. Returns the folded and properly cast result. */
6495 fold_offsetof_1 (tree expr
, tree stop_ref
)
6497 enum tree_code code
= PLUS_EXPR
;
6500 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
6501 return size_zero_node
;
6503 switch (TREE_CODE (expr
))
6509 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
6510 return error_mark_node
;
6513 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6514 return error_mark_node
;
6517 gcc_assert (integer_zerop (expr
));
6518 return size_zero_node
;
6522 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6523 gcc_assert (base
== error_mark_node
|| base
== size_zero_node
);
6527 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6528 if (base
== error_mark_node
)
6531 t
= TREE_OPERAND (expr
, 1);
6532 if (DECL_C_BIT_FIELD (t
))
6534 error ("attempt to take address of bit-field structure "
6536 return error_mark_node
;
6538 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
6539 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
6544 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6545 if (base
== error_mark_node
)
6548 t
= TREE_OPERAND (expr
, 1);
6549 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
6552 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
6554 t
= convert (sizetype
, t
);
6555 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
6559 /* Handle static members of volatile structs. */
6560 t
= TREE_OPERAND (expr
, 1);
6561 gcc_assert (TREE_CODE (t
) == VAR_DECL
);
6562 return fold_offsetof_1 (t
, stop_ref
);
6568 return size_binop (code
, base
, off
);
6572 fold_offsetof (tree expr
, tree stop_ref
)
6574 /* Convert back from the internal sizetype to size_t. */
6575 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
6578 /* Print an error message for an invalid lvalue. USE says
6579 how the lvalue is being used and so selects the error message. */
6582 lvalue_error (enum lvalue_use use
)
6587 error ("lvalue required as left operand of assignment");
6590 error ("lvalue required as increment operand");
6593 error ("lvalue required as decrement operand");
6596 error ("lvalue required as unary %<&%> operand");
6599 error ("lvalue required in asm statement");
6606 /* *PTYPE is an incomplete array. Complete it with a domain based on
6607 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6608 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6609 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6612 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6614 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6615 int failure
= 0, quals
;
6616 hashval_t hashcode
= 0;
6618 maxindex
= size_zero_node
;
6621 if (TREE_CODE (initial_value
) == STRING_CST
)
6624 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6625 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6627 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6629 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
6631 if (VEC_empty (constructor_elt
, v
))
6635 maxindex
= integer_minus_one_node
;
6640 unsigned HOST_WIDE_INT cnt
;
6641 constructor_elt
*ce
;
6643 if (VEC_index (constructor_elt
, v
, 0)->index
)
6644 maxindex
= fold_convert (sizetype
,
6645 VEC_index (constructor_elt
,
6647 curindex
= maxindex
;
6650 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
6654 curindex
= fold_convert (sizetype
, ce
->index
);
6656 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
6658 if (tree_int_cst_lt (maxindex
, curindex
))
6659 maxindex
= curindex
;
6665 /* Make an error message unless that happened already. */
6666 if (initial_value
!= error_mark_node
)
6678 elt
= TREE_TYPE (type
);
6679 quals
= TYPE_QUALS (strip_array_types (elt
));
6683 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
6685 /* Using build_distinct_type_copy and modifying things afterward instead
6686 of using build_array_type to create a new type preserves all of the
6687 TYPE_LANG_FLAG_? bits that the front end may have set. */
6688 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6689 TREE_TYPE (main_type
) = unqual_elt
;
6690 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
6691 layout_type (main_type
);
6693 /* Make sure we have the canonical MAIN_TYPE. */
6694 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
6695 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
6697 main_type
= type_hash_canon (hashcode
, main_type
);
6702 type
= c_build_qualified_type (main_type
, quals
);
6709 /* Used to help initialize the builtin-types.def table. When a type of
6710 the correct size doesn't exist, use error_mark_node instead of NULL.
6711 The later results in segfaults even when a decl using the type doesn't
6715 builtin_type_for_size (int size
, bool unsignedp
)
6717 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
6718 return type
? type
: error_mark_node
;
6721 /* A helper function for resolve_overloaded_builtin in resolving the
6722 overloaded __sync_ builtins. Returns a positive power of 2 if the
6723 first operand of PARAMS is a pointer to a supported data type.
6724 Returns 0 if an error is encountered. */
6727 sync_resolve_size (tree function
, tree params
)
6734 error ("too few arguments to function %qE", function
);
6738 type
= TREE_TYPE (TREE_VALUE (params
));
6739 if (TREE_CODE (type
) != POINTER_TYPE
)
6742 type
= TREE_TYPE (type
);
6743 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6746 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6747 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
6751 error ("incompatible type for argument %d of %qE", 1, function
);
6755 /* A helper function for resolve_overloaded_builtin. Adds casts to
6756 PARAMS to make arguments match up with those of FUNCTION. Drops
6757 the variadic arguments at the end. Returns false if some error
6758 was encountered; true on success. */
6761 sync_resolve_params (tree orig_function
, tree function
, tree params
)
6763 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
6767 /* We've declared the implementation functions to use "volatile void *"
6768 as the pointer parameter, so we shouldn't get any complaints from the
6769 call to check_function_arguments what ever type the user used. */
6770 arg_types
= TREE_CHAIN (arg_types
);
6771 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6774 /* For the rest of the values, we need to cast these to FTYPE, so that we
6775 don't get warnings for passing pointer types, etc. */
6776 while (arg_types
!= void_list_node
)
6780 params
= TREE_CHAIN (params
);
6783 error ("too few arguments to function %qE", orig_function
);
6787 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6788 so that we get warnings for anything that doesn't match the pointer
6789 type. This isn't portable across the C and C++ front ends atm. */
6790 val
= TREE_VALUE (params
);
6791 val
= convert (ptype
, val
);
6792 val
= convert (TREE_VALUE (arg_types
), val
);
6793 TREE_VALUE (params
) = val
;
6795 arg_types
= TREE_CHAIN (arg_types
);
6799 /* The definition of these primitives is variadic, with the remaining
6800 being "an optional list of variables protected by the memory barrier".
6801 No clue what that's supposed to mean, precisely, but we consider all
6802 call-clobbered variables to be protected so we're safe. */
6803 TREE_CHAIN (params
) = NULL
;
6808 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6809 RESULT to make it match the type of the first pointer argument in
6813 sync_resolve_return (tree params
, tree result
)
6815 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6816 ptype
= TYPE_MAIN_VARIANT (ptype
);
6817 return convert (ptype
, result
);
6820 /* Some builtin functions are placeholders for other expressions. This
6821 function should be called immediately after parsing the call expression
6822 before surrounding code has committed to the type of the expression.
6824 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6825 PARAMS is the argument list for the call. The return value is non-null
6826 when expansion is complete, and null if normal processing should
6830 resolve_overloaded_builtin (tree function
, tree params
)
6832 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
6833 switch (DECL_BUILT_IN_CLASS (function
))
6835 case BUILT_IN_NORMAL
:
6838 if (targetm
.resolve_overloaded_builtin
)
6839 return targetm
.resolve_overloaded_builtin (function
, params
);
6846 /* Handle BUILT_IN_NORMAL here. */
6849 case BUILT_IN_FETCH_AND_ADD_N
:
6850 case BUILT_IN_FETCH_AND_SUB_N
:
6851 case BUILT_IN_FETCH_AND_OR_N
:
6852 case BUILT_IN_FETCH_AND_AND_N
:
6853 case BUILT_IN_FETCH_AND_XOR_N
:
6854 case BUILT_IN_FETCH_AND_NAND_N
:
6855 case BUILT_IN_ADD_AND_FETCH_N
:
6856 case BUILT_IN_SUB_AND_FETCH_N
:
6857 case BUILT_IN_OR_AND_FETCH_N
:
6858 case BUILT_IN_AND_AND_FETCH_N
:
6859 case BUILT_IN_XOR_AND_FETCH_N
:
6860 case BUILT_IN_NAND_AND_FETCH_N
:
6861 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
6862 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
6863 case BUILT_IN_LOCK_TEST_AND_SET_N
:
6864 case BUILT_IN_LOCK_RELEASE_N
:
6866 int n
= sync_resolve_size (function
, params
);
6867 tree new_function
, result
;
6870 return error_mark_node
;
6872 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
6873 if (!sync_resolve_params (function
, new_function
, params
))
6874 return error_mark_node
;
6876 result
= build_function_call (new_function
, params
);
6877 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6878 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
6879 result
= sync_resolve_return (params
, result
);
6889 /* Ignoring their sign, return true if two scalar types are the same. */
6891 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
6893 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
6895 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
6896 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
));
6898 /* Equality works here because c_common_signed_type uses
6899 TYPE_MAIN_VARIANT. */
6900 return c_common_signed_type (t1
)
6901 == c_common_signed_type (t2
);
6904 /* Check for missing format attributes on function pointers. LTYPE is
6905 the new type or left-hand side type. RTYPE is the old type or
6906 right-hand side type. Returns TRUE if LTYPE is missing the desired
6910 check_missing_format_attribute (tree ltype
, tree rtype
)
6912 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
6915 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
6916 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
6921 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
6922 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
6930 /* Subscripting with type char is likely to lose on a machine where
6931 chars are signed. So warn on any machine, but optionally. Don't
6932 warn for unsigned char since that type is safe. Don't warn for
6933 signed char because anyone who uses that must have done so
6934 deliberately. Furthermore, we reduce the false positive load by
6935 warning only for non-constant value of type char. */
6938 warn_array_subscript_with_type_char (tree index
)
6940 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
6941 && TREE_CODE (index
) != INTEGER_CST
)
6942 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
6945 /* Implement -Wparentheses for the unexpected C precedence rules, to
6946 cover cases like x + y << z which readers are likely to
6947 misinterpret. We have seen an expression in which CODE is a binary
6948 operator used to combine expressions headed by CODE_LEFT and
6949 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
6950 means that that side of the expression was not formed using a
6951 binary operator, or it was enclosed in parentheses. */
6954 warn_about_parentheses (enum tree_code code
, enum tree_code code_left
,
6955 enum tree_code code_right
)
6957 if (!warn_parentheses
)
6960 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
6962 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6963 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6964 warning (OPT_Wparentheses
,
6965 "suggest parentheses around + or - inside shift");
6968 if (code
== TRUTH_ORIF_EXPR
)
6970 if (code_left
== TRUTH_ANDIF_EXPR
6971 || code_right
== TRUTH_ANDIF_EXPR
)
6972 warning (OPT_Wparentheses
,
6973 "suggest parentheses around && within ||");
6976 if (code
== BIT_IOR_EXPR
)
6978 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
6979 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6980 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
6981 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6982 warning (OPT_Wparentheses
,
6983 "suggest parentheses around arithmetic in operand of |");
6984 /* Check cases like x|y==z */
6985 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6986 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6987 warning (OPT_Wparentheses
,
6988 "suggest parentheses around comparison in operand of |");
6991 if (code
== BIT_XOR_EXPR
)
6993 if (code_left
== BIT_AND_EXPR
6994 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6995 || code_right
== BIT_AND_EXPR
6996 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6997 warning (OPT_Wparentheses
,
6998 "suggest parentheses around arithmetic in operand of ^");
6999 /* Check cases like x^y==z */
7000 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
7001 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
7002 warning (OPT_Wparentheses
,
7003 "suggest parentheses around comparison in operand of ^");
7006 if (code
== BIT_AND_EXPR
)
7008 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
7009 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
7010 warning (OPT_Wparentheses
,
7011 "suggest parentheses around + or - in operand of &");
7012 /* Check cases like x&y==z */
7013 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
7014 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
7015 warning (OPT_Wparentheses
,
7016 "suggest parentheses around comparison in operand of &");
7019 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
7021 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
7022 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
7023 warning (OPT_Wparentheses
,
7024 "suggest parentheses around comparison in operand of %s",
7025 code
== EQ_EXPR
? "==" : "!=");
7027 else if (TREE_CODE_CLASS (code
) == tcc_comparison
)
7029 if ((TREE_CODE_CLASS (code_left
) == tcc_comparison
7030 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
)
7031 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
7032 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
))
7033 warning (OPT_Wparentheses
, "comparisons like X<=Y<=Z do not "
7034 "have their mathematical meaning");
7038 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
7041 warn_for_unused_label (tree label
)
7043 if (!TREE_USED (label
))
7045 if (DECL_INITIAL (label
))
7046 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
7048 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
7052 #ifndef TARGET_HAS_TARGETCM
7053 struct gcc_targetcm targetcm
= TARGETCM_INITIALIZER
;
7056 /* Warn for division by zero according to the value of DIVISOR. */
7059 warn_for_div_by_zero (tree divisor
)
7061 /* If DIVISOR is zero, and has integral type, issue a warning about
7062 division by zero. Do not issue a warning if DIVISOR has a
7063 floating-point type, since we consider 0.0/0.0 a valid way of
7064 generating a NaN. */
7065 if (skip_evaluation
== 0 && integer_zerop (divisor
))
7066 warning (OPT_Wdiv_by_zero
, "division by zero");
7069 #include "gt-c-common.h"