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 the new ISO rules for pushing a new scope for `for'
405 initialization variables.
406 0: Old rules, set by -fno-for-scope.
407 2: New ISO rules, set by -ffor-scope.
408 1: Try to implement new ISO rules, but with backup compatibility
409 (and warnings). This is the default, for now. */
411 int flag_new_for_scope = 1;
413 /* Nonzero if we want to emit defined symbols with common-like linkage as
414 weak symbols where possible, in order to conform to C++ semantics.
415 Otherwise, emit them as local symbols. */
419 /* 0 means we want the preprocessor to not emit line directives for
420 the current working directory. 1 means we want it to do it. -1
421 means we should decide depending on whether debugging information
422 is being emitted or not. */
424 int flag_working_directory = -1;
426 /* Nonzero to use __cxa_atexit, rather than atexit, to register
427 destructors for local statics and global objects. */
429 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
431 /* Nonzero means make the default pedwarns warnings instead of errors.
432 The value of this flag is ignored if -pedantic is specified. */
436 /* Nonzero means to implement standard semantics for exception
437 specifications, calling unexpected if an exception is thrown that
438 doesn't match the specification. Zero means to treat them as
439 assertions and optimize accordingly, but not check them. */
441 int flag_enforce_eh_specs = 1;
443 /* Nonzero means to generate thread-safe code for initializing local
446 int flag_threadsafe_statics = 1;
448 /* Nonzero means warn about implicit declarations. */
450 int warn_implicit = 1;
452 /* Maximum template instantiation depth. This limit is rather
453 arbitrary, but it exists to limit the time it takes to notice
454 infinite template instantiations. */
456 int max_tinst_depth = 500;
460 /* The elements of `ridpointers' are identifier nodes for the reserved
461 type names and storage classes. It is indexed by a RID_... value. */
464 tree (*make_fname_decl) (tree, int);
466 /* Nonzero means the expression being parsed will never be evaluated.
467 This is a count, since unevaluated expressions can nest. */
470 /* Information about how a function name is generated. */
473 tree *const decl; /* pointer to the VAR_DECL. */
474 const unsigned rid; /* RID number for the identifier. */
475 const int pretty; /* How pretty is it? */
478 /* The three ways of getting then name of the current function. */
480 const struct fname_var_t fname_vars[] =
482 /* C99 compliant __func__, must be first. */
483 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
484 /* GCC __FUNCTION__ compliant. */
485 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
486 /* GCC __PRETTY_FUNCTION__ compliant. */
487 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
491 static int constant_fits_type_p (tree, tree);
492 static tree check_case_value (tree);
493 static bool check_case_bounds (tree, tree, tree *, tree *);
495 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
496 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
497 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
498 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
499 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
500 static tree handle_always_inline_attribute (tree *, tree, tree, int,
502 static tree handle_flatten_attribute (tree *, tree, tree, int, bool *);
503 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
504 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
505 static tree handle_externally_visible_attribute (tree *, tree, tree, int,
507 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
508 static tree handle_transparent_union_attribute (tree *, tree, tree,
510 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
511 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
512 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
513 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
514 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
516 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
517 static tree handle_weakref_attribute (tree *, tree, tree, int, bool *) ;
518 static tree handle_visibility_attribute (tree *, tree, tree, int,
520 static tree handle_tls_model_attribute (tree *, tree, tree, int,
522 static tree handle_no_instrument_function_attribute (tree *, tree,
524 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
528 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_deprecated_attribute (tree *, tree, tree, int,
532 static tree handle_vector_size_attribute (tree *, tree, tree, int,
534 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
535 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
536 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
537 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
539 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
541 static void check_function_nonnull (tree, tree);
542 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
543 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
544 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
545 static int resort_field_decl_cmp (const void *, const void *);
547 /* Table of machine-independent attributes common to all C-like languages. */
548 const struct attribute_spec c_common_attribute_table[] =
550 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
551 { "packed", 0, 0, false, false, false,
552 handle_packed_attribute },
553 { "nocommon", 0, 0, true, false, false,
554 handle_nocommon_attribute },
555 { "common", 0, 0, true, false, false,
556 handle_common_attribute },
557 /* FIXME: logically, noreturn attributes should be listed as
558 "false, true, true" and apply to function types. But implementing this
559 would require all the places in the compiler that use TREE_THIS_VOLATILE
560 on a decl to identify non-returning functions to be located and fixed
561 to check the function type instead. */
562 { "noreturn", 0, 0, true, false, false,
563 handle_noreturn_attribute },
564 { "volatile", 0, 0, true, false, false,
565 handle_noreturn_attribute },
566 { "noinline", 0, 0, true, false, false,
567 handle_noinline_attribute },
568 { "always_inline", 0, 0, true, false, false,
569 handle_always_inline_attribute },
570 { "flatten", 0, 0, true, false, false,
571 handle_flatten_attribute },
572 { "used", 0, 0, true, false, false,
573 handle_used_attribute },
574 { "unused", 0, 0, false, false, false,
575 handle_unused_attribute },
576 { "externally_visible", 0, 0, true, false, false,
577 handle_externally_visible_attribute },
578 /* The same comments as for noreturn attributes apply to const ones. */
579 { "const", 0, 0, true, false, false,
580 handle_const_attribute },
581 { "transparent_union", 0, 0, false, false, false,
582 handle_transparent_union_attribute },
583 { "constructor", 0, 0, true, false, false,
584 handle_constructor_attribute },
585 { "destructor", 0, 0, true, false, false,
586 handle_destructor_attribute },
587 { "mode", 1, 1, false, true, false,
588 handle_mode_attribute },
589 { "section", 1, 1, true, false, false,
590 handle_section_attribute },
591 { "aligned", 0, 1, false, false, false,
592 handle_aligned_attribute },
593 { "weak", 0, 0, true, false, false,
594 handle_weak_attribute },
595 { "alias", 1, 1, true, false, false,
596 handle_alias_attribute },
597 { "weakref", 0, 1, true, false, false,
598 handle_weakref_attribute },
599 { "no_instrument_function", 0, 0, true, false, false,
600 handle_no_instrument_function_attribute },
601 { "malloc", 0, 0, true, false, false,
602 handle_malloc_attribute },
603 { "returns_twice", 0, 0, true, false, false,
604 handle_returns_twice_attribute },
605 { "no_stack_limit", 0, 0, true, false, false,
606 handle_no_limit_stack_attribute },
607 { "pure", 0, 0, true, false, false,
608 handle_pure_attribute },
609 /* For internal use (marking of builtins) only. The name contains space
610 to prevent its usage in source code. */
611 { "no vops", 0, 0, true, false, false,
612 handle_novops_attribute },
613 { "deprecated", 0, 0, false, false, false,
614 handle_deprecated_attribute },
615 { "vector_size", 1, 1, false, true, false,
616 handle_vector_size_attribute },
617 { "visibility", 1, 1, false, false, false,
618 handle_visibility_attribute },
619 { "tls_model", 1, 1, true, false, false,
620 handle_tls_model_attribute },
621 { "nonnull", 0, -1, false, true, true,
622 handle_nonnull_attribute },
623 { "nothrow", 0, 0, true, false, false,
624 handle_nothrow_attribute },
625 { "may_alias", 0, 0, false, true, false, NULL },
626 { "cleanup", 1, 1, true, false, false,
627 handle_cleanup_attribute },
628 { "warn_unused_result", 0, 0, false, true, true,
629 handle_warn_unused_result_attribute },
630 { "sentinel", 0, 1, false, true, true,
631 handle_sentinel_attribute },
632 { NULL, 0, 0, false, false, false, NULL }
635 /* Give the specifications for the format attributes, used by C and all
638 const struct attribute_spec c_common_format_attribute_table[] =
640 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
641 { "format", 3, 3, false, true, true,
642 handle_format_attribute },
643 { "format_arg", 1, 1, false, true, true,
644 handle_format_arg_attribute },
645 { NULL, 0, 0, false, false, false, NULL }
648 /* Push current bindings for the function name VAR_DECLS. */
651 start_fname_decls (void)
654 tree saved = NULL_TREE;
656 for (ix = 0; fname_vars[ix].decl; ix++)
658 tree decl = *fname_vars[ix].decl;
662 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
663 *fname_vars[ix].decl = NULL_TREE;
666 if (saved || saved_function_name_decls)
667 /* Normally they'll have been NULL, so only push if we've got a
668 stack, or they are non-NULL. */
669 saved_function_name_decls = tree_cons (saved, NULL_TREE,
670 saved_function_name_decls);
673 /* Finish up the current bindings, adding them into the current function's
674 statement tree. This must be done _before_ finish_stmt_tree is called.
675 If there is no current function, we must be at file scope and no statements
676 are involved. Pop the previous bindings. */
679 finish_fname_decls (void)
682 tree stmts = NULL_TREE;
683 tree stack = saved_function_name_decls;
685 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
686 append_to_statement_list (TREE_VALUE (stack), &stmts);
690 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
692 if (TREE_CODE (*bodyp) == BIND_EXPR)
693 bodyp = &BIND_EXPR_BODY (*bodyp);
695 append_to_statement_list_force (*bodyp, &stmts);
699 for (ix = 0; fname_vars[ix].decl; ix++)
700 *fname_vars[ix].decl = NULL_TREE;
704 /* We had saved values, restore them. */
707 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
709 tree decl = TREE_PURPOSE (saved);
710 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
712 *fname_vars[ix].decl = decl;
714 stack = TREE_CHAIN (stack);
716 saved_function_name_decls = stack;
719 /* Return the text name of the current function, suitably prettified
720 by PRETTY_P. Return string must be freed by caller. */
723 fname_as_string (int pretty_p)
725 const char *name = "top level";
735 if (current_function_decl)
736 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
738 if (c_lex_string_translate)
740 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
741 cpp_string cstr = { 0, 0 }, strname;
743 namep = XNEWVEC (char, len);
744 snprintf (namep, len, "\"%s\"", name);
745 strname.text = (unsigned char *) namep;
746 strname.len = len - 1;
748 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
751 return (char *) cstr.text;
755 namep = xstrdup (name);
760 /* Expand DECL if it declares an entity not handled by the
764 c_expand_decl (tree decl)
766 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
768 /* Let the back-end know about this variable. */
769 if (!anon_aggr_type_p (TREE_TYPE (decl)))
770 emit_local_var (decl);
772 expand_anon_union_decl (decl, NULL_TREE,
773 DECL_ANON_UNION_ELEMS (decl));
782 /* Return the VAR_DECL for a const char array naming the current
783 function. If the VAR_DECL has not yet been created, create it
784 now. RID indicates how it should be formatted and IDENTIFIER_NODE
785 ID is its name (unfortunately C and C++ hold the RID values of
786 keywords in different places, so we can't derive RID from ID in
787 this language independent code. */
790 fname_decl (unsigned int rid, tree id)
793 tree decl = NULL_TREE;
795 for (ix = 0; fname_vars[ix].decl; ix++)
796 if (fname_vars[ix].rid == rid)
799 decl = *fname_vars[ix].decl;
802 /* If a tree is built here, it would normally have the lineno of
803 the current statement. Later this tree will be moved to the
804 beginning of the function and this line number will be wrong.
805 To avoid this problem set the lineno to 0 here; that prevents
806 it from appearing in the RTL. */
808 location_t saved_location = input_location;
809 #ifdef USE_MAPPED_LOCATION
810 input_location = UNKNOWN_LOCATION;
815 stmts = push_stmt_list ();
816 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
817 stmts = pop_stmt_list (stmts);
818 if (!IS_EMPTY_STMT (stmts))
819 saved_function_name_decls
820 = tree_cons (decl, stmts, saved_function_name_decls);
821 *fname_vars[ix].decl = decl;
822 input_location = saved_location;
824 if (!ix && !current_function_decl)
825 pedwarn ("%qD is not defined outside of function scope", decl);
830 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
833 fix_string_type (tree value)
835 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
836 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
837 int length = TREE_STRING_LENGTH (value);
839 tree e_type, i_type, a_type;
841 /* Compute the number of elements, for the array type. */
842 nchars = wide_flag ? length / wchar_bytes : length;
844 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
845 limit in C++98 Annex B is very large (65536) and is not normative,
846 so we do not diagnose it (warn_overlength_strings is forced off
847 in c_common_post_options). */
848 if (warn_overlength_strings)
850 const int nchars_max = flag_isoc99 ? 4095 : 509;
851 const int relevant_std = flag_isoc99 ? 99 : 90;
852 if (nchars - 1 > nchars_max)
853 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
854 separate the %d from the 'C'. 'ISO' should not be
855 translated, but it may be moved after 'C%d' in languages
856 where modifiers follow nouns. */
857 pedwarn ("string length %qd is greater than the length %qd "
858 "ISO C%d compilers are required to support",
859 nchars - 1, nchars_max, relevant_std);
862 /* Create the array type for the string constant. The ISO C++
863 standard says that a string literal has type `const char[N]' or
864 `const wchar_t[N]'. We use the same logic when invoked as a C
865 front-end with -Wwrite-strings.
866 ??? We should change the type of an expression depending on the
867 state of a warning flag. We should just be warning -- see how
868 this is handled in the C++ front-end for the deprecated implicit
869 conversion from string literals to `char*' or `wchar_t*'.
871 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
872 array type being the unqualified version of that type.
873 Therefore, if we are constructing an array of const char, we must
874 construct the matching unqualified array type first. The C front
875 end does not require this, but it does no harm, so we do it
877 e_type = wide_flag ? wchar_type_node : char_type_node;
878 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
879 a_type = build_array_type (e_type, i_type);
880 if (c_dialect_cxx() || warn_write_strings)
881 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
883 TREE_TYPE (value) = a_type;
884 TREE_CONSTANT (value) = 1;
885 TREE_INVARIANT (value) = 1;
886 TREE_READONLY (value) = 1;
887 TREE_STATIC (value) = 1;
891 /* Print a warning if a constant expression had overflow in folding.
892 Invoke this function on every expression that the language
893 requires to be a constant expression.
894 Note the ANSI C standard says it is erroneous for a
895 constant expression to overflow. */
898 constant_expression_warning (tree value)
900 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
901 || TREE_CODE (value) == VECTOR_CST
902 || TREE_CODE (value) == COMPLEX_CST)
903 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
904 pedwarn ("overflow in constant expression");
907 /* Print a warning if an expression had overflow in folding.
908 Invoke this function on every expression that
909 (1) appears in the source code, and
910 (2) might be a constant expression that overflowed, and
911 (3) is not already checked by convert_and_check;
912 however, do not invoke this function on operands of explicit casts. */
915 overflow_warning (tree value)
917 if ((TREE_CODE (value) == INTEGER_CST
918 || (TREE_CODE (value) == COMPLEX_CST
919 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
920 && TREE_OVERFLOW (value))
922 TREE_OVERFLOW (value) = 0;
923 if (skip_evaluation == 0)
924 warning (0, "integer overflow in expression");
926 else if ((TREE_CODE (value) == REAL_CST
927 || (TREE_CODE (value) == COMPLEX_CST
928 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
929 && TREE_OVERFLOW (value))
931 TREE_OVERFLOW (value) = 0;
932 if (skip_evaluation == 0)
933 warning (0, "floating point overflow in expression");
935 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
937 TREE_OVERFLOW (value) = 0;
938 if (skip_evaluation == 0)
939 warning (0, "vector overflow in expression");
943 /* Print a warning if a large constant is truncated to unsigned,
944 or if -Wconversion is used and a constant < 0 is converted to unsigned.
945 Invoke this function on every expression that might be implicitly
946 converted to an unsigned type. */
949 unsigned_conversion_warning (tree result, tree operand)
951 tree type = TREE_TYPE (result);
953 if (TREE_CODE (operand) == INTEGER_CST
954 && TREE_CODE (type) == INTEGER_TYPE
955 && TYPE_UNSIGNED (type)
956 && skip_evaluation == 0
957 && !int_fits_type_p (operand, type))
959 if (!int_fits_type_p (operand, c_common_signed_type (type)))
960 /* This detects cases like converting -129 or 256 to unsigned char. */
961 warning (0, "large integer implicitly truncated to unsigned type");
963 warning (OPT_Wconversion,
964 "negative integer implicitly converted to unsigned type");
968 /* Print a warning about casts that might indicate violation
969 of strict aliasing rules if -Wstrict-aliasing is used and
970 strict aliasing mode is in effect. otype is the original
971 TREE_TYPE of expr, and type the type we're casting to. */
974 strict_aliasing_warning(tree otype, tree type, tree expr)
976 if (flag_strict_aliasing && warn_strict_aliasing
977 && POINTER_TYPE_P (type) && POINTER_TYPE_P (otype)
978 && TREE_CODE (expr) == ADDR_EXPR
979 && (DECL_P (TREE_OPERAND (expr, 0))
980 || handled_component_p (TREE_OPERAND (expr, 0)))
981 && !VOID_TYPE_P (TREE_TYPE (type)))
983 /* Casting the address of an object to non void pointer. Warn
984 if the cast breaks type based aliasing. */
985 if (!COMPLETE_TYPE_P (TREE_TYPE (type)))
986 warning (OPT_Wstrict_aliasing, "type-punning to incomplete type "
987 "might break strict-aliasing rules");
990 HOST_WIDE_INT set1 = get_alias_set (TREE_TYPE (TREE_OPERAND (expr, 0)));
991 HOST_WIDE_INT set2 = get_alias_set (TREE_TYPE (type));
993 if (!alias_sets_conflict_p (set1, set2))
994 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
995 "pointer will break strict-aliasing rules");
996 else if (warn_strict_aliasing > 1
997 && !alias_sets_might_conflict_p (set1, set2))
998 warning (OPT_Wstrict_aliasing, "dereferencing type-punned "
999 "pointer might break strict-aliasing rules");
1005 /* Print a warning about if (); or if () .. else; constructs
1006 via the special empty statement node that we create. INNER_THEN
1007 and INNER_ELSE are the statement lists of the if and the else
1011 empty_body_warning (tree inner_then, tree inner_else)
1015 if (TREE_CODE (inner_then) == STATEMENT_LIST
1016 && STATEMENT_LIST_TAIL (inner_then))
1017 inner_then = STATEMENT_LIST_TAIL (inner_then)->stmt;
1019 if (inner_else && TREE_CODE (inner_else) == STATEMENT_LIST
1020 && STATEMENT_LIST_TAIL (inner_else))
1021 inner_else = STATEMENT_LIST_TAIL (inner_else)->stmt;
1023 if (IS_EMPTY_STMT (inner_then) && !inner_else)
1024 warning (OPT_Wextra, "%Hempty body in an if-statement",
1025 EXPR_LOCUS (inner_then));
1027 if (inner_else && IS_EMPTY_STMT (inner_else))
1028 warning (OPT_Wextra, "%Hempty body in an else-statement",
1029 EXPR_LOCUS (inner_else));
1034 /* Nonzero if constant C has a value that is permissible
1035 for type TYPE (an INTEGER_TYPE). */
1038 constant_fits_type_p (tree c, tree type)
1040 if (TREE_CODE (c) == INTEGER_CST)
1041 return int_fits_type_p (c, type);
1043 c = convert (type, c);
1044 return !TREE_OVERFLOW (c);
1047 /* Nonzero if vector types T1 and T2 can be converted to each other
1048 without an explicit cast. */
1050 vector_types_convertible_p (tree t1, tree t2)
1052 return targetm.vector_opaque_p (t1)
1053 || targetm.vector_opaque_p (t2)
1054 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
1055 && (TREE_CODE (TREE_TYPE (t1)) != REAL_TYPE ||
1056 TYPE_PRECISION (t1) == TYPE_PRECISION (t2))
1057 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
1058 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
1061 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1062 Invoke this function on every expression that is converted implicitly,
1063 i.e. because of language rules and not because of an explicit cast. */
1066 convert_and_check (tree type, tree expr)
1068 tree t = convert (type, expr);
1069 if (TREE_CODE (t) == INTEGER_CST)
1071 if (TREE_OVERFLOW (t))
1073 TREE_OVERFLOW (t) = 0;
1075 /* Do not diagnose overflow in a constant expression merely
1076 because a conversion overflowed. */
1077 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1079 /* No warning for converting 0x80000000 to int. */
1080 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1081 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1082 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1083 /* If EXPR fits in the unsigned version of TYPE,
1084 don't warn unless pedantic. */
1086 || TYPE_UNSIGNED (type)
1087 || !constant_fits_type_p (expr,
1088 c_common_unsigned_type (type)))
1089 && skip_evaluation == 0)
1090 warning (0, "overflow in implicit constant conversion");
1093 unsigned_conversion_warning (t, expr);
1098 /* A node in a list that describes references to variables (EXPR), which are
1099 either read accesses if WRITER is zero, or write accesses, in which case
1100 WRITER is the parent of EXPR. */
1107 /* Used to implement a cache the results of a call to verify_tree. We only
1108 use this for SAVE_EXPRs. */
1111 struct tlist_cache *next;
1112 struct tlist *cache_before_sp;
1113 struct tlist *cache_after_sp;
1117 /* Obstack to use when allocating tlist structures, and corresponding
1119 static struct obstack tlist_obstack;
1120 static char *tlist_firstobj = 0;
1122 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1124 static struct tlist *warned_ids;
1125 /* SAVE_EXPRs need special treatment. We process them only once and then
1126 cache the results. */
1127 static struct tlist_cache *save_expr_cache;
1129 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1130 static void merge_tlist (struct tlist **, struct tlist *, int);
1131 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1132 static int warning_candidate_p (tree);
1133 static void warn_for_collisions (struct tlist *);
1134 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1135 static struct tlist *new_tlist (struct tlist *, tree, tree);
1137 /* Create a new struct tlist and fill in its fields. */
1138 static struct tlist *
1139 new_tlist (struct tlist *next, tree t, tree writer)
1142 l = XOBNEW (&tlist_obstack, struct tlist);
1149 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1150 is nonnull, we ignore any node we find which has a writer equal to it. */
1153 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1157 struct tlist *next = add->next;
1160 if (!exclude_writer || add->writer != exclude_writer)
1161 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1166 /* Merge the nodes of ADD into TO. This merging process is done so that for
1167 each variable that already exists in TO, no new node is added; however if
1168 there is a write access recorded in ADD, and an occurrence on TO is only
1169 a read access, then the occurrence in TO will be modified to record the
1173 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1175 struct tlist **end = to;
1178 end = &(*end)->next;
1184 struct tlist *next = add->next;
1186 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1187 if (tmp2->expr == add->expr)
1191 tmp2->writer = add->writer;
1195 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1196 end = &(*end)->next;
1203 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1204 references in list LIST conflict with it, excluding reads if ONLY writers
1208 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1213 /* Avoid duplicate warnings. */
1214 for (tmp = warned_ids; tmp; tmp = tmp->next)
1215 if (tmp->expr == written)
1220 if (list->expr == written
1221 && list->writer != writer
1222 && (!only_writes || list->writer)
1223 && DECL_NAME (list->expr))
1225 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1226 warning (0, "operation on %qE may be undefined", list->expr);
1232 /* Given a list LIST of references to variables, find whether any of these
1233 can cause conflicts due to missing sequence points. */
1236 warn_for_collisions (struct tlist *list)
1240 for (tmp = list; tmp; tmp = tmp->next)
1243 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1247 /* Return nonzero if X is a tree that can be verified by the sequence point
1250 warning_candidate_p (tree x)
1252 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1255 /* Walk the tree X, and record accesses to variables. If X is written by the
1256 parent tree, WRITER is the parent.
1257 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1258 expression or its only operand forces a sequence point, then everything up
1259 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1261 Once we return, we will have emitted warnings if any subexpression before
1262 such a sequence point could be undefined. On a higher level, however, the
1263 sequence point may not be relevant, and we'll merge the two lists.
1265 Example: (b++, a) + b;
1266 The call that processes the COMPOUND_EXPR will store the increment of B
1267 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1268 processes the PLUS_EXPR will need to merge the two lists so that
1269 eventually, all accesses end up on the same list (and we'll warn about the
1270 unordered subexpressions b++ and b.
1272 A note on merging. If we modify the former example so that our expression
1275 care must be taken not simply to add all three expressions into the final
1276 PNO_SP list. The function merge_tlist takes care of that by merging the
1277 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1278 way, so that no more than one access to B is recorded. */
1281 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1284 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1285 enum tree_code code;
1286 enum tree_code_class cl;
1288 /* X may be NULL if it is the operand of an empty statement expression
1294 code = TREE_CODE (x);
1295 cl = TREE_CODE_CLASS (code);
1297 if (warning_candidate_p (x))
1299 *pno_sp = new_tlist (*pno_sp, x, writer);
1309 case TRUTH_ANDIF_EXPR:
1310 case TRUTH_ORIF_EXPR:
1311 tmp_before = tmp_nosp = tmp_list3 = 0;
1312 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1313 warn_for_collisions (tmp_nosp);
1314 merge_tlist (pbefore_sp, tmp_before, 0);
1315 merge_tlist (pbefore_sp, tmp_nosp, 0);
1316 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1317 merge_tlist (pbefore_sp, tmp_list3, 0);
1321 tmp_before = tmp_list2 = 0;
1322 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1323 warn_for_collisions (tmp_list2);
1324 merge_tlist (pbefore_sp, tmp_before, 0);
1325 merge_tlist (pbefore_sp, tmp_list2, 1);
1327 tmp_list3 = tmp_nosp = 0;
1328 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1329 warn_for_collisions (tmp_nosp);
1330 merge_tlist (pbefore_sp, tmp_list3, 0);
1332 tmp_list3 = tmp_list2 = 0;
1333 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1334 warn_for_collisions (tmp_list2);
1335 merge_tlist (pbefore_sp, tmp_list3, 0);
1336 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1337 two first, to avoid warning for (a ? b++ : b++). */
1338 merge_tlist (&tmp_nosp, tmp_list2, 0);
1339 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1342 case PREDECREMENT_EXPR:
1343 case PREINCREMENT_EXPR:
1344 case POSTDECREMENT_EXPR:
1345 case POSTINCREMENT_EXPR:
1346 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1350 tmp_before = tmp_nosp = tmp_list3 = 0;
1351 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1352 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1353 /* Expressions inside the LHS are not ordered wrt. the sequence points
1354 in the RHS. Example:
1356 Despite the fact that the modification of "a" is in the before_sp
1357 list (tmp_before), it conflicts with the use of "a" in the LHS.
1358 We can handle this by adding the contents of tmp_list3
1359 to those of tmp_before, and redoing the collision warnings for that
1361 add_tlist (&tmp_before, tmp_list3, x, 1);
1362 warn_for_collisions (tmp_before);
1363 /* Exclude the LHS itself here; we first have to merge it into the
1364 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1365 didn't exclude the LHS, we'd get it twice, once as a read and once
1367 add_tlist (pno_sp, tmp_list3, x, 0);
1368 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1370 merge_tlist (pbefore_sp, tmp_before, 0);
1371 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1372 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1373 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1377 /* We need to warn about conflicts among arguments and conflicts between
1378 args and the function address. Side effects of the function address,
1379 however, are not ordered by the sequence point of the call. */
1380 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1381 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1382 if (TREE_OPERAND (x, 1))
1383 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1384 merge_tlist (&tmp_list3, tmp_list2, 0);
1385 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1386 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1387 warn_for_collisions (tmp_before);
1388 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1392 /* Scan all the list, e.g. indices of multi dimensional array. */
1395 tmp_before = tmp_nosp = 0;
1396 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1397 merge_tlist (&tmp_nosp, tmp_before, 0);
1398 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1405 struct tlist_cache *t;
1406 for (t = save_expr_cache; t; t = t->next)
1412 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1413 t->next = save_expr_cache;
1415 save_expr_cache = t;
1417 tmp_before = tmp_nosp = 0;
1418 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1419 warn_for_collisions (tmp_nosp);
1424 struct tlist *t = tmp_nosp;
1426 merge_tlist (&tmp_list3, t, 0);
1428 t->cache_before_sp = tmp_before;
1429 t->cache_after_sp = tmp_list3;
1431 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1432 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1437 /* For other expressions, simply recurse on their operands.
1438 Manual tail recursion for unary expressions.
1439 Other non-expressions need not be processed. */
1440 if (cl == tcc_unary)
1442 x = TREE_OPERAND (x, 0);
1446 else if (IS_EXPR_CODE_CLASS (cl))
1449 int max = TREE_CODE_LENGTH (TREE_CODE (x));
1450 for (lp = 0; lp < max; lp++)
1452 tmp_before = tmp_nosp = 0;
1453 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
1454 merge_tlist (&tmp_nosp, tmp_before, 0);
1455 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1462 /* Try to warn for undefined behavior in EXPR due to missing sequence
1466 verify_sequence_points (tree expr)
1468 struct tlist *before_sp = 0, *after_sp = 0;
1471 save_expr_cache = 0;
1472 if (tlist_firstobj == 0)
1474 gcc_obstack_init (&tlist_obstack);
1475 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1478 verify_tree (expr, &before_sp, &after_sp, 0);
1479 warn_for_collisions (after_sp);
1480 obstack_free (&tlist_obstack, tlist_firstobj);
1483 /* Validate the expression after `case' and apply default promotions. */
1486 check_case_value (tree value)
1488 if (value == NULL_TREE)
1491 /* ??? Can we ever get nops here for a valid case value? We
1493 STRIP_TYPE_NOPS (value);
1494 /* In C++, the following is allowed:
1497 switch (...) { case i: ... }
1499 So, we try to reduce the VALUE to a constant that way. */
1500 if (c_dialect_cxx ())
1502 value = decl_constant_value (value);
1503 STRIP_TYPE_NOPS (value);
1504 value = fold (value);
1507 if (TREE_CODE (value) == INTEGER_CST)
1508 /* Promote char or short to int. */
1509 value = perform_integral_promotions (value);
1510 else if (value != error_mark_node)
1512 error ("case label does not reduce to an integer constant");
1513 value = error_mark_node;
1516 constant_expression_warning (value);
1521 /* See if the case values LOW and HIGH are in the range of the original
1522 type (i.e. before the default conversion to int) of the switch testing
1524 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1525 the type before promoting it. CASE_LOW_P is a pointer to the lower
1526 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1527 if the case is not a case range.
1528 The caller has to make sure that we are not called with NULL for
1529 CASE_LOW_P (i.e. the default case).
1530 Returns true if the case label is in range of ORIG_TYPE (saturated or
1531 untouched) or false if the label is out of range. */
1534 check_case_bounds (tree type, tree orig_type,
1535 tree *case_low_p, tree *case_high_p)
1537 tree min_value, max_value;
1538 tree case_low = *case_low_p;
1539 tree case_high = case_high_p ? *case_high_p : case_low;
1541 /* If there was a problem with the original type, do nothing. */
1542 if (orig_type == error_mark_node)
1545 min_value = TYPE_MIN_VALUE (orig_type);
1546 max_value = TYPE_MAX_VALUE (orig_type);
1548 /* Case label is less than minimum for type. */
1549 if (tree_int_cst_compare (case_low, min_value) < 0
1550 && tree_int_cst_compare (case_high, min_value) < 0)
1552 warning (0, "case label value is less than minimum value for type");
1556 /* Case value is greater than maximum for type. */
1557 if (tree_int_cst_compare (case_low, max_value) > 0
1558 && tree_int_cst_compare (case_high, max_value) > 0)
1560 warning (0, "case label value exceeds maximum value for type");
1564 /* Saturate lower case label value to minimum. */
1565 if (tree_int_cst_compare (case_high, min_value) >= 0
1566 && tree_int_cst_compare (case_low, min_value) < 0)
1568 warning (0, "lower value in case label range"
1569 " less than minimum value for type");
1570 case_low = min_value;
1573 /* Saturate upper case label value to maximum. */
1574 if (tree_int_cst_compare (case_low, max_value) <= 0
1575 && tree_int_cst_compare (case_high, max_value) > 0)
1577 warning (0, "upper value in case label range"
1578 " exceeds maximum value for type");
1579 case_high = max_value;
1582 if (*case_low_p != case_low)
1583 *case_low_p = convert (type, case_low);
1584 if (case_high_p && *case_high_p != case_high)
1585 *case_high_p = convert (type, case_high);
1590 /* Return an integer type with BITS bits of precision,
1591 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1594 c_common_type_for_size (unsigned int bits, int unsignedp)
1596 if (bits == TYPE_PRECISION (integer_type_node))
1597 return unsignedp ? unsigned_type_node : integer_type_node;
1599 if (bits == TYPE_PRECISION (signed_char_type_node))
1600 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1602 if (bits == TYPE_PRECISION (short_integer_type_node))
1603 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1605 if (bits == TYPE_PRECISION (long_integer_type_node))
1606 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1608 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1609 return (unsignedp ? long_long_unsigned_type_node
1610 : long_long_integer_type_node);
1612 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1613 return (unsignedp ? widest_unsigned_literal_type_node
1614 : widest_integer_literal_type_node);
1616 if (bits <= TYPE_PRECISION (intQI_type_node))
1617 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1619 if (bits <= TYPE_PRECISION (intHI_type_node))
1620 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1622 if (bits <= TYPE_PRECISION (intSI_type_node))
1623 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1625 if (bits <= TYPE_PRECISION (intDI_type_node))
1626 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1631 /* Used for communication between c_common_type_for_mode and
1632 c_register_builtin_type. */
1633 static GTY(()) tree registered_builtin_types;
1635 /* Return a data type that has machine mode MODE.
1636 If the mode is an integer,
1637 then UNSIGNEDP selects between signed and unsigned types. */
1640 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1644 if (mode == TYPE_MODE (integer_type_node))
1645 return unsignedp ? unsigned_type_node : integer_type_node;
1647 if (mode == TYPE_MODE (signed_char_type_node))
1648 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1650 if (mode == TYPE_MODE (short_integer_type_node))
1651 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1653 if (mode == TYPE_MODE (long_integer_type_node))
1654 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1656 if (mode == TYPE_MODE (long_long_integer_type_node))
1657 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1659 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1660 return unsignedp ? widest_unsigned_literal_type_node
1661 : widest_integer_literal_type_node;
1664 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1667 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1670 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1673 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1675 #if HOST_BITS_PER_WIDE_INT >= 64
1676 if (mode == TYPE_MODE (intTI_type_node))
1677 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1680 if (mode == TYPE_MODE (float_type_node))
1681 return float_type_node;
1683 if (mode == TYPE_MODE (double_type_node))
1684 return double_type_node;
1686 if (mode == TYPE_MODE (long_double_type_node))
1687 return long_double_type_node;
1689 if (mode == TYPE_MODE (void_type_node))
1690 return void_type_node;
1692 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1694 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1695 : make_signed_type (GET_MODE_PRECISION (mode)));
1697 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1699 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1700 : make_signed_type (GET_MODE_PRECISION (mode)));
1702 if (COMPLEX_MODE_P (mode))
1704 enum machine_mode inner_mode;
1707 if (mode == TYPE_MODE (complex_float_type_node))
1708 return complex_float_type_node;
1709 if (mode == TYPE_MODE (complex_double_type_node))
1710 return complex_double_type_node;
1711 if (mode == TYPE_MODE (complex_long_double_type_node))
1712 return complex_long_double_type_node;
1714 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
1715 return complex_integer_type_node;
1717 inner_mode = GET_MODE_INNER (mode);
1718 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1719 if (inner_type != NULL_TREE)
1720 return build_complex_type (inner_type);
1722 else if (VECTOR_MODE_P (mode))
1724 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1725 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1726 if (inner_type != NULL_TREE)
1727 return build_vector_type_for_mode (inner_type, mode);
1730 if (mode == TYPE_MODE (dfloat32_type_node))
1731 return dfloat32_type_node;
1732 if (mode == TYPE_MODE (dfloat64_type_node))
1733 return dfloat64_type_node;
1734 if (mode == TYPE_MODE (dfloat128_type_node))
1735 return dfloat128_type_node;
1737 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1738 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1739 return TREE_VALUE (t);
1744 /* Return an unsigned type the same as TYPE in other respects. */
1746 c_common_unsigned_type (tree type)
1748 tree type1 = TYPE_MAIN_VARIANT (type);
1749 if (type1 == signed_char_type_node || type1 == char_type_node)
1750 return unsigned_char_type_node;
1751 if (type1 == integer_type_node)
1752 return unsigned_type_node;
1753 if (type1 == short_integer_type_node)
1754 return short_unsigned_type_node;
1755 if (type1 == long_integer_type_node)
1756 return long_unsigned_type_node;
1757 if (type1 == long_long_integer_type_node)
1758 return long_long_unsigned_type_node;
1759 if (type1 == widest_integer_literal_type_node)
1760 return widest_unsigned_literal_type_node;
1761 #if HOST_BITS_PER_WIDE_INT >= 64
1762 if (type1 == intTI_type_node)
1763 return unsigned_intTI_type_node;
1765 if (type1 == intDI_type_node)
1766 return unsigned_intDI_type_node;
1767 if (type1 == intSI_type_node)
1768 return unsigned_intSI_type_node;
1769 if (type1 == intHI_type_node)
1770 return unsigned_intHI_type_node;
1771 if (type1 == intQI_type_node)
1772 return unsigned_intQI_type_node;
1774 return c_common_signed_or_unsigned_type (1, type);
1777 /* Return a signed type the same as TYPE in other respects. */
1780 c_common_signed_type (tree type)
1782 tree type1 = TYPE_MAIN_VARIANT (type);
1783 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1784 return signed_char_type_node;
1785 if (type1 == unsigned_type_node)
1786 return integer_type_node;
1787 if (type1 == short_unsigned_type_node)
1788 return short_integer_type_node;
1789 if (type1 == long_unsigned_type_node)
1790 return long_integer_type_node;
1791 if (type1 == long_long_unsigned_type_node)
1792 return long_long_integer_type_node;
1793 if (type1 == widest_unsigned_literal_type_node)
1794 return widest_integer_literal_type_node;
1795 #if HOST_BITS_PER_WIDE_INT >= 64
1796 if (type1 == unsigned_intTI_type_node)
1797 return intTI_type_node;
1799 if (type1 == unsigned_intDI_type_node)
1800 return intDI_type_node;
1801 if (type1 == unsigned_intSI_type_node)
1802 return intSI_type_node;
1803 if (type1 == unsigned_intHI_type_node)
1804 return intHI_type_node;
1805 if (type1 == unsigned_intQI_type_node)
1806 return intQI_type_node;
1808 return c_common_signed_or_unsigned_type (0, type);
1811 /* Return a type the same as TYPE except unsigned or
1812 signed according to UNSIGNEDP. */
1815 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1817 if (!INTEGRAL_TYPE_P (type)
1818 || TYPE_UNSIGNED (type) == unsignedp)
1821 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1822 the precision; they have precision set to match their range, but
1823 may use a wider mode to match an ABI. If we change modes, we may
1824 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1825 the precision as well, so as to yield correct results for
1826 bit-field types. C++ does not have these separate bit-field
1827 types, and producing a signed or unsigned variant of an
1828 ENUMERAL_TYPE may cause other problems as well. */
1830 #define TYPE_OK(node) \
1831 (TYPE_MODE (type) == TYPE_MODE (node) \
1832 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1833 if (TYPE_OK (signed_char_type_node))
1834 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1835 if (TYPE_OK (integer_type_node))
1836 return unsignedp ? unsigned_type_node : integer_type_node;
1837 if (TYPE_OK (short_integer_type_node))
1838 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1839 if (TYPE_OK (long_integer_type_node))
1840 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1841 if (TYPE_OK (long_long_integer_type_node))
1842 return (unsignedp ? long_long_unsigned_type_node
1843 : long_long_integer_type_node);
1844 if (TYPE_OK (widest_integer_literal_type_node))
1845 return (unsignedp ? widest_unsigned_literal_type_node
1846 : widest_integer_literal_type_node);
1848 #if HOST_BITS_PER_WIDE_INT >= 64
1849 if (TYPE_OK (intTI_type_node))
1850 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1852 if (TYPE_OK (intDI_type_node))
1853 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1854 if (TYPE_OK (intSI_type_node))
1855 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1856 if (TYPE_OK (intHI_type_node))
1857 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1858 if (TYPE_OK (intQI_type_node))
1859 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1862 if (c_dialect_cxx ())
1865 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
1868 /* The C version of the register_builtin_type langhook. */
1871 c_register_builtin_type (tree type, const char* name)
1875 decl = build_decl (TYPE_DECL, get_identifier (name), type);
1876 DECL_ARTIFICIAL (decl) = 1;
1877 if (!TYPE_NAME (type))
1878 TYPE_NAME (type) = decl;
1881 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
1885 /* Return the minimum number of bits needed to represent VALUE in a
1886 signed or unsigned type, UNSIGNEDP says which. */
1889 min_precision (tree value, int unsignedp)
1893 /* If the value is negative, compute its negative minus 1. The latter
1894 adjustment is because the absolute value of the largest negative value
1895 is one larger than the largest positive value. This is equivalent to
1896 a bit-wise negation, so use that operation instead. */
1898 if (tree_int_cst_sgn (value) < 0)
1899 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
1901 /* Return the number of bits needed, taking into account the fact
1902 that we need one more bit for a signed than unsigned type. */
1904 if (integer_zerop (value))
1907 log = tree_floor_log2 (value);
1909 return log + 1 + !unsignedp;
1912 /* Print an error message for invalid operands to arith operation
1916 binary_op_error (enum tree_code code)
1923 opname = "+"; break;
1925 opname = "-"; break;
1927 opname = "*"; break;
1929 opname = "max"; break;
1931 opname = "min"; break;
1933 opname = "=="; break;
1935 opname = "!="; break;
1937 opname = "<="; break;
1939 opname = ">="; break;
1941 opname = "<"; break;
1943 opname = ">"; break;
1945 opname = "<<"; break;
1947 opname = ">>"; break;
1948 case TRUNC_MOD_EXPR:
1949 case FLOOR_MOD_EXPR:
1950 opname = "%"; break;
1951 case TRUNC_DIV_EXPR:
1952 case FLOOR_DIV_EXPR:
1953 opname = "/"; break;
1955 opname = "&"; break;
1957 opname = "|"; break;
1958 case TRUTH_ANDIF_EXPR:
1959 opname = "&&"; break;
1960 case TRUTH_ORIF_EXPR:
1961 opname = "||"; break;
1963 opname = "^"; break;
1967 error ("invalid operands to binary %s", opname);
1970 /* Subroutine of build_binary_op, used for comparison operations.
1971 See if the operands have both been converted from subword integer types
1972 and, if so, perhaps change them both back to their original type.
1973 This function is also responsible for converting the two operands
1974 to the proper common type for comparison.
1976 The arguments of this function are all pointers to local variables
1977 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1978 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1980 If this function returns nonzero, it means that the comparison has
1981 a constant value. What this function returns is an expression for
1985 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
1986 enum tree_code *rescode_ptr)
1989 tree op0 = *op0_ptr;
1990 tree op1 = *op1_ptr;
1991 int unsignedp0, unsignedp1;
1993 tree primop0, primop1;
1994 enum tree_code code = *rescode_ptr;
1996 /* Throw away any conversions to wider types
1997 already present in the operands. */
1999 primop0 = get_narrower (op0, &unsignedp0);
2000 primop1 = get_narrower (op1, &unsignedp1);
2002 /* Handle the case that OP0 does not *contain* a conversion
2003 but it *requires* conversion to FINAL_TYPE. */
2005 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2006 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
2007 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2008 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
2010 /* If one of the operands must be floated, we cannot optimize. */
2011 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2012 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2014 /* If first arg is constant, swap the args (changing operation
2015 so value is preserved), for canonicalization. Don't do this if
2016 the second arg is 0. */
2018 if (TREE_CONSTANT (primop0)
2019 && !integer_zerop (primop1) && !real_zerop (primop1))
2022 int temi = unsignedp0;
2030 unsignedp0 = unsignedp1;
2053 *rescode_ptr = code;
2056 /* If comparing an integer against a constant more bits wide,
2057 maybe we can deduce a value of 1 or 0 independent of the data.
2058 Or else truncate the constant now
2059 rather than extend the variable at run time.
2061 This is only interesting if the constant is the wider arg.
2062 Also, it is not safe if the constant is unsigned and the
2063 variable arg is signed, since in this case the variable
2064 would be sign-extended and then regarded as unsigned.
2065 Our technique fails in this case because the lowest/highest
2066 possible unsigned results don't follow naturally from the
2067 lowest/highest possible values of the variable operand.
2068 For just EQ_EXPR and NE_EXPR there is another technique that
2069 could be used: see if the constant can be faithfully represented
2070 in the other operand's type, by truncating it and reextending it
2071 and see if that preserves the constant's value. */
2073 if (!real1 && !real2
2074 && TREE_CODE (primop1) == INTEGER_CST
2075 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2077 int min_gt, max_gt, min_lt, max_lt;
2078 tree maxval, minval;
2079 /* 1 if comparison is nominally unsigned. */
2080 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2083 type = c_common_signed_or_unsigned_type (unsignedp0,
2084 TREE_TYPE (primop0));
2086 maxval = TYPE_MAX_VALUE (type);
2087 minval = TYPE_MIN_VALUE (type);
2089 if (unsignedp && !unsignedp0)
2090 *restype_ptr = c_common_signed_type (*restype_ptr);
2092 if (TREE_TYPE (primop1) != *restype_ptr)
2094 /* Convert primop1 to target type, but do not introduce
2095 additional overflow. We know primop1 is an int_cst. */
2096 tree tmp = build_int_cst_wide (*restype_ptr,
2097 TREE_INT_CST_LOW (primop1),
2098 TREE_INT_CST_HIGH (primop1));
2100 primop1 = force_fit_type (tmp, 0, TREE_OVERFLOW (primop1),
2101 TREE_CONSTANT_OVERFLOW (primop1));
2103 if (type != *restype_ptr)
2105 minval = convert (*restype_ptr, minval);
2106 maxval = convert (*restype_ptr, maxval);
2109 if (unsignedp && unsignedp0)
2111 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2112 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2113 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2114 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2118 min_gt = INT_CST_LT (primop1, minval);
2119 max_gt = INT_CST_LT (primop1, maxval);
2120 min_lt = INT_CST_LT (minval, primop1);
2121 max_lt = INT_CST_LT (maxval, primop1);
2125 /* This used to be a switch, but Genix compiler can't handle that. */
2126 if (code == NE_EXPR)
2128 if (max_lt || min_gt)
2129 val = truthvalue_true_node;
2131 else if (code == EQ_EXPR)
2133 if (max_lt || min_gt)
2134 val = truthvalue_false_node;
2136 else if (code == LT_EXPR)
2139 val = truthvalue_true_node;
2141 val = truthvalue_false_node;
2143 else if (code == GT_EXPR)
2146 val = truthvalue_true_node;
2148 val = truthvalue_false_node;
2150 else if (code == LE_EXPR)
2153 val = truthvalue_true_node;
2155 val = truthvalue_false_node;
2157 else if (code == GE_EXPR)
2160 val = truthvalue_true_node;
2162 val = truthvalue_false_node;
2165 /* If primop0 was sign-extended and unsigned comparison specd,
2166 we did a signed comparison above using the signed type bounds.
2167 But the comparison we output must be unsigned.
2169 Also, for inequalities, VAL is no good; but if the signed
2170 comparison had *any* fixed result, it follows that the
2171 unsigned comparison just tests the sign in reverse
2172 (positive values are LE, negative ones GE).
2173 So we can generate an unsigned comparison
2174 against an extreme value of the signed type. */
2176 if (unsignedp && !unsignedp0)
2183 primop1 = TYPE_MIN_VALUE (type);
2189 primop1 = TYPE_MAX_VALUE (type);
2196 type = c_common_unsigned_type (type);
2199 if (TREE_CODE (primop0) != INTEGER_CST)
2201 if (val == truthvalue_false_node)
2202 warning (0, "comparison is always false due to limited range of data type");
2203 if (val == truthvalue_true_node)
2204 warning (0, "comparison is always true due to limited range of data type");
2209 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2210 if (TREE_SIDE_EFFECTS (primop0))
2211 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2215 /* Value is not predetermined, but do the comparison
2216 in the type of the operand that is not constant.
2217 TYPE is already properly set. */
2220 /* If either arg is decimal float and the other is float, find the
2221 proper common type to use for comparison. */
2222 else if (real1 && real2
2223 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0)))
2224 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1)))))
2225 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2227 else if (real1 && real2
2228 && (TYPE_PRECISION (TREE_TYPE (primop0))
2229 == TYPE_PRECISION (TREE_TYPE (primop1))))
2230 type = TREE_TYPE (primop0);
2232 /* If args' natural types are both narrower than nominal type
2233 and both extend in the same manner, compare them
2234 in the type of the wider arg.
2235 Otherwise must actually extend both to the nominal
2236 common type lest different ways of extending
2238 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2240 else if (unsignedp0 == unsignedp1 && real1 == real2
2241 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2242 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2244 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2245 type = c_common_signed_or_unsigned_type (unsignedp0
2246 || TYPE_UNSIGNED (*restype_ptr),
2248 /* Make sure shorter operand is extended the right way
2249 to match the longer operand. */
2251 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2252 TREE_TYPE (primop0)),
2255 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2256 TREE_TYPE (primop1)),
2261 /* Here we must do the comparison on the nominal type
2262 using the args exactly as we received them. */
2263 type = *restype_ptr;
2267 if (!real1 && !real2 && integer_zerop (primop1)
2268 && TYPE_UNSIGNED (*restype_ptr))
2274 /* All unsigned values are >= 0, so we warn if extra warnings
2275 are requested. However, if OP0 is a constant that is
2276 >= 0, the signedness of the comparison isn't an issue,
2277 so suppress the warning. */
2278 if (extra_warnings && !in_system_header
2279 && !(TREE_CODE (primop0) == INTEGER_CST
2280 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2282 warning (0, "comparison of unsigned expression >= 0 is always true");
2283 value = truthvalue_true_node;
2287 if (extra_warnings && !in_system_header
2288 && !(TREE_CODE (primop0) == INTEGER_CST
2289 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2291 warning (0, "comparison of unsigned expression < 0 is always false");
2292 value = truthvalue_false_node;
2301 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2302 if (TREE_SIDE_EFFECTS (primop0))
2303 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2310 *op0_ptr = convert (type, primop0);
2311 *op1_ptr = convert (type, primop1);
2313 *restype_ptr = truthvalue_type_node;
2318 /* Return a tree for the sum or difference (RESULTCODE says which)
2319 of pointer PTROP and integer INTOP. */
2322 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2326 /* The result is a pointer of the same type that is being added. */
2328 tree result_type = TREE_TYPE (ptrop);
2330 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2332 if (pedantic || warn_pointer_arith)
2333 pedwarn ("pointer of type %<void *%> used in arithmetic");
2334 size_exp = integer_one_node;
2336 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2338 if (pedantic || warn_pointer_arith)
2339 pedwarn ("pointer to a function used in arithmetic");
2340 size_exp = integer_one_node;
2342 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2344 if (pedantic || warn_pointer_arith)
2345 pedwarn ("pointer to member function used in arithmetic");
2346 size_exp = integer_one_node;
2349 size_exp = size_in_bytes (TREE_TYPE (result_type));
2351 /* If what we are about to multiply by the size of the elements
2352 contains a constant term, apply distributive law
2353 and multiply that constant term separately.
2354 This helps produce common subexpressions. */
2356 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2357 && !TREE_CONSTANT (intop)
2358 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2359 && TREE_CONSTANT (size_exp)
2360 /* If the constant comes from pointer subtraction,
2361 skip this optimization--it would cause an error. */
2362 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2363 /* If the constant is unsigned, and smaller than the pointer size,
2364 then we must skip this optimization. This is because it could cause
2365 an overflow error if the constant is negative but INTOP is not. */
2366 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2367 || (TYPE_PRECISION (TREE_TYPE (intop))
2368 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2370 enum tree_code subcode = resultcode;
2371 tree int_type = TREE_TYPE (intop);
2372 if (TREE_CODE (intop) == MINUS_EXPR)
2373 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2374 /* Convert both subexpression types to the type of intop,
2375 because weird cases involving pointer arithmetic
2376 can result in a sum or difference with different type args. */
2377 ptrop = build_binary_op (subcode, ptrop,
2378 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2379 intop = convert (int_type, TREE_OPERAND (intop, 0));
2382 /* Convert the integer argument to a type the same size as sizetype
2383 so the multiply won't overflow spuriously. */
2385 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2386 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2387 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2388 TYPE_UNSIGNED (sizetype)), intop);
2390 /* Replace the integer argument with a suitable product by the object size.
2391 Do this multiplication as signed, then convert to the appropriate
2392 pointer type (actually unsigned integral). */
2394 intop = convert (result_type,
2395 build_binary_op (MULT_EXPR, intop,
2396 convert (TREE_TYPE (intop), size_exp), 1));
2398 /* Create the sum or difference. */
2399 return fold_build2 (resultcode, result_type, ptrop, intop);
2402 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2403 or for an `if' or `while' statement or ?..: exp. It should already
2404 have been validated to be of suitable type; otherwise, a bad
2405 diagnostic may result.
2407 This preparation consists of taking the ordinary
2408 representation of an expression expr and producing a valid tree
2409 boolean expression describing whether expr is nonzero. We could
2410 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2411 but we optimize comparisons, &&, ||, and !.
2413 The resulting type should always be `truthvalue_type_node'. */
2416 c_common_truthvalue_conversion (tree expr)
2418 switch (TREE_CODE (expr))
2420 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2421 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2422 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2423 case ORDERED_EXPR: case UNORDERED_EXPR:
2424 if (TREE_TYPE (expr) == truthvalue_type_node)
2426 return build2 (TREE_CODE (expr), truthvalue_type_node,
2427 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2429 case TRUTH_ANDIF_EXPR:
2430 case TRUTH_ORIF_EXPR:
2431 case TRUTH_AND_EXPR:
2433 case TRUTH_XOR_EXPR:
2434 if (TREE_TYPE (expr) == truthvalue_type_node)
2436 return build2 (TREE_CODE (expr), truthvalue_type_node,
2437 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2438 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)));
2440 case TRUTH_NOT_EXPR:
2441 if (TREE_TYPE (expr) == truthvalue_type_node)
2443 return build1 (TREE_CODE (expr), truthvalue_type_node,
2444 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2450 /* Avoid integer_zerop to ignore TREE_CONSTANT_OVERFLOW. */
2451 return (TREE_INT_CST_LOW (expr) != 0 || TREE_INT_CST_HIGH (expr) != 0)
2452 ? truthvalue_true_node
2453 : truthvalue_false_node;
2456 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
2457 ? truthvalue_true_node
2458 : truthvalue_false_node;
2461 expr = build_unary_op (ADDR_EXPR, expr, 0);
2466 tree inner = TREE_OPERAND (expr, 0);
2468 && (TREE_CODE (inner) == PARM_DECL || !DECL_WEAK (inner)))
2470 /* Common Ada/Pascal programmer's mistake. We always warn
2471 about this since it is so bad. */
2472 warning (OPT_Walways_true, "the address of %qD, will always evaluate as %<true%>",
2474 return truthvalue_true_node;
2477 /* If we are taking the address of an external decl, it might be
2478 zero if it is weak, so we cannot optimize. */
2480 && DECL_EXTERNAL (inner))
2483 if (TREE_SIDE_EFFECTS (inner))
2484 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2485 inner, truthvalue_true_node);
2487 return truthvalue_true_node;
2491 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2492 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2493 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2494 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2500 /* These don't change whether an object is nonzero or zero. */
2501 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2505 /* These don't change whether an object is zero or nonzero, but
2506 we can't ignore them if their second arg has side-effects. */
2507 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2508 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2509 TREE_OPERAND (expr, 1),
2510 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2512 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2515 /* Distribute the conversion into the arms of a COND_EXPR. */
2516 return fold_build3 (COND_EXPR, truthvalue_type_node,
2517 TREE_OPERAND (expr, 0),
2518 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2519 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2)));
2523 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2524 since that affects how `default_conversion' will behave. */
2525 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2526 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2528 /* If this is widening the argument, we can ignore it. */
2529 if (TYPE_PRECISION (TREE_TYPE (expr))
2530 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2531 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2535 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2536 aren't guaranteed to the be same for modes that can represent
2537 infinity, since if x and y are both +infinity, or both
2538 -infinity, then x - y is not a number.
2540 Note that this transformation is safe when x or y is NaN.
2541 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2543 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2545 /* Fall through.... */
2547 /* This and MINUS_EXPR can be changed into a comparison of the
2549 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2550 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2551 return fold_build2 (NE_EXPR, truthvalue_type_node,
2552 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2553 return fold_build2 (NE_EXPR, truthvalue_type_node,
2554 TREE_OPERAND (expr, 0),
2555 fold_convert (TREE_TYPE (TREE_OPERAND (expr, 0)),
2556 TREE_OPERAND (expr, 1)));
2559 if (integer_onep (TREE_OPERAND (expr, 1))
2560 && TREE_TYPE (expr) != truthvalue_type_node)
2561 /* Using convert here would cause infinite recursion. */
2562 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2566 if (!TREE_NO_WARNING (expr))
2567 warning (OPT_Wparentheses,
2568 "suggest parentheses around assignment used as truth value");
2575 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2577 tree t = save_expr (expr);
2578 return (build_binary_op
2579 ((TREE_SIDE_EFFECTS (expr)
2580 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2581 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2582 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2586 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2589 static void def_builtin_1 (enum built_in_function fncode,
2591 enum built_in_class fnclass,
2592 tree fntype, tree libtype,
2593 bool both_p, bool fallback_p, bool nonansi_p,
2594 tree fnattrs, bool implicit_p);
2596 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2597 down to the element type of an array. */
2600 c_build_qualified_type (tree type, int type_quals)
2602 if (type == error_mark_node)
2605 if (TREE_CODE (type) == ARRAY_TYPE)
2608 tree element_type = c_build_qualified_type (TREE_TYPE (type),
2611 /* See if we already have an identically qualified type. */
2612 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2614 if (TYPE_QUALS (strip_array_types (t)) == type_quals
2615 && TYPE_NAME (t) == TYPE_NAME (type)
2616 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
2617 && attribute_list_equal (TYPE_ATTRIBUTES (t),
2618 TYPE_ATTRIBUTES (type)))
2623 t = build_variant_type_copy (type);
2624 TREE_TYPE (t) = element_type;
2629 /* A restrict-qualified pointer type must be a pointer to object or
2630 incomplete type. Note that the use of POINTER_TYPE_P also allows
2631 REFERENCE_TYPEs, which is appropriate for C++. */
2632 if ((type_quals & TYPE_QUAL_RESTRICT)
2633 && (!POINTER_TYPE_P (type)
2634 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2636 error ("invalid use of %<restrict%>");
2637 type_quals &= ~TYPE_QUAL_RESTRICT;
2640 return build_qualified_type (type, type_quals);
2643 /* Apply the TYPE_QUALS to the new DECL. */
2646 c_apply_type_quals_to_decl (int type_quals, tree decl)
2648 tree type = TREE_TYPE (decl);
2650 if (type == error_mark_node)
2653 if (((type_quals & TYPE_QUAL_CONST)
2654 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2655 /* An object declared 'const' is only readonly after it is
2656 initialized. We don't have any way of expressing this currently,
2657 so we need to be conservative and unset TREE_READONLY for types
2658 with constructors. Otherwise aliasing code will ignore stores in
2659 an inline constructor. */
2660 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2661 TREE_READONLY (decl) = 1;
2662 if (type_quals & TYPE_QUAL_VOLATILE)
2664 TREE_SIDE_EFFECTS (decl) = 1;
2665 TREE_THIS_VOLATILE (decl) = 1;
2667 if (type_quals & TYPE_QUAL_RESTRICT)
2669 while (type && TREE_CODE (type) == ARRAY_TYPE)
2670 /* Allow 'restrict' on arrays of pointers.
2671 FIXME currently we just ignore it. */
2672 type = TREE_TYPE (type);
2674 || !POINTER_TYPE_P (type)
2675 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2676 error ("invalid use of %<restrict%>");
2677 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2678 /* Indicate we need to make a unique alias set for this pointer.
2679 We can't do it here because it might be pointing to an
2681 DECL_POINTER_ALIAS_SET (decl) = -2;
2685 /* Hash function for the problem of multiple type definitions in
2686 different files. This must hash all types that will compare
2687 equal via comptypes to the same value. In practice it hashes
2688 on some of the simple stuff and leaves the details to comptypes. */
2691 c_type_hash (const void *p)
2697 switch (TREE_CODE (t))
2699 /* For pointers, hash on pointee type plus some swizzling. */
2701 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2702 /* Hash on number of elements and total size. */
2705 t2 = TYPE_VALUES (t);
2709 t2 = TYPE_FIELDS (t);
2711 case QUAL_UNION_TYPE:
2713 t2 = TYPE_FIELDS (t);
2717 t2 = TYPE_FIELDS (t);
2722 for (; t2; t2 = TREE_CHAIN (t2))
2724 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2725 return ((size << 24) | (i << shift));
2728 static GTY((param_is (union tree_node))) htab_t type_hash_table;
2730 /* Return the typed-based alias set for T, which may be an expression
2731 or a type. Return -1 if we don't do anything special. */
2734 c_common_get_alias_set (tree t)
2739 /* Permit type-punning when accessing a union, provided the access
2740 is directly through the union. For example, this code does not
2741 permit taking the address of a union member and then storing
2742 through it. Even the type-punning allowed here is a GCC
2743 extension, albeit a common and useful one; the C standard says
2744 that such accesses have implementation-defined behavior. */
2746 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2747 u = TREE_OPERAND (u, 0))
2748 if (TREE_CODE (u) == COMPONENT_REF
2749 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2752 /* That's all the expressions we handle specially. */
2756 /* The C standard guarantees that any object may be accessed via an
2757 lvalue that has character type. */
2758 if (t == char_type_node
2759 || t == signed_char_type_node
2760 || t == unsigned_char_type_node)
2763 /* If it has the may_alias attribute, it can alias anything. */
2764 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2767 /* The C standard specifically allows aliasing between signed and
2768 unsigned variants of the same type. We treat the signed
2769 variant as canonical. */
2770 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2772 tree t1 = c_common_signed_type (t);
2774 /* t1 == t can happen for boolean nodes which are always unsigned. */
2776 return get_alias_set (t1);
2778 else if (POINTER_TYPE_P (t))
2782 /* Unfortunately, there is no canonical form of a pointer type.
2783 In particular, if we have `typedef int I', then `int *', and
2784 `I *' are different types. So, we have to pick a canonical
2785 representative. We do this below.
2787 Technically, this approach is actually more conservative that
2788 it needs to be. In particular, `const int *' and `int *'
2789 should be in different alias sets, according to the C and C++
2790 standard, since their types are not the same, and so,
2791 technically, an `int **' and `const int **' cannot point at
2794 But, the standard is wrong. In particular, this code is
2799 const int* const* cipp = ipp;
2801 And, it doesn't make sense for that to be legal unless you
2802 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2803 the pointed-to types. This issue has been reported to the
2805 t1 = build_type_no_quals (t);
2807 return get_alias_set (t1);
2810 /* Handle the case of multiple type nodes referring to "the same" type,
2811 which occurs with IMA. These share an alias set. FIXME: Currently only
2812 C90 is handled. (In C99 type compatibility is not transitive, which
2813 complicates things mightily. The alias set splay trees can theoretically
2814 represent this, but insertion is tricky when you consider all the
2815 different orders things might arrive in.) */
2817 if (c_language != clk_c || flag_isoc99)
2820 /* Save time if there's only one input file. */
2821 if (num_in_fnames == 1)
2824 /* Pointers need special handling if they point to any type that
2825 needs special handling (below). */
2826 if (TREE_CODE (t) == POINTER_TYPE)
2829 /* Find bottom type under any nested POINTERs. */
2830 for (t2 = TREE_TYPE (t);
2831 TREE_CODE (t2) == POINTER_TYPE;
2832 t2 = TREE_TYPE (t2))
2834 if (TREE_CODE (t2) != RECORD_TYPE
2835 && TREE_CODE (t2) != ENUMERAL_TYPE
2836 && TREE_CODE (t2) != QUAL_UNION_TYPE
2837 && TREE_CODE (t2) != UNION_TYPE)
2839 if (TYPE_SIZE (t2) == 0)
2842 /* These are the only cases that need special handling. */
2843 if (TREE_CODE (t) != RECORD_TYPE
2844 && TREE_CODE (t) != ENUMERAL_TYPE
2845 && TREE_CODE (t) != QUAL_UNION_TYPE
2846 && TREE_CODE (t) != UNION_TYPE
2847 && TREE_CODE (t) != POINTER_TYPE)
2850 if (TYPE_SIZE (t) == 0)
2853 /* Look up t in hash table. Only one of the compatible types within each
2854 alias set is recorded in the table. */
2855 if (!type_hash_table)
2856 type_hash_table = htab_create_ggc (1021, c_type_hash,
2857 (htab_eq) lang_hooks.types_compatible_p,
2859 slot = htab_find_slot (type_hash_table, t, INSERT);
2862 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
2863 return TYPE_ALIAS_SET ((tree)*slot);
2866 /* Our caller will assign and record (in t) a new alias set; all we need
2867 to do is remember t in the hash table. */
2873 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2874 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2875 flag controls whether we should diagnose possibly ill-formed
2876 constructs or not. */
2879 c_sizeof_or_alignof_type (tree type, bool is_sizeof, int complain)
2881 const char *op_name;
2883 enum tree_code type_code = TREE_CODE (type);
2885 op_name = is_sizeof ? "sizeof" : "__alignof__";
2887 if (type_code == FUNCTION_TYPE)
2891 if (complain && (pedantic || warn_pointer_arith))
2892 pedwarn ("invalid application of %<sizeof%> to a function type");
2893 value = size_one_node;
2896 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2898 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2900 if (type_code == VOID_TYPE
2901 && complain && (pedantic || warn_pointer_arith))
2902 pedwarn ("invalid application of %qs to a void type", op_name);
2903 value = size_one_node;
2905 else if (!COMPLETE_TYPE_P (type))
2908 error ("invalid application of %qs to incomplete type %qT ",
2910 value = size_zero_node;
2915 /* Convert in case a char is more than one unit. */
2916 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2917 size_int (TYPE_PRECISION (char_type_node)
2920 value = size_int (TYPE_ALIGN_UNIT (type));
2923 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2924 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2925 never happen. However, this node should really have type
2926 `size_t', which is just a typedef for an ordinary integer type. */
2927 value = fold_convert (size_type_node, value);
2928 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
2933 /* Implement the __alignof keyword: Return the minimum required
2934 alignment of EXPR, measured in bytes. For VAR_DECL's and
2935 FIELD_DECL's return DECL_ALIGN (which can be set from an
2936 "aligned" __attribute__ specification). */
2939 c_alignof_expr (tree expr)
2943 if (TREE_CODE (expr) == VAR_DECL)
2944 t = size_int (DECL_ALIGN_UNIT (expr));
2946 else if (TREE_CODE (expr) == COMPONENT_REF
2947 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2949 error ("%<__alignof%> applied to a bit-field");
2952 else if (TREE_CODE (expr) == COMPONENT_REF
2953 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2954 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
2956 else if (TREE_CODE (expr) == INDIRECT_REF)
2958 tree t = TREE_OPERAND (expr, 0);
2960 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2962 while ((TREE_CODE (t) == NOP_EXPR || TREE_CODE (t) == CONVERT_EXPR)
2963 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2967 t = TREE_OPERAND (t, 0);
2968 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2969 if (thisalign > bestalign)
2970 best = t, bestalign = thisalign;
2972 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2975 return c_alignof (TREE_TYPE (expr));
2977 return fold_convert (size_type_node, t);
2980 /* Handle C and C++ default attributes. */
2982 enum built_in_attribute
2984 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2985 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2986 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2987 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2988 #include "builtin-attrs.def"
2989 #undef DEF_ATTR_NULL_TREE
2991 #undef DEF_ATTR_IDENT
2992 #undef DEF_ATTR_TREE_LIST
2996 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2998 static void c_init_attributes (void);
3002 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3003 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3004 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3005 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3006 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3007 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3008 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3009 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3010 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3011 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3012 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3013 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3014 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3015 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3016 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3018 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3019 #include "builtin-types.def"
3020 #undef DEF_PRIMITIVE_TYPE
3021 #undef DEF_FUNCTION_TYPE_0
3022 #undef DEF_FUNCTION_TYPE_1
3023 #undef DEF_FUNCTION_TYPE_2
3024 #undef DEF_FUNCTION_TYPE_3
3025 #undef DEF_FUNCTION_TYPE_4
3026 #undef DEF_FUNCTION_TYPE_5
3027 #undef DEF_FUNCTION_TYPE_6
3028 #undef DEF_FUNCTION_TYPE_7
3029 #undef DEF_FUNCTION_TYPE_VAR_0
3030 #undef DEF_FUNCTION_TYPE_VAR_1
3031 #undef DEF_FUNCTION_TYPE_VAR_2
3032 #undef DEF_FUNCTION_TYPE_VAR_3
3033 #undef DEF_FUNCTION_TYPE_VAR_4
3034 #undef DEF_FUNCTION_TYPE_VAR_5
3035 #undef DEF_POINTER_TYPE
3039 typedef enum c_builtin_type builtin_type;
3041 /* A temporary array for c_common_nodes_and_builtins. Used in
3042 communication with def_fn_type. */
3043 static tree builtin_types[(int) BT_LAST + 1];
3045 /* A helper function for c_common_nodes_and_builtins. Build function type
3046 for DEF with return type RET and N arguments. If VAR is true, then the
3047 function should be variadic after those N arguments.
3049 Takes special care not to ICE if any of the types involved are
3050 error_mark_node, which indicates that said type is not in fact available
3051 (see builtin_type_for_size). In which case the function type as a whole
3052 should be error_mark_node. */
3055 def_fn_type (builtin_type def, builtin_type ret, bool var, int n, ...)
3057 tree args = NULL, t;
3062 for (i = 0; i < n; ++i)
3064 builtin_type a = va_arg (list, builtin_type);
3065 t = builtin_types[a];
3066 if (t == error_mark_node)
3068 args = tree_cons (NULL_TREE, t, args);
3072 args = nreverse (args);
3074 args = chainon (args, void_list_node);
3076 t = builtin_types[ret];
3077 if (t == error_mark_node)
3079 t = build_function_type (t, args);
3082 builtin_types[def] = t;
3085 /* Build tree nodes and builtin functions common to both C and C++ language
3089 c_common_nodes_and_builtins (void)
3091 int wchar_type_size;
3092 tree array_domain_type;
3093 tree va_list_ref_type_node;
3094 tree va_list_arg_type_node;
3096 /* Define `int' and `char' first so that dbx will output them first. */
3097 record_builtin_type (RID_INT, NULL, integer_type_node);
3098 record_builtin_type (RID_CHAR, "char", char_type_node);
3100 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3101 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3102 but not C. Are the conditionals here needed? */
3103 if (c_dialect_cxx ())
3104 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3105 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3106 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3107 record_builtin_type (RID_MAX, "long unsigned int",
3108 long_unsigned_type_node);
3109 if (c_dialect_cxx ())
3110 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3111 record_builtin_type (RID_MAX, "long long int",
3112 long_long_integer_type_node);
3113 record_builtin_type (RID_MAX, "long long unsigned int",
3114 long_long_unsigned_type_node);
3115 if (c_dialect_cxx ())
3116 record_builtin_type (RID_MAX, "long long unsigned",
3117 long_long_unsigned_type_node);
3118 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3119 record_builtin_type (RID_MAX, "short unsigned int",
3120 short_unsigned_type_node);
3121 if (c_dialect_cxx ())
3122 record_builtin_type (RID_MAX, "unsigned short",
3123 short_unsigned_type_node);
3125 /* Define both `signed char' and `unsigned char'. */
3126 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3127 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3129 /* These are types that c_common_type_for_size and
3130 c_common_type_for_mode use. */
3131 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3133 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3135 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3137 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3139 #if HOST_BITS_PER_WIDE_INT >= 64
3140 if (targetm.scalar_mode_supported_p (TImode))
3141 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3142 get_identifier ("__int128_t"),
3145 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3146 unsigned_intQI_type_node));
3147 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3148 unsigned_intHI_type_node));
3149 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3150 unsigned_intSI_type_node));
3151 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3152 unsigned_intDI_type_node));
3153 #if HOST_BITS_PER_WIDE_INT >= 64
3154 if (targetm.scalar_mode_supported_p (TImode))
3155 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3156 get_identifier ("__uint128_t"),
3157 unsigned_intTI_type_node));
3160 /* Create the widest literal types. */
3161 widest_integer_literal_type_node
3162 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3163 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3164 widest_integer_literal_type_node));
3166 widest_unsigned_literal_type_node
3167 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3168 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3169 widest_unsigned_literal_type_node));
3171 /* `unsigned long' is the standard type for sizeof.
3172 Note that stddef.h uses `unsigned long',
3173 and this must agree, even if long and int are the same size. */
3175 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3176 signed_size_type_node = c_common_signed_type (size_type_node);
3177 set_sizetype (size_type_node);
3180 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3182 build_common_tree_nodes_2 (flag_short_double);
3184 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3185 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3186 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3188 /* Only supported decimal floating point extension if the target
3189 actually supports underlying modes. */
3190 if (targetm.scalar_mode_supported_p (SDmode)
3191 && targetm.scalar_mode_supported_p (DDmode)
3192 && targetm.scalar_mode_supported_p (TDmode))
3194 record_builtin_type (RID_DFLOAT32, NULL, dfloat32_type_node);
3195 record_builtin_type (RID_DFLOAT64, NULL, dfloat64_type_node);
3196 record_builtin_type (RID_DFLOAT128, NULL, dfloat128_type_node);
3199 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3200 get_identifier ("complex int"),
3201 complex_integer_type_node));
3202 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3203 get_identifier ("complex float"),
3204 complex_float_type_node));
3205 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3206 get_identifier ("complex double"),
3207 complex_double_type_node));
3208 lang_hooks.decls.pushdecl
3209 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3210 complex_long_double_type_node));
3212 if (c_dialect_cxx ())
3213 /* For C++, make fileptr_type_node a distinct void * type until
3214 FILE type is defined. */
3215 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3217 record_builtin_type (RID_VOID, NULL, void_type_node);
3219 /* This node must not be shared. */
3220 void_zero_node = make_node (INTEGER_CST);
3221 TREE_TYPE (void_zero_node) = void_type_node;
3223 void_list_node = build_void_list_node ();
3225 /* Make a type to be the domain of a few array types
3226 whose domains don't really matter.
3227 200 is small enough that it always fits in size_t
3228 and large enough that it can hold most function names for the
3229 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3230 array_domain_type = build_index_type (size_int (200));
3232 /* Make a type for arrays of characters.
3233 With luck nothing will ever really depend on the length of this
3235 char_array_type_node
3236 = build_array_type (char_type_node, array_domain_type);
3238 /* Likewise for arrays of ints. */
3240 = build_array_type (integer_type_node, array_domain_type);
3242 string_type_node = build_pointer_type (char_type_node);
3243 const_string_type_node
3244 = build_pointer_type (build_qualified_type
3245 (char_type_node, TYPE_QUAL_CONST));
3247 /* This is special for C++ so functions can be overloaded. */
3248 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3249 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3250 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3251 if (c_dialect_cxx ())
3253 if (TYPE_UNSIGNED (wchar_type_node))
3254 wchar_type_node = make_unsigned_type (wchar_type_size);
3256 wchar_type_node = make_signed_type (wchar_type_size);
3257 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3261 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3262 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3265 /* This is for wide string constants. */
3266 wchar_array_type_node
3267 = build_array_type (wchar_type_node, array_domain_type);
3270 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3273 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3275 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3277 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3279 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3280 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3282 lang_hooks.decls.pushdecl
3283 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3284 va_list_type_node));
3286 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3288 va_list_arg_type_node = va_list_ref_type_node =
3289 build_pointer_type (TREE_TYPE (va_list_type_node));
3293 va_list_arg_type_node = va_list_type_node;
3294 va_list_ref_type_node = build_reference_type (va_list_type_node);
3297 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3298 builtin_types[ENUM] = VALUE;
3299 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3300 def_fn_type (ENUM, RETURN, 0, 0);
3301 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3302 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3303 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3304 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3305 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3306 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3307 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3308 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3309 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3310 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3311 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3313 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3314 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3316 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3317 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3318 def_fn_type (ENUM, RETURN, 1, 0);
3319 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3320 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3321 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3322 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3323 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3324 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3325 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3326 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3327 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3328 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3329 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3330 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3332 #include "builtin-types.def"
3334 #undef DEF_PRIMITIVE_TYPE
3335 #undef DEF_FUNCTION_TYPE_1
3336 #undef DEF_FUNCTION_TYPE_2
3337 #undef DEF_FUNCTION_TYPE_3
3338 #undef DEF_FUNCTION_TYPE_4
3339 #undef DEF_FUNCTION_TYPE_5
3340 #undef DEF_FUNCTION_TYPE_6
3341 #undef DEF_FUNCTION_TYPE_VAR_0
3342 #undef DEF_FUNCTION_TYPE_VAR_1
3343 #undef DEF_FUNCTION_TYPE_VAR_2
3344 #undef DEF_FUNCTION_TYPE_VAR_3
3345 #undef DEF_FUNCTION_TYPE_VAR_4
3346 #undef DEF_FUNCTION_TYPE_VAR_5
3347 #undef DEF_POINTER_TYPE
3348 builtin_types[(int) BT_LAST] = NULL_TREE;
3350 c_init_attributes ();
3352 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3353 NONANSI_P, ATTRS, IMPLICIT, COND) \
3355 def_builtin_1 (ENUM, NAME, CLASS, \
3356 builtin_types[(int) TYPE], \
3357 builtin_types[(int) LIBTYPE], \
3358 BOTH_P, FALLBACK_P, NONANSI_P, \
3359 built_in_attributes[(int) ATTRS], IMPLICIT);
3360 #include "builtins.def"
3363 build_common_builtin_nodes ();
3365 targetm.init_builtins ();
3369 main_identifier_node = get_identifier ("main");
3371 /* Create the built-in __null node. It is important that this is
3373 null_node = make_node (INTEGER_CST);
3374 TREE_TYPE (null_node) = c_common_type_for_size (POINTER_SIZE, 0);
3376 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3377 memset (builtin_types, 0, sizeof (builtin_types));
3380 /* Look up the function in built_in_decls that corresponds to DECL
3381 and set ASMSPEC as its user assembler name. DECL must be a
3382 function decl that declares a builtin. */
3385 set_builtin_user_assembler_name (tree decl, const char *asmspec)
3388 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
3389 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
3392 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
3393 set_user_assembler_name (builtin, asmspec);
3394 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
3395 init_block_move_fn (asmspec);
3396 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
3397 init_block_clear_fn (asmspec);
3400 /* The number of named compound-literals generated thus far. */
3401 static GTY(()) int compound_literal_number;
3403 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3406 set_compound_literal_name (tree decl)
3409 ASM_FORMAT_PRIVATE_NAME (name, "__compound_literal",
3410 compound_literal_number);
3411 compound_literal_number++;
3412 DECL_NAME (decl) = get_identifier (name);
3416 build_va_arg (tree expr, tree type)
3418 return build1 (VA_ARG_EXPR, type, expr);
3422 /* Linked list of disabled built-in functions. */
3424 typedef struct disabled_builtin
3427 struct disabled_builtin *next;
3429 static disabled_builtin *disabled_builtins = NULL;
3431 static bool builtin_function_disabled_p (const char *);
3433 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3434 begins with "__builtin_", give an error. */
3437 disable_builtin_function (const char *name)
3439 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3440 error ("cannot disable built-in function %qs", name);
3443 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3444 new_disabled_builtin->name = name;
3445 new_disabled_builtin->next = disabled_builtins;
3446 disabled_builtins = new_disabled_builtin;
3451 /* Return true if the built-in function NAME has been disabled, false
3455 builtin_function_disabled_p (const char *name)
3457 disabled_builtin *p;
3458 for (p = disabled_builtins; p != NULL; p = p->next)
3460 if (strcmp (name, p->name) == 0)
3467 /* Worker for DEF_BUILTIN.
3468 Possibly define a builtin function with one or two names.
3469 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3470 nonansi_p and flag_no_nonansi_builtin. */
3473 def_builtin_1 (enum built_in_function fncode,
3475 enum built_in_class fnclass,
3476 tree fntype, tree libtype,
3477 bool both_p, bool fallback_p, bool nonansi_p,
3478 tree fnattrs, bool implicit_p)
3481 const char *libname;
3483 if (fntype == error_mark_node)
3486 gcc_assert ((!both_p && !fallback_p)
3487 || !strncmp (name, "__builtin_",
3488 strlen ("__builtin_")));
3490 libname = name + strlen ("__builtin_");
3491 decl = lang_hooks.builtin_function (name, fntype, fncode, fnclass,
3492 (fallback_p ? libname : NULL),
3495 && !flag_no_builtin && !builtin_function_disabled_p (libname)
3496 && !(nonansi_p && flag_no_nonansi_builtin))
3497 lang_hooks.builtin_function (libname, libtype, fncode, fnclass,
3500 built_in_decls[(int) fncode] = decl;
3502 implicit_built_in_decls[(int) fncode] = decl;
3505 /* Nonzero if the type T promotes to int. This is (nearly) the
3506 integral promotions defined in ISO C99 6.3.1.1/2. */
3509 c_promoting_integer_type_p (tree t)
3511 switch (TREE_CODE (t))
3514 return (TYPE_MAIN_VARIANT (t) == char_type_node
3515 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3516 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3517 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3518 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3519 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3522 /* ??? Technically all enumerations not larger than an int
3523 promote to an int. But this is used along code paths
3524 that only want to notice a size change. */
3525 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3535 /* Return 1 if PARMS specifies a fixed number of parameters
3536 and none of their types is affected by default promotions. */
3539 self_promoting_args_p (tree parms)
3542 for (t = parms; t; t = TREE_CHAIN (t))
3544 tree type = TREE_VALUE (t);
3546 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3552 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3555 if (c_promoting_integer_type_p (type))
3561 /* Recursively examines the array elements of TYPE, until a non-array
3562 element type is found. */
3565 strip_array_types (tree type)
3567 while (TREE_CODE (type) == ARRAY_TYPE)
3568 type = TREE_TYPE (type);
3573 /* Recursively remove any '*' or '&' operator from TYPE. */
3575 strip_pointer_operator (tree t)
3577 while (POINTER_TYPE_P (t))
3582 /* Used to compare case labels. K1 and K2 are actually tree nodes
3583 representing case labels, or NULL_TREE for a `default' label.
3584 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3585 K2, and 0 if K1 and K2 are equal. */
3588 case_compare (splay_tree_key k1, splay_tree_key k2)
3590 /* Consider a NULL key (such as arises with a `default' label) to be
3591 smaller than anything else. */
3597 return tree_int_cst_compare ((tree) k1, (tree) k2);
3600 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3601 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3602 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3603 case label was declared using the usual C/C++ syntax, rather than
3604 the GNU case range extension. CASES is a tree containing all the
3605 case ranges processed so far; COND is the condition for the
3606 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3607 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3610 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3611 tree low_value, tree high_value)
3616 splay_tree_node node;
3618 /* Create the LABEL_DECL itself. */
3619 label = create_artificial_label ();
3621 /* If there was an error processing the switch condition, bail now
3622 before we get more confused. */
3623 if (!cond || cond == error_mark_node)
3626 if ((low_value && TREE_TYPE (low_value)
3627 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3628 || (high_value && TREE_TYPE (high_value)
3629 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3631 error ("pointers are not permitted as case values");
3635 /* Case ranges are a GNU extension. */
3636 if (high_value && pedantic)
3637 pedwarn ("range expressions in switch statements are non-standard");
3639 type = TREE_TYPE (cond);
3642 low_value = check_case_value (low_value);
3643 low_value = convert_and_check (type, low_value);
3644 if (low_value == error_mark_node)
3649 high_value = check_case_value (high_value);
3650 high_value = convert_and_check (type, high_value);
3651 if (high_value == error_mark_node)
3655 if (low_value && high_value)
3657 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3658 really a case range, even though it was written that way.
3659 Remove the HIGH_VALUE to simplify later processing. */
3660 if (tree_int_cst_equal (low_value, high_value))
3661 high_value = NULL_TREE;
3662 else if (!tree_int_cst_lt (low_value, high_value))
3663 warning (0, "empty range specified");
3666 /* See if the case is in range of the type of the original testing
3667 expression. If both low_value and high_value are out of range,
3668 don't insert the case label and return NULL_TREE. */
3670 && !check_case_bounds (type, orig_type,
3671 &low_value, high_value ? &high_value : NULL))
3674 /* Look up the LOW_VALUE in the table of case labels we already
3676 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3677 /* If there was not an exact match, check for overlapping ranges.
3678 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3679 that's a `default' label and the only overlap is an exact match. */
3680 if (!node && (low_value || high_value))
3682 splay_tree_node low_bound;
3683 splay_tree_node high_bound;
3685 /* Even though there wasn't an exact match, there might be an
3686 overlap between this case range and another case range.
3687 Since we've (inductively) not allowed any overlapping case
3688 ranges, we simply need to find the greatest low case label
3689 that is smaller that LOW_VALUE, and the smallest low case
3690 label that is greater than LOW_VALUE. If there is an overlap
3691 it will occur in one of these two ranges. */
3692 low_bound = splay_tree_predecessor (cases,
3693 (splay_tree_key) low_value);
3694 high_bound = splay_tree_successor (cases,
3695 (splay_tree_key) low_value);
3697 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3698 the LOW_VALUE, so there is no need to check unless the
3699 LOW_BOUND is in fact itself a case range. */
3701 && CASE_HIGH ((tree) low_bound->value)
3702 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3705 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3706 range is bigger than the low end of the current range, so we
3707 are only interested if the current range is a real range, and
3708 not an ordinary case label. */
3711 && (tree_int_cst_compare ((tree) high_bound->key,
3716 /* If there was an overlap, issue an error. */
3719 tree duplicate = CASE_LABEL ((tree) node->value);
3723 error ("duplicate (or overlapping) case value");
3724 error ("%Jthis is the first entry overlapping that value", duplicate);
3728 error ("duplicate case value") ;
3729 error ("%Jpreviously used here", duplicate);
3733 error ("multiple default labels in one switch");
3734 error ("%Jthis is the first default label", duplicate);
3739 /* Add a CASE_LABEL to the statement-tree. */
3740 case_label = add_stmt (build_case_label (low_value, high_value, label));
3741 /* Register this case label in the splay tree. */
3742 splay_tree_insert (cases,
3743 (splay_tree_key) low_value,
3744 (splay_tree_value) case_label);
3749 /* Add a label so that the back-end doesn't think that the beginning of
3750 the switch is unreachable. Note that we do not add a case label, as
3751 that just leads to duplicates and thence to failure later on. */
3754 tree t = create_artificial_label ();
3755 add_stmt (build_stmt (LABEL_EXPR, t));
3757 return error_mark_node;
3760 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3761 Used to verify that case values match up with enumerator values. */
3764 match_case_to_enum_1 (tree key, tree type, tree label)
3766 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3768 /* ??? Not working too hard to print the double-word value.
3769 Should perhaps be done with %lwd in the diagnostic routines? */
3770 if (TREE_INT_CST_HIGH (key) == 0)
3771 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3772 TREE_INT_CST_LOW (key));
3773 else if (!TYPE_UNSIGNED (type)
3774 && TREE_INT_CST_HIGH (key) == -1
3775 && TREE_INT_CST_LOW (key) != 0)
3776 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3777 -TREE_INT_CST_LOW (key));
3779 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3780 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3782 if (TYPE_NAME (type) == 0)
3783 warning (0, "%Jcase value %qs not in enumerated type",
3784 CASE_LABEL (label), buf);
3786 warning (0, "%Jcase value %qs not in enumerated type %qT",
3787 CASE_LABEL (label), buf, type);
3791 match_case_to_enum (splay_tree_node node, void *data)
3793 tree label = (tree) node->value;
3794 tree type = (tree) data;
3796 /* Skip default case. */
3797 if (!CASE_LOW (label))
3800 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3801 when we did our enum->case scan. Reset our scratch bit after. */
3802 if (!TREE_ADDRESSABLE (label))
3803 match_case_to_enum_1 (CASE_LOW (label), type, label);
3805 TREE_ADDRESSABLE (label) = 0;
3807 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3808 Note that the old code in stmt.c did not check for the values in
3809 the range either, just the endpoints. */
3810 if (CASE_HIGH (label))
3812 tree chain, key = CASE_HIGH (label);
3814 for (chain = TYPE_VALUES (type);
3815 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
3816 chain = TREE_CHAIN (chain))
3819 match_case_to_enum_1 (key, type, label);
3825 /* Handle -Wswitch*. Called from the front end after parsing the
3826 switch construct. */
3827 /* ??? Should probably be somewhere generic, since other languages
3828 besides C and C++ would want this. At the moment, however, C/C++
3829 are the only tree-ssa languages that support enumerations at all,
3830 so the point is moot. */
3833 c_do_switch_warnings (splay_tree cases, location_t switch_location,
3834 tree type, tree cond)
3836 splay_tree_node default_node;
3838 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
3841 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3843 warning (OPT_Wswitch_default, "%Hswitch missing default case",
3846 /* If the switch expression was an enumerated type, check that
3847 exactly all enumeration literals are covered by the cases.
3848 The check is made when -Wswitch was specified and there is no
3849 default case, or when -Wswitch-enum was specified. */
3850 if (((warn_switch && !default_node) || warn_switch_enum)
3851 && type && TREE_CODE (type) == ENUMERAL_TYPE
3852 && TREE_CODE (cond) != INTEGER_CST)
3856 /* The time complexity here is O(N*lg(N)) worst case, but for the
3857 common case of monotonically increasing enumerators, it is
3858 O(N), since the nature of the splay tree will keep the next
3859 element adjacent to the root at all times. */
3861 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
3863 splay_tree_node node
3864 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
3867 tree low_value = TREE_VALUE (chain);
3868 splay_tree_node low_bound;
3869 splay_tree_node high_bound;
3870 /* Even though there wasn't an exact match, there might be a
3871 case range which includes the enumator's value. */
3872 low_bound = splay_tree_predecessor (cases,
3873 (splay_tree_key) low_value);
3874 high_bound = splay_tree_successor (cases,
3875 (splay_tree_key) low_value);
3877 /* It is smaller than the LOW_VALUE, so there is no need to check
3878 unless the LOW_BOUND is in fact itself a case range. */
3880 && CASE_HIGH ((tree) low_bound->value)
3881 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3884 /* The low end of that range is bigger than the current value. */
3886 && (tree_int_cst_compare ((tree) high_bound->key,
3893 /* Mark the CASE_LOW part of the case entry as seen, so
3894 that we save time later. Choose TREE_ADDRESSABLE
3895 randomly as a bit that won't have been set to-date. */
3896 tree label = (tree) node->value;
3897 TREE_ADDRESSABLE (label) = 1;
3901 /* Warn if there are enumerators that don't correspond to
3902 case expressions. */
3903 warning (0, "%Henumeration value %qE not handled in switch",
3904 &switch_location, TREE_PURPOSE (chain));
3908 /* Warn if there are case expressions that don't correspond to
3909 enumerators. This can occur since C and C++ don't enforce
3910 type-checking of assignments to enumeration variables.
3912 The time complexity here is O(N**2) worst case, since we've
3913 not sorted the enumeration values. However, in the absence
3914 of case ranges this is O(N), since all single cases that
3915 corresponded to enumerations have been marked above. */
3917 splay_tree_foreach (cases, match_case_to_enum, type);
3921 /* Finish an expression taking the address of LABEL (an
3922 IDENTIFIER_NODE). Returns an expression for the address. */
3925 finish_label_address_expr (tree label)
3930 pedwarn ("taking the address of a label is non-standard");
3932 if (label == error_mark_node)
3933 return error_mark_node;
3935 label = lookup_label (label);
3936 if (label == NULL_TREE)
3937 result = null_pointer_node;
3940 TREE_USED (label) = 1;
3941 result = build1 (ADDR_EXPR, ptr_type_node, label);
3942 /* The current function in not necessarily uninlinable.
3943 Computed gotos are incompatible with inlining, but the value
3944 here could be used only in a diagnostic, for example. */
3950 /* Hook used by expand_expr to expand language-specific tree codes. */
3951 /* The only things that should go here are bits needed to expand
3952 constant initializers. Everything else should be handled by the
3953 gimplification routines. */
3956 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
3957 int modifier /* Actually enum_modifier. */,
3960 switch (TREE_CODE (exp))
3962 case COMPOUND_LITERAL_EXPR:
3964 /* Initialize the anonymous variable declared in the compound
3965 literal, then return the variable. */
3966 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
3967 emit_local_var (decl);
3968 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
3976 /* Hook used by staticp to handle language-specific tree codes. */
3979 c_staticp (tree exp)
3981 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
3982 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
3987 /* Given a boolean expression ARG, return a tree representing an increment
3988 or decrement (as indicated by CODE) of ARG. The front end must check for
3989 invalid cases (e.g., decrement in C++). */
3991 boolean_increment (enum tree_code code, tree arg)
3994 tree true_res = boolean_true_node;
3996 arg = stabilize_reference (arg);
3999 case PREINCREMENT_EXPR:
4000 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4002 case POSTINCREMENT_EXPR:
4003 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4004 arg = save_expr (arg);
4005 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4006 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4008 case PREDECREMENT_EXPR:
4009 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4010 invert_truthvalue (arg));
4012 case POSTDECREMENT_EXPR:
4013 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
4014 invert_truthvalue (arg));
4015 arg = save_expr (arg);
4016 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4017 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4022 TREE_SIDE_EFFECTS (val) = 1;
4026 /* Built-in macros for stddef.h, that require macros defined in this
4029 c_stddef_cpp_builtins(void)
4031 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4032 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4033 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4034 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4035 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
4036 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
4040 c_init_attributes (void)
4042 /* Fill in the built_in_attributes array. */
4043 #define DEF_ATTR_NULL_TREE(ENUM) \
4044 built_in_attributes[(int) ENUM] = NULL_TREE;
4045 #define DEF_ATTR_INT(ENUM, VALUE) \
4046 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4047 #define DEF_ATTR_IDENT(ENUM, STRING) \
4048 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4049 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4050 built_in_attributes[(int) ENUM] \
4051 = tree_cons (built_in_attributes[(int) PURPOSE], \
4052 built_in_attributes[(int) VALUE], \
4053 built_in_attributes[(int) CHAIN]);
4054 #include "builtin-attrs.def"
4055 #undef DEF_ATTR_NULL_TREE
4057 #undef DEF_ATTR_IDENT
4058 #undef DEF_ATTR_TREE_LIST
4061 /* Attribute handlers common to C front ends. */
4063 /* Handle a "packed" attribute; arguments as in
4064 struct attribute_spec.handler. */
4067 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4068 int flags, bool *no_add_attrs)
4072 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4073 *node = build_variant_type_copy (*node);
4074 TYPE_PACKED (*node) = 1;
4075 if (TYPE_MAIN_VARIANT (*node) == *node)
4077 /* If it is the main variant, then pack the other variants
4078 too. This happens in,
4081 struct Foo const *ptr; // creates a variant w/o packed flag
4082 } __ attribute__((packed)); // packs it now.
4086 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
4087 TYPE_PACKED (probe) = 1;
4090 else if (TREE_CODE (*node) == FIELD_DECL)
4092 if (TYPE_ALIGN (TREE_TYPE (*node)) <= BITS_PER_UNIT)
4093 warning (OPT_Wattributes,
4094 "%qE attribute ignored for field of type %qT",
4095 name, TREE_TYPE (*node));
4097 DECL_PACKED (*node) = 1;
4099 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4100 used for DECL_REGISTER. It wouldn't mean anything anyway.
4101 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4102 that changes what the typedef is typing. */
4105 warning (OPT_Wattributes, "%qE attribute ignored", name);
4106 *no_add_attrs = true;
4112 /* Handle a "nocommon" attribute; arguments as in
4113 struct attribute_spec.handler. */
4116 handle_nocommon_attribute (tree *node, tree name,
4117 tree ARG_UNUSED (args),
4118 int ARG_UNUSED (flags), bool *no_add_attrs)
4120 if (TREE_CODE (*node) == VAR_DECL)
4121 DECL_COMMON (*node) = 0;
4124 warning (OPT_Wattributes, "%qE attribute ignored", name);
4125 *no_add_attrs = true;
4131 /* Handle a "common" attribute; arguments as in
4132 struct attribute_spec.handler. */
4135 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4136 int ARG_UNUSED (flags), bool *no_add_attrs)
4138 if (TREE_CODE (*node) == VAR_DECL)
4139 DECL_COMMON (*node) = 1;
4142 warning (OPT_Wattributes, "%qE attribute ignored", name);
4143 *no_add_attrs = true;
4149 /* Handle a "noreturn" attribute; arguments as in
4150 struct attribute_spec.handler. */
4153 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4154 int ARG_UNUSED (flags), bool *no_add_attrs)
4156 tree type = TREE_TYPE (*node);
4158 /* See FIXME comment in c_common_attribute_table. */
4159 if (TREE_CODE (*node) == FUNCTION_DECL)
4160 TREE_THIS_VOLATILE (*node) = 1;
4161 else if (TREE_CODE (type) == POINTER_TYPE
4162 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4164 = build_pointer_type
4165 (build_type_variant (TREE_TYPE (type),
4166 TYPE_READONLY (TREE_TYPE (type)), 1));
4169 warning (OPT_Wattributes, "%qE attribute ignored", name);
4170 *no_add_attrs = true;
4176 /* Handle a "noinline" attribute; arguments as in
4177 struct attribute_spec.handler. */
4180 handle_noinline_attribute (tree *node, tree name,
4181 tree ARG_UNUSED (args),
4182 int ARG_UNUSED (flags), bool *no_add_attrs)
4184 if (TREE_CODE (*node) == FUNCTION_DECL)
4185 DECL_UNINLINABLE (*node) = 1;
4188 warning (OPT_Wattributes, "%qE attribute ignored", name);
4189 *no_add_attrs = true;
4195 /* Handle a "always_inline" attribute; arguments as in
4196 struct attribute_spec.handler. */
4199 handle_always_inline_attribute (tree *node, tree name,
4200 tree ARG_UNUSED (args),
4201 int ARG_UNUSED (flags),
4204 if (TREE_CODE (*node) == FUNCTION_DECL)
4206 /* Do nothing else, just set the attribute. We'll get at
4207 it later with lookup_attribute. */
4211 warning (OPT_Wattributes, "%qE attribute ignored", name);
4212 *no_add_attrs = true;
4218 /* Handle a "flatten" attribute; arguments as in
4219 struct attribute_spec.handler. */
4222 handle_flatten_attribute (tree *node, tree name,
4223 tree args ATTRIBUTE_UNUSED,
4224 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4226 if (TREE_CODE (*node) == FUNCTION_DECL)
4227 /* Do nothing else, just set the attribute. We'll get at
4228 it later with lookup_attribute. */
4232 warning (OPT_Wattributes, "%qE attribute ignored", name);
4233 *no_add_attrs = true;
4240 /* Handle a "used" attribute; arguments as in
4241 struct attribute_spec.handler. */
4244 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4245 int ARG_UNUSED (flags), bool *no_add_attrs)
4249 if (TREE_CODE (node) == FUNCTION_DECL
4250 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4252 TREE_USED (node) = 1;
4253 DECL_PRESERVE_P (node) = 1;
4257 warning (OPT_Wattributes, "%qE attribute ignored", name);
4258 *no_add_attrs = true;
4264 /* Handle a "unused" attribute; arguments as in
4265 struct attribute_spec.handler. */
4268 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4269 int flags, bool *no_add_attrs)
4275 if (TREE_CODE (decl) == PARM_DECL
4276 || TREE_CODE (decl) == VAR_DECL
4277 || TREE_CODE (decl) == FUNCTION_DECL
4278 || TREE_CODE (decl) == LABEL_DECL
4279 || TREE_CODE (decl) == TYPE_DECL)
4280 TREE_USED (decl) = 1;
4283 warning (OPT_Wattributes, "%qE attribute ignored", name);
4284 *no_add_attrs = true;
4289 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4290 *node = build_variant_type_copy (*node);
4291 TREE_USED (*node) = 1;
4297 /* Handle a "externally_visible" attribute; arguments as in
4298 struct attribute_spec.handler. */
4301 handle_externally_visible_attribute (tree *pnode, tree name,
4302 tree ARG_UNUSED (args),
4303 int ARG_UNUSED (flags),
4308 if ((!TREE_STATIC (node) && TREE_CODE (node) != FUNCTION_DECL)
4309 || !TREE_PUBLIC (node))
4311 warning (OPT_Wattributes,
4312 "%qE attribute have effect only on public objects", name);
4313 *no_add_attrs = true;
4315 else if (TREE_CODE (node) == FUNCTION_DECL)
4317 struct cgraph_node *n = cgraph_node (node);
4318 n->local.externally_visible = true;
4319 if (n->local.finalized)
4320 cgraph_mark_needed_node (n);
4322 else if (TREE_CODE (node) == VAR_DECL)
4324 struct cgraph_varpool_node *n = cgraph_varpool_node (node);
4325 n->externally_visible = true;
4327 cgraph_varpool_mark_needed_node (n);
4331 warning (OPT_Wattributes, "%qE attribute ignored", name);
4332 *no_add_attrs = true;
4338 /* Handle a "const" attribute; arguments as in
4339 struct attribute_spec.handler. */
4342 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4343 int ARG_UNUSED (flags), bool *no_add_attrs)
4345 tree type = TREE_TYPE (*node);
4347 /* See FIXME comment on noreturn in c_common_attribute_table. */
4348 if (TREE_CODE (*node) == FUNCTION_DECL)
4349 TREE_READONLY (*node) = 1;
4350 else if (TREE_CODE (type) == POINTER_TYPE
4351 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4353 = build_pointer_type
4354 (build_type_variant (TREE_TYPE (type), 1,
4355 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4358 warning (OPT_Wattributes, "%qE attribute ignored", name);
4359 *no_add_attrs = true;
4365 /* Handle a "transparent_union" attribute; arguments as in
4366 struct attribute_spec.handler. */
4369 handle_transparent_union_attribute (tree *node, tree name,
4370 tree ARG_UNUSED (args), int flags,
4375 *no_add_attrs = true;
4379 if (TREE_CODE (*node) != TYPE_DECL)
4381 node = &TREE_TYPE (*node);
4384 else if (TYPE_P (*node))
4389 if (TREE_CODE (type) == UNION_TYPE)
4391 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4392 the code in finish_struct. */
4393 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4395 if (TYPE_FIELDS (type) == NULL_TREE
4396 || TYPE_MODE (type) != DECL_MODE (TYPE_FIELDS (type)))
4399 /* A type variant isn't good enough, since we don't a cast
4400 to such a type removed as a no-op. */
4401 *node = type = build_duplicate_type (type);
4404 TYPE_TRANSPARENT_UNION (type) = 1;
4409 warning (OPT_Wattributes, "%qE attribute ignored", name);
4413 /* Handle a "constructor" attribute; arguments as in
4414 struct attribute_spec.handler. */
4417 handle_constructor_attribute (tree *node, tree name,
4418 tree ARG_UNUSED (args),
4419 int ARG_UNUSED (flags),
4423 tree type = TREE_TYPE (decl);
4425 if (TREE_CODE (decl) == FUNCTION_DECL
4426 && TREE_CODE (type) == FUNCTION_TYPE
4427 && decl_function_context (decl) == 0)
4429 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4430 TREE_USED (decl) = 1;
4434 warning (OPT_Wattributes, "%qE attribute ignored", name);
4435 *no_add_attrs = true;
4441 /* Handle a "destructor" attribute; arguments as in
4442 struct attribute_spec.handler. */
4445 handle_destructor_attribute (tree *node, tree name,
4446 tree ARG_UNUSED (args),
4447 int ARG_UNUSED (flags),
4451 tree type = TREE_TYPE (decl);
4453 if (TREE_CODE (decl) == FUNCTION_DECL
4454 && TREE_CODE (type) == FUNCTION_TYPE
4455 && decl_function_context (decl) == 0)
4457 DECL_STATIC_DESTRUCTOR (decl) = 1;
4458 TREE_USED (decl) = 1;
4462 warning (OPT_Wattributes, "%qE attribute ignored", name);
4463 *no_add_attrs = true;
4469 /* Handle a "mode" attribute; arguments as in
4470 struct attribute_spec.handler. */
4473 handle_mode_attribute (tree *node, tree name, tree args,
4474 int ARG_UNUSED (flags), bool *no_add_attrs)
4478 *no_add_attrs = true;
4480 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4481 warning (OPT_Wattributes, "%qE attribute ignored", name);
4485 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4486 int len = strlen (p);
4487 enum machine_mode mode = VOIDmode;
4491 if (len > 4 && p[0] == '_' && p[1] == '_'
4492 && p[len - 1] == '_' && p[len - 2] == '_')
4494 char *newp = (char *) alloca (len - 1);
4496 strcpy (newp, &p[2]);
4497 newp[len - 4] = '\0';
4501 /* Change this type to have a type with the specified mode.
4502 First check for the special modes. */
4503 if (!strcmp (p, "byte"))
4505 else if (!strcmp (p, "word"))
4507 else if (!strcmp (p, "pointer"))
4510 for (j = 0; j < NUM_MACHINE_MODES; j++)
4511 if (!strcmp (p, GET_MODE_NAME (j)))
4513 mode = (enum machine_mode) j;
4517 if (mode == VOIDmode)
4519 error ("unknown machine mode %qs", p);
4524 switch (GET_MODE_CLASS (mode))
4527 case MODE_PARTIAL_INT:
4529 case MODE_DECIMAL_FLOAT:
4530 valid_mode = targetm.scalar_mode_supported_p (mode);
4533 case MODE_COMPLEX_INT:
4534 case MODE_COMPLEX_FLOAT:
4535 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
4538 case MODE_VECTOR_INT:
4539 case MODE_VECTOR_FLOAT:
4540 warning (OPT_Wattributes, "specifying vector types with "
4541 "__attribute__ ((mode)) is deprecated");
4542 warning (OPT_Wattributes,
4543 "use __attribute__ ((vector_size)) instead");
4544 valid_mode = vector_mode_valid_p (mode);
4552 error ("unable to emulate %qs", p);
4556 if (POINTER_TYPE_P (type))
4558 tree (*fn)(tree, enum machine_mode, bool);
4560 if (!targetm.valid_pointer_mode (mode))
4562 error ("invalid pointer mode %qs", p);
4566 if (TREE_CODE (type) == POINTER_TYPE)
4567 fn = build_pointer_type_for_mode;
4569 fn = build_reference_type_for_mode;
4570 typefm = fn (TREE_TYPE (type), mode, false);
4573 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4575 if (typefm == NULL_TREE)
4577 error ("no data type for mode %qs", p);
4580 else if (TREE_CODE (type) == ENUMERAL_TYPE)
4582 /* For enumeral types, copy the precision from the integer
4583 type returned above. If not an INTEGER_TYPE, we can't use
4584 this mode for this type. */
4585 if (TREE_CODE (typefm) != INTEGER_TYPE)
4587 error ("cannot use mode %qs for enumeral types", p);
4591 if (flags & ATTR_FLAG_TYPE_IN_PLACE)
4593 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
4598 /* We cannot build a type variant, as there's code that assumes
4599 that TYPE_MAIN_VARIANT has the same mode. This includes the
4600 debug generators. Instead, create a subrange type. This
4601 results in all of the enumeral values being emitted only once
4602 in the original, and the subtype gets them by reference. */
4603 if (TYPE_UNSIGNED (type))
4604 typefm = make_unsigned_type (TYPE_PRECISION (typefm));
4606 typefm = make_signed_type (TYPE_PRECISION (typefm));
4607 TREE_TYPE (typefm) = type;
4610 else if (VECTOR_MODE_P (mode)
4611 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
4612 : TREE_CODE (type) != TREE_CODE (typefm))
4614 error ("mode %qs applied to inappropriate type", p);
4624 /* Handle a "section" attribute; arguments as in
4625 struct attribute_spec.handler. */
4628 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4629 int ARG_UNUSED (flags), bool *no_add_attrs)
4633 if (targetm.have_named_sections)
4635 user_defined_section_attribute = true;
4637 if ((TREE_CODE (decl) == FUNCTION_DECL
4638 || TREE_CODE (decl) == VAR_DECL)
4639 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4641 if (TREE_CODE (decl) == VAR_DECL
4642 && current_function_decl != NULL_TREE
4643 && !TREE_STATIC (decl))
4645 error ("%Jsection attribute cannot be specified for "
4646 "local variables", decl);
4647 *no_add_attrs = true;
4650 /* The decl may have already been given a section attribute
4651 from a previous declaration. Ensure they match. */
4652 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4653 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4654 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4656 error ("section of %q+D conflicts with previous declaration",
4658 *no_add_attrs = true;
4661 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4665 error ("section attribute not allowed for %q+D", *node);
4666 *no_add_attrs = true;
4671 error ("%Jsection attributes are not supported for this target", *node);
4672 *no_add_attrs = true;
4678 /* Handle a "aligned" attribute; arguments as in
4679 struct attribute_spec.handler. */
4682 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4683 int flags, bool *no_add_attrs)
4685 tree decl = NULL_TREE;
4688 tree align_expr = (args ? TREE_VALUE (args)
4689 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4695 type = &TREE_TYPE (decl);
4696 is_type = TREE_CODE (*node) == TYPE_DECL;
4698 else if (TYPE_P (*node))
4699 type = node, is_type = 1;
4701 if (TREE_CODE (align_expr) != INTEGER_CST)
4703 error ("requested alignment is not a constant");
4704 *no_add_attrs = true;
4706 else if ((i = tree_log2 (align_expr)) == -1)
4708 error ("requested alignment is not a power of 2");
4709 *no_add_attrs = true;
4711 else if (i > HOST_BITS_PER_INT - 2)
4713 error ("requested alignment is too large");
4714 *no_add_attrs = true;
4718 /* If we have a TYPE_DECL, then copy the type, so that we
4719 don't accidentally modify a builtin type. See pushdecl. */
4720 if (decl && TREE_TYPE (decl) != error_mark_node
4721 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4723 tree tt = TREE_TYPE (decl);
4724 *type = build_variant_type_copy (*type);
4725 DECL_ORIGINAL_TYPE (decl) = tt;
4726 TYPE_NAME (*type) = decl;
4727 TREE_USED (*type) = TREE_USED (decl);
4728 TREE_TYPE (decl) = *type;
4730 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4731 *type = build_variant_type_copy (*type);
4733 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4734 TYPE_USER_ALIGN (*type) = 1;
4736 else if (TREE_CODE (decl) != VAR_DECL
4737 && TREE_CODE (decl) != FIELD_DECL)
4739 error ("alignment may not be specified for %q+D", decl);
4740 *no_add_attrs = true;
4744 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4745 DECL_USER_ALIGN (decl) = 1;
4751 /* Handle a "weak" attribute; arguments as in
4752 struct attribute_spec.handler. */
4755 handle_weak_attribute (tree *node, tree ARG_UNUSED (name),
4756 tree ARG_UNUSED (args),
4757 int ARG_UNUSED (flags),
4758 bool * ARG_UNUSED (no_add_attrs))
4760 declare_weak (*node);
4765 /* Handle an "alias" attribute; arguments as in
4766 struct attribute_spec.handler. */
4769 handle_alias_attribute (tree *node, tree name, tree args,
4770 int ARG_UNUSED (flags), bool *no_add_attrs)
4774 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4775 || (TREE_CODE (decl) != FUNCTION_DECL
4776 && TREE_PUBLIC (decl) && !DECL_EXTERNAL (decl))
4777 /* A static variable declaration is always a tentative definition,
4778 but the alias is a non-tentative definition which overrides. */
4779 || (TREE_CODE (decl) != FUNCTION_DECL
4780 && ! TREE_PUBLIC (decl) && DECL_INITIAL (decl)))
4782 error ("%q+D defined both normally and as an alias", decl);
4783 *no_add_attrs = true;
4786 /* Note that the very first time we process a nested declaration,
4787 decl_function_context will not be set. Indeed, *would* never
4788 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4789 we do below. After such frobbery, pushdecl would set the context.
4790 In any case, this is never what we want. */
4791 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4795 id = TREE_VALUE (args);
4796 if (TREE_CODE (id) != STRING_CST)
4798 error ("alias argument not a string");
4799 *no_add_attrs = true;
4802 id = get_identifier (TREE_STRING_POINTER (id));
4803 /* This counts as a use of the object pointed to. */
4806 if (TREE_CODE (decl) == FUNCTION_DECL)
4807 DECL_INITIAL (decl) = error_mark_node;
4810 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
4811 DECL_EXTERNAL (decl) = 1;
4813 DECL_EXTERNAL (decl) = 0;
4814 TREE_STATIC (decl) = 1;
4819 warning (OPT_Wattributes, "%qE attribute ignored", name);
4820 *no_add_attrs = true;
4826 /* Handle a "weakref" attribute; arguments as in struct
4827 attribute_spec.handler. */
4830 handle_weakref_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4831 int flags, bool *no_add_attrs)
4833 tree attr = NULL_TREE;
4835 /* The idea here is that `weakref("name")' mutates into `weakref,
4836 alias("name")', and weakref without arguments, in turn,
4837 implicitly adds weak. */
4841 attr = tree_cons (get_identifier ("alias"), args, attr);
4842 attr = tree_cons (get_identifier ("weakref"), NULL_TREE, attr);
4844 *no_add_attrs = true;
4846 decl_attributes (node, attr, flags);
4850 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node)))
4851 error ("%Jweakref attribute must appear before alias attribute",
4854 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
4855 and that isn't supported; and because it wants to add it to
4856 the list of weak decls, which isn't helpful. */
4857 DECL_WEAK (*node) = 1;
4863 /* Handle an "visibility" attribute; arguments as in
4864 struct attribute_spec.handler. */
4867 handle_visibility_attribute (tree *node, tree name, tree args,
4868 int ARG_UNUSED (flags),
4872 tree id = TREE_VALUE (args);
4874 *no_add_attrs = true;
4878 if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
4880 warning (OPT_Wattributes, "%qE attribute ignored on non-class types",
4885 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
4887 warning (OPT_Wattributes, "%qE attribute ignored", name);
4891 if (TREE_CODE (id) != STRING_CST)
4893 error ("visibility argument not a string");
4897 /* If this is a type, set the visibility on the type decl. */
4900 decl = TYPE_NAME (decl);
4903 if (TREE_CODE (decl) == IDENTIFIER_NODE)
4905 warning (OPT_Wattributes, "%qE attribute ignored on types",
4911 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4912 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4913 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4914 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4915 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4916 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4917 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4918 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4920 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4921 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4923 /* For decls only, go ahead and attach the attribute to the node as well.
4924 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4925 because the visibility was not specified, or because it was explicitly
4926 overridden from the class visibility. */
4928 *no_add_attrs = false;
4933 /* Determine the ELF symbol visibility for DECL, which is either a
4934 variable or a function. It is an error to use this function if a
4935 definition of DECL is not available in this translation unit.
4936 Returns true if the final visibility has been determined by this
4937 function; false if the caller is free to make additional
4941 c_determine_visibility (tree decl)
4943 gcc_assert (TREE_CODE (decl) == VAR_DECL
4944 || TREE_CODE (decl) == FUNCTION_DECL);
4946 /* If the user explicitly specified the visibility with an
4947 attribute, honor that. DECL_VISIBILITY will have been set during
4948 the processing of the attribute. We check for an explicit
4949 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4950 to distinguish the use of an attribute from the use of a "#pragma
4951 GCC visibility push(...)"; in the latter case we still want other
4952 considerations to be able to overrule the #pragma. */
4953 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
4956 /* Anything that is exported must have default visibility. */
4957 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4958 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
4960 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4961 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4968 /* Handle an "tls_model" attribute; arguments as in
4969 struct attribute_spec.handler. */
4972 handle_tls_model_attribute (tree *node, tree name, tree args,
4973 int ARG_UNUSED (flags), bool *no_add_attrs)
4977 enum tls_model kind;
4979 *no_add_attrs = true;
4981 if (!DECL_THREAD_LOCAL_P (decl))
4983 warning (OPT_Wattributes, "%qE attribute ignored", name);
4987 kind = DECL_TLS_MODEL (decl);
4988 id = TREE_VALUE (args);
4989 if (TREE_CODE (id) != STRING_CST)
4991 error ("tls_model argument not a string");
4995 if (!strcmp (TREE_STRING_POINTER (id), "local-exec"))
4996 kind = TLS_MODEL_LOCAL_EXEC;
4997 else if (!strcmp (TREE_STRING_POINTER (id), "initial-exec"))
4998 kind = TLS_MODEL_INITIAL_EXEC;
4999 else if (!strcmp (TREE_STRING_POINTER (id), "local-dynamic"))
5000 kind = optimize ? TLS_MODEL_LOCAL_DYNAMIC : TLS_MODEL_GLOBAL_DYNAMIC;
5001 else if (!strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5002 kind = TLS_MODEL_GLOBAL_DYNAMIC;
5004 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5006 DECL_TLS_MODEL (decl) = kind;
5010 /* Handle a "no_instrument_function" attribute; arguments as in
5011 struct attribute_spec.handler. */
5014 handle_no_instrument_function_attribute (tree *node, tree name,
5015 tree ARG_UNUSED (args),
5016 int ARG_UNUSED (flags),
5021 if (TREE_CODE (decl) != FUNCTION_DECL)
5023 error ("%J%qE attribute applies only to functions", decl, name);
5024 *no_add_attrs = true;
5026 else if (DECL_INITIAL (decl))
5028 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5029 *no_add_attrs = true;
5032 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5037 /* Handle a "malloc" attribute; arguments as in
5038 struct attribute_spec.handler. */
5041 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5042 int ARG_UNUSED (flags), bool *no_add_attrs)
5044 if (TREE_CODE (*node) == FUNCTION_DECL
5045 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node))))
5046 DECL_IS_MALLOC (*node) = 1;
5049 warning (OPT_Wattributes, "%qE attribute ignored", name);
5050 *no_add_attrs = true;
5056 /* Handle a "returns_twice" attribute; arguments as in
5057 struct attribute_spec.handler. */
5060 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5061 int ARG_UNUSED (flags), bool *no_add_attrs)
5063 if (TREE_CODE (*node) == FUNCTION_DECL)
5064 DECL_IS_RETURNS_TWICE (*node) = 1;
5067 warning (OPT_Wattributes, "%qE attribute ignored", name);
5068 *no_add_attrs = true;
5074 /* Handle a "no_limit_stack" attribute; arguments as in
5075 struct attribute_spec.handler. */
5078 handle_no_limit_stack_attribute (tree *node, tree name,
5079 tree ARG_UNUSED (args),
5080 int ARG_UNUSED (flags),
5085 if (TREE_CODE (decl) != FUNCTION_DECL)
5087 error ("%J%qE attribute applies only to functions", decl, name);
5088 *no_add_attrs = true;
5090 else if (DECL_INITIAL (decl))
5092 error ("%Jcan%'t set %qE attribute after definition", decl, name);
5093 *no_add_attrs = true;
5096 DECL_NO_LIMIT_STACK (decl) = 1;
5101 /* Handle a "pure" attribute; arguments as in
5102 struct attribute_spec.handler. */
5105 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5106 int ARG_UNUSED (flags), bool *no_add_attrs)
5108 if (TREE_CODE (*node) == FUNCTION_DECL)
5109 DECL_IS_PURE (*node) = 1;
5110 /* ??? TODO: Support types. */
5113 warning (OPT_Wattributes, "%qE attribute ignored", name);
5114 *no_add_attrs = true;
5120 /* Handle a "no vops" attribute; arguments as in
5121 struct attribute_spec.handler. */
5124 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
5125 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
5126 bool *ARG_UNUSED (no_add_attrs))
5128 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
5129 DECL_IS_NOVOPS (*node) = 1;
5133 /* Handle a "deprecated" attribute; arguments as in
5134 struct attribute_spec.handler. */
5137 handle_deprecated_attribute (tree *node, tree name,
5138 tree ARG_UNUSED (args), int flags,
5141 tree type = NULL_TREE;
5143 tree what = NULL_TREE;
5148 type = TREE_TYPE (decl);
5150 if (TREE_CODE (decl) == TYPE_DECL
5151 || TREE_CODE (decl) == PARM_DECL
5152 || TREE_CODE (decl) == VAR_DECL
5153 || TREE_CODE (decl) == FUNCTION_DECL
5154 || TREE_CODE (decl) == FIELD_DECL)
5155 TREE_DEPRECATED (decl) = 1;
5159 else if (TYPE_P (*node))
5161 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5162 *node = build_variant_type_copy (*node);
5163 TREE_DEPRECATED (*node) = 1;
5171 *no_add_attrs = true;
5172 if (type && TYPE_NAME (type))
5174 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5175 what = TYPE_NAME (*node);
5176 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5177 && DECL_NAME (TYPE_NAME (type)))
5178 what = DECL_NAME (TYPE_NAME (type));
5181 warning (OPT_Wattributes, "%qE attribute ignored for %qE", name, what);
5183 warning (OPT_Wattributes, "%qE attribute ignored", name);
5189 /* Handle a "vector_size" attribute; arguments as in
5190 struct attribute_spec.handler. */
5193 handle_vector_size_attribute (tree *node, tree name, tree args,
5194 int ARG_UNUSED (flags),
5197 unsigned HOST_WIDE_INT vecsize, nunits;
5198 enum machine_mode orig_mode;
5199 tree type = *node, new_type, size;
5201 *no_add_attrs = true;
5203 size = TREE_VALUE (args);
5205 if (!host_integerp (size, 1))
5207 warning (OPT_Wattributes, "%qE attribute ignored", name);
5211 /* Get the vector size (in bytes). */
5212 vecsize = tree_low_cst (size, 1);
5214 /* We need to provide for vector pointers, vector arrays, and
5215 functions returning vectors. For example:
5217 __attribute__((vector_size(16))) short *foo;
5219 In this case, the mode is SI, but the type being modified is
5220 HI, so we need to look further. */
5222 while (POINTER_TYPE_P (type)
5223 || TREE_CODE (type) == FUNCTION_TYPE
5224 || TREE_CODE (type) == METHOD_TYPE
5225 || TREE_CODE (type) == ARRAY_TYPE)
5226 type = TREE_TYPE (type);
5228 /* Get the mode of the type being modified. */
5229 orig_mode = TYPE_MODE (type);
5231 if (TREE_CODE (type) == RECORD_TYPE
5232 || (!SCALAR_FLOAT_MODE_P (orig_mode)
5233 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5234 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
5236 error ("invalid vector type for attribute %qE", name);
5240 if (vecsize % tree_low_cst (TYPE_SIZE_UNIT (type), 1))
5242 error ("vector size not an integral multiple of component size");
5248 error ("zero vector size");
5252 /* Calculate how many units fit in the vector. */
5253 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5254 if (nunits & (nunits - 1))
5256 error ("number of components of the vector not a power of two");
5260 new_type = build_vector_type (type, nunits);
5262 /* Build back pointers if needed. */
5263 *node = reconstruct_complex_type (*node, new_type);
5268 /* Handle the "nonnull" attribute. */
5270 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
5271 tree args, int ARG_UNUSED (flags),
5275 unsigned HOST_WIDE_INT attr_arg_num;
5277 /* If no arguments are specified, all pointer arguments should be
5278 non-null. Verify a full prototype is given so that the arguments
5279 will have the correct types when we actually check them later. */
5282 if (!TYPE_ARG_TYPES (type))
5284 error ("nonnull attribute without arguments on a non-prototype");
5285 *no_add_attrs = true;
5290 /* Argument list specified. Verify that each argument number references
5291 a pointer argument. */
5292 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5295 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5297 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
5299 error ("nonnull argument has invalid operand number (argument %lu)",
5300 (unsigned long) attr_arg_num);
5301 *no_add_attrs = true;
5305 argument = TYPE_ARG_TYPES (type);
5308 for (ck_num = 1; ; ck_num++)
5310 if (!argument || ck_num == arg_num)
5312 argument = TREE_CHAIN (argument);
5316 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5318 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5319 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5320 *no_add_attrs = true;
5324 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5326 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5327 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5328 *no_add_attrs = true;
5337 /* Check the argument list of a function call for null in argument slots
5338 that are marked as requiring a non-null pointer argument. */
5341 check_function_nonnull (tree attrs, tree params)
5343 tree a, args, param;
5346 for (a = attrs; a; a = TREE_CHAIN (a))
5348 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5350 args = TREE_VALUE (a);
5352 /* Walk the argument list. If we encounter an argument number we
5353 should check for non-null, do it. If the attribute has no args,
5354 then every pointer argument is checked (in which case the check
5355 for pointer type is done in check_nonnull_arg). */
5356 for (param = params, param_num = 1; ;
5357 param_num++, param = TREE_CHAIN (param))
5361 if (!args || nonnull_check_p (args, param_num))
5362 check_function_arguments_recurse (check_nonnull_arg, NULL,
5370 /* Check that the Nth argument of a function call (counting backwards
5371 from the end) is a (pointer)0. */
5374 check_function_sentinel (tree attrs, tree params, tree typelist)
5376 tree attr = lookup_attribute ("sentinel", attrs);
5380 /* Skip over the named arguments. */
5381 while (typelist && params)
5383 typelist = TREE_CHAIN (typelist);
5384 params = TREE_CHAIN (params);
5387 if (typelist || !params)
5388 warning (OPT_Wformat,
5389 "not enough variable arguments to fit a sentinel");
5395 if (TREE_VALUE (attr))
5397 tree p = TREE_VALUE (TREE_VALUE (attr));
5398 pos = TREE_INT_CST_LOW (p);
5401 sentinel = end = params;
5403 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5404 while (pos > 0 && TREE_CHAIN (end))
5407 end = TREE_CHAIN (end);
5411 warning (OPT_Wformat,
5412 "not enough variable arguments to fit a sentinel");
5416 /* Now advance both until we find the last parameter. */
5417 while (TREE_CHAIN (end))
5419 end = TREE_CHAIN (end);
5420 sentinel = TREE_CHAIN (sentinel);
5423 /* Validate the sentinel. */
5424 if ((!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel)))
5425 || !integer_zerop (TREE_VALUE (sentinel)))
5426 /* Although __null (in C++) is only an integer we allow it
5427 nevertheless, as we are guaranteed that it's exactly
5428 as wide as a pointer, and we don't want to force
5429 users to cast the NULL they have written there.
5430 We warn with -Wstrict-null-sentinel, though. */
5431 && (warn_strict_null_sentinel
5432 || null_node != TREE_VALUE (sentinel)))
5433 warning (OPT_Wformat, "missing sentinel in function call");
5438 /* Helper for check_function_nonnull; given a list of operands which
5439 must be non-null in ARGS, determine if operand PARAM_NUM should be
5443 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5445 unsigned HOST_WIDE_INT arg_num = 0;
5447 for (; args; args = TREE_CHAIN (args))
5449 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
5453 if (arg_num == param_num)
5459 /* Check that the function argument PARAM (which is operand number
5460 PARAM_NUM) is non-null. This is called by check_function_nonnull
5461 via check_function_arguments_recurse. */
5464 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5465 unsigned HOST_WIDE_INT param_num)
5467 /* Just skip checking the argument if it's not a pointer. This can
5468 happen if the "nonnull" attribute was given without an operand
5469 list (which means to check every pointer argument). */
5471 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5474 if (integer_zerop (param))
5475 warning (OPT_Wnonnull, "null argument where non-null required "
5476 "(argument %lu)", (unsigned long) param_num);
5479 /* Helper for nonnull attribute handling; fetch the operand number
5480 from the attribute argument list. */
5483 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5485 /* Verify the arg number is a constant. */
5486 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5487 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5490 *valp = TREE_INT_CST_LOW (arg_num_expr);
5494 /* Handle a "nothrow" attribute; arguments as in
5495 struct attribute_spec.handler. */
5498 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5499 int ARG_UNUSED (flags), bool *no_add_attrs)
5501 if (TREE_CODE (*node) == FUNCTION_DECL)
5502 TREE_NOTHROW (*node) = 1;
5503 /* ??? TODO: Support types. */
5506 warning (OPT_Wattributes, "%qE attribute ignored", name);
5507 *no_add_attrs = true;
5513 /* Handle a "cleanup" attribute; arguments as in
5514 struct attribute_spec.handler. */
5517 handle_cleanup_attribute (tree *node, tree name, tree args,
5518 int ARG_UNUSED (flags), bool *no_add_attrs)
5521 tree cleanup_id, cleanup_decl;
5523 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5524 for global destructors in C++. This requires infrastructure that
5525 we don't have generically at the moment. It's also not a feature
5526 we'd be missing too much, since we do have attribute constructor. */
5527 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5529 warning (OPT_Wattributes, "%qE attribute ignored", name);
5530 *no_add_attrs = true;
5534 /* Verify that the argument is a function in scope. */
5535 /* ??? We could support pointers to functions here as well, if
5536 that was considered desirable. */
5537 cleanup_id = TREE_VALUE (args);
5538 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5540 error ("cleanup argument not an identifier");
5541 *no_add_attrs = true;
5544 cleanup_decl = lookup_name (cleanup_id);
5545 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5547 error ("cleanup argument not a function");
5548 *no_add_attrs = true;
5552 /* That the function has proper type is checked with the
5553 eventual call to build_function_call. */
5558 /* Handle a "warn_unused_result" attribute. No special handling. */
5561 handle_warn_unused_result_attribute (tree *node, tree name,
5562 tree ARG_UNUSED (args),
5563 int ARG_UNUSED (flags), bool *no_add_attrs)
5565 /* Ignore the attribute for functions not returning any value. */
5566 if (VOID_TYPE_P (TREE_TYPE (*node)))
5568 warning (OPT_Wattributes, "%qE attribute ignored", name);
5569 *no_add_attrs = true;
5575 /* Handle a "sentinel" attribute. */
5578 handle_sentinel_attribute (tree *node, tree name, tree args,
5579 int ARG_UNUSED (flags), bool *no_add_attrs)
5581 tree params = TYPE_ARG_TYPES (*node);
5585 warning (OPT_Wattributes,
5586 "%qE attribute requires prototypes with named arguments", name);
5587 *no_add_attrs = true;
5591 while (TREE_CHAIN (params))
5592 params = TREE_CHAIN (params);
5594 if (VOID_TYPE_P (TREE_VALUE (params)))
5596 warning (OPT_Wattributes,
5597 "%qE attribute only applies to variadic functions", name);
5598 *no_add_attrs = true;
5604 tree position = TREE_VALUE (args);
5606 if (TREE_CODE (position) != INTEGER_CST)
5608 warning (0, "requested position is not an integer constant");
5609 *no_add_attrs = true;
5613 if (tree_int_cst_lt (position, integer_zero_node))
5615 warning (0, "requested position is less than zero");
5616 *no_add_attrs = true;
5624 /* Check for valid arguments being passed to a function. */
5626 check_function_arguments (tree attrs, tree params, tree typelist)
5628 /* Check for null being passed in a pointer argument that must be
5629 non-null. We also need to do this if format checking is enabled. */
5632 check_function_nonnull (attrs, params);
5634 /* Check for errors in format strings. */
5636 if (warn_format || warn_missing_format_attribute)
5637 check_function_format (attrs, params);
5640 check_function_sentinel (attrs, params, typelist);
5643 /* Generic argument checking recursion routine. PARAM is the argument to
5644 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5645 once the argument is resolved. CTX is context for the callback. */
5647 check_function_arguments_recurse (void (*callback)
5648 (void *, tree, unsigned HOST_WIDE_INT),
5649 void *ctx, tree param,
5650 unsigned HOST_WIDE_INT param_num)
5652 if ((TREE_CODE (param) == NOP_EXPR || TREE_CODE (param) == CONVERT_EXPR)
5653 && (TYPE_PRECISION (TREE_TYPE (param))
5654 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param, 0)))))
5656 /* Strip coercion. */
5657 check_function_arguments_recurse (callback, ctx,
5658 TREE_OPERAND (param, 0), param_num);
5662 if (TREE_CODE (param) == CALL_EXPR)
5664 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5666 bool found_format_arg = false;
5668 /* See if this is a call to a known internationalization function
5669 that modifies a format arg. Such a function may have multiple
5670 format_arg attributes (for example, ngettext). */
5672 for (attrs = TYPE_ATTRIBUTES (type);
5674 attrs = TREE_CHAIN (attrs))
5675 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5678 tree format_num_expr;
5682 /* Extract the argument number, which was previously checked
5684 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5686 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
5687 && !TREE_INT_CST_HIGH (format_num_expr));
5689 format_num = TREE_INT_CST_LOW (format_num_expr);
5691 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5693 inner_args = TREE_CHAIN (inner_args), i++)
5694 if (i == format_num)
5696 check_function_arguments_recurse (callback, ctx,
5697 TREE_VALUE (inner_args),
5699 found_format_arg = true;
5704 /* If we found a format_arg attribute and did a recursive check,
5705 we are done with checking this argument. Otherwise, we continue
5706 and this will be considered a non-literal. */
5707 if (found_format_arg)
5711 if (TREE_CODE (param) == COND_EXPR)
5713 /* Check both halves of the conditional expression. */
5714 check_function_arguments_recurse (callback, ctx,
5715 TREE_OPERAND (param, 1), param_num);
5716 check_function_arguments_recurse (callback, ctx,
5717 TREE_OPERAND (param, 2), param_num);
5721 (*callback) (ctx, param, param_num);
5724 /* Function to help qsort sort FIELD_DECLs by name order. */
5727 field_decl_cmp (const void *x_p, const void *y_p)
5729 const tree *const x = (const tree *const) x_p;
5730 const tree *const y = (const tree *const) y_p;
5732 if (DECL_NAME (*x) == DECL_NAME (*y))
5733 /* A nontype is "greater" than a type. */
5734 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5735 if (DECL_NAME (*x) == NULL_TREE)
5737 if (DECL_NAME (*y) == NULL_TREE)
5739 if (DECL_NAME (*x) < DECL_NAME (*y))
5745 gt_pointer_operator new_value;
5749 /* This routine compares two fields like field_decl_cmp but using the
5750 pointer operator in resort_data. */
5753 resort_field_decl_cmp (const void *x_p, const void *y_p)
5755 const tree *const x = (const tree *const) x_p;
5756 const tree *const y = (const tree *const) y_p;
5758 if (DECL_NAME (*x) == DECL_NAME (*y))
5759 /* A nontype is "greater" than a type. */
5760 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5761 if (DECL_NAME (*x) == NULL_TREE)
5763 if (DECL_NAME (*y) == NULL_TREE)
5766 tree d1 = DECL_NAME (*x);
5767 tree d2 = DECL_NAME (*y);
5768 resort_data.new_value (&d1, resort_data.cookie);
5769 resort_data.new_value (&d2, resort_data.cookie);
5776 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5779 resort_sorted_fields (void *obj,
5780 void * ARG_UNUSED (orig_obj),
5781 gt_pointer_operator new_value,
5784 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
5785 resort_data.new_value = new_value;
5786 resort_data.cookie = cookie;
5787 qsort (&sf->elts[0], sf->len, sizeof (tree),
5788 resort_field_decl_cmp);
5791 /* Subroutine of c_parse_error.
5792 Return the result of concatenating LHS and RHS. RHS is really
5793 a string literal, its first character is indicated by RHS_START and
5794 RHS_SIZE is its length (including the terminating NUL character).
5796 The caller is responsible for deleting the returned pointer. */
5799 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
5801 const int lhs_size = strlen (lhs);
5802 char *result = XNEWVEC (char, lhs_size + rhs_size);
5803 strncpy (result, lhs, lhs_size);
5804 strncpy (result + lhs_size, rhs_start, rhs_size);
5808 /* Issue the error given by GMSGID, indicating that it occurred before
5809 TOKEN, which had the associated VALUE. */
5812 c_parse_error (const char *gmsgid, enum cpp_ttype token, tree value)
5814 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5816 char *message = NULL;
5818 if (token == CPP_EOF)
5819 message = catenate_messages (gmsgid, " at end of input");
5820 else if (token == CPP_CHAR || token == CPP_WCHAR)
5822 unsigned int val = TREE_INT_CST_LOW (value);
5823 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5824 if (val <= UCHAR_MAX && ISGRAPH (val))
5825 message = catenate_messages (gmsgid, " before %s'%c'");
5827 message = catenate_messages (gmsgid, " before %s'\\x%x'");
5829 error (message, ell, val);
5833 else if (token == CPP_STRING || token == CPP_WSTRING)
5834 message = catenate_messages (gmsgid, " before string constant");
5835 else if (token == CPP_NUMBER)
5836 message = catenate_messages (gmsgid, " before numeric constant");
5837 else if (token == CPP_NAME)
5839 message = catenate_messages (gmsgid, " before %qE");
5840 error (message, value);
5844 else if (token == CPP_PRAGMA)
5845 message = catenate_messages (gmsgid, " before %<#pragma%>");
5846 else if (token == CPP_PRAGMA_EOL)
5847 message = catenate_messages (gmsgid, " before end of line");
5848 else if (token < N_TTYPES)
5850 message = catenate_messages (gmsgid, " before %qs token");
5851 error (message, cpp_type2name (token));
5863 #undef catenate_messages
5866 /* Walk a gimplified function and warn for functions whose return value is
5867 ignored and attribute((warn_unused_result)) is set. This is done before
5868 inlining, so we don't have to worry about that. */
5871 c_warn_unused_result (tree *top_p)
5874 tree_stmt_iterator i;
5877 switch (TREE_CODE (t))
5879 case STATEMENT_LIST:
5880 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5881 c_warn_unused_result (tsi_stmt_ptr (i));
5885 c_warn_unused_result (&COND_EXPR_THEN (t));
5886 c_warn_unused_result (&COND_EXPR_ELSE (t));
5889 c_warn_unused_result (&BIND_EXPR_BODY (t));
5891 case TRY_FINALLY_EXPR:
5892 case TRY_CATCH_EXPR:
5893 c_warn_unused_result (&TREE_OPERAND (t, 0));
5894 c_warn_unused_result (&TREE_OPERAND (t, 1));
5897 c_warn_unused_result (&CATCH_BODY (t));
5899 case EH_FILTER_EXPR:
5900 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5907 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5908 a MODIFY_EXPR. All calls whose value is ignored should be
5909 represented like this. Look for the attribute. */
5910 fdecl = get_callee_fndecl (t);
5912 ftype = TREE_TYPE (fdecl);
5915 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5916 /* Look past pointer-to-function to the function type itself. */
5917 ftype = TREE_TYPE (ftype);
5920 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5923 warning (0, "%Hignoring return value of %qD, "
5924 "declared with attribute warn_unused_result",
5925 EXPR_LOCUS (t), fdecl);
5927 warning (0, "%Hignoring return value of function "
5928 "declared with attribute warn_unused_result",
5934 /* Not a container, not a call, or a call whose value is used. */
5939 /* Convert a character from the host to the target execution character
5940 set. cpplib handles this, mostly. */
5943 c_common_to_target_charset (HOST_WIDE_INT c)
5945 /* Character constants in GCC proper are sign-extended under -fsigned-char,
5946 zero-extended under -fno-signed-char. cpplib insists that characters
5947 and character constants are always unsigned. Hence we must convert
5949 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
5951 uc = cpp_host_to_exec_charset (parse_in, uc);
5953 if (flag_signed_char)
5954 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
5955 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
5960 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
5961 component references, with an INDIRECT_REF at the bottom; much like
5962 the traditional rendering of offsetof as a macro. Returns the folded
5963 and properly cast result. */
5966 fold_offsetof_1 (tree expr)
5968 enum tree_code code = PLUS_EXPR;
5971 switch (TREE_CODE (expr))
5977 return size_zero_node;
5980 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5981 if (base == error_mark_node)
5984 t = TREE_OPERAND (expr, 1);
5985 if (DECL_C_BIT_FIELD (t))
5987 error ("attempt to take address of bit-field structure "
5989 return error_mark_node;
5991 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
5992 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
5997 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5998 if (base == error_mark_node)
6001 t = TREE_OPERAND (expr, 1);
6002 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
6005 t = fold_build1 (NEGATE_EXPR, TREE_TYPE (t), t);
6007 t = convert (sizetype, t);
6008 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
6015 return size_binop (code, base, off);
6019 fold_offsetof (tree expr)
6021 /* Convert back from the internal sizetype to size_t. */
6022 return convert (size_type_node, fold_offsetof_1 (expr));
6025 /* Print an error message for an invalid lvalue. USE says
6026 how the lvalue is being used and so selects the error message. */
6029 lvalue_error (enum lvalue_use use)
6034 error ("lvalue required as left operand of assignment");
6037 error ("lvalue required as increment operand");
6040 error ("lvalue required as decrement operand");
6043 error ("lvalue required as unary %<&%> operand");
6046 error ("lvalue required in asm statement");
6053 /* *PTYPE is an incomplete array. Complete it with a domain based on
6054 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6055 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6056 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6059 complete_array_type (tree *ptype, tree initial_value, bool do_default)
6061 tree maxindex, type, main_type, elt, unqual_elt;
6062 int failure = 0, quals;
6064 maxindex = size_zero_node;
6067 if (TREE_CODE (initial_value) == STRING_CST)
6070 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
6071 maxindex = size_int (TREE_STRING_LENGTH (initial_value)/eltsize - 1);
6073 else if (TREE_CODE (initial_value) == CONSTRUCTOR)
6075 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (initial_value);
6077 if (VEC_empty (constructor_elt, v))
6081 maxindex = integer_minus_one_node;
6086 unsigned HOST_WIDE_INT cnt;
6087 constructor_elt *ce;
6089 if (VEC_index (constructor_elt, v, 0)->index)
6090 maxindex = fold_convert (sizetype,
6091 VEC_index (constructor_elt,
6093 curindex = maxindex;
6096 VEC_iterate (constructor_elt, v, cnt, ce);
6100 curindex = fold_convert (sizetype, ce->index);
6102 curindex = size_binop (PLUS_EXPR, curindex, size_one_node);
6104 if (tree_int_cst_lt (maxindex, curindex))
6105 maxindex = curindex;
6111 /* Make an error message unless that happened already. */
6112 if (initial_value != error_mark_node)
6124 elt = TREE_TYPE (type);
6125 quals = TYPE_QUALS (strip_array_types (elt));
6129 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
6131 /* Using build_distinct_type_copy and modifying things afterward instead
6132 of using build_array_type to create a new type preserves all of the
6133 TYPE_LANG_FLAG_? bits that the front end may have set. */
6134 main_type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
6135 TREE_TYPE (main_type) = unqual_elt;
6136 TYPE_DOMAIN (main_type) = build_index_type (maxindex);
6137 layout_type (main_type);
6142 type = c_build_qualified_type (main_type, quals);
6149 /* Used to help initialize the builtin-types.def table. When a type of
6150 the correct size doesn't exist, use error_mark_node instead of NULL.
6151 The later results in segfaults even when a decl using the type doesn't
6155 builtin_type_for_size (int size, bool unsignedp)
6157 tree type = lang_hooks.types.type_for_size (size, unsignedp);
6158 return type ? type : error_mark_node;
6161 /* A helper function for resolve_overloaded_builtin in resolving the
6162 overloaded __sync_ builtins. Returns a positive power of 2 if the
6163 first operand of PARAMS is a pointer to a supported data type.
6164 Returns 0 if an error is encountered. */
6167 sync_resolve_size (tree function, tree params)
6174 error ("too few arguments to function %qE", function);
6178 type = TREE_TYPE (TREE_VALUE (params));
6179 if (TREE_CODE (type) != POINTER_TYPE)
6182 type = TREE_TYPE (type);
6183 if (!INTEGRAL_TYPE_P (type) && !POINTER_TYPE_P (type))
6186 size = tree_low_cst (TYPE_SIZE_UNIT (type), 1);
6187 if (size == 1 || size == 2 || size == 4 || size == 8 || size == 16)
6191 error ("incompatible type for argument %d of %qE", 1, function);
6195 /* A helper function for resolve_overloaded_builtin. Adds casts to
6196 PARAMS to make arguments match up with those of FUNCTION. Drops
6197 the variadic arguments at the end. Returns false if some error
6198 was encountered; true on success. */
6201 sync_resolve_params (tree orig_function, tree function, tree params)
6203 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
6207 /* We've declared the implementation functions to use "volatile void *"
6208 as the pointer parameter, so we shouldn't get any complaints from the
6209 call to check_function_arguments what ever type the user used. */
6210 arg_types = TREE_CHAIN (arg_types);
6211 ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
6214 /* For the rest of the values, we need to cast these to FTYPE, so that we
6215 don't get warnings for passing pointer types, etc. */
6216 while (arg_types != void_list_node)
6220 params = TREE_CHAIN (params);
6223 error ("too few arguments to function %qE", orig_function);
6227 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6228 so that we get warnings for anything that doesn't match the pointer
6229 type. This isn't portable across the C and C++ front ends atm. */
6230 val = TREE_VALUE (params);
6231 val = convert (ptype, val);
6232 val = convert (TREE_VALUE (arg_types), val);
6233 TREE_VALUE (params) = val;
6235 arg_types = TREE_CHAIN (arg_types);
6239 /* The definition of these primitives is variadic, with the remaining
6240 being "an optional list of variables protected by the memory barrier".
6241 No clue what that's supposed to mean, precisely, but we consider all
6242 call-clobbered variables to be protected so we're safe. */
6243 TREE_CHAIN (params) = NULL;
6248 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6249 RESULT to make it match the type of the first pointer argument in
6253 sync_resolve_return (tree params, tree result)
6255 tree ptype = TREE_TYPE (TREE_TYPE (TREE_VALUE (params)));
6256 ptype = TYPE_MAIN_VARIANT (ptype);
6257 return convert (ptype, result);
6260 /* Some builtin functions are placeholders for other expressions. This
6261 function should be called immediately after parsing the call expression
6262 before surrounding code has committed to the type of the expression.
6264 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6265 PARAMS is the argument list for the call. The return value is non-null
6266 when expansion is complete, and null if normal processing should
6270 resolve_overloaded_builtin (tree function, tree params)
6272 enum built_in_function orig_code = DECL_FUNCTION_CODE (function);
6273 switch (DECL_BUILT_IN_CLASS (function))
6275 case BUILT_IN_NORMAL:
6278 if (targetm.resolve_overloaded_builtin)
6279 return targetm.resolve_overloaded_builtin (function, params);
6286 /* Handle BUILT_IN_NORMAL here. */
6289 case BUILT_IN_FETCH_AND_ADD_N:
6290 case BUILT_IN_FETCH_AND_SUB_N:
6291 case BUILT_IN_FETCH_AND_OR_N:
6292 case BUILT_IN_FETCH_AND_AND_N:
6293 case BUILT_IN_FETCH_AND_XOR_N:
6294 case BUILT_IN_FETCH_AND_NAND_N:
6295 case BUILT_IN_ADD_AND_FETCH_N:
6296 case BUILT_IN_SUB_AND_FETCH_N:
6297 case BUILT_IN_OR_AND_FETCH_N:
6298 case BUILT_IN_AND_AND_FETCH_N:
6299 case BUILT_IN_XOR_AND_FETCH_N:
6300 case BUILT_IN_NAND_AND_FETCH_N:
6301 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N:
6302 case BUILT_IN_VAL_COMPARE_AND_SWAP_N:
6303 case BUILT_IN_LOCK_TEST_AND_SET_N:
6304 case BUILT_IN_LOCK_RELEASE_N:
6306 int n = sync_resolve_size (function, params);
6307 tree new_function, result;
6310 return error_mark_node;
6312 new_function = built_in_decls[orig_code + exact_log2 (n) + 1];
6313 if (!sync_resolve_params (function, new_function, params))
6314 return error_mark_node;
6316 result = build_function_call (new_function, params);
6317 if (orig_code != BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6318 && orig_code != BUILT_IN_LOCK_RELEASE_N)
6319 result = sync_resolve_return (params, result);
6329 /* Ignoring their sign, return true if two scalar types are the same. */
6331 same_scalar_type_ignoring_signedness (tree t1, tree t2)
6333 enum tree_code c1 = TREE_CODE (t1), c2 = TREE_CODE (t2);
6335 gcc_assert ((c1 == INTEGER_TYPE || c1 == REAL_TYPE)
6336 && (c2 == INTEGER_TYPE || c2 == REAL_TYPE));
6338 /* Equality works here because c_common_signed_type uses
6339 TYPE_MAIN_VARIANT. */
6340 return lang_hooks.types.signed_type (t1)
6341 == lang_hooks.types.signed_type (t2);
6344 /* Check for missing format attributes on function pointers. LTYPE is
6345 the new type or left-hand side type. RTYPE is the old type or
6346 right-hand side type. Returns TRUE if LTYPE is missing the desired
6350 check_missing_format_attribute (tree ltype, tree rtype)
6352 tree const ttr = TREE_TYPE (rtype), ttl = TREE_TYPE (ltype);
6355 for (ra = TYPE_ATTRIBUTES (ttr); ra; ra = TREE_CHAIN (ra))
6356 if (is_attribute_p ("format", TREE_PURPOSE (ra)))
6361 for (la = TYPE_ATTRIBUTES (ttl); la; la = TREE_CHAIN (la))
6362 if (is_attribute_p ("format", TREE_PURPOSE (la)))
6370 /* Subscripting with type char is likely to lose on a machine where
6371 chars are signed. So warn on any machine, but optionally. Don't
6372 warn for unsigned char since that type is safe. Don't warn for
6373 signed char because anyone who uses that must have done so
6374 deliberately. Furthermore, we reduce the false positive load by
6375 warning only for non-constant value of type char. */
6378 warn_array_subscript_with_type_char (tree index)
6380 if (TYPE_MAIN_VARIANT (TREE_TYPE (index)) == char_type_node
6381 && TREE_CODE (index) != INTEGER_CST)
6382 warning (OPT_Wchar_subscripts, "array subscript has type %<char%>");
6386 #include "gt-c-common.h"