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, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
51 cpp_reader *parse_in; /* Declared in c-pragma.h. */
53 /* We let tm.h override the types used here, to handle trivial differences
54 such as the choice of unsigned int or long unsigned int for size_t.
55 When machines start needing nontrivial differences in the size type,
56 it would be best to do something here to figure out automatically
57 from other information what type to use. */
60 #define SIZE_TYPE "long unsigned int"
64 #define PID_TYPE "int"
68 #define WCHAR_TYPE "int"
71 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
72 #define MODIFIED_WCHAR_TYPE \
73 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
76 #define PTRDIFF_TYPE "long int"
80 #define WINT_TYPE "unsigned int"
84 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
92 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
94 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
95 ? "long unsigned int" \
96 : "long long unsigned int"))
99 /* The following symbols are subsumed in the c_global_trees array, and
100 listed here individually for documentation purposes.
102 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
104 tree short_integer_type_node;
105 tree long_integer_type_node;
106 tree long_long_integer_type_node;
108 tree short_unsigned_type_node;
109 tree long_unsigned_type_node;
110 tree long_long_unsigned_type_node;
112 tree truthvalue_type_node;
113 tree truthvalue_false_node;
114 tree truthvalue_true_node;
116 tree ptrdiff_type_node;
118 tree unsigned_char_type_node;
119 tree signed_char_type_node;
120 tree wchar_type_node;
121 tree signed_wchar_type_node;
122 tree unsigned_wchar_type_node;
124 tree float_type_node;
125 tree double_type_node;
126 tree long_double_type_node;
128 tree complex_integer_type_node;
129 tree complex_float_type_node;
130 tree complex_double_type_node;
131 tree complex_long_double_type_node;
133 tree intQI_type_node;
134 tree intHI_type_node;
135 tree intSI_type_node;
136 tree intDI_type_node;
137 tree intTI_type_node;
139 tree unsigned_intQI_type_node;
140 tree unsigned_intHI_type_node;
141 tree unsigned_intSI_type_node;
142 tree unsigned_intDI_type_node;
143 tree unsigned_intTI_type_node;
145 tree widest_integer_literal_type_node;
146 tree widest_unsigned_literal_type_node;
148 Nodes for types `void *' and `const void *'.
150 tree ptr_type_node, const_ptr_type_node;
152 Nodes for types `char *' and `const char *'.
154 tree string_type_node, const_string_type_node;
156 Type `char[SOMENUMBER]'.
157 Used when an array of char is needed and the size is irrelevant.
159 tree char_array_type_node;
161 Type `int[SOMENUMBER]' or something like it.
162 Used when an array of int needed and the size is irrelevant.
164 tree int_array_type_node;
166 Type `wchar_t[SOMENUMBER]' or something like it.
167 Used when a wide string literal is created.
169 tree wchar_array_type_node;
171 Type `int ()' -- used for implicit declaration of functions.
173 tree default_function_type;
175 A VOID_TYPE node, packaged in a TREE_LIST.
179 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
180 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
181 VAR_DECLS, but C++ does.)
183 tree function_name_decl_node;
184 tree pretty_function_name_decl_node;
185 tree c99_function_name_decl_node;
187 Stack of nested function name VAR_DECLs.
189 tree saved_function_name_decls;
193 tree c_global_trees[CTI_MAX];
195 /* TRUE if a code represents a statement. The front end init
196 langhook should take care of initialization of this array. */
198 bool statement_code_p[MAX_TREE_CODES];
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 give string constants the type `const char *', as mandated
267 int flag_const_strings;
269 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
271 int flag_signed_bitfields = 1;
273 /* Nonzero means warn about deprecated conversion from string constant to
276 int warn_write_strings;
278 /* Warn about #pragma directives that are not recognized. */
280 int warn_unknown_pragmas; /* Tri state variable. */
282 /* Warn about format/argument anomalies in calls to formatted I/O functions
283 (*printf, *scanf, strftime, strfmon, etc.). */
287 /* Zero means that faster, ...NonNil variants of objc_msgSend...
288 calls will be used in ObjC; passing nil receivers to such calls
289 will most likely result in crashes. */
290 int flag_nil_receivers = 1;
292 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
293 @try, etc.) in source code. */
294 int flag_objc_exceptions = 0;
296 /* Nonzero means that we generate NeXT setjmp based exceptions. */
297 int flag_objc_sjlj_exceptions = -1;
299 /* Nonzero means that code generation will be altered to support
300 "zero-link" execution. This currently affects ObjC only, but may
301 affect other languages in the future. */
302 int flag_zero_link = 0;
304 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
305 unit. It will inform the ObjC runtime that class definition(s) herein
306 contained are to replace one(s) previously loaded. */
307 int flag_replace_objc_classes = 0;
309 /* C/ObjC language option variables. */
312 /* Nonzero means allow type mismatches in conditional expressions;
313 just make their values `void'. */
315 int flag_cond_mismatch;
317 /* Nonzero means enable C89 Amendment 1 features. */
321 /* Nonzero means use the ISO C99 dialect of C. */
325 /* Nonzero means that we have builtin functions, and main is an int. */
329 /* Warn if main is suspicious. */
334 /* ObjC language option variables. */
337 /* Open and close the file for outputting class declarations, if
340 int flag_gen_declaration;
342 /* Generate code for GNU or NeXT runtime environment. */
344 #ifdef NEXT_OBJC_RUNTIME
345 int flag_next_runtime = 1;
347 int flag_next_runtime = 0;
350 /* Tells the compiler that this is a special run. Do not perform any
351 compiling, instead we are to test some platform dependent features
352 and output a C header file with appropriate definitions. */
354 int print_struct_values;
356 /* ???. Undocumented. */
358 const char *constant_string_class_name;
361 /* C++ language option variables. */
364 /* Nonzero means don't recognize any extension keywords. */
366 int flag_no_gnu_keywords;
368 /* Nonzero means do emit exported implementations of functions even if
369 they can be inlined. */
371 int flag_implement_inlines = 1;
373 /* Nonzero means that implicit instantiations will be emitted if needed. */
375 int flag_implicit_templates = 1;
377 /* Nonzero means that implicit instantiations of inline templates will be
378 emitted if needed, even if instantiations of non-inline templates
381 int flag_implicit_inline_templates = 1;
383 /* Nonzero means generate separate instantiation control files and
384 juggle them at link time. */
386 int flag_use_repository;
388 /* Nonzero if we want to issue diagnostics that the standard says are not
391 int flag_optional_diags = 1;
393 /* Nonzero means we should attempt to elide constructors when possible. */
395 int flag_elide_constructors = 1;
397 /* Nonzero means that member functions defined in class scope are
398 inline by default. */
400 int flag_default_inline = 1;
402 /* Controls whether compiler generates 'type descriptor' that give
403 run-time type information. */
407 /* Nonzero if we want to conserve space in the .o files. We do this
408 by putting uninitialized data and runtime initialized data into
409 .common instead of .data at the expense of not flagging multiple
412 int flag_conserve_space;
414 /* Nonzero if we want to obey access control semantics. */
416 int flag_access_control = 1;
418 /* Nonzero if we want to check the return value of new and avoid calling
419 constructors if it is a null pointer. */
423 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
424 initialization variables.
425 0: Old rules, set by -fno-for-scope.
426 2: New ISO rules, set by -ffor-scope.
427 1: Try to implement new ISO rules, but with backup compatibility
428 (and warnings). This is the default, for now. */
430 int flag_new_for_scope = 1;
432 /* Nonzero if we want to emit defined symbols with common-like linkage as
433 weak symbols where possible, in order to conform to C++ semantics.
434 Otherwise, emit them as local symbols. */
438 /* 0 means we want the preprocessor to not emit line directives for
439 the current working directory. 1 means we want it to do it. -1
440 means we should decide depending on whether debugging information
441 is being emitted or not. */
443 int flag_working_directory = -1;
445 /* Nonzero to use __cxa_atexit, rather than atexit, to register
446 destructors for local statics and global objects. */
448 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
450 /* Nonzero means make the default pedwarns warnings instead of errors.
451 The value of this flag is ignored if -pedantic is specified. */
455 /* Nonzero means to implement standard semantics for exception
456 specifications, calling unexpected if an exception is thrown that
457 doesn't match the specification. Zero means to treat them as
458 assertions and optimize accordingly, but not check them. */
460 int flag_enforce_eh_specs = 1;
462 /* Nonzero means to generate thread-safe code for initializing local
465 int flag_threadsafe_statics = 1;
467 /* Nonzero means warn about implicit declarations. */
469 int warn_implicit = 1;
471 /* Maximum template instantiation depth. This limit is rather
472 arbitrary, but it exists to limit the time it takes to notice
473 infinite template instantiations. */
475 int max_tinst_depth = 500;
479 /* The elements of `ridpointers' are identifier nodes for the reserved
480 type names and storage classes. It is indexed by a RID_... value. */
483 tree (*make_fname_decl) (tree, int);
485 /* Nonzero means the expression being parsed will never be evaluated.
486 This is a count, since unevaluated expressions can nest. */
489 /* Information about how a function name is generated. */
492 tree *const decl; /* pointer to the VAR_DECL. */
493 const unsigned rid; /* RID number for the identifier. */
494 const int pretty; /* How pretty is it? */
497 /* The three ways of getting then name of the current function. */
499 const struct fname_var_t fname_vars[] =
501 /* C99 compliant __func__, must be first. */
502 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
503 /* GCC __FUNCTION__ compliant. */
504 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
505 /* GCC __PRETTY_FUNCTION__ compliant. */
506 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
510 static int constant_fits_type_p (tree, tree);
511 static tree check_case_value (tree);
512 static bool check_case_bounds (tree, tree, tree *, tree *);
514 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
516 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
517 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
518 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
519 static tree handle_always_inline_attribute (tree *, tree, tree, int,
521 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
522 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_transparent_union_attribute (tree *, tree, tree,
526 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
528 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
532 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_visibility_attribute (tree *, tree, tree, int,
535 static tree handle_tls_model_attribute (tree *, tree, tree, int,
537 static tree handle_no_instrument_function_attribute (tree *, tree,
539 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
540 static tree handle_returns_twice_attribute (tree *, tree, tree, int, bool *);
541 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
543 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
544 static tree handle_novops_attribute (tree *, tree, tree, int, bool *);
545 static tree handle_deprecated_attribute (tree *, tree, tree, int,
547 static tree handle_vector_size_attribute (tree *, tree, tree, int,
549 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
550 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
551 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
552 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
554 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
556 static void check_function_nonnull (tree, tree);
557 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
558 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
559 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
560 static int resort_field_decl_cmp (const void *, const void *);
562 /* Table of machine-independent attributes common to all C-like languages. */
563 const struct attribute_spec c_common_attribute_table[] =
565 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
566 { "packed", 0, 0, false, false, false,
567 handle_packed_attribute },
568 { "nocommon", 0, 0, true, false, false,
569 handle_nocommon_attribute },
570 { "common", 0, 0, true, false, false,
571 handle_common_attribute },
572 /* FIXME: logically, noreturn attributes should be listed as
573 "false, true, true" and apply to function types. But implementing this
574 would require all the places in the compiler that use TREE_THIS_VOLATILE
575 on a decl to identify non-returning functions to be located and fixed
576 to check the function type instead. */
577 { "noreturn", 0, 0, true, false, false,
578 handle_noreturn_attribute },
579 { "volatile", 0, 0, true, false, false,
580 handle_noreturn_attribute },
581 { "noinline", 0, 0, true, false, false,
582 handle_noinline_attribute },
583 { "always_inline", 0, 0, true, false, false,
584 handle_always_inline_attribute },
585 { "used", 0, 0, true, false, false,
586 handle_used_attribute },
587 { "unused", 0, 0, false, false, false,
588 handle_unused_attribute },
589 /* The same comments as for noreturn attributes apply to const ones. */
590 { "const", 0, 0, true, false, false,
591 handle_const_attribute },
592 { "transparent_union", 0, 0, false, false, false,
593 handle_transparent_union_attribute },
594 { "constructor", 0, 0, true, false, false,
595 handle_constructor_attribute },
596 { "destructor", 0, 0, true, false, false,
597 handle_destructor_attribute },
598 { "mode", 1, 1, false, true, false,
599 handle_mode_attribute },
600 { "section", 1, 1, true, false, false,
601 handle_section_attribute },
602 { "aligned", 0, 1, false, false, false,
603 handle_aligned_attribute },
604 { "weak", 0, 0, true, false, false,
605 handle_weak_attribute },
606 { "alias", 1, 1, true, false, false,
607 handle_alias_attribute },
608 { "no_instrument_function", 0, 0, true, false, false,
609 handle_no_instrument_function_attribute },
610 { "malloc", 0, 0, true, false, false,
611 handle_malloc_attribute },
612 { "returns_twice", 0, 0, true, false, false,
613 handle_returns_twice_attribute },
614 { "no_stack_limit", 0, 0, true, false, false,
615 handle_no_limit_stack_attribute },
616 { "pure", 0, 0, true, false, false,
617 handle_pure_attribute },
618 /* For internal use (marking of builtins) only. The name contains space
619 to prevent its usage in source code. */
620 { "no vops", 0, 0, true, false, false,
621 handle_novops_attribute },
622 { "deprecated", 0, 0, false, false, false,
623 handle_deprecated_attribute },
624 { "vector_size", 1, 1, false, true, false,
625 handle_vector_size_attribute },
626 { "visibility", 1, 1, false, false, false,
627 handle_visibility_attribute },
628 { "tls_model", 1, 1, true, false, false,
629 handle_tls_model_attribute },
630 { "nonnull", 0, -1, false, true, true,
631 handle_nonnull_attribute },
632 { "nothrow", 0, 0, true, false, false,
633 handle_nothrow_attribute },
634 { "may_alias", 0, 0, false, true, false, NULL },
635 { "cleanup", 1, 1, true, false, false,
636 handle_cleanup_attribute },
637 { "warn_unused_result", 0, 0, false, true, true,
638 handle_warn_unused_result_attribute },
639 { "sentinel", 0, 1, false, true, true,
640 handle_sentinel_attribute },
641 { NULL, 0, 0, false, false, false, NULL }
644 /* Give the specifications for the format attributes, used by C and all
647 const struct attribute_spec c_common_format_attribute_table[] =
649 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
650 { "format", 3, 3, false, true, true,
651 handle_format_attribute },
652 { "format_arg", 1, 1, false, true, true,
653 handle_format_arg_attribute },
654 { NULL, 0, 0, false, false, false, NULL }
657 /* Push current bindings for the function name VAR_DECLS. */
660 start_fname_decls (void)
663 tree saved = NULL_TREE;
665 for (ix = 0; fname_vars[ix].decl; ix++)
667 tree decl = *fname_vars[ix].decl;
671 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
672 *fname_vars[ix].decl = NULL_TREE;
675 if (saved || saved_function_name_decls)
676 /* Normally they'll have been NULL, so only push if we've got a
677 stack, or they are non-NULL. */
678 saved_function_name_decls = tree_cons (saved, NULL_TREE,
679 saved_function_name_decls);
682 /* Finish up the current bindings, adding them into the current function's
683 statement tree. This must be done _before_ finish_stmt_tree is called.
684 If there is no current function, we must be at file scope and no statements
685 are involved. Pop the previous bindings. */
688 finish_fname_decls (void)
691 tree stmts = NULL_TREE;
692 tree stack = saved_function_name_decls;
694 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
695 append_to_statement_list (TREE_VALUE (stack), &stmts);
699 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
701 if (TREE_CODE (*bodyp) == BIND_EXPR)
702 bodyp = &BIND_EXPR_BODY (*bodyp);
704 append_to_statement_list (*bodyp, &stmts);
708 for (ix = 0; fname_vars[ix].decl; ix++)
709 *fname_vars[ix].decl = NULL_TREE;
713 /* We had saved values, restore them. */
716 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
718 tree decl = TREE_PURPOSE (saved);
719 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
721 *fname_vars[ix].decl = decl;
723 stack = TREE_CHAIN (stack);
725 saved_function_name_decls = stack;
728 /* Return the text name of the current function, suitably prettified
729 by PRETTY_P. Return string must be freed by caller. */
732 fname_as_string (int pretty_p)
734 const char *name = "top level";
744 if (current_function_decl)
745 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
747 if (c_lex_string_translate)
749 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
750 cpp_string cstr = { 0, 0 }, strname;
752 namep = XNEWVEC (char, len);
753 snprintf (namep, len, "\"%s\"", name);
754 strname.text = (unsigned char *) namep;
755 strname.len = len - 1;
757 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
760 return (char *) cstr.text;
764 namep = xstrdup (name);
769 /* Expand DECL if it declares an entity not handled by the
773 c_expand_decl (tree decl)
775 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
777 /* Let the back-end know about this variable. */
778 if (!anon_aggr_type_p (TREE_TYPE (decl)))
779 emit_local_var (decl);
781 expand_anon_union_decl (decl, NULL_TREE,
782 DECL_ANON_UNION_ELEMS (decl));
791 /* Return the VAR_DECL for a const char array naming the current
792 function. If the VAR_DECL has not yet been created, create it
793 now. RID indicates how it should be formatted and IDENTIFIER_NODE
794 ID is its name (unfortunately C and C++ hold the RID values of
795 keywords in different places, so we can't derive RID from ID in
796 this language independent code. */
799 fname_decl (unsigned int rid, tree id)
802 tree decl = NULL_TREE;
804 for (ix = 0; fname_vars[ix].decl; ix++)
805 if (fname_vars[ix].rid == rid)
808 decl = *fname_vars[ix].decl;
811 /* If a tree is built here, it would normally have the lineno of
812 the current statement. Later this tree will be moved to the
813 beginning of the function and this line number will be wrong.
814 To avoid this problem set the lineno to 0 here; that prevents
815 it from appearing in the RTL. */
817 location_t saved_location = input_location;
818 #ifdef USE_MAPPED_LOCATION
819 input_location = UNKNOWN_LOCATION;
824 stmts = push_stmt_list ();
825 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
826 stmts = pop_stmt_list (stmts);
827 if (!IS_EMPTY_STMT (stmts))
828 saved_function_name_decls
829 = tree_cons (decl, stmts, saved_function_name_decls);
830 *fname_vars[ix].decl = decl;
831 input_location = saved_location;
833 if (!ix && !current_function_decl)
834 pedwarn ("%qD is not defined outside of function scope", decl);
839 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
842 fix_string_type (tree value)
844 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
845 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
846 const int nchars_max = flag_isoc99 ? 4095 : 509;
847 int length = TREE_STRING_LENGTH (value);
849 tree e_type, i_type, a_type;
851 /* Compute the number of elements, for the array type. */
852 nchars = wide_flag ? length / wchar_bytes : length;
854 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
855 pedwarn ("string length %qd is greater than the length %qd ISO C%d compilers are required to support",
856 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
858 e_type = wide_flag ? wchar_type_node : char_type_node;
859 /* Create the array type for the string constant. flag_const_strings
860 says make the string constant an array of const char so that
861 copying it to a non-const pointer will get a warning. For C++,
862 this is the standard behavior.
864 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
865 array type being the unqualified version of that type.
866 Therefore, if we are constructing an array of const char, we must
867 construct the matching unqualified array type first. The C front
868 end does not require this, but it does no harm, so we do it
870 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
871 a_type = build_array_type (e_type, i_type);
872 if (flag_const_strings)
873 a_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
875 TREE_TYPE (value) = a_type;
876 TREE_CONSTANT (value) = 1;
877 TREE_INVARIANT (value) = 1;
878 TREE_READONLY (value) = 1;
879 TREE_STATIC (value) = 1;
883 /* Print a warning if a constant expression had overflow in folding.
884 Invoke this function on every expression that the language
885 requires to be a constant expression.
886 Note the ANSI C standard says it is erroneous for a
887 constant expression to overflow. */
890 constant_expression_warning (tree value)
892 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
893 || TREE_CODE (value) == VECTOR_CST
894 || TREE_CODE (value) == COMPLEX_CST)
895 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
896 pedwarn ("overflow in constant expression");
899 /* Print a warning if an expression had overflow in folding.
900 Invoke this function on every expression that
901 (1) appears in the source code, and
902 (2) might be a constant expression that overflowed, and
903 (3) is not already checked by convert_and_check;
904 however, do not invoke this function on operands of explicit casts. */
907 overflow_warning (tree value)
909 if ((TREE_CODE (value) == INTEGER_CST
910 || (TREE_CODE (value) == COMPLEX_CST
911 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
912 && TREE_OVERFLOW (value))
914 TREE_OVERFLOW (value) = 0;
915 if (skip_evaluation == 0)
916 warning ("integer overflow in expression");
918 else if ((TREE_CODE (value) == REAL_CST
919 || (TREE_CODE (value) == COMPLEX_CST
920 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
921 && TREE_OVERFLOW (value))
923 TREE_OVERFLOW (value) = 0;
924 if (skip_evaluation == 0)
925 warning ("floating point overflow in expression");
927 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
929 TREE_OVERFLOW (value) = 0;
930 if (skip_evaluation == 0)
931 warning ("vector overflow in expression");
935 /* Print a warning if a large constant is truncated to unsigned,
936 or if -Wconversion is used and a constant < 0 is converted to unsigned.
937 Invoke this function on every expression that might be implicitly
938 converted to an unsigned type. */
941 unsigned_conversion_warning (tree result, tree operand)
943 tree type = TREE_TYPE (result);
945 if (TREE_CODE (operand) == INTEGER_CST
946 && TREE_CODE (type) == INTEGER_TYPE
947 && TYPE_UNSIGNED (type)
948 && skip_evaluation == 0
949 && !int_fits_type_p (operand, type))
951 if (!int_fits_type_p (operand, c_common_signed_type (type)))
952 /* This detects cases like converting -129 or 256 to unsigned char. */
953 warning ("large integer implicitly truncated to unsigned type");
954 else if (warn_conversion)
955 warning ("negative integer implicitly converted to unsigned type");
959 /* Nonzero if constant C has a value that is permissible
960 for type TYPE (an INTEGER_TYPE). */
963 constant_fits_type_p (tree c, tree type)
965 if (TREE_CODE (c) == INTEGER_CST)
966 return int_fits_type_p (c, type);
968 c = convert (type, c);
969 return !TREE_OVERFLOW (c);
972 /* Nonzero if vector types T1 and T2 can be converted to each other
973 without an explicit cast. */
975 vector_types_convertible_p (tree t1, tree t2)
977 return targetm.vector_opaque_p (t1)
978 || targetm.vector_opaque_p (t2)
979 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
980 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
981 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
984 /* Convert EXPR to TYPE, warning about conversion problems with constants.
985 Invoke this function on every expression that is converted implicitly,
986 i.e. because of language rules and not because of an explicit cast. */
989 convert_and_check (tree type, tree expr)
991 tree t = convert (type, expr);
992 if (TREE_CODE (t) == INTEGER_CST)
994 if (TREE_OVERFLOW (t))
996 TREE_OVERFLOW (t) = 0;
998 /* Do not diagnose overflow in a constant expression merely
999 because a conversion overflowed. */
1000 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1002 /* No warning for converting 0x80000000 to int. */
1003 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1004 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1005 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1006 /* If EXPR fits in the unsigned version of TYPE,
1007 don't warn unless pedantic. */
1009 || TYPE_UNSIGNED (type)
1010 || !constant_fits_type_p (expr,
1011 c_common_unsigned_type (type)))
1012 && skip_evaluation == 0)
1013 warning ("overflow in implicit constant conversion");
1016 unsigned_conversion_warning (t, expr);
1021 /* A node in a list that describes references to variables (EXPR), which are
1022 either read accesses if WRITER is zero, or write accesses, in which case
1023 WRITER is the parent of EXPR. */
1030 /* Used to implement a cache the results of a call to verify_tree. We only
1031 use this for SAVE_EXPRs. */
1034 struct tlist_cache *next;
1035 struct tlist *cache_before_sp;
1036 struct tlist *cache_after_sp;
1040 /* Obstack to use when allocating tlist structures, and corresponding
1042 static struct obstack tlist_obstack;
1043 static char *tlist_firstobj = 0;
1045 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1047 static struct tlist *warned_ids;
1048 /* SAVE_EXPRs need special treatment. We process them only once and then
1049 cache the results. */
1050 static struct tlist_cache *save_expr_cache;
1052 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1053 static void merge_tlist (struct tlist **, struct tlist *, int);
1054 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1055 static int warning_candidate_p (tree);
1056 static void warn_for_collisions (struct tlist *);
1057 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1058 static struct tlist *new_tlist (struct tlist *, tree, tree);
1060 /* Create a new struct tlist and fill in its fields. */
1061 static struct tlist *
1062 new_tlist (struct tlist *next, tree t, tree writer)
1065 l = XOBNEW (&tlist_obstack, struct tlist);
1072 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1073 is nonnull, we ignore any node we find which has a writer equal to it. */
1076 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1080 struct tlist *next = add->next;
1083 if (!exclude_writer || add->writer != exclude_writer)
1084 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1089 /* Merge the nodes of ADD into TO. This merging process is done so that for
1090 each variable that already exists in TO, no new node is added; however if
1091 there is a write access recorded in ADD, and an occurrence on TO is only
1092 a read access, then the occurrence in TO will be modified to record the
1096 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1098 struct tlist **end = to;
1101 end = &(*end)->next;
1107 struct tlist *next = add->next;
1109 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1110 if (tmp2->expr == add->expr)
1114 tmp2->writer = add->writer;
1118 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1119 end = &(*end)->next;
1126 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1127 references in list LIST conflict with it, excluding reads if ONLY writers
1131 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1136 /* Avoid duplicate warnings. */
1137 for (tmp = warned_ids; tmp; tmp = tmp->next)
1138 if (tmp->expr == written)
1143 if (list->expr == written
1144 && list->writer != writer
1145 && (!only_writes || list->writer)
1146 && DECL_NAME (list->expr))
1148 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1149 warning ("operation on %qE may be undefined", list->expr);
1155 /* Given a list LIST of references to variables, find whether any of these
1156 can cause conflicts due to missing sequence points. */
1159 warn_for_collisions (struct tlist *list)
1163 for (tmp = list; tmp; tmp = tmp->next)
1166 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1170 /* Return nonzero if X is a tree that can be verified by the sequence point
1173 warning_candidate_p (tree x)
1175 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1178 /* Walk the tree X, and record accesses to variables. If X is written by the
1179 parent tree, WRITER is the parent.
1180 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1181 expression or its only operand forces a sequence point, then everything up
1182 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1184 Once we return, we will have emitted warnings if any subexpression before
1185 such a sequence point could be undefined. On a higher level, however, the
1186 sequence point may not be relevant, and we'll merge the two lists.
1188 Example: (b++, a) + b;
1189 The call that processes the COMPOUND_EXPR will store the increment of B
1190 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1191 processes the PLUS_EXPR will need to merge the two lists so that
1192 eventually, all accesses end up on the same list (and we'll warn about the
1193 unordered subexpressions b++ and b.
1195 A note on merging. If we modify the former example so that our expression
1198 care must be taken not simply to add all three expressions into the final
1199 PNO_SP list. The function merge_tlist takes care of that by merging the
1200 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1201 way, so that no more than one access to B is recorded. */
1204 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1207 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1208 enum tree_code code;
1209 enum tree_code_class cl;
1211 /* X may be NULL if it is the operand of an empty statement expression
1217 code = TREE_CODE (x);
1218 cl = TREE_CODE_CLASS (code);
1220 if (warning_candidate_p (x))
1222 *pno_sp = new_tlist (*pno_sp, x, writer);
1232 case TRUTH_ANDIF_EXPR:
1233 case TRUTH_ORIF_EXPR:
1234 tmp_before = tmp_nosp = tmp_list3 = 0;
1235 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1236 warn_for_collisions (tmp_nosp);
1237 merge_tlist (pbefore_sp, tmp_before, 0);
1238 merge_tlist (pbefore_sp, tmp_nosp, 0);
1239 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1240 merge_tlist (pbefore_sp, tmp_list3, 0);
1244 tmp_before = tmp_list2 = 0;
1245 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1246 warn_for_collisions (tmp_list2);
1247 merge_tlist (pbefore_sp, tmp_before, 0);
1248 merge_tlist (pbefore_sp, tmp_list2, 1);
1250 tmp_list3 = tmp_nosp = 0;
1251 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1252 warn_for_collisions (tmp_nosp);
1253 merge_tlist (pbefore_sp, tmp_list3, 0);
1255 tmp_list3 = tmp_list2 = 0;
1256 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1257 warn_for_collisions (tmp_list2);
1258 merge_tlist (pbefore_sp, tmp_list3, 0);
1259 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1260 two first, to avoid warning for (a ? b++ : b++). */
1261 merge_tlist (&tmp_nosp, tmp_list2, 0);
1262 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1265 case PREDECREMENT_EXPR:
1266 case PREINCREMENT_EXPR:
1267 case POSTDECREMENT_EXPR:
1268 case POSTINCREMENT_EXPR:
1269 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1273 tmp_before = tmp_nosp = tmp_list3 = 0;
1274 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1275 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1276 /* Expressions inside the LHS are not ordered wrt. the sequence points
1277 in the RHS. Example:
1279 Despite the fact that the modification of "a" is in the before_sp
1280 list (tmp_before), it conflicts with the use of "a" in the LHS.
1281 We can handle this by adding the contents of tmp_list3
1282 to those of tmp_before, and redoing the collision warnings for that
1284 add_tlist (&tmp_before, tmp_list3, x, 1);
1285 warn_for_collisions (tmp_before);
1286 /* Exclude the LHS itself here; we first have to merge it into the
1287 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1288 didn't exclude the LHS, we'd get it twice, once as a read and once
1290 add_tlist (pno_sp, tmp_list3, x, 0);
1291 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1293 merge_tlist (pbefore_sp, tmp_before, 0);
1294 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1295 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1296 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1300 /* We need to warn about conflicts among arguments and conflicts between
1301 args and the function address. Side effects of the function address,
1302 however, are not ordered by the sequence point of the call. */
1303 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1304 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1305 if (TREE_OPERAND (x, 1))
1306 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1307 merge_tlist (&tmp_list3, tmp_list2, 0);
1308 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1309 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1310 warn_for_collisions (tmp_before);
1311 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1315 /* Scan all the list, e.g. indices of multi dimensional array. */
1318 tmp_before = tmp_nosp = 0;
1319 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1320 merge_tlist (&tmp_nosp, tmp_before, 0);
1321 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1328 struct tlist_cache *t;
1329 for (t = save_expr_cache; t; t = t->next)
1335 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1336 t->next = save_expr_cache;
1338 save_expr_cache = t;
1340 tmp_before = tmp_nosp = 0;
1341 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1342 warn_for_collisions (tmp_nosp);
1347 struct tlist *t = tmp_nosp;
1349 merge_tlist (&tmp_list3, t, 0);
1351 t->cache_before_sp = tmp_before;
1352 t->cache_after_sp = tmp_list3;
1354 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1355 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1360 /* For other expressions, simply recurse on their operands.
1361 Manual tail recursion for unary expressions.
1362 Other non-expressions need not be processed. */
1363 if (cl == tcc_unary)
1365 x = TREE_OPERAND (x, 0);
1369 else if (IS_EXPR_CODE_CLASS (cl))
1372 int max = TREE_CODE_LENGTH (TREE_CODE (x));
1373 for (lp = 0; lp < max; lp++)
1375 tmp_before = tmp_nosp = 0;
1376 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
1377 merge_tlist (&tmp_nosp, tmp_before, 0);
1378 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1385 /* Try to warn for undefined behavior in EXPR due to missing sequence
1389 verify_sequence_points (tree expr)
1391 struct tlist *before_sp = 0, *after_sp = 0;
1394 save_expr_cache = 0;
1395 if (tlist_firstobj == 0)
1397 gcc_obstack_init (&tlist_obstack);
1398 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1401 verify_tree (expr, &before_sp, &after_sp, 0);
1402 warn_for_collisions (after_sp);
1403 obstack_free (&tlist_obstack, tlist_firstobj);
1406 /* Validate the expression after `case' and apply default promotions. */
1409 check_case_value (tree value)
1411 if (value == NULL_TREE)
1414 /* ??? Can we ever get nops here for a valid case value? We
1416 STRIP_TYPE_NOPS (value);
1417 /* In C++, the following is allowed:
1420 switch (...) { case i: ... }
1422 So, we try to reduce the VALUE to a constant that way. */
1423 if (c_dialect_cxx ())
1425 value = decl_constant_value (value);
1426 STRIP_TYPE_NOPS (value);
1427 value = fold (value);
1430 if (TREE_CODE (value) == INTEGER_CST)
1431 /* Promote char or short to int. */
1432 value = perform_integral_promotions (value);
1433 else if (value != error_mark_node)
1435 error ("case label does not reduce to an integer constant");
1436 value = error_mark_node;
1439 constant_expression_warning (value);
1444 /* See if the case values LOW and HIGH are in the range of the original
1445 type (i.e. before the default conversion to int) of the switch testing
1447 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1448 the type before promoting it. CASE_LOW_P is a pointer to the lower
1449 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1450 if the case is not a case range.
1451 The caller has to make sure that we are not called with NULL for
1452 CASE_LOW_P (i.e. the default case).
1453 Returns true if the case label is in range of ORIG_TYPE (satured or
1454 untouched) or false if the label is out of range. */
1457 check_case_bounds (tree type, tree orig_type,
1458 tree *case_low_p, tree *case_high_p)
1460 tree min_value, max_value;
1461 tree case_low = *case_low_p;
1462 tree case_high = case_high_p ? *case_high_p : case_low;
1464 /* If there was a problem with the original type, do nothing. */
1465 if (orig_type == error_mark_node)
1468 min_value = TYPE_MIN_VALUE (orig_type);
1469 max_value = TYPE_MAX_VALUE (orig_type);
1471 /* Case label is less than minimum for type. */
1472 if (tree_int_cst_compare (case_low, min_value) < 0
1473 && tree_int_cst_compare (case_high, min_value) < 0)
1475 warning ("case label value is less than minimum value for type");
1479 /* Case value is greater than maximum for type. */
1480 if (tree_int_cst_compare (case_low, max_value) > 0
1481 && tree_int_cst_compare (case_high, max_value) > 0)
1483 warning ("case label value exceeds maximum value for type");
1487 /* Saturate lower case label value to minimum. */
1488 if (tree_int_cst_compare (case_high, min_value) >= 0
1489 && tree_int_cst_compare (case_low, min_value) < 0)
1491 warning ("lower value in case label range"
1492 " less than minimum value for type");
1493 case_low = min_value;
1496 /* Saturate upper case label value to maximum. */
1497 if (tree_int_cst_compare (case_low, max_value) <= 0
1498 && tree_int_cst_compare (case_high, max_value) > 0)
1500 warning ("upper value in case label range"
1501 " exceeds maximum value for type");
1502 case_high = max_value;
1505 if (*case_low_p != case_low)
1506 *case_low_p = convert (type, case_low);
1507 if (case_high_p && *case_high_p != case_high)
1508 *case_high_p = convert (type, case_high);
1513 /* Return an integer type with BITS bits of precision,
1514 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1517 c_common_type_for_size (unsigned int bits, int unsignedp)
1519 if (bits == TYPE_PRECISION (integer_type_node))
1520 return unsignedp ? unsigned_type_node : integer_type_node;
1522 if (bits == TYPE_PRECISION (signed_char_type_node))
1523 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1525 if (bits == TYPE_PRECISION (short_integer_type_node))
1526 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1528 if (bits == TYPE_PRECISION (long_integer_type_node))
1529 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1531 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1532 return (unsignedp ? long_long_unsigned_type_node
1533 : long_long_integer_type_node);
1535 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1536 return (unsignedp ? widest_unsigned_literal_type_node
1537 : widest_integer_literal_type_node);
1539 if (bits <= TYPE_PRECISION (intQI_type_node))
1540 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1542 if (bits <= TYPE_PRECISION (intHI_type_node))
1543 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1545 if (bits <= TYPE_PRECISION (intSI_type_node))
1546 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1548 if (bits <= TYPE_PRECISION (intDI_type_node))
1549 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1554 /* Used for communication between c_common_type_for_mode and
1555 c_register_builtin_type. */
1556 static GTY(()) tree registered_builtin_types;
1558 /* Return a data type that has machine mode MODE.
1559 If the mode is an integer,
1560 then UNSIGNEDP selects between signed and unsigned types. */
1563 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1567 if (mode == TYPE_MODE (integer_type_node))
1568 return unsignedp ? unsigned_type_node : integer_type_node;
1570 if (mode == TYPE_MODE (signed_char_type_node))
1571 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1573 if (mode == TYPE_MODE (short_integer_type_node))
1574 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1576 if (mode == TYPE_MODE (long_integer_type_node))
1577 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1579 if (mode == TYPE_MODE (long_long_integer_type_node))
1580 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1582 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1583 return unsignedp ? widest_unsigned_literal_type_node
1584 : widest_integer_literal_type_node;
1587 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1590 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1593 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1596 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1598 #if HOST_BITS_PER_WIDE_INT >= 64
1599 if (mode == TYPE_MODE (intTI_type_node))
1600 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1603 if (mode == TYPE_MODE (float_type_node))
1604 return float_type_node;
1606 if (mode == TYPE_MODE (double_type_node))
1607 return double_type_node;
1609 if (mode == TYPE_MODE (long_double_type_node))
1610 return long_double_type_node;
1612 if (mode == TYPE_MODE (void_type_node))
1613 return void_type_node;
1615 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1617 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1618 : make_signed_type (GET_MODE_PRECISION (mode)));
1620 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1622 ? make_unsigned_type (GET_MODE_PRECISION (mode))
1623 : make_signed_type (GET_MODE_PRECISION (mode)));
1625 if (COMPLEX_MODE_P (mode))
1627 enum machine_mode inner_mode;
1630 if (mode == TYPE_MODE (complex_float_type_node))
1631 return complex_float_type_node;
1632 if (mode == TYPE_MODE (complex_double_type_node))
1633 return complex_double_type_node;
1634 if (mode == TYPE_MODE (complex_long_double_type_node))
1635 return complex_long_double_type_node;
1637 if (mode == TYPE_MODE (complex_integer_type_node) && !unsignedp)
1638 return complex_integer_type_node;
1640 inner_mode = GET_MODE_INNER (mode);
1641 inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1642 if (inner_type != NULL_TREE)
1643 return build_complex_type (inner_type);
1645 else if (VECTOR_MODE_P (mode))
1647 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1648 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1649 if (inner_type != NULL_TREE)
1650 return build_vector_type_for_mode (inner_type, mode);
1653 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1654 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1655 return TREE_VALUE (t);
1660 /* Return an unsigned type the same as TYPE in other respects. */
1662 c_common_unsigned_type (tree type)
1664 tree type1 = TYPE_MAIN_VARIANT (type);
1665 if (type1 == signed_char_type_node || type1 == char_type_node)
1666 return unsigned_char_type_node;
1667 if (type1 == integer_type_node)
1668 return unsigned_type_node;
1669 if (type1 == short_integer_type_node)
1670 return short_unsigned_type_node;
1671 if (type1 == long_integer_type_node)
1672 return long_unsigned_type_node;
1673 if (type1 == long_long_integer_type_node)
1674 return long_long_unsigned_type_node;
1675 if (type1 == widest_integer_literal_type_node)
1676 return widest_unsigned_literal_type_node;
1677 #if HOST_BITS_PER_WIDE_INT >= 64
1678 if (type1 == intTI_type_node)
1679 return unsigned_intTI_type_node;
1681 if (type1 == intDI_type_node)
1682 return unsigned_intDI_type_node;
1683 if (type1 == intSI_type_node)
1684 return unsigned_intSI_type_node;
1685 if (type1 == intHI_type_node)
1686 return unsigned_intHI_type_node;
1687 if (type1 == intQI_type_node)
1688 return unsigned_intQI_type_node;
1690 return c_common_signed_or_unsigned_type (1, type);
1693 /* Return a signed type the same as TYPE in other respects. */
1696 c_common_signed_type (tree type)
1698 tree type1 = TYPE_MAIN_VARIANT (type);
1699 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1700 return signed_char_type_node;
1701 if (type1 == unsigned_type_node)
1702 return integer_type_node;
1703 if (type1 == short_unsigned_type_node)
1704 return short_integer_type_node;
1705 if (type1 == long_unsigned_type_node)
1706 return long_integer_type_node;
1707 if (type1 == long_long_unsigned_type_node)
1708 return long_long_integer_type_node;
1709 if (type1 == widest_unsigned_literal_type_node)
1710 return widest_integer_literal_type_node;
1711 #if HOST_BITS_PER_WIDE_INT >= 64
1712 if (type1 == unsigned_intTI_type_node)
1713 return intTI_type_node;
1715 if (type1 == unsigned_intDI_type_node)
1716 return intDI_type_node;
1717 if (type1 == unsigned_intSI_type_node)
1718 return intSI_type_node;
1719 if (type1 == unsigned_intHI_type_node)
1720 return intHI_type_node;
1721 if (type1 == unsigned_intQI_type_node)
1722 return intQI_type_node;
1724 return c_common_signed_or_unsigned_type (0, type);
1727 /* Return a type the same as TYPE except unsigned or
1728 signed according to UNSIGNEDP. */
1731 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1733 if (!INTEGRAL_TYPE_P (type)
1734 || TYPE_UNSIGNED (type) == unsignedp)
1737 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1738 the precision; they have precision set to match their range, but
1739 may use a wider mode to match an ABI. If we change modes, we may
1740 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1741 the precision as well, so as to yield correct results for
1742 bit-field types. C++ does not have these separate bit-field
1743 types, and producing a signed or unsigned variant of an
1744 ENUMERAL_TYPE may cause other problems as well. */
1746 #define TYPE_OK(node) \
1747 (TYPE_MODE (type) == TYPE_MODE (node) \
1748 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1749 if (TYPE_OK (signed_char_type_node))
1750 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1751 if (TYPE_OK (integer_type_node))
1752 return unsignedp ? unsigned_type_node : integer_type_node;
1753 if (TYPE_OK (short_integer_type_node))
1754 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1755 if (TYPE_OK (long_integer_type_node))
1756 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1757 if (TYPE_OK (long_long_integer_type_node))
1758 return (unsignedp ? long_long_unsigned_type_node
1759 : long_long_integer_type_node);
1760 if (TYPE_OK (widest_integer_literal_type_node))
1761 return (unsignedp ? widest_unsigned_literal_type_node
1762 : widest_integer_literal_type_node);
1764 #if HOST_BITS_PER_WIDE_INT >= 64
1765 if (TYPE_OK (intTI_type_node))
1766 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1768 if (TYPE_OK (intDI_type_node))
1769 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1770 if (TYPE_OK (intSI_type_node))
1771 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1772 if (TYPE_OK (intHI_type_node))
1773 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1774 if (TYPE_OK (intQI_type_node))
1775 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1778 if (c_dialect_cxx ())
1781 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
1784 /* The C version of the register_builtin_type langhook. */
1787 c_register_builtin_type (tree type, const char* name)
1791 decl = build_decl (TYPE_DECL, get_identifier (name), type);
1792 DECL_ARTIFICIAL (decl) = 1;
1793 if (!TYPE_NAME (type))
1794 TYPE_NAME (type) = decl;
1797 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
1801 /* Return the minimum number of bits needed to represent VALUE in a
1802 signed or unsigned type, UNSIGNEDP says which. */
1805 min_precision (tree value, int unsignedp)
1809 /* If the value is negative, compute its negative minus 1. The latter
1810 adjustment is because the absolute value of the largest negative value
1811 is one larger than the largest positive value. This is equivalent to
1812 a bit-wise negation, so use that operation instead. */
1814 if (tree_int_cst_sgn (value) < 0)
1815 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
1817 /* Return the number of bits needed, taking into account the fact
1818 that we need one more bit for a signed than unsigned type. */
1820 if (integer_zerop (value))
1823 log = tree_floor_log2 (value);
1825 return log + 1 + !unsignedp;
1828 /* Print an error message for invalid operands to arith operation
1829 CODE. NOP_EXPR is used as a special case (see
1830 c_common_truthvalue_conversion). */
1833 binary_op_error (enum tree_code code)
1840 error ("invalid truth-value expression");
1844 opname = "+"; break;
1846 opname = "-"; break;
1848 opname = "*"; break;
1850 opname = "max"; break;
1852 opname = "min"; break;
1854 opname = "=="; break;
1856 opname = "!="; break;
1858 opname = "<="; break;
1860 opname = ">="; break;
1862 opname = "<"; break;
1864 opname = ">"; break;
1866 opname = "<<"; break;
1868 opname = ">>"; break;
1869 case TRUNC_MOD_EXPR:
1870 case FLOOR_MOD_EXPR:
1871 opname = "%"; break;
1872 case TRUNC_DIV_EXPR:
1873 case FLOOR_DIV_EXPR:
1874 opname = "/"; break;
1876 opname = "&"; break;
1878 opname = "|"; break;
1879 case TRUTH_ANDIF_EXPR:
1880 opname = "&&"; break;
1881 case TRUTH_ORIF_EXPR:
1882 opname = "||"; break;
1884 opname = "^"; break;
1888 error ("invalid operands to binary %s", opname);
1891 /* Subroutine of build_binary_op, used for comparison operations.
1892 See if the operands have both been converted from subword integer types
1893 and, if so, perhaps change them both back to their original type.
1894 This function is also responsible for converting the two operands
1895 to the proper common type for comparison.
1897 The arguments of this function are all pointers to local variables
1898 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1899 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1901 If this function returns nonzero, it means that the comparison has
1902 a constant value. What this function returns is an expression for
1906 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
1907 enum tree_code *rescode_ptr)
1910 tree op0 = *op0_ptr;
1911 tree op1 = *op1_ptr;
1912 int unsignedp0, unsignedp1;
1914 tree primop0, primop1;
1915 enum tree_code code = *rescode_ptr;
1917 /* Throw away any conversions to wider types
1918 already present in the operands. */
1920 primop0 = get_narrower (op0, &unsignedp0);
1921 primop1 = get_narrower (op1, &unsignedp1);
1923 /* Handle the case that OP0 does not *contain* a conversion
1924 but it *requires* conversion to FINAL_TYPE. */
1926 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
1927 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1928 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
1929 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1931 /* If one of the operands must be floated, we cannot optimize. */
1932 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
1933 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
1935 /* If first arg is constant, swap the args (changing operation
1936 so value is preserved), for canonicalization. Don't do this if
1937 the second arg is 0. */
1939 if (TREE_CONSTANT (primop0)
1940 && !integer_zerop (primop1) && !real_zerop (primop1))
1943 int temi = unsignedp0;
1951 unsignedp0 = unsignedp1;
1974 *rescode_ptr = code;
1977 /* If comparing an integer against a constant more bits wide,
1978 maybe we can deduce a value of 1 or 0 independent of the data.
1979 Or else truncate the constant now
1980 rather than extend the variable at run time.
1982 This is only interesting if the constant is the wider arg.
1983 Also, it is not safe if the constant is unsigned and the
1984 variable arg is signed, since in this case the variable
1985 would be sign-extended and then regarded as unsigned.
1986 Our technique fails in this case because the lowest/highest
1987 possible unsigned results don't follow naturally from the
1988 lowest/highest possible values of the variable operand.
1989 For just EQ_EXPR and NE_EXPR there is another technique that
1990 could be used: see if the constant can be faithfully represented
1991 in the other operand's type, by truncating it and reextending it
1992 and see if that preserves the constant's value. */
1994 if (!real1 && !real2
1995 && TREE_CODE (primop1) == INTEGER_CST
1996 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
1998 int min_gt, max_gt, min_lt, max_lt;
1999 tree maxval, minval;
2000 /* 1 if comparison is nominally unsigned. */
2001 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
2004 type = c_common_signed_or_unsigned_type (unsignedp0,
2005 TREE_TYPE (primop0));
2007 maxval = TYPE_MAX_VALUE (type);
2008 minval = TYPE_MIN_VALUE (type);
2010 if (unsignedp && !unsignedp0)
2011 *restype_ptr = c_common_signed_type (*restype_ptr);
2013 if (TREE_TYPE (primop1) != *restype_ptr)
2015 /* Convert primop1 to target type, but do not introduce
2016 additional overflow. We know primop1 is an int_cst. */
2017 tree tmp = build_int_cst_wide (*restype_ptr,
2018 TREE_INT_CST_LOW (primop1),
2019 TREE_INT_CST_HIGH (primop1));
2021 primop1 = force_fit_type (tmp, 0, TREE_OVERFLOW (primop1),
2022 TREE_CONSTANT_OVERFLOW (primop1));
2024 if (type != *restype_ptr)
2026 minval = convert (*restype_ptr, minval);
2027 maxval = convert (*restype_ptr, maxval);
2030 if (unsignedp && unsignedp0)
2032 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2033 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2034 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2035 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2039 min_gt = INT_CST_LT (primop1, minval);
2040 max_gt = INT_CST_LT (primop1, maxval);
2041 min_lt = INT_CST_LT (minval, primop1);
2042 max_lt = INT_CST_LT (maxval, primop1);
2046 /* This used to be a switch, but Genix compiler can't handle that. */
2047 if (code == NE_EXPR)
2049 if (max_lt || min_gt)
2050 val = truthvalue_true_node;
2052 else if (code == EQ_EXPR)
2054 if (max_lt || min_gt)
2055 val = truthvalue_false_node;
2057 else if (code == LT_EXPR)
2060 val = truthvalue_true_node;
2062 val = truthvalue_false_node;
2064 else if (code == GT_EXPR)
2067 val = truthvalue_true_node;
2069 val = truthvalue_false_node;
2071 else if (code == LE_EXPR)
2074 val = truthvalue_true_node;
2076 val = truthvalue_false_node;
2078 else if (code == GE_EXPR)
2081 val = truthvalue_true_node;
2083 val = truthvalue_false_node;
2086 /* If primop0 was sign-extended and unsigned comparison specd,
2087 we did a signed comparison above using the signed type bounds.
2088 But the comparison we output must be unsigned.
2090 Also, for inequalities, VAL is no good; but if the signed
2091 comparison had *any* fixed result, it follows that the
2092 unsigned comparison just tests the sign in reverse
2093 (positive values are LE, negative ones GE).
2094 So we can generate an unsigned comparison
2095 against an extreme value of the signed type. */
2097 if (unsignedp && !unsignedp0)
2104 primop1 = TYPE_MIN_VALUE (type);
2110 primop1 = TYPE_MAX_VALUE (type);
2117 type = c_common_unsigned_type (type);
2120 if (TREE_CODE (primop0) != INTEGER_CST)
2122 if (val == truthvalue_false_node)
2123 warning ("comparison is always false due to limited range of data type");
2124 if (val == truthvalue_true_node)
2125 warning ("comparison is always true due to limited range of data type");
2130 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2131 if (TREE_SIDE_EFFECTS (primop0))
2132 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2136 /* Value is not predetermined, but do the comparison
2137 in the type of the operand that is not constant.
2138 TYPE is already properly set. */
2140 else if (real1 && real2
2141 && (TYPE_PRECISION (TREE_TYPE (primop0))
2142 == TYPE_PRECISION (TREE_TYPE (primop1))))
2143 type = TREE_TYPE (primop0);
2145 /* If args' natural types are both narrower than nominal type
2146 and both extend in the same manner, compare them
2147 in the type of the wider arg.
2148 Otherwise must actually extend both to the nominal
2149 common type lest different ways of extending
2151 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2153 else if (unsignedp0 == unsignedp1 && real1 == real2
2154 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2155 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2157 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2158 type = c_common_signed_or_unsigned_type (unsignedp0
2159 || TYPE_UNSIGNED (*restype_ptr),
2161 /* Make sure shorter operand is extended the right way
2162 to match the longer operand. */
2164 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2165 TREE_TYPE (primop0)),
2168 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2169 TREE_TYPE (primop1)),
2174 /* Here we must do the comparison on the nominal type
2175 using the args exactly as we received them. */
2176 type = *restype_ptr;
2180 if (!real1 && !real2 && integer_zerop (primop1)
2181 && TYPE_UNSIGNED (*restype_ptr))
2187 /* All unsigned values are >= 0, so we warn if extra warnings
2188 are requested. However, if OP0 is a constant that is
2189 >= 0, the signedness of the comparison isn't an issue,
2190 so suppress the warning. */
2191 if (extra_warnings && !in_system_header
2192 && !(TREE_CODE (primop0) == INTEGER_CST
2193 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2195 warning ("comparison of unsigned expression >= 0 is always true");
2196 value = truthvalue_true_node;
2200 if (extra_warnings && !in_system_header
2201 && !(TREE_CODE (primop0) == INTEGER_CST
2202 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2204 warning ("comparison of unsigned expression < 0 is always false");
2205 value = truthvalue_false_node;
2214 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2215 if (TREE_SIDE_EFFECTS (primop0))
2216 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2223 *op0_ptr = convert (type, primop0);
2224 *op1_ptr = convert (type, primop1);
2226 *restype_ptr = truthvalue_type_node;
2231 /* Return a tree for the sum or difference (RESULTCODE says which)
2232 of pointer PTROP and integer INTOP. */
2235 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2239 /* The result is a pointer of the same type that is being added. */
2241 tree result_type = TREE_TYPE (ptrop);
2243 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2245 if (pedantic || warn_pointer_arith)
2246 pedwarn ("pointer of type %<void *%> used in arithmetic");
2247 size_exp = integer_one_node;
2249 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2251 if (pedantic || warn_pointer_arith)
2252 pedwarn ("pointer to a function used in arithmetic");
2253 size_exp = integer_one_node;
2255 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2257 if (pedantic || warn_pointer_arith)
2258 pedwarn ("pointer to member function used in arithmetic");
2259 size_exp = integer_one_node;
2262 size_exp = size_in_bytes (TREE_TYPE (result_type));
2264 /* If what we are about to multiply by the size of the elements
2265 contains a constant term, apply distributive law
2266 and multiply that constant term separately.
2267 This helps produce common subexpressions. */
2269 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2270 && !TREE_CONSTANT (intop)
2271 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2272 && TREE_CONSTANT (size_exp)
2273 /* If the constant comes from pointer subtraction,
2274 skip this optimization--it would cause an error. */
2275 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2276 /* If the constant is unsigned, and smaller than the pointer size,
2277 then we must skip this optimization. This is because it could cause
2278 an overflow error if the constant is negative but INTOP is not. */
2279 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2280 || (TYPE_PRECISION (TREE_TYPE (intop))
2281 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2283 enum tree_code subcode = resultcode;
2284 tree int_type = TREE_TYPE (intop);
2285 if (TREE_CODE (intop) == MINUS_EXPR)
2286 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2287 /* Convert both subexpression types to the type of intop,
2288 because weird cases involving pointer arithmetic
2289 can result in a sum or difference with different type args. */
2290 ptrop = build_binary_op (subcode, ptrop,
2291 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2292 intop = convert (int_type, TREE_OPERAND (intop, 0));
2295 /* Convert the integer argument to a type the same size as sizetype
2296 so the multiply won't overflow spuriously. */
2298 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2299 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2300 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2301 TYPE_UNSIGNED (sizetype)), intop);
2303 /* Replace the integer argument with a suitable product by the object size.
2304 Do this multiplication as signed, then convert to the appropriate
2305 pointer type (actually unsigned integral). */
2307 intop = convert (result_type,
2308 build_binary_op (MULT_EXPR, intop,
2309 convert (TREE_TYPE (intop), size_exp), 1));
2311 /* Create the sum or difference. */
2312 return fold (build2 (resultcode, result_type, ptrop, intop));
2315 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2316 or validate its data type for an `if' or `while' statement or ?..: exp.
2318 This preparation consists of taking the ordinary
2319 representation of an expression expr and producing a valid tree
2320 boolean expression describing whether expr is nonzero. We could
2321 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2322 but we optimize comparisons, &&, ||, and !.
2324 The resulting type should always be `truthvalue_type_node'. */
2327 c_common_truthvalue_conversion (tree expr)
2329 switch (TREE_CODE (expr))
2331 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2332 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2333 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2334 case ORDERED_EXPR: case UNORDERED_EXPR:
2335 if (TREE_TYPE (expr) == truthvalue_type_node)
2337 return build2 (TREE_CODE (expr), truthvalue_type_node,
2338 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2340 case TRUTH_ANDIF_EXPR:
2341 case TRUTH_ORIF_EXPR:
2342 case TRUTH_AND_EXPR:
2344 case TRUTH_XOR_EXPR:
2345 if (TREE_TYPE (expr) == truthvalue_type_node)
2347 return build2 (TREE_CODE (expr), truthvalue_type_node,
2348 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2349 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)));
2351 case TRUTH_NOT_EXPR:
2352 if (TREE_TYPE (expr) == truthvalue_type_node)
2354 return build1 (TREE_CODE (expr), truthvalue_type_node,
2355 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2361 /* Avoid integer_zerop to ignore TREE_CONSTANT_OVERFLOW. */
2362 return (TREE_INT_CST_LOW (expr) != 0 || TREE_INT_CST_HIGH (expr) != 0)
2363 ? truthvalue_true_node
2364 : truthvalue_false_node;
2367 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
2368 ? truthvalue_true_node
2369 : truthvalue_false_node;
2372 expr = build_unary_op (ADDR_EXPR, expr, 0);
2377 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2378 && !DECL_WEAK (TREE_OPERAND (expr, 0)))
2380 /* Common Ada/Pascal programmer's mistake. We always warn
2381 about this since it is so bad. */
2382 warning ("the address of %qD, will always evaluate as %<true%>",
2383 TREE_OPERAND (expr, 0));
2384 return truthvalue_true_node;
2387 /* If we are taking the address of an external decl, it might be
2388 zero if it is weak, so we cannot optimize. */
2389 if (DECL_P (TREE_OPERAND (expr, 0))
2390 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2393 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2394 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2395 TREE_OPERAND (expr, 0), truthvalue_true_node);
2397 return truthvalue_true_node;
2401 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2402 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2403 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2404 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2410 /* These don't change whether an object is nonzero or zero. */
2411 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2415 /* These don't change whether an object is zero or nonzero, but
2416 we can't ignore them if their second arg has side-effects. */
2417 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2418 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2419 TREE_OPERAND (expr, 1),
2420 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2422 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2425 /* Distribute the conversion into the arms of a COND_EXPR. */
2426 return fold (build3 (COND_EXPR, truthvalue_type_node,
2427 TREE_OPERAND (expr, 0),
2428 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2429 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2432 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2433 since that affects how `default_conversion' will behave. */
2434 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2435 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2437 /* Fall through.... */
2439 /* If this is widening the argument, we can ignore it. */
2440 if (TYPE_PRECISION (TREE_TYPE (expr))
2441 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2442 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2446 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2447 aren't guaranteed to the be same for modes that can represent
2448 infinity, since if x and y are both +infinity, or both
2449 -infinity, then x - y is not a number.
2451 Note that this transformation is safe when x or y is NaN.
2452 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2454 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2456 /* Fall through.... */
2458 /* This and MINUS_EXPR can be changed into a comparison of the
2460 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2461 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2462 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2463 TREE_OPERAND (expr, 1), 1);
2464 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2465 fold (build1 (NOP_EXPR,
2466 TREE_TYPE (TREE_OPERAND (expr, 0)),
2467 TREE_OPERAND (expr, 1))), 1);
2470 if (integer_onep (TREE_OPERAND (expr, 1))
2471 && TREE_TYPE (expr) != truthvalue_type_node)
2472 /* Using convert here would cause infinite recursion. */
2473 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2477 if (warn_parentheses && !TREE_NO_WARNING (expr))
2478 warning ("suggest parentheses around assignment used as truth value");
2485 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2487 tree t = save_expr (expr);
2488 return (build_binary_op
2489 ((TREE_SIDE_EFFECTS (expr)
2490 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2491 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2492 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2496 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2499 static tree builtin_function_2 (const char *builtin_name, const char *name,
2500 tree builtin_type, tree type,
2501 enum built_in_function function_code,
2502 enum built_in_class cl, int library_name_p,
2506 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2507 down to the element type of an array. */
2510 c_build_qualified_type (tree type, int type_quals)
2512 if (type == error_mark_node)
2515 if (TREE_CODE (type) == ARRAY_TYPE)
2518 tree element_type = c_build_qualified_type (TREE_TYPE (type),
2521 /* See if we already have an identically qualified type. */
2522 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2524 if (TYPE_QUALS (strip_array_types (t)) == type_quals
2525 && TYPE_NAME (t) == TYPE_NAME (type)
2526 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
2527 && attribute_list_equal (TYPE_ATTRIBUTES (t),
2528 TYPE_ATTRIBUTES (type)))
2533 t = build_variant_type_copy (type);
2534 TREE_TYPE (t) = element_type;
2539 /* A restrict-qualified pointer type must be a pointer to object or
2540 incomplete type. Note that the use of POINTER_TYPE_P also allows
2541 REFERENCE_TYPEs, which is appropriate for C++. */
2542 if ((type_quals & TYPE_QUAL_RESTRICT)
2543 && (!POINTER_TYPE_P (type)
2544 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2546 error ("invalid use of %<restrict%>");
2547 type_quals &= ~TYPE_QUAL_RESTRICT;
2550 return build_qualified_type (type, type_quals);
2553 /* Apply the TYPE_QUALS to the new DECL. */
2556 c_apply_type_quals_to_decl (int type_quals, tree decl)
2558 tree type = TREE_TYPE (decl);
2560 if (type == error_mark_node)
2563 if (((type_quals & TYPE_QUAL_CONST)
2564 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2565 /* An object declared 'const' is only readonly after it is
2566 initialized. We don't have any way of expressing this currently,
2567 so we need to be conservative and unset TREE_READONLY for types
2568 with constructors. Otherwise aliasing code will ignore stores in
2569 an inline constructor. */
2570 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2571 TREE_READONLY (decl) = 1;
2572 if (type_quals & TYPE_QUAL_VOLATILE)
2574 TREE_SIDE_EFFECTS (decl) = 1;
2575 TREE_THIS_VOLATILE (decl) = 1;
2577 if (type_quals & TYPE_QUAL_RESTRICT)
2579 while (type && TREE_CODE (type) == ARRAY_TYPE)
2580 /* Allow 'restrict' on arrays of pointers.
2581 FIXME currently we just ignore it. */
2582 type = TREE_TYPE (type);
2584 || !POINTER_TYPE_P (type)
2585 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2586 error ("invalid use of %<restrict%>");
2587 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2588 /* Indicate we need to make a unique alias set for this pointer.
2589 We can't do it here because it might be pointing to an
2591 DECL_POINTER_ALIAS_SET (decl) = -2;
2595 /* Hash function for the problem of multiple type definitions in
2596 different files. This must hash all types that will compare
2597 equal via comptypes to the same value. In practice it hashes
2598 on some of the simple stuff and leaves the details to comptypes. */
2601 c_type_hash (const void *p)
2607 switch (TREE_CODE (t))
2609 /* For pointers, hash on pointee type plus some swizzling. */
2611 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2612 /* Hash on number of elements and total size. */
2615 t2 = TYPE_VALUES (t);
2619 t2 = TYPE_FIELDS (t);
2621 case QUAL_UNION_TYPE:
2623 t2 = TYPE_FIELDS (t);
2627 t2 = TYPE_FIELDS (t);
2632 for (; t2; t2 = TREE_CHAIN (t2))
2634 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2635 return ((size << 24) | (i << shift));
2638 static GTY((param_is (union tree_node))) htab_t type_hash_table;
2640 /* Return the typed-based alias set for T, which may be an expression
2641 or a type. Return -1 if we don't do anything special. */
2644 c_common_get_alias_set (tree t)
2649 /* Permit type-punning when accessing a union, provided the access
2650 is directly through the union. For example, this code does not
2651 permit taking the address of a union member and then storing
2652 through it. Even the type-punning allowed here is a GCC
2653 extension, albeit a common and useful one; the C standard says
2654 that such accesses have implementation-defined behavior. */
2656 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2657 u = TREE_OPERAND (u, 0))
2658 if (TREE_CODE (u) == COMPONENT_REF
2659 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2662 /* That's all the expressions we handle specially. */
2666 /* The C standard guarantees that any object may be accessed via an
2667 lvalue that has character type. */
2668 if (t == char_type_node
2669 || t == signed_char_type_node
2670 || t == unsigned_char_type_node)
2673 /* If it has the may_alias attribute, it can alias anything. */
2674 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2677 /* The C standard specifically allows aliasing between signed and
2678 unsigned variants of the same type. We treat the signed
2679 variant as canonical. */
2680 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2682 tree t1 = c_common_signed_type (t);
2684 /* t1 == t can happen for boolean nodes which are always unsigned. */
2686 return get_alias_set (t1);
2688 else if (POINTER_TYPE_P (t))
2692 /* Unfortunately, there is no canonical form of a pointer type.
2693 In particular, if we have `typedef int I', then `int *', and
2694 `I *' are different types. So, we have to pick a canonical
2695 representative. We do this below.
2697 Technically, this approach is actually more conservative that
2698 it needs to be. In particular, `const int *' and `int *'
2699 should be in different alias sets, according to the C and C++
2700 standard, since their types are not the same, and so,
2701 technically, an `int **' and `const int **' cannot point at
2704 But, the standard is wrong. In particular, this code is
2709 const int* const* cipp = ipp;
2711 And, it doesn't make sense for that to be legal unless you
2712 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2713 the pointed-to types. This issue has been reported to the
2715 t1 = build_type_no_quals (t);
2717 return get_alias_set (t1);
2720 /* Handle the case of multiple type nodes referring to "the same" type,
2721 which occurs with IMA. These share an alias set. FIXME: Currently only
2722 C90 is handled. (In C99 type compatibility is not transitive, which
2723 complicates things mightily. The alias set splay trees can theoretically
2724 represent this, but insertion is tricky when you consider all the
2725 different orders things might arrive in.) */
2727 if (c_language != clk_c || flag_isoc99)
2730 /* Save time if there's only one input file. */
2731 if (num_in_fnames == 1)
2734 /* Pointers need special handling if they point to any type that
2735 needs special handling (below). */
2736 if (TREE_CODE (t) == POINTER_TYPE)
2739 /* Find bottom type under any nested POINTERs. */
2740 for (t2 = TREE_TYPE (t);
2741 TREE_CODE (t2) == POINTER_TYPE;
2742 t2 = TREE_TYPE (t2))
2744 if (TREE_CODE (t2) != RECORD_TYPE
2745 && TREE_CODE (t2) != ENUMERAL_TYPE
2746 && TREE_CODE (t2) != QUAL_UNION_TYPE
2747 && TREE_CODE (t2) != UNION_TYPE)
2749 if (TYPE_SIZE (t2) == 0)
2752 /* These are the only cases that need special handling. */
2753 if (TREE_CODE (t) != RECORD_TYPE
2754 && TREE_CODE (t) != ENUMERAL_TYPE
2755 && TREE_CODE (t) != QUAL_UNION_TYPE
2756 && TREE_CODE (t) != UNION_TYPE
2757 && TREE_CODE (t) != POINTER_TYPE)
2760 if (TYPE_SIZE (t) == 0)
2763 /* Look up t in hash table. Only one of the compatible types within each
2764 alias set is recorded in the table. */
2765 if (!type_hash_table)
2766 type_hash_table = htab_create_ggc (1021, c_type_hash,
2767 (htab_eq) lang_hooks.types_compatible_p,
2769 slot = htab_find_slot (type_hash_table, t, INSERT);
2772 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
2773 return TYPE_ALIAS_SET ((tree)*slot);
2776 /* Our caller will assign and record (in t) a new alias set; all we need
2777 to do is remember t in the hash table. */
2783 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2784 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2785 flag controls whether we should diagnose possibly ill-formed
2786 constructs or not. */
2788 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2790 const char *op_name;
2792 enum tree_code type_code = TREE_CODE (type);
2794 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
2795 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2797 if (type_code == FUNCTION_TYPE)
2799 if (op == SIZEOF_EXPR)
2801 if (complain && (pedantic || warn_pointer_arith))
2802 pedwarn ("invalid application of %<sizeof%> to a function type");
2803 value = size_one_node;
2806 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2808 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2810 if (type_code == VOID_TYPE
2811 && complain && (pedantic || warn_pointer_arith))
2812 pedwarn ("invalid application of %qs to a void type", op_name);
2813 value = size_one_node;
2815 else if (!COMPLETE_TYPE_P (type))
2818 error ("invalid application of %qs to incomplete type %qT ",
2820 value = size_zero_node;
2824 if (op == (enum tree_code) SIZEOF_EXPR)
2825 /* Convert in case a char is more than one unit. */
2826 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2827 size_int (TYPE_PRECISION (char_type_node)
2830 value = size_int (TYPE_ALIGN_UNIT (type));
2833 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2834 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2835 never happen. However, this node should really have type
2836 `size_t', which is just a typedef for an ordinary integer type. */
2837 value = fold (build1 (NOP_EXPR, size_type_node, value));
2838 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
2843 /* Implement the __alignof keyword: Return the minimum required
2844 alignment of EXPR, measured in bytes. For VAR_DECL's and
2845 FIELD_DECL's return DECL_ALIGN (which can be set from an
2846 "aligned" __attribute__ specification). */
2849 c_alignof_expr (tree expr)
2853 if (TREE_CODE (expr) == VAR_DECL)
2854 t = size_int (DECL_ALIGN_UNIT (expr));
2856 else if (TREE_CODE (expr) == COMPONENT_REF
2857 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2859 error ("%<__alignof%> applied to a bit-field");
2862 else if (TREE_CODE (expr) == COMPONENT_REF
2863 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2864 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
2866 else if (TREE_CODE (expr) == INDIRECT_REF)
2868 tree t = TREE_OPERAND (expr, 0);
2870 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2872 while (TREE_CODE (t) == NOP_EXPR
2873 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2877 t = TREE_OPERAND (t, 0);
2878 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2879 if (thisalign > bestalign)
2880 best = t, bestalign = thisalign;
2882 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2885 return c_alignof (TREE_TYPE (expr));
2887 return fold (build1 (NOP_EXPR, size_type_node, t));
2890 /* Handle C and C++ default attributes. */
2892 enum built_in_attribute
2894 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2895 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2896 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2897 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2898 #include "builtin-attrs.def"
2899 #undef DEF_ATTR_NULL_TREE
2901 #undef DEF_ATTR_IDENT
2902 #undef DEF_ATTR_TREE_LIST
2906 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2908 static void c_init_attributes (void);
2910 /* Build tree nodes and builtin functions common to both C and C++ language
2914 c_common_nodes_and_builtins (void)
2918 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2919 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2920 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2921 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2922 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2923 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2924 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2925 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2926 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2927 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2928 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2929 #include "builtin-types.def"
2930 #undef DEF_PRIMITIVE_TYPE
2931 #undef DEF_FUNCTION_TYPE_0
2932 #undef DEF_FUNCTION_TYPE_1
2933 #undef DEF_FUNCTION_TYPE_2
2934 #undef DEF_FUNCTION_TYPE_3
2935 #undef DEF_FUNCTION_TYPE_4
2936 #undef DEF_FUNCTION_TYPE_VAR_0
2937 #undef DEF_FUNCTION_TYPE_VAR_1
2938 #undef DEF_FUNCTION_TYPE_VAR_2
2939 #undef DEF_FUNCTION_TYPE_VAR_3
2940 #undef DEF_POINTER_TYPE
2944 typedef enum builtin_type builtin_type;
2946 tree builtin_types[(int) BT_LAST];
2947 int wchar_type_size;
2948 tree array_domain_type;
2949 tree va_list_ref_type_node;
2950 tree va_list_arg_type_node;
2952 /* Define `int' and `char' first so that dbx will output them first. */
2953 record_builtin_type (RID_INT, NULL, integer_type_node);
2954 record_builtin_type (RID_CHAR, "char", char_type_node);
2956 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2957 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2958 but not C. Are the conditionals here needed? */
2959 if (c_dialect_cxx ())
2960 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
2961 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
2962 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
2963 record_builtin_type (RID_MAX, "long unsigned int",
2964 long_unsigned_type_node);
2965 if (c_dialect_cxx ())
2966 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
2967 record_builtin_type (RID_MAX, "long long int",
2968 long_long_integer_type_node);
2969 record_builtin_type (RID_MAX, "long long unsigned int",
2970 long_long_unsigned_type_node);
2971 if (c_dialect_cxx ())
2972 record_builtin_type (RID_MAX, "long long unsigned",
2973 long_long_unsigned_type_node);
2974 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
2975 record_builtin_type (RID_MAX, "short unsigned int",
2976 short_unsigned_type_node);
2977 if (c_dialect_cxx ())
2978 record_builtin_type (RID_MAX, "unsigned short",
2979 short_unsigned_type_node);
2981 /* Define both `signed char' and `unsigned char'. */
2982 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
2983 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
2985 /* These are types that c_common_type_for_size and
2986 c_common_type_for_mode use. */
2987 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2989 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2991 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2993 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2995 #if HOST_BITS_PER_WIDE_INT >= 64
2996 if (targetm.scalar_mode_supported_p (TImode))
2997 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2998 get_identifier ("__int128_t"),
3001 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3002 unsigned_intQI_type_node));
3003 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3004 unsigned_intHI_type_node));
3005 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3006 unsigned_intSI_type_node));
3007 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3008 unsigned_intDI_type_node));
3009 #if HOST_BITS_PER_WIDE_INT >= 64
3010 if (targetm.scalar_mode_supported_p (TImode))
3011 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3012 get_identifier ("__uint128_t"),
3013 unsigned_intTI_type_node));
3016 /* Create the widest literal types. */
3017 widest_integer_literal_type_node
3018 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3019 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3020 widest_integer_literal_type_node));
3022 widest_unsigned_literal_type_node
3023 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3024 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3025 widest_unsigned_literal_type_node));
3027 /* `unsigned long' is the standard type for sizeof.
3028 Note that stddef.h uses `unsigned long',
3029 and this must agree, even if long and int are the same size. */
3031 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3032 signed_size_type_node = c_common_signed_type (size_type_node);
3033 set_sizetype (size_type_node);
3036 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
3038 build_common_tree_nodes_2 (flag_short_double);
3040 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3041 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3042 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3044 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3045 get_identifier ("complex int"),
3046 complex_integer_type_node));
3047 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3048 get_identifier ("complex float"),
3049 complex_float_type_node));
3050 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3051 get_identifier ("complex double"),
3052 complex_double_type_node));
3053 lang_hooks.decls.pushdecl
3054 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3055 complex_long_double_type_node));
3057 if (c_dialect_cxx ())
3058 /* For C++, make fileptr_type_node a distinct void * type until
3059 FILE type is defined. */
3060 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3062 record_builtin_type (RID_VOID, NULL, void_type_node);
3064 /* This node must not be shared. */
3065 void_zero_node = make_node (INTEGER_CST);
3066 TREE_TYPE (void_zero_node) = void_type_node;
3068 void_list_node = build_void_list_node ();
3070 /* Make a type to be the domain of a few array types
3071 whose domains don't really matter.
3072 200 is small enough that it always fits in size_t
3073 and large enough that it can hold most function names for the
3074 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3075 array_domain_type = build_index_type (size_int (200));
3077 /* Make a type for arrays of characters.
3078 With luck nothing will ever really depend on the length of this
3080 char_array_type_node
3081 = build_array_type (char_type_node, array_domain_type);
3083 /* Likewise for arrays of ints. */
3085 = build_array_type (integer_type_node, array_domain_type);
3087 string_type_node = build_pointer_type (char_type_node);
3088 const_string_type_node
3089 = build_pointer_type (build_qualified_type
3090 (char_type_node, TYPE_QUAL_CONST));
3092 /* This is special for C++ so functions can be overloaded. */
3093 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3094 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3095 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3096 if (c_dialect_cxx ())
3098 if (TYPE_UNSIGNED (wchar_type_node))
3099 wchar_type_node = make_unsigned_type (wchar_type_size);
3101 wchar_type_node = make_signed_type (wchar_type_size);
3102 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3106 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3107 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3110 /* This is for wide string constants. */
3111 wchar_array_type_node
3112 = build_array_type (wchar_type_node, array_domain_type);
3115 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3118 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3120 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3122 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3124 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3125 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3127 lang_hooks.decls.pushdecl
3128 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3129 va_list_type_node));
3131 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3133 va_list_arg_type_node = va_list_ref_type_node =
3134 build_pointer_type (TREE_TYPE (va_list_type_node));
3138 va_list_arg_type_node = va_list_type_node;
3139 va_list_ref_type_node = build_reference_type (va_list_type_node);
3142 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3143 builtin_types[(int) ENUM] = VALUE;
3144 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3145 builtin_types[(int) ENUM] \
3146 = build_function_type (builtin_types[(int) RETURN], \
3148 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3149 builtin_types[(int) ENUM] \
3150 = build_function_type (builtin_types[(int) RETURN], \
3151 tree_cons (NULL_TREE, \
3152 builtin_types[(int) ARG1], \
3154 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3155 builtin_types[(int) ENUM] \
3156 = build_function_type \
3157 (builtin_types[(int) RETURN], \
3158 tree_cons (NULL_TREE, \
3159 builtin_types[(int) ARG1], \
3160 tree_cons (NULL_TREE, \
3161 builtin_types[(int) ARG2], \
3163 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3164 builtin_types[(int) ENUM] \
3165 = build_function_type \
3166 (builtin_types[(int) RETURN], \
3167 tree_cons (NULL_TREE, \
3168 builtin_types[(int) ARG1], \
3169 tree_cons (NULL_TREE, \
3170 builtin_types[(int) ARG2], \
3171 tree_cons (NULL_TREE, \
3172 builtin_types[(int) ARG3], \
3174 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3175 builtin_types[(int) ENUM] \
3176 = build_function_type \
3177 (builtin_types[(int) RETURN], \
3178 tree_cons (NULL_TREE, \
3179 builtin_types[(int) ARG1], \
3180 tree_cons (NULL_TREE, \
3181 builtin_types[(int) ARG2], \
3184 builtin_types[(int) ARG3], \
3185 tree_cons (NULL_TREE, \
3186 builtin_types[(int) ARG4], \
3187 void_list_node)))));
3188 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3189 builtin_types[(int) ENUM] \
3190 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3191 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3192 builtin_types[(int) ENUM] \
3193 = build_function_type (builtin_types[(int) RETURN], \
3194 tree_cons (NULL_TREE, \
3195 builtin_types[(int) ARG1], \
3198 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3199 builtin_types[(int) ENUM] \
3200 = build_function_type \
3201 (builtin_types[(int) RETURN], \
3202 tree_cons (NULL_TREE, \
3203 builtin_types[(int) ARG1], \
3204 tree_cons (NULL_TREE, \
3205 builtin_types[(int) ARG2], \
3208 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3209 builtin_types[(int) ENUM] \
3210 = build_function_type \
3211 (builtin_types[(int) RETURN], \
3212 tree_cons (NULL_TREE, \
3213 builtin_types[(int) ARG1], \
3214 tree_cons (NULL_TREE, \
3215 builtin_types[(int) ARG2], \
3216 tree_cons (NULL_TREE, \
3217 builtin_types[(int) ARG3], \
3220 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3221 builtin_types[(int) ENUM] \
3222 = build_pointer_type (builtin_types[(int) TYPE]);
3223 #include "builtin-types.def"
3224 #undef DEF_PRIMITIVE_TYPE
3225 #undef DEF_FUNCTION_TYPE_1
3226 #undef DEF_FUNCTION_TYPE_2
3227 #undef DEF_FUNCTION_TYPE_3
3228 #undef DEF_FUNCTION_TYPE_4
3229 #undef DEF_FUNCTION_TYPE_VAR_0
3230 #undef DEF_FUNCTION_TYPE_VAR_1
3231 #undef DEF_FUNCTION_TYPE_VAR_2
3232 #undef DEF_FUNCTION_TYPE_VAR_3
3233 #undef DEF_POINTER_TYPE
3235 c_init_attributes ();
3237 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3238 NONANSI_P, ATTRS, IMPLICIT, COND) \
3243 gcc_assert (!strncmp (NAME, "__builtin_", \
3244 strlen ("__builtin_"))); \
3247 decl = lang_hooks.builtin_function (NAME, builtin_types[TYPE], \
3251 ? (NAME + strlen ("__builtin_")) \
3253 built_in_attributes[(int) ATTRS]); \
3255 decl = builtin_function_2 (NAME, \
3256 NAME + strlen ("__builtin_"), \
3257 builtin_types[TYPE], \
3258 builtin_types[LIBTYPE], \
3263 built_in_attributes[(int) ATTRS]); \
3265 built_in_decls[(int) ENUM] = decl; \
3267 implicit_built_in_decls[(int) ENUM] = decl; \
3269 #include "builtins.def"
3272 build_common_builtin_nodes ();
3274 targetm.init_builtins ();
3278 main_identifier_node = get_identifier ("main");
3281 /* Look up the function in built_in_decls that corresponds to DECL
3282 and set ASMSPEC as its user assembler name. DECL must be a
3283 function decl that declares a builtin. */
3286 set_builtin_user_assembler_name (tree decl, const char *asmspec)
3289 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
3290 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
3293 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
3294 set_user_assembler_name (builtin, asmspec);
3295 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
3296 init_block_move_fn (asmspec);
3297 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
3298 init_block_clear_fn (asmspec);
3302 build_va_arg (tree expr, tree type)
3304 return build1 (VA_ARG_EXPR, type, expr);
3308 /* Linked list of disabled built-in functions. */
3310 typedef struct disabled_builtin
3313 struct disabled_builtin *next;
3315 static disabled_builtin *disabled_builtins = NULL;
3317 static bool builtin_function_disabled_p (const char *);
3319 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3320 begins with "__builtin_", give an error. */
3323 disable_builtin_function (const char *name)
3325 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3326 error ("cannot disable built-in function %qs", name);
3329 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3330 new_disabled_builtin->name = name;
3331 new_disabled_builtin->next = disabled_builtins;
3332 disabled_builtins = new_disabled_builtin;
3337 /* Return true if the built-in function NAME has been disabled, false
3341 builtin_function_disabled_p (const char *name)
3343 disabled_builtin *p;
3344 for (p = disabled_builtins; p != NULL; p = p->next)
3346 if (strcmp (name, p->name) == 0)
3353 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3354 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3355 of these may be NULL (though both being NULL is useless).
3356 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3357 TYPE is the type of the function with the ordinary name. These
3358 may differ if the ordinary name is declared with a looser type to avoid
3359 conflicts with headers. FUNCTION_CODE and CL are as for
3360 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3361 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3362 If NONANSI_P is true, the name NAME is treated as a non-ANSI name;
3363 ATTRS is the tree list representing the builtin's function attributes.
3364 Returns the declaration of BUILTIN_NAME, if any, otherwise
3365 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3366 or if NONANSI_P and flag_no_nonansi_builtin. */
3369 builtin_function_2 (const char *builtin_name, const char *name,
3370 tree builtin_type, tree type,
3371 enum built_in_function function_code,
3372 enum built_in_class cl, int library_name_p,
3373 bool nonansi_p, tree attrs)
3375 tree bdecl = NULL_TREE;
3376 tree decl = NULL_TREE;
3378 if (builtin_name != 0)
3379 bdecl = lang_hooks.builtin_function (builtin_name, builtin_type,
3381 library_name_p ? name : NULL, attrs);
3383 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3384 && !(nonansi_p && flag_no_nonansi_builtin))
3385 decl = lang_hooks.builtin_function (name, type, function_code, cl,
3388 return (bdecl != 0 ? bdecl : decl);
3391 /* Nonzero if the type T promotes to int. This is (nearly) the
3392 integral promotions defined in ISO C99 6.3.1.1/2. */
3395 c_promoting_integer_type_p (tree t)
3397 switch (TREE_CODE (t))
3400 return (TYPE_MAIN_VARIANT (t) == char_type_node
3401 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3402 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3403 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3404 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3405 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3408 /* ??? Technically all enumerations not larger than an int
3409 promote to an int. But this is used along code paths
3410 that only want to notice a size change. */
3411 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3421 /* Return 1 if PARMS specifies a fixed number of parameters
3422 and none of their types is affected by default promotions. */
3425 self_promoting_args_p (tree parms)
3428 for (t = parms; t; t = TREE_CHAIN (t))
3430 tree type = TREE_VALUE (t);
3432 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3438 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3441 if (c_promoting_integer_type_p (type))
3447 /* Recursively examines the array elements of TYPE, until a non-array
3448 element type is found. */
3451 strip_array_types (tree type)
3453 while (TREE_CODE (type) == ARRAY_TYPE)
3454 type = TREE_TYPE (type);
3459 /* Recursively remove any '*' or '&' operator from TYPE. */
3461 strip_pointer_operator (tree t)
3463 while (POINTER_TYPE_P (t))
3468 /* Used to compare case labels. K1 and K2 are actually tree nodes
3469 representing case labels, or NULL_TREE for a `default' label.
3470 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3471 K2, and 0 if K1 and K2 are equal. */
3474 case_compare (splay_tree_key k1, splay_tree_key k2)
3476 /* Consider a NULL key (such as arises with a `default' label) to be
3477 smaller than anything else. */
3483 return tree_int_cst_compare ((tree) k1, (tree) k2);
3486 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3487 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3488 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3489 case label was declared using the usual C/C++ syntax, rather than
3490 the GNU case range extension. CASES is a tree containing all the
3491 case ranges processed so far; COND is the condition for the
3492 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3493 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3496 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3497 tree low_value, tree high_value)
3502 splay_tree_node node;
3504 /* Create the LABEL_DECL itself. */
3505 label = create_artificial_label ();
3507 /* If there was an error processing the switch condition, bail now
3508 before we get more confused. */
3509 if (!cond || cond == error_mark_node)
3512 if ((low_value && TREE_TYPE (low_value)
3513 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3514 || (high_value && TREE_TYPE (high_value)
3515 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3517 error ("pointers are not permitted as case values");
3521 /* Case ranges are a GNU extension. */
3522 if (high_value && pedantic)
3523 pedwarn ("range expressions in switch statements are non-standard");
3525 type = TREE_TYPE (cond);
3528 low_value = check_case_value (low_value);
3529 low_value = convert_and_check (type, low_value);
3533 high_value = check_case_value (high_value);
3534 high_value = convert_and_check (type, high_value);
3537 /* If an error has occurred, bail out now. */
3538 if (low_value == error_mark_node || high_value == error_mark_node)
3541 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3542 really a case range, even though it was written that way. Remove
3543 the HIGH_VALUE to simplify later processing. */
3544 if (tree_int_cst_equal (low_value, high_value))
3545 high_value = NULL_TREE;
3546 if (low_value && high_value
3547 && !tree_int_cst_lt (low_value, high_value))
3548 warning ("empty range specified");
3550 /* See if the case is in range of the type of the original testing
3551 expression. If both low_value and high_value are out of range,
3552 don't insert the case label and return NULL_TREE. */
3554 && !check_case_bounds (type, orig_type,
3555 &low_value, high_value ? &high_value : NULL))
3558 /* Look up the LOW_VALUE in the table of case labels we already
3560 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3561 /* If there was not an exact match, check for overlapping ranges.
3562 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3563 that's a `default' label and the only overlap is an exact match. */
3564 if (!node && (low_value || high_value))
3566 splay_tree_node low_bound;
3567 splay_tree_node high_bound;
3569 /* Even though there wasn't an exact match, there might be an
3570 overlap between this case range and another case range.
3571 Since we've (inductively) not allowed any overlapping case
3572 ranges, we simply need to find the greatest low case label
3573 that is smaller that LOW_VALUE, and the smallest low case
3574 label that is greater than LOW_VALUE. If there is an overlap
3575 it will occur in one of these two ranges. */
3576 low_bound = splay_tree_predecessor (cases,
3577 (splay_tree_key) low_value);
3578 high_bound = splay_tree_successor (cases,
3579 (splay_tree_key) low_value);
3581 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3582 the LOW_VALUE, so there is no need to check unless the
3583 LOW_BOUND is in fact itself a case range. */
3585 && CASE_HIGH ((tree) low_bound->value)
3586 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3589 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3590 range is bigger than the low end of the current range, so we
3591 are only interested if the current range is a real range, and
3592 not an ordinary case label. */
3595 && (tree_int_cst_compare ((tree) high_bound->key,
3600 /* If there was an overlap, issue an error. */
3603 tree duplicate = CASE_LABEL ((tree) node->value);
3607 error ("duplicate (or overlapping) case value");
3608 error ("%Jthis is the first entry overlapping that value", duplicate);
3612 error ("duplicate case value") ;
3613 error ("%Jpreviously used here", duplicate);
3617 error ("multiple default labels in one switch");
3618 error ("%Jthis is the first default label", duplicate);
3623 /* Add a CASE_LABEL to the statement-tree. */
3624 case_label = add_stmt (build_case_label (low_value, high_value, label));
3625 /* Register this case label in the splay tree. */
3626 splay_tree_insert (cases,
3627 (splay_tree_key) low_value,
3628 (splay_tree_value) case_label);
3633 /* Add a label so that the back-end doesn't think that the beginning of
3634 the switch is unreachable. Note that we do not add a case label, as
3635 that just leads to duplicates and thence to aborts later on. */
3638 tree t = create_artificial_label ();
3639 add_stmt (build_stmt (LABEL_EXPR, t));
3641 return error_mark_node;
3644 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3645 Used to verify that case values match up with enumerator values. */
3648 match_case_to_enum_1 (tree key, tree type, tree label)
3650 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3652 /* ??? Not working too hard to print the double-word value.
3653 Should perhaps be done with %lwd in the diagnostic routines? */
3654 if (TREE_INT_CST_HIGH (key) == 0)
3655 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3656 TREE_INT_CST_LOW (key));
3657 else if (!TYPE_UNSIGNED (type)
3658 && TREE_INT_CST_HIGH (key) == -1
3659 && TREE_INT_CST_LOW (key) != 0)
3660 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3661 -TREE_INT_CST_LOW (key));
3663 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3664 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3666 if (TYPE_NAME (type) == 0)
3667 warning ("%Jcase value %qs not in enumerated type",
3668 CASE_LABEL (label), buf);
3670 warning ("%Jcase value %qs not in enumerated type %qT",
3671 CASE_LABEL (label), buf, type);
3675 match_case_to_enum (splay_tree_node node, void *data)
3677 tree label = (tree) node->value;
3678 tree type = (tree) data;
3680 /* Skip default case. */
3681 if (!CASE_LOW (label))
3684 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3685 when we did our enum->case scan. Reset our scratch bit after. */
3686 if (!TREE_ADDRESSABLE (label))
3687 match_case_to_enum_1 (CASE_LOW (label), type, label);
3689 TREE_ADDRESSABLE (label) = 0;
3691 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3692 Note that the old code in stmt.c did not check for the values in
3693 the range either, just the endpoints. */
3694 if (CASE_HIGH (label))
3696 tree chain, key = CASE_HIGH (label);
3698 for (chain = TYPE_VALUES (type);
3699 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
3700 chain = TREE_CHAIN (chain))
3703 match_case_to_enum_1 (key, type, label);
3709 /* Handle -Wswitch*. Called from the front end after parsing the switch
3711 /* ??? Should probably be somewhere generic, since other languages besides
3712 C and C++ would want this. We'd want to agree on the data structure,
3713 however, which is a problem. Alternately, we operate on gimplified
3714 switch_exprs, which I don't especially like. At the moment, however,
3715 C/C++ are the only tree-ssa languages that support enumerations at all,
3716 so the point is moot. */
3719 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
3721 splay_tree_node default_node;
3722 location_t switch_location;
3725 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
3728 if (EXPR_HAS_LOCATION (switch_stmt))
3729 switch_location = EXPR_LOCATION (switch_stmt);
3731 switch_location = input_location;
3733 type = SWITCH_STMT_TYPE (switch_stmt);
3735 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3736 if (warn_switch_default && !default_node)
3737 warning ("%Hswitch missing default case", &switch_location);
3739 /* If the switch expression was an enumerated type, check that
3740 exactly all enumeration literals are covered by the cases.
3741 The check is made when -Wswitch was specified and there is no
3742 default case, or when -Wswitch-enum was specified. */
3743 if (((warn_switch && !default_node) || warn_switch_enum)
3744 && type && TREE_CODE (type) == ENUMERAL_TYPE
3745 && TREE_CODE (SWITCH_STMT_COND (switch_stmt)) != INTEGER_CST)
3749 /* The time complexity here is O(N*lg(N)) worst case, but for the
3750 common case of monotonically increasing enumerators, it is
3751 O(N), since the nature of the splay tree will keep the next
3752 element adjacent to the root at all times. */
3754 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
3756 splay_tree_node node
3757 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
3761 /* Mark the CASE_LOW part of the case entry as seen, so
3762 that we save time later. Choose TREE_ADDRESSABLE
3763 randomly as a bit that won't have been set to-date. */
3764 tree label = (tree) node->value;
3765 TREE_ADDRESSABLE (label) = 1;
3769 /* Warn if there are enumerators that don't correspond to
3770 case expressions. */
3771 warning ("%Henumeration value %qE not handled in switch",
3772 &switch_location, TREE_PURPOSE (chain));
3776 /* Warn if there are case expressions that don't correspond to
3777 enumerators. This can occur since C and C++ don't enforce
3778 type-checking of assignments to enumeration variables.
3780 The time complexity here is O(N**2) worst case, since we've
3781 not sorted the enumeration values. However, in the absence
3782 of case ranges this is O(N), since all single cases that
3783 corresponded to enumerations have been marked above. */
3785 splay_tree_foreach (cases, match_case_to_enum, type);
3789 /* Finish an expression taking the address of LABEL (an
3790 IDENTIFIER_NODE). Returns an expression for the address. */
3793 finish_label_address_expr (tree label)
3798 pedwarn ("taking the address of a label is non-standard");
3800 if (label == error_mark_node)
3801 return error_mark_node;
3803 label = lookup_label (label);
3804 if (label == NULL_TREE)
3805 result = null_pointer_node;
3808 TREE_USED (label) = 1;
3809 result = build1 (ADDR_EXPR, ptr_type_node, label);
3810 /* The current function in not necessarily uninlinable.
3811 Computed gotos are incompatible with inlining, but the value
3812 here could be used only in a diagnostic, for example. */
3818 /* Hook used by expand_expr to expand language-specific tree codes. */
3819 /* The only things that should go here are bits needed to expand
3820 constant initializers. Everything else should be handled by the
3821 gimplification routines. */
3824 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
3825 int modifier /* Actually enum_modifier. */,
3828 switch (TREE_CODE (exp))
3830 case COMPOUND_LITERAL_EXPR:
3832 /* Initialize the anonymous variable declared in the compound
3833 literal, then return the variable. */
3834 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
3835 emit_local_var (decl);
3836 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
3844 /* Hook used by staticp to handle language-specific tree codes. */
3847 c_staticp (tree exp)
3849 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
3850 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
3855 /* Given a boolean expression ARG, return a tree representing an increment
3856 or decrement (as indicated by CODE) of ARG. The front end must check for
3857 invalid cases (e.g., decrement in C++). */
3859 boolean_increment (enum tree_code code, tree arg)
3862 tree true_res = boolean_true_node;
3864 arg = stabilize_reference (arg);
3867 case PREINCREMENT_EXPR:
3868 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3870 case POSTINCREMENT_EXPR:
3871 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3872 arg = save_expr (arg);
3873 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3874 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3876 case PREDECREMENT_EXPR:
3877 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3878 invert_truthvalue (arg));
3880 case POSTDECREMENT_EXPR:
3881 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3882 invert_truthvalue (arg));
3883 arg = save_expr (arg);
3884 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3885 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3890 TREE_SIDE_EFFECTS (val) = 1;
3894 /* Built-in macros for stddef.h, that require macros defined in this
3897 c_stddef_cpp_builtins(void)
3899 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
3900 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
3901 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
3902 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
3903 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
3904 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
3908 c_init_attributes (void)
3910 /* Fill in the built_in_attributes array. */
3911 #define DEF_ATTR_NULL_TREE(ENUM) \
3912 built_in_attributes[(int) ENUM] = NULL_TREE;
3913 #define DEF_ATTR_INT(ENUM, VALUE) \
3914 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
3915 #define DEF_ATTR_IDENT(ENUM, STRING) \
3916 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3917 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3918 built_in_attributes[(int) ENUM] \
3919 = tree_cons (built_in_attributes[(int) PURPOSE], \
3920 built_in_attributes[(int) VALUE], \
3921 built_in_attributes[(int) CHAIN]);
3922 #include "builtin-attrs.def"
3923 #undef DEF_ATTR_NULL_TREE
3925 #undef DEF_ATTR_IDENT
3926 #undef DEF_ATTR_TREE_LIST
3929 /* Attribute handlers common to C front ends. */
3931 /* Handle a "packed" attribute; arguments as in
3932 struct attribute_spec.handler. */
3935 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3936 int flags, bool *no_add_attrs)
3940 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3941 *node = build_variant_type_copy (*node);
3942 TYPE_PACKED (*node) = 1;
3943 if (TYPE_MAIN_VARIANT (*node) == *node)
3945 /* If it is the main variant, then pack the other variants
3946 too. This happens in,
3949 struct Foo const *ptr; // creates a variant w/o packed flag
3950 } __ attribute__((packed)); // packs it now.
3954 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
3955 TYPE_PACKED (probe) = 1;
3959 else if (TREE_CODE (*node) == FIELD_DECL)
3960 DECL_PACKED (*node) = 1;
3961 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
3962 used for DECL_REGISTER. It wouldn't mean anything anyway.
3963 We can't set DECL_PACKED on the type of a TYPE_DECL, because
3964 that changes what the typedef is typing. */
3967 warning ("%qE attribute ignored", name);
3968 *no_add_attrs = true;
3974 /* Handle a "nocommon" attribute; arguments as in
3975 struct attribute_spec.handler. */
3978 handle_nocommon_attribute (tree *node, tree name,
3979 tree ARG_UNUSED (args),
3980 int ARG_UNUSED (flags), bool *no_add_attrs)
3982 if (TREE_CODE (*node) == VAR_DECL)
3983 DECL_COMMON (*node) = 0;
3986 warning ("%qE attribute ignored", name);
3987 *no_add_attrs = true;
3993 /* Handle a "common" attribute; arguments as in
3994 struct attribute_spec.handler. */
3997 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3998 int ARG_UNUSED (flags), bool *no_add_attrs)
4000 if (TREE_CODE (*node) == VAR_DECL)
4001 DECL_COMMON (*node) = 1;
4004 warning ("%qE attribute ignored", name);
4005 *no_add_attrs = true;
4011 /* Handle a "noreturn" attribute; arguments as in
4012 struct attribute_spec.handler. */
4015 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4016 int ARG_UNUSED (flags), bool *no_add_attrs)
4018 tree type = TREE_TYPE (*node);
4020 /* See FIXME comment in c_common_attribute_table. */
4021 if (TREE_CODE (*node) == FUNCTION_DECL)
4022 TREE_THIS_VOLATILE (*node) = 1;
4023 else if (TREE_CODE (type) == POINTER_TYPE
4024 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4026 = build_pointer_type
4027 (build_type_variant (TREE_TYPE (type),
4028 TYPE_READONLY (TREE_TYPE (type)), 1));
4031 warning ("%qE attribute ignored", name);
4032 *no_add_attrs = true;
4038 /* Handle a "noinline" attribute; arguments as in
4039 struct attribute_spec.handler. */
4042 handle_noinline_attribute (tree *node, tree name,
4043 tree ARG_UNUSED (args),
4044 int ARG_UNUSED (flags), bool *no_add_attrs)
4046 if (TREE_CODE (*node) == FUNCTION_DECL)
4047 DECL_UNINLINABLE (*node) = 1;
4050 warning ("%qE attribute ignored", name);
4051 *no_add_attrs = true;
4057 /* Handle a "always_inline" attribute; arguments as in
4058 struct attribute_spec.handler. */
4061 handle_always_inline_attribute (tree *node, tree name,
4062 tree ARG_UNUSED (args),
4063 int ARG_UNUSED (flags),
4066 if (TREE_CODE (*node) == FUNCTION_DECL)
4068 /* Do nothing else, just set the attribute. We'll get at
4069 it later with lookup_attribute. */
4073 warning ("%qE attribute ignored", name);
4074 *no_add_attrs = true;
4080 /* Handle a "used" attribute; arguments as in
4081 struct attribute_spec.handler. */
4084 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4085 int ARG_UNUSED (flags), bool *no_add_attrs)
4089 if (TREE_CODE (node) == FUNCTION_DECL
4090 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4092 TREE_USED (node) = 1;
4093 DECL_PRESERVE_P (node) = 1;
4097 warning ("%qE attribute ignored", name);
4098 *no_add_attrs = true;
4104 /* Handle a "unused" attribute; arguments as in
4105 struct attribute_spec.handler. */
4108 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4109 int flags, bool *no_add_attrs)
4115 if (TREE_CODE (decl) == PARM_DECL
4116 || TREE_CODE (decl) == VAR_DECL
4117 || TREE_CODE (decl) == FUNCTION_DECL
4118 || TREE_CODE (decl) == LABEL_DECL
4119 || TREE_CODE (decl) == TYPE_DECL)
4120 TREE_USED (decl) = 1;
4123 warning ("%qE attribute ignored", name);
4124 *no_add_attrs = true;
4129 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4130 *node = build_variant_type_copy (*node);
4131 TREE_USED (*node) = 1;
4137 /* Handle a "const" attribute; arguments as in
4138 struct attribute_spec.handler. */
4141 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4142 int ARG_UNUSED (flags), bool *no_add_attrs)
4144 tree type = TREE_TYPE (*node);
4146 /* See FIXME comment on noreturn in c_common_attribute_table. */
4147 if (TREE_CODE (*node) == FUNCTION_DECL)
4148 TREE_READONLY (*node) = 1;
4149 else if (TREE_CODE (type) == POINTER_TYPE
4150 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4152 = build_pointer_type
4153 (build_type_variant (TREE_TYPE (type), 1,
4154 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4157 warning ("%qE attribute ignored", name);
4158 *no_add_attrs = true;
4164 /* Handle a "transparent_union" attribute; arguments as in
4165 struct attribute_spec.handler. */
4168 handle_transparent_union_attribute (tree *node, tree name,
4169 tree ARG_UNUSED (args), int flags,
4172 tree decl = NULL_TREE;
4179 type = &TREE_TYPE (decl);
4180 is_type = TREE_CODE (*node) == TYPE_DECL;
4182 else if (TYPE_P (*node))
4183 type = node, is_type = 1;
4186 && TREE_CODE (*type) == UNION_TYPE
4188 || (TYPE_FIELDS (*type) != 0
4189 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4191 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4192 *type = build_variant_type_copy (*type);
4193 TYPE_TRANSPARENT_UNION (*type) = 1;
4195 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4196 && TREE_CODE (*type) == UNION_TYPE
4197 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4198 DECL_TRANSPARENT_UNION (decl) = 1;
4201 warning ("%qE attribute ignored", name);
4202 *no_add_attrs = true;
4208 /* Handle a "constructor" attribute; arguments as in
4209 struct attribute_spec.handler. */
4212 handle_constructor_attribute (tree *node, tree name,
4213 tree ARG_UNUSED (args),
4214 int ARG_UNUSED (flags),
4218 tree type = TREE_TYPE (decl);
4220 if (TREE_CODE (decl) == FUNCTION_DECL
4221 && TREE_CODE (type) == FUNCTION_TYPE
4222 && decl_function_context (decl) == 0)
4224 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4225 TREE_USED (decl) = 1;
4229 warning ("%qE attribute ignored", name);
4230 *no_add_attrs = true;
4236 /* Handle a "destructor" attribute; arguments as in
4237 struct attribute_spec.handler. */
4240 handle_destructor_attribute (tree *node, tree name,
4241 tree ARG_UNUSED (args),
4242 int ARG_UNUSED (flags),
4246 tree type = TREE_TYPE (decl);
4248 if (TREE_CODE (decl) == FUNCTION_DECL
4249 && TREE_CODE (type) == FUNCTION_TYPE
4250 && decl_function_context (decl) == 0)
4252 DECL_STATIC_DESTRUCTOR (decl) = 1;
4253 TREE_USED (decl) = 1;
4257 warning ("%qE attribute ignored", name);
4258 *no_add_attrs = true;
4264 /* Handle a "mode" attribute; arguments as in
4265 struct attribute_spec.handler. */
4268 handle_mode_attribute (tree *node, tree name, tree args,
4269 int ARG_UNUSED (flags), bool *no_add_attrs)
4273 *no_add_attrs = true;
4275 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4276 warning ("%qE attribute ignored", name);
4280 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4281 int len = strlen (p);
4282 enum machine_mode mode = VOIDmode;
4286 if (len > 4 && p[0] == '_' && p[1] == '_'
4287 && p[len - 1] == '_' && p[len - 2] == '_')
4289 char *newp = (char *) alloca (len - 1);
4291 strcpy (newp, &p[2]);
4292 newp[len - 4] = '\0';
4296 /* Change this type to have a type with the specified mode.
4297 First check for the special modes. */
4298 if (!strcmp (p, "byte"))
4300 else if (!strcmp (p, "word"))
4302 else if (!strcmp (p, "pointer"))
4305 for (j = 0; j < NUM_MACHINE_MODES; j++)
4306 if (!strcmp (p, GET_MODE_NAME (j)))
4308 mode = (enum machine_mode) j;
4312 if (mode == VOIDmode)
4314 error ("unknown machine mode %qs", p);
4319 switch (GET_MODE_CLASS (mode))
4322 case MODE_PARTIAL_INT:
4324 valid_mode = targetm.scalar_mode_supported_p (mode);
4327 case MODE_COMPLEX_INT:
4328 case MODE_COMPLEX_FLOAT:
4329 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
4332 case MODE_VECTOR_INT:
4333 case MODE_VECTOR_FLOAT:
4334 warning ("specifying vector types with __attribute__ ((mode)) "
4336 warning ("use __attribute__ ((vector_size)) instead");
4337 valid_mode = vector_mode_valid_p (mode);
4345 error ("unable to emulate %qs", p);
4349 if (POINTER_TYPE_P (type))
4351 tree (*fn)(tree, enum machine_mode, bool);
4353 if (!targetm.valid_pointer_mode (mode))
4355 error ("invalid pointer mode %qs", p);
4359 if (TREE_CODE (type) == POINTER_TYPE)
4360 fn = build_pointer_type_for_mode;
4362 fn = build_reference_type_for_mode;
4363 typefm = fn (TREE_TYPE (type), mode, false);
4366 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4368 if (typefm == NULL_TREE)
4370 error ("no data type for mode %qs", p);
4373 else if (TREE_CODE (type) == ENUMERAL_TYPE)
4375 /* For enumeral types, copy the precision from the integer
4376 type returned above. If not an INTEGER_TYPE, we can't use
4377 this mode for this type. */
4378 if (TREE_CODE (typefm) != INTEGER_TYPE)
4380 error ("cannot use mode %qs for enumeral types", p);
4384 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4385 type = build_variant_type_copy (type);
4387 /* We cannot use layout_type here, because that will attempt
4388 to re-layout all variants, corrupting our original. */
4389 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
4390 TYPE_MIN_VALUE (type) = TYPE_MIN_VALUE (typefm);
4391 TYPE_MAX_VALUE (type) = TYPE_MAX_VALUE (typefm);
4392 TYPE_SIZE (type) = TYPE_SIZE (typefm);
4393 TYPE_SIZE_UNIT (type) = TYPE_SIZE_UNIT (typefm);
4394 TYPE_MODE (type) = TYPE_MODE (typefm);
4395 if (!TYPE_USER_ALIGN (type))
4396 TYPE_ALIGN (type) = TYPE_ALIGN (typefm);
4400 else if (VECTOR_MODE_P (mode)
4401 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
4402 : TREE_CODE (type) != TREE_CODE (typefm))
4404 error ("mode %qs applied to inappropriate type", p);
4414 /* Handle a "section" attribute; arguments as in
4415 struct attribute_spec.handler. */
4418 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4419 int ARG_UNUSED (flags), bool *no_add_attrs)
4423 if (targetm.have_named_sections)
4425 user_defined_section_attribute = true;
4427 if ((TREE_CODE (decl) == FUNCTION_DECL
4428 || TREE_CODE (decl) == VAR_DECL)
4429 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4431 if (TREE_CODE (decl) == VAR_DECL
4432 && current_function_decl != NULL_TREE
4433 && !TREE_STATIC (decl))
4435 error ("%Jsection attribute cannot be specified for "
4436 "local variables", decl);
4437 *no_add_attrs = true;
4440 /* The decl may have already been given a section attribute
4441 from a previous declaration. Ensure they match. */
4442 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4443 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4444 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4446 error ("%Jsection of %qD conflicts with previous declaration",
4448 *no_add_attrs = true;
4451 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4455 error ("%Jsection attribute not allowed for %qD", *node, *node);
4456 *no_add_attrs = true;
4461 error ("%Jsection attributes are not supported for this target", *node);
4462 *no_add_attrs = true;
4468 /* Handle a "aligned" attribute; arguments as in
4469 struct attribute_spec.handler. */
4472 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4473 int flags, bool *no_add_attrs)
4475 tree decl = NULL_TREE;
4478 tree align_expr = (args ? TREE_VALUE (args)
4479 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4485 type = &TREE_TYPE (decl);
4486 is_type = TREE_CODE (*node) == TYPE_DECL;
4488 else if (TYPE_P (*node))
4489 type = node, is_type = 1;
4491 if (TREE_CODE (align_expr) != INTEGER_CST)
4493 error ("requested alignment is not a constant");
4494 *no_add_attrs = true;
4496 else if ((i = tree_log2 (align_expr)) == -1)
4498 error ("requested alignment is not a power of 2");
4499 *no_add_attrs = true;
4501 else if (i > HOST_BITS_PER_INT - 2)
4503 error ("requested alignment is too large");
4504 *no_add_attrs = true;
4508 /* If we have a TYPE_DECL, then copy the type, so that we
4509 don't accidentally modify a builtin type. See pushdecl. */
4510 if (decl && TREE_TYPE (decl) != error_mark_node
4511 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4513 tree tt = TREE_TYPE (decl);
4514 *type = build_variant_type_copy (*type);
4515 DECL_ORIGINAL_TYPE (decl) = tt;
4516 TYPE_NAME (*type) = decl;
4517 TREE_USED (*type) = TREE_USED (decl);
4518 TREE_TYPE (decl) = *type;
4520 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4521 *type = build_variant_type_copy (*type);
4523 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4524 TYPE_USER_ALIGN (*type) = 1;
4526 else if (TREE_CODE (decl) != VAR_DECL
4527 && TREE_CODE (decl) != FIELD_DECL)
4529 error ("%Jalignment may not be specified for %qD", decl, decl);
4530 *no_add_attrs = true;
4534 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4535 DECL_USER_ALIGN (decl) = 1;
4541 /* Handle a "weak" attribute; arguments as in
4542 struct attribute_spec.handler. */
4545 handle_weak_attribute (tree *node, tree ARG_UNUSED (name),
4546 tree ARG_UNUSED (args),
4547 int ARG_UNUSED (flags),
4548 bool * ARG_UNUSED (no_add_attrs))
4550 declare_weak (*node);
4555 /* Handle an "alias" attribute; arguments as in
4556 struct attribute_spec.handler. */
4559 handle_alias_attribute (tree *node, tree name, tree args,
4560 int ARG_UNUSED (flags), bool *no_add_attrs)
4564 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4565 || (TREE_CODE (decl) != FUNCTION_DECL && !DECL_EXTERNAL (decl)))
4567 error ("%J%qD defined both normally and as an alias", decl, decl);
4568 *no_add_attrs = true;
4571 /* Note that the very first time we process a nested declaration,
4572 decl_function_context will not be set. Indeed, *would* never
4573 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4574 we do below. After such frobbery, pushdecl would set the context.
4575 In any case, this is never what we want. */
4576 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4580 id = TREE_VALUE (args);
4581 if (TREE_CODE (id) != STRING_CST)
4583 error ("alias argument not a string");
4584 *no_add_attrs = true;
4587 id = get_identifier (TREE_STRING_POINTER (id));
4588 /* This counts as a use of the object pointed to. */
4591 if (TREE_CODE (decl) == FUNCTION_DECL)
4592 DECL_INITIAL (decl) = error_mark_node;
4595 DECL_EXTERNAL (decl) = 0;
4596 TREE_STATIC (decl) = 1;
4601 warning ("%qE attribute ignored", name);
4602 *no_add_attrs = true;
4608 /* Handle an "visibility" attribute; arguments as in
4609 struct attribute_spec.handler. */
4612 handle_visibility_attribute (tree *node, tree name, tree args,
4613 int ARG_UNUSED (flags),
4617 tree id = TREE_VALUE (args);
4619 *no_add_attrs = true;
4623 if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
4625 warning ("%qE attribute ignored on non-class types", name);
4629 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
4631 warning ("%qE attribute ignored", name);
4635 if (TREE_CODE (id) != STRING_CST)
4637 error ("visibility argument not a string");
4641 /* If this is a type, set the visibility on the type decl. */
4644 decl = TYPE_NAME (decl);
4647 if (TREE_CODE (decl) == IDENTIFIER_NODE)
4649 warning ("%qE attribute ignored on types",
4655 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4656 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4657 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4658 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4659 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4660 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4661 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4662 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4664 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4665 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4667 /* For decls only, go ahead and attach the attribute to the node as well.
4668 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4669 because the visibility was not specified, or because it was explicitly
4670 overridden from the class visibility. */
4672 *no_add_attrs = false;
4677 /* Determine the ELF symbol visibility for DECL, which is either a
4678 variable or a function. It is an error to use this function if a
4679 definition of DECL is not available in this translation unit.
4680 Returns true if the final visibility has been determined by this
4681 function; false if the caller is free to make additional
4685 c_determine_visibility (tree decl)
4687 gcc_assert (TREE_CODE (decl) == VAR_DECL
4688 || TREE_CODE (decl) == FUNCTION_DECL);
4690 /* If the user explicitly specified the visibility with an
4691 attribute, honor that. DECL_VISIBILITY will have been set during
4692 the processing of the attribute. We check for an explicit
4693 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4694 to distinguish the use of an attribute from the use of a "#pragma
4695 GCC visibility push(...)"; in the latter case we still want other
4696 considerations to be able to overrule the #pragma. */
4697 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
4700 /* Anything that is exported must have default visibility. */
4701 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4702 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
4704 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4705 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4712 /* Handle an "tls_model" attribute; arguments as in
4713 struct attribute_spec.handler. */
4716 handle_tls_model_attribute (tree *node, tree name, tree args,
4717 int ARG_UNUSED (flags), bool *no_add_attrs)
4721 if (!DECL_THREAD_LOCAL (decl))
4723 warning ("%qE attribute ignored", name);
4724 *no_add_attrs = true;
4730 id = TREE_VALUE (args);
4731 if (TREE_CODE (id) != STRING_CST)
4733 error ("tls_model argument not a string");
4734 *no_add_attrs = true;
4737 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4738 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4739 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4740 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4742 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4743 *no_add_attrs = true;
4751 /* Handle a "no_instrument_function" attribute; arguments as in
4752 struct attribute_spec.handler. */
4755 handle_no_instrument_function_attribute (tree *node, tree name,
4756 tree ARG_UNUSED (args),
4757 int ARG_UNUSED (flags),
4762 if (TREE_CODE (decl) != FUNCTION_DECL)
4764 error ("%J%qE attribute applies only to functions", decl, name);
4765 *no_add_attrs = true;
4767 else if (DECL_INITIAL (decl))
4769 error ("%Jcan%'t set %qE attribute after definition", decl, name);
4770 *no_add_attrs = true;
4773 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4778 /* Handle a "malloc" attribute; arguments as in
4779 struct attribute_spec.handler. */
4782 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4783 int ARG_UNUSED (flags), bool *no_add_attrs)
4785 if (TREE_CODE (*node) == FUNCTION_DECL)
4786 DECL_IS_MALLOC (*node) = 1;
4787 /* ??? TODO: Support types. */
4790 warning ("%qE attribute ignored", name);
4791 *no_add_attrs = true;
4797 /* Handle a "returns_twice" attribute; arguments as in
4798 struct attribute_spec.handler. */
4801 handle_returns_twice_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4802 int ARG_UNUSED (flags), bool *no_add_attrs)
4804 if (TREE_CODE (*node) == FUNCTION_DECL)
4805 DECL_IS_RETURNS_TWICE (*node) = 1;
4808 warning ("%qE attribute ignored", name);
4809 *no_add_attrs = true;
4815 /* Handle a "no_limit_stack" attribute; arguments as in
4816 struct attribute_spec.handler. */
4819 handle_no_limit_stack_attribute (tree *node, tree name,
4820 tree ARG_UNUSED (args),
4821 int ARG_UNUSED (flags),
4826 if (TREE_CODE (decl) != FUNCTION_DECL)
4828 error ("%J%qE attribute applies only to functions", decl, name);
4829 *no_add_attrs = true;
4831 else if (DECL_INITIAL (decl))
4833 error ("%Jcan%'t set %qE attribute after definition", decl, name);
4834 *no_add_attrs = true;
4837 DECL_NO_LIMIT_STACK (decl) = 1;
4842 /* Handle a "pure" attribute; arguments as in
4843 struct attribute_spec.handler. */
4846 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4847 int ARG_UNUSED (flags), bool *no_add_attrs)
4849 if (TREE_CODE (*node) == FUNCTION_DECL)
4850 DECL_IS_PURE (*node) = 1;
4851 /* ??? TODO: Support types. */
4854 warning ("%qE attribute ignored", name);
4855 *no_add_attrs = true;
4861 /* Handle a "no vops" attribute; arguments as in
4862 struct attribute_spec.handler. */
4865 handle_novops_attribute (tree *node, tree ARG_UNUSED (name),
4866 tree ARG_UNUSED (args), int ARG_UNUSED (flags),
4867 bool *ARG_UNUSED (no_add_attrs))
4869 gcc_assert (TREE_CODE (*node) == FUNCTION_DECL);
4870 DECL_IS_NOVOPS (*node) = 1;
4874 /* Handle a "deprecated" attribute; arguments as in
4875 struct attribute_spec.handler. */
4878 handle_deprecated_attribute (tree *node, tree name,
4879 tree ARG_UNUSED (args), int flags,
4882 tree type = NULL_TREE;
4884 tree what = NULL_TREE;
4889 type = TREE_TYPE (decl);
4891 if (TREE_CODE (decl) == TYPE_DECL
4892 || TREE_CODE (decl) == PARM_DECL
4893 || TREE_CODE (decl) == VAR_DECL
4894 || TREE_CODE (decl) == FUNCTION_DECL
4895 || TREE_CODE (decl) == FIELD_DECL)
4896 TREE_DEPRECATED (decl) = 1;
4900 else if (TYPE_P (*node))
4902 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4903 *node = build_variant_type_copy (*node);
4904 TREE_DEPRECATED (*node) = 1;
4912 *no_add_attrs = true;
4913 if (type && TYPE_NAME (type))
4915 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
4916 what = TYPE_NAME (*node);
4917 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
4918 && DECL_NAME (TYPE_NAME (type)))
4919 what = DECL_NAME (TYPE_NAME (type));
4922 warning ("%qE attribute ignored for %qE", name, what);
4924 warning ("%qE attribute ignored", name);
4930 /* Handle a "vector_size" attribute; arguments as in
4931 struct attribute_spec.handler. */
4934 handle_vector_size_attribute (tree *node, tree name, tree args,
4935 int ARG_UNUSED (flags),
4938 unsigned HOST_WIDE_INT vecsize, nunits;
4939 enum machine_mode orig_mode;
4940 tree type = *node, new_type, size;
4942 *no_add_attrs = true;
4944 size = TREE_VALUE (args);
4946 if (!host_integerp (size, 1))
4948 warning ("%qE attribute ignored", name);
4952 /* Get the vector size (in bytes). */
4953 vecsize = tree_low_cst (size, 1);
4955 /* We need to provide for vector pointers, vector arrays, and
4956 functions returning vectors. For example:
4958 __attribute__((vector_size(16))) short *foo;
4960 In this case, the mode is SI, but the type being modified is
4961 HI, so we need to look further. */
4963 while (POINTER_TYPE_P (type)
4964 || TREE_CODE (type) == FUNCTION_TYPE
4965 || TREE_CODE (type) == METHOD_TYPE
4966 || TREE_CODE (type) == ARRAY_TYPE)
4967 type = TREE_TYPE (type);
4969 /* Get the mode of the type being modified. */
4970 orig_mode = TYPE_MODE (type);
4972 if (TREE_CODE (type) == RECORD_TYPE
4973 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
4974 && GET_MODE_CLASS (orig_mode) != MODE_INT)
4975 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
4977 error ("invalid vector type for attribute %qE", name);
4981 /* Calculate how many units fit in the vector. */
4982 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
4983 if (nunits & (nunits - 1))
4985 error ("number of components of the vector not a power of two");
4989 new_type = build_vector_type (type, nunits);
4991 /* Build back pointers if needed. */
4992 *node = reconstruct_complex_type (*node, new_type);
4997 /* Handle the "nonnull" attribute. */
4999 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
5000 tree args, int ARG_UNUSED (flags),
5004 unsigned HOST_WIDE_INT attr_arg_num;
5006 /* If no arguments are specified, all pointer arguments should be
5007 non-null. Verify a full prototype is given so that the arguments
5008 will have the correct types when we actually check them later. */
5011 if (!TYPE_ARG_TYPES (type))
5013 error ("nonnull attribute without arguments on a non-prototype");
5014 *no_add_attrs = true;
5019 /* Argument list specified. Verify that each argument number references
5020 a pointer argument. */
5021 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5024 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
5026 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
5028 error ("nonnull argument has invalid operand number (argument %lu)",
5029 (unsigned long) attr_arg_num);
5030 *no_add_attrs = true;
5034 argument = TYPE_ARG_TYPES (type);
5037 for (ck_num = 1; ; ck_num++)
5039 if (!argument || ck_num == arg_num)
5041 argument = TREE_CHAIN (argument);
5045 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5047 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5048 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5049 *no_add_attrs = true;
5053 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5055 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5056 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5057 *no_add_attrs = true;
5066 /* Check the argument list of a function call for null in argument slots
5067 that are marked as requiring a non-null pointer argument. */
5070 check_function_nonnull (tree attrs, tree params)
5072 tree a, args, param;
5075 for (a = attrs; a; a = TREE_CHAIN (a))
5077 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5079 args = TREE_VALUE (a);
5081 /* Walk the argument list. If we encounter an argument number we
5082 should check for non-null, do it. If the attribute has no args,
5083 then every pointer argument is checked (in which case the check
5084 for pointer type is done in check_nonnull_arg). */
5085 for (param = params, param_num = 1; ;
5086 param_num++, param = TREE_CHAIN (param))
5090 if (!args || nonnull_check_p (args, param_num))
5091 check_function_arguments_recurse (check_nonnull_arg, NULL,
5099 /* Check that the Nth argument of a function call (counting backwards
5100 from the end) is a (pointer)0. */
5103 check_function_sentinel (tree attrs, tree params)
5105 tree attr = lookup_attribute ("sentinel", attrs);
5110 warning ("missing sentinel in function call");
5116 if (TREE_VALUE (attr))
5118 tree p = TREE_VALUE (TREE_VALUE (attr));
5119 pos = TREE_INT_CST_LOW (p);
5122 sentinel = end = params;
5124 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5125 while (pos > 0 && TREE_CHAIN (end))
5128 end = TREE_CHAIN (end);
5132 warning ("not enough arguments to fit a sentinel");
5136 /* Now advance both until we find the last parameter. */
5137 while (TREE_CHAIN (end))
5139 end = TREE_CHAIN (end);
5140 sentinel = TREE_CHAIN (sentinel);
5143 /* Validate the sentinel. */
5144 if (!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel)))
5145 || !integer_zerop (TREE_VALUE (sentinel)))
5146 warning ("missing sentinel in function call");
5151 /* Helper for check_function_nonnull; given a list of operands which
5152 must be non-null in ARGS, determine if operand PARAM_NUM should be
5156 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5158 unsigned HOST_WIDE_INT arg_num = 0;
5160 for (; args; args = TREE_CHAIN (args))
5162 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
5166 if (arg_num == param_num)
5172 /* Check that the function argument PARAM (which is operand number
5173 PARAM_NUM) is non-null. This is called by check_function_nonnull
5174 via check_function_arguments_recurse. */
5177 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5178 unsigned HOST_WIDE_INT param_num)
5180 /* Just skip checking the argument if it's not a pointer. This can
5181 happen if the "nonnull" attribute was given without an operand
5182 list (which means to check every pointer argument). */
5184 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5187 if (integer_zerop (param))
5188 warning ("null argument where non-null required (argument %lu)",
5189 (unsigned long) param_num);
5192 /* Helper for nonnull attribute handling; fetch the operand number
5193 from the attribute argument list. */
5196 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5198 /* Verify the arg number is a constant. */
5199 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5200 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5203 *valp = TREE_INT_CST_LOW (arg_num_expr);
5207 /* Handle a "nothrow" attribute; arguments as in
5208 struct attribute_spec.handler. */
5211 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5212 int ARG_UNUSED (flags), bool *no_add_attrs)
5214 if (TREE_CODE (*node) == FUNCTION_DECL)
5215 TREE_NOTHROW (*node) = 1;
5216 /* ??? TODO: Support types. */
5219 warning ("%qE attribute ignored", name);
5220 *no_add_attrs = true;
5226 /* Handle a "cleanup" attribute; arguments as in
5227 struct attribute_spec.handler. */
5230 handle_cleanup_attribute (tree *node, tree name, tree args,
5231 int ARG_UNUSED (flags), bool *no_add_attrs)
5234 tree cleanup_id, cleanup_decl;
5236 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5237 for global destructors in C++. This requires infrastructure that
5238 we don't have generically at the moment. It's also not a feature
5239 we'd be missing too much, since we do have attribute constructor. */
5240 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5242 warning ("%qE attribute ignored", name);
5243 *no_add_attrs = true;
5247 /* Verify that the argument is a function in scope. */
5248 /* ??? We could support pointers to functions here as well, if
5249 that was considered desirable. */
5250 cleanup_id = TREE_VALUE (args);
5251 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5253 error ("cleanup argument not an identifier");
5254 *no_add_attrs = true;
5257 cleanup_decl = lookup_name (cleanup_id);
5258 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5260 error ("cleanup argument not a function");
5261 *no_add_attrs = true;
5265 /* That the function has proper type is checked with the
5266 eventual call to build_function_call. */
5271 /* Handle a "warn_unused_result" attribute. No special handling. */
5274 handle_warn_unused_result_attribute (tree *node, tree name,
5275 tree ARG_UNUSED (args),
5276 int ARG_UNUSED (flags), bool *no_add_attrs)
5278 /* Ignore the attribute for functions not returning any value. */
5279 if (VOID_TYPE_P (TREE_TYPE (*node)))
5281 warning ("%qE attribute ignored", name);
5282 *no_add_attrs = true;
5288 /* Handle a "sentinel" attribute. */
5291 handle_sentinel_attribute (tree *node, tree name, tree args,
5292 int ARG_UNUSED (flags), bool *no_add_attrs)
5294 tree params = TYPE_ARG_TYPES (*node);
5298 warning ("%qE attribute requires prototypes with named arguments", name);
5299 *no_add_attrs = true;
5303 while (TREE_CHAIN (params))
5304 params = TREE_CHAIN (params);
5306 if (VOID_TYPE_P (TREE_VALUE (params)))
5308 warning ("%qE attribute only applies to variadic functions", name);
5309 *no_add_attrs = true;
5315 tree position = TREE_VALUE (args);
5317 if (TREE_CODE (position) != INTEGER_CST)
5319 warning ("requested position is not an integer constant");
5320 *no_add_attrs = true;
5324 if (tree_int_cst_lt (position, integer_zero_node))
5326 warning ("requested position is less than zero");
5327 *no_add_attrs = true;
5335 /* Check for valid arguments being passed to a function. */
5337 check_function_arguments (tree attrs, tree params)
5339 /* Check for null being passed in a pointer argument that must be
5340 non-null. We also need to do this if format checking is enabled. */
5343 check_function_nonnull (attrs, params);
5345 /* Check for errors in format strings. */
5349 check_function_format (attrs, params);
5350 check_function_sentinel (attrs, params);
5354 /* Generic argument checking recursion routine. PARAM is the argument to
5355 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5356 once the argument is resolved. CTX is context for the callback. */
5358 check_function_arguments_recurse (void (*callback)
5359 (void *, tree, unsigned HOST_WIDE_INT),
5360 void *ctx, tree param,
5361 unsigned HOST_WIDE_INT param_num)
5363 if (TREE_CODE (param) == NOP_EXPR)
5365 /* Strip coercion. */
5366 check_function_arguments_recurse (callback, ctx,
5367 TREE_OPERAND (param, 0), param_num);
5371 if (TREE_CODE (param) == CALL_EXPR)
5373 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5375 bool found_format_arg = false;
5377 /* See if this is a call to a known internationalization function
5378 that modifies a format arg. Such a function may have multiple
5379 format_arg attributes (for example, ngettext). */
5381 for (attrs = TYPE_ATTRIBUTES (type);
5383 attrs = TREE_CHAIN (attrs))
5384 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5387 tree format_num_expr;
5391 /* Extract the argument number, which was previously checked
5393 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5395 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
5396 && !TREE_INT_CST_HIGH (format_num_expr));
5398 format_num = TREE_INT_CST_LOW (format_num_expr);
5400 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5402 inner_args = TREE_CHAIN (inner_args), i++)
5403 if (i == format_num)
5405 check_function_arguments_recurse (callback, ctx,
5406 TREE_VALUE (inner_args),
5408 found_format_arg = true;
5413 /* If we found a format_arg attribute and did a recursive check,
5414 we are done with checking this argument. Otherwise, we continue
5415 and this will be considered a non-literal. */
5416 if (found_format_arg)
5420 if (TREE_CODE (param) == COND_EXPR)
5422 /* Check both halves of the conditional expression. */
5423 check_function_arguments_recurse (callback, ctx,
5424 TREE_OPERAND (param, 1), param_num);
5425 check_function_arguments_recurse (callback, ctx,
5426 TREE_OPERAND (param, 2), param_num);
5430 (*callback) (ctx, param, param_num);
5433 /* Function to help qsort sort FIELD_DECLs by name order. */
5436 field_decl_cmp (const void *x_p, const void *y_p)
5438 const tree *const x = (const tree *const) x_p;
5439 const tree *const y = (const tree *const) y_p;
5441 if (DECL_NAME (*x) == DECL_NAME (*y))
5442 /* A nontype is "greater" than a type. */
5443 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5444 if (DECL_NAME (*x) == NULL_TREE)
5446 if (DECL_NAME (*y) == NULL_TREE)
5448 if (DECL_NAME (*x) < DECL_NAME (*y))
5454 gt_pointer_operator new_value;
5458 /* This routine compares two fields like field_decl_cmp but using the
5459 pointer operator in resort_data. */
5462 resort_field_decl_cmp (const void *x_p, const void *y_p)
5464 const tree *const x = (const tree *const) x_p;
5465 const tree *const y = (const tree *const) y_p;
5467 if (DECL_NAME (*x) == DECL_NAME (*y))
5468 /* A nontype is "greater" than a type. */
5469 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5470 if (DECL_NAME (*x) == NULL_TREE)
5472 if (DECL_NAME (*y) == NULL_TREE)
5475 tree d1 = DECL_NAME (*x);
5476 tree d2 = DECL_NAME (*y);
5477 resort_data.new_value (&d1, resort_data.cookie);
5478 resort_data.new_value (&d2, resort_data.cookie);
5485 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5488 resort_sorted_fields (void *obj,
5489 void * ARG_UNUSED (orig_obj),
5490 gt_pointer_operator new_value,
5493 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
5494 resort_data.new_value = new_value;
5495 resort_data.cookie = cookie;
5496 qsort (&sf->elts[0], sf->len, sizeof (tree),
5497 resort_field_decl_cmp);
5500 /* Subroutine of c_parse_error.
5501 Return the result of concatenating LHS and RHS. RHS is really
5502 a string literal, its first character is indicated by RHS_START and
5503 RHS_SIZE is its length (including the terminating NUL character).
5505 The caller is responsible for deleting the returned pointer. */
5508 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
5510 const int lhs_size = strlen (lhs);
5511 char *result = XNEWVEC (char, lhs_size + rhs_size);
5512 strncpy (result, lhs, lhs_size);
5513 strncpy (result + lhs_size, rhs_start, rhs_size);
5517 /* Issue the error given by MSGID, indicating that it occurred before
5518 TOKEN, which had the associated VALUE. */
5521 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5523 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5525 char *message = NULL;
5527 if (token == CPP_EOF)
5528 message = catenate_messages (msgid, " at end of input");
5529 else if (token == CPP_CHAR || token == CPP_WCHAR)
5531 unsigned int val = TREE_INT_CST_LOW (value);
5532 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5533 if (val <= UCHAR_MAX && ISGRAPH (val))
5534 message = catenate_messages (msgid, " before %s'%c'");
5536 message = catenate_messages (msgid, " before %s'\\x%x'");
5538 error (message, ell, val);
5542 else if (token == CPP_STRING || token == CPP_WSTRING)
5543 message = catenate_messages (msgid, " before string constant");
5544 else if (token == CPP_NUMBER)
5545 message = catenate_messages (msgid, " before numeric constant");
5546 else if (token == CPP_NAME)
5548 message = catenate_messages (msgid, " before %qE");
5549 error (message, value);
5553 else if (token < N_TTYPES)
5555 message = catenate_messages (msgid, " before %qs token");
5556 error (message, cpp_type2name (token));
5568 #undef catenate_messages
5571 /* Walk a gimplified function and warn for functions whose return value is
5572 ignored and attribute((warn_unused_result)) is set. This is done before
5573 inlining, so we don't have to worry about that. */
5576 c_warn_unused_result (tree *top_p)
5579 tree_stmt_iterator i;
5582 switch (TREE_CODE (t))
5584 case STATEMENT_LIST:
5585 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5586 c_warn_unused_result (tsi_stmt_ptr (i));
5590 c_warn_unused_result (&COND_EXPR_THEN (t));
5591 c_warn_unused_result (&COND_EXPR_ELSE (t));
5594 c_warn_unused_result (&BIND_EXPR_BODY (t));
5596 case TRY_FINALLY_EXPR:
5597 case TRY_CATCH_EXPR:
5598 c_warn_unused_result (&TREE_OPERAND (t, 0));
5599 c_warn_unused_result (&TREE_OPERAND (t, 1));
5602 c_warn_unused_result (&CATCH_BODY (t));
5604 case EH_FILTER_EXPR:
5605 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5612 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5613 a MODIFY_EXPR. All calls whose value is ignored should be
5614 represented like this. Look for the attribute. */
5615 fdecl = get_callee_fndecl (t);
5617 ftype = TREE_TYPE (fdecl);
5620 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5621 /* Look past pointer-to-function to the function type itself. */
5622 ftype = TREE_TYPE (ftype);
5625 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5628 warning ("%Hignoring return value of %qD, "
5629 "declared with attribute warn_unused_result",
5630 EXPR_LOCUS (t), fdecl);
5632 warning ("%Hignoring return value of function "
5633 "declared with attribute warn_unused_result",
5639 /* Not a container, not a call, or a call whose value is used. */
5644 /* Convert a character from the host to the target execution character
5645 set. cpplib handles this, mostly. */
5648 c_common_to_target_charset (HOST_WIDE_INT c)
5650 /* Character constants in GCC proper are sign-extended under -fsigned-char,
5651 zero-extended under -fno-signed-char. cpplib insists that characters
5652 and character constants are always unsigned. Hence we must convert
5654 cppchar_t uc = ((cppchar_t)c) & ((((cppchar_t)1) << CHAR_BIT)-1);
5656 uc = cpp_host_to_exec_charset (parse_in, uc);
5658 if (flag_signed_char)
5659 return ((HOST_WIDE_INT)uc) << (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE)
5660 >> (HOST_BITS_PER_WIDE_INT - CHAR_TYPE_SIZE);
5665 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
5666 component references, with an INDIRECT_REF at the bottom; much like
5667 the traditional rendering of offsetof as a macro. Returns the folded
5668 and properly cast result. */
5671 fold_offsetof_1 (tree expr)
5673 enum tree_code code = PLUS_EXPR;
5676 switch (TREE_CODE (expr))
5682 return size_zero_node;
5685 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5686 if (base == error_mark_node)
5689 t = TREE_OPERAND (expr, 1);
5690 if (DECL_C_BIT_FIELD (t))
5692 error ("attempt to take address of bit-field structure "
5694 return error_mark_node;
5696 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
5697 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
5702 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5703 if (base == error_mark_node)
5706 t = TREE_OPERAND (expr, 1);
5707 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
5710 t = fold (build1 (NEGATE_EXPR, TREE_TYPE (t), t));
5712 t = convert (sizetype, t);
5713 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
5720 return size_binop (code, base, off);
5724 fold_offsetof (tree expr)
5726 /* Convert back from the internal sizetype to size_t. */
5727 return convert (size_type_node, fold_offsetof_1 (expr));
5730 /* Print an error message for an invalid lvalue. USE says
5731 how the lvalue is being used and so selects the error message. */
5734 lvalue_error (enum lvalue_use use)
5739 error ("invalid lvalue in assignment");
5742 error ("invalid lvalue in increment");
5745 error ("invalid lvalue in decrement");
5748 error ("invalid lvalue in unary %<&%>");
5751 error ("invalid lvalue in asm statement");
5758 #include "gt-c-common.h"