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 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"
52 cpp_reader *parse_in; /* Declared in c-pragma.h. */
54 /* We let tm.h override the types used here, to handle trivial differences
55 such as the choice of unsigned int or long unsigned int for size_t.
56 When machines start needing nontrivial differences in the size type,
57 it would be best to do something here to figure out automatically
58 from other information what type to use. */
61 #define SIZE_TYPE "long unsigned int"
65 #define PID_TYPE "int"
69 #define WCHAR_TYPE "int"
72 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
73 #define MODIFIED_WCHAR_TYPE \
74 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
77 #define PTRDIFF_TYPE "long int"
81 #define WINT_TYPE "unsigned int"
85 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
87 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
93 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
95 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 ? "long unsigned int" \
97 : "long long unsigned int"))
100 /* The following symbols are subsumed in the c_global_trees array, and
101 listed here individually for documentation purposes.
103 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
105 tree short_integer_type_node;
106 tree long_integer_type_node;
107 tree long_long_integer_type_node;
109 tree short_unsigned_type_node;
110 tree long_unsigned_type_node;
111 tree long_long_unsigned_type_node;
113 tree truthvalue_type_node;
114 tree truthvalue_false_node;
115 tree truthvalue_true_node;
117 tree ptrdiff_type_node;
119 tree unsigned_char_type_node;
120 tree signed_char_type_node;
121 tree wchar_type_node;
122 tree signed_wchar_type_node;
123 tree unsigned_wchar_type_node;
125 tree float_type_node;
126 tree double_type_node;
127 tree long_double_type_node;
129 tree complex_integer_type_node;
130 tree complex_float_type_node;
131 tree complex_double_type_node;
132 tree complex_long_double_type_node;
134 tree dfloat32_type_node;
135 tree dfloat64_type_node;
136 tree_dfloat128_type_node;
138 tree intQI_type_node;
139 tree intHI_type_node;
140 tree intSI_type_node;
141 tree intDI_type_node;
142 tree intTI_type_node;
144 tree unsigned_intQI_type_node;
145 tree unsigned_intHI_type_node;
146 tree unsigned_intSI_type_node;
147 tree unsigned_intDI_type_node;
148 tree unsigned_intTI_type_node;
150 tree widest_integer_literal_type_node;
151 tree widest_unsigned_literal_type_node;
153 Nodes for types `void *' and `const void *'.
155 tree ptr_type_node, const_ptr_type_node;
157 Nodes for types `char *' and `const char *'.
159 tree string_type_node, const_string_type_node;
161 Type `char[SOMENUMBER]'.
162 Used when an array of char is needed and the size is irrelevant.
164 tree char_array_type_node;
166 Type `int[SOMENUMBER]' or something like it.
167 Used when an array of int needed and the size is irrelevant.
169 tree int_array_type_node;
171 Type `wchar_t[SOMENUMBER]' or something like it.
172 Used when a wide string literal is created.
174 tree wchar_array_type_node;
176 Type `int ()' -- used for implicit declaration of functions.
178 tree default_function_type;
180 A VOID_TYPE node, packaged in a TREE_LIST.
184 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
185 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
186 VAR_DECLS, but C++ does.)
188 tree function_name_decl_node;
189 tree pretty_function_name_decl_node;
190 tree c99_function_name_decl_node;
192 Stack of nested function name VAR_DECLs.
194 tree saved_function_name_decls;
198 tree c_global_trees[CTI_MAX];
200 /* Switches common to the C front ends. */
202 /* Nonzero if prepreprocessing only. */
204 int flag_preprocess_only;
206 /* Nonzero means don't output line number information. */
208 char flag_no_line_commands;
210 /* Nonzero causes -E output not to be done, but directives such as
211 #define that have side effects are still obeyed. */
215 /* Nonzero means dump macros in some fashion. */
217 char flag_dump_macros;
219 /* Nonzero means pass #include lines through to the output. */
221 char flag_dump_includes;
223 /* Nonzero means process PCH files while preprocessing. */
225 bool flag_pch_preprocess;
227 /* The file name to which we should write a precompiled header, or
228 NULL if no header will be written in this compile. */
230 const char *pch_file;
232 /* Nonzero if an ISO standard was selected. It rejects macros in the
236 /* Nonzero if -undef was given. It suppresses target built-in macros
240 /* Nonzero means don't recognize the non-ANSI builtin functions. */
244 /* Nonzero means don't recognize the non-ANSI builtin functions.
247 int flag_no_nonansi_builtin;
249 /* Nonzero means give `double' the same size as `float'. */
251 int flag_short_double;
253 /* Nonzero means give `wchar_t' the same size as `short'. */
255 int flag_short_wchar;
257 /* Nonzero means allow Microsoft extensions without warnings or errors. */
258 int flag_ms_extensions;
260 /* Nonzero means don't recognize the keyword `asm'. */
264 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
266 int flag_signed_bitfields = 1;
268 /* Warn about #pragma directives that are not recognized. */
270 int warn_unknown_pragmas; /* Tri state variable. */
272 /* Warn about format/argument anomalies in calls to formatted I/O functions
273 (*printf, *scanf, strftime, strfmon, etc.). */
277 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
278 with GCC this doesn't matter as __null is guaranteed to have the right
281 int warn_strict_null_sentinel;
283 /* Zero means that faster, ...NonNil variants of objc_msgSend...
284 calls will be used in ObjC; passing nil receivers to such calls
285 will most likely result in crashes. */
286 int flag_nil_receivers = 1;
288 /* Nonzero means that code generation will be altered to support
289 "zero-link" execution. This currently affects ObjC only, but may
290 affect other languages in the future. */
291 int flag_zero_link = 0;
293 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
294 unit. It will inform the ObjC runtime that class definition(s) herein
295 contained are to replace one(s) previously loaded. */
296 int flag_replace_objc_classes = 0;
298 /* C/ObjC language option variables. */
301 /* Nonzero means allow type mismatches in conditional expressions;
302 just make their values `void'. */
304 int flag_cond_mismatch;
306 /* Nonzero means enable C89 Amendment 1 features. */
310 /* Nonzero means use the ISO C99 dialect of C. */
314 /* Nonzero means that we have builtin functions, and main is an int. */
318 /* Warn if main is suspicious. */
323 /* ObjC language option variables. */
326 /* Open and close the file for outputting class declarations, if
329 int flag_gen_declaration;
331 /* Tells the compiler that this is a special run. Do not perform any
332 compiling, instead we are to test some platform dependent features
333 and output a C header file with appropriate definitions. */
335 int print_struct_values;
337 /* Tells the compiler what is the constant string class for Objc. */
339 const char *constant_string_class_name;
342 /* C++ language option variables. */
345 /* Nonzero means don't recognize any extension keywords. */
347 int flag_no_gnu_keywords;
349 /* Nonzero means do emit exported implementations of functions even if
350 they can be inlined. */
352 int flag_implement_inlines = 1;
354 /* Nonzero means that implicit instantiations will be emitted if needed. */
356 int flag_implicit_templates = 1;
358 /* Nonzero means that implicit instantiations of inline templates will be
359 emitted if needed, even if instantiations of non-inline templates
362 int flag_implicit_inline_templates = 1;
364 /* Nonzero means generate separate instantiation control files and
365 juggle them at link time. */
367 int flag_use_repository;
369 /* Nonzero if we want to issue diagnostics that the standard says are not
372 int flag_optional_diags = 1;
374 /* Nonzero means we should attempt to elide constructors when possible. */
376 int flag_elide_constructors = 1;
378 /* Nonzero means that member functions defined in class scope are
379 inline by default. */
381 int flag_default_inline = 1;
383 /* Controls whether compiler generates 'type descriptor' that give
384 run-time type information. */
388 /* Nonzero if we want to conserve space in the .o files. We do this
389 by putting uninitialized data and runtime initialized data into
390 .common instead of .data at the expense of not flagging multiple
393 int flag_conserve_space;
395 /* Nonzero if we want to obey access control semantics. */
397 int flag_access_control = 1;
399 /* Nonzero if we want to check the return value of new and avoid calling
400 constructors if it is a null pointer. */
404 /* Nonzero if we want to allow the use of experimental features that
405 are likely to become part of C++0x. */
409 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
410 initialization variables.
411 0: Old rules, set by -fno-for-scope.
412 2: New ISO rules, set by -ffor-scope.
413 1: Try to implement new ISO rules, but with backup compatibility
414 (and warnings). This is the default, for now. */
416 int flag_new_for_scope = 1;
418 /* Nonzero if we want to emit defined symbols with common-like linkage as
419 weak symbols where possible, in order to conform to C++ semantics.
420 Otherwise, emit them as local symbols. */
424 /* 0 means we want the preprocessor to not emit line directives for
425 the current working directory. 1 means we want it to do it. -1
426 means we should decide depending on whether debugging information
427 is being emitted or not. */
429 int flag_working_directory = -1;
431 /* Nonzero to use __cxa_atexit, rather than atexit, to register
432 destructors for local statics and global objects. '2' means it has been
433 set nonzero as a default, not by a command-line flag. */
435 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
437 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
438 code. '2' means it has not been set explicitly on the command line. */
440 int flag_use_cxa_get_exception_ptr = 2;
442 /* Nonzero means make the default pedwarns warnings instead of errors.
443 The value of this flag is ignored if -pedantic is specified. */
447 /* Nonzero means to implement standard semantics for exception
448 specifications, calling unexpected if an exception is thrown that
449 doesn't match the specification. Zero means to treat them as
450 assertions and optimize accordingly, but not check them. */
452 int flag_enforce_eh_specs = 1;
454 /* Nonzero means to generate thread-safe code for initializing local
457 int flag_threadsafe_statics = 1;
459 /* Nonzero means warn about implicit declarations. */
461 int warn_implicit = 1;
463 /* Maximum template instantiation depth. This limit is rather
464 arbitrary, but it exists to limit the time it takes to notice
465 infinite template instantiations. */
467 int max_tinst_depth = 500;
471 /* The elements of `ridpointers' are identifier nodes for the reserved
472 type names and storage classes. It is indexed by a RID_... value. */
475 tree (*make_fname_decl) (tree, int);
477 /* Nonzero means the expression being parsed will never be evaluated.
478 This is a count, since unevaluated expressions can nest. */
481 /* Information about how a function name is generated. */
484 tree *const decl; /* pointer to the VAR_DECL. */
485 const unsigned rid; /* RID number for the identifier. */
486 const int pretty; /* How pretty is it? */
489 /* The three ways of getting then name of the current function. */
491 const struct fname_var_t fname_vars[] =
493 /* C99 compliant __func__, must be first. */
494 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
495 /* GCC __FUNCTION__ compliant. */
496 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
497 /* GCC __PRETTY_FUNCTION__ compliant. */
498 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
502 static tree check_case_value (tree);
503 static bool check_case_bounds (tree, tree, tree *, tree *);
505 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
506 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
507 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
508 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
509 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
510 static tree handle_always_inline_attribute (tree *, tree, tree, int,
512 static tree handle_gnu_inline_attribute (tree *, tree, tree, int,
514 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
516 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
517 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
519 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
520 static tree handle_transparent_union_attribute (tree *, tree, tree,
522 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
528 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
530 static tree handle_visibility_attribute (tree *, tree, tree, int,
532 static tree handle_tls_model_attribute (tree *, tree, tree, int,
534 static tree handle_no_instrument_function_attribute (tree *, tree,
536 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
537 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
538 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
540 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
541 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
542 static tree handle_deprecated_attribute (tree *, tree, tree, int,
544 static tree handle_vector_size_attribute (tree *, tree, tree, int,
546 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
547 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
548 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
549 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
551 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
553 static void check_function_nonnull (tree, tree);
554 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
555 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
556 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
557 static int resort_field_decl_cmp (const void *, const void *);
559 /* Table of machine-independent attributes common to all C-like languages. */
560 const struct attribute_spec c_common_attribute_table[] =
562 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
563 { "packed", 0, 0, false, false, false,
564 handle_packed_attribute },
565 { "nocommon", 0, 0, true, false, false,
566 handle_nocommon_attribute },
567 { "common", 0, 0, true, false, false,
568 handle_common_attribute },
569 /* FIXME: logically, noreturn attributes should be listed as
570 "false, true, true" and apply to function types. But implementing this
571 would require all the places in the compiler that use TREE_THIS_VOLATILE
572 on a decl to identify non-returning functions to be located and fixed
573 to check the function type instead. */
574 { "noreturn", 0, 0, true, false, false,
575 handle_noreturn_attribute },
576 { "volatile", 0, 0, true, false, false,
577 handle_noreturn_attribute },
578 { "noinline", 0, 0, true, false, false,
579 handle_noinline_attribute },
580 { "always_inline", 0, 0, true, false, false,
581 handle_always_inline_attribute },
582 { "gnu_inline", 0, 0, true, false, false,
583 handle_gnu_inline_attribute },
584 { "flatten", 0, 0, true, false, false,
585 handle_flatten_attribute },
586 { "used", 0, 0, true, false, false,
587 handle_used_attribute },
588 { "unused", 0, 0, false, false, false,
589 handle_unused_attribute },
590 { "externally_visible", 0, 0, true, false, false,
591 handle_externally_visible_attribute },
592 /* The same comments as for noreturn attributes apply to const ones. */
593 { "const", 0, 0, true, false, false,
594 handle_const_attribute },
595 { "transparent_union", 0, 0, false, false, false,
596 handle_transparent_union_attribute },
597 { "constructor", 0, 0, true, false, false,
598 handle_constructor_attribute },
599 { "destructor", 0, 0, true, false, false,
600 handle_destructor_attribute },
601 { "mode", 1, 1, false, true, false,
602 handle_mode_attribute },
603 { "section", 1, 1, true, false, false,
604 handle_section_attribute },
605 { "aligned", 0, 1, false, false, false,
606 handle_aligned_attribute },
607 { "weak", 0, 0, true, false, false,
608 handle_weak_attribute },
609 { "alias", 1, 1, true, false, false,
610 handle_alias_attribute },
611 { "weakref", 0, 1, true, false, false,
612 handle_weakref_attribute },
613 { "no_instrument_function", 0, 0, true, false, false,
614 handle_no_instrument_function_attribute },
615 { "malloc", 0, 0, true, false, false,
616 handle_malloc_attribute },
617 { "returns_twice", 0, 0, true, false, false,
618 handle_returns_twice_attribute },
619 { "no_stack_limit", 0, 0, true, false, false,
620 handle_no_limit_stack_attribute },
621 { "pure", 0, 0, true, false, false,
622 handle_pure_attribute },
623 /* For internal use (marking of builtins) only. The name contains space
624 to prevent its usage in source code. */
625 { "no vops", 0, 0, true, false, false,
626 handle_novops_attribute },
627 { "deprecated", 0, 0, false, false, false,
628 handle_deprecated_attribute },
629 { "vector_size", 1, 1, false, true, false,
630 handle_vector_size_attribute },
631 { "visibility", 1, 1, false, false, false,
632 handle_visibility_attribute },
633 { "tls_model", 1, 1, true, false, false,
634 handle_tls_model_attribute },
635 { "nonnull", 0, -1, false, true, true,
636 handle_nonnull_attribute },
637 { "nothrow", 0, 0, true, false, false,
638 handle_nothrow_attribute },
639 { "may_alias", 0, 0, false, true, false, NULL },
640 { "cleanup", 1, 1, true, false, false,
641 handle_cleanup_attribute },
642 { "warn_unused_result", 0, 0, false, true, true,
643 handle_warn_unused_result_attribute },
644 { "sentinel", 0, 1, false, true, true,
645 handle_sentinel_attribute },
646 { NULL, 0, 0, false, false, false, NULL }
649 /* Give the specifications for the format attributes, used by C and all
652 const struct attribute_spec c_common_format_attribute_table[] =
654 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
655 { "format", 3, 3, false, true, true,
656 handle_format_attribute },
657 { "format_arg", 1, 1, false, true, true,
658 handle_format_arg_attribute },
659 { NULL, 0, 0, false, false, false, NULL }
662 /* Push current bindings for the function name VAR_DECLS. */
665 start_fname_decls (void)
668 tree saved = NULL_TREE;
670 for (ix = 0; fname_vars[ix].decl; ix++)
672 tree decl = *fname_vars[ix].decl;
676 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
677 *fname_vars[ix].decl = NULL_TREE;
680 if (saved || saved_function_name_decls)
681 /* Normally they'll have been NULL, so only push if we've got a
682 stack, or they are non-NULL. */
683 saved_function_name_decls = tree_cons (saved, NULL_TREE,
684 saved_function_name_decls);
687 /* Finish up the current bindings, adding them into the current function's
688 statement tree. This must be done _before_ finish_stmt_tree is called.
689 If there is no current function, we must be at file scope and no statements
690 are involved. Pop the previous bindings. */
693 finish_fname_decls (void)
696 tree stmts = NULL_TREE;
697 tree stack = saved_function_name_decls;
699 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
700 append_to_statement_list (TREE_VALUE (stack), &stmts);
704 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
706 if (TREE_CODE (*bodyp) == BIND_EXPR)
707 bodyp = &BIND_EXPR_BODY (*bodyp);
709 append_to_statement_list_force (*bodyp, &stmts);
713 for (ix = 0; fname_vars[ix].decl; ix++)
714 *fname_vars[ix].decl = NULL_TREE;
718 /* We had saved values, restore them. */
721 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
723 tree decl = TREE_PURPOSE (saved);
724 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
726 *fname_vars[ix].decl = decl;
728 stack = TREE_CHAIN (stack);
730 saved_function_name_decls = stack;
733 /* Return the text name of the current function, suitably prettified
734 by PRETTY_P. Return string must be freed by caller. */
737 fname_as_string (int pretty_p)
739 const char *name = "top level";
749 if (current_function_decl)
750 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
752 if (c_lex_string_translate)
754 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
755 cpp_string cstr = { 0, 0 }, strname;
757 namep = XNEWVEC (char, len);
758 snprintf (namep, len, "\"%s\"", name);
759 strname.text = (unsigned char *) namep;
760 strname.len = len - 1;
762 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
765 return (char *) cstr.text;
769 namep = xstrdup (name);
774 /* Expand DECL if it declares an entity not handled by the
778 c_expand_decl (tree decl)
780 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
782 /* Let the back-end know about this variable. */
783 if (!anon_aggr_type_p (TREE_TYPE (decl)))
784 emit_local_var (decl);
786 expand_anon_union_decl (decl, NULL_TREE,
787 DECL_ANON_UNION_ELEMS (decl));
796 /* Return the VAR_DECL for a const char array naming the current
797 function. If the VAR_DECL has not yet been created, create it
798 now. RID indicates how it should be formatted and IDENTIFIER_NODE
799 ID is its name (unfortunately C and C++ hold the RID values of
800 keywords in different places, so we can't derive RID from ID in
801 this language independent code. */
804 fname_decl (unsigned int rid, tree id)
807 tree decl = NULL_TREE;
809 for (ix = 0; fname_vars[ix].decl; ix++)
810 if (fname_vars[ix].rid == rid)
813 decl = *fname_vars[ix].decl;
816 /* If a tree is built here, it would normally have the lineno of
817 the current statement. Later this tree will be moved to the
818 beginning of the function and this line number will be wrong.
819 To avoid this problem set the lineno to 0 here; that prevents
820 it from appearing in the RTL. */
822 location_t saved_location = input_location;
823 #ifdef USE_MAPPED_LOCATION
824 input_location = UNKNOWN_LOCATION;
829 stmts = push_stmt_list ();
830 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
831 stmts = pop_stmt_list (stmts);
832 if (!IS_EMPTY_STMT (stmts))
833 saved_function_name_decls
834 = tree_cons (decl, stmts, saved_function_name_decls);
835 *fname_vars[ix].decl = decl;
836 input_location = saved_location;
838 if (!ix && !current_function_decl)
839 pedwarn ("%qD is not defined outside of function scope", decl);
844 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
847 fix_string_type (tree value)
849 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
850 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
851 int length = TREE_STRING_LENGTH (value);
853 tree e_type, i_type, a_type;
855 /* Compute the number of elements, for the array type. */
856 nchars = wide_flag ? length / wchar_bytes : length;
858 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
859 limit in C++98 Annex B is very large (65536) and is not normative,
860 so we do not diagnose it (warn_overlength_strings is forced off
861 in c_common_post_options). */
862 if (warn_overlength_strings)
864 const int nchars_max = flag_isoc99 ? 4095 : 509;
865 const int relevant_std = flag_isoc99 ? 99 : 90;
866 if (nchars - 1 > nchars_max)
867 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
868 separate the %d from the 'C'. 'ISO' should not be
869 translated, but it may be moved after 'C%d' in languages
870 where modifiers follow nouns. */
871 pedwarn ("string length %qd is greater than the length %qd "
872 "ISO C%d compilers are required to support",
873 nchars - 1, nchars_max, relevant_std);
876 /* Create the array type for the string constant. The ISO C++
877 standard says that a string literal has type `const char[N]' or
878 `const wchar_t[N]'. We use the same logic when invoked as a C
879 front-end with -Wwrite-strings.
880 ??? We should change the type of an expression depending on the
881 state of a warning flag. We should just be warning -- see how
882 this is handled in the C++ front-end for the deprecated implicit
883 conversion from string literals to `char*' or `wchar_t*'.
885 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
886 array type being the unqualified version of that type.
887 Therefore, if we are constructing an array of const char, we must
888 construct the matching unqualified array type first. The C front
889 end does not require this, but it does no harm, so we do it
891 e_type = wide_flag ? wchar_type_node : char_type_node;
892 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
893 a_type = build_array_type (e_type, i_type);
894 if (c_dialect_cxx() || warn_write_strings)
895 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
897 TREE_TYPE (value) = a_type;
898 TREE_CONSTANT (value) = 1;
899 TREE_INVARIANT (value) = 1;
900 TREE_READONLY (value) = 1;
901 TREE_STATIC (value) = 1;
905 /* Print a warning if a constant expression had overflow in folding.
906 Invoke this function on every expression that the language
907 requires to be a constant expression.
908 Note the ANSI C standard says it is erroneous for a
909 constant expression to overflow. */
912 constant_expression_warning (tree value)
914 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
915 || TREE_CODE (value) == VECTOR_CST
916 || TREE_CODE (value) == COMPLEX_CST)
917 && TREE_CONSTANT_OVERFLOW (value)
920 pedwarn ("overflow in constant expression");
923 /* Print a warning if an expression had overflow in folding.
924 Invoke this function on every expression that
925 (1) appears in the source code, and
926 (2) might be a constant expression that overflowed, and
927 (3) is not already checked by convert_and_check;
928 however, do not invoke this function on operands of explicit casts. */
931 overflow_warning (tree value)
933 if ((TREE_CODE (value) == INTEGER_CST
934 || (TREE_CODE (value) == COMPLEX_CST
935 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
936 && TREE_OVERFLOW (value))
938 TREE_OVERFLOW (value) = 0;
939 if (skip_evaluation == 0)
940 warning (OPT_Woverflow, "integer overflow in expression");
942 else if ((TREE_CODE (value) == REAL_CST
943 || (TREE_CODE (value) == COMPLEX_CST
944 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
945 && TREE_OVERFLOW (value))
947 TREE_OVERFLOW (value) = 0;
948 if (skip_evaluation == 0)
949 warning (OPT_Woverflow, "floating point overflow in expression");
951 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
953 TREE_OVERFLOW (value) = 0;
954 if (skip_evaluation == 0)
955 warning (OPT_Woverflow, "vector overflow in expression");
959 /* Print a warning about casts that might indicate violation
960 of strict aliasing rules if -Wstrict-aliasing is used and
961 strict aliasing mode is in effect. OTYPE is the original
962 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
965 strict_aliasing_warning (tree otype, tree type, tree expr)
967 if (flag_strict_aliasing && warn_strict_aliasing
968 && POINTER_TYPE_P (type) && POINTER_TYPE_P (otype)
969 && TREE_CODE (expr) == ADDR_EXPR
970 && (DECL_P (TREE_OPERAND (expr, 0))
971 || handled_component_p (TREE_OPERAND (expr, 0)))
972 && !VOID_TYPE_P (TREE_TYPE (type)))
974 /* Casting the address of an object to non void pointer. Warn
975 if the cast breaks type based aliasing. */
976 if (!COMPLETE_TYPE_P (TREE_TYPE (type)))
977 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
978 "might break strict-aliasing rules");
981 HOST_WIDE_INT set1 = get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
982 HOST_WIDE_INT set2 = get_alias_set (TREE_TYPE (type));
984 if (!alias_sets_conflict_p (set1, set2))
985 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
986 "pointer will break strict-aliasing rules");
987 else if (warn_strict_aliasing > 1
988 && !alias_sets_might_conflict_p (set1, set2))
989 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
990 "pointer might break strict-aliasing rules");
995 /* Print a warning about if (); or if () .. else; constructs
996 via the special empty statement node that we create. INNER_THEN
997 and INNER_ELSE are the statement lists of the if and the else
1001 empty_body_warning (tree inner_then, tree inner_else)
1003 if (warn_empty_body)
1005 if (TREE_CODE (inner_then) == STATEMENT_LIST
1006 && STATEMENT_LIST_TAIL (inner_then))
1007 inner_then = STATEMENT_LIST_TAIL (inner_then)->stmt;
1009 if (inner_else && TREE_CODE (inner_else) == STATEMENT_LIST
1010 && STATEMENT_LIST_TAIL (inner_else))
1011 inner_else = STATEMENT_LIST_TAIL (inner_else)->stmt;
1013 if (IS_EMPTY_STMT (inner_then) && !inner_else)
1014 warning (OPT_Wempty_body, "%Hempty body in an if-statement",
1015 EXPR_LOCUS (inner_then));
1017 if (inner_else && IS_EMPTY_STMT (inner_else))
1018 warning (OPT_Wempty_body, "%Hempty body in an else-statement",
1019 EXPR_LOCUS (inner_else));
1023 /* Warn for unlikely, improbable, or stupid DECL declarations
1027 check_main_parameter_types (tree decl)
1032 for (args = TYPE_ARG_TYPES (TREE_TYPE (decl)); args;
1033 args = TREE_CHAIN (args))
1035 tree type = args ? TREE_VALUE (args) : 0;
1037 if (type == void_type_node || type == error_mark_node )
1044 if (TYPE_MAIN_VARIANT (type) != integer_type_node)
1045 pedwarn ("first argument of %q+D should be %<int%>", decl);
1049 if (TREE_CODE (type) != POINTER_TYPE
1050 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1051 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1053 pedwarn ("second argument of %q+D should be %<char **%>",
1058 if (TREE_CODE (type) != POINTER_TYPE
1059 || TREE_CODE (TREE_TYPE (type)) != POINTER_TYPE
1060 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type)))
1062 pedwarn ("third argument of %q+D should probably be "
1063 "%<char **%>", decl);
1068 /* It is intentional that this message does not mention the third
1069 argument because it's only mentioned in an appendix of the
1071 if (argct > 0 && (argct < 2 || argct > 3))
1072 pedwarn ("%q+D takes only zero or two arguments", decl);
1076 /* Nonzero if vector types T1 and T2 can be converted to each other
1077 without an explicit cast. */
1079 vector_types_convertible_p (tree t1, tree t2)
1081 return targetm.vector_opaque_p (t1)
1082 || targetm.vector_opaque_p (t2)
1083 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1084 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1085 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1086 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
1087 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
1090 /* Warns if the conversion of EXPR to TYPE may alter a value.
1091 This function is called from convert_and_check. */
1094 conversion_warning (tree type, tree expr)
1096 bool give_warning = false;
1098 unsigned int formal_prec = TYPE_PRECISION (type);
1100 if (TREE_CODE (expr) == REAL_CST || TREE_CODE (expr) == INTEGER_CST)
1102 /* Warn for real constant that is not an exact integer converted
1104 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1105 && TREE_CODE (type) == INTEGER_TYPE)
1107 if (!real_isinteger (TREE_REAL_CST_PTR (expr), TYPE_MODE (TREE_TYPE (expr))))
1108 give_warning = true;
1110 /* Warn for an integer constant that does not fit into integer type. */
1111 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1112 && TREE_CODE (type) == INTEGER_TYPE
1113 && !int_fits_type_p (expr, type))
1115 if (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr)))
1116 warning (OPT_Wconversion,
1117 "negative integer implicitly converted to unsigned type");
1119 give_warning = true;
1121 else if (TREE_CODE (type) == REAL_TYPE)
1123 /* Warn for an integer constant that does not fit into real type. */
1124 if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE)
1126 REAL_VALUE_TYPE a = real_value_from_int_cst (0, expr);
1127 if (!exact_real_truncate (TYPE_MODE (type), &a))
1128 give_warning = true;
1130 /* Warn for a real constant that does not fit into a smaller
1132 else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1133 && formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1135 REAL_VALUE_TYPE a = TREE_REAL_CST (expr);
1136 if (!exact_real_truncate (TYPE_MODE (type), &a))
1137 give_warning = true;
1142 warning (OPT_Wconversion,
1143 "conversion to %qT alters %qT constant value",
1144 type, TREE_TYPE (expr));
1146 else /* 'expr' is not a constant. */
1148 /* Warn for real types converted to integer types. */
1149 if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1150 && TREE_CODE (type) == INTEGER_TYPE)
1151 give_warning = true;
1153 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1154 && TREE_CODE (type) == INTEGER_TYPE)
1156 /* Warn for integer types converted to smaller integer types. */
1157 if (formal_prec < TYPE_PRECISION (TREE_TYPE (expr))
1158 /* When they are the same width but different signedness,
1159 then the value may change. */
1160 || (formal_prec == TYPE_PRECISION (TREE_TYPE (expr))
1161 && TYPE_UNSIGNED (TREE_TYPE (expr)) != TYPE_UNSIGNED (type))
1162 /* Even when converted to a bigger type, if the type is
1163 unsigned but expr is signed, then negative values
1165 || (TYPE_UNSIGNED (type) && !TYPE_UNSIGNED (TREE_TYPE (expr))))
1166 give_warning = true;
1169 /* Warn for integer types converted to real types if and only if
1170 all the range of values of the integer type cannot be
1171 represented by the real type. */
1172 else if (TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1173 && TREE_CODE (type) == REAL_TYPE)
1175 tree type_low_bound = TYPE_MIN_VALUE (TREE_TYPE (expr));
1176 tree type_high_bound = TYPE_MAX_VALUE (TREE_TYPE (expr));
1177 REAL_VALUE_TYPE real_low_bound = real_value_from_int_cst (0, type_low_bound);
1178 REAL_VALUE_TYPE real_high_bound = real_value_from_int_cst (0, type_high_bound);
1180 if (!exact_real_truncate (TYPE_MODE (type), &real_low_bound)
1181 || !exact_real_truncate (TYPE_MODE (type), &real_high_bound))
1182 give_warning = true;
1185 /* Warn for real types converted to smaller real types. */
1186 else if (TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE
1187 && TREE_CODE (type) == REAL_TYPE
1188 && formal_prec < TYPE_PRECISION (TREE_TYPE (expr)))
1189 give_warning = true;
1193 warning (OPT_Wconversion,
1194 "conversion to %qT from %qT may alter its value",
1195 type, TREE_TYPE (expr));
1199 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1200 Invoke this function on every expression that is converted implicitly,
1201 i.e. because of language rules and not because of an explicit cast. */
1204 convert_and_check (tree type, tree expr)
1208 if (TREE_TYPE (expr) == type)
1211 result = convert (type, expr);
1213 if (skip_evaluation)
1217 if (TREE_CODE (expr) == INTEGER_CST
1218 && (TREE_CODE (type) == INTEGER_TYPE
1219 || TREE_CODE (type) == ENUMERAL_TYPE)
1220 && !int_fits_type_p (expr, type))
1222 /* Do not diagnose overflow in a constant expression merely
1223 because a conversion overflowed. */
1224 if (TREE_OVERFLOW (result))
1226 TREE_CONSTANT_OVERFLOW (result) = TREE_CONSTANT_OVERFLOW (expr);
1227 TREE_OVERFLOW (result) = TREE_OVERFLOW (expr);
1230 if (TYPE_UNSIGNED (type))
1232 /* This detects cases like converting -129 or 256 to
1234 if (!int_fits_type_p (expr, c_common_signed_type (type)))
1235 warning (OPT_Woverflow,
1236 "large integer implicitly truncated to unsigned type");
1237 else if (warn_conversion)
1238 conversion_warning (type, expr);
1242 if (!int_fits_type_p (expr, c_common_unsigned_type (type)))
1243 warning (OPT_Woverflow,
1244 "overflow in implicit constant conversion");
1245 /* No warning for converting 0x80000000 to int. */
1247 && (TREE_CODE (TREE_TYPE (expr)) != INTEGER_TYPE
1248 || TYPE_PRECISION (TREE_TYPE (expr))
1249 != TYPE_PRECISION (type)))
1250 warning (OPT_Woverflow,
1251 "overflow in implicit constant conversion");
1252 else if (warn_conversion)
1253 conversion_warning (type, expr);
1256 else if (TREE_CODE (result) == INTEGER_CST && TREE_OVERFLOW (result))
1257 warning (OPT_Woverflow,
1258 "overflow in implicit constant conversion");
1259 else if (warn_conversion)
1260 conversion_warning (type, expr);
1265 /* A node in a list that describes references to variables (EXPR), which are
1266 either read accesses if WRITER is zero, or write accesses, in which case
1267 WRITER is the parent of EXPR. */
1274 /* Used to implement a cache the results of a call to verify_tree. We only
1275 use this for SAVE_EXPRs. */
1278 struct tlist_cache *next;
1279 struct tlist *cache_before_sp;
1280 struct tlist *cache_after_sp;
1284 /* Obstack to use when allocating tlist structures, and corresponding
1286 static struct obstack tlist_obstack;
1287 static char *tlist_firstobj = 0;
1289 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1291 static struct tlist *warned_ids;
1292 /* SAVE_EXPRs need special treatment. We process them only once and then
1293 cache the results. */
1294 static struct tlist_cache *save_expr_cache;
1296 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1297 static void merge_tlist (struct tlist **, struct tlist *, int);
1298 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1299 static int warning_candidate_p (tree);
1300 static void warn_for_collisions (struct tlist *);
1301 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1302 static struct tlist *new_tlist (struct tlist *, tree, tree);
1304 /* Create a new struct tlist and fill in its fields. */
1305 static struct tlist *
1306 new_tlist (struct tlist *next, tree t, tree writer)
1309 l = XOBNEW (&tlist_obstack, struct tlist);
1316 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1317 is nonnull, we ignore any node we find which has a writer equal to it. */
1320 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1324 struct tlist *next = add->next;
1327 if (!exclude_writer || add->writer != exclude_writer)
1328 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1333 /* Merge the nodes of ADD into TO. This merging process is done so that for
1334 each variable that already exists in TO, no new node is added; however if
1335 there is a write access recorded in ADD, and an occurrence on TO is only
1336 a read access, then the occurrence in TO will be modified to record the
1340 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1342 struct tlist **end = to;
1345 end = &(*end)->next;
1351 struct tlist *next = add->next;
1353 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1354 if (tmp2->expr == add->expr)
1358 tmp2->writer = add->writer;
1362 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1363 end = &(*end)->next;
1370 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1371 references in list LIST conflict with it, excluding reads if ONLY writers
1375 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1380 /* Avoid duplicate warnings. */
1381 for (tmp = warned_ids; tmp; tmp = tmp->next)
1382 if (tmp->expr == written)
1387 if (list->expr == written
1388 && list->writer != writer
1389 && (!only_writes || list->writer)
1390 && DECL_NAME (list->expr))
1392 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1393 warning (0, "operation on %qE may be undefined", list->expr);
1399 /* Given a list LIST of references to variables, find whether any of these
1400 can cause conflicts due to missing sequence points. */
1403 warn_for_collisions (struct tlist *list)
1407 for (tmp = list; tmp; tmp = tmp->next)
1410 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1414 /* Return nonzero if X is a tree that can be verified by the sequence point
1417 warning_candidate_p (tree x)
1419 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1422 /* Walk the tree X, and record accesses to variables. If X is written by the
1423 parent tree, WRITER is the parent.
1424 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1425 expression or its only operand forces a sequence point, then everything up
1426 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1428 Once we return, we will have emitted warnings if any subexpression before
1429 such a sequence point could be undefined. On a higher level, however, the
1430 sequence point may not be relevant, and we'll merge the two lists.
1432 Example: (b++, a) + b;
1433 The call that processes the COMPOUND_EXPR will store the increment of B
1434 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1435 processes the PLUS_EXPR will need to merge the two lists so that
1436 eventually, all accesses end up on the same list (and we'll warn about the
1437 unordered subexpressions b++ and b.
1439 A note on merging. If we modify the former example so that our expression
1442 care must be taken not simply to add all three expressions into the final
1443 PNO_SP list. The function merge_tlist takes care of that by merging the
1444 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1445 way, so that no more than one access to B is recorded. */
1448 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1451 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1452 enum tree_code code;
1453 enum tree_code_class cl;
1455 /* X may be NULL if it is the operand of an empty statement expression
1461 code = TREE_CODE (x);
1462 cl = TREE_CODE_CLASS (code);
1464 if (warning_candidate_p (x))
1466 *pno_sp = new_tlist (*pno_sp, x, writer);
1476 case TRUTH_ANDIF_EXPR:
1477 case TRUTH_ORIF_EXPR:
1478 tmp_before = tmp_nosp = tmp_list3 = 0;
1479 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1480 warn_for_collisions (tmp_nosp);
1481 merge_tlist (pbefore_sp, tmp_before, 0);
1482 merge_tlist (pbefore_sp, tmp_nosp, 0);
1483 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1484 merge_tlist (pbefore_sp, tmp_list3, 0);
1488 tmp_before = tmp_list2 = 0;
1489 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1490 warn_for_collisions (tmp_list2);
1491 merge_tlist (pbefore_sp, tmp_before, 0);
1492 merge_tlist (pbefore_sp, tmp_list2, 1);
1494 tmp_list3 = tmp_nosp = 0;
1495 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1496 warn_for_collisions (tmp_nosp);
1497 merge_tlist (pbefore_sp, tmp_list3, 0);
1499 tmp_list3 = tmp_list2 = 0;
1500 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1501 warn_for_collisions (tmp_list2);
1502 merge_tlist (pbefore_sp, tmp_list3, 0);
1503 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1504 two first, to avoid warning for (a ? b++ : b++). */
1505 merge_tlist (&tmp_nosp, tmp_list2, 0);
1506 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1509 case PREDECREMENT_EXPR:
1510 case PREINCREMENT_EXPR:
1511 case POSTDECREMENT_EXPR:
1512 case POSTINCREMENT_EXPR:
1513 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1517 tmp_before = tmp_nosp = tmp_list3 = 0;
1518 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1519 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1520 /* Expressions inside the LHS are not ordered wrt. the sequence points
1521 in the RHS. Example:
1523 Despite the fact that the modification of "a" is in the before_sp
1524 list (tmp_before), it conflicts with the use of "a" in the LHS.
1525 We can handle this by adding the contents of tmp_list3
1526 to those of tmp_before, and redoing the collision warnings for that
1528 add_tlist (&tmp_before, tmp_list3, x, 1);
1529 warn_for_collisions (tmp_before);
1530 /* Exclude the LHS itself here; we first have to merge it into the
1531 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1532 didn't exclude the LHS, we'd get it twice, once as a read and once
1534 add_tlist (pno_sp, tmp_list3, x, 0);
1535 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1537 merge_tlist (pbefore_sp, tmp_before, 0);
1538 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1539 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1540 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1544 /* We need to warn about conflicts among arguments and conflicts between
1545 args and the function address. Side effects of the function address,
1546 however, are not ordered by the sequence point of the call. */
1547 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1548 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1549 if (TREE_OPERAND (x, 1))
1550 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1551 merge_tlist (&tmp_list3, tmp_list2, 0);
1552 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1553 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1554 warn_for_collisions (tmp_before);
1555 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1559 /* Scan all the list, e.g. indices of multi dimensional array. */
1562 tmp_before = tmp_nosp = 0;
1563 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1564 merge_tlist (&tmp_nosp, tmp_before, 0);
1565 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1572 struct tlist_cache *t;
1573 for (t = save_expr_cache; t; t = t->next)
1579 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1580 t->next = save_expr_cache;
1582 save_expr_cache = t;
1584 tmp_before = tmp_nosp = 0;
1585 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1586 warn_for_collisions (tmp_nosp);
1591 struct tlist *t = tmp_nosp;
1593 merge_tlist (&tmp_list3, t, 0);
1595 t->cache_before_sp = tmp_before;
1596 t->cache_after_sp = tmp_list3;
1598 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1599 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1604 /* For other expressions, simply recurse on their operands.
1605 Manual tail recursion for unary expressions.
1606 Other non-expressions need not be processed. */
1607 if (cl == tcc_unary)
1609 x = TREE_OPERAND (x, 0);
1613 else if (IS_EXPR_CODE_CLASS (cl))
1616 int max = TREE_CODE_LENGTH (TREE_CODE (x));
1617 for (lp = 0; lp < max; lp++)
1619 tmp_before = tmp_nosp = 0;
1620 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
1621 merge_tlist (&tmp_nosp, tmp_before, 0);
1622 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1629 /* Try to warn for undefined behavior in EXPR due to missing sequence
1633 verify_sequence_points (tree expr)
1635 struct tlist *before_sp = 0, *after_sp = 0;
1638 save_expr_cache = 0;
1639 if (tlist_firstobj == 0)
1641 gcc_obstack_init (&tlist_obstack);
1642 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1645 verify_tree (expr, &before_sp, &after_sp, 0);
1646 warn_for_collisions (after_sp);
1647 obstack_free (&tlist_obstack, tlist_firstobj);
1650 /* Validate the expression after `case' and apply default promotions. */
1653 check_case_value (tree value)
1655 if (value == NULL_TREE)
1658 /* ??? Can we ever get nops here for a valid case value? We
1660 STRIP_TYPE_NOPS (value);
1661 /* In C++, the following is allowed:
1664 switch (...) { case i: ... }
1666 So, we try to reduce the VALUE to a constant that way. */
1667 if (c_dialect_cxx ())
1669 value = decl_constant_value (value);
1670 STRIP_TYPE_NOPS (value);
1671 value = fold (value);
1674 if (TREE_CODE (value) == INTEGER_CST)
1675 /* Promote char or short to int. */
1676 value = perform_integral_promotions (value);
1677 else if (value != error_mark_node)
1679 error ("case label does not reduce to an integer constant");
1680 value = error_mark_node;
1683 constant_expression_warning (value);
1688 /* See if the case values LOW and HIGH are in the range of the original
1689 type (i.e. before the default conversion to int) of the switch testing
1691 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1692 the type before promoting it. CASE_LOW_P is a pointer to the lower
1693 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1694 if the case is not a case range.
1695 The caller has to make sure that we are not called with NULL for
1696 CASE_LOW_P (i.e. the default case).
1697 Returns true if the case label is in range of ORIG_TYPE (saturated or
1698 untouched) or false if the label is out of range. */
1701 check_case_bounds (tree type, tree orig_type,
1702 tree *case_low_p, tree *case_high_p)
1704 tree min_value, max_value;
1705 tree case_low = *case_low_p;
1706 tree case_high = case_high_p ? *case_high_p : case_low;
1708 /* If there was a problem with the original type, do nothing. */
1709 if (orig_type == error_mark_node)
1712 min_value = TYPE_MIN_VALUE (orig_type);
1713 max_value = TYPE_MAX_VALUE (orig_type);
1715 /* Case label is less than minimum for type. */
1716 if (tree_int_cst_compare (case_low, min_value) < 0
1717 && tree_int_cst_compare (case_high, min_value) < 0)
1719 warning (0, "case label value is less than minimum value for type");
1723 /* Case value is greater than maximum for type. */
1724 if (tree_int_cst_compare (case_low, max_value) > 0
1725 && tree_int_cst_compare (case_high, max_value) > 0)
1727 warning (0, "case label value exceeds maximum value for type");
1731 /* Saturate lower case label value to minimum. */
1732 if (tree_int_cst_compare (case_high, min_value) >= 0
1733 && tree_int_cst_compare (case_low, min_value) < 0)
1735 warning (0, "lower value in case label range"
1736 " less than minimum value for type");
1737 case_low = min_value;
1740 /* Saturate upper case label value to maximum. */
1741 if (tree_int_cst_compare (case_low, max_value) <= 0
1742 && tree_int_cst_compare (case_high, max_value) > 0)
1744 warning (0, "upper value in case label range"
1745 " exceeds maximum value for type");
1746 case_high = max_value;
1749 if (*case_low_p != case_low)
1750 *case_low_p = convert (type, case_low);
1751 if (case_high_p && *case_high_p != case_high)
1752 *case_high_p = convert (type, case_high);
1757 /* Return an integer type with BITS bits of precision,
1758 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1761 c_common_type_for_size (unsigned int bits, int unsignedp)
1763 if (bits == TYPE_PRECISION (integer_type_node))
1764 return unsignedp ? unsigned_type_node : integer_type_node;
1766 if (bits == TYPE_PRECISION (signed_char_type_node))
1767 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1769 if (bits == TYPE_PRECISION (short_integer_type_node))
1770 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1772 if (bits == TYPE_PRECISION (long_integer_type_node))
1773 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1775 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1776 return (unsignedp ? long_long_unsigned_type_node
1777 : long_long_integer_type_node);
1779 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1780 return (unsignedp ? widest_unsigned_literal_type_node
1781 : widest_integer_literal_type_node);
1783 if (bits <= TYPE_PRECISION (intQI_type_node))
1784 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1786 if (bits <= TYPE_PRECISION (intHI_type_node))
1787 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1789 if (bits <= TYPE_PRECISION (intSI_type_node))
1790 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1792 if (bits <= TYPE_PRECISION (intDI_type_node))
1793 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1798 /* Used for communication between c_common_type_for_mode and
1799 c_register_builtin_type. */
1800 static GTY(()) tree registered_builtin_types;
1802 /* Return a data type that has machine mode MODE.
1803 If the mode is an integer,
1804 then UNSIGNEDP selects between signed and unsigned types. */
1807 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1811 if (mode == TYPE_MODE (integer_type_node))
1812 return unsignedp ? unsigned_type_node : integer_type_node;
1814 if (mode == TYPE_MODE (signed_char_type_node))
1815 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1817 if (mode == TYPE_MODE (short_integer_type_node))
1818 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1820 if (mode == TYPE_MODE (long_integer_type_node))
1821 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1823 if (mode == TYPE_MODE (long_long_integer_type_node))
1824 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1826 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1827 return unsignedp ? widest_unsigned_literal_type_node
1828 : widest_integer_literal_type_node;
1831 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1834 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1837 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1840 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1842 #if HOST_BITS_PER_WIDE_INT >= 64
1843 if (mode == TYPE_MODE (intTI_type_node))
1844 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1847 if (mode == TYPE_MODE (float_type_node))
1848 return float_type_node;
1850 if (mode == TYPE_MODE (double_type_node))
1851 return double_type_node;
1853 if (mode == TYPE_MODE (long_double_type_node))
1854 return long_double_type_node;
1856 if (mode == TYPE_MODE (void_type_node))
1857 return void_type_node;
1859 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1861 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1862 : make_signed_type (GET_MODE_PRECISION (mode)));
1864 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1866 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1867 : make_signed_type (GET_MODE_PRECISION (mode)));
1869 if (COMPLEX_MODE_P (mode))
1871 enum machine_mode inner_mode;
1874 if (mode == TYPE_MODE (complex_float_type_node))
1875 return complex_float_type_node;
1876 if (mode == TYPE_MODE (complex_double_type_node))
1877 return complex_double_type_node;
1878 if (mode == TYPE_MODE (complex_long_double_type_node))
1879 return complex_long_double_type_node;
1881 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
1882 return complex_integer_type_node;
1884 inner_mode = GET_MODE_INNER (mode);
1885 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1886 if (inner_type != NULL_TREE)
1887 return build_complex_type (inner_type);
1889 else if (VECTOR_MODE_P (mode))
1891 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1892 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1893 if (inner_type != NULL_TREE)
1894 return build_vector_type_for_mode (inner_type, mode);
1897 if (mode == TYPE_MODE (dfloat32_type_node))
1898 return dfloat32_type_node;
1899 if (mode == TYPE_MODE (dfloat64_type_node))
1900 return dfloat64_type_node;
1901 if (mode == TYPE_MODE (dfloat128_type_node))
1902 return dfloat128_type_node;
1904 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1905 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1906 return TREE_VALUE (t);
1911 /* Return an unsigned type the same as TYPE in other respects. */
1913 c_common_unsigned_type (tree type)
1915 tree type1 = TYPE_MAIN_VARIANT (type);
1916 if (type1 == signed_char_type_node || type1 == char_type_node)
1917 return unsigned_char_type_node;
1918 if (type1 == integer_type_node)
1919 return unsigned_type_node;
1920 if (type1 == short_integer_type_node)
1921 return short_unsigned_type_node;
1922 if (type1 == long_integer_type_node)
1923 return long_unsigned_type_node;
1924 if (type1 == long_long_integer_type_node)
1925 return long_long_unsigned_type_node;
1926 if (type1 == widest_integer_literal_type_node)
1927 return widest_unsigned_literal_type_node;
1928 #if HOST_BITS_PER_WIDE_INT >= 64
1929 if (type1 == intTI_type_node)
1930 return unsigned_intTI_type_node;
1932 if (type1 == intDI_type_node)
1933 return unsigned_intDI_type_node;
1934 if (type1 == intSI_type_node)
1935 return unsigned_intSI_type_node;
1936 if (type1 == intHI_type_node)
1937 return unsigned_intHI_type_node;
1938 if (type1 == intQI_type_node)
1939 return unsigned_intQI_type_node;
1941 return c_common_signed_or_unsigned_type (1, type);
1944 /* Return a signed type the same as TYPE in other respects. */
1947 c_common_signed_type (tree type)
1949 tree type1 = TYPE_MAIN_VARIANT (type);
1950 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1951 return signed_char_type_node;
1952 if (type1 == unsigned_type_node)
1953 return integer_type_node;
1954 if (type1 == short_unsigned_type_node)
1955 return short_integer_type_node;
1956 if (type1 == long_unsigned_type_node)
1957 return long_integer_type_node;
1958 if (type1 == long_long_unsigned_type_node)
1959 return long_long_integer_type_node;
1960 if (type1 == widest_unsigned_literal_type_node)
1961 return widest_integer_literal_type_node;
1962 #if HOST_BITS_PER_WIDE_INT >= 64
1963 if (type1 == unsigned_intTI_type_node)
1964 return intTI_type_node;
1966 if (type1 == unsigned_intDI_type_node)
1967 return intDI_type_node;
1968 if (type1 == unsigned_intSI_type_node)
1969 return intSI_type_node;
1970 if (type1 == unsigned_intHI_type_node)
1971 return intHI_type_node;
1972 if (type1 == unsigned_intQI_type_node)
1973 return intQI_type_node;
1975 return c_common_signed_or_unsigned_type (0, type);
1978 /* Return a type the same as TYPE except unsigned or
1979 signed according to UNSIGNEDP. */
1982 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1984 if (!INTEGRAL_TYPE_P (type)
1985 || TYPE_UNSIGNED (type) == unsignedp)
1988 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1989 the precision; they have precision set to match their range, but
1990 may use a wider mode to match an ABI. If we change modes, we may
1991 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1992 the precision as well, so as to yield correct results for
1993 bit-field types. C++ does not have these separate bit-field
1994 types, and producing a signed or unsigned variant of an
1995 ENUMERAL_TYPE may cause other problems as well. */
1997 #define TYPE_OK(node) \
1998 (TYPE_MODE (type) == TYPE_MODE (node) \
1999 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2000 if (TYPE_OK (signed_char_type_node))
2001 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2002 if (TYPE_OK (integer_type_node))
2003 return unsignedp ? unsigned_type_node : integer_type_node;
2004 if (TYPE_OK (short_integer_type_node))
2005 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2006 if (TYPE_OK (long_integer_type_node))
2007 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2008 if (TYPE_OK (long_long_integer_type_node))
2009 return (unsignedp ? long_long_unsigned_type_node
2010 : long_long_integer_type_node);
2011 if (TYPE_OK (widest_integer_literal_type_node))
2012 return (unsignedp ? widest_unsigned_literal_type_node
2013 : widest_integer_literal_type_node);
2015 #if HOST_BITS_PER_WIDE_INT >= 64
2016 if (TYPE_OK (intTI_type_node))
2017 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2019 if (TYPE_OK (intDI_type_node))
2020 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2021 if (TYPE_OK (intSI_type_node))
2022 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2023 if (TYPE_OK (intHI_type_node))
2024 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2025 if (TYPE_OK (intQI_type_node))
2026 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2029 if (c_dialect_cxx ())
2032 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
2035 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2038 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width, int unsignedp)
2040 /* Extended integer types of the same width as a standard type have
2041 lesser rank, so those of the same width as int promote to int or
2042 unsigned int and are valid for printf formats expecting int or
2043 unsigned int. To avoid such special cases, avoid creating
2044 extended integer types for bit-fields if a standard integer type
2046 if (width == TYPE_PRECISION (integer_type_node))
2047 return unsignedp ? unsigned_type_node : integer_type_node;
2048 if (width == TYPE_PRECISION (signed_char_type_node))
2049 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2050 if (width == TYPE_PRECISION (short_integer_type_node))
2051 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2052 if (width == TYPE_PRECISION (long_integer_type_node))
2053 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2054 if (width == TYPE_PRECISION (long_long_integer_type_node))
2055 return (unsignedp ? long_long_unsigned_type_node
2056 : long_long_integer_type_node);
2057 return build_nonstandard_integer_type (width, unsignedp);
2060 /* The C version of the register_builtin_type langhook. */
2063 c_register_builtin_type (tree type, const char* name)
2067 decl = build_decl (TYPE_DECL, get_identifier (name), type);
2068 DECL_ARTIFICIAL (decl) = 1;
2069 if (!TYPE_NAME (type))
2070 TYPE_NAME (type) = decl;
2073 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
2077 /* Return the minimum number of bits needed to represent VALUE in a
2078 signed or unsigned type, UNSIGNEDP says which. */
2081 min_precision (tree value, int unsignedp)
2085 /* If the value is negative, compute its negative minus 1. The latter
2086 adjustment is because the absolute value of the largest negative value
2087 is one larger than the largest positive value. This is equivalent to
2088 a bit-wise negation, so use that operation instead. */
2090 if (tree_int_cst_sgn (value) < 0)
2091 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
2093 /* Return the number of bits needed, taking into account the fact
2094 that we need one more bit for a signed than unsigned type. */
2096 if (integer_zerop (value))
2099 log = tree_floor_log2 (value);
2101 return log + 1 + !unsignedp;
2104 /* Print an error message for invalid operands to arith operation
2108 binary_op_error (enum tree_code code)
2115 opname = "+"; break;
2117 opname = "-"; break;
2119 opname = "*"; break;
2121 opname = "max"; break;
2123 opname = "min"; break;
2125 opname = "=="; break;
2127 opname = "!="; break;
2129 opname = "<="; break;
2131 opname = ">="; break;
2133 opname = "<"; break;
2135 opname = ">"; break;
2137 opname = "<<"; break;
2139 opname = ">>"; break;
2140 case TRUNC_MOD_EXPR:
2141 case FLOOR_MOD_EXPR:
2142 opname = "%"; break;
2143 case TRUNC_DIV_EXPR:
2144 case FLOOR_DIV_EXPR:
2145 opname = "/"; break;
2147 opname = "&"; break;
2149 opname = "|"; break;
2150 case TRUTH_ANDIF_EXPR:
2151 opname = "&&"; break;
2152 case TRUTH_ORIF_EXPR:
2153 opname = "||"; break;
2155 opname = "^"; break;
2159 error ("invalid operands to binary %s", opname);
2162 /* Subroutine of build_binary_op, used for comparison operations.
2163 See if the operands have both been converted from subword integer types
2164 and, if so, perhaps change them both back to their original type.
2165 This function is also responsible for converting the two operands
2166 to the proper common type for comparison.
2168 The arguments of this function are all pointers to local variables
2169 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2170 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2172 If this function returns nonzero, it means that the comparison has
2173 a constant value. What this function returns is an expression for
2177 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2178 enum tree_code *rescode_ptr)
2181 tree op0 = *op0_ptr;
2182 tree op1 = *op1_ptr;
2183 int unsignedp0, unsignedp1;
2185 tree primop0, primop1;
2186 enum tree_code code = *rescode_ptr;
2188 /* Throw away any conversions to wider types
2189 already present in the operands. */
2191 primop0 = get_narrower (op0, &unsignedp0);
2192 primop1 = get_narrower (op1, &unsignedp1);
2194 /* Handle the case that OP0 does not *contain* a conversion
2195 but it *requires* conversion to FINAL_TYPE. */
2197 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2198 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2199 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2200 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2202 /* If one of the operands must be floated, we cannot optimize. */
2203 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2204 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2206 /* If first arg is constant, swap the args (changing operation
2207 so value is preserved), for canonicalization. Don't do this if
2208 the second arg is 0. */
2210 if (TREE_CONSTANT (primop0)
2211 && !integer_zerop (primop1) && !real_zerop (primop1))
2214 int temi = unsignedp0;
2222 unsignedp0 = unsignedp1;
2245 *rescode_ptr = code;
2248 /* If comparing an integer against a constant more bits wide,
2249 maybe we can deduce a value of 1 or 0 independent of the data.
2250 Or else truncate the constant now
2251 rather than extend the variable at run time.
2253 This is only interesting if the constant is the wider arg.
2254 Also, it is not safe if the constant is unsigned and the
2255 variable arg is signed, since in this case the variable
2256 would be sign-extended and then regarded as unsigned.
2257 Our technique fails in this case because the lowest/highest
2258 possible unsigned results don't follow naturally from the
2259 lowest/highest possible values of the variable operand.
2260 For just EQ_EXPR and NE_EXPR there is another technique that
2261 could be used: see if the constant can be faithfully represented
2262 in the other operand's type, by truncating it and reextending it
2263 and see if that preserves the constant's value. */
2265 if (!real1 && !real2
2266 && TREE_CODE (primop1) == INTEGER_CST
2267 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2269 int min_gt, max_gt, min_lt, max_lt;
2270 tree maxval, minval;
2271 /* 1 if comparison is nominally unsigned. */
2272 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2275 type = c_common_signed_or_unsigned_type (unsignedp0,
2276 TREE_TYPE (primop0));
2278 maxval = TYPE_MAX_VALUE (type);
2279 minval = TYPE_MIN_VALUE (type);
2281 if (unsignedp && !unsignedp0)
2282 *restype_ptr = c_common_signed_type (*restype_ptr);
2284 if (TREE_TYPE (primop1) != *restype_ptr)
2286 /* Convert primop1 to target type, but do not introduce
2287 additional overflow. We know primop1 is an int_cst. */
2288 tree tmp = build_int_cst_wide (*restype_ptr,
2289 TREE_INT_CST_LOW (primop1),
2290 TREE_INT_CST_HIGH (primop1));
2292 primop1 = force_fit_type (tmp, 0, TREE_OVERFLOW (primop1),
2293 TREE_CONSTANT_OVERFLOW (primop1));
2295 if (type != *restype_ptr)
2297 minval = convert (*restype_ptr, minval);
2298 maxval = convert (*restype_ptr, maxval);
2301 if (unsignedp && unsignedp0)
2303 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2304 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2305 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2306 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2310 min_gt = INT_CST_LT (primop1, minval);
2311 max_gt = INT_CST_LT (primop1, maxval);
2312 min_lt = INT_CST_LT (minval, primop1);
2313 max_lt = INT_CST_LT (maxval, primop1);
2317 /* This used to be a switch, but Genix compiler can't handle that. */
2318 if (code == NE_EXPR)
2320 if (max_lt || min_gt)
2321 val = truthvalue_true_node;
2323 else if (code == EQ_EXPR)
2325 if (max_lt || min_gt)
2326 val = truthvalue_false_node;
2328 else if (code == LT_EXPR)
2331 val = truthvalue_true_node;
2333 val = truthvalue_false_node;
2335 else if (code == GT_EXPR)
2338 val = truthvalue_true_node;
2340 val = truthvalue_false_node;
2342 else if (code == LE_EXPR)
2345 val = truthvalue_true_node;
2347 val = truthvalue_false_node;
2349 else if (code == GE_EXPR)
2352 val = truthvalue_true_node;
2354 val = truthvalue_false_node;
2357 /* If primop0 was sign-extended and unsigned comparison specd,
2358 we did a signed comparison above using the signed type bounds.
2359 But the comparison we output must be unsigned.
2361 Also, for inequalities, VAL is no good; but if the signed
2362 comparison had *any* fixed result, it follows that the
2363 unsigned comparison just tests the sign in reverse
2364 (positive values are LE, negative ones GE).
2365 So we can generate an unsigned comparison
2366 against an extreme value of the signed type. */
2368 if (unsignedp && !unsignedp0)
2375 primop1 = TYPE_MIN_VALUE (type);
2381 primop1 = TYPE_MAX_VALUE (type);
2388 type = c_common_unsigned_type (type);
2391 if (TREE_CODE (primop0) != INTEGER_CST)
2393 if (val == truthvalue_false_node)
2394 warning (0, "comparison is always false due to limited range of data type");
2395 if (val == truthvalue_true_node)
2396 warning (0, "comparison is always true due to limited range of data type");
2401 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2402 if (TREE_SIDE_EFFECTS (primop0))
2403 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2407 /* Value is not predetermined, but do the comparison
2408 in the type of the operand that is not constant.
2409 TYPE is already properly set. */
2412 /* If either arg is decimal float and the other is float, find the
2413 proper common type to use for comparison. */
2414 else if (real1 && real2
2415 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
2416 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
2417 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2419 else if (real1 && real2
2420 && (TYPE_PRECISION (TREE_TYPE (primop0))
2421 == TYPE_PRECISION (TREE_TYPE (primop1))))
2422 type = TREE_TYPE (primop0);
2424 /* If args' natural types are both narrower than nominal type
2425 and both extend in the same manner, compare them
2426 in the type of the wider arg.
2427 Otherwise must actually extend both to the nominal
2428 common type lest different ways of extending
2430 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2432 else if (unsignedp0 == unsignedp1 && real1 == real2
2433 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2434 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2436 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2437 type = c_common_signed_or_unsigned_type (unsignedp0
2438 || TYPE_UNSIGNED (*restype_ptr),
2440 /* Make sure shorter operand is extended the right way
2441 to match the longer operand. */
2443 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2444 TREE_TYPE (primop0)),
2447 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2448 TREE_TYPE (primop1)),
2453 /* Here we must do the comparison on the nominal type
2454 using the args exactly as we received them. */
2455 type = *restype_ptr;
2459 if (!real1 && !real2 && integer_zerop (primop1)
2460 && TYPE_UNSIGNED (*restype_ptr))
2466 /* All unsigned values are >= 0, so we warn if extra warnings
2467 are requested. However, if OP0 is a constant that is
2468 >= 0, the signedness of the comparison isn't an issue,
2469 so suppress the warning. */
2470 if (extra_warnings && !in_system_header
2471 && !(TREE_CODE (primop0) == INTEGER_CST
2472 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2474 warning (0, "comparison of unsigned expression >= 0 is always true");
2475 value = truthvalue_true_node;
2479 if (extra_warnings && !in_system_header
2480 && !(TREE_CODE (primop0) == INTEGER_CST
2481 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2483 warning (0, "comparison of unsigned expression < 0 is always false");
2484 value = truthvalue_false_node;
2493 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2494 if (TREE_SIDE_EFFECTS (primop0))
2495 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2502 *op0_ptr = convert (type, primop0);
2503 *op1_ptr = convert (type, primop1);
2505 *restype_ptr = truthvalue_type_node;
2510 /* Return a tree for the sum or difference (RESULTCODE says which)
2511 of pointer PTROP and integer INTOP. */
2514 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2518 /* The result is a pointer of the same type that is being added. */
2520 tree result_type = TREE_TYPE (ptrop);
2522 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2524 if (pedantic || warn_pointer_arith)
2525 pedwarn ("pointer of type %<void *%> used in arithmetic");
2526 size_exp = integer_one_node;
2528 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2530 if (pedantic || warn_pointer_arith)
2531 pedwarn ("pointer to a function used in arithmetic");
2532 size_exp = integer_one_node;
2534 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2536 if (pedantic || warn_pointer_arith)
2537 pedwarn ("pointer to member function used in arithmetic");
2538 size_exp = integer_one_node;
2541 size_exp = size_in_bytes (TREE_TYPE (result_type));
2543 /* If what we are about to multiply by the size of the elements
2544 contains a constant term, apply distributive law
2545 and multiply that constant term separately.
2546 This helps produce common subexpressions. */
2548 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2549 && !TREE_CONSTANT (intop)
2550 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2551 && TREE_CONSTANT (size_exp)
2552 /* If the constant comes from pointer subtraction,
2553 skip this optimization--it would cause an error. */
2554 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2555 /* If the constant is unsigned, and smaller than the pointer size,
2556 then we must skip this optimization. This is because it could cause
2557 an overflow error if the constant is negative but INTOP is not. */
2558 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2559 || (TYPE_PRECISION (TREE_TYPE (intop))
2560 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2562 enum tree_code subcode = resultcode;
2563 tree int_type = TREE_TYPE (intop);
2564 if (TREE_CODE (intop) == MINUS_EXPR)
2565 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2566 /* Convert both subexpression types to the type of intop,
2567 because weird cases involving pointer arithmetic
2568 can result in a sum or difference with different type args. */
2569 ptrop = build_binary_op (subcode, ptrop,
2570 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2571 intop = convert (int_type, TREE_OPERAND (intop, 0));
2574 /* Convert the integer argument to a type the same size as sizetype
2575 so the multiply won't overflow spuriously. */
2577 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2578 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2579 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2580 TYPE_UNSIGNED (sizetype)), intop);
2582 /* Replace the integer argument with a suitable product by the object size.
2583 Do this multiplication as signed, then convert to the appropriate
2584 pointer type (actually unsigned integral). */
2586 intop = convert (result_type,
2587 build_binary_op (MULT_EXPR, intop,
2588 convert (TREE_TYPE (intop), size_exp), 1));
2590 /* Create the sum or difference. */
2591 return fold_build2 (resultcode, result_type, ptrop, intop);
2594 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2595 or for an `if' or `while' statement or ?..: exp. It should already
2596 have been validated to be of suitable type; otherwise, a bad
2597 diagnostic may result.
2599 This preparation consists of taking the ordinary
2600 representation of an expression expr and producing a valid tree
2601 boolean expression describing whether expr is nonzero. We could
2602 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2603 but we optimize comparisons, &&, ||, and !.
2605 The resulting type should always be `truthvalue_type_node'. */
2608 c_common_truthvalue_conversion (tree expr)
2610 switch (TREE_CODE (expr))
2612 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2613 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2614 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2615 case ORDERED_EXPR: case UNORDERED_EXPR:
2616 if (TREE_TYPE (expr) == truthvalue_type_node)
2618 return build2 (TREE_CODE (expr), truthvalue_type_node,
2619 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2621 case TRUTH_ANDIF_EXPR:
2622 case TRUTH_ORIF_EXPR:
2623 case TRUTH_AND_EXPR:
2625 case TRUTH_XOR_EXPR:
2626 if (TREE_TYPE (expr) == truthvalue_type_node)
2628 return build2 (TREE_CODE (expr), truthvalue_type_node,
2629 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2630 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)));
2632 case TRUTH_NOT_EXPR:
2633 if (TREE_TYPE (expr) == truthvalue_type_node)
2635 return build1 (TREE_CODE (expr), truthvalue_type_node,
2636 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2642 /* Avoid integer_zerop to ignore TREE_CONSTANT_OVERFLOW. */
2643 return (TREE_INT_CST_LOW (expr) != 0 || TREE_INT_CST_HIGH (expr) != 0)
2644 ? truthvalue_true_node
2645 : truthvalue_false_node;
2648 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
2649 ? truthvalue_true_node
2650 : truthvalue_false_node;
2653 expr = build_unary_op (ADDR_EXPR, expr, 0);
2658 tree inner = TREE_OPERAND (expr, 0);
2660 && (TREE_CODE (inner) == PARM_DECL
2661 || TREE_CODE (inner) == LABEL_DECL
2662 || !DECL_WEAK (inner)))
2664 /* Common Ada/Pascal programmer's mistake. We always warn
2665 about this since it is so bad. */
2666 warning (OPT_Walways_true, "the address of %qD will always evaluate as %<true%>",
2668 return truthvalue_true_node;
2671 /* If we are taking the address of an external decl, it might be
2672 zero if it is weak, so we cannot optimize. */
2674 && DECL_EXTERNAL (inner))
2677 if (TREE_SIDE_EFFECTS (inner))
2678 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2679 inner, truthvalue_true_node);
2681 return truthvalue_true_node;
2685 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2686 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2687 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2688 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2694 /* These don't change whether an object is nonzero or zero. */
2695 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2699 /* These don't change whether an object is zero or nonzero, but
2700 we can't ignore them if their second arg has side-effects. */
2701 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2702 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2703 TREE_OPERAND (expr, 1),
2704 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2706 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2709 /* Distribute the conversion into the arms of a COND_EXPR. */
2710 return fold_build3 (COND_EXPR, truthvalue_type_node,
2711 TREE_OPERAND (expr, 0),
2712 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2713 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2)));
2717 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2718 since that affects how `default_conversion' will behave. */
2719 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2720 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2722 /* If this is widening the argument, we can ignore it. */
2723 if (TYPE_PRECISION (TREE_TYPE (expr))
2724 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2725 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2729 if (!TREE_NO_WARNING (expr))
2730 warning (OPT_Wparentheses,
2731 "suggest parentheses around assignment used as truth value");
2738 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2740 tree t = save_expr (expr);
2741 return (build_binary_op
2742 ((TREE_SIDE_EFFECTS (expr)
2743 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2744 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2745 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2749 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2752 static void def_builtin_1 (enum built_in_function fncode,
2754 enum built_in_class fnclass,
2755 tree fntype, tree libtype,
2756 bool both_p, bool fallback_p, bool nonansi_p,
2757 tree fnattrs, bool implicit_p);
2759 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2760 down to the element type of an array. */
2763 c_build_qualified_type (tree type, int type_quals)
2765 if (type == error_mark_node)
2768 if (TREE_CODE (type) == ARRAY_TYPE)
2771 tree element_type = c_build_qualified_type (TREE_TYPE (type),
2774 /* See if we already have an identically qualified type. */
2775 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2777 if (TYPE_QUALS (strip_array_types (t)) == type_quals
2778 && TYPE_NAME (t) == TYPE_NAME (type)
2779 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
2780 && attribute_list_equal (TYPE_ATTRIBUTES (t),
2781 TYPE_ATTRIBUTES (type)))
2786 t = build_variant_type_copy (type);
2787 TREE_TYPE (t) = element_type;
2792 /* A restrict-qualified pointer type must be a pointer to object or
2793 incomplete type. Note that the use of POINTER_TYPE_P also allows
2794 REFERENCE_TYPEs, which is appropriate for C++. */
2795 if ((type_quals & TYPE_QUAL_RESTRICT)
2796 && (!POINTER_TYPE_P (type)
2797 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2799 error ("invalid use of %<restrict%>");
2800 type_quals &= ~TYPE_QUAL_RESTRICT;
2803 return build_qualified_type (type, type_quals);
2806 /* Apply the TYPE_QUALS to the new DECL. */
2809 c_apply_type_quals_to_decl (int type_quals, tree decl)
2811 tree type = TREE_TYPE (decl);
2813 if (type == error_mark_node)
2816 if (((type_quals & TYPE_QUAL_CONST)
2817 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2818 /* An object declared 'const' is only readonly after it is
2819 initialized. We don't have any way of expressing this currently,
2820 so we need to be conservative and unset TREE_READONLY for types
2821 with constructors. Otherwise aliasing code will ignore stores in
2822 an inline constructor. */
2823 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2824 TREE_READONLY (decl) = 1;
2825 if (type_quals & TYPE_QUAL_VOLATILE)
2827 TREE_SIDE_EFFECTS (decl) = 1;
2828 TREE_THIS_VOLATILE (decl) = 1;
2830 if (type_quals & TYPE_QUAL_RESTRICT)
2832 while (type && TREE_CODE (type) == ARRAY_TYPE)
2833 /* Allow 'restrict' on arrays of pointers.
2834 FIXME currently we just ignore it. */
2835 type = TREE_TYPE (type);
2837 || !POINTER_TYPE_P (type)
2838 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2839 error ("invalid use of %<restrict%>");
2840 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2841 /* Indicate we need to make a unique alias set for this pointer.
2842 We can't do it here because it might be pointing to an
2844 DECL_POINTER_ALIAS_SET (decl) = -2;
2848 /* Hash function for the problem of multiple type definitions in
2849 different files. This must hash all types that will compare
2850 equal via comptypes to the same value. In practice it hashes
2851 on some of the simple stuff and leaves the details to comptypes. */
2854 c_type_hash (const void *p)
2860 switch (TREE_CODE (t))
2862 /* For pointers, hash on pointee type plus some swizzling. */
2864 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2865 /* Hash on number of elements and total size. */
2868 t2 = TYPE_VALUES (t);
2872 t2 = TYPE_FIELDS (t);
2874 case QUAL_UNION_TYPE:
2876 t2 = TYPE_FIELDS (t);
2880 t2 = TYPE_FIELDS (t);
2885 for (; t2; t2 = TREE_CHAIN (t2))
2887 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2888 return ((size << 24) | (i << shift));
2891 static GTY((param_is (union tree_node))) htab_t type_hash_table;
2893 /* Return the typed-based alias set for T, which may be an expression
2894 or a type. Return -1 if we don't do anything special. */
2897 c_common_get_alias_set (tree t)
2902 /* Permit type-punning when accessing a union, provided the access
2903 is directly through the union. For example, this code does not
2904 permit taking the address of a union member and then storing
2905 through it. Even the type-punning allowed here is a GCC
2906 extension, albeit a common and useful one; the C standard says
2907 that such accesses have implementation-defined behavior. */
2909 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2910 u = TREE_OPERAND (u, 0))
2911 if (TREE_CODE (u) == COMPONENT_REF
2912 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2915 /* That's all the expressions we handle specially. */
2919 /* The C standard guarantees that any object may be accessed via an
2920 lvalue that has character type. */
2921 if (t == char_type_node
2922 || t == signed_char_type_node
2923 || t == unsigned_char_type_node)
2926 /* If it has the may_alias attribute, it can alias anything. */
2927 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2930 /* The C standard specifically allows aliasing between signed and
2931 unsigned variants of the same type. We treat the signed
2932 variant as canonical. */
2933 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2935 tree t1 = c_common_signed_type (t);
2937 /* t1 == t can happen for boolean nodes which are always unsigned. */
2939 return get_alias_set (t1);
2941 else if (POINTER_TYPE_P (t))
2945 /* Unfortunately, there is no canonical form of a pointer type.
2946 In particular, if we have `typedef int I', then `int *', and
2947 `I *' are different types. So, we have to pick a canonical
2948 representative. We do this below.
2950 Technically, this approach is actually more conservative that
2951 it needs to be. In particular, `const int *' and `int *'
2952 should be in different alias sets, according to the C and C++
2953 standard, since their types are not the same, and so,
2954 technically, an `int **' and `const int **' cannot point at
2957 But, the standard is wrong. In particular, this code is
2962 const int* const* cipp = ipp;
2964 And, it doesn't make sense for that to be legal unless you
2965 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2966 the pointed-to types. This issue has been reported to the
2968 t1 = build_type_no_quals (t);
2970 return get_alias_set (t1);
2973 /* Handle the case of multiple type nodes referring to "the same" type,
2974 which occurs with IMA. These share an alias set. FIXME: Currently only
2975 C90 is handled. (In C99 type compatibility is not transitive, which
2976 complicates things mightily. The alias set splay trees can theoretically
2977 represent this, but insertion is tricky when you consider all the
2978 different orders things might arrive in.) */
2980 if (c_language != clk_c || flag_isoc99)
2983 /* Save time if there's only one input file. */
2984 if (num_in_fnames == 1)
2987 /* Pointers need special handling if they point to any type that
2988 needs special handling (below). */
2989 if (TREE_CODE (t) == POINTER_TYPE)
2992 /* Find bottom type under any nested POINTERs. */
2993 for (t2 = TREE_TYPE (t);
2994 TREE_CODE (t2) == POINTER_TYPE;
2995 t2 = TREE_TYPE (t2))
2997 if (TREE_CODE (t2) != RECORD_TYPE
2998 && TREE_CODE (t2) != ENUMERAL_TYPE
2999 && TREE_CODE (t2) != QUAL_UNION_TYPE
3000 && TREE_CODE (t2) != UNION_TYPE)
3002 if (TYPE_SIZE (t2) == 0)
3005 /* These are the only cases that need special handling. */
3006 if (TREE_CODE (t) != RECORD_TYPE
3007 && TREE_CODE (t) != ENUMERAL_TYPE
3008 && TREE_CODE (t) != QUAL_UNION_TYPE
3009 && TREE_CODE (t) != UNION_TYPE
3010 && TREE_CODE (t) != POINTER_TYPE)
3013 if (TYPE_SIZE (t) == 0)
3016 /* Look up t in hash table. Only one of the compatible types within each
3017 alias set is recorded in the table. */
3018 if (!type_hash_table)
3019 type_hash_table = htab_create_ggc (1021, c_type_hash,
3020 (htab_eq) lang_hooks.types_compatible_p,
3022 slot = htab_find_slot (type_hash_table, t, INSERT);
3025 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
3026 return TYPE_ALIAS_SET ((tree)*slot);
3029 /* Our caller will assign and record (in t) a new alias set; all we need
3030 to do is remember t in the hash table. */
3036 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3037 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3038 flag controls whether we should diagnose possibly ill-formed
3039 constructs or not. */
3042 c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain)
3044 const char *op_name;
3046 enum tree_code type_code = TREE_CODE (type);
3048 op_name = is_sizeof ? "sizeof" : "__alignof__";
3050 if (type_code == FUNCTION_TYPE)
3054 if (complain && (pedantic || warn_pointer_arith))
3055 pedwarn ("invalid application of %<sizeof%> to a function type");
3056 value = size_one_node;
3059 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
3061 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
3063 if (type_code == VOID_TYPE
3064 && complain && (pedantic || warn_pointer_arith))
3065 pedwarn ("invalid application of %qs to a void type", op_name);
3066 value = size_one_node;
3068 else if (!COMPLETE_TYPE_P (type))
3071 error ("invalid application of %qs to incomplete type %qT ",
3073 value = size_zero_node;
3078 /* Convert in case a char is more than one unit. */
3079 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
3080 size_int (TYPE_PRECISION (char_type_node)
3083 value = size_int (TYPE_ALIGN_UNIT (type));
3086 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3087 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3088 never happen. However, this node should really have type
3089 `size_t', which is just a typedef for an ordinary integer type. */
3090 value = fold_convert (size_type_node, value);
3091 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
3096 /* Implement the __alignof keyword: Return the minimum required
3097 alignment of EXPR, measured in bytes. For VAR_DECL's and
3098 FIELD_DECL's return DECL_ALIGN (which can be set from an
3099 "aligned" __attribute__ specification). */
3102 c_alignof_expr (tree expr)
3106 if (TREE_CODE (expr) == VAR_DECL)
3107 t = size_int (DECL_ALIGN_UNIT (expr));
3109 else if (TREE_CODE (expr) == COMPONENT_REF
3110 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
3112 error ("%<__alignof%> applied to a bit-field");
3115 else if (TREE_CODE (expr) == COMPONENT_REF
3116 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
3117 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
3119 else if (TREE_CODE (expr) == INDIRECT_REF)
3121 tree t = TREE_OPERAND (expr, 0);
3123 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3125 while ((TREE_CODE (t) == NOP_EXPR || TREE_CODE (t) == CONVERT_EXPR)
3126 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
3130 t = TREE_OPERAND (t, 0);
3131 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
3132 if (thisalign > bestalign)
3133 best = t, bestalign = thisalign;
3135 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
3138 return c_alignof (TREE_TYPE (expr));
3140 return fold_convert (size_type_node, t);
3143 /* Handle C and C++ default attributes. */
3145 enum built_in_attribute
3147 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3148 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3149 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3150 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3151 #include "builtin-attrs.def"
3152 #undef DEF_ATTR_NULL_TREE
3154 #undef DEF_ATTR_IDENT
3155 #undef DEF_ATTR_TREE_LIST
3159 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
3161 static void c_init_attributes (void);
3165 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3166 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3167 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3168 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3169 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3170 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3171 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3172 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3173 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3174 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3175 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3176 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3177 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3178 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3179 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3181 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3182 #include "builtin-types.def"
3183 #undef DEF_PRIMITIVE_TYPE
3184 #undef DEF_FUNCTION_TYPE_0
3185 #undef DEF_FUNCTION_TYPE_1
3186 #undef DEF_FUNCTION_TYPE_2
3187 #undef DEF_FUNCTION_TYPE_3
3188 #undef DEF_FUNCTION_TYPE_4
3189 #undef DEF_FUNCTION_TYPE_5
3190 #undef DEF_FUNCTION_TYPE_6
3191 #undef DEF_FUNCTION_TYPE_7
3192 #undef DEF_FUNCTION_TYPE_VAR_0
3193 #undef DEF_FUNCTION_TYPE_VAR_1
3194 #undef DEF_FUNCTION_TYPE_VAR_2
3195 #undef DEF_FUNCTION_TYPE_VAR_3
3196 #undef DEF_FUNCTION_TYPE_VAR_4
3197 #undef DEF_FUNCTION_TYPE_VAR_5
3198 #undef DEF_POINTER_TYPE
3202 typedef enum c_builtin_type builtin_type;
3204 /* A temporary array for c_common_nodes_and_builtins. Used in
3205 communication with def_fn_type. */
3206 static tree builtin_types[(int) BT_LAST + 1];
3208 /* A helper function for c_common_nodes_and_builtins. Build function type
3209 for DEF with return type RET and N arguments. If VAR is true, then the
3210 function should be variadic after those N arguments.
3212 Takes special care not to ICE if any of the types involved are
3213 error_mark_node, which indicates that said type is not in fact available
3214 (see builtin_type_for_size). In which case the function type as a whole
3215 should be error_mark_node. */
3218 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
3220 tree args = NULL, t;
3225 for (i = 0; i < n; ++i)
3227 builtin_type a = va_arg (list, builtin_type);
3228 t = builtin_types[a];
3229 if (t == error_mark_node)
3231 args = tree_cons (NULL_TREE, t, args);
3235 args = nreverse (args);
3237 args = chainon (args, void_list_node);
3239 t = builtin_types[ret];
3240 if (t == error_mark_node)
3242 t = build_function_type (t, args);
3245 builtin_types[def] = t;
3248 /* Build builtin functions common to both C and C++ language
3252 c_define_builtins (tree va_list_ref_type_node, tree va_list_arg_type_node)
3254 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3255 builtin_types[ENUM] = VALUE;
3256 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3257 def_fn_type (ENUM, RETURN, 0, 0);
3258 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3259 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3260 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3261 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3262 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3263 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3264 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3265 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3266 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3267 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3268 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3270 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3271 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3273 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3274 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3275 def_fn_type (ENUM, RETURN, 1, 0);
3276 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3277 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3278 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3279 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3280 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3281 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3282 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3283 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3284 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3285 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3286 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3287 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3289 #include "builtin-types.def"
3291 #undef DEF_PRIMITIVE_TYPE
3292 #undef DEF_FUNCTION_TYPE_1
3293 #undef DEF_FUNCTION_TYPE_2
3294 #undef DEF_FUNCTION_TYPE_3
3295 #undef DEF_FUNCTION_TYPE_4
3296 #undef DEF_FUNCTION_TYPE_5
3297 #undef DEF_FUNCTION_TYPE_6
3298 #undef DEF_FUNCTION_TYPE_VAR_0
3299 #undef DEF_FUNCTION_TYPE_VAR_1
3300 #undef DEF_FUNCTION_TYPE_VAR_2
3301 #undef DEF_FUNCTION_TYPE_VAR_3
3302 #undef DEF_FUNCTION_TYPE_VAR_4
3303 #undef DEF_FUNCTION_TYPE_VAR_5
3304 #undef DEF_POINTER_TYPE
3305 builtin_types[(int) BT_LAST] = NULL_TREE;
3307 c_init_attributes ();
3309 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3310 NONANSI_P, ATTRS, IMPLICIT, COND) \
3312 def_builtin_1 (ENUM, NAME, CLASS, \
3313 builtin_types[(int) TYPE], \
3314 builtin_types[(int) LIBTYPE], \
3315 BOTH_P, FALLBACK_P, NONANSI_P, \
3316 built_in_attributes[(int) ATTRS], IMPLICIT);
3317 #include "builtins.def"
3320 build_common_builtin_nodes ();
3322 targetm.init_builtins ();
3327 /* Build tree nodes and builtin functions common to both C and C++ language
3331 c_common_nodes_and_builtins (void)
3333 int wchar_type_size;
3334 tree array_domain_type;
3335 tree va_list_ref_type_node;
3336 tree va_list_arg_type_node;
3338 /* Define `int' and `char' first so that dbx will output them first. */
3339 record_builtin_type (RID_INT, NULL, integer_type_node);
3340 record_builtin_type (RID_CHAR, "char", char_type_node);
3342 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3343 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3344 but not C. Are the conditionals here needed? */
3345 if (c_dialect_cxx ())
3346 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3347 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3348 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3349 record_builtin_type (RID_MAX, "long unsigned int",
3350 long_unsigned_type_node);
3351 if (c_dialect_cxx ())
3352 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3353 record_builtin_type (RID_MAX, "long long int",
3354 long_long_integer_type_node);
3355 record_builtin_type (RID_MAX, "long long unsigned int",
3356 long_long_unsigned_type_node);
3357 if (c_dialect_cxx ())
3358 record_builtin_type (RID_MAX, "long long unsigned",
3359 long_long_unsigned_type_node);
3360 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3361 record_builtin_type (RID_MAX, "short unsigned int",
3362 short_unsigned_type_node);
3363 if (c_dialect_cxx ())
3364 record_builtin_type (RID_MAX, "unsigned short",
3365 short_unsigned_type_node);
3367 /* Define both `signed char' and `unsigned char'. */
3368 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3369 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3371 /* These are types that c_common_type_for_size and
3372 c_common_type_for_mode use. */
3373 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3375 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3377 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3379 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3381 #if HOST_BITS_PER_WIDE_INT >= 64
3382 if (targetm.scalar_mode_supported_p (TImode))
3383 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3384 get_identifier ("__int128_t"),
3387 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3388 unsigned_intQI_type_node));
3389 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3390 unsigned_intHI_type_node));
3391 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3392 unsigned_intSI_type_node));
3393 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3394 unsigned_intDI_type_node));
3395 #if HOST_BITS_PER_WIDE_INT >= 64
3396 if (targetm.scalar_mode_supported_p (TImode))
3397 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3398 get_identifier ("__uint128_t"),
3399 unsigned_intTI_type_node));
3402 /* Create the widest literal types. */
3403 widest_integer_literal_type_node
3404 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3405 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3406 widest_integer_literal_type_node));
3408 widest_unsigned_literal_type_node
3409 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3410 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3411 widest_unsigned_literal_type_node));
3413 /* `unsigned long' is the standard type for sizeof.
3414 Note that stddef.h uses `unsigned long',
3415 and this must agree, even if long and int are the same size. */
3417 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3418 signed_size_type_node = c_common_signed_type (size_type_node);
3419 set_sizetype (size_type_node);
3422 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3424 build_common_tree_nodes_2 (flag_short_double);
3426 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3427 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3428 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3430 /* Only supported decimal floating point extension if the target
3431 actually supports underlying modes. */
3432 if (targetm.scalar_mode_supported_p (SDmode)
3433 && targetm.scalar_mode_supported_p (DDmode)
3434 && targetm.scalar_mode_supported_p (TDmode))
3436 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
3437 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
3438 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
3441 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3442 get_identifier ("complex int"),
3443 complex_integer_type_node));
3444 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3445 get_identifier ("complex float"),
3446 complex_float_type_node));
3447 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3448 get_identifier ("complex double"),
3449 complex_double_type_node));
3450 lang_hooks.decls.pushdecl
3451 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3452 complex_long_double_type_node));
3454 if (c_dialect_cxx ())
3455 /* For C++, make fileptr_type_node a distinct void * type until
3456 FILE type is defined. */
3457 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3459 record_builtin_type (RID_VOID, NULL, void_type_node);
3461 /* Set the TYPE_NAME for any variants that were built before
3462 record_builtin_type gave names to the built-in types. */
3464 tree void_name = TYPE_NAME (void_type_node);
3465 TYPE_NAME (void_type_node) = NULL_TREE;
3466 TYPE_NAME (build_qualified_type (void_type_node, TYPE_QUAL_CONST))
3468 TYPE_NAME (void_type_node) = void_name;
3471 /* This node must not be shared. */
3472 void_zero_node = make_node (INTEGER_CST);
3473 TREE_TYPE (void_zero_node) = void_type_node;
3475 void_list_node = build_void_list_node ();
3477 /* Make a type to be the domain of a few array types
3478 whose domains don't really matter.
3479 200 is small enough that it always fits in size_t
3480 and large enough that it can hold most function names for the
3481 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3482 array_domain_type = build_index_type (size_int (200));
3484 /* Make a type for arrays of characters.
3485 With luck nothing will ever really depend on the length of this
3487 char_array_type_node
3488 = build_array_type (char_type_node, array_domain_type);
3490 /* Likewise for arrays of ints. */
3492 = build_array_type (integer_type_node, array_domain_type);
3494 string_type_node = build_pointer_type (char_type_node);
3495 const_string_type_node
3496 = build_pointer_type (build_qualified_type
3497 (char_type_node, TYPE_QUAL_CONST));
3499 /* This is special for C++ so functions can be overloaded. */
3500 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3501 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3502 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3503 if (c_dialect_cxx ())
3505 if (TYPE_UNSIGNED (wchar_type_node))
3506 wchar_type_node = make_unsigned_type (wchar_type_size);
3508 wchar_type_node = make_signed_type (wchar_type_size);
3509 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3513 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3514 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3517 /* This is for wide string constants. */
3518 wchar_array_type_node
3519 = build_array_type (wchar_type_node, array_domain_type);
3522 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3525 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3527 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3529 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3531 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3532 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3534 lang_hooks.decls.pushdecl
3535 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3536 va_list_type_node));
3538 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3540 va_list_arg_type_node = va_list_ref_type_node =
3541 build_pointer_type (TREE_TYPE (va_list_type_node));
3545 va_list_arg_type_node = va_list_type_node;
3546 va_list_ref_type_node = build_reference_type (va_list_type_node);
3549 if (!flag_preprocess_only)
3550 c_define_builtins (va_list_ref_type_node, va_list_arg_type_node);
3552 main_identifier_node = get_identifier ("main");
3554 /* Create the built-in __null node. It is important that this is
3556 null_node = make_node (INTEGER_CST);
3557 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
3559 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3560 memset (builtin_types, 0, sizeof (builtin_types));
3563 /* Look up the function in built_in_decls that corresponds to DECL
3564 and set ASMSPEC as its user assembler name. DECL must be a
3565 function decl that declares a builtin. */
3568 set_builtin_user_assembler_name (tree decl, const char *asmspec)
3571 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
3572 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
3575 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
3576 set_user_assembler_name (builtin, asmspec);
3577 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
3578 init_block_move_fn (asmspec);
3579 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
3580 init_block_clear_fn (asmspec);
3583 /* The number of named compound-literals generated thus far. */
3584 static GTY(()) int compound_literal_number;
3586 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3589 set_compound_literal_name (tree decl)
3592 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
3593 compound_literal_number);
3594 compound_literal_number++;
3595 DECL_NAME (decl) = get_identifier (name);
3599 build_va_arg (tree expr, tree type)
3601 return build1 (VA_ARG_EXPR, type, expr);
3605 /* Linked list of disabled built-in functions. */
3607 typedef struct disabled_builtin
3610 struct disabled_builtin *next;
3612 static disabled_builtin *disabled_builtins = NULL;
3614 static bool builtin_function_disabled_p (const char *);
3616 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3617 begins with "__builtin_", give an error. */
3620 disable_builtin_function (const char *name)
3622 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3623 error ("cannot disable built-in function %qs", name);
3626 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3627 new_disabled_builtin->name = name;
3628 new_disabled_builtin->next = disabled_builtins;
3629 disabled_builtins = new_disabled_builtin;
3634 /* Return true if the built-in function NAME has been disabled, false
3638 builtin_function_disabled_p (const char *name)
3640 disabled_builtin *p;
3641 for (p = disabled_builtins; p != NULL; p = p->next)
3643 if (strcmp (name, p->name) == 0)
3650 /* Worker for DEF_BUILTIN.
3651 Possibly define a builtin function with one or two names.
3652 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3653 nonansi_p and flag_no_nonansi_builtin. */
3656 def_builtin_1 (enum built_in_function fncode,
3658 enum built_in_class fnclass,
3659 tree fntype, tree libtype,
3660 bool both_p, bool fallback_p, bool nonansi_p,
3661 tree fnattrs, bool implicit_p)
3664 const char *libname;
3666 if (fntype == error_mark_node)
3669 gcc_assert ((!both_p && !fallback_p)
3670 || !strncmp (name, "__builtin_",
3671 strlen ("__builtin_")));
3673 libname = name + strlen ("__builtin_");
3674 decl = add_builtin_function (name, fntype, fncode, fnclass,
3675 (fallback_p ? libname : NULL),
3678 && !flag_no_builtin && !builtin_function_disabled_p (libname)
3679 && !(nonansi_p && flag_no_nonansi_builtin))
3680 add_builtin_function (libname, libtype, fncode, fnclass,
3683 built_in_decls[(int) fncode] = decl;
3685 implicit_built_in_decls[(int) fncode] = decl;
3688 /* Nonzero if the type T promotes to int. This is (nearly) the
3689 integral promotions defined in ISO C99 6.3.1.1/2. */
3692 c_promoting_integer_type_p (tree t)
3694 switch (TREE_CODE (t))
3697 return (TYPE_MAIN_VARIANT (t) == char_type_node
3698 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3699 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3700 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3701 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3702 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3705 /* ??? Technically all enumerations not larger than an int
3706 promote to an int. But this is used along code paths
3707 that only want to notice a size change. */
3708 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3718 /* Return 1 if PARMS specifies a fixed number of parameters
3719 and none of their types is affected by default promotions. */
3722 self_promoting_args_p (tree parms)
3725 for (t = parms; t; t = TREE_CHAIN (t))
3727 tree type = TREE_VALUE (t);
3729 if (type == error_mark_node)
3732 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3738 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3741 if (c_promoting_integer_type_p (type))
3747 /* Recursively examines the array elements of TYPE, until a non-array
3748 element type is found. */
3751 strip_array_types (tree type)
3753 while (TREE_CODE (type) == ARRAY_TYPE)
3754 type = TREE_TYPE (type);
3759 /* Recursively remove any '*' or '&' operator from TYPE. */
3761 strip_pointer_operator (tree t)
3763 while (POINTER_TYPE_P (t))
3768 /* Used to compare case labels. K1 and K2 are actually tree nodes
3769 representing case labels, or NULL_TREE for a `default' label.
3770 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3771 K2, and 0 if K1 and K2 are equal. */
3774 case_compare (splay_tree_key k1, splay_tree_key k2)
3776 /* Consider a NULL key (such as arises with a `default' label) to be
3777 smaller than anything else. */
3783 return tree_int_cst_compare ((tree) k1, (tree) k2);
3786 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3787 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3788 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3789 case label was declared using the usual C/C++ syntax, rather than
3790 the GNU case range extension. CASES is a tree containing all the
3791 case ranges processed so far; COND is the condition for the
3792 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3793 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3796 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3797 tree low_value, tree high_value)
3802 splay_tree_node node;
3804 /* Create the LABEL_DECL itself. */
3805 label = create_artificial_label ();
3807 /* If there was an error processing the switch condition, bail now
3808 before we get more confused. */
3809 if (!cond || cond == error_mark_node)
3812 if ((low_value && TREE_TYPE (low_value)
3813 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3814 || (high_value && TREE_TYPE (high_value)
3815 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3817 error ("pointers are not permitted as case values");
3821 /* Case ranges are a GNU extension. */
3822 if (high_value && pedantic)
3823 pedwarn ("range expressions in switch statements are non-standard");
3825 type = TREE_TYPE (cond);
3828 low_value = check_case_value (low_value);
3829 low_value = convert_and_check (type, low_value);
3830 if (low_value == error_mark_node)
3835 high_value = check_case_value (high_value);
3836 high_value = convert_and_check (type, high_value);
3837 if (high_value == error_mark_node)
3841 if (low_value && high_value)
3843 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3844 really a case range, even though it was written that way.
3845 Remove the HIGH_VALUE to simplify later processing. */
3846 if (tree_int_cst_equal (low_value, high_value))
3847 high_value = NULL_TREE;
3848 else if (!tree_int_cst_lt (low_value, high_value))
3849 warning (0, "empty range specified");
3852 /* See if the case is in range of the type of the original testing
3853 expression. If both low_value and high_value are out of range,
3854 don't insert the case label and return NULL_TREE. */
3856 && !check_case_bounds (type, orig_type,
3857 &low_value, high_value ? &high_value : NULL))
3860 /* Look up the LOW_VALUE in the table of case labels we already
3862 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3863 /* If there was not an exact match, check for overlapping ranges.
3864 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3865 that's a `default' label and the only overlap is an exact match. */
3866 if (!node && (low_value || high_value))
3868 splay_tree_node low_bound;
3869 splay_tree_node high_bound;
3871 /* Even though there wasn't an exact match, there might be an
3872 overlap between this case range and another case range.
3873 Since we've (inductively) not allowed any overlapping case
3874 ranges, we simply need to find the greatest low case label
3875 that is smaller that LOW_VALUE, and the smallest low case
3876 label that is greater than LOW_VALUE. If there is an overlap
3877 it will occur in one of these two ranges. */
3878 low_bound = splay_tree_predecessor (cases,
3879 (splay_tree_key) low_value);
3880 high_bound = splay_tree_successor (cases,
3881 (splay_tree_key) low_value);
3883 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3884 the LOW_VALUE, so there is no need to check unless the
3885 LOW_BOUND is in fact itself a case range. */
3887 && CASE_HIGH ((tree) low_bound->value)
3888 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3891 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3892 range is bigger than the low end of the current range, so we
3893 are only interested if the current range is a real range, and
3894 not an ordinary case label. */
3897 && (tree_int_cst_compare ((tree) high_bound->key,
3902 /* If there was an overlap, issue an error. */
3905 tree duplicate = CASE_LABEL ((tree) node->value);
3909 error ("duplicate (or overlapping) case value");
3910 error ("%Jthis is the first entry overlapping that value", duplicate);
3914 error ("duplicate case value") ;
3915 error ("%Jpreviously used here", duplicate);
3919 error ("multiple default labels in one switch");
3920 error ("%Jthis is the first default label", duplicate);
3925 /* Add a CASE_LABEL to the statement-tree. */
3926 case_label = add_stmt (build_case_label (low_value, high_value, label));
3927 /* Register this case label in the splay tree. */
3928 splay_tree_insert (cases,
3929 (splay_tree_key) low_value,
3930 (splay_tree_value) case_label);
3935 /* Add a label so that the back-end doesn't think that the beginning of
3936 the switch is unreachable. Note that we do not add a case label, as
3937 that just leads to duplicates and thence to failure later on. */
3940 tree t = create_artificial_label ();
3941 add_stmt (build_stmt (LABEL_EXPR, t));
3943 return error_mark_node;
3946 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3947 Used to verify that case values match up with enumerator values. */
3950 match_case_to_enum_1 (tree key, tree type, tree label)
3952 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3954 /* ??? Not working too hard to print the double-word value.
3955 Should perhaps be done with %lwd in the diagnostic routines? */
3956 if (TREE_INT_CST_HIGH (key) == 0)
3957 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3958 TREE_INT_CST_LOW (key));
3959 else if (!TYPE_UNSIGNED (type)
3960 && TREE_INT_CST_HIGH (key) == -1
3961 && TREE_INT_CST_LOW (key) != 0)
3962 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3963 -TREE_INT_CST_LOW (key));
3965 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3966 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3968 if (TYPE_NAME (type) == 0)
3969 warning (0, "%Jcase value %qs not in enumerated type",
3970 CASE_LABEL (label), buf);
3972 warning (0, "%Jcase value %qs not in enumerated type %qT",
3973 CASE_LABEL (label), buf, type);
3976 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
3977 Used to verify that case values match up with enumerator values. */
3980 match_case_to_enum (splay_tree_node node, void *data)
3982 tree label = (tree) node->value;
3983 tree type = (tree) data;
3985 /* Skip default case. */
3986 if (!CASE_LOW (label))
3989 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
3990 when we did our enum->case scan. Reset our scratch bit after. */
3991 if (!CASE_LOW_SEEN (label))
3992 match_case_to_enum_1 (CASE_LOW (label), type, label);
3994 CASE_LOW_SEEN (label) = 0;
3996 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
3997 not set, that means that CASE_HIGH did not appear when we did our
3998 enum->case scan. Reset our scratch bit after. */
3999 if (CASE_HIGH (label))
4001 if (!CASE_HIGH_SEEN (label))
4002 match_case_to_enum_1 (CASE_HIGH (label), type, label);
4004 CASE_HIGH_SEEN (label) = 0;
4010 /* Handle -Wswitch*. Called from the front end after parsing the
4011 switch construct. */
4012 /* ??? Should probably be somewhere generic, since other languages
4013 besides C and C++ would want this. At the moment, however, C/C++
4014 are the only tree-ssa languages that support enumerations at all,
4015 so the point is moot. */
4018 c_do_switch_warnings (splay_tree cases, location_t switch_location,
4019 tree type, tree cond)
4021 splay_tree_node default_node;
4022 splay_tree_node node;
4025 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
4028 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
4030 warning (OPT_Wswitch_default, "%Hswitch missing default case",
4033 /* From here on, we only care about about enumerated types. */
4034 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
4037 /* If the switch expression was an enumerated type, check that
4038 exactly all enumeration literals are covered by the cases.
4039 The check is made when -Wswitch was specified and there is no
4040 default case, or when -Wswitch-enum was specified. */
4042 if (!warn_switch_enum
4043 && !(warn_switch && !default_node))
4046 /* Clearing COND if it is not an integer constant simplifies
4047 the tests inside the loop below. */
4048 if (TREE_CODE (cond) != INTEGER_CST)
4051 /* The time complexity here is O(N*lg(N)) worst case, but for the
4052 common case of monotonically increasing enumerators, it is
4053 O(N), since the nature of the splay tree will keep the next
4054 element adjacent to the root at all times. */
4056 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
4058 tree value = TREE_VALUE (chain);
4059 node = splay_tree_lookup (cases, (splay_tree_key) value);
4062 /* Mark the CASE_LOW part of the case entry as seen. */
4063 tree label = (tree) node->value;
4064 CASE_LOW_SEEN (label) = 1;
4068 /* Even though there wasn't an exact match, there might be a
4069 case range which includes the enumator's value. */
4070 node = splay_tree_predecessor (cases, (splay_tree_key) value);
4071 if (node && CASE_HIGH ((tree) node->value))
4073 tree label = (tree) node->value;
4074 int cmp = tree_int_cst_compare (CASE_HIGH (label), value);
4077 /* If we match the upper bound exactly, mark the CASE_HIGH
4078 part of the case entry as seen. */
4080 CASE_HIGH_SEEN (label) = 1;
4085 /* We've now determined that this enumerated literal isn't
4086 handled by the case labels of the switch statement. */
4088 /* If the switch expression is a constant, we only really care
4089 about whether that constant is handled by the switch. */
4090 if (cond && tree_int_cst_compare (cond, value))
4093 warning (0, "%Henumeration value %qE not handled in switch",
4094 &switch_location, TREE_PURPOSE (chain));
4097 /* Warn if there are case expressions that don't correspond to
4098 enumerators. This can occur since C and C++ don't enforce
4099 type-checking of assignments to enumeration variables.
4101 The time complexity here is now always O(N) worst case, since
4102 we should have marked both the lower bound and upper bound of
4103 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4104 above. This scan also resets those fields. */
4105 splay_tree_foreach (cases, match_case_to_enum, type);
4108 /* Finish an expression taking the address of LABEL (an
4109 IDENTIFIER_NODE). Returns an expression for the address. */
4112 finish_label_address_expr (tree label)
4117 pedwarn ("taking the address of a label is non-standard");
4119 if (label == error_mark_node)
4120 return error_mark_node;
4122 label = lookup_label (label);
4123 if (label == NULL_TREE)
4124 result = null_pointer_node;
4127 TREE_USED (label) = 1;
4128 result = build1 (ADDR_EXPR, ptr_type_node, label);
4129 /* The current function in not necessarily uninlinable.
4130 Computed gotos are incompatible with inlining, but the value
4131 here could be used only in a diagnostic, for example. */
4137 /* Hook used by expand_expr to expand language-specific tree codes. */
4138 /* The only things that should go here are bits needed to expand
4139 constant initializers. Everything else should be handled by the
4140 gimplification routines. */
4143 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
4144 int modifier /* Actually enum_modifier. */,
4147 switch (TREE_CODE (exp))
4149 case COMPOUND_LITERAL_EXPR:
4151 /* Initialize the anonymous variable declared in the compound
4152 literal, then return the variable. */
4153 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4154 emit_local_var (decl);
4155 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
4163 /* Hook used by staticp to handle language-specific tree codes. */
4166 c_staticp (tree exp)
4168 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4169 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
4174 /* Given a boolean expression ARG, return a tree representing an increment
4175 or decrement (as indicated by CODE) of ARG. The front end must check for
4176 invalid cases (e.g., decrement in C++). */
4178 boolean_increment (enum tree_code code, tree arg)
4181 tree true_res = boolean_true_node;
4183 arg = stabilize_reference (arg);
4186 case PREINCREMENT_EXPR:
4187 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4189 case POSTINCREMENT_EXPR:
4190 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4191 arg = save_expr (arg);
4192 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4193 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4195 case PREDECREMENT_EXPR:
4196 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4197 invert_truthvalue (arg));
4199 case POSTDECREMENT_EXPR:
4200 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4201 invert_truthvalue (arg));
4202 arg = save_expr (arg);
4203 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4204 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4209 TREE_SIDE_EFFECTS (val) = 1;
4213 /* Built-in macros for stddef.h, that require macros defined in this
4216 c_stddef_cpp_builtins(void)
4218 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4219 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4220 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4221 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4222 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
4223 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
4227 c_init_attributes (void)
4229 /* Fill in the built_in_attributes array. */
4230 #define DEF_ATTR_NULL_TREE(ENUM) \
4231 built_in_attributes[(int) ENUM] = NULL_TREE;
4232 #define DEF_ATTR_INT(ENUM, VALUE) \
4233 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4234 #define DEF_ATTR_IDENT(ENUM, STRING) \
4235 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4236 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4237 built_in_attributes[(int) ENUM] \
4238 = tree_cons (built_in_attributes[(int) PURPOSE], \
4239 built_in_attributes[(int) VALUE], \
4240 built_in_attributes[(int) CHAIN]);
4241 #include "builtin-attrs.def"
4242 #undef DEF_ATTR_NULL_TREE
4244 #undef DEF_ATTR_IDENT
4245 #undef DEF_ATTR_TREE_LIST
4248 /* Attribute handlers common to C front ends. */
4250 /* Handle a "packed" attribute; arguments as in
4251 struct attribute_spec.handler. */
4254 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4255 int flags, bool *no_add_attrs)
4259 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4260 *node = build_variant_type_copy (*node);
4261 TYPE_PACKED (*node) = 1;
4263 else if (TREE_CODE (*node) == FIELD_DECL)
4265 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT)
4266 warning (OPT_Wattributes,
4267 "%qE attribute ignored for field of type %qT",
4268 name, TREE_TYPE (*node));
4270 DECL_PACKED (*node) = 1;
4272 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4273 used for DECL_REGISTER. It wouldn't mean anything anyway.
4274 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4275 that changes what the typedef is typing. */
4278 warning (OPT_Wattributes, "%qE attribute ignored", name);
4279 *no_add_attrs = true;
4285 /* Handle a "nocommon" attribute; arguments as in
4286 struct attribute_spec.handler. */
4289 handle_nocommon_attribute (tree *node, tree name,
4290 tree ARG_UNUSED (args),
4291 int ARG_UNUSED (flags), bool *no_add_attrs)
4293 if (TREE_CODE (*node) == VAR_DECL)
4294 DECL_COMMON (*node) = 0;
4297 warning (OPT_Wattributes, "%qE attribute ignored", name);
4298 *no_add_attrs = true;
4304 /* Handle a "common" attribute; arguments as in
4305 struct attribute_spec.handler. */
4308 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4309 int ARG_UNUSED (flags), bool *no_add_attrs)
4311 if (TREE_CODE (*node) == VAR_DECL)
4312 DECL_COMMON (*node) = 1;
4315 warning (OPT_Wattributes, "%qE attribute ignored", name);
4316 *no_add_attrs = true;
4322 /* Handle a "noreturn" attribute; arguments as in
4323 struct attribute_spec.handler. */
4326 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4327 int ARG_UNUSED (flags), bool *no_add_attrs)
4329 tree type = TREE_TYPE (*node);
4331 /* See FIXME comment in c_common_attribute_table. */
4332 if (TREE_CODE (*node) == FUNCTION_DECL)
4333 TREE_THIS_VOLATILE (*node) = 1;
4334 else if (TREE_CODE (type) == POINTER_TYPE
4335 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4337 = build_pointer_type
4338 (build_type_variant (TREE_TYPE (type),
4339 TYPE_READONLY (TREE_TYPE (type)), 1));
4342 warning (OPT_Wattributes, "%qE attribute ignored", name);
4343 *no_add_attrs = true;
4349 /* Handle a "noinline" attribute; arguments as in
4350 struct attribute_spec.handler. */
4353 handle_noinline_attribute (tree *node, tree name,
4354 tree ARG_UNUSED (args),
4355 int ARG_UNUSED (flags), bool *no_add_attrs)
4357 if (TREE_CODE (*node) == FUNCTION_DECL)
4358 DECL_UNINLINABLE (*node) = 1;
4361 warning (OPT_Wattributes, "%qE attribute ignored", name);
4362 *no_add_attrs = true;
4368 /* Handle a "always_inline" attribute; arguments as in
4369 struct attribute_spec.handler. */
4372 handle_always_inline_attribute (tree *node, tree name,
4373 tree ARG_UNUSED (args),
4374 int ARG_UNUSED (flags),
4377 if (TREE_CODE (*node) == FUNCTION_DECL)
4379 /* Do nothing else, just set the attribute. We'll get at
4380 it later with lookup_attribute. */
4384 warning (OPT_Wattributes, "%qE attribute ignored", name);
4385 *no_add_attrs = true;
4391 /* Handle a "gnu_inline" attribute; arguments as in
4392 struct attribute_spec.handler. */
4395 handle_gnu_inline_attribute (tree *node, tree name,
4396 tree ARG_UNUSED (args),
4397 int ARG_UNUSED (flags),
4400 if (TREE_CODE (*node) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (*node))
4402 /* Do nothing else, just set the attribute. We'll get at
4403 it later with lookup_attribute. */
4407 warning (OPT_Wattributes, "%qE attribute ignored", name);
4408 *no_add_attrs = true;
4414 /* Handle a "flatten" attribute; arguments as in
4415 struct attribute_spec.handler. */
4418 handle_flatten_attribute (tree *node, tree name,
4419 tree args ATTRIBUTE_UNUSED,
4420 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4422 if (TREE_CODE (*node) == FUNCTION_DECL)
4423 /* Do nothing else, just set the attribute. We'll get at
4424 it later with lookup_attribute. */
4428 warning (OPT_Wattributes, "%qE attribute ignored", name);
4429 *no_add_attrs = true;
4436 /* Handle a "used" attribute; arguments as in
4437 struct attribute_spec.handler. */
4440 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4441 int ARG_UNUSED (flags), bool *no_add_attrs)
4445 if (TREE_CODE (node) == FUNCTION_DECL
4446 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4448 TREE_USED (node) = 1;
4449 DECL_PRESERVE_P (node) = 1;
4453 warning (OPT_Wattributes, "%qE attribute ignored", name);
4454 *no_add_attrs = true;
4460 /* Handle a "unused" attribute; arguments as in
4461 struct attribute_spec.handler. */
4464 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4465 int flags, bool *no_add_attrs)
4471 if (TREE_CODE (decl) == PARM_DECL
4472 || TREE_CODE (decl) == VAR_DECL
4473 || TREE_CODE (decl) == FUNCTION_DECL
4474 || TREE_CODE (decl) == LABEL_DECL
4475 || TREE_CODE (decl) == TYPE_DECL)
4476 TREE_USED (decl) = 1;
4479 warning (OPT_Wattributes, "%qE attribute ignored", name);
4480 *no_add_attrs = true;
4485 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4486 *node = build_variant_type_copy (*node);
4487 TREE_USED (*node) = 1;
4493 /* Handle a "externally_visible" attribute; arguments as in
4494 struct attribute_spec.handler. */
4497 handle_externally_visible_attribute (tree *pnode, tree name,
4498 tree ARG_UNUSED (args),
4499 int ARG_UNUSED (flags),
4504 if (TREE_CODE (node) == FUNCTION_DECL || TREE_CODE (node) == VAR_DECL)
4506 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL
4507 && !DECL_EXTERNAL (node)) || !TREE_PUBLIC (node))
4509 warning (OPT_Wattributes,
4510 "%qE attribute have effect only on public objects", name);
4511 *no_add_attrs = true;
4516 warning (OPT_Wattributes, "%qE attribute ignored", name);
4517 *no_add_attrs = true;
4523 /* Handle a "const" attribute; arguments as in
4524 struct attribute_spec.handler. */
4527 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4528 int ARG_UNUSED (flags), bool *no_add_attrs)
4530 tree type = TREE_TYPE (*node);
4532 /* See FIXME comment on noreturn in c_common_attribute_table. */
4533 if (TREE_CODE (*node) == FUNCTION_DECL)
4534 TREE_READONLY (*node) = 1;
4535 else if (TREE_CODE (type) == POINTER_TYPE
4536 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4538 = build_pointer_type
4539 (build_type_variant (TREE_TYPE (type), 1,
4540 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4543 warning (OPT_Wattributes, "%qE attribute ignored", name);
4544 *no_add_attrs = true;
4550 /* Handle a "transparent_union" attribute; arguments as in
4551 struct attribute_spec.handler. */
4554 handle_transparent_union_attribute (tree *node, tree name,
4555 tree ARG_UNUSED (args), int flags,
4560 *no_add_attrs = true;
4564 if (TREE_CODE (*node) != TYPE_DECL)
4566 node = &TREE_TYPE (*node);
4569 else if (TYPE_P (*node))
4574 if (TREE_CODE (type) == UNION_TYPE)
4576 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4577 the code in finish_struct. */
4578 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4580 if (TYPE_FIELDS (type) == NULL_TREE
4581 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
4584 /* A type variant isn't good enough, since we don't a cast
4585 to such a type removed as a no-op. */
4586 *node = type = build_duplicate_type (type);
4589 TYPE_TRANSPARENT_UNION (type) = 1;
4594 warning (OPT_Wattributes, "%qE attribute ignored", name);
4598 /* Handle a "constructor" attribute; arguments as in
4599 struct attribute_spec.handler. */
4602 handle_constructor_attribute (tree *node, tree name,
4603 tree ARG_UNUSED (args),
4604 int ARG_UNUSED (flags),
4608 tree type = TREE_TYPE (decl);
4610 if (TREE_CODE (decl) == FUNCTION_DECL
4611 && TREE_CODE (type) == FUNCTION_TYPE
4612 && decl_function_context (decl) == 0)
4614 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4615 TREE_USED (decl) = 1;
4619 warning (OPT_Wattributes, "%qE attribute ignored", name);
4620 *no_add_attrs = true;
4626 /* Handle a "destructor" attribute; arguments as in
4627 struct attribute_spec.handler. */
4630 handle_destructor_attribute (tree *node, tree name,
4631 tree ARG_UNUSED (args),
4632 int ARG_UNUSED (flags),
4636 tree type = TREE_TYPE (decl);
4638 if (TREE_CODE (decl) == FUNCTION_DECL
4639 && TREE_CODE (type) == FUNCTION_TYPE
4640 && decl_function_context (decl) == 0)
4642 DECL_STATIC_DESTRUCTOR (decl) = 1;
4643 TREE_USED (decl) = 1;
4647 warning (OPT_Wattributes, "%qE attribute ignored", name);
4648 *no_add_attrs = true;
4654 /* Handle a "mode" attribute; arguments as in
4655 struct attribute_spec.handler. */
4658 handle_mode_attribute (tree *node, tree name, tree args,
4659 int ARG_UNUSED (flags), bool *no_add_attrs)
4663 *no_add_attrs = true;
4665 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4666 warning (OPT_Wattributes, "%qE attribute ignored", name);
4670 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4671 int len = strlen (p);
4672 enum machine_mode mode = VOIDmode;
4676 if (len > 4 && p[0] == '_' && p[1] == '_'
4677 && p[len - 1] == '_' && p[len - 2] == '_')
4679 char *newp = (char *) alloca (len - 1);
4681 strcpy (newp, &p[2]);
4682 newp[len - 4] = '\0';
4686 /* Change this type to have a type with the specified mode.
4687 First check for the special modes. */
4688 if (!strcmp (p, "byte"))
4690 else if (!strcmp (p, "word"))
4692 else if (!strcmp (p, "pointer"))
4695 for (j = 0; j < NUM_MACHINE_MODES; j++)
4696 if (!strcmp (p, GET_MODE_NAME (j)))
4698 mode = (enum machine_mode) j;
4702 if (mode == VOIDmode)
4704 error ("unknown machine mode %qs", p);
4709 switch (GET_MODE_CLASS (mode))
4712 case MODE_PARTIAL_INT:
4714 case MODE_DECIMAL_FLOAT:
4715 valid_mode = targetm.scalar_mode_supported_p (mode);
4718 case MODE_COMPLEX_INT:
4719 case MODE_COMPLEX_FLOAT:
4720 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
4723 case MODE_VECTOR_INT:
4724 case MODE_VECTOR_FLOAT:
4725 warning (OPT_Wattributes, "specifying vector types with "
4726 "__attribute__ ((mode)) is deprecated");
4727 warning (OPT_Wattributes,
4728 "use __attribute__ ((vector_size)) instead");
4729 valid_mode = vector_mode_valid_p (mode);
4737 error ("unable to emulate %qs", p);
4741 if (POINTER_TYPE_P (type))
4743 tree (*fn)(tree, enum machine_mode, bool);
4745 if (!targetm.valid_pointer_mode (mode))
4747 error ("invalid pointer mode %qs", p);
4751 if (TREE_CODE (type) == POINTER_TYPE)
4752 fn = build_pointer_type_for_mode;
4754 fn = build_reference_type_for_mode;
4755 typefm = fn (TREE_TYPE (type), mode, false);
4758 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4760 if (typefm == NULL_TREE)
4762 error ("no data type for mode %qs", p);
4765 else if (TREE_CODE (type) == ENUMERAL_TYPE)
4767 /* For enumeral types, copy the precision from the integer
4768 type returned above. If not an INTEGER_TYPE, we can't use
4769 this mode for this type. */
4770 if (TREE_CODE (typefm) != INTEGER_TYPE)
4772 error ("cannot use mode %qs for enumeral types", p);
4776 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
4778 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
4783 /* We cannot build a type variant, as there's code that assumes
4784 that TYPE_MAIN_VARIANT has the same mode. This includes the
4785 debug generators. Instead, create a subrange type. This
4786 results in all of the enumeral values being emitted only once
4787 in the original, and the subtype gets them by reference. */
4788 if (TYPE_UNSIGNED (type))
4789 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
4791 typefm = make_signed_type (TYPE_PRECISION (typefm));
4792 TREE_TYPE (typefm) = type;
4795 else if (VECTOR_MODE_P (mode)
4796 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
4797 : TREE_CODE (type) != TREE_CODE (typefm))
4799 error ("mode %qs applied to inappropriate type", p);
4809 /* Handle a "section" attribute; arguments as in
4810 struct attribute_spec.handler. */
4813 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4814 int ARG_UNUSED (flags), bool *no_add_attrs)
4818 if (targetm.have_named_sections)
4820 user_defined_section_attribute = true;
4822 if ((TREE_CODE (decl) == FUNCTION_DECL
4823 || TREE_CODE (decl) == VAR_DECL)
4824 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4826 if (TREE_CODE (decl) == VAR_DECL
4827 && current_function_decl != NULL_TREE
4828 && !TREE_STATIC (decl))
4830 error ("%Jsection attribute cannot be specified for "
4831 "local variables", decl);
4832 *no_add_attrs = true;
4835 /* The decl may have already been given a section attribute
4836 from a previous declaration. Ensure they match. */
4837 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4838 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4839 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4841 error ("section of %q+D conflicts with previous declaration",
4843 *no_add_attrs = true;
4846 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4850 error ("section attribute not allowed for %q+D", *node);
4851 *no_add_attrs = true;
4856 error ("%Jsection attributes are not supported for this target", *node);
4857 *no_add_attrs = true;
4863 /* Handle a "aligned" attribute; arguments as in
4864 struct attribute_spec.handler. */
4867 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4868 int flags, bool *no_add_attrs)
4870 tree decl = NULL_TREE;
4873 tree align_expr = (args ? TREE_VALUE (args)
4874 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4880 type = &TREE_TYPE (decl);
4881 is_type = TREE_CODE (*node) == TYPE_DECL;
4883 else if (TYPE_P (*node))
4884 type = node, is_type = 1;
4886 if (TREE_CODE (align_expr) != INTEGER_CST)
4888 error ("requested alignment is not a constant");
4889 *no_add_attrs = true;
4891 else if ((i = tree_log2 (align_expr)) == -1)
4893 error ("requested alignment is not a power of 2");
4894 *no_add_attrs = true;
4896 else if (i > HOST_BITS_PER_INT - 2)
4898 error ("requested alignment is too large");
4899 *no_add_attrs = true;
4903 /* If we have a TYPE_DECL, then copy the type, so that we
4904 don't accidentally modify a builtin type. See pushdecl. */
4905 if (decl && TREE_TYPE (decl) != error_mark_node
4906 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4908 tree tt = TREE_TYPE (decl);
4909 *type = build_variant_type_copy (*type);
4910 DECL_ORIGINAL_TYPE (decl) = tt;
4911 TYPE_NAME (*type) = decl;
4912 TREE_USED (*type) = TREE_USED (decl);
4913 TREE_TYPE (decl) = *type;
4915 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4916 *type = build_variant_type_copy (*type);
4918 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4919 TYPE_USER_ALIGN (*type) = 1;
4921 else if (TREE_CODE (decl) != VAR_DECL
4922 && TREE_CODE (decl) != FIELD_DECL)
4924 error ("alignment may not be specified for %q+D", decl);
4925 *no_add_attrs = true;
4929 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4930 DECL_USER_ALIGN (decl) = 1;
4936 /* Handle a "weak" attribute; arguments as in
4937 struct attribute_spec.handler. */
4940 handle_weak_attribute (tree *node, tree name,
4941 tree ARG_UNUSED (args),
4942 int ARG_UNUSED (flags),
4943 bool * ARG_UNUSED (no_add_attrs))
4945 if (TREE_CODE (*node) == FUNCTION_DECL
4946 || TREE_CODE (*node) == VAR_DECL)
4947 declare_weak (*node);
4949 warning (OPT_Wattributes, "%qE attribute ignored", name);
4955 /* Handle an "alias" attribute; arguments as in
4956 struct attribute_spec.handler. */
4959 handle_alias_attribute (tree *node, tree name, tree args,
4960 int ARG_UNUSED (flags), bool *no_add_attrs)
4964 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4965 || (TREE_CODE (decl) != FUNCTION_DECL
4966 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
4967 /* A static variable declaration is always a tentative definition,
4968 but the alias is a non-tentative definition which overrides. */
4969 || (TREE_CODE (decl) != FUNCTION_DECL
4970 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
4972 error ("%q+D defined both normally and as an alias", decl);
4973 *no_add_attrs = true;
4976 /* Note that the very first time we process a nested declaration,
4977 decl_function_context will not be set. Indeed, *would* never
4978 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4979 we do below. After such frobbery, pushdecl would set the context.
4980 In any case, this is never what we want. */
4981 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4985 id = TREE_VALUE (args);
4986 if (TREE_CODE (id) != STRING_CST)
4988 error ("alias argument not a string");
4989 *no_add_attrs = true;
4992 id = get_identifier (TREE_STRING_POINTER (id));
4993 /* This counts as a use of the object pointed to. */
4996 if (TREE_CODE (decl) == FUNCTION_DECL)
4997 DECL_INITIAL (decl) = error_mark_node;
5000 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
5001 DECL_EXTERNAL (decl) = 1;
5003 DECL_EXTERNAL (decl) = 0;
5004 TREE_STATIC (decl) = 1;
5009 warning (OPT_Wattributes, "%qE attribute ignored", name);
5010 *no_add_attrs = true;
5016 /* Handle a "weakref" attribute; arguments as in struct
5017 attribute_spec.handler. */
5020 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
5021 int flags, bool *no_add_attrs)
5023 tree attr = NULL_TREE;
5025 /* We must ignore the attribute when it is associated with
5026 local-scoped decls, since attribute alias is ignored and many
5027 such symbols do not even have a DECL_WEAK field. */
5028 if (decl_function_context (*node) || current_function_decl)
5030 warning (OPT_Wattributes, "%qE attribute ignored", name);
5031 *no_add_attrs = true;
5035 /* The idea here is that `weakref("name")' mutates into `weakref,
5036 alias("name")', and weakref without arguments, in turn,
5037 implicitly adds weak. */
5041 attr = tree_cons (get_identifier ("alias"), args, attr);
5042 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
5044 *no_add_attrs = true;
5046 decl_attributes (node, attr, flags);
5050 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
5051 error ("%Jweakref attribute must appear before alias attribute",
5054 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
5055 and that isn't supported; and because it wants to add it to
5056 the list of weak decls, which isn't helpful. */
5057 DECL_WEAK (*node) = 1;
5063 /* Handle an "visibility" attribute; arguments as in
5064 struct attribute_spec.handler. */
5067 handle_visibility_attribute (tree *node, tree name, tree args,
5068 int ARG_UNUSED (flags),
5069 bool *ARG_UNUSED (no_add_attrs))
5072 tree id = TREE_VALUE (args);
5073 enum symbol_visibility vis;
5077 if (TREE_CODE (*node) == ENUMERAL_TYPE)
5079 else if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
5081 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
5085 else if (TYPE_FIELDS (*node))
5087 error ("%qE attribute ignored because %qT is already defined",
5092 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
5094 warning (OPT_Wattributes, "%qE attribute ignored", name);
5098 if (TREE_CODE (id) != STRING_CST)
5100 error ("visibility argument not a string");
5104 /* If this is a type, set the visibility on the type decl. */
5107 decl = TYPE_NAME (decl);
5110 if (TREE_CODE (decl) == IDENTIFIER_NODE)
5112 warning (OPT_Wattributes, "%qE attribute ignored on types",
5118 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
5119 vis = VISIBILITY_DEFAULT;
5120 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
5121 vis = VISIBILITY_INTERNAL;
5122 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
5123 vis = VISIBILITY_HIDDEN;
5124 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
5125 vis = VISIBILITY_PROTECTED;
5128 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5129 vis = VISIBILITY_DEFAULT;
5132 if (DECL_VISIBILITY_SPECIFIED (decl)
5133 && vis != DECL_VISIBILITY (decl)
5134 && lookup_attribute ("visibility", (TYPE_P (*node)
5135 ? TYPE_ATTRIBUTES (*node)
5136 : DECL_ATTRIBUTES (decl))))
5137 error ("%qD redeclared with different visibility", decl);
5139 DECL_VISIBILITY (decl) = vis;
5140 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5142 /* Go ahead and attach the attribute to the node as well. This is needed
5143 so we can determine whether we have VISIBILITY_DEFAULT because the
5144 visibility was not specified, or because it was explicitly overridden
5145 from the containing scope. */
5150 /* Determine the ELF symbol visibility for DECL, which is either a
5151 variable or a function. It is an error to use this function if a
5152 definition of DECL is not available in this translation unit.
5153 Returns true if the final visibility has been determined by this
5154 function; false if the caller is free to make additional
5158 c_determine_visibility (tree decl)
5160 gcc_assert (TREE_CODE (decl) == VAR_DECL
5161 || TREE_CODE (decl) == FUNCTION_DECL);
5163 /* If the user explicitly specified the visibility with an
5164 attribute, honor that. DECL_VISIBILITY will have been set during
5165 the processing of the attribute. We check for an explicit
5166 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5167 to distinguish the use of an attribute from the use of a "#pragma
5168 GCC visibility push(...)"; in the latter case we still want other
5169 considerations to be able to overrule the #pragma. */
5170 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
5173 /* Anything that is exported must have default visibility. */
5174 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5175 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
5177 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
5178 DECL_VISIBILITY_SPECIFIED (decl) = 1;
5182 /* Set default visibility to whatever the user supplied with
5183 visibility_specified depending on #pragma GCC visibility. */
5184 if (!DECL_VISIBILITY_SPECIFIED (decl))
5186 DECL_VISIBILITY (decl) = default_visibility;
5187 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
5192 /* Handle an "tls_model" attribute; arguments as in
5193 struct attribute_spec.handler. */
5196 handle_tls_model_attribute (tree *node, tree name, tree args,
5197 int ARG_UNUSED (flags), bool *no_add_attrs)
5201 enum tls_model kind;
5203 *no_add_attrs = true;
5205 if (!DECL_THREAD_LOCAL_P (decl))
5207 warning (OPT_Wattributes, "%qE attribute ignored", name);
5211 kind = DECL_TLS_MODEL (decl);
5212 id = TREE_VALUE (args);
5213 if (TREE_CODE (id) != STRING_CST)
5215 error ("tls_model argument not a string");
5219 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
5220 kind = TLS_MODEL_LOCAL_EXEC;
5221 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
5222 kind = TLS_MODEL_INITIAL_EXEC;
5223 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
5224 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
5225 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5226 kind = TLS_MODEL_GLOBAL_DYNAMIC;
5228 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5230 DECL_TLS_MODEL (decl) = kind;
5234 /* Handle a "no_instrument_function" attribute; arguments as in
5235 struct attribute_spec.handler. */
5238 handle_no_instrument_function_attribute (tree *node, tree name,
5239 tree ARG_UNUSED (args),
5240 int ARG_UNUSED (flags),
5245 if (TREE_CODE (decl) != FUNCTION_DECL)
5247 error ("%J%qE attribute applies only to functions", decl, name);
5248 *no_add_attrs = true;
5250 else if (DECL_INITIAL (decl))
5252 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5253 *no_add_attrs = true;
5256 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5261 /* Handle a "malloc" attribute; arguments as in
5262 struct attribute_spec.handler. */
5265 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5266 int ARG_UNUSED (flags), bool *no_add_attrs)
5268 if (TREE_CODE (*node) == FUNCTION_DECL
5269 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
5270 DECL_IS_MALLOC (*node) = 1;
5273 warning (OPT_Wattributes, "%qE attribute ignored", name);
5274 *no_add_attrs = true;
5280 /* Handle a "returns_twice" attribute; arguments as in
5281 struct attribute_spec.handler. */
5284 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5285 int ARG_UNUSED (flags), bool *no_add_attrs)
5287 if (TREE_CODE (*node) == FUNCTION_DECL)
5288 DECL_IS_RETURNS_TWICE (*node) = 1;
5291 warning (OPT_Wattributes, "%qE attribute ignored", name);
5292 *no_add_attrs = true;
5298 /* Handle a "no_limit_stack" attribute; arguments as in
5299 struct attribute_spec.handler. */
5302 handle_no_limit_stack_attribute (tree *node, tree name,
5303 tree ARG_UNUSED (args),
5304 int ARG_UNUSED (flags),
5309 if (TREE_CODE (decl) != FUNCTION_DECL)
5311 error ("%J%qE attribute applies only to functions", decl, name);
5312 *no_add_attrs = true;
5314 else if (DECL_INITIAL (decl))
5316 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5317 *no_add_attrs = true;
5320 DECL_NO_LIMIT_STACK (decl) = 1;
5325 /* Handle a "pure" attribute; arguments as in
5326 struct attribute_spec.handler. */
5329 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5330 int ARG_UNUSED (flags), bool *no_add_attrs)
5332 if (TREE_CODE (*node) == FUNCTION_DECL)
5333 DECL_IS_PURE (*node) = 1;
5334 /* ??? TODO: Support types. */
5337 warning (OPT_Wattributes, "%qE attribute ignored", name);
5338 *no_add_attrs = true;
5344 /* Handle a "no vops" attribute; arguments as in
5345 struct attribute_spec.handler. */
5348 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
5349 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
5350 bool *ARG_UNUSED (no_add_attrs))
5352 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
5353 DECL_IS_NOVOPS (*node) = 1;
5357 /* Handle a "deprecated" attribute; arguments as in
5358 struct attribute_spec.handler. */
5361 handle_deprecated_attribute (tree *node, tree name,
5362 tree ARG_UNUSED (args), int flags,
5365 tree type = NULL_TREE;
5367 tree what = NULL_TREE;
5372 type = TREE_TYPE (decl);
5374 if (TREE_CODE (decl) == TYPE_DECL
5375 || TREE_CODE (decl) == PARM_DECL
5376 || TREE_CODE (decl) == VAR_DECL
5377 || TREE_CODE (decl) == FUNCTION_DECL
5378 || TREE_CODE (decl) == FIELD_DECL)
5379 TREE_DEPRECATED (decl) = 1;
5383 else if (TYPE_P (*node))
5385 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5386 *node = build_variant_type_copy (*node);
5387 TREE_DEPRECATED (*node) = 1;
5395 *no_add_attrs = true;
5396 if (type && TYPE_NAME (type))
5398 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5399 what = TYPE_NAME (*node);
5400 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5401 && DECL_NAME (TYPE_NAME (type)))
5402 what = DECL_NAME (TYPE_NAME (type));
5405 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
5407 warning (OPT_Wattributes, "%qE attribute ignored", name);
5413 /* Handle a "vector_size" attribute; arguments as in
5414 struct attribute_spec.handler. */
5417 handle_vector_size_attribute (tree *node, tree name, tree args,
5418 int ARG_UNUSED (flags),
5421 unsigned HOST_WIDE_INT vecsize, nunits;
5422 enum machine_mode orig_mode;
5423 tree type = *node, new_type, size;
5425 *no_add_attrs = true;
5427 size = TREE_VALUE (args);
5429 if (!host_integerp (size, 1))
5431 warning (OPT_Wattributes, "%qE attribute ignored", name);
5435 /* Get the vector size (in bytes). */
5436 vecsize = tree_low_cst (size, 1);
5438 /* We need to provide for vector pointers, vector arrays, and
5439 functions returning vectors. For example:
5441 __attribute__((vector_size(16))) short *foo;
5443 In this case, the mode is SI, but the type being modified is
5444 HI, so we need to look further. */
5446 while (POINTER_TYPE_P (type)
5447 || TREE_CODE (type) == FUNCTION_TYPE
5448 || TREE_CODE (type) == METHOD_TYPE
5449 || TREE_CODE (type) == ARRAY_TYPE)
5450 type = TREE_TYPE (type);
5452 /* Get the mode of the type being modified. */
5453 orig_mode = TYPE_MODE (type);
5455 if (TREE_CODE (type) == RECORD_TYPE
5456 || TREE_CODE (type) == UNION_TYPE
5457 || TREE_CODE (type) == VECTOR_TYPE
5458 || (!SCALAR_FLOAT_MODE_P (orig_mode)
5459 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5460 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
5462 error ("invalid vector type for attribute %qE", name);
5466 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
5468 error ("vector size not an integral multiple of component size");
5474 error ("zero vector size");
5478 /* Calculate how many units fit in the vector. */
5479 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5480 if (nunits & (nunits - 1))
5482 error ("number of components of the vector not a power of two");
5486 new_type = build_vector_type (type, nunits);
5488 /* Build back pointers if needed. */
5489 *node = reconstruct_complex_type (*node, new_type);
5494 /* Handle the "nonnull" attribute. */
5496 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
5497 tree args, int ARG_UNUSED (flags),
5501 unsigned HOST_WIDE_INT attr_arg_num;
5503 /* If no arguments are specified, all pointer arguments should be
5504 non-null. Verify a full prototype is given so that the arguments
5505 will have the correct types when we actually check them later. */
5508 if (!TYPE_ARG_TYPES (type))
5510 error ("nonnull attribute without arguments on a non-prototype");
5511 *no_add_attrs = true;
5516 /* Argument list specified. Verify that each argument number references
5517 a pointer argument. */
5518 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5521 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5523 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
5525 error ("nonnull argument has invalid operand number (argument %lu)",
5526 (unsigned long) attr_arg_num);
5527 *no_add_attrs = true;
5531 argument = TYPE_ARG_TYPES (type);
5534 for (ck_num = 1; ; ck_num++)
5536 if (!argument || ck_num == arg_num)
5538 argument = TREE_CHAIN (argument);
5542 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5544 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5545 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5546 *no_add_attrs = true;
5550 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5552 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5553 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5554 *no_add_attrs = true;
5563 /* Check the argument list of a function call for null in argument slots
5564 that are marked as requiring a non-null pointer argument. */
5567 check_function_nonnull (tree attrs, tree params)
5569 tree a, args, param;
5572 for (a = attrs; a; a = TREE_CHAIN (a))
5574 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5576 args = TREE_VALUE (a);
5578 /* Walk the argument list. If we encounter an argument number we
5579 should check for non-null, do it. If the attribute has no args,
5580 then every pointer argument is checked (in which case the check
5581 for pointer type is done in check_nonnull_arg). */
5582 for (param = params, param_num = 1; ;
5583 param_num++, param = TREE_CHAIN (param))
5587 if (!args || nonnull_check_p (args, param_num))
5588 check_function_arguments_recurse (check_nonnull_arg, NULL,
5596 /* Check that the Nth argument of a function call (counting backwards
5597 from the end) is a (pointer)0. */
5600 check_function_sentinel (tree attrs, tree params, tree typelist)
5602 tree attr = lookup_attribute ("sentinel", attrs);
5606 /* Skip over the named arguments. */
5607 while (typelist && params)
5609 typelist = TREE_CHAIN (typelist);
5610 params = TREE_CHAIN (params);
5613 if (typelist || !params)
5614 warning (OPT_Wformat,
5615 "not enough variable arguments to fit a sentinel");
5621 if (TREE_VALUE (attr))
5623 tree p = TREE_VALUE (TREE_VALUE (attr));
5624 pos = TREE_INT_CST_LOW (p);
5627 sentinel = end = params;
5629 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5630 while (pos > 0 && TREE_CHAIN (end))
5633 end = TREE_CHAIN (end);
5637 warning (OPT_Wformat,
5638 "not enough variable arguments to fit a sentinel");
5642 /* Now advance both until we find the last parameter. */
5643 while (TREE_CHAIN (end))
5645 end = TREE_CHAIN (end);
5646 sentinel = TREE_CHAIN (sentinel);
5649 /* Validate the sentinel. */
5650 if ((!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel)))
5651 || !integer_zerop (TREE_VALUE (sentinel)))
5652 /* Although __null (in C++) is only an integer we allow it
5653 nevertheless, as we are guaranteed that it's exactly
5654 as wide as a pointer, and we don't want to force
5655 users to cast the NULL they have written there.
5656 We warn with -Wstrict-null-sentinel, though. */
5657 && (warn_strict_null_sentinel
5658 || null_node != TREE_VALUE (sentinel)))
5659 warning (OPT_Wformat, "missing sentinel in function call");
5664 /* Helper for check_function_nonnull; given a list of operands which
5665 must be non-null in ARGS, determine if operand PARAM_NUM should be
5669 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5671 unsigned HOST_WIDE_INT arg_num = 0;
5673 for (; args; args = TREE_CHAIN (args))
5675 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
5679 if (arg_num == param_num)
5685 /* Check that the function argument PARAM (which is operand number
5686 PARAM_NUM) is non-null. This is called by check_function_nonnull
5687 via check_function_arguments_recurse. */
5690 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5691 unsigned HOST_WIDE_INT param_num)
5693 /* Just skip checking the argument if it's not a pointer. This can
5694 happen if the "nonnull" attribute was given without an operand
5695 list (which means to check every pointer argument). */
5697 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5700 if (integer_zerop (param))
5701 warning (OPT_Wnonnull, "null argument where non-null required "
5702 "(argument %lu)", (unsigned long) param_num);
5705 /* Helper for nonnull attribute handling; fetch the operand number
5706 from the attribute argument list. */
5709 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5711 /* Verify the arg number is a constant. */
5712 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5713 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5716 *valp = TREE_INT_CST_LOW (arg_num_expr);
5720 /* Handle a "nothrow" attribute; arguments as in
5721 struct attribute_spec.handler. */
5724 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5725 int ARG_UNUSED (flags), bool *no_add_attrs)
5727 if (TREE_CODE (*node) == FUNCTION_DECL)
5728 TREE_NOTHROW (*node) = 1;
5729 /* ??? TODO: Support types. */
5732 warning (OPT_Wattributes, "%qE attribute ignored", name);
5733 *no_add_attrs = true;
5739 /* Handle a "cleanup" attribute; arguments as in
5740 struct attribute_spec.handler. */
5743 handle_cleanup_attribute (tree *node, tree name, tree args,
5744 int ARG_UNUSED (flags), bool *no_add_attrs)
5747 tree cleanup_id, cleanup_decl;
5749 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5750 for global destructors in C++. This requires infrastructure that
5751 we don't have generically at the moment. It's also not a feature
5752 we'd be missing too much, since we do have attribute constructor. */
5753 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5755 warning (OPT_Wattributes, "%qE attribute ignored", name);
5756 *no_add_attrs = true;
5760 /* Verify that the argument is a function in scope. */
5761 /* ??? We could support pointers to functions here as well, if
5762 that was considered desirable. */
5763 cleanup_id = TREE_VALUE (args);
5764 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5766 error ("cleanup argument not an identifier");
5767 *no_add_attrs = true;
5770 cleanup_decl = lookup_name (cleanup_id);
5771 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5773 error ("cleanup argument not a function");
5774 *no_add_attrs = true;
5778 /* That the function has proper type is checked with the
5779 eventual call to build_function_call. */
5784 /* Handle a "warn_unused_result" attribute. No special handling. */
5787 handle_warn_unused_result_attribute (tree *node, tree name,
5788 tree ARG_UNUSED (args),
5789 int ARG_UNUSED (flags), bool *no_add_attrs)
5791 /* Ignore the attribute for functions not returning any value. */
5792 if (VOID_TYPE_P (TREE_TYPE (*node)))
5794 warning (OPT_Wattributes, "%qE attribute ignored", name);
5795 *no_add_attrs = true;
5801 /* Handle a "sentinel" attribute. */
5804 handle_sentinel_attribute (tree *node, tree name, tree args,
5805 int ARG_UNUSED (flags), bool *no_add_attrs)
5807 tree params = TYPE_ARG_TYPES (*node);
5811 warning (OPT_Wattributes,
5812 "%qE attribute requires prototypes with named arguments", name);
5813 *no_add_attrs = true;
5817 while (TREE_CHAIN (params))
5818 params = TREE_CHAIN (params);
5820 if (VOID_TYPE_P (TREE_VALUE (params)))
5822 warning (OPT_Wattributes,
5823 "%qE attribute only applies to variadic functions", name);
5824 *no_add_attrs = true;
5830 tree position = TREE_VALUE (args);
5832 if (TREE_CODE (position) != INTEGER_CST)
5834 warning (0, "requested position is not an integer constant");
5835 *no_add_attrs = true;
5839 if (tree_int_cst_lt (position, integer_zero_node))
5841 warning (0, "requested position is less than zero");
5842 *no_add_attrs = true;
5850 /* Check for valid arguments being passed to a function. */
5852 check_function_arguments (tree attrs, tree params, tree typelist)
5854 /* Check for null being passed in a pointer argument that must be
5855 non-null. We also need to do this if format checking is enabled. */
5858 check_function_nonnull (attrs, params);
5860 /* Check for errors in format strings. */
5862 if (warn_format || warn_missing_format_attribute)
5863 check_function_format (attrs, params);
5866 check_function_sentinel (attrs, params, typelist);
5869 /* Generic argument checking recursion routine. PARAM is the argument to
5870 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5871 once the argument is resolved. CTX is context for the callback. */
5873 check_function_arguments_recurse (void (*callback)
5874 (void *, tree, unsigned HOST_WIDE_INT),
5875 void *ctx, tree param,
5876 unsigned HOST_WIDE_INT param_num)
5878 if ((TREE_CODE (param) == NOP_EXPR || TREE_CODE (param) == CONVERT_EXPR)
5879 && (TYPE_PRECISION (TREE_TYPE (param))
5880 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
5882 /* Strip coercion. */
5883 check_function_arguments_recurse (callback, ctx,
5884 TREE_OPERAND (param, 0), param_num);
5888 if (TREE_CODE (param) == CALL_EXPR)
5890 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5892 bool found_format_arg = false;
5894 /* See if this is a call to a known internationalization function
5895 that modifies a format arg. Such a function may have multiple
5896 format_arg attributes (for example, ngettext). */
5898 for (attrs = TYPE_ATTRIBUTES (type);
5900 attrs = TREE_CHAIN (attrs))
5901 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5904 tree format_num_expr;
5908 /* Extract the argument number, which was previously checked
5910 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5912 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
5913 && !TREE_INT_CST_HIGH (format_num_expr));
5915 format_num = TREE_INT_CST_LOW (format_num_expr);
5917 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5919 inner_args = TREE_CHAIN (inner_args), i++)
5920 if (i == format_num)
5922 check_function_arguments_recurse (callback, ctx,
5923 TREE_VALUE (inner_args),
5925 found_format_arg = true;
5930 /* If we found a format_arg attribute and did a recursive check,
5931 we are done with checking this argument. Otherwise, we continue
5932 and this will be considered a non-literal. */
5933 if (found_format_arg)
5937 if (TREE_CODE (param) == COND_EXPR)
5939 /* Check both halves of the conditional expression. */
5940 check_function_arguments_recurse (callback, ctx,
5941 TREE_OPERAND (param, 1), param_num);
5942 check_function_arguments_recurse (callback, ctx,
5943 TREE_OPERAND (param, 2), param_num);
5947 (*callback) (ctx, param, param_num);
5950 /* Function to help qsort sort FIELD_DECLs by name order. */
5953 field_decl_cmp (const void *x_p, const void *y_p)
5955 const tree *const x = (const tree *const) x_p;
5956 const tree *const y = (const tree *const) y_p;
5958 if (DECL_NAME (*x) == DECL_NAME (*y))
5959 /* A nontype is "greater" than a type. */
5960 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5961 if (DECL_NAME (*x) == NULL_TREE)
5963 if (DECL_NAME (*y) == NULL_TREE)
5965 if (DECL_NAME (*x) < DECL_NAME (*y))
5971 gt_pointer_operator new_value;
5975 /* This routine compares two fields like field_decl_cmp but using the
5976 pointer operator in resort_data. */
5979 resort_field_decl_cmp (const void *x_p, const void *y_p)
5981 const tree *const x = (const tree *const) x_p;
5982 const tree *const y = (const tree *const) y_p;
5984 if (DECL_NAME (*x) == DECL_NAME (*y))
5985 /* A nontype is "greater" than a type. */
5986 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5987 if (DECL_NAME (*x) == NULL_TREE)
5989 if (DECL_NAME (*y) == NULL_TREE)
5992 tree d1 = DECL_NAME (*x);
5993 tree d2 = DECL_NAME (*y);
5994 resort_data.new_value (&d1, resort_data.cookie);
5995 resort_data.new_value (&d2, resort_data.cookie);
6002 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
6005 resort_sorted_fields (void *obj,
6006 void * ARG_UNUSED (orig_obj),
6007 gt_pointer_operator new_value,
6010 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
6011 resort_data.new_value = new_value;
6012 resort_data.cookie = cookie;
6013 qsort (&sf->elts[0], sf->len, sizeof (tree),
6014 resort_field_decl_cmp);
6017 /* Subroutine of c_parse_error.
6018 Return the result of concatenating LHS and RHS. RHS is really
6019 a string literal, its first character is indicated by RHS_START and
6020 RHS_SIZE is its length (including the terminating NUL character).
6022 The caller is responsible for deleting the returned pointer. */
6025 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
6027 const int lhs_size = strlen (lhs);
6028 char *result = XNEWVEC (char, lhs_size + rhs_size);
6029 strncpy (result, lhs, lhs_size);
6030 strncpy (result + lhs_size, rhs_start, rhs_size);
6034 /* Issue the error given by GMSGID, indicating that it occurred before
6035 TOKEN, which had the associated VALUE. */
6038 c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value)
6040 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6042 char *message = NULL;
6044 if (token == CPP_EOF)
6045 message = catenate_messages (gmsgid, " at end of input");
6046 else if (token == CPP_CHAR || token == CPP_WCHAR)
6048 unsigned int val = TREE_INT_CST_LOW (value);
6049 const char *const ell = (token == CPP_CHAR) ? "" : "L";
6050 if (val <= UCHAR_MAX && ISGRAPH (val))
6051 message = catenate_messages (gmsgid, " before %s'%c'");
6053 message = catenate_messages (gmsgid, " before %s'\\x%x'");
6055 error (message, ell, val);
6059 else if (token == CPP_STRING || token == CPP_WSTRING)
6060 message = catenate_messages (gmsgid, " before string constant");
6061 else if (token == CPP_NUMBER)
6062 message = catenate_messages (gmsgid, " before numeric constant");
6063 else if (token == CPP_NAME)
6065 message = catenate_messages (gmsgid, " before %qE");
6066 error (message, value);
6070 else if (token == CPP_PRAGMA)
6071 message = catenate_messages (gmsgid, " before %<#pragma%>");
6072 else if (token == CPP_PRAGMA_EOL)
6073 message = catenate_messages (gmsgid, " before end of line");
6074 else if (token < N_TTYPES)
6076 message = catenate_messages (gmsgid, " before %qs token");
6077 error (message, cpp_type2name (token));
6089 #undef catenate_messages
6092 /* Walk a gimplified function and warn for functions whose return value is
6093 ignored and attribute((warn_unused_result)) is set. This is done before
6094 inlining, so we don't have to worry about that. */
6097 c_warn_unused_result (tree *top_p)
6100 tree_stmt_iterator i;
6103 switch (TREE_CODE (t))
6105 case STATEMENT_LIST:
6106 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
6107 c_warn_unused_result (tsi_stmt_ptr (i));
6111 c_warn_unused_result (&COND_EXPR_THEN (t));
6112 c_warn_unused_result (&COND_EXPR_ELSE (t));
6115 c_warn_unused_result (&BIND_EXPR_BODY (t));
6117 case TRY_FINALLY_EXPR:
6118 case TRY_CATCH_EXPR:
6119 c_warn_unused_result (&TREE_OPERAND (t, 0));
6120 c_warn_unused_result (&TREE_OPERAND (t, 1));
6123 c_warn_unused_result (&CATCH_BODY (t));
6125 case EH_FILTER_EXPR:
6126 c_warn_unused_result (&EH_FILTER_FAILURE (t));
6133 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6134 a MODIFY_EXPR. All calls whose value is ignored should be
6135 represented like this. Look for the attribute. */
6136 fdecl = get_callee_fndecl (t);
6138 ftype = TREE_TYPE (fdecl);
6141 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
6142 /* Look past pointer-to-function to the function type itself. */
6143 ftype = TREE_TYPE (ftype);
6146 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
6149 warning (0, "%Hignoring return value of %qD, "
6150 "declared with attribute warn_unused_result",
6151 EXPR_LOCUS (t), fdecl);
6153 warning (0, "%Hignoring return value of function "
6154 "declared with attribute warn_unused_result",
6160 /* Not a container, not a call, or a call whose value is used. */
6165 /* Convert a character from the host to the target execution character
6166 set. cpplib handles this, mostly. */
6169 c_common_to_target_charset (HOST_WIDE_INT c)
6171 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6172 zero-extended under -fno-signed-char. cpplib insists that characters
6173 and character constants are always unsigned. Hence we must convert
6175 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
6177 uc = cpp_host_to_exec_charset (parse_in, uc);
6179 if (flag_signed_char)
6180 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
6181 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
6186 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
6187 component references, with STOP_REF, or alternatively an INDIRECT_REF of
6188 NULL, at the bottom; much like the traditional rendering of offsetof as a
6189 macro. Returns the folded and properly cast result. */
6192 fold_offsetof_1 (tree expr, tree stop_ref)
6194 enum tree_code code = PLUS_EXPR;
6197 if (expr == stop_ref && TREE_CODE (expr) != ERROR_MARK)
6198 return size_zero_node;
6200 switch (TREE_CODE (expr))
6206 error ("cannot apply %<offsetof%> to static data member %qD", expr);
6207 return error_mark_node;
6210 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6211 return error_mark_node;
6214 gcc_assert (integer_zerop (expr));
6215 return size_zero_node;
6219 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6220 gcc_assert (base == error_mark_node || base == size_zero_node);
6224 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6225 if (base == error_mark_node)
6228 t = TREE_OPERAND (expr, 1);
6229 if (DECL_C_BIT_FIELD (t))
6231 error ("attempt to take address of bit-field structure "
6233 return error_mark_node;
6235 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
6236 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
6241 base = fold_offsetof_1 (TREE_OPERAND (expr, 0), stop_ref);
6242 if (base == error_mark_node)
6245 t = TREE_OPERAND (expr, 1);
6246 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
6249 t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t);
6251 t = convert (sizetype, t);
6252 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
6259 return size_binop (code, base, off);
6263 fold_offsetof (tree expr, tree stop_ref)
6265 /* Convert back from the internal sizetype to size_t. */
6266 return convert (size_type_node, fold_offsetof_1 (expr, stop_ref));
6269 /* Print an error message for an invalid lvalue. USE says
6270 how the lvalue is being used and so selects the error message. */
6273 lvalue_error (enum lvalue_use use)
6278 error ("lvalue required as left operand of assignment");
6281 error ("lvalue required as increment operand");
6284 error ("lvalue required as decrement operand");
6287 error ("lvalue required as unary %<&%> operand");
6290 error ("lvalue required in asm statement");
6297 /* *PTYPE is an incomplete array. Complete it with a domain based on
6298 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6299 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6300 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6303 complete_array_type (tree *ptype, tree initial_value, bool do_default)
6305 tree maxindex, type, main_type, elt, unqual_elt;
6306 int failure = 0, quals;
6307 hashval_t hashcode = 0;
6309 maxindex = size_zero_node;
6312 if (TREE_CODE (initial_value) == STRING_CST)
6315 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
6316 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
6318 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
6320 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
6322 if (VEC_empty (constructor_elt, v))
6326 maxindex = integer_minus_one_node;
6331 unsigned HOST_WIDE_INT cnt;
6332 constructor_elt *ce;
6334 if (VEC_index (constructor_elt, v, 0)->index)
6335 maxindex = fold_convert (sizetype,
6336 VEC_index (constructor_elt,
6338 curindex = maxindex;
6341 VEC_iterate (constructor_elt, v, cnt, ce);
6345 curindex = fold_convert (sizetype, ce->index);
6347 curindex = size_binop (PLUS_EXPR, curindex, size_one_node);
6349 if (tree_int_cst_lt (maxindex, curindex))
6350 maxindex = curindex;
6356 /* Make an error message unless that happened already. */
6357 if (initial_value != error_mark_node)
6369 elt = TREE_TYPE (type);
6370 quals = TYPE_QUALS (strip_array_types (elt));
6374 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
6376 /* Using build_distinct_type_copy and modifying things afterward instead
6377 of using build_array_type to create a new type preserves all of the
6378 TYPE_LANG_FLAG_? bits that the front end may have set. */
6379 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
6380 TREE_TYPE (main_type) = unqual_elt;
6381 TYPE_DOMAIN (main_type) = build_index_type (maxindex);
6382 layout_type (main_type);
6384 /* Make sure we have the canonical MAIN_TYPE. */
6385 hashcode = iterative_hash_object (TYPE_HASH (unqual_elt), hashcode);
6386 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type)),
6388 main_type = type_hash_canon (hashcode, main_type);
6393 type = c_build_qualified_type (main_type, quals);
6400 /* Used to help initialize the builtin-types.def table. When a type of
6401 the correct size doesn't exist, use error_mark_node instead of NULL.
6402 The later results in segfaults even when a decl using the type doesn't
6406 builtin_type_for_size (int size, bool unsignedp)
6408 tree type = lang_hooks.types.type_for_size (size, unsignedp);
6409 return type ? type : error_mark_node;
6412 /* A helper function for resolve_overloaded_builtin in resolving the
6413 overloaded __sync_ builtins. Returns a positive power of 2 if the
6414 first operand of PARAMS is a pointer to a supported data type.
6415 Returns 0 if an error is encountered. */
6418 sync_resolve_size (tree function, tree params)
6425 error ("too few arguments to function %qE", function);
6429 type = TREE_TYPE (TREE_VALUE (params));
6430 if (TREE_CODE (type) != POINTER_TYPE)
6433 type = TREE_TYPE (type);
6434 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
6437 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
6438 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
6442 error ("incompatible type for argument %d of %qE", 1, function);
6446 /* A helper function for resolve_overloaded_builtin. Adds casts to
6447 PARAMS to make arguments match up with those of FUNCTION. Drops
6448 the variadic arguments at the end. Returns false if some error
6449 was encountered; true on success. */
6452 sync_resolve_params (tree orig_function, tree function, tree params)
6454 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
6458 /* We've declared the implementation functions to use "volatile void *"
6459 as the pointer parameter, so we shouldn't get any complaints from the
6460 call to check_function_arguments what ever type the user used. */
6461 arg_types = TREE_CHAIN (arg_types);
6462 ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
6465 /* For the rest of the values, we need to cast these to FTYPE, so that we
6466 don't get warnings for passing pointer types, etc. */
6467 while (arg_types != void_list_node)
6471 params = TREE_CHAIN (params);
6474 error ("too few arguments to function %qE", orig_function);
6478 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6479 so that we get warnings for anything that doesn't match the pointer
6480 type. This isn't portable across the C and C++ front ends atm. */
6481 val = TREE_VALUE (params);
6482 val = convert (ptype, val);
6483 val = convert (TREE_VALUE (arg_types), val);
6484 TREE_VALUE (params) = val;
6486 arg_types = TREE_CHAIN (arg_types);
6490 /* The definition of these primitives is variadic, with the remaining
6491 being "an optional list of variables protected by the memory barrier".
6492 No clue what that's supposed to mean, precisely, but we consider all
6493 call-clobbered variables to be protected so we're safe. */
6494 TREE_CHAIN (params) = NULL;
6499 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6500 RESULT to make it match the type of the first pointer argument in
6504 sync_resolve_return (tree params, tree result)
6506 tree ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
6507 ptype = TYPE_MAIN_VARIANT (ptype);
6508 return convert (ptype, result);
6511 /* Some builtin functions are placeholders for other expressions. This
6512 function should be called immediately after parsing the call expression
6513 before surrounding code has committed to the type of the expression.
6515 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6516 PARAMS is the argument list for the call. The return value is non-null
6517 when expansion is complete, and null if normal processing should
6521 resolve_overloaded_builtin (tree function, tree params)
6523 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
6524 switch (DECL_BUILT_IN_CLASS (function))
6526 case BUILT_IN_NORMAL:
6529 if (targetm.resolve_overloaded_builtin)
6530 return targetm.resolve_overloaded_builtin (function, params);
6537 /* Handle BUILT_IN_NORMAL here. */
6540 case BUILT_IN_FETCH_AND_ADD_N:
6541 case BUILT_IN_FETCH_AND_SUB_N:
6542 case BUILT_IN_FETCH_AND_OR_N:
6543 case BUILT_IN_FETCH_AND_AND_N:
6544 case BUILT_IN_FETCH_AND_XOR_N:
6545 case BUILT_IN_FETCH_AND_NAND_N:
6546 case BUILT_IN_ADD_AND_FETCH_N:
6547 case BUILT_IN_SUB_AND_FETCH_N:
6548 case BUILT_IN_OR_AND_FETCH_N:
6549 case BUILT_IN_AND_AND_FETCH_N:
6550 case BUILT_IN_XOR_AND_FETCH_N:
6551 case BUILT_IN_NAND_AND_FETCH_N:
6552 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N:
6553 case BUILT_IN_VAL_COMPARE_AND_SWAP_N:
6554 case BUILT_IN_LOCK_TEST_AND_SET_N:
6555 case BUILT_IN_LOCK_RELEASE_N:
6557 int n = sync_resolve_size (function, params);
6558 tree new_function, result;
6561 return error_mark_node;
6563 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
6564 if (!sync_resolve_params (function, new_function, params))
6565 return error_mark_node;
6567 result = build_function_call (new_function, params);
6568 if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6569 && orig_code != BUILT_IN_LOCK_RELEASE_N)
6570 result = sync_resolve_return (params, result);
6580 /* Ignoring their sign, return true if two scalar types are the same. */
6582 same_scalar_type_ignoring_signedness (tree t1, tree t2)
6584 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
6586 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE)
6587 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE));
6589 /* Equality works here because c_common_signed_type uses
6590 TYPE_MAIN_VARIANT. */
6591 return lang_hooks.types.signed_type (t1)
6592 == lang_hooks.types.signed_type (t2);
6595 /* Check for missing format attributes on function pointers. LTYPE is
6596 the new type or left-hand side type. RTYPE is the old type or
6597 right-hand side type. Returns TRUE if LTYPE is missing the desired
6601 check_missing_format_attribute (tree ltype, tree rtype)
6603 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
6606 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
6607 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
6612 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
6613 if (is_attribute_p ("format", TREE_PURPOSE (la)))
6621 /* Subscripting with type char is likely to lose on a machine where
6622 chars are signed. So warn on any machine, but optionally. Don't
6623 warn for unsigned char since that type is safe. Don't warn for
6624 signed char because anyone who uses that must have done so
6625 deliberately. Furthermore, we reduce the false positive load by
6626 warning only for non-constant value of type char. */
6629 warn_array_subscript_with_type_char (tree index)
6631 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
6632 && TREE_CODE (index) != INTEGER_CST)
6633 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
6636 /* Implement -Wparentheses for the unexpected C precedence rules, to
6637 cover cases like x + y << z which readers are likely to
6638 misinterpret. We have seen an expression in which CODE is a binary
6639 operator used to combine expressions headed by CODE_LEFT and
6640 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
6641 means that that side of the expression was not formed using a
6642 binary operator, or it was enclosed in parentheses. */
6645 warn_about_parentheses (enum tree_code code, enum tree_code code_left,
6646 enum tree_code code_right)
6648 if (!warn_parentheses)
6651 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
6653 if (code_left == PLUS_EXPR || code_left == MINUS_EXPR
6654 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6655 warning (OPT_Wparentheses,
6656 "suggest parentheses around + or - inside shift");
6659 if (code == TRUTH_ORIF_EXPR)
6661 if (code_left == TRUTH_ANDIF_EXPR
6662 || code_right == TRUTH_ANDIF_EXPR)
6663 warning (OPT_Wparentheses,
6664 "suggest parentheses around && within ||");
6667 if (code == BIT_IOR_EXPR)
6669 if (code_left == BIT_AND_EXPR || code_left == BIT_XOR_EXPR
6670 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
6671 || code_right == BIT_AND_EXPR || code_right == BIT_XOR_EXPR
6672 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6673 warning (OPT_Wparentheses,
6674 "suggest parentheses around arithmetic in operand of |");
6675 /* Check cases like x|y==z */
6676 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6677 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6678 warning (OPT_Wparentheses,
6679 "suggest parentheses around comparison in operand of |");
6682 if (code == BIT_XOR_EXPR)
6684 if (code_left == BIT_AND_EXPR
6685 || code_left == PLUS_EXPR || code_left == MINUS_EXPR
6686 || code_right == BIT_AND_EXPR
6687 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6688 warning (OPT_Wparentheses,
6689 "suggest parentheses around arithmetic in operand of ^");
6690 /* Check cases like x^y==z */
6691 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6692 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6693 warning (OPT_Wparentheses,
6694 "suggest parentheses around comparison in operand of ^");
6697 if (code == BIT_AND_EXPR)
6699 if (code_left == PLUS_EXPR || code_left == MINUS_EXPR
6700 || code_right == PLUS_EXPR || code_right == MINUS_EXPR)
6701 warning (OPT_Wparentheses,
6702 "suggest parentheses around + or - in operand of &");
6703 /* Check cases like x&y==z */
6704 if (TREE_CODE_CLASS (code_left) == tcc_comparison
6705 || TREE_CODE_CLASS (code_right) == tcc_comparison)
6706 warning (OPT_Wparentheses,
6707 "suggest parentheses around comparison in operand of &");
6710 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
6711 if (TREE_CODE_CLASS (code) == tcc_comparison
6712 && (TREE_CODE_CLASS (code_left) == tcc_comparison
6713 || TREE_CODE_CLASS (code_right) == tcc_comparison))
6714 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
6715 "have their mathematical meaning");
6719 #include "gt-c-common.h"