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 /* Nonzero if we want to allow the use of experimental features that
410 are likely to become part of C++0x. */
414 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
415 initialization variables.
416 0: Old rules, set by -fno-for-scope.
417 2: New ISO rules, set by -ffor-scope.
418 1: Try to implement new ISO rules, but with backup compatibility
419 (and warnings). This is the default, for now. */
421 int flag_new_for_scope = 1;
423 /* Nonzero if we want to emit defined symbols with common-like linkage as
424 weak symbols where possible, in order to conform to C++ semantics.
425 Otherwise, emit them as local symbols. */
429 /* 0 means we want the preprocessor to not emit line directives for
430 the current working directory. 1 means we want it to do it. -1
431 means we should decide depending on whether debugging information
432 is being emitted or not. */
434 int flag_working_directory = -1;
436 /* Nonzero to use __cxa_atexit, rather than atexit, to register
437 destructors for local statics and global objects. '2' means it has been
438 set nonzero as a default, not by a command-line flag. */
440 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
442 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
443 code. '2' means it has not been set explicitly on the command line. */
445 int flag_use_cxa_get_exception_ptr = 2;
447 /* Nonzero means make the default pedwarns warnings instead of errors.
448 The value of this flag is ignored if -pedantic is specified. */
452 /* Nonzero means to implement standard semantics for exception
453 specifications, calling unexpected if an exception is thrown that
454 doesn't match the specification. Zero means to treat them as
455 assertions and optimize accordingly, but not check them. */
457 int flag_enforce_eh_specs = 1;
459 /* Nonzero means to generate thread-safe code for initializing local
462 int flag_threadsafe_statics = 1;
464 /* Nonzero means warn about implicit declarations. */
466 int warn_implicit = 1;
468 /* Maximum template instantiation depth. This limit is rather
469 arbitrary, but it exists to limit the time it takes to notice
470 infinite template instantiations. */
472 int max_tinst_depth = 500;
476 /* The elements of `ridpointers' are identifier nodes for the reserved
477 type names and storage classes. It is indexed by a RID_... value. */
480 tree (*make_fname_decl) (tree, int);
482 /* Nonzero means the expression being parsed will never be evaluated.
483 This is a count, since unevaluated expressions can nest. */
486 /* Information about how a function name is generated. */
489 tree *const decl; /* pointer to the VAR_DECL. */
490 const unsigned rid; /* RID number for the identifier. */
491 const int pretty; /* How pretty is it? */
494 /* The three ways of getting then name of the current function. */
496 const struct fname_var_t fname_vars[] =
498 /* C99 compliant __func__, must be first. */
499 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
500 /* GCC __FUNCTION__ compliant. */
501 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
502 /* GCC __PRETTY_FUNCTION__ compliant. */
503 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
507 static tree check_case_value (tree);
508 static bool check_case_bounds (tree, tree, tree *, tree *);
510 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
511 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
512 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
513 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
514 static tree handle_hot_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_cold_attribute (tree *, tree, tree, int, bool *);
516 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
517 static tree handle_always_inline_attribute (tree *, tree, tree, int,
519 static tree handle_gnu_inline_attribute (tree *, tree, tree, int,
521 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
522 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
526 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_transparent_union_attribute (tree *, tree, tree,
529 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
532 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
534 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
535 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
536 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
537 static tree handle_visibility_attribute (tree *, tree, tree, int,
539 static tree handle_tls_model_attribute (tree *, tree, tree, int,
541 static tree handle_no_instrument_function_attribute (tree *, tree,
543 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
544 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
545 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
547 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
548 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
549 static tree handle_deprecated_attribute (tree *, tree, tree, int,
551 static tree handle_vector_size_attribute (tree *, tree, tree, int,
553 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
554 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
555 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
556 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
558 static tree handle_sentinel_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 { "cold", 0, 0, true, false, false,
654 handle_cold_attribute },
655 { "hot", 0, 0, true, false, false,
656 handle_hot_attribute },
657 { NULL, 0, 0, false, false, false, NULL }
660 /* Give the specifications for the format attributes, used by C and all
663 const struct attribute_spec c_common_format_attribute_table[] =
665 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
666 { "format", 3, 3, false, true, true,
667 handle_format_attribute },
668 { "format_arg", 1, 1, false, true, true,
669 handle_format_arg_attribute },
670 { NULL, 0, 0, false, false, false, NULL }
673 /* Functions called automatically at the beginning and end of execution. */
678 /* Push current bindings for the function name VAR_DECLS. */
681 start_fname_decls (void)
684 tree saved = NULL_TREE;
686 for (ix = 0; fname_vars[ix].decl; ix++)
688 tree decl = *fname_vars[ix].decl;
692 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
693 *fname_vars[ix].decl = NULL_TREE;
696 if (saved || saved_function_name_decls)
697 /* Normally they'll have been NULL, so only push if we've got a
698 stack, or they are non-NULL. */
699 saved_function_name_decls = tree_cons (saved, NULL_TREE,
700 saved_function_name_decls);
703 /* Finish up the current bindings, adding them into the current function's
704 statement tree. This must be done _before_ finish_stmt_tree is called.
705 If there is no current function, we must be at file scope and no statements
706 are involved. Pop the previous bindings. */
709 finish_fname_decls (void)
712 tree stmts = NULL_TREE;
713 tree stack = saved_function_name_decls;
715 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
716 append_to_statement_list (TREE_VALUE (stack), &stmts);
720 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
722 if (TREE_CODE (*bodyp) == BIND_EXPR)
723 bodyp = &BIND_EXPR_BODY (*bodyp);
725 append_to_statement_list_force (*bodyp, &stmts);
729 for (ix = 0; fname_vars[ix].decl; ix++)
730 *fname_vars[ix].decl = NULL_TREE;
734 /* We had saved values, restore them. */
737 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
739 tree decl = TREE_PURPOSE (saved);
740 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
742 *fname_vars[ix].decl = decl;
744 stack = TREE_CHAIN (stack);
746 saved_function_name_decls = stack;
749 /* Return the text name of the current function, suitably prettified
750 by PRETTY_P. Return string must be freed by caller. */
753 fname_as_string (int pretty_p)
755 const char *name = "top level";
765 if (current_function_decl)
766 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
768 if (c_lex_string_translate)
770 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
771 cpp_string cstr = { 0, 0 }, strname;
773 namep = XNEWVEC (char, len);
774 snprintf (namep, len, "\"%s\"", name);
775 strname.text = (unsigned char *) namep;
776 strname.len = len - 1;
778 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
781 return (char *) cstr.text;
785 namep = xstrdup (name);
790 /* Expand DECL if it declares an entity not handled by the
794 c_expand_decl (tree decl)
796 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
798 /* Let the back-end know about this variable. */
799 if (!anon_aggr_type_p (TREE_TYPE (decl)))
800 emit_local_var (decl);
802 expand_anon_union_decl (decl, NULL_TREE,
803 DECL_ANON_UNION_ELEMS (decl));
812 /* Return the VAR_DECL for a const char array naming the current
813 function. If the VAR_DECL has not yet been created, create it
814 now. RID indicates how it should be formatted and IDENTIFIER_NODE
815 ID is its name (unfortunately C and C++ hold the RID values of
816 keywords in different places, so we can't derive RID from ID in
817 this language independent code. */
820 fname_decl (unsigned int rid, tree id)
823 tree decl = NULL_TREE;
825 for (ix = 0; fname_vars[ix].decl; ix++)
826 if (fname_vars[ix].rid == rid)
829 decl = *fname_vars[ix].decl;
832 /* If a tree is built here, it would normally have the lineno of
833 the current statement. Later this tree will be moved to the
834 beginning of the function and this line number will be wrong.
835 To avoid this problem set the lineno to 0 here; that prevents
836 it from appearing in the RTL. */
838 location_t saved_location = input_location;
839 #ifdef USE_MAPPED_LOCATION
840 input_location = UNKNOWN_LOCATION;
845 stmts = push_stmt_list ();
846 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
847 stmts = pop_stmt_list (stmts);
848 if (!IS_EMPTY_STMT (stmts))
849 saved_function_name_decls
850 = tree_cons (decl, stmts, saved_function_name_decls);
851 *fname_vars[ix].decl = decl;
852 input_location = saved_location;
854 if (!ix && !current_function_decl)
855 pedwarn ("%qD is not defined outside of function scope", decl);
860 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
863 fix_string_type (tree value)
865 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
866 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
867 int length = TREE_STRING_LENGTH (value);
869 tree e_type, i_type, a_type;
871 /* Compute the number of elements, for the array type. */
872 nchars = wide_flag ? length / wchar_bytes : length;
874 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
875 limit in C++98 Annex B is very large (65536) and is not normative,
876 so we do not diagnose it (warn_overlength_strings is forced off
877 in c_common_post_options). */
878 if (warn_overlength_strings)
880 const int nchars_max = flag_isoc99 ? 4095 : 509;
881 const int relevant_std = flag_isoc99 ? 99 : 90;
882 if (nchars - 1 > nchars_max)
883 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
884 separate the %d from the 'C'. 'ISO' should not be
885 translated, but it may be moved after 'C%d' in languages
886 where modifiers follow nouns. */
887 pedwarn ("string length %qd is greater than the length %qd "
888 "ISO C%d compilers are required to support",
889 nchars - 1, nchars_max, relevant_std);
892 /* Create the array type for the string constant. The ISO C++
893 standard says that a string literal has type `const char[N]' or
894 `const wchar_t[N]'. We use the same logic when invoked as a C
895 front-end with -Wwrite-strings.
896 ??? We should change the type of an expression depending on the
897 state of a warning flag. We should just be warning -- see how
898 this is handled in the C++ front-end for the deprecated implicit
899 conversion from string literals to `char*' or `wchar_t*'.
901 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
902 array type being the unqualified version of that type.
903 Therefore, if we are constructing an array of const char, we must
904 construct the matching unqualified array type first. The C front
905 end does not require this, but it does no harm, so we do it
907 e_type = wide_flag ? wchar_type_node : char_type_node;
908 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
909 a_type = build_array_type (e_type, i_type);
910 if (c_dialect_cxx() || warn_write_strings)
911 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
913 TREE_TYPE (value) = a_type;
914 TREE_CONSTANT (value) = 1;
915 TREE_INVARIANT (value) = 1;
916 TREE_READONLY (value) = 1;
917 TREE_STATIC (value) = 1;
921 /* Print a warning if a constant expression had overflow in folding.
922 Invoke this function on every expression that the language
923 requires to be a constant expression.
924 Note the ANSI C standard says it is erroneous for a
925 constant expression to overflow. */
928 constant_expression_warning (tree value)
930 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
931 || TREE_CODE (value) == VECTOR_CST
932 || TREE_CODE (value) == COMPLEX_CST)
933 && TREE_OVERFLOW (value)
936 pedwarn ("overflow in constant expression");
939 /* Print a warning if an expression had overflow in folding and its
942 Invoke this function on every expression that
943 (1) appears in the source code, and
944 (2) is a constant expression that overflowed, and
945 (3) is not already checked by convert_and_check;
946 however, do not invoke this function on operands of explicit casts
947 or when the expression is the result of an operator and any operand
948 already overflowed. */
951 overflow_warning (tree value)
953 if (skip_evaluation) return;
955 switch (TREE_CODE (value))
958 warning (OPT_Woverflow, "integer overflow in expression");
962 warning (OPT_Woverflow, "floating point overflow in expression");
966 warning (OPT_Woverflow, "vector overflow in expression");
970 if (TREE_CODE (TREE_REALPART (value)) == INTEGER_CST)
971 warning (OPT_Woverflow, "complex integer overflow in expression");
972 else if (TREE_CODE (TREE_REALPART (value)) == REAL_CST)
973 warning (OPT_Woverflow, "complex floating point overflow in expression");
982 /* Warn about use of a logical || / && operator being used in a
983 context where it is likely that the bitwise equivalent was intended
984 by the programmer. CODE is the TREE_CODE of the operator, ARG1
985 and ARG2 the arguments. */
988 warn_logical_operator (enum tree_code code, tree arg1, tree
993 case TRUTH_ANDIF_EXPR:
994 case TRUTH_ORIF_EXPR:
997 if (!TREE_NO_WARNING (arg1)
998 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
999 && !CONSTANT_CLASS_P (arg1)
1000 && TREE_CODE (arg2) == INTEGER_CST
1001 && !integer_zerop (arg2))
1003 warning (OPT_Wlogical_op,
1004 "logical %<%s%> with non-zero constant "
1005 "will always evaluate as true",
1006 ((code == TRUTH_ANDIF_EXPR)
1007 || (code == TRUTH_AND_EXPR)) ? "&&" : "||");
1008 TREE_NO_WARNING (arg1) = true;
1017 /* Print a warning about casts that might indicate violation
1018 of strict aliasing rules if -Wstrict-aliasing is used and
1019 strict aliasing mode is in effect. OTYPE is the original
1020 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
1023 strict_aliasing_warning (tree otype, tree type, tree expr)
1025 if (flag_strict_aliasing && warn_strict_aliasing
1026 && POINTER_TYPE_P (type) && POINTER_TYPE_P (otype)
1027 && TREE_CODE (expr) == ADDR_EXPR
1028 && (DECL_P (TREE_OPERAND (expr, 0))
1029 || handled_component_p (TREE_OPERAND (expr, 0)))
1030 && !VOID_TYPE_P (TREE_TYPE (type)))
1032 /* Casting the address of an object to non void pointer. Warn
1033 if the cast breaks type based aliasing. */
1034 if (!COMPLETE_TYPE_P (TREE_TYPE (type)))
1035 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
1036 "might break strict-aliasing rules");
1039 HOST_WIDE_INT set1 = get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
1040 HOST_WIDE_INT set2 = get_alias_set (TREE_TYPE (type));
1042 if (!alias_sets_conflict_p (set1, set2))
1043 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1044 "pointer will break strict-aliasing rules");
1045 else if (warn_strict_aliasing > 1
1046 && !alias_sets_might_conflict_p (set1, set2))
1047 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
1048 "pointer might break strict-aliasing rules");
1053 /* Print a warning about if (); or if () .. else; constructs
1054 via the special empty statement node that we create. INNER_THEN
1055 and INNER_ELSE are the statement lists of the if and the else
1059 empty_if_body_warning (tree inner_then, tree inner_else)
1061 if (TREE_CODE (inner_then) == STATEMENT_LIST
1062 && STATEMENT_LIST_TAIL (inner_then))
1063 inner_then = STATEMENT_LIST_TAIL (inner_then)->stmt;
1065 if (inner_else && TREE_CODE (inner_else) == STATEMENT_LIST
1066 && STATEMENT_LIST_TAIL (inner_else))
1067 inner_else = STATEMENT_LIST_TAIL (inner_else)->stmt;
1069 if (IS_EMPTY_STMT (inner_then) && !inner_else)
1070 warning (OPT_Wempty_body, "%Hsuggest braces around empty body "
1071 "in an %<if%> statement", EXPR_LOCUS (inner_then));
1073 else if (inner_else && IS_EMPTY_STMT (inner_else))
1074 warning (OPT_Wempty_body, "%Hsuggest braces around empty body "
1075 "in an %<else%> statement", EXPR_LOCUS (inner_else));
1078 /* Warn for unlikely, improbable, or stupid DECL declarations
1082 check_main_parameter_types (tree decl)
1087 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args;
1088 args = TREE_CHAIN (args))
1090 tree type = args ? TREE_VALUE (args) : 0;
1092 if (type == void_type_node || type == error_mark_node )
1099 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1100 pedwarn ("first argument of %q+D should be %<int%>", decl);
1104 if (TREE_CODE (type) != POINTER_TYPE
1105 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1106 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1108 pedwarn ("second argument of %q+D should be %<char **%>",
1113 if (TREE_CODE (type) != POINTER_TYPE
1114 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1115 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1117 pedwarn ("third argument of %q+D should probably be "
1118 "%<char **%>", decl);
1123 /* It is intentional that this message does not mention the third
1124 argument because it's only mentioned in an appendix of the
1126 if (argct > 0 && (argct < 2 || argct > 3))
1127 pedwarn ("%q+D takes only zero or two arguments", decl);
1130 /* True if vector types T1 and T2 can be converted to each other
1131 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1132 can only be converted with -flax-vector-conversions yet that is not
1133 in effect, emit a note telling the user about that option if such
1134 a note has not previously been emitted. */
1136 vector_types_convertible_p (tree t1, tree t2, bool emit_lax_note)
1138 static bool emitted_lax_note = false;
1139 bool convertible_lax;
1141 if ((targetm.vector_opaque_p (t1) || targetm.vector_opaque_p (t2))
1142 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)))
1146 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1147 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1148 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1149 && (INTEGRAL_TYPE_P (TREE_TYPE (t1))
1150 == INTEGRAL_TYPE_P (TREE_TYPE (t2))));
1152 if (!convertible_lax || flag_lax_vector_conversions)
1153 return convertible_lax;
1155 if (TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1156 && comptypes (TREE_TYPE (t1), TREE_TYPE (t2)))
1159 if (emit_lax_note && !emitted_lax_note)
1161 emitted_lax_note = true;
1162 inform ("use -flax-vector-conversions to permit "
1163 "conversions between vectors with differing "
1164 "element types or numbers of subparts");
1170 /* Warns if the conversion of EXPR to TYPE may alter a value.
1171 This is a helper function for warnings_for_convert_and_check. */
1174 conversion_warning (tree type, tree expr)
1176 bool give_warning = false;
1178 unsigned int formal_prec = TYPE_PRECISION (type);
1180 if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
1182 /* Warn for real constant that is not an exact integer converted
1184 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1185 && TREE_CODE (type) == INTEGER_TYPE)
1187 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (TREE_TYPE (expr))))
1188 give_warning = true;
1190 /* Warn for an integer constant that does not fit into integer type. */
1191 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1192 && TREE_CODE (type) == INTEGER_TYPE
1193 && !int_fits_type_p (expr, type))
1195 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr)))
1196 warning (OPT_Wconversion,
1197 "negative integer implicitly converted to unsigned type");
1199 give_warning = true;
1201 else if (TREE_CODE (type) == REAL_TYPE)
1203 /* Warn for an integer constant that does not fit into real type. */
1204 if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE)
1206 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
1207 if (!exact_real_truncate (TYPE_MODE (type), &a))
1208 give_warning = true;
1210 /* Warn for a real constant that does not fit into a smaller
1212 else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1213 && formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1215 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
1216 if (!exact_real_truncate (TYPE_MODE (type), &a))
1217 give_warning = true;
1222 warning (OPT_Wconversion,
1223 "conversion to %qT alters %qT constant value",
1224 type, TREE_TYPE (expr));
1226 else /* 'expr' is not a constant. */
1228 /* Warn for real types converted to integer types. */
1229 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1230 && TREE_CODE (type) == INTEGER_TYPE)
1231 give_warning = true;
1233 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1234 && TREE_CODE (type) == INTEGER_TYPE)
1236 /* Warn for integer types converted to smaller integer types. */
1237 if (formal_prec < TYPE_PRECISION (TREE_TYPE (expr))
1238 /* When they are the same width but different signedness,
1239 then the value may change. */
1240 || (formal_prec == TYPE_PRECISION (TREE_TYPE (expr))
1241 && TYPE_UNSIGNED (TREE_TYPE (expr)) != TYPE_UNSIGNED (type))
1242 /* Even when converted to a bigger type, if the type is
1243 unsigned but expr is signed, then negative values
1245 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr))))
1246 give_warning = true;
1249 /* Warn for integer types converted to real types if and only if
1250 all the range of values of the integer type cannot be
1251 represented by the real type. */
1252 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1253 && TREE_CODE (type) == REAL_TYPE)
1255 tree type_low_bound = TYPE_MIN_VALUE (TREE_TYPE (expr));
1256 tree type_high_bound = TYPE_MAX_VALUE (TREE_TYPE (expr));
1257 REAL_VALUE_TYPE real_low_bound = real_value_from_int_cst (0, type_low_bound);
1258 REAL_VALUE_TYPE real_high_bound = real_value_from_int_cst (0, type_high_bound);
1260 if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound)
1261 || !exact_real_truncate (TYPE_MODE (type), &real_high_bound))
1262 give_warning = true;
1265 /* Warn for real types converted to smaller real types. */
1266 else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1267 && TREE_CODE (type) == REAL_TYPE
1268 && formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1269 give_warning = true;
1273 warning (OPT_Wconversion,
1274 "conversion to %qT from %qT may alter its value",
1275 type, TREE_TYPE (expr));
1279 /* Produce warnings after a conversion. RESULT is the result of
1280 converting EXPR to TYPE. This is a helper function for
1281 convert_and_check and cp_convert_and_check. */
1284 warnings_for_convert_and_check (tree type, tree expr, tree result)
1286 if (TREE_CODE (expr) == INTEGER_CST
1287 && (TREE_CODE (type) == INTEGER_TYPE
1288 || TREE_CODE (type) == ENUMERAL_TYPE)
1289 && !int_fits_type_p (expr, type))
1291 /* Do not diagnose overflow in a constant expression merely
1292 because a conversion overflowed. */
1293 if (TREE_OVERFLOW (result))
1294 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
1296 if (TYPE_UNSIGNED (type))
1298 /* This detects cases like converting -129 or 256 to
1300 if (!int_fits_type_p (expr, c_common_signed_type (type)))
1301 warning (OPT_Woverflow,
1302 "large integer implicitly truncated to unsigned type");
1303 else if (warn_conversion)
1304 conversion_warning (type, expr);
1306 else if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
1307 warning (OPT_Woverflow,
1308 "overflow in implicit constant conversion");
1309 /* No warning for converting 0x80000000 to int. */
1311 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
1312 || TYPE_PRECISION (TREE_TYPE (expr))
1313 != TYPE_PRECISION (type)))
1314 warning (OPT_Woverflow,
1315 "overflow in implicit constant conversion");
1317 else if (warn_conversion)
1318 conversion_warning (type, expr);
1320 else if (TREE_CODE (result) == INTEGER_CST && TREE_OVERFLOW (result))
1321 warning (OPT_Woverflow,
1322 "overflow in implicit constant conversion");
1323 else if (warn_conversion)
1324 conversion_warning (type, expr);
1328 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1329 Invoke this function on every expression that is converted implicitly,
1330 i.e. because of language rules and not because of an explicit cast. */
1333 convert_and_check (tree type, tree expr)
1337 if (TREE_TYPE (expr) == type)
1340 result = convert (type, expr);
1342 if (!skip_evaluation && !TREE_OVERFLOW_P (expr))
1343 warnings_for_convert_and_check (type, expr, result);
1348 /* A node in a list that describes references to variables (EXPR), which are
1349 either read accesses if WRITER is zero, or write accesses, in which case
1350 WRITER is the parent of EXPR. */
1357 /* Used to implement a cache the results of a call to verify_tree. We only
1358 use this for SAVE_EXPRs. */
1361 struct tlist_cache *next;
1362 struct tlist *cache_before_sp;
1363 struct tlist *cache_after_sp;
1367 /* Obstack to use when allocating tlist structures, and corresponding
1369 static struct obstack tlist_obstack;
1370 static char *tlist_firstobj = 0;
1372 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1374 static struct tlist *warned_ids;
1375 /* SAVE_EXPRs need special treatment. We process them only once and then
1376 cache the results. */
1377 static struct tlist_cache *save_expr_cache;
1379 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1380 static void merge_tlist (struct tlist **, struct tlist *, int);
1381 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1382 static int warning_candidate_p (tree);
1383 static void warn_for_collisions (struct tlist *);
1384 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1385 static struct tlist *new_tlist (struct tlist *, tree, tree);
1387 /* Create a new struct tlist and fill in its fields. */
1388 static struct tlist *
1389 new_tlist (struct tlist *next, tree t, tree writer)
1392 l = XOBNEW (&tlist_obstack, struct tlist);
1399 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1400 is nonnull, we ignore any node we find which has a writer equal to it. */
1403 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1407 struct tlist *next = add->next;
1410 if (!exclude_writer || add->writer != exclude_writer)
1411 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1416 /* Merge the nodes of ADD into TO. This merging process is done so that for
1417 each variable that already exists in TO, no new node is added; however if
1418 there is a write access recorded in ADD, and an occurrence on TO is only
1419 a read access, then the occurrence in TO will be modified to record the
1423 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1425 struct tlist **end = to;
1428 end = &(*end)->next;
1434 struct tlist *next = add->next;
1436 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1437 if (tmp2->expr == add->expr)
1441 tmp2->writer = add->writer;
1445 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1446 end = &(*end)->next;
1453 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1454 references in list LIST conflict with it, excluding reads if ONLY writers
1458 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1463 /* Avoid duplicate warnings. */
1464 for (tmp = warned_ids; tmp; tmp = tmp->next)
1465 if (tmp->expr == written)
1470 if (list->expr == written
1471 && list->writer != writer
1472 && (!only_writes || list->writer)
1473 && DECL_NAME (list->expr))
1475 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1476 warning (0, "operation on %qE may be undefined", list->expr);
1482 /* Given a list LIST of references to variables, find whether any of these
1483 can cause conflicts due to missing sequence points. */
1486 warn_for_collisions (struct tlist *list)
1490 for (tmp = list; tmp; tmp = tmp->next)
1493 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1497 /* Return nonzero if X is a tree that can be verified by the sequence point
1500 warning_candidate_p (tree x)
1502 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1505 /* Walk the tree X, and record accesses to variables. If X is written by the
1506 parent tree, WRITER is the parent.
1507 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1508 expression or its only operand forces a sequence point, then everything up
1509 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1511 Once we return, we will have emitted warnings if any subexpression before
1512 such a sequence point could be undefined. On a higher level, however, the
1513 sequence point may not be relevant, and we'll merge the two lists.
1515 Example: (b++, a) + b;
1516 The call that processes the COMPOUND_EXPR will store the increment of B
1517 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1518 processes the PLUS_EXPR will need to merge the two lists so that
1519 eventually, all accesses end up on the same list (and we'll warn about the
1520 unordered subexpressions b++ and b.
1522 A note on merging. If we modify the former example so that our expression
1525 care must be taken not simply to add all three expressions into the final
1526 PNO_SP list. The function merge_tlist takes care of that by merging the
1527 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1528 way, so that no more than one access to B is recorded. */
1531 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1534 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1535 enum tree_code code;
1536 enum tree_code_class cl;
1538 /* X may be NULL if it is the operand of an empty statement expression
1544 code = TREE_CODE (x);
1545 cl = TREE_CODE_CLASS (code);
1547 if (warning_candidate_p (x))
1549 *pno_sp = new_tlist (*pno_sp, x, writer);
1559 case TRUTH_ANDIF_EXPR:
1560 case TRUTH_ORIF_EXPR:
1561 tmp_before = tmp_nosp = tmp_list3 = 0;
1562 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1563 warn_for_collisions (tmp_nosp);
1564 merge_tlist (pbefore_sp, tmp_before, 0);
1565 merge_tlist (pbefore_sp, tmp_nosp, 0);
1566 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1567 merge_tlist (pbefore_sp, tmp_list3, 0);
1571 tmp_before = tmp_list2 = 0;
1572 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1573 warn_for_collisions (tmp_list2);
1574 merge_tlist (pbefore_sp, tmp_before, 0);
1575 merge_tlist (pbefore_sp, tmp_list2, 1);
1577 tmp_list3 = tmp_nosp = 0;
1578 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1579 warn_for_collisions (tmp_nosp);
1580 merge_tlist (pbefore_sp, tmp_list3, 0);
1582 tmp_list3 = tmp_list2 = 0;
1583 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1584 warn_for_collisions (tmp_list2);
1585 merge_tlist (pbefore_sp, tmp_list3, 0);
1586 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1587 two first, to avoid warning for (a ? b++ : b++). */
1588 merge_tlist (&tmp_nosp, tmp_list2, 0);
1589 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1592 case PREDECREMENT_EXPR:
1593 case PREINCREMENT_EXPR:
1594 case POSTDECREMENT_EXPR:
1595 case POSTINCREMENT_EXPR:
1596 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1600 tmp_before = tmp_nosp = tmp_list3 = 0;
1601 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1602 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1603 /* Expressions inside the LHS are not ordered wrt. the sequence points
1604 in the RHS. Example:
1606 Despite the fact that the modification of "a" is in the before_sp
1607 list (tmp_before), it conflicts with the use of "a" in the LHS.
1608 We can handle this by adding the contents of tmp_list3
1609 to those of tmp_before, and redoing the collision warnings for that
1611 add_tlist (&tmp_before, tmp_list3, x, 1);
1612 warn_for_collisions (tmp_before);
1613 /* Exclude the LHS itself here; we first have to merge it into the
1614 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1615 didn't exclude the LHS, we'd get it twice, once as a read and once
1617 add_tlist (pno_sp, tmp_list3, x, 0);
1618 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1620 merge_tlist (pbefore_sp, tmp_before, 0);
1621 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1622 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1623 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1627 /* We need to warn about conflicts among arguments and conflicts between
1628 args and the function address. Side effects of the function address,
1629 however, are not ordered by the sequence point of the call. */
1631 call_expr_arg_iterator iter;
1633 tmp_before = tmp_nosp = 0;
1634 verify_tree (CALL_EXPR_FN (x), &tmp_before, &tmp_nosp, NULL_TREE);
1635 FOR_EACH_CALL_EXPR_ARG (arg, iter, x)
1637 tmp_list2 = tmp_list3 = 0;
1638 verify_tree (arg, &tmp_list2, &tmp_list3, NULL_TREE);
1639 merge_tlist (&tmp_list3, tmp_list2, 0);
1640 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1642 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1643 warn_for_collisions (tmp_before);
1644 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1649 /* Scan all the list, e.g. indices of multi dimensional array. */
1652 tmp_before = tmp_nosp = 0;
1653 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1654 merge_tlist (&tmp_nosp, tmp_before, 0);
1655 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1662 struct tlist_cache *t;
1663 for (t = save_expr_cache; t; t = t->next)
1669 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1670 t->next = save_expr_cache;
1672 save_expr_cache = t;
1674 tmp_before = tmp_nosp = 0;
1675 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1676 warn_for_collisions (tmp_nosp);
1681 struct tlist *t = tmp_nosp;
1683 merge_tlist (&tmp_list3, t, 0);
1685 t->cache_before_sp = tmp_before;
1686 t->cache_after_sp = tmp_list3;
1688 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1689 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1694 /* For other expressions, simply recurse on their operands.
1695 Manual tail recursion for unary expressions.
1696 Other non-expressions need not be processed. */
1697 if (cl == tcc_unary)
1699 x = TREE_OPERAND (x, 0);
1703 else if (IS_EXPR_CODE_CLASS (cl))
1706 int max = TREE_OPERAND_LENGTH (x);
1707 for (lp = 0; lp < max; lp++)
1709 tmp_before = tmp_nosp = 0;
1710 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
1711 merge_tlist (&tmp_nosp, tmp_before, 0);
1712 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1719 /* Try to warn for undefined behavior in EXPR due to missing sequence
1723 verify_sequence_points (tree expr)
1725 struct tlist *before_sp = 0, *after_sp = 0;
1728 save_expr_cache = 0;
1729 if (tlist_firstobj == 0)
1731 gcc_obstack_init (&tlist_obstack);
1732 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1735 verify_tree (expr, &before_sp, &after_sp, 0);
1736 warn_for_collisions (after_sp);
1737 obstack_free (&tlist_obstack, tlist_firstobj);
1740 /* Validate the expression after `case' and apply default promotions. */
1743 check_case_value (tree value)
1745 if (value == NULL_TREE)
1748 /* ??? Can we ever get nops here for a valid case value? We
1750 STRIP_TYPE_NOPS (value);
1751 /* In C++, the following is allowed:
1754 switch (...) { case i: ... }
1756 So, we try to reduce the VALUE to a constant that way. */
1757 if (c_dialect_cxx ())
1759 value = decl_constant_value (value);
1760 STRIP_TYPE_NOPS (value);
1761 value = fold (value);
1764 if (TREE_CODE (value) == INTEGER_CST)
1765 /* Promote char or short to int. */
1766 value = perform_integral_promotions (value);
1767 else if (value != error_mark_node)
1769 error ("case label does not reduce to an integer constant");
1770 value = error_mark_node;
1773 constant_expression_warning (value);
1778 /* See if the case values LOW and HIGH are in the range of the original
1779 type (i.e. before the default conversion to int) of the switch testing
1781 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1782 the type before promoting it. CASE_LOW_P is a pointer to the lower
1783 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1784 if the case is not a case range.
1785 The caller has to make sure that we are not called with NULL for
1786 CASE_LOW_P (i.e. the default case).
1787 Returns true if the case label is in range of ORIG_TYPE (saturated or
1788 untouched) or false if the label is out of range. */
1791 check_case_bounds (tree type, tree orig_type,
1792 tree *case_low_p, tree *case_high_p)
1794 tree min_value, max_value;
1795 tree case_low = *case_low_p;
1796 tree case_high = case_high_p ? *case_high_p : case_low;
1798 /* If there was a problem with the original type, do nothing. */
1799 if (orig_type == error_mark_node)
1802 min_value = TYPE_MIN_VALUE (orig_type);
1803 max_value = TYPE_MAX_VALUE (orig_type);
1805 /* Case label is less than minimum for type. */
1806 if (tree_int_cst_compare (case_low, min_value) < 0
1807 && tree_int_cst_compare (case_high, min_value) < 0)
1809 warning (0, "case label value is less than minimum value for type");
1813 /* Case value is greater than maximum for type. */
1814 if (tree_int_cst_compare (case_low, max_value) > 0
1815 && tree_int_cst_compare (case_high, max_value) > 0)
1817 warning (0, "case label value exceeds maximum value for type");
1821 /* Saturate lower case label value to minimum. */
1822 if (tree_int_cst_compare (case_high, min_value) >= 0
1823 && tree_int_cst_compare (case_low, min_value) < 0)
1825 warning (0, "lower value in case label range"
1826 " less than minimum value for type");
1827 case_low = min_value;
1830 /* Saturate upper case label value to maximum. */
1831 if (tree_int_cst_compare (case_low, max_value) <= 0
1832 && tree_int_cst_compare (case_high, max_value) > 0)
1834 warning (0, "upper value in case label range"
1835 " exceeds maximum value for type");
1836 case_high = max_value;
1839 if (*case_low_p != case_low)
1840 *case_low_p = convert (type, case_low);
1841 if (case_high_p && *case_high_p != case_high)
1842 *case_high_p = convert (type, case_high);
1847 /* Return an integer type with BITS bits of precision,
1848 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1851 c_common_type_for_size (unsigned int bits, int unsignedp)
1853 if (bits == TYPE_PRECISION (integer_type_node))
1854 return unsignedp ? unsigned_type_node : integer_type_node;
1856 if (bits == TYPE_PRECISION (signed_char_type_node))
1857 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1859 if (bits == TYPE_PRECISION (short_integer_type_node))
1860 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1862 if (bits == TYPE_PRECISION (long_integer_type_node))
1863 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1865 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1866 return (unsignedp ? long_long_unsigned_type_node
1867 : long_long_integer_type_node);
1869 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1870 return (unsignedp ? widest_unsigned_literal_type_node
1871 : widest_integer_literal_type_node);
1873 if (bits <= TYPE_PRECISION (intQI_type_node))
1874 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1876 if (bits <= TYPE_PRECISION (intHI_type_node))
1877 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1879 if (bits <= TYPE_PRECISION (intSI_type_node))
1880 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1882 if (bits <= TYPE_PRECISION (intDI_type_node))
1883 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1888 /* Used for communication between c_common_type_for_mode and
1889 c_register_builtin_type. */
1890 static GTY(()) tree registered_builtin_types;
1892 /* Return a data type that has machine mode MODE.
1893 If the mode is an integer,
1894 then UNSIGNEDP selects between signed and unsigned types. */
1897 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1901 if (mode == TYPE_MODE (integer_type_node))
1902 return unsignedp ? unsigned_type_node : integer_type_node;
1904 if (mode == TYPE_MODE (signed_char_type_node))
1905 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1907 if (mode == TYPE_MODE (short_integer_type_node))
1908 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1910 if (mode == TYPE_MODE (long_integer_type_node))
1911 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1913 if (mode == TYPE_MODE (long_long_integer_type_node))
1914 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1916 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1917 return unsignedp ? widest_unsigned_literal_type_node
1918 : widest_integer_literal_type_node;
1921 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1924 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1927 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1930 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1932 #if HOST_BITS_PER_WIDE_INT >= 64
1933 if (mode == TYPE_MODE (intTI_type_node))
1934 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1937 if (mode == TYPE_MODE (float_type_node))
1938 return float_type_node;
1940 if (mode == TYPE_MODE (double_type_node))
1941 return double_type_node;
1943 if (mode == TYPE_MODE (long_double_type_node))
1944 return long_double_type_node;
1946 if (mode == TYPE_MODE (void_type_node))
1947 return void_type_node;
1949 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1951 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1952 : make_signed_type (GET_MODE_PRECISION (mode)));
1954 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1956 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1957 : make_signed_type (GET_MODE_PRECISION (mode)));
1959 if (COMPLEX_MODE_P (mode))
1961 enum machine_mode inner_mode;
1964 if (mode == TYPE_MODE (complex_float_type_node))
1965 return complex_float_type_node;
1966 if (mode == TYPE_MODE (complex_double_type_node))
1967 return complex_double_type_node;
1968 if (mode == TYPE_MODE (complex_long_double_type_node))
1969 return complex_long_double_type_node;
1971 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
1972 return complex_integer_type_node;
1974 inner_mode = GET_MODE_INNER (mode);
1975 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1976 if (inner_type != NULL_TREE)
1977 return build_complex_type (inner_type);
1979 else if (VECTOR_MODE_P (mode))
1981 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1982 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1983 if (inner_type != NULL_TREE)
1984 return build_vector_type_for_mode (inner_type, mode);
1987 if (mode == TYPE_MODE (dfloat32_type_node))
1988 return dfloat32_type_node;
1989 if (mode == TYPE_MODE (dfloat64_type_node))
1990 return dfloat64_type_node;
1991 if (mode == TYPE_MODE (dfloat128_type_node))
1992 return dfloat128_type_node;
1994 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1995 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1996 return TREE_VALUE (t);
2001 /* Return an unsigned type the same as TYPE in other respects. */
2003 c_common_unsigned_type (tree type)
2005 tree type1 = TYPE_MAIN_VARIANT (type);
2006 if (type1 == signed_char_type_node || type1 == char_type_node)
2007 return unsigned_char_type_node;
2008 if (type1 == integer_type_node)
2009 return unsigned_type_node;
2010 if (type1 == short_integer_type_node)
2011 return short_unsigned_type_node;
2012 if (type1 == long_integer_type_node)
2013 return long_unsigned_type_node;
2014 if (type1 == long_long_integer_type_node)
2015 return long_long_unsigned_type_node;
2016 if (type1 == widest_integer_literal_type_node)
2017 return widest_unsigned_literal_type_node;
2018 #if HOST_BITS_PER_WIDE_INT >= 64
2019 if (type1 == intTI_type_node)
2020 return unsigned_intTI_type_node;
2022 if (type1 == intDI_type_node)
2023 return unsigned_intDI_type_node;
2024 if (type1 == intSI_type_node)
2025 return unsigned_intSI_type_node;
2026 if (type1 == intHI_type_node)
2027 return unsigned_intHI_type_node;
2028 if (type1 == intQI_type_node)
2029 return unsigned_intQI_type_node;
2031 return c_common_signed_or_unsigned_type (1, type);
2034 /* Return a signed type the same as TYPE in other respects. */
2037 c_common_signed_type (tree type)
2039 tree type1 = TYPE_MAIN_VARIANT (type);
2040 if (type1 == unsigned_char_type_node || type1 == char_type_node)
2041 return signed_char_type_node;
2042 if (type1 == unsigned_type_node)
2043 return integer_type_node;
2044 if (type1 == short_unsigned_type_node)
2045 return short_integer_type_node;
2046 if (type1 == long_unsigned_type_node)
2047 return long_integer_type_node;
2048 if (type1 == long_long_unsigned_type_node)
2049 return long_long_integer_type_node;
2050 if (type1 == widest_unsigned_literal_type_node)
2051 return widest_integer_literal_type_node;
2052 #if HOST_BITS_PER_WIDE_INT >= 64
2053 if (type1 == unsigned_intTI_type_node)
2054 return intTI_type_node;
2056 if (type1 == unsigned_intDI_type_node)
2057 return intDI_type_node;
2058 if (type1 == unsigned_intSI_type_node)
2059 return intSI_type_node;
2060 if (type1 == unsigned_intHI_type_node)
2061 return intHI_type_node;
2062 if (type1 == unsigned_intQI_type_node)
2063 return intQI_type_node;
2065 return c_common_signed_or_unsigned_type (0, type);
2068 /* Return a type the same as TYPE except unsigned or
2069 signed according to UNSIGNEDP. */
2072 c_common_signed_or_unsigned_type (int unsignedp, tree type)
2074 if (!INTEGRAL_TYPE_P (type)
2075 || TYPE_UNSIGNED (type) == unsignedp)
2078 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2079 the precision; they have precision set to match their range, but
2080 may use a wider mode to match an ABI. If we change modes, we may
2081 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2082 the precision as well, so as to yield correct results for
2083 bit-field types. C++ does not have these separate bit-field
2084 types, and producing a signed or unsigned variant of an
2085 ENUMERAL_TYPE may cause other problems as well. */
2087 #define TYPE_OK(node) \
2088 (TYPE_MODE (type) == TYPE_MODE (node) \
2089 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2090 if (TYPE_OK (signed_char_type_node))
2091 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2092 if (TYPE_OK (integer_type_node))
2093 return unsignedp ? unsigned_type_node : integer_type_node;
2094 if (TYPE_OK (short_integer_type_node))
2095 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2096 if (TYPE_OK (long_integer_type_node))
2097 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2098 if (TYPE_OK (long_long_integer_type_node))
2099 return (unsignedp ? long_long_unsigned_type_node
2100 : long_long_integer_type_node);
2101 if (TYPE_OK (widest_integer_literal_type_node))
2102 return (unsignedp ? widest_unsigned_literal_type_node
2103 : widest_integer_literal_type_node);
2105 #if HOST_BITS_PER_WIDE_INT >= 64
2106 if (TYPE_OK (intTI_type_node))
2107 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2109 if (TYPE_OK (intDI_type_node))
2110 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2111 if (TYPE_OK (intSI_type_node))
2112 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2113 if (TYPE_OK (intHI_type_node))
2114 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2115 if (TYPE_OK (intQI_type_node))
2116 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2119 if (c_dialect_cxx ())
2122 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
2125 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2128 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
2130 /* Extended integer types of the same width as a standard type have
2131 lesser rank, so those of the same width as int promote to int or
2132 unsigned int and are valid for printf formats expecting int or
2133 unsigned int. To avoid such special cases, avoid creating
2134 extended integer types for bit-fields if a standard integer type
2136 if (width == TYPE_PRECISION (integer_type_node))
2137 return unsignedp ? unsigned_type_node : integer_type_node;
2138 if (width == TYPE_PRECISION (signed_char_type_node))
2139 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2140 if (width == TYPE_PRECISION (short_integer_type_node))
2141 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2142 if (width == TYPE_PRECISION (long_integer_type_node))
2143 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2144 if (width == TYPE_PRECISION (long_long_integer_type_node))
2145 return (unsignedp ? long_long_unsigned_type_node
2146 : long_long_integer_type_node);
2147 return build_nonstandard_integer_type (width, unsignedp);
2150 /* The C version of the register_builtin_type langhook. */
2153 c_register_builtin_type (tree type, const char* name)
2157 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2158 DECL_ARTIFICIAL (decl) = 1;
2159 if (!TYPE_NAME (type))
2160 TYPE_NAME (type) = decl;
2163 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2167 /* Return the minimum number of bits needed to represent VALUE in a
2168 signed or unsigned type, UNSIGNEDP says which. */
2171 min_precision (tree value, int unsignedp)
2175 /* If the value is negative, compute its negative minus 1. The latter
2176 adjustment is because the absolute value of the largest negative value
2177 is one larger than the largest positive value. This is equivalent to
2178 a bit-wise negation, so use that operation instead. */
2180 if (tree_int_cst_sgn (value) < 0)
2181 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
2183 /* Return the number of bits needed, taking into account the fact
2184 that we need one more bit for a signed than unsigned type. */
2186 if (integer_zerop (value))
2189 log = tree_floor_log2 (value);
2191 return log + 1 + !unsignedp;
2194 /* Print an error message for invalid operands to arith operation
2198 binary_op_error (enum tree_code code)
2205 opname = "+"; break;
2207 opname = "-"; break;
2209 opname = "*"; break;
2211 opname = "max"; break;
2213 opname = "min"; break;
2215 opname = "=="; break;
2217 opname = "!="; break;
2219 opname = "<="; break;
2221 opname = ">="; break;
2223 opname = "<"; break;
2225 opname = ">"; break;
2227 opname = "<<"; break;
2229 opname = ">>"; break;
2230 case TRUNC_MOD_EXPR:
2231 case FLOOR_MOD_EXPR:
2232 opname = "%"; break;
2233 case TRUNC_DIV_EXPR:
2234 case FLOOR_DIV_EXPR:
2235 opname = "/"; break;
2237 opname = "&"; break;
2239 opname = "|"; break;
2240 case TRUTH_ANDIF_EXPR:
2241 opname = "&&"; break;
2242 case TRUTH_ORIF_EXPR:
2243 opname = "||"; break;
2245 opname = "^"; break;
2249 error ("invalid operands to binary %s", opname);
2252 /* Subroutine of build_binary_op, used for comparison operations.
2253 See if the operands have both been converted from subword integer types
2254 and, if so, perhaps change them both back to their original type.
2255 This function is also responsible for converting the two operands
2256 to the proper common type for comparison.
2258 The arguments of this function are all pointers to local variables
2259 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2260 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2262 If this function returns nonzero, it means that the comparison has
2263 a constant value. What this function returns is an expression for
2267 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2268 enum tree_code *rescode_ptr)
2271 tree op0 = *op0_ptr;
2272 tree op1 = *op1_ptr;
2273 int unsignedp0, unsignedp1;
2275 tree primop0, primop1;
2276 enum tree_code code = *rescode_ptr;
2278 /* Throw away any conversions to wider types
2279 already present in the operands. */
2281 primop0 = get_narrower (op0, &unsignedp0);
2282 primop1 = get_narrower (op1, &unsignedp1);
2284 /* Handle the case that OP0 does not *contain* a conversion
2285 but it *requires* conversion to FINAL_TYPE. */
2287 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2288 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2289 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2290 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2292 /* If one of the operands must be floated, we cannot optimize. */
2293 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2294 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2296 /* If first arg is constant, swap the args (changing operation
2297 so value is preserved), for canonicalization. Don't do this if
2298 the second arg is 0. */
2300 if (TREE_CONSTANT (primop0)
2301 && !integer_zerop (primop1) && !real_zerop (primop1))
2304 int temi = unsignedp0;
2312 unsignedp0 = unsignedp1;
2335 *rescode_ptr = code;
2338 /* If comparing an integer against a constant more bits wide,
2339 maybe we can deduce a value of 1 or 0 independent of the data.
2340 Or else truncate the constant now
2341 rather than extend the variable at run time.
2343 This is only interesting if the constant is the wider arg.
2344 Also, it is not safe if the constant is unsigned and the
2345 variable arg is signed, since in this case the variable
2346 would be sign-extended and then regarded as unsigned.
2347 Our technique fails in this case because the lowest/highest
2348 possible unsigned results don't follow naturally from the
2349 lowest/highest possible values of the variable operand.
2350 For just EQ_EXPR and NE_EXPR there is another technique that
2351 could be used: see if the constant can be faithfully represented
2352 in the other operand's type, by truncating it and reextending it
2353 and see if that preserves the constant's value. */
2355 if (!real1 && !real2
2356 && TREE_CODE (primop1) == INTEGER_CST
2357 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2359 int min_gt, max_gt, min_lt, max_lt;
2360 tree maxval, minval;
2361 /* 1 if comparison is nominally unsigned. */
2362 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2365 type = c_common_signed_or_unsigned_type (unsignedp0,
2366 TREE_TYPE (primop0));
2368 maxval = TYPE_MAX_VALUE (type);
2369 minval = TYPE_MIN_VALUE (type);
2371 if (unsignedp && !unsignedp0)
2372 *restype_ptr = c_common_signed_type (*restype_ptr);
2374 if (TREE_TYPE (primop1) != *restype_ptr)
2376 /* Convert primop1 to target type, but do not introduce
2377 additional overflow. We know primop1 is an int_cst. */
2378 primop1 = force_fit_type_double (*restype_ptr,
2379 TREE_INT_CST_LOW (primop1),
2380 TREE_INT_CST_HIGH (primop1), 0,
2381 TREE_OVERFLOW (primop1));
2383 if (type != *restype_ptr)
2385 minval = convert (*restype_ptr, minval);
2386 maxval = convert (*restype_ptr, maxval);
2389 if (unsignedp && unsignedp0)
2391 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2392 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2393 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2394 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2398 min_gt = INT_CST_LT (primop1, minval);
2399 max_gt = INT_CST_LT (primop1, maxval);
2400 min_lt = INT_CST_LT (minval, primop1);
2401 max_lt = INT_CST_LT (maxval, primop1);
2405 /* This used to be a switch, but Genix compiler can't handle that. */
2406 if (code == NE_EXPR)
2408 if (max_lt || min_gt)
2409 val = truthvalue_true_node;
2411 else if (code == EQ_EXPR)
2413 if (max_lt || min_gt)
2414 val = truthvalue_false_node;
2416 else if (code == LT_EXPR)
2419 val = truthvalue_true_node;
2421 val = truthvalue_false_node;
2423 else if (code == GT_EXPR)
2426 val = truthvalue_true_node;
2428 val = truthvalue_false_node;
2430 else if (code == LE_EXPR)
2433 val = truthvalue_true_node;
2435 val = truthvalue_false_node;
2437 else if (code == GE_EXPR)
2440 val = truthvalue_true_node;
2442 val = truthvalue_false_node;
2445 /* If primop0 was sign-extended and unsigned comparison specd,
2446 we did a signed comparison above using the signed type bounds.
2447 But the comparison we output must be unsigned.
2449 Also, for inequalities, VAL is no good; but if the signed
2450 comparison had *any* fixed result, it follows that the
2451 unsigned comparison just tests the sign in reverse
2452 (positive values are LE, negative ones GE).
2453 So we can generate an unsigned comparison
2454 against an extreme value of the signed type. */
2456 if (unsignedp && !unsignedp0)
2463 primop1 = TYPE_MIN_VALUE (type);
2469 primop1 = TYPE_MAX_VALUE (type);
2476 type = c_common_unsigned_type (type);
2479 if (TREE_CODE (primop0) != INTEGER_CST)
2481 if (val == truthvalue_false_node)
2482 warning (0, "comparison is always false due to limited range of data type");
2483 if (val == truthvalue_true_node)
2484 warning (0, "comparison is always true due to limited range of data type");
2489 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2490 if (TREE_SIDE_EFFECTS (primop0))
2491 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2495 /* Value is not predetermined, but do the comparison
2496 in the type of the operand that is not constant.
2497 TYPE is already properly set. */
2500 /* If either arg is decimal float and the other is float, find the
2501 proper common type to use for comparison. */
2502 else if (real1 && real2
2503 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
2504 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
2505 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2507 else if (real1 && real2
2508 && (TYPE_PRECISION (TREE_TYPE (primop0))
2509 == TYPE_PRECISION (TREE_TYPE (primop1))))
2510 type = TREE_TYPE (primop0);
2512 /* If args' natural types are both narrower than nominal type
2513 and both extend in the same manner, compare them
2514 in the type of the wider arg.
2515 Otherwise must actually extend both to the nominal
2516 common type lest different ways of extending
2518 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2520 else if (unsignedp0 == unsignedp1 && real1 == real2
2521 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2522 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2524 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2525 type = c_common_signed_or_unsigned_type (unsignedp0
2526 || TYPE_UNSIGNED (*restype_ptr),
2528 /* Make sure shorter operand is extended the right way
2529 to match the longer operand. */
2531 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2532 TREE_TYPE (primop0)),
2535 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2536 TREE_TYPE (primop1)),
2541 /* Here we must do the comparison on the nominal type
2542 using the args exactly as we received them. */
2543 type = *restype_ptr;
2547 if (!real1 && !real2 && integer_zerop (primop1)
2548 && TYPE_UNSIGNED (*restype_ptr))
2554 /* All unsigned values are >= 0, so we warn if extra warnings
2555 are requested. However, if OP0 is a constant that is
2556 >= 0, the signedness of the comparison isn't an issue,
2557 so suppress the warning. */
2558 if (extra_warnings && !in_system_header
2559 && !(TREE_CODE (primop0) == INTEGER_CST
2560 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2562 warning (0, "comparison of unsigned expression >= 0 is always true");
2563 value = truthvalue_true_node;
2567 if (extra_warnings && !in_system_header
2568 && !(TREE_CODE (primop0) == INTEGER_CST
2569 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2571 warning (0, "comparison of unsigned expression < 0 is always false");
2572 value = truthvalue_false_node;
2581 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2582 if (TREE_SIDE_EFFECTS (primop0))
2583 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2590 *op0_ptr = convert (type, primop0);
2591 *op1_ptr = convert (type, primop1);
2593 *restype_ptr = truthvalue_type_node;
2598 /* Return a tree for the sum or difference (RESULTCODE says which)
2599 of pointer PTROP and integer INTOP. */
2602 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2606 /* The result is a pointer of the same type that is being added. */
2608 tree result_type = TREE_TYPE (ptrop);
2610 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2612 if (pedantic || warn_pointer_arith)
2613 pedwarn ("pointer of type %<void *%> used in arithmetic");
2614 size_exp = integer_one_node;
2616 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2618 if (pedantic || warn_pointer_arith)
2619 pedwarn ("pointer to a function used in arithmetic");
2620 size_exp = integer_one_node;
2622 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2624 if (pedantic || warn_pointer_arith)
2625 pedwarn ("pointer to member function used in arithmetic");
2626 size_exp = integer_one_node;
2629 size_exp = size_in_bytes (TREE_TYPE (result_type));
2631 /* We are manipulating pointer values, so we don't need to warn
2632 about relying on undefined signed overflow. We disable the
2633 warning here because we use integer types so fold won't know that
2634 they are really pointers. */
2635 fold_defer_overflow_warnings ();
2637 /* If what we are about to multiply by the size of the elements
2638 contains a constant term, apply distributive law
2639 and multiply that constant term separately.
2640 This helps produce common subexpressions. */
2642 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2643 && !TREE_CONSTANT (intop)
2644 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2645 && TREE_CONSTANT (size_exp)
2646 /* If the constant comes from pointer subtraction,
2647 skip this optimization--it would cause an error. */
2648 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2649 /* If the constant is unsigned, and smaller than the pointer size,
2650 then we must skip this optimization. This is because it could cause
2651 an overflow error if the constant is negative but INTOP is not. */
2652 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2653 || (TYPE_PRECISION (TREE_TYPE (intop))
2654 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2656 enum tree_code subcode = resultcode;
2657 tree int_type = TREE_TYPE (intop);
2658 if (TREE_CODE (intop) == MINUS_EXPR)
2659 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2660 /* Convert both subexpression types to the type of intop,
2661 because weird cases involving pointer arithmetic
2662 can result in a sum or difference with different type args. */
2663 ptrop = build_binary_op (subcode, ptrop,
2664 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2665 intop = convert (int_type, TREE_OPERAND (intop, 0));
2668 /* Convert the integer argument to a type the same size as sizetype
2669 so the multiply won't overflow spuriously. */
2671 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2672 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2673 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2674 TYPE_UNSIGNED (sizetype)), intop);
2676 /* Replace the integer argument with a suitable product by the object size.
2677 Do this multiplication as signed, then convert to the appropriate
2678 pointer type (actually unsigned integral). */
2680 intop = convert (result_type,
2681 build_binary_op (MULT_EXPR, intop,
2682 convert (TREE_TYPE (intop), size_exp), 1));
2684 /* Create the sum or difference. */
2685 ret = fold_build2 (resultcode, result_type, ptrop, intop);
2687 fold_undefer_and_ignore_overflow_warnings ();
2692 /* Return whether EXPR is a declaration whose address can never be
2696 decl_with_nonnull_addr_p (tree expr)
2698 return (DECL_P (expr)
2699 && (TREE_CODE (expr) == PARM_DECL
2700 || TREE_CODE (expr) == LABEL_DECL
2701 || !DECL_WEAK (expr)));
2704 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2705 or for an `if' or `while' statement or ?..: exp. It should already
2706 have been validated to be of suitable type; otherwise, a bad
2707 diagnostic may result.
2709 This preparation consists of taking the ordinary
2710 representation of an expression expr and producing a valid tree
2711 boolean expression describing whether expr is nonzero. We could
2712 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2713 but we optimize comparisons, &&, ||, and !.
2715 The resulting type should always be `truthvalue_type_node'. */
2718 c_common_truthvalue_conversion (tree expr)
2720 switch (TREE_CODE (expr))
2722 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2723 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2724 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2725 case ORDERED_EXPR: case UNORDERED_EXPR:
2726 if (TREE_TYPE (expr) == truthvalue_type_node)
2728 return build2 (TREE_CODE (expr), truthvalue_type_node,
2729 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2731 case TRUTH_ANDIF_EXPR:
2732 case TRUTH_ORIF_EXPR:
2733 case TRUTH_AND_EXPR:
2735 case TRUTH_XOR_EXPR:
2736 if (TREE_TYPE (expr) == truthvalue_type_node)
2738 return build2 (TREE_CODE (expr), truthvalue_type_node,
2739 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2740 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)));
2742 case TRUTH_NOT_EXPR:
2743 if (TREE_TYPE (expr) == truthvalue_type_node)
2745 return build1 (TREE_CODE (expr), truthvalue_type_node,
2746 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2752 return integer_zerop (expr) ? truthvalue_false_node
2753 : truthvalue_true_node;
2756 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
2757 ? truthvalue_true_node
2758 : truthvalue_false_node;
2761 expr = build_unary_op (ADDR_EXPR, expr, 0);
2766 tree inner = TREE_OPERAND (expr, 0);
2767 if (decl_with_nonnull_addr_p (inner))
2769 /* Common Ada/Pascal programmer's mistake. */
2770 warning (OPT_Waddress,
2771 "the address of %qD will always evaluate as %<true%>",
2773 return truthvalue_true_node;
2776 /* If we still have a decl, it is possible for its address to
2777 be NULL, so we cannot optimize. */
2780 gcc_assert (DECL_WEAK (inner));
2784 if (TREE_SIDE_EFFECTS (inner))
2785 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2786 inner, truthvalue_true_node);
2788 return truthvalue_true_node;
2792 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2793 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2794 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2795 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2801 /* These don't change whether an object is nonzero or zero. */
2802 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2806 /* These don't change whether an object is zero or nonzero, but
2807 we can't ignore them if their second arg has side-effects. */
2808 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2809 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2810 TREE_OPERAND (expr, 1),
2811 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2813 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2816 /* Distribute the conversion into the arms of a COND_EXPR. */
2817 return fold_build3 (COND_EXPR, truthvalue_type_node,
2818 TREE_OPERAND (expr, 0),
2819 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2820 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2)));
2824 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2825 since that affects how `default_conversion' will behave. */
2826 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2827 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2829 /* If this is widening the argument, we can ignore it. */
2830 if (TYPE_PRECISION (TREE_TYPE (expr))
2831 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2832 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2836 if (!TREE_NO_WARNING (expr)
2837 && warn_parentheses)
2839 warning (OPT_Wparentheses,
2840 "suggest parentheses around assignment used as truth value");
2841 TREE_NO_WARNING (expr) = 1;
2849 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2851 tree t = save_expr (expr);
2852 return (build_binary_op
2853 ((TREE_SIDE_EFFECTS (expr)
2854 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2855 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2856 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2860 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2863 static void def_builtin_1 (enum built_in_function fncode,
2865 enum built_in_class fnclass,
2866 tree fntype, tree libtype,
2867 bool both_p, bool fallback_p, bool nonansi_p,
2868 tree fnattrs, bool implicit_p);
2870 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2871 down to the element type of an array. */
2874 c_build_qualified_type (tree type, int type_quals)
2876 if (type == error_mark_node)
2879 if (TREE_CODE (type) == ARRAY_TYPE)
2882 tree element_type = c_build_qualified_type (TREE_TYPE (type),
2885 /* See if we already have an identically qualified type. */
2886 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2888 if (TYPE_QUALS (strip_array_types (t)) == type_quals
2889 && TYPE_NAME (t) == TYPE_NAME (type)
2890 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
2891 && attribute_list_equal (TYPE_ATTRIBUTES (t),
2892 TYPE_ATTRIBUTES (type)))
2897 tree domain = TYPE_DOMAIN (type);
2899 t = build_variant_type_copy (type);
2900 TREE_TYPE (t) = element_type;
2902 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
2903 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
2904 SET_TYPE_STRUCTURAL_EQUALITY (t);
2905 else if (TYPE_CANONICAL (element_type) != element_type
2906 || (domain && TYPE_CANONICAL (domain) != domain))
2908 tree unqualified_canon
2909 = build_array_type (TYPE_CANONICAL (element_type),
2910 domain? TYPE_CANONICAL (domain)
2913 = c_build_qualified_type (unqualified_canon, type_quals);
2916 TYPE_CANONICAL (t) = t;
2921 /* A restrict-qualified pointer type must be a pointer to object or
2922 incomplete type. Note that the use of POINTER_TYPE_P also allows
2923 REFERENCE_TYPEs, which is appropriate for C++. */
2924 if ((type_quals & TYPE_QUAL_RESTRICT)
2925 && (!POINTER_TYPE_P (type)
2926 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2928 error ("invalid use of %<restrict%>");
2929 type_quals &= ~TYPE_QUAL_RESTRICT;
2932 return build_qualified_type (type, type_quals);
2935 /* Apply the TYPE_QUALS to the new DECL. */
2938 c_apply_type_quals_to_decl (int type_quals, tree decl)
2940 tree type = TREE_TYPE (decl);
2942 if (type == error_mark_node)
2945 if (((type_quals & TYPE_QUAL_CONST)
2946 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2947 /* An object declared 'const' is only readonly after it is
2948 initialized. We don't have any way of expressing this currently,
2949 so we need to be conservative and unset TREE_READONLY for types
2950 with constructors. Otherwise aliasing code will ignore stores in
2951 an inline constructor. */
2952 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2953 TREE_READONLY (decl) = 1;
2954 if (type_quals & TYPE_QUAL_VOLATILE)
2956 TREE_SIDE_EFFECTS (decl) = 1;
2957 TREE_THIS_VOLATILE (decl) = 1;
2959 if (type_quals & TYPE_QUAL_RESTRICT)
2961 while (type && TREE_CODE (type) == ARRAY_TYPE)
2962 /* Allow 'restrict' on arrays of pointers.
2963 FIXME currently we just ignore it. */
2964 type = TREE_TYPE (type);
2966 || !POINTER_TYPE_P (type)
2967 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2968 error ("invalid use of %<restrict%>");
2969 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2970 /* Indicate we need to make a unique alias set for this pointer.
2971 We can't do it here because it might be pointing to an
2973 DECL_POINTER_ALIAS_SET (decl) = -2;
2977 /* Hash function for the problem of multiple type definitions in
2978 different files. This must hash all types that will compare
2979 equal via comptypes to the same value. In practice it hashes
2980 on some of the simple stuff and leaves the details to comptypes. */
2983 c_type_hash (const void *p)
2989 switch (TREE_CODE (t))
2991 /* For pointers, hash on pointee type plus some swizzling. */
2993 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2994 /* Hash on number of elements and total size. */
2997 t2 = TYPE_VALUES (t);
3001 t2 = TYPE_FIELDS (t);
3003 case QUAL_UNION_TYPE:
3005 t2 = TYPE_FIELDS (t);
3009 t2 = TYPE_FIELDS (t);
3014 for (; t2; t2 = TREE_CHAIN (t2))
3016 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
3017 return ((size << 24) | (i << shift));
3020 static GTY((param_is (union tree_node))) htab_t type_hash_table;
3022 /* Return the typed-based alias set for T, which may be an expression
3023 or a type. Return -1 if we don't do anything special. */
3026 c_common_get_alias_set (tree t)
3031 /* Permit type-punning when accessing a union, provided the access
3032 is directly through the union. For example, this code does not
3033 permit taking the address of a union member and then storing
3034 through it. Even the type-punning allowed here is a GCC
3035 extension, albeit a common and useful one; the C standard says
3036 that such accesses have implementation-defined behavior. */
3038 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
3039 u = TREE_OPERAND (u, 0))
3040 if (TREE_CODE (u) == COMPONENT_REF
3041 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
3044 /* That's all the expressions we handle specially. */
3048 /* The C standard guarantees that any object may be accessed via an
3049 lvalue that has character type. */
3050 if (t == char_type_node
3051 || t == signed_char_type_node
3052 || t == unsigned_char_type_node)
3055 /* If it has the may_alias attribute, it can alias anything. */
3056 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
3059 /* The C standard specifically allows aliasing between signed and
3060 unsigned variants of the same type. We treat the signed
3061 variant as canonical. */
3062 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
3064 tree t1 = c_common_signed_type (t);
3066 /* t1 == t can happen for boolean nodes which are always unsigned. */
3068 return get_alias_set (t1);
3070 else if (POINTER_TYPE_P (t))
3074 /* Unfortunately, there is no canonical form of a pointer type.
3075 In particular, if we have `typedef int I', then `int *', and
3076 `I *' are different types. So, we have to pick a canonical
3077 representative. We do this below.
3079 Technically, this approach is actually more conservative that
3080 it needs to be. In particular, `const int *' and `int *'
3081 should be in different alias sets, according to the C and C++
3082 standard, since their types are not the same, and so,
3083 technically, an `int **' and `const int **' cannot point at
3086 But, the standard is wrong. In particular, this code is
3091 const int* const* cipp = ipp;
3093 And, it doesn't make sense for that to be legal unless you
3094 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3095 the pointed-to types. This issue has been reported to the
3097 t1 = build_type_no_quals (t);
3099 return get_alias_set (t1);
3102 /* Handle the case of multiple type nodes referring to "the same" type,
3103 which occurs with IMA. These share an alias set. FIXME: Currently only
3104 C90 is handled. (In C99 type compatibility is not transitive, which
3105 complicates things mightily. The alias set splay trees can theoretically
3106 represent this, but insertion is tricky when you consider all the
3107 different orders things might arrive in.) */
3109 if (c_language != clk_c || flag_isoc99)
3112 /* Save time if there's only one input file. */
3113 if (num_in_fnames == 1)
3116 /* Pointers need special handling if they point to any type that
3117 needs special handling (below). */
3118 if (TREE_CODE (t) == POINTER_TYPE)
3121 /* Find bottom type under any nested POINTERs. */
3122 for (t2 = TREE_TYPE (t);
3123 TREE_CODE (t2) == POINTER_TYPE;
3124 t2 = TREE_TYPE (t2))
3126 if (TREE_CODE (t2) != RECORD_TYPE
3127 && TREE_CODE (t2) != ENUMERAL_TYPE
3128 && TREE_CODE (t2) != QUAL_UNION_TYPE
3129 && TREE_CODE (t2) != UNION_TYPE)
3131 if (TYPE_SIZE (t2) == 0)
3134 /* These are the only cases that need special handling. */
3135 if (TREE_CODE (t) != RECORD_TYPE
3136 && TREE_CODE (t) != ENUMERAL_TYPE
3137 && TREE_CODE (t) != QUAL_UNION_TYPE
3138 && TREE_CODE (t) != UNION_TYPE
3139 && TREE_CODE (t) != POINTER_TYPE)
3142 if (TYPE_SIZE (t) == 0)
3145 /* Look up t in hash table. Only one of the compatible types within each
3146 alias set is recorded in the table. */
3147 if (!type_hash_table)
3148 type_hash_table = htab_create_ggc (1021, c_type_hash,
3149 (htab_eq) lang_hooks.types_compatible_p,
3151 slot = htab_find_slot (type_hash_table, t, INSERT);
3154 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
3155 return TYPE_ALIAS_SET ((tree)*slot);
3158 /* Our caller will assign and record (in t) a new alias set; all we need
3159 to do is remember t in the hash table. */
3165 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3166 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3167 flag controls whether we should diagnose possibly ill-formed
3168 constructs or not. */
3171 c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain)
3173 const char *op_name;
3175 enum tree_code type_code = TREE_CODE (type);
3177 op_name = is_sizeof ? "sizeof" : "__alignof__";
3179 if (type_code == FUNCTION_TYPE)
3183 if (complain && (pedantic || warn_pointer_arith))
3184 pedwarn ("invalid application of %<sizeof%> to a function type");
3185 value = size_one_node;
3188 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3190 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3192 if (type_code == VOID_TYPE
3193 && complain && (pedantic || warn_pointer_arith))
3194 pedwarn ("invalid application of %qs to a void type", op_name);
3195 value = size_one_node;
3197 else if (!COMPLETE_TYPE_P (type))
3200 error ("invalid application of %qs to incomplete type %qT ",
3202 value = size_zero_node;
3207 /* Convert in case a char is more than one unit. */
3208 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3209 size_int (TYPE_PRECISION (char_type_node)
3212 value = size_int (TYPE_ALIGN_UNIT (type));
3215 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3216 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3217 never happen. However, this node should really have type
3218 `size_t', which is just a typedef for an ordinary integer type. */
3219 value = fold_convert (size_type_node, value);
3220 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
3225 /* Implement the __alignof keyword: Return the minimum required
3226 alignment of EXPR, measured in bytes. For VAR_DECL's and
3227 FIELD_DECL's return DECL_ALIGN (which can be set from an
3228 "aligned" __attribute__ specification). */
3231 c_alignof_expr (tree expr)
3235 if (TREE_CODE (expr) == VAR_DECL)
3236 t = size_int (DECL_ALIGN_UNIT (expr));
3238 else if (TREE_CODE (expr) == COMPONENT_REF
3239 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3241 error ("%<__alignof%> applied to a bit-field");
3244 else if (TREE_CODE (expr) == COMPONENT_REF
3245 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3246 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
3248 else if (TREE_CODE (expr) == INDIRECT_REF)
3250 tree t = TREE_OPERAND (expr, 0);
3252 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3254 while ((TREE_CODE (t) == NOP_EXPR || TREE_CODE (t) == CONVERT_EXPR)
3255 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3259 t = TREE_OPERAND (t, 0);
3260 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3261 if (thisalign > bestalign)
3262 best = t, bestalign = thisalign;
3264 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3267 return c_alignof (TREE_TYPE (expr));
3269 return fold_convert (size_type_node, t);
3272 /* Handle C and C++ default attributes. */
3274 enum built_in_attribute
3276 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3277 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3278 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3279 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3280 #include "builtin-attrs.def"
3281 #undef DEF_ATTR_NULL_TREE
3283 #undef DEF_ATTR_IDENT
3284 #undef DEF_ATTR_TREE_LIST
3288 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3290 static void c_init_attributes (void);
3294 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3295 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3296 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3297 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3298 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3299 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3300 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3301 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3302 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3303 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3304 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3305 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3306 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3307 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3308 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3310 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3311 #include "builtin-types.def"
3312 #undef DEF_PRIMITIVE_TYPE
3313 #undef DEF_FUNCTION_TYPE_0
3314 #undef DEF_FUNCTION_TYPE_1
3315 #undef DEF_FUNCTION_TYPE_2
3316 #undef DEF_FUNCTION_TYPE_3
3317 #undef DEF_FUNCTION_TYPE_4
3318 #undef DEF_FUNCTION_TYPE_5
3319 #undef DEF_FUNCTION_TYPE_6
3320 #undef DEF_FUNCTION_TYPE_7
3321 #undef DEF_FUNCTION_TYPE_VAR_0
3322 #undef DEF_FUNCTION_TYPE_VAR_1
3323 #undef DEF_FUNCTION_TYPE_VAR_2
3324 #undef DEF_FUNCTION_TYPE_VAR_3
3325 #undef DEF_FUNCTION_TYPE_VAR_4
3326 #undef DEF_FUNCTION_TYPE_VAR_5
3327 #undef DEF_POINTER_TYPE
3331 typedef enum c_builtin_type builtin_type;
3333 /* A temporary array for c_common_nodes_and_builtins. Used in
3334 communication with def_fn_type. */
3335 static tree builtin_types[(int) BT_LAST + 1];
3337 /* A helper function for c_common_nodes_and_builtins. Build function type
3338 for DEF with return type RET and N arguments. If VAR is true, then the
3339 function should be variadic after those N arguments.
3341 Takes special care not to ICE if any of the types involved are
3342 error_mark_node, which indicates that said type is not in fact available
3343 (see builtin_type_for_size). In which case the function type as a whole
3344 should be error_mark_node. */
3347 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
3349 tree args = NULL, t;
3354 for (i = 0; i < n; ++i)
3356 builtin_type a = va_arg (list, builtin_type);
3357 t = builtin_types[a];
3358 if (t == error_mark_node)
3360 args = tree_cons (NULL_TREE, t, args);
3364 args = nreverse (args);
3366 args = chainon (args, void_list_node);
3368 t = builtin_types[ret];
3369 if (t == error_mark_node)
3371 t = build_function_type (t, args);
3374 builtin_types[def] = t;
3377 /* Build builtin functions common to both C and C++ language
3381 c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
3383 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3384 builtin_types[ENUM] = VALUE;
3385 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3386 def_fn_type (ENUM, RETURN, 0, 0);
3387 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3388 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3389 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3390 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3391 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3392 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3393 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3394 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3395 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3396 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3397 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3399 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3400 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3402 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3403 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3404 def_fn_type (ENUM, RETURN, 1, 0);
3405 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3406 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3407 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3408 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3409 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3410 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3411 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3412 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3413 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3414 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3415 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3416 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3418 #include "builtin-types.def"
3420 #undef DEF_PRIMITIVE_TYPE
3421 #undef DEF_FUNCTION_TYPE_1
3422 #undef DEF_FUNCTION_TYPE_2
3423 #undef DEF_FUNCTION_TYPE_3
3424 #undef DEF_FUNCTION_TYPE_4
3425 #undef DEF_FUNCTION_TYPE_5
3426 #undef DEF_FUNCTION_TYPE_6
3427 #undef DEF_FUNCTION_TYPE_VAR_0
3428 #undef DEF_FUNCTION_TYPE_VAR_1
3429 #undef DEF_FUNCTION_TYPE_VAR_2
3430 #undef DEF_FUNCTION_TYPE_VAR_3
3431 #undef DEF_FUNCTION_TYPE_VAR_4
3432 #undef DEF_FUNCTION_TYPE_VAR_5
3433 #undef DEF_POINTER_TYPE
3434 builtin_types[(int) BT_LAST] = NULL_TREE;
3436 c_init_attributes ();
3438 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3439 NONANSI_P, ATTRS, IMPLICIT, COND) \
3441 def_builtin_1 (ENUM, NAME, CLASS, \
3442 builtin_types[(int) TYPE], \
3443 builtin_types[(int) LIBTYPE], \
3444 BOTH_P, FALLBACK_P, NONANSI_P, \
3445 built_in_attributes[(int) ATTRS], IMPLICIT);
3446 #include "builtins.def"
3449 build_common_builtin_nodes ();
3451 targetm.init_builtins ();
3456 /* Build tree nodes and builtin functions common to both C and C++ language
3460 c_common_nodes_and_builtins (void)
3462 int wchar_type_size;
3463 tree array_domain_type;
3464 tree va_list_ref_type_node;
3465 tree va_list_arg_type_node;
3467 /* Define `int' and `char' first so that dbx will output them first. */
3468 record_builtin_type (RID_INT, NULL, integer_type_node);
3469 record_builtin_type (RID_CHAR, "char", char_type_node);
3471 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3472 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3473 but not C. Are the conditionals here needed? */
3474 if (c_dialect_cxx ())
3475 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3476 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3477 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3478 record_builtin_type (RID_MAX, "long unsigned int",
3479 long_unsigned_type_node);
3480 if (c_dialect_cxx ())
3481 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3482 record_builtin_type (RID_MAX, "long long int",
3483 long_long_integer_type_node);
3484 record_builtin_type (RID_MAX, "long long unsigned int",
3485 long_long_unsigned_type_node);
3486 if (c_dialect_cxx ())
3487 record_builtin_type (RID_MAX, "long long unsigned",
3488 long_long_unsigned_type_node);
3489 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3490 record_builtin_type (RID_MAX, "short unsigned int",
3491 short_unsigned_type_node);
3492 if (c_dialect_cxx ())
3493 record_builtin_type (RID_MAX, "unsigned short",
3494 short_unsigned_type_node);
3496 /* Define both `signed char' and `unsigned char'. */
3497 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3498 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3500 /* These are types that c_common_type_for_size and
3501 c_common_type_for_mode use. */
3502 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3504 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3506 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3508 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3510 #if HOST_BITS_PER_WIDE_INT >= 64
3511 if (targetm.scalar_mode_supported_p (TImode))
3512 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3513 get_identifier ("__int128_t"),
3516 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3517 unsigned_intQI_type_node));
3518 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3519 unsigned_intHI_type_node));
3520 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3521 unsigned_intSI_type_node));
3522 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3523 unsigned_intDI_type_node));
3524 #if HOST_BITS_PER_WIDE_INT >= 64
3525 if (targetm.scalar_mode_supported_p (TImode))
3526 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3527 get_identifier ("__uint128_t"),
3528 unsigned_intTI_type_node));
3531 /* Create the widest literal types. */
3532 widest_integer_literal_type_node
3533 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3534 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3535 widest_integer_literal_type_node));
3537 widest_unsigned_literal_type_node
3538 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3539 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3540 widest_unsigned_literal_type_node));
3542 /* `unsigned long' is the standard type for sizeof.
3543 Note that stddef.h uses `unsigned long',
3544 and this must agree, even if long and int are the same size. */
3546 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3547 signed_size_type_node = c_common_signed_type (size_type_node);
3548 set_sizetype (size_type_node);
3551 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3553 build_common_tree_nodes_2 (flag_short_double);
3555 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3556 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3557 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3559 /* Only supported decimal floating point extension if the target
3560 actually supports underlying modes. */
3561 if (targetm.scalar_mode_supported_p (SDmode)
3562 && targetm.scalar_mode_supported_p (DDmode)
3563 && targetm.scalar_mode_supported_p (TDmode))
3565 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
3566 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
3567 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
3570 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3571 get_identifier ("complex int"),
3572 complex_integer_type_node));
3573 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3574 get_identifier ("complex float"),
3575 complex_float_type_node));
3576 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3577 get_identifier ("complex double"),
3578 complex_double_type_node));
3579 lang_hooks.decls.pushdecl
3580 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3581 complex_long_double_type_node));
3583 if (c_dialect_cxx ())
3584 /* For C++, make fileptr_type_node a distinct void * type until
3585 FILE type is defined. */
3586 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3588 record_builtin_type (RID_VOID, NULL, void_type_node);
3590 /* Set the TYPE_NAME for any variants that were built before
3591 record_builtin_type gave names to the built-in types. */
3593 tree void_name = TYPE_NAME (void_type_node);
3594 TYPE_NAME (void_type_node) = NULL_TREE;
3595 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
3597 TYPE_NAME (void_type_node) = void_name;
3600 /* This node must not be shared. */
3601 void_zero_node = make_node (INTEGER_CST);
3602 TREE_TYPE (void_zero_node) = void_type_node;
3604 void_list_node = build_void_list_node ();
3606 /* Make a type to be the domain of a few array types
3607 whose domains don't really matter.
3608 200 is small enough that it always fits in size_t
3609 and large enough that it can hold most function names for the
3610 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3611 array_domain_type = build_index_type (size_int (200));
3613 /* Make a type for arrays of characters.
3614 With luck nothing will ever really depend on the length of this
3616 char_array_type_node
3617 = build_array_type (char_type_node, array_domain_type);
3619 /* Likewise for arrays of ints. */
3621 = build_array_type (integer_type_node, array_domain_type);
3623 string_type_node = build_pointer_type (char_type_node);
3624 const_string_type_node
3625 = build_pointer_type (build_qualified_type
3626 (char_type_node, TYPE_QUAL_CONST));
3628 /* This is special for C++ so functions can be overloaded. */
3629 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3630 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3631 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3632 if (c_dialect_cxx ())
3634 if (TYPE_UNSIGNED (wchar_type_node))
3635 wchar_type_node = make_unsigned_type (wchar_type_size);
3637 wchar_type_node = make_signed_type (wchar_type_size);
3638 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3642 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3643 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3646 /* This is for wide string constants. */
3647 wchar_array_type_node
3648 = build_array_type (wchar_type_node, array_domain_type);
3651 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3654 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3656 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3658 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3660 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3661 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3663 lang_hooks.decls.pushdecl
3664 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3665 va_list_type_node));
3667 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3669 va_list_arg_type_node = va_list_ref_type_node =
3670 build_pointer_type (TREE_TYPE (va_list_type_node));
3674 va_list_arg_type_node = va_list_type_node;
3675 va_list_ref_type_node = build_reference_type (va_list_type_node);
3678 if (!flag_preprocess_only)
3679 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
3681 main_identifier_node = get_identifier ("main");
3683 /* Create the built-in __null node. It is important that this is
3685 null_node = make_node (INTEGER_CST);
3686 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
3688 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3689 memset (builtin_types, 0, sizeof (builtin_types));
3692 /* Look up the function in built_in_decls that corresponds to DECL
3693 and set ASMSPEC as its user assembler name. DECL must be a
3694 function decl that declares a builtin. */
3697 set_builtin_user_assembler_name (tree decl, const char *asmspec)
3700 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
3701 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
3704 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
3705 set_user_assembler_name (builtin, asmspec);
3706 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
3707 init_block_move_fn (asmspec);
3708 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
3709 init_block_clear_fn (asmspec);
3712 /* The number of named compound-literals generated thus far. */
3713 static GTY(()) int compound_literal_number;
3715 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3718 set_compound_literal_name (tree decl)
3721 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
3722 compound_literal_number);
3723 compound_literal_number++;
3724 DECL_NAME (decl) = get_identifier (name);
3728 build_va_arg (tree expr, tree type)
3730 return build1 (VA_ARG_EXPR, type, expr);
3734 /* Linked list of disabled built-in functions. */
3736 typedef struct disabled_builtin
3739 struct disabled_builtin *next;
3741 static disabled_builtin *disabled_builtins = NULL;
3743 static bool builtin_function_disabled_p (const char *);
3745 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3746 begins with "__builtin_", give an error. */
3749 disable_builtin_function (const char *name)
3751 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3752 error ("cannot disable built-in function %qs", name);
3755 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3756 new_disabled_builtin->name = name;
3757 new_disabled_builtin->next = disabled_builtins;
3758 disabled_builtins = new_disabled_builtin;
3763 /* Return true if the built-in function NAME has been disabled, false
3767 builtin_function_disabled_p (const char *name)
3769 disabled_builtin *p;
3770 for (p = disabled_builtins; p != NULL; p = p->next)
3772 if (strcmp (name, p->name) == 0)
3779 /* Worker for DEF_BUILTIN.
3780 Possibly define a builtin function with one or two names.
3781 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3782 nonansi_p and flag_no_nonansi_builtin. */
3785 def_builtin_1 (enum built_in_function fncode,
3787 enum built_in_class fnclass,
3788 tree fntype, tree libtype,
3789 bool both_p, bool fallback_p, bool nonansi_p,
3790 tree fnattrs, bool implicit_p)
3793 const char *libname;
3795 if (fntype == error_mark_node)
3798 gcc_assert ((!both_p && !fallback_p)
3799 || !strncmp (name, "__builtin_",
3800 strlen ("__builtin_")));
3802 libname = name + strlen ("__builtin_");
3803 decl = add_builtin_function (name, fntype, fncode, fnclass,
3804 (fallback_p ? libname : NULL),
3807 && !flag_no_builtin && !builtin_function_disabled_p (libname)
3808 && !(nonansi_p && flag_no_nonansi_builtin))
3809 add_builtin_function (libname, libtype, fncode, fnclass,
3812 built_in_decls[(int) fncode] = decl;
3814 implicit_built_in_decls[(int) fncode] = decl;
3817 /* Nonzero if the type T promotes to int. This is (nearly) the
3818 integral promotions defined in ISO C99 6.3.1.1/2. */
3821 c_promoting_integer_type_p (tree t)
3823 switch (TREE_CODE (t))
3826 return (TYPE_MAIN_VARIANT (t) == char_type_node
3827 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3828 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3829 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3830 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3831 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3834 /* ??? Technically all enumerations not larger than an int
3835 promote to an int. But this is used along code paths
3836 that only want to notice a size change. */
3837 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3847 /* Return 1 if PARMS specifies a fixed number of parameters
3848 and none of their types is affected by default promotions. */
3851 self_promoting_args_p (tree parms)
3854 for (t = parms; t; t = TREE_CHAIN (t))
3856 tree type = TREE_VALUE (t);
3858 if (type == error_mark_node)
3861 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3867 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3870 if (c_promoting_integer_type_p (type))
3876 /* Recursively examines the array elements of TYPE, until a non-array
3877 element type is found. */
3880 strip_array_types (tree type)
3882 while (TREE_CODE (type) == ARRAY_TYPE)
3883 type = TREE_TYPE (type);
3888 /* Recursively remove any '*' or '&' operator from TYPE. */
3890 strip_pointer_operator (tree t)
3892 while (POINTER_TYPE_P (t))
3897 /* Used to compare case labels. K1 and K2 are actually tree nodes
3898 representing case labels, or NULL_TREE for a `default' label.
3899 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3900 K2, and 0 if K1 and K2 are equal. */
3903 case_compare (splay_tree_key k1, splay_tree_key k2)
3905 /* Consider a NULL key (such as arises with a `default' label) to be
3906 smaller than anything else. */
3912 return tree_int_cst_compare ((tree) k1, (tree) k2);
3915 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3916 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3917 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3918 case label was declared using the usual C/C++ syntax, rather than
3919 the GNU case range extension. CASES is a tree containing all the
3920 case ranges processed so far; COND is the condition for the
3921 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3922 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3925 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3926 tree low_value, tree high_value)
3931 splay_tree_node node;
3933 /* Create the LABEL_DECL itself. */
3934 label = create_artificial_label ();
3936 /* If there was an error processing the switch condition, bail now
3937 before we get more confused. */
3938 if (!cond || cond == error_mark_node)
3941 if ((low_value && TREE_TYPE (low_value)
3942 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3943 || (high_value && TREE_TYPE (high_value)
3944 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3946 error ("pointers are not permitted as case values");
3950 /* Case ranges are a GNU extension. */
3951 if (high_value && pedantic)
3952 pedwarn ("range expressions in switch statements are non-standard");
3954 type = TREE_TYPE (cond);
3957 low_value = check_case_value (low_value);
3958 low_value = convert_and_check (type, low_value);
3959 if (low_value == error_mark_node)
3964 high_value = check_case_value (high_value);
3965 high_value = convert_and_check (type, high_value);
3966 if (high_value == error_mark_node)
3970 if (low_value && high_value)
3972 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3973 really a case range, even though it was written that way.
3974 Remove the HIGH_VALUE to simplify later processing. */
3975 if (tree_int_cst_equal (low_value, high_value))
3976 high_value = NULL_TREE;
3977 else if (!tree_int_cst_lt (low_value, high_value))
3978 warning (0, "empty range specified");
3981 /* See if the case is in range of the type of the original testing
3982 expression. If both low_value and high_value are out of range,
3983 don't insert the case label and return NULL_TREE. */
3985 && !check_case_bounds (type, orig_type,
3986 &low_value, high_value ? &high_value : NULL))
3989 /* Look up the LOW_VALUE in the table of case labels we already
3991 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3992 /* If there was not an exact match, check for overlapping ranges.
3993 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3994 that's a `default' label and the only overlap is an exact match. */
3995 if (!node && (low_value || high_value))
3997 splay_tree_node low_bound;
3998 splay_tree_node high_bound;
4000 /* Even though there wasn't an exact match, there might be an
4001 overlap between this case range and another case range.
4002 Since we've (inductively) not allowed any overlapping case
4003 ranges, we simply need to find the greatest low case label
4004 that is smaller that LOW_VALUE, and the smallest low case
4005 label that is greater than LOW_VALUE. If there is an overlap
4006 it will occur in one of these two ranges. */
4007 low_bound = splay_tree_predecessor (cases,
4008 (splay_tree_key) low_value);
4009 high_bound = splay_tree_successor (cases,
4010 (splay_tree_key) low_value);
4012 /* Check to see if the LOW_BOUND overlaps. It is smaller than
4013 the LOW_VALUE, so there is no need to check unless the
4014 LOW_BOUND is in fact itself a case range. */
4016 && CASE_HIGH ((tree) low_bound->value)
4017 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
4020 /* Check to see if the HIGH_BOUND overlaps. The low end of that
4021 range is bigger than the low end of the current range, so we
4022 are only interested if the current range is a real range, and
4023 not an ordinary case label. */
4026 && (tree_int_cst_compare ((tree) high_bound->key,
4031 /* If there was an overlap, issue an error. */
4034 tree duplicate = CASE_LABEL ((tree) node->value);
4038 error ("duplicate (or overlapping) case value");
4039 error ("%Jthis is the first entry overlapping that value", duplicate);
4043 error ("duplicate case value") ;
4044 error ("%Jpreviously used here", duplicate);
4048 error ("multiple default labels in one switch");
4049 error ("%Jthis is the first default label", duplicate);
4054 /* Add a CASE_LABEL to the statement-tree. */
4055 case_label = add_stmt (build_case_label (low_value, high_value, label));
4056 /* Register this case label in the splay tree. */
4057 splay_tree_insert (cases,
4058 (splay_tree_key) low_value,
4059 (splay_tree_value) case_label);
4064 /* Add a label so that the back-end doesn't think that the beginning of
4065 the switch is unreachable. Note that we do not add a case label, as
4066 that just leads to duplicates and thence to failure later on. */
4069 tree t = create_artificial_label ();
4070 add_stmt (build_stmt (LABEL_EXPR, t));
4072 return error_mark_node;
4075 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4076 Used to verify that case values match up with enumerator values. */
4079 match_case_to_enum_1 (tree key, tree type, tree label)
4081 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
4083 /* ??? Not working too hard to print the double-word value.
4084 Should perhaps be done with %lwd in the diagnostic routines? */
4085 if (TREE_INT_CST_HIGH (key) == 0)
4086 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
4087 TREE_INT_CST_LOW (key));
4088 else if (!TYPE_UNSIGNED (type)
4089 && TREE_INT_CST_HIGH (key) == -1
4090 && TREE_INT_CST_LOW (key) != 0)
4091 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
4092 -TREE_INT_CST_LOW (key));
4094 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
4095 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
4097 if (TYPE_NAME (type) == 0)
4098 warning (0, "%Jcase value %qs not in enumerated type",
4099 CASE_LABEL (label), buf);
4101 warning (0, "%Jcase value %qs not in enumerated type %qT",
4102 CASE_LABEL (label), buf, type);
4105 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4106 Used to verify that case values match up with enumerator values. */
4109 match_case_to_enum (splay_tree_node node, void *data)
4111 tree label = (tree) node->value;
4112 tree type = (tree) data;
4114 /* Skip default case. */
4115 if (!CASE_LOW (label))
4118 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4119 when we did our enum->case scan. Reset our scratch bit after. */
4120 if (!CASE_LOW_SEEN (label))
4121 match_case_to_enum_1 (CASE_LOW (label), type, label);
4123 CASE_LOW_SEEN (label) = 0;
4125 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4126 not set, that means that CASE_HIGH did not appear when we did our
4127 enum->case scan. Reset our scratch bit after. */
4128 if (CASE_HIGH (label))
4130 if (!CASE_HIGH_SEEN (label))
4131 match_case_to_enum_1 (CASE_HIGH (label), type, label);
4133 CASE_HIGH_SEEN (label) = 0;
4139 /* Handle -Wswitch*. Called from the front end after parsing the
4140 switch construct. */
4141 /* ??? Should probably be somewhere generic, since other languages
4142 besides C and C++ would want this. At the moment, however, C/C++
4143 are the only tree-ssa languages that support enumerations at all,
4144 so the point is moot. */
4147 c_do_switch_warnings (splay_tree cases, location_t switch_location,
4148 tree type, tree cond)
4150 splay_tree_node default_node;
4151 splay_tree_node node;
4154 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4157 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4159 warning (OPT_Wswitch_default, "%Hswitch missing default case",
4162 /* From here on, we only care about about enumerated types. */
4163 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
4166 /* If the switch expression was an enumerated type, check that
4167 exactly all enumeration literals are covered by the cases.
4168 The check is made when -Wswitch was specified and there is no
4169 default case, or when -Wswitch-enum was specified. */
4171 if (!warn_switch_enum
4172 && !(warn_switch && !default_node))
4175 /* Clearing COND if it is not an integer constant simplifies
4176 the tests inside the loop below. */
4177 if (TREE_CODE (cond) != INTEGER_CST)
4180 /* The time complexity here is O(N*lg(N)) worst case, but for the
4181 common case of monotonically increasing enumerators, it is
4182 O(N), since the nature of the splay tree will keep the next
4183 element adjacent to the root at all times. */
4185 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4187 tree value = TREE_VALUE (chain);
4188 node = splay_tree_lookup (cases, (splay_tree_key) value);
4191 /* Mark the CASE_LOW part of the case entry as seen. */
4192 tree label = (tree) node->value;
4193 CASE_LOW_SEEN (label) = 1;
4197 /* Even though there wasn't an exact match, there might be a
4198 case range which includes the enumator's value. */
4199 node = splay_tree_predecessor (cases, (splay_tree_key) value);
4200 if (node && CASE_HIGH ((tree) node->value))
4202 tree label = (tree) node->value;
4203 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
4206 /* If we match the upper bound exactly, mark the CASE_HIGH
4207 part of the case entry as seen. */
4209 CASE_HIGH_SEEN (label) = 1;
4214 /* We've now determined that this enumerated literal isn't
4215 handled by the case labels of the switch statement. */
4217 /* If the switch expression is a constant, we only really care
4218 about whether that constant is handled by the switch. */
4219 if (cond && tree_int_cst_compare (cond, value))
4222 warning (0, "%Henumeration value %qE not handled in switch",
4223 &switch_location, TREE_PURPOSE (chain));
4226 /* Warn if there are case expressions that don't correspond to
4227 enumerators. This can occur since C and C++ don't enforce
4228 type-checking of assignments to enumeration variables.
4230 The time complexity here is now always O(N) worst case, since
4231 we should have marked both the lower bound and upper bound of
4232 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4233 above. This scan also resets those fields. */
4234 splay_tree_foreach (cases, match_case_to_enum, type);
4237 /* Finish an expression taking the address of LABEL (an
4238 IDENTIFIER_NODE). Returns an expression for the address. */
4241 finish_label_address_expr (tree label)
4246 pedwarn ("taking the address of a label is non-standard");
4248 if (label == error_mark_node)
4249 return error_mark_node;
4251 label = lookup_label (label);
4252 if (label == NULL_TREE)
4253 result = null_pointer_node;
4256 TREE_USED (label) = 1;
4257 result = build1 (ADDR_EXPR, ptr_type_node, label);
4258 /* The current function in not necessarily uninlinable.
4259 Computed gotos are incompatible with inlining, but the value
4260 here could be used only in a diagnostic, for example. */
4266 /* Hook used by expand_expr to expand language-specific tree codes. */
4267 /* The only things that should go here are bits needed to expand
4268 constant initializers. Everything else should be handled by the
4269 gimplification routines. */
4272 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4273 int modifier /* Actually enum_modifier. */,
4276 switch (TREE_CODE (exp))
4278 case COMPOUND_LITERAL_EXPR:
4280 /* Initialize the anonymous variable declared in the compound
4281 literal, then return the variable. */
4282 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4283 emit_local_var (decl);
4284 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4293 /* Generate the RTL for the body of FNDECL. */
4296 c_expand_body (tree fndecl)
4299 if (!DECL_INITIAL (fndecl)
4300 || DECL_INITIAL (fndecl) == error_mark_node)
4303 tree_rest_of_compilation (fndecl);
4305 if (DECL_STATIC_CONSTRUCTOR (fndecl)
4306 && targetm.have_ctors_dtors)
4307 targetm.asm_out.constructor (XEXP (DECL_RTL (fndecl), 0),
4308 decl_init_priority_lookup (fndecl));
4309 if (DECL_STATIC_DESTRUCTOR (fndecl)
4310 && targetm.have_ctors_dtors)
4311 targetm.asm_out.destructor (XEXP (DECL_RTL (fndecl), 0),
4312 decl_fini_priority_lookup (fndecl));
4315 /* Hook used by staticp to handle language-specific tree codes. */
4318 c_staticp (tree exp)
4320 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4321 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
4326 /* Given a boolean expression ARG, return a tree representing an increment
4327 or decrement (as indicated by CODE) of ARG. The front end must check for
4328 invalid cases (e.g., decrement in C++). */
4330 boolean_increment (enum tree_code code, tree arg)
4333 tree true_res = boolean_true_node;
4335 arg = stabilize_reference (arg);
4338 case PREINCREMENT_EXPR:
4339 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4341 case POSTINCREMENT_EXPR:
4342 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4343 arg = save_expr (arg);
4344 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4345 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4347 case PREDECREMENT_EXPR:
4348 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4349 invert_truthvalue (arg));
4351 case POSTDECREMENT_EXPR:
4352 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4353 invert_truthvalue (arg));
4354 arg = save_expr (arg);
4355 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4356 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4361 TREE_SIDE_EFFECTS (val) = 1;
4365 /* Built-in macros for stddef.h, that require macros defined in this
4368 c_stddef_cpp_builtins(void)
4370 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4371 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4372 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4373 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4374 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
4375 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
4379 c_init_attributes (void)
4381 /* Fill in the built_in_attributes array. */
4382 #define DEF_ATTR_NULL_TREE(ENUM) \
4383 built_in_attributes[(int) ENUM] = NULL_TREE;
4384 #define DEF_ATTR_INT(ENUM, VALUE) \
4385 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4386 #define DEF_ATTR_IDENT(ENUM, STRING) \
4387 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4388 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4389 built_in_attributes[(int) ENUM] \
4390 = tree_cons (built_in_attributes[(int) PURPOSE], \
4391 built_in_attributes[(int) VALUE], \
4392 built_in_attributes[(int) CHAIN]);
4393 #include "builtin-attrs.def"
4394 #undef DEF_ATTR_NULL_TREE
4396 #undef DEF_ATTR_IDENT
4397 #undef DEF_ATTR_TREE_LIST
4400 /* Attribute handlers common to C front ends. */
4402 /* Handle a "packed" attribute; arguments as in
4403 struct attribute_spec.handler. */
4406 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4407 int flags, bool *no_add_attrs)
4411 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4412 *node = build_variant_type_copy (*node);
4413 TYPE_PACKED (*node) = 1;
4415 else if (TREE_CODE (*node) == FIELD_DECL)
4417 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT)
4418 warning (OPT_Wattributes,
4419 "%qE attribute ignored for field of type %qT",
4420 name, TREE_TYPE (*node));
4422 DECL_PACKED (*node) = 1;
4424 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4425 used for DECL_REGISTER. It wouldn't mean anything anyway.
4426 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4427 that changes what the typedef is typing. */
4430 warning (OPT_Wattributes, "%qE attribute ignored", name);
4431 *no_add_attrs = true;
4437 /* Handle a "nocommon" attribute; arguments as in
4438 struct attribute_spec.handler. */
4441 handle_nocommon_attribute (tree *node, tree name,
4442 tree ARG_UNUSED (args),
4443 int ARG_UNUSED (flags), bool *no_add_attrs)
4445 if (TREE_CODE (*node) == VAR_DECL)
4446 DECL_COMMON (*node) = 0;
4449 warning (OPT_Wattributes, "%qE attribute ignored", name);
4450 *no_add_attrs = true;
4456 /* Handle a "common" attribute; arguments as in
4457 struct attribute_spec.handler. */
4460 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4461 int ARG_UNUSED (flags), bool *no_add_attrs)
4463 if (TREE_CODE (*node) == VAR_DECL)
4464 DECL_COMMON (*node) = 1;
4467 warning (OPT_Wattributes, "%qE attribute ignored", name);
4468 *no_add_attrs = true;
4474 /* Handle a "noreturn" attribute; arguments as in
4475 struct attribute_spec.handler. */
4478 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4479 int ARG_UNUSED (flags), bool *no_add_attrs)
4481 tree type = TREE_TYPE (*node);
4483 /* See FIXME comment in c_common_attribute_table. */
4484 if (TREE_CODE (*node) == FUNCTION_DECL)
4485 TREE_THIS_VOLATILE (*node) = 1;
4486 else if (TREE_CODE (type) == POINTER_TYPE
4487 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4489 = build_pointer_type
4490 (build_type_variant (TREE_TYPE (type),
4491 TYPE_READONLY (TREE_TYPE (type)), 1));
4494 warning (OPT_Wattributes, "%qE attribute ignored", name);
4495 *no_add_attrs = true;
4501 /* Handle a "hot" and attribute; arguments as in
4502 struct attribute_spec.handler. */
4505 handle_hot_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4506 int ARG_UNUSED (flags), bool *no_add_attrs)
4508 if (TREE_CODE (*node) == FUNCTION_DECL)
4510 if (lookup_attribute ("cold", DECL_ATTRIBUTES (*node)) != NULL)
4512 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
4514 *no_add_attrs = true;
4516 /* Do nothing else, just set the attribute. We'll get at
4517 it later with lookup_attribute. */
4521 warning (OPT_Wattributes, "%qE attribute ignored", name);
4522 *no_add_attrs = true;
4527 /* Handle a "cold" and attribute; arguments as in
4528 struct attribute_spec.handler. */
4531 handle_cold_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4532 int ARG_UNUSED (flags), bool *no_add_attrs)
4534 if (TREE_CODE (*node) == FUNCTION_DECL)
4536 if (lookup_attribute ("hot", DECL_ATTRIBUTES (*node)) != NULL)
4538 warning (OPT_Wattributes, "%qE attribute conflicts with attribute %s",
4540 *no_add_attrs = true;
4542 /* Do nothing else, just set the attribute. We'll get at
4543 it later with lookup_attribute. */
4547 warning (OPT_Wattributes, "%qE attribute ignored", name);
4548 *no_add_attrs = true;
4554 /* Handle a "noinline" attribute; arguments as in
4555 struct attribute_spec.handler. */
4558 handle_noinline_attribute (tree *node, tree name,
4559 tree ARG_UNUSED (args),
4560 int ARG_UNUSED (flags), bool *no_add_attrs)
4562 if (TREE_CODE (*node) == FUNCTION_DECL)
4563 DECL_UNINLINABLE (*node) = 1;
4566 warning (OPT_Wattributes, "%qE attribute ignored", name);
4567 *no_add_attrs = true;
4573 /* Handle a "always_inline" attribute; arguments as in
4574 struct attribute_spec.handler. */
4577 handle_always_inline_attribute (tree *node, tree name,
4578 tree ARG_UNUSED (args),
4579 int ARG_UNUSED (flags),
4582 if (TREE_CODE (*node) == FUNCTION_DECL)
4584 /* Do nothing else, just set the attribute. We'll get at
4585 it later with lookup_attribute. */
4589 warning (OPT_Wattributes, "%qE attribute ignored", name);
4590 *no_add_attrs = true;
4596 /* Handle a "gnu_inline" attribute; arguments as in
4597 struct attribute_spec.handler. */
4600 handle_gnu_inline_attribute (tree *node, tree name,
4601 tree ARG_UNUSED (args),
4602 int ARG_UNUSED (flags),
4605 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
4607 /* Do nothing else, just set the attribute. We'll get at
4608 it later with lookup_attribute. */
4612 warning (OPT_Wattributes, "%qE attribute ignored", name);
4613 *no_add_attrs = true;
4619 /* Handle a "flatten" attribute; arguments as in
4620 struct attribute_spec.handler. */
4623 handle_flatten_attribute (tree *node, tree name,
4624 tree args ATTRIBUTE_UNUSED,
4625 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4627 if (TREE_CODE (*node) == FUNCTION_DECL)
4628 /* Do nothing else, just set the attribute. We'll get at
4629 it later with lookup_attribute. */
4633 warning (OPT_Wattributes, "%qE attribute ignored", name);
4634 *no_add_attrs = true;
4641 /* Handle a "used" attribute; arguments as in
4642 struct attribute_spec.handler. */
4645 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4646 int ARG_UNUSED (flags), bool *no_add_attrs)
4650 if (TREE_CODE (node) == FUNCTION_DECL
4651 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4653 TREE_USED (node) = 1;
4654 DECL_PRESERVE_P (node) = 1;
4658 warning (OPT_Wattributes, "%qE attribute ignored", name);
4659 *no_add_attrs = true;
4665 /* Handle a "unused" attribute; arguments as in
4666 struct attribute_spec.handler. */
4669 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4670 int flags, bool *no_add_attrs)
4676 if (TREE_CODE (decl) == PARM_DECL
4677 || TREE_CODE (decl) == VAR_DECL
4678 || TREE_CODE (decl) == FUNCTION_DECL
4679 || TREE_CODE (decl) == LABEL_DECL
4680 || TREE_CODE (decl) == TYPE_DECL)
4681 TREE_USED (decl) = 1;
4684 warning (OPT_Wattributes, "%qE attribute ignored", name);
4685 *no_add_attrs = true;
4690 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4691 *node = build_variant_type_copy (*node);
4692 TREE_USED (*node) = 1;
4698 /* Handle a "externally_visible" attribute; arguments as in
4699 struct attribute_spec.handler. */
4702 handle_externally_visible_attribute (tree *pnode, tree name,
4703 tree ARG_UNUSED (args),
4704 int ARG_UNUSED (flags),
4709 if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
4711 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
4712 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
4714 warning (OPT_Wattributes,
4715 "%qE attribute have effect only on public objects", name);
4716 *no_add_attrs = true;
4721 warning (OPT_Wattributes, "%qE attribute ignored", name);
4722 *no_add_attrs = true;
4728 /* Handle a "const" attribute; arguments as in
4729 struct attribute_spec.handler. */
4732 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4733 int ARG_UNUSED (flags), bool *no_add_attrs)
4735 tree type = TREE_TYPE (*node);
4737 /* See FIXME comment on noreturn in c_common_attribute_table. */
4738 if (TREE_CODE (*node) == FUNCTION_DECL)
4739 TREE_READONLY (*node) = 1;
4740 else if (TREE_CODE (type) == POINTER_TYPE
4741 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4743 = build_pointer_type
4744 (build_type_variant (TREE_TYPE (type), 1,
4745 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4748 warning (OPT_Wattributes, "%qE attribute ignored", name);
4749 *no_add_attrs = true;
4755 /* Handle a "transparent_union" attribute; arguments as in
4756 struct attribute_spec.handler. */
4759 handle_transparent_union_attribute (tree *node, tree name,
4760 tree ARG_UNUSED (args), int flags,
4765 *no_add_attrs = true;
4769 if (TREE_CODE (*node) != TYPE_DECL)
4771 node = &TREE_TYPE (*node);
4774 else if (TYPE_P (*node))
4779 if (TREE_CODE (type) == UNION_TYPE)
4781 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4782 the code in finish_struct. */
4783 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4785 if (TYPE_FIELDS (type) == NULL_TREE
4786 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
4789 /* A type variant isn't good enough, since we don't a cast
4790 to such a type removed as a no-op. */
4791 *node = type = build_duplicate_type (type);
4794 TYPE_TRANSPARENT_UNION (type) = 1;
4799 warning (OPT_Wattributes, "%qE attribute ignored", name);
4803 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
4804 get the requested priority for a constructor or destructor,
4805 possibly issuing diagnostics for invalid or reserved
4808 static priority_type
4809 get_priority (tree args, bool is_destructor)
4815 return DEFAULT_INIT_PRIORITY;
4817 if (!SUPPORTS_INIT_PRIORITY)
4820 error ("destructor priorities are not supported");
4822 error ("constructor priorities are not supported");
4823 return DEFAULT_INIT_PRIORITY;
4826 arg = TREE_VALUE (args);
4827 if (!host_integerp (arg, /*pos=*/0)
4828 || !INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4831 pri = tree_low_cst (TREE_VALUE (args), /*pos=*/0);
4832 if (pri < 0 || pri > MAX_INIT_PRIORITY)
4835 if (pri <= MAX_RESERVED_INIT_PRIORITY)
4839 "destructor priorities from 0 to %d are reserved "
4840 "for the implementation",
4841 MAX_RESERVED_INIT_PRIORITY);
4844 "constructor priorities from 0 to %d are reserved "
4845 "for the implementation",
4846 MAX_RESERVED_INIT_PRIORITY);
4852 error ("destructor priorities must be integers from 0 to %d inclusive",
4855 error ("constructor priorities must be integers from 0 to %d inclusive",
4857 return DEFAULT_INIT_PRIORITY;
4860 /* Handle a "constructor" attribute; arguments as in
4861 struct attribute_spec.handler. */
4864 handle_constructor_attribute (tree *node, tree name, tree args,
4865 int ARG_UNUSED (flags),
4869 tree type = TREE_TYPE (decl);
4871 if (TREE_CODE (decl) == FUNCTION_DECL
4872 && TREE_CODE (type) == FUNCTION_TYPE
4873 && decl_function_context (decl) == 0)
4875 priority_type priority;
4876 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4877 priority = get_priority (args, /*is_destructor=*/false);
4878 SET_DECL_INIT_PRIORITY (decl, priority);
4879 TREE_USED (decl) = 1;
4883 warning (OPT_Wattributes, "%qE attribute ignored", name);
4884 *no_add_attrs = true;
4890 /* Handle a "destructor" attribute; arguments as in
4891 struct attribute_spec.handler. */
4894 handle_destructor_attribute (tree *node, tree name, tree args,
4895 int ARG_UNUSED (flags),
4899 tree type = TREE_TYPE (decl);
4901 if (TREE_CODE (decl) == FUNCTION_DECL
4902 && TREE_CODE (type) == FUNCTION_TYPE
4903 && decl_function_context (decl) == 0)
4905 priority_type priority;
4906 DECL_STATIC_DESTRUCTOR (decl) = 1;
4907 priority = get_priority (args, /*is_destructor=*/true);
4908 SET_DECL_FINI_PRIORITY (decl, priority);
4909 TREE_USED (decl) = 1;
4913 warning (OPT_Wattributes, "%qE attribute ignored", name);
4914 *no_add_attrs = true;
4920 /* Handle a "mode" attribute; arguments as in
4921 struct attribute_spec.handler. */
4924 handle_mode_attribute (tree *node, tree name, tree args,
4925 int ARG_UNUSED (flags), bool *no_add_attrs)
4929 *no_add_attrs = true;
4931 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4932 warning (OPT_Wattributes, "%qE attribute ignored", name);
4936 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4937 int len = strlen (p);
4938 enum machine_mode mode = VOIDmode;
4942 if (len > 4 && p[0] == '_' && p[1] == '_'
4943 && p[len - 1] == '_' && p[len - 2] == '_')
4945 char *newp = (char *) alloca (len - 1);
4947 strcpy (newp, &p[2]);
4948 newp[len - 4] = '\0';
4952 /* Change this type to have a type with the specified mode.
4953 First check for the special modes. */
4954 if (!strcmp (p, "byte"))
4956 else if (!strcmp (p, "word"))
4958 else if (!strcmp (p, "pointer"))
4961 for (j = 0; j < NUM_MACHINE_MODES; j++)
4962 if (!strcmp (p, GET_MODE_NAME (j)))
4964 mode = (enum machine_mode) j;
4968 if (mode == VOIDmode)
4970 error ("unknown machine mode %qs", p);
4975 switch (GET_MODE_CLASS (mode))
4978 case MODE_PARTIAL_INT:
4980 case MODE_DECIMAL_FLOAT:
4981 valid_mode = targetm.scalar_mode_supported_p (mode);
4984 case MODE_COMPLEX_INT:
4985 case MODE_COMPLEX_FLOAT:
4986 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
4989 case MODE_VECTOR_INT:
4990 case MODE_VECTOR_FLOAT:
4991 warning (OPT_Wattributes, "specifying vector types with "
4992 "__attribute__ ((mode)) is deprecated");
4993 warning (OPT_Wattributes,
4994 "use __attribute__ ((vector_size)) instead");
4995 valid_mode = vector_mode_valid_p (mode);
5003 error ("unable to emulate %qs", p);
5007 if (POINTER_TYPE_P (type))
5009 tree (*fn)(tree, enum machine_mode, bool);
5011 if (!targetm.valid_pointer_mode (mode))
5013 error ("invalid pointer mode %qs", p);
5017 if (TREE_CODE (type) == POINTER_TYPE)
5018 fn = build_pointer_type_for_mode;
5020 fn = build_reference_type_for_mode;
5021 typefm = fn (TREE_TYPE (type), mode, false);
5024 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
5026 if (typefm == NULL_TREE)
5028 error ("no data type for mode %qs", p);
5031 else if (TREE_CODE (type) == ENUMERAL_TYPE)
5033 /* For enumeral types, copy the precision from the integer
5034 type returned above. If not an INTEGER_TYPE, we can't use
5035 this mode for this type. */
5036 if (TREE_CODE (typefm) != INTEGER_TYPE)
5038 error ("cannot use mode %qs for enumeral types", p);
5042 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
5044 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
5049 /* We cannot build a type variant, as there's code that assumes
5050 that TYPE_MAIN_VARIANT has the same mode. This includes the
5051 debug generators. Instead, create a subrange type. This
5052 results in all of the enumeral values being emitted only once
5053 in the original, and the subtype gets them by reference. */
5054 if (TYPE_UNSIGNED (type))
5055 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
5057 typefm = make_signed_type (TYPE_PRECISION (typefm));
5058 TREE_TYPE (typefm) = type;
5061 else if (VECTOR_MODE_P (mode)
5062 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
5063 : TREE_CODE (type) != TREE_CODE (typefm))
5065 error ("mode %qs applied to inappropriate type", p);
5075 /* Handle a "section" attribute; arguments as in
5076 struct attribute_spec.handler. */
5079 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5080 int ARG_UNUSED (flags), bool *no_add_attrs)
5084 if (targetm.have_named_sections)
5086 user_defined_section_attribute = true;
5088 if ((TREE_CODE (decl) == FUNCTION_DECL
5089 || TREE_CODE (decl) == VAR_DECL)
5090 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
5092 if (TREE_CODE (decl) == VAR_DECL
5093 && current_function_decl != NULL_TREE
5094 && !TREE_STATIC (decl))
5096 error ("%Jsection attribute cannot be specified for "
5097 "local variables", decl);
5098 *no_add_attrs = true;
5101 /* The decl may have already been given a section attribute
5102 from a previous declaration. Ensure they match. */
5103 else if (DECL_SECTION_NAME (decl) != NULL_TREE
5104 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
5105 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
5107 error ("section of %q+D conflicts with previous declaration",
5109 *no_add_attrs = true;
5112 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
5116 error ("section attribute not allowed for %q+D", *node);
5117 *no_add_attrs = true;
5122 error ("%Jsection attributes are not supported for this target", *node);
5123 *no_add_attrs = true;
5129 /* Handle a "aligned" attribute; arguments as in
5130 struct attribute_spec.handler. */
5133 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5134 int flags, bool *no_add_attrs)
5136 tree decl = NULL_TREE;
5139 tree align_expr = (args ? TREE_VALUE (args)
5140 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
5146 type = &TREE_TYPE (decl);
5147 is_type = TREE_CODE (*node) == TYPE_DECL;
5149 else if (TYPE_P (*node))
5150 type = node, is_type = 1;
5152 if (TREE_CODE (align_expr) != INTEGER_CST)
5154 error ("requested alignment is not a constant");
5155 *no_add_attrs = true;
5157 else if ((i = tree_log2 (align_expr)) == -1)
5159 error ("requested alignment is not a power of 2");
5160 *no_add_attrs = true;
5162 else if (i > HOST_BITS_PER_INT - 2)
5164 error ("requested alignment is too large");
5165 *no_add_attrs = true;
5169 /* If we have a TYPE_DECL, then copy the type, so that we
5170 don't accidentally modify a builtin type. See pushdecl. */
5171 if (decl && TREE_TYPE (decl) != error_mark_node
5172 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
5174 tree tt = TREE_TYPE (decl);
5175 *type = build_variant_type_copy (*type);
5176 DECL_ORIGINAL_TYPE (decl) = tt;
5177 TYPE_NAME (*type) = decl;
5178 TREE_USED (*type) = TREE_USED (decl);
5179 TREE_TYPE (decl) = *type;
5181 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5182 *type = build_variant_type_copy (*type);
5184 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
5185 TYPE_USER_ALIGN (*type) = 1;
5187 else if (TREE_CODE (decl) != VAR_DECL
5188 && TREE_CODE (decl) != FIELD_DECL)
5190 error ("alignment may not be specified for %q+D", decl);
5191 *no_add_attrs = true;
5195 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
5196 DECL_USER_ALIGN (decl) = 1;
5202 /* Handle a "weak" attribute; arguments as in
5203 struct attribute_spec.handler. */
5206 handle_weak_attribute (tree *node, tree name,
5207 tree ARG_UNUSED (args),
5208 int ARG_UNUSED (flags),
5209 bool * ARG_UNUSED (no_add_attrs))
5211 if (TREE_CODE (*node) == FUNCTION_DECL
5212 || TREE_CODE (*node) == VAR_DECL)
5213 declare_weak (*node);
5215 warning (OPT_Wattributes, "%qE attribute ignored", name);
5221 /* Handle an "alias" attribute; arguments as in
5222 struct attribute_spec.handler. */
5225 handle_alias_attribute (tree *node, tree name, tree args,
5226 int ARG_UNUSED (flags), bool *no_add_attrs)
5230 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
5231 || (TREE_CODE (decl) != FUNCTION_DECL
5232 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
5233 /* A static variable declaration is always a tentative definition,
5234 but the alias is a non-tentative definition which overrides. */
5235 || (TREE_CODE (decl) != FUNCTION_DECL
5236 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
5238 error ("%q+D defined both normally and as an alias", decl);
5239 *no_add_attrs = true;
5242 /* Note that the very first time we process a nested declaration,
5243 decl_function_context will not be set. Indeed, *would* never
5244 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
5245 we do below. After such frobbery, pushdecl would set the context.
5246 In any case, this is never what we want. */
5247 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
5251 id = TREE_VALUE (args);
5252 if (TREE_CODE (id) != STRING_CST)
5254 error ("alias argument not a string");
5255 *no_add_attrs = true;
5258 id = get_identifier (TREE_STRING_POINTER (id));
5259 /* This counts as a use of the object pointed to. */
5262 if (TREE_CODE (decl) == FUNCTION_DECL)
5263 DECL_INITIAL (decl) = error_mark_node;
5266 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5267 DECL_EXTERNAL (decl) = 1;
5269 DECL_EXTERNAL (decl) = 0;
5270 TREE_STATIC (decl) = 1;
5275 warning (OPT_Wattributes, "%qE attribute ignored", name);
5276 *no_add_attrs = true;
5282 /* Handle a "weakref" attribute; arguments as in struct
5283 attribute_spec.handler. */
5286 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5287 int flags, bool *no_add_attrs)
5289 tree attr = NULL_TREE;
5291 /* We must ignore the attribute when it is associated with
5292 local-scoped decls, since attribute alias is ignored and many
5293 such symbols do not even have a DECL_WEAK field. */
5294 if (decl_function_context (*node) || current_function_decl)
5296 warning (OPT_Wattributes, "%qE attribute ignored", name);
5297 *no_add_attrs = true;
5301 /* The idea here is that `weakref("name")' mutates into `weakref,
5302 alias("name")', and weakref without arguments, in turn,
5303 implicitly adds weak. */
5307 attr = tree_cons (get_identifier ("alias"), args, attr);
5308 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
5310 *no_add_attrs = true;
5312 decl_attributes (node, attr, flags);
5316 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
5317 error ("%Jweakref attribute must appear before alias attribute",
5320 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
5321 and that isn't supported; and because it wants to add it to
5322 the list of weak decls, which isn't helpful. */
5323 DECL_WEAK (*node) = 1;
5329 /* Handle an "visibility" attribute; arguments as in
5330 struct attribute_spec.handler. */
5333 handle_visibility_attribute (tree *node, tree name, tree args,
5334 int ARG_UNUSED (flags),
5335 bool *ARG_UNUSED (no_add_attrs))
5338 tree id = TREE_VALUE (args);
5339 enum symbol_visibility vis;
5343 if (TREE_CODE (*node) == ENUMERAL_TYPE)
5345 else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
5347 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
5351 else if (TYPE_FIELDS (*node))
5353 error ("%qE attribute ignored because %qT is already defined",
5358 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
5360 warning (OPT_Wattributes, "%qE attribute ignored", name);
5364 if (TREE_CODE (id) != STRING_CST)
5366 error ("visibility argument not a string");
5370 /* If this is a type, set the visibility on the type decl. */
5373 decl = TYPE_NAME (decl);
5376 if (TREE_CODE (decl) == IDENTIFIER_NODE)
5378 warning (OPT_Wattributes, "%qE attribute ignored on types",
5384 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
5385 vis = VISIBILITY_DEFAULT;
5386 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
5387 vis = VISIBILITY_INTERNAL;
5388 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
5389 vis = VISIBILITY_HIDDEN;
5390 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
5391 vis = VISIBILITY_PROTECTED;
5394 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5395 vis = VISIBILITY_DEFAULT;
5398 if (DECL_VISIBILITY_SPECIFIED (decl)
5399 && vis != DECL_VISIBILITY (decl)
5400 && lookup_attribute ("visibility", (TYPE_P (*node)
5401 ? TYPE_ATTRIBUTES (*node)
5402 : DECL_ATTRIBUTES (decl))))
5403 error ("%qD redeclared with different visibility", decl);
5405 DECL_VISIBILITY (decl) = vis;
5406 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5408 /* Go ahead and attach the attribute to the node as well. This is needed
5409 so we can determine whether we have VISIBILITY_DEFAULT because the
5410 visibility was not specified, or because it was explicitly overridden
5411 from the containing scope. */
5416 /* Determine the ELF symbol visibility for DECL, which is either a
5417 variable or a function. It is an error to use this function if a
5418 definition of DECL is not available in this translation unit.
5419 Returns true if the final visibility has been determined by this
5420 function; false if the caller is free to make additional
5424 c_determine_visibility (tree decl)
5426 gcc_assert (TREE_CODE (decl) == VAR_DECL
5427 || TREE_CODE (decl) == FUNCTION_DECL);
5429 /* If the user explicitly specified the visibility with an
5430 attribute, honor that. DECL_VISIBILITY will have been set during
5431 the processing of the attribute. We check for an explicit
5432 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5433 to distinguish the use of an attribute from the use of a "#pragma
5434 GCC visibility push(...)"; in the latter case we still want other
5435 considerations to be able to overrule the #pragma. */
5436 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
5439 /* Anything that is exported must have default visibility. */
5440 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5441 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
5443 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5444 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5448 /* Set default visibility to whatever the user supplied with
5449 visibility_specified depending on #pragma GCC visibility. */
5450 if (!DECL_VISIBILITY_SPECIFIED (decl))
5452 DECL_VISIBILITY (decl) = default_visibility;
5453 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
5458 /* Handle an "tls_model" attribute; arguments as in
5459 struct attribute_spec.handler. */
5462 handle_tls_model_attribute (tree *node, tree name, tree args,
5463 int ARG_UNUSED (flags), bool *no_add_attrs)
5467 enum tls_model kind;
5469 *no_add_attrs = true;
5471 if (!DECL_THREAD_LOCAL_P (decl))
5473 warning (OPT_Wattributes, "%qE attribute ignored", name);
5477 kind = DECL_TLS_MODEL (decl);
5478 id = TREE_VALUE (args);
5479 if (TREE_CODE (id) != STRING_CST)
5481 error ("tls_model argument not a string");
5485 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
5486 kind = TLS_MODEL_LOCAL_EXEC;
5487 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
5488 kind = TLS_MODEL_INITIAL_EXEC;
5489 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
5490 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
5491 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5492 kind = TLS_MODEL_GLOBAL_DYNAMIC;
5494 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5496 DECL_TLS_MODEL (decl) = kind;
5500 /* Handle a "no_instrument_function" attribute; arguments as in
5501 struct attribute_spec.handler. */
5504 handle_no_instrument_function_attribute (tree *node, tree name,
5505 tree ARG_UNUSED (args),
5506 int ARG_UNUSED (flags),
5511 if (TREE_CODE (decl) != FUNCTION_DECL)
5513 error ("%J%qE attribute applies only to functions", decl, name);
5514 *no_add_attrs = true;
5516 else if (DECL_INITIAL (decl))
5518 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5519 *no_add_attrs = true;
5522 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5527 /* Handle a "malloc" attribute; arguments as in
5528 struct attribute_spec.handler. */
5531 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5532 int ARG_UNUSED (flags), bool *no_add_attrs)
5534 if (TREE_CODE (*node) == FUNCTION_DECL
5535 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
5536 DECL_IS_MALLOC (*node) = 1;
5539 warning (OPT_Wattributes, "%qE attribute ignored", name);
5540 *no_add_attrs = true;
5546 /* Handle a "returns_twice" attribute; arguments as in
5547 struct attribute_spec.handler. */
5550 handle_returns_twice_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 DECL_IS_RETURNS_TWICE (*node) = 1;
5557 warning (OPT_Wattributes, "%qE attribute ignored", name);
5558 *no_add_attrs = true;
5564 /* Handle a "no_limit_stack" attribute; arguments as in
5565 struct attribute_spec.handler. */
5568 handle_no_limit_stack_attribute (tree *node, tree name,
5569 tree ARG_UNUSED (args),
5570 int ARG_UNUSED (flags),
5575 if (TREE_CODE (decl) != FUNCTION_DECL)
5577 error ("%J%qE attribute applies only to functions", decl, name);
5578 *no_add_attrs = true;
5580 else if (DECL_INITIAL (decl))
5582 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5583 *no_add_attrs = true;
5586 DECL_NO_LIMIT_STACK (decl) = 1;
5591 /* Handle a "pure" attribute; arguments as in
5592 struct attribute_spec.handler. */
5595 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5596 int ARG_UNUSED (flags), bool *no_add_attrs)
5598 if (TREE_CODE (*node) == FUNCTION_DECL)
5599 DECL_IS_PURE (*node) = 1;
5600 /* ??? TODO: Support types. */
5603 warning (OPT_Wattributes, "%qE attribute ignored", name);
5604 *no_add_attrs = true;
5610 /* Handle a "no vops" attribute; arguments as in
5611 struct attribute_spec.handler. */
5614 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
5615 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
5616 bool *ARG_UNUSED (no_add_attrs))
5618 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
5619 DECL_IS_NOVOPS (*node) = 1;
5623 /* Handle a "deprecated" attribute; arguments as in
5624 struct attribute_spec.handler. */
5627 handle_deprecated_attribute (tree *node, tree name,
5628 tree ARG_UNUSED (args), int flags,
5631 tree type = NULL_TREE;
5633 tree what = NULL_TREE;
5638 type = TREE_TYPE (decl);
5640 if (TREE_CODE (decl) == TYPE_DECL
5641 || TREE_CODE (decl) == PARM_DECL
5642 || TREE_CODE (decl) == VAR_DECL
5643 || TREE_CODE (decl) == FUNCTION_DECL
5644 || TREE_CODE (decl) == FIELD_DECL)
5645 TREE_DEPRECATED (decl) = 1;
5649 else if (TYPE_P (*node))
5651 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5652 *node = build_variant_type_copy (*node);
5653 TREE_DEPRECATED (*node) = 1;
5661 *no_add_attrs = true;
5662 if (type && TYPE_NAME (type))
5664 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5665 what = TYPE_NAME (*node);
5666 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5667 && DECL_NAME (TYPE_NAME (type)))
5668 what = DECL_NAME (TYPE_NAME (type));
5671 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
5673 warning (OPT_Wattributes, "%qE attribute ignored", name);
5679 /* Handle a "vector_size" attribute; arguments as in
5680 struct attribute_spec.handler. */
5683 handle_vector_size_attribute (tree *node, tree name, tree args,
5684 int ARG_UNUSED (flags),
5687 unsigned HOST_WIDE_INT vecsize, nunits;
5688 enum machine_mode orig_mode;
5689 tree type = *node, new_type, size;
5691 *no_add_attrs = true;
5693 size = TREE_VALUE (args);
5695 if (!host_integerp (size, 1))
5697 warning (OPT_Wattributes, "%qE attribute ignored", name);
5701 /* Get the vector size (in bytes). */
5702 vecsize = tree_low_cst (size, 1);
5704 /* We need to provide for vector pointers, vector arrays, and
5705 functions returning vectors. For example:
5707 __attribute__((vector_size(16))) short *foo;
5709 In this case, the mode is SI, but the type being modified is
5710 HI, so we need to look further. */
5712 while (POINTER_TYPE_P (type)
5713 || TREE_CODE (type) == FUNCTION_TYPE
5714 || TREE_CODE (type) == METHOD_TYPE
5715 || TREE_CODE (type) == ARRAY_TYPE)
5716 type = TREE_TYPE (type);
5718 /* Get the mode of the type being modified. */
5719 orig_mode = TYPE_MODE (type);
5721 if (TREE_CODE (type) == RECORD_TYPE
5722 || TREE_CODE (type) == UNION_TYPE
5723 || TREE_CODE (type) == VECTOR_TYPE
5724 || (!SCALAR_FLOAT_MODE_P (orig_mode)
5725 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5726 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
5728 error ("invalid vector type for attribute %qE", name);
5732 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
5734 error ("vector size not an integral multiple of component size");
5740 error ("zero vector size");
5744 /* Calculate how many units fit in the vector. */
5745 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5746 if (nunits & (nunits - 1))
5748 error ("number of components of the vector not a power of two");
5752 new_type = build_vector_type (type, nunits);
5754 /* Build back pointers if needed. */
5755 *node = reconstruct_complex_type (*node, new_type);
5760 /* Handle the "nonnull" attribute. */
5762 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
5763 tree args, int ARG_UNUSED (flags),
5767 unsigned HOST_WIDE_INT attr_arg_num;
5769 /* If no arguments are specified, all pointer arguments should be
5770 non-null. Verify a full prototype is given so that the arguments
5771 will have the correct types when we actually check them later. */
5774 if (!TYPE_ARG_TYPES (type))
5776 error ("nonnull attribute without arguments on a non-prototype");
5777 *no_add_attrs = true;
5782 /* Argument list specified. Verify that each argument number references
5783 a pointer argument. */
5784 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5787 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5789 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
5791 error ("nonnull argument has invalid operand number (argument %lu)",
5792 (unsigned long) attr_arg_num);
5793 *no_add_attrs = true;
5797 argument = TYPE_ARG_TYPES (type);
5800 for (ck_num = 1; ; ck_num++)
5802 if (!argument || ck_num == arg_num)
5804 argument = TREE_CHAIN (argument);
5808 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5810 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5811 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5812 *no_add_attrs = true;
5816 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5818 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5819 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5820 *no_add_attrs = true;
5829 /* Check the argument list of a function call for null in argument slots
5830 that are marked as requiring a non-null pointer argument. The NARGS
5831 arguments are passed in the array ARGARRAY.
5835 check_function_nonnull (tree attrs, int nargs, tree *argarray)
5840 for (a = attrs; a; a = TREE_CHAIN (a))
5842 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5844 args = TREE_VALUE (a);
5846 /* Walk the argument list. If we encounter an argument number we
5847 should check for non-null, do it. If the attribute has no args,
5848 then every pointer argument is checked (in which case the check
5849 for pointer type is done in check_nonnull_arg). */
5850 for (i = 0; i < nargs; i++)
5852 if (!args || nonnull_check_p (args, i + 1))
5853 check_function_arguments_recurse (check_nonnull_arg, NULL,
5861 /* Check that the Nth argument of a function call (counting backwards
5862 from the end) is a (pointer)0. The NARGS arguments are passed in the
5866 check_function_sentinel (tree attrs, int nargs, tree *argarray, tree typelist)
5868 tree attr = lookup_attribute ("sentinel", attrs);
5876 /* Skip over the named arguments. */
5877 while (typelist && len < nargs)
5879 typelist = TREE_CHAIN (typelist);
5883 if (TREE_VALUE (attr))
5885 tree p = TREE_VALUE (TREE_VALUE (attr));
5886 pos = TREE_INT_CST_LOW (p);
5889 /* The sentinel must be one of the varargs, i.e.
5890 in position >= the number of fixed arguments. */
5891 if ((nargs - 1 - pos) < len)
5893 warning (OPT_Wformat,
5894 "not enough variable arguments to fit a sentinel");
5898 /* Validate the sentinel. */
5899 sentinel = argarray[nargs - 1 - pos];
5900 if ((!POINTER_TYPE_P (TREE_TYPE (sentinel))
5901 || !integer_zerop (sentinel))
5902 /* Although __null (in C++) is only an integer we allow it
5903 nevertheless, as we are guaranteed that it's exactly
5904 as wide as a pointer, and we don't want to force
5905 users to cast the NULL they have written there.
5906 We warn with -Wstrict-null-sentinel, though. */
5907 && (warn_strict_null_sentinel || null_node != sentinel))
5908 warning (OPT_Wformat, "missing sentinel in function call");
5912 /* Helper for check_function_nonnull; given a list of operands which
5913 must be non-null in ARGS, determine if operand PARAM_NUM should be
5917 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5919 unsigned HOST_WIDE_INT arg_num = 0;
5921 for (; args; args = TREE_CHAIN (args))
5923 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
5927 if (arg_num == param_num)
5933 /* Check that the function argument PARAM (which is operand number
5934 PARAM_NUM) is non-null. This is called by check_function_nonnull
5935 via check_function_arguments_recurse. */
5938 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5939 unsigned HOST_WIDE_INT param_num)
5941 /* Just skip checking the argument if it's not a pointer. This can
5942 happen if the "nonnull" attribute was given without an operand
5943 list (which means to check every pointer argument). */
5945 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5948 if (integer_zerop (param))
5949 warning (OPT_Wnonnull, "null argument where non-null required "
5950 "(argument %lu)", (unsigned long) param_num);
5953 /* Helper for nonnull attribute handling; fetch the operand number
5954 from the attribute argument list. */
5957 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5959 /* Verify the arg number is a constant. */
5960 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5961 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5964 *valp = TREE_INT_CST_LOW (arg_num_expr);
5968 /* Handle a "nothrow" attribute; arguments as in
5969 struct attribute_spec.handler. */
5972 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5973 int ARG_UNUSED (flags), bool *no_add_attrs)
5975 if (TREE_CODE (*node) == FUNCTION_DECL)
5976 TREE_NOTHROW (*node) = 1;
5977 /* ??? TODO: Support types. */
5980 warning (OPT_Wattributes, "%qE attribute ignored", name);
5981 *no_add_attrs = true;
5987 /* Handle a "cleanup" attribute; arguments as in
5988 struct attribute_spec.handler. */
5991 handle_cleanup_attribute (tree *node, tree name, tree args,
5992 int ARG_UNUSED (flags), bool *no_add_attrs)
5995 tree cleanup_id, cleanup_decl;
5997 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5998 for global destructors in C++. This requires infrastructure that
5999 we don't have generically at the moment. It's also not a feature
6000 we'd be missing too much, since we do have attribute constructor. */
6001 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
6003 warning (OPT_Wattributes, "%qE attribute ignored", name);
6004 *no_add_attrs = true;
6008 /* Verify that the argument is a function in scope. */
6009 /* ??? We could support pointers to functions here as well, if
6010 that was considered desirable. */
6011 cleanup_id = TREE_VALUE (args);
6012 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
6014 error ("cleanup argument not an identifier");
6015 *no_add_attrs = true;
6018 cleanup_decl = lookup_name (cleanup_id);
6019 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
6021 error ("cleanup argument not a function");
6022 *no_add_attrs = true;
6026 /* That the function has proper type is checked with the
6027 eventual call to build_function_call. */
6032 /* Handle a "warn_unused_result" attribute. No special handling. */
6035 handle_warn_unused_result_attribute (tree *node, tree name,
6036 tree ARG_UNUSED (args),
6037 int ARG_UNUSED (flags), bool *no_add_attrs)
6039 /* Ignore the attribute for functions not returning any value. */
6040 if (VOID_TYPE_P (TREE_TYPE (*node)))
6042 warning (OPT_Wattributes, "%qE attribute ignored", name);
6043 *no_add_attrs = true;
6049 /* Handle a "sentinel" attribute. */
6052 handle_sentinel_attribute (tree *node, tree name, tree args,
6053 int ARG_UNUSED (flags), bool *no_add_attrs)
6055 tree params = TYPE_ARG_TYPES (*node);
6059 warning (OPT_Wattributes,
6060 "%qE attribute requires prototypes with named arguments", name);
6061 *no_add_attrs = true;
6065 while (TREE_CHAIN (params))
6066 params = TREE_CHAIN (params);
6068 if (VOID_TYPE_P (TREE_VALUE (params)))
6070 warning (OPT_Wattributes,
6071 "%qE attribute only applies to variadic functions", name);
6072 *no_add_attrs = true;
6078 tree position = TREE_VALUE (args);
6080 if (TREE_CODE (position) != INTEGER_CST)
6082 warning (0, "requested position is not an integer constant");
6083 *no_add_attrs = true;
6087 if (tree_int_cst_lt (position, integer_zero_node))
6089 warning (0, "requested position is less than zero");
6090 *no_add_attrs = true;
6098 /* Check for valid arguments being passed to a function.
6099 ATTRS is a list of attributes. There are NARGS arguments in the array
6100 ARGARRAY. TYPELIST is the list of argument types for the function.
6103 check_function_arguments (tree attrs, int nargs, tree *argarray, tree typelist)
6105 /* Check for null being passed in a pointer argument that must be
6106 non-null. We also need to do this if format checking is enabled. */
6109 check_function_nonnull (attrs, nargs, argarray);
6111 /* Check for errors in format strings. */
6113 if (warn_format || warn_missing_format_attribute)
6114 check_function_format (attrs, nargs, argarray);
6117 check_function_sentinel (attrs, nargs, argarray, typelist);
6120 /* Generic argument checking recursion routine. PARAM is the argument to
6121 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6122 once the argument is resolved. CTX is context for the callback. */
6124 check_function_arguments_recurse (void (*callback)
6125 (void *, tree, unsigned HOST_WIDE_INT),
6126 void *ctx, tree param,
6127 unsigned HOST_WIDE_INT param_num)
6129 if ((TREE_CODE (param) == NOP_EXPR || TREE_CODE (param) == CONVERT_EXPR)
6130 && (TYPE_PRECISION (TREE_TYPE (param))
6131 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
6133 /* Strip coercion. */
6134 check_function_arguments_recurse (callback, ctx,
6135 TREE_OPERAND (param, 0), param_num);
6139 if (TREE_CODE (param) == CALL_EXPR)
6141 tree type = TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param)));
6143 bool found_format_arg = false;
6145 /* See if this is a call to a known internationalization function
6146 that modifies a format arg. Such a function may have multiple
6147 format_arg attributes (for example, ngettext). */
6149 for (attrs = TYPE_ATTRIBUTES (type);
6151 attrs = TREE_CHAIN (attrs))
6152 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
6155 tree format_num_expr;
6158 call_expr_arg_iterator iter;
6160 /* Extract the argument number, which was previously checked
6162 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
6164 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
6165 && !TREE_INT_CST_HIGH (format_num_expr));
6167 format_num = TREE_INT_CST_LOW (format_num_expr);
6169 for (inner_arg = first_call_expr_arg (param, &iter), i = 1;
6171 inner_arg = next_call_expr_arg (&iter), i++)
6172 if (i == format_num)
6174 check_function_arguments_recurse (callback, ctx,
6175 inner_arg, param_num);
6176 found_format_arg = true;
6181 /* If we found a format_arg attribute and did a recursive check,
6182 we are done with checking this argument. Otherwise, we continue
6183 and this will be considered a non-literal. */
6184 if (found_format_arg)
6188 if (TREE_CODE (param) == COND_EXPR)
6190 /* Check both halves of the conditional expression. */
6191 check_function_arguments_recurse (callback, ctx,
6192 TREE_OPERAND (param, 1), param_num);
6193 check_function_arguments_recurse (callback, ctx,
6194 TREE_OPERAND (param, 2), param_num);
6198 (*callback) (ctx, param, param_num);
6201 /* Function to help qsort sort FIELD_DECLs by name order. */
6204 field_decl_cmp (const void *x_p, const void *y_p)
6206 const tree *const x = (const tree *const) x_p;
6207 const tree *const y = (const tree *const) y_p;
6209 if (DECL_NAME (*x) == DECL_NAME (*y))
6210 /* A nontype is "greater" than a type. */
6211 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
6212 if (DECL_NAME (*x) == NULL_TREE)
6214 if (DECL_NAME (*y) == NULL_TREE)
6216 if (DECL_NAME (*x) < DECL_NAME (*y))
6222 gt_pointer_operator new_value;
6226 /* This routine compares two fields like field_decl_cmp but using the
6227 pointer operator in resort_data. */
6230 resort_field_decl_cmp (const void *x_p, const void *y_p)
6232 const tree *const x = (const tree *const) x_p;
6233 const tree *const y = (const tree *const) y_p;
6235 if (DECL_NAME (*x) == DECL_NAME (*y))
6236 /* A nontype is "greater" than a type. */
6237 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
6238 if (DECL_NAME (*x) == NULL_TREE)
6240 if (DECL_NAME (*y) == NULL_TREE)
6243 tree d1 = DECL_NAME (*x);
6244 tree d2 = DECL_NAME (*y);
6245 resort_data.new_value (&d1, resort_data.cookie);
6246 resort_data.new_value (&d2, resort_data.cookie);
6253 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
6256 resort_sorted_fields (void *obj,
6257 void * ARG_UNUSED (orig_obj),
6258 gt_pointer_operator new_value,
6261 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
6262 resort_data.new_value = new_value;
6263 resort_data.cookie = cookie;
6264 qsort (&sf->elts[0], sf->len, sizeof (tree),
6265 resort_field_decl_cmp);
6268 /* Subroutine of c_parse_error.
6269 Return the result of concatenating LHS and RHS. RHS is really
6270 a string literal, its first character is indicated by RHS_START and
6271 RHS_SIZE is its length (including the terminating NUL character).
6273 The caller is responsible for deleting the returned pointer. */
6276 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
6278 const int lhs_size = strlen (lhs);
6279 char *result = XNEWVEC (char, lhs_size + rhs_size);
6280 strncpy (result, lhs, lhs_size);
6281 strncpy (result + lhs_size, rhs_start, rhs_size);
6285 /* Issue the error given by GMSGID, indicating that it occurred before
6286 TOKEN, which had the associated VALUE. */
6289 c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value)
6291 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6293 char *message = NULL;
6295 if (token == CPP_EOF)
6296 message = catenate_messages (gmsgid, " at end of input");
6297 else if (token == CPP_CHAR || token == CPP_WCHAR)
6299 unsigned int val = TREE_INT_CST_LOW (value);
6300 const char *const ell = (token == CPP_CHAR) ? "" : "L";
6301 if (val <= UCHAR_MAX && ISGRAPH (val))
6302 message = catenate_messages (gmsgid, " before %s'%c'");
6304 message = catenate_messages (gmsgid, " before %s'\\x%x'");
6306 error (message, ell, val);
6310 else if (token == CPP_STRING || token == CPP_WSTRING)
6311 message = catenate_messages (gmsgid, " before string constant");
6312 else if (token == CPP_NUMBER)
6313 message = catenate_messages (gmsgid, " before numeric constant");
6314 else if (token == CPP_NAME)
6316 message = catenate_messages (gmsgid, " before %qE");
6317 error (message, value);
6321 else if (token == CPP_PRAGMA)
6322 message = catenate_messages (gmsgid, " before %<#pragma%>");
6323 else if (token == CPP_PRAGMA_EOL)
6324 message = catenate_messages (gmsgid, " before end of line");
6325 else if (token < N_TTYPES)
6327 message = catenate_messages (gmsgid, " before %qs token");
6328 error (message, cpp_type2name (token));
6340 #undef catenate_messages
6343 /* Walk a gimplified function and warn for functions whose return value is
6344 ignored and attribute((warn_unused_result)) is set. This is done before
6345 inlining, so we don't have to worry about that. */
6348 c_warn_unused_result (tree *top_p)
6351 tree_stmt_iterator i;
6354 switch (TREE_CODE (t))
6356 case STATEMENT_LIST:
6357 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
6358 c_warn_unused_result (tsi_stmt_ptr (i));
6362 c_warn_unused_result (&COND_EXPR_THEN (t));
6363 c_warn_unused_result (&COND_EXPR_ELSE (t));
6366 c_warn_unused_result (&BIND_EXPR_BODY (t));
6368 case TRY_FINALLY_EXPR:
6369 case TRY_CATCH_EXPR:
6370 c_warn_unused_result (&TREE_OPERAND (t, 0));
6371 c_warn_unused_result (&TREE_OPERAND (t, 1));
6374 c_warn_unused_result (&CATCH_BODY (t));
6376 case EH_FILTER_EXPR:
6377 c_warn_unused_result (&EH_FILTER_FAILURE (t));
6384 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6385 a MODIFY_EXPR. All calls whose value is ignored should be
6386 represented like this. Look for the attribute. */
6387 fdecl = get_callee_fndecl (t);
6389 ftype = TREE_TYPE (fdecl);
6392 ftype = TREE_TYPE (CALL_EXPR_FN (t));
6393 /* Look past pointer-to-function to the function type itself. */
6394 ftype = TREE_TYPE (ftype);
6397 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
6400 warning (0, "%Hignoring return value of %qD, "
6401 "declared with attribute warn_unused_result",
6402 EXPR_LOCUS (t), fdecl);
6404 warning (0, "%Hignoring return value of function "
6405 "declared with attribute warn_unused_result",
6411 /* Not a container, not a call, or a call whose value is used. */
6416 /* Convert a character from the host to the target execution character
6417 set. cpplib handles this, mostly. */
6420 c_common_to_target_charset (HOST_WIDE_INT c)
6422 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6423 zero-extended under -fno-signed-char. cpplib insists that characters
6424 and character constants are always unsigned. Hence we must convert
6426 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
6428 uc = cpp_host_to_exec_charset (parse_in, uc);
6430 if (flag_signed_char)
6431 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
6432 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
6437 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
6438 component references, with STOP_REF, or alternatively an INDIRECT_REF of
6439 NULL, at the bottom; much like the traditional rendering of offsetof as a
6440 macro. Returns the folded and properly cast result. */
6443 fold_offsetof_1 (tree expr, tree stop_ref)
6445 enum tree_code code = PLUS_EXPR;
6448 if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK)
6449 return size_zero_node;
6451 switch (TREE_CODE (expr))
6457 error ("cannot apply %<offsetof%> to static data member %qD", expr);
6458 return error_mark_node;
6461 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6462 return error_mark_node;
6465 gcc_assert (integer_zerop (expr));
6466 return size_zero_node;
6470 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6471 gcc_assert (base == error_mark_node || base == size_zero_node);
6475 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6476 if (base == error_mark_node)
6479 t = TREE_OPERAND (expr, 1);
6480 if (DECL_C_BIT_FIELD (t))
6482 error ("attempt to take address of bit-field structure "
6484 return error_mark_node;
6486 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
6487 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
6492 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6493 if (base == error_mark_node)
6496 t = TREE_OPERAND (expr, 1);
6497 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
6500 t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t);
6502 t = convert (sizetype, t);
6503 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
6507 /* Handle static members of volatile structs. */
6508 t = TREE_OPERAND (expr, 1);
6509 gcc_assert (TREE_CODE (t) == VAR_DECL);
6510 return fold_offsetof_1 (t, stop_ref);
6516 return size_binop (code, base, off);
6520 fold_offsetof (tree expr, tree stop_ref)
6522 /* Convert back from the internal sizetype to size_t. */
6523 return convert (size_type_node, fold_offsetof_1 (expr, stop_ref));
6526 /* Print an error message for an invalid lvalue. USE says
6527 how the lvalue is being used and so selects the error message. */
6530 lvalue_error (enum lvalue_use use)
6535 error ("lvalue required as left operand of assignment");
6538 error ("lvalue required as increment operand");
6541 error ("lvalue required as decrement operand");
6544 error ("lvalue required as unary %<&%> operand");
6547 error ("lvalue required in asm statement");
6554 /* *PTYPE is an incomplete array. Complete it with a domain based on
6555 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6556 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6557 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6560 complete_array_type (tree *ptype, tree initial_value, bool do_default)
6562 tree maxindex, type, main_type, elt, unqual_elt;
6563 int failure = 0, quals;
6564 hashval_t hashcode = 0;
6566 maxindex = size_zero_node;
6569 if (TREE_CODE (initial_value) == STRING_CST)
6572 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
6573 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
6575 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
6577 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
6579 if (VEC_empty (constructor_elt, v))
6583 maxindex = integer_minus_one_node;
6588 unsigned HOST_WIDE_INT cnt;
6589 constructor_elt *ce;
6591 if (VEC_index (constructor_elt, v, 0)->index)
6592 maxindex = fold_convert (sizetype,
6593 VEC_index (constructor_elt,
6595 curindex = maxindex;
6598 VEC_iterate (constructor_elt, v, cnt, ce);
6602 curindex = fold_convert (sizetype, ce->index);
6604 curindex = size_binop (PLUS_EXPR, curindex, size_one_node);
6606 if (tree_int_cst_lt (maxindex, curindex))
6607 maxindex = curindex;
6613 /* Make an error message unless that happened already. */
6614 if (initial_value != error_mark_node)
6626 elt = TREE_TYPE (type);
6627 quals = TYPE_QUALS (strip_array_types (elt));
6631 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
6633 /* Using build_distinct_type_copy and modifying things afterward instead
6634 of using build_array_type to create a new type preserves all of the
6635 TYPE_LANG_FLAG_? bits that the front end may have set. */
6636 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
6637 TREE_TYPE (main_type) = unqual_elt;
6638 TYPE_DOMAIN (main_type) = build_index_type (maxindex);
6639 layout_type (main_type);
6641 /* Make sure we have the canonical MAIN_TYPE. */
6642 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
6643 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
6645 main_type = type_hash_canon (hashcode, main_type);
6650 type = c_build_qualified_type (main_type, quals);
6657 /* Used to help initialize the builtin-types.def table. When a type of
6658 the correct size doesn't exist, use error_mark_node instead of NULL.
6659 The later results in segfaults even when a decl using the type doesn't
6663 builtin_type_for_size (int size, bool unsignedp)
6665 tree type = lang_hooks.types.type_for_size (size, unsignedp);
6666 return type ? type : error_mark_node;
6669 /* A helper function for resolve_overloaded_builtin in resolving the
6670 overloaded __sync_ builtins. Returns a positive power of 2 if the
6671 first operand of PARAMS is a pointer to a supported data type.
6672 Returns 0 if an error is encountered. */
6675 sync_resolve_size (tree function, tree params)
6682 error ("too few arguments to function %qE", function);
6686 type = TREE_TYPE (TREE_VALUE (params));
6687 if (TREE_CODE (type) != POINTER_TYPE)
6690 type = TREE_TYPE (type);
6691 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
6694 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
6695 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
6699 error ("incompatible type for argument %d of %qE", 1, function);
6703 /* A helper function for resolve_overloaded_builtin. Adds casts to
6704 PARAMS to make arguments match up with those of FUNCTION. Drops
6705 the variadic arguments at the end. Returns false if some error
6706 was encountered; true on success. */
6709 sync_resolve_params (tree orig_function, tree function, tree params)
6711 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
6715 /* We've declared the implementation functions to use "volatile void *"
6716 as the pointer parameter, so we shouldn't get any complaints from the
6717 call to check_function_arguments what ever type the user used. */
6718 arg_types = TREE_CHAIN (arg_types);
6719 ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
6722 /* For the rest of the values, we need to cast these to FTYPE, so that we
6723 don't get warnings for passing pointer types, etc. */
6724 while (arg_types != void_list_node)
6728 params = TREE_CHAIN (params);
6731 error ("too few arguments to function %qE", orig_function);
6735 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6736 so that we get warnings for anything that doesn't match the pointer
6737 type. This isn't portable across the C and C++ front ends atm. */
6738 val = TREE_VALUE (params);
6739 val = convert (ptype, val);
6740 val = convert (TREE_VALUE (arg_types), val);
6741 TREE_VALUE (params) = val;
6743 arg_types = TREE_CHAIN (arg_types);
6747 /* The definition of these primitives is variadic, with the remaining
6748 being "an optional list of variables protected by the memory barrier".
6749 No clue what that's supposed to mean, precisely, but we consider all
6750 call-clobbered variables to be protected so we're safe. */
6751 TREE_CHAIN (params) = NULL;
6756 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6757 RESULT to make it match the type of the first pointer argument in
6761 sync_resolve_return (tree params, tree result)
6763 tree ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
6764 ptype = TYPE_MAIN_VARIANT (ptype);
6765 return convert (ptype, result);
6768 /* Some builtin functions are placeholders for other expressions. This
6769 function should be called immediately after parsing the call expression
6770 before surrounding code has committed to the type of the expression.
6772 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6773 PARAMS is the argument list for the call. The return value is non-null
6774 when expansion is complete, and null if normal processing should
6778 resolve_overloaded_builtin (tree function, tree params)
6780 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
6781 switch (DECL_BUILT_IN_CLASS (function))
6783 case BUILT_IN_NORMAL:
6786 if (targetm.resolve_overloaded_builtin)
6787 return targetm.resolve_overloaded_builtin (function, params);
6794 /* Handle BUILT_IN_NORMAL here. */
6797 case BUILT_IN_FETCH_AND_ADD_N:
6798 case BUILT_IN_FETCH_AND_SUB_N:
6799 case BUILT_IN_FETCH_AND_OR_N:
6800 case BUILT_IN_FETCH_AND_AND_N:
6801 case BUILT_IN_FETCH_AND_XOR_N:
6802 case BUILT_IN_FETCH_AND_NAND_N:
6803 case BUILT_IN_ADD_AND_FETCH_N:
6804 case BUILT_IN_SUB_AND_FETCH_N:
6805 case BUILT_IN_OR_AND_FETCH_N:
6806 case BUILT_IN_AND_AND_FETCH_N:
6807 case BUILT_IN_XOR_AND_FETCH_N:
6808 case BUILT_IN_NAND_AND_FETCH_N:
6809 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N:
6810 case BUILT_IN_VAL_COMPARE_AND_SWAP_N:
6811 case BUILT_IN_LOCK_TEST_AND_SET_N:
6812 case BUILT_IN_LOCK_RELEASE_N:
6814 int n = sync_resolve_size (function, params);
6815 tree new_function, result;
6818 return error_mark_node;
6820 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
6821 if (!sync_resolve_params (function, new_function, params))
6822 return error_mark_node;
6824 result = build_function_call (new_function, params);
6825 if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6826 && orig_code != BUILT_IN_LOCK_RELEASE_N)
6827 result = sync_resolve_return (params, result);
6837 /* Ignoring their sign, return true if two scalar types are the same. */
6839 same_scalar_type_ignoring_signedness (tree t1, tree t2)
6841 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
6843 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE)
6844 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE));
6846 /* Equality works here because c_common_signed_type uses
6847 TYPE_MAIN_VARIANT. */
6848 return lang_hooks.types.signed_type (t1)
6849 == lang_hooks.types.signed_type (t2);
6852 /* Check for missing format attributes on function pointers. LTYPE is
6853 the new type or left-hand side type. RTYPE is the old type or
6854 right-hand side type. Returns TRUE if LTYPE is missing the desired
6858 check_missing_format_attribute (tree ltype, tree rtype)
6860 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
6863 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
6864 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
6869 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
6870 if (is_attribute_p ("format", TREE_PURPOSE (la)))
6878 /* Subscripting with type char is likely to lose on a machine where
6879 chars are signed. So warn on any machine, but optionally. Don't
6880 warn for unsigned char since that type is safe. Don't warn for
6881 signed char because anyone who uses that must have done so
6882 deliberately. Furthermore, we reduce the false positive load by
6883 warning only for non-constant value of type char. */
6886 warn_array_subscript_with_type_char (tree index)
6888 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
6889 && TREE_CODE (index) != INTEGER_CST)
6890 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
6893 /* Implement -Wparentheses for the unexpected C precedence rules, to
6894 cover cases like x + y << z which readers are likely to
6895 misinterpret. We have seen an expression in which CODE is a binary
6896 operator used to combine expressions headed by CODE_LEFT and
6897 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
6898 means that that side of the expression was not formed using a
6899 binary operator, or it was enclosed in parentheses. */
6902 warn_about_parentheses (enum tree_code code, enum tree_code code_left,
6903 enum tree_code code_right)
6905 if (!warn_parentheses)
6908 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
6910 if (code_left == PLUS_EXPR || code_left == MINUS_EXPR
6911 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6912 warning (OPT_Wparentheses,
6913 "suggest parentheses around + or - inside shift");
6916 if (code == TRUTH_ORIF_EXPR)
6918 if (code_left == TRUTH_ANDIF_EXPR
6919 || code_right == TRUTH_ANDIF_EXPR)
6920 warning (OPT_Wparentheses,
6921 "suggest parentheses around && within ||");
6924 if (code == BIT_IOR_EXPR)
6926 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
6927 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
6928 || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
6929 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6930 warning (OPT_Wparentheses,
6931 "suggest parentheses around arithmetic in operand of |");
6932 /* Check cases like x|y==z */
6933 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6934 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6935 warning (OPT_Wparentheses,
6936 "suggest parentheses around comparison in operand of |");
6939 if (code == BIT_XOR_EXPR)
6941 if (code_left == BIT_AND_EXPR
6942 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
6943 || code_right == BIT_AND_EXPR
6944 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6945 warning (OPT_Wparentheses,
6946 "suggest parentheses around arithmetic in operand of ^");
6947 /* Check cases like x^y==z */
6948 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6949 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6950 warning (OPT_Wparentheses,
6951 "suggest parentheses around comparison in operand of ^");
6954 if (code == BIT_AND_EXPR)
6956 if (code_left == PLUS_EXPR || code_left == MINUS_EXPR
6957 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6958 warning (OPT_Wparentheses,
6959 "suggest parentheses around + or - in operand of &");
6960 /* Check cases like x&y==z */
6961 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6962 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6963 warning (OPT_Wparentheses,
6964 "suggest parentheses around comparison in operand of &");
6967 if (code == EQ_EXPR || code == NE_EXPR)
6969 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6970 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6971 warning (OPT_Wparentheses,
6972 "suggest parentheses around comparison in operand of %s",
6973 code == EQ_EXPR ? "==" : "!=");
6975 else if (TREE_CODE_CLASS (code) == tcc_comparison)
6977 if ((TREE_CODE_CLASS (code_left) == tcc_comparison
6978 && code_left != NE_EXPR && code_left != EQ_EXPR)
6979 || (TREE_CODE_CLASS (code_right) == tcc_comparison
6980 && code_right != NE_EXPR && code_right != EQ_EXPR))
6981 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
6982 "have their mathematical meaning");
6986 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
6989 warn_for_unused_label (tree label)
6991 if (!TREE_USED (label))
6993 if (DECL_INITIAL (label))
6994 warning (OPT_Wunused_label, "label %q+D defined but not used", label);
6996 warning (OPT_Wunused_label, "label %q+D declared but not defined", label);
7000 /* If FNDECL is a static constructor or destructor, add it to the list
7001 of functions to be called by the file scope initialization
7005 c_record_cdtor_fn (tree fndecl)
7007 if (targetm.have_ctors_dtors)
7010 if (DECL_STATIC_CONSTRUCTOR (fndecl))
7011 static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
7012 if (DECL_STATIC_DESTRUCTOR (fndecl))
7013 static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
7016 /* Synthesize a function which calls all the global ctors or global
7017 dtors in this file. This is only used for targets which do not
7018 support .ctors/.dtors sections. FIXME: Migrate into cgraph. */
7020 build_cdtor (int method_type, tree cdtors)
7027 for (; cdtors; cdtors = TREE_CHAIN (cdtors))
7028 append_to_statement_list (build_function_call (TREE_VALUE (cdtors), 0),
7031 cgraph_build_static_cdtor (method_type, body, DEFAULT_INIT_PRIORITY);
7034 /* Generate functions to call static constructors and destructors
7035 for targets that do not support .ctors/.dtors sections. These
7036 functions have magic names which are detected by collect2. */
7039 c_build_cdtor_fns (void)
7041 if (!targetm.have_ctors_dtors)
7043 build_cdtor ('I', static_ctors);
7044 static_ctors = NULL_TREE;
7045 build_cdtor ('D', static_dtors);
7046 static_dtors = NULL_TREE;
7050 gcc_assert (!static_ctors);
7051 gcc_assert (!static_dtors);
7055 #ifndef TARGET_HAS_TARGETCM
7056 struct gcc_targetcm targetcm = TARGETCM_INITIALIZER;
7059 /* Warn for division by zero according to the value of DIVISOR. */
7062 warn_for_div_by_zero (tree divisor)
7064 /* If DIVISOR is zero, and has integral type, issue a warning about
7065 division by zero. Do not issue a warning if DIVISOR has a
7066 floating-point type, since we consider 0.0/0.0 a valid way of
7067 generating a NaN. */
7068 if (skip_evaluation == 0 && integer_zerop (divisor))
7069 warning (OPT_Wdiv_by_zero, "division by zero");
7072 #include "gt-c-common.h"