Missed one in last change.
[official-gcc.git] / gcc / c-common.c
blob341018c0e5bd0f28d8bc043f4754a1752ac35144
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 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
10 version.
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
15 for more details.
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
20 02111-1307, USA. */
22 #include "config.h"
23 #include "system.h"
24 #include "coretypes.h"
25 #include "tm.h"
26 #include "intl.h"
27 #include "tree.h"
28 #include "flags.h"
29 #include "output.h"
30 #include "c-pragma.h"
31 #include "rtl.h"
32 #include "ggc.h"
33 #include "varray.h"
34 #include "expr.h"
35 #include "c-common.h"
36 #include "diagnostic.h"
37 #include "tm_p.h"
38 #include "obstack.h"
39 #include "cpplib.h"
40 #include "target.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
43 #include "c-tree.h"
44 /* In order to ensure we use a common subset of valid specifiers
45 (between the various C family frontends) in this file, we restrict
46 ourselves to the generic specifier set. */
47 #undef GCC_DIAG_STYLE
48 #include "toplev.h"
50 cpp_reader *parse_in; /* Declared in c-pragma.h. */
52 /* We let tm.h override the types used here, to handle trivial differences
53 such as the choice of unsigned int or long unsigned int for size_t.
54 When machines start needing nontrivial differences in the size type,
55 it would be best to do something here to figure out automatically
56 from other information what type to use. */
58 #ifndef SIZE_TYPE
59 #define SIZE_TYPE "long unsigned int"
60 #endif
62 #ifndef WCHAR_TYPE
63 #define WCHAR_TYPE "int"
64 #endif
66 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
67 #define MODIFIED_WCHAR_TYPE \
68 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
70 #ifndef PTRDIFF_TYPE
71 #define PTRDIFF_TYPE "long int"
72 #endif
74 #ifndef WINT_TYPE
75 #define WINT_TYPE "unsigned int"
76 #endif
78 #ifndef INTMAX_TYPE
79 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
80 ? "int" \
81 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
82 ? "long int" \
83 : "long long int"))
84 #endif
86 #ifndef UINTMAX_TYPE
87 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
88 ? "unsigned int" \
89 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
90 ? "long unsigned int" \
91 : "long long unsigned int"))
92 #endif
94 /* The following symbols are subsumed in the c_global_trees array, and
95 listed here individually for documentation purposes.
97 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
99 tree short_integer_type_node;
100 tree long_integer_type_node;
101 tree long_long_integer_type_node;
103 tree short_unsigned_type_node;
104 tree long_unsigned_type_node;
105 tree long_long_unsigned_type_node;
107 tree boolean_type_node;
108 tree boolean_false_node;
109 tree boolean_true_node;
111 tree ptrdiff_type_node;
113 tree unsigned_char_type_node;
114 tree signed_char_type_node;
115 tree wchar_type_node;
116 tree signed_wchar_type_node;
117 tree unsigned_wchar_type_node;
119 tree float_type_node;
120 tree double_type_node;
121 tree long_double_type_node;
123 tree complex_integer_type_node;
124 tree complex_float_type_node;
125 tree complex_double_type_node;
126 tree complex_long_double_type_node;
128 tree intQI_type_node;
129 tree intHI_type_node;
130 tree intSI_type_node;
131 tree intDI_type_node;
132 tree intTI_type_node;
134 tree unsigned_intQI_type_node;
135 tree unsigned_intHI_type_node;
136 tree unsigned_intSI_type_node;
137 tree unsigned_intDI_type_node;
138 tree unsigned_intTI_type_node;
140 tree widest_integer_literal_type_node;
141 tree widest_unsigned_literal_type_node;
143 Nodes for types `void *' and `const void *'.
145 tree ptr_type_node, const_ptr_type_node;
147 Nodes for types `char *' and `const char *'.
149 tree string_type_node, const_string_type_node;
151 Type `char[SOMENUMBER]'.
152 Used when an array of char is needed and the size is irrelevant.
154 tree char_array_type_node;
156 Type `int[SOMENUMBER]' or something like it.
157 Used when an array of int needed and the size is irrelevant.
159 tree int_array_type_node;
161 Type `wchar_t[SOMENUMBER]' or something like it.
162 Used when a wide string literal is created.
164 tree wchar_array_type_node;
166 Type `int ()' -- used for implicit declaration of functions.
168 tree default_function_type;
170 A VOID_TYPE node, packaged in a TREE_LIST.
172 tree void_list_node;
174 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
175 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
176 VAR_DECLS, but C++ does.)
178 tree function_name_decl_node;
179 tree pretty_function_name_decl_node;
180 tree c99_function_name_decl_node;
182 Stack of nested function name VAR_DECLs.
184 tree saved_function_name_decls;
188 tree c_global_trees[CTI_MAX];
190 /* TRUE if a code represents a statement. The front end init
191 langhook should take care of initialization of this array. */
193 bool statement_code_p[MAX_TREE_CODES];
195 /* Nonzero if we can read a PCH file now. */
197 int allow_pch = 1;
199 /* Switches common to the C front ends. */
201 /* Nonzero if prepreprocessing only. */
203 int flag_preprocess_only;
205 /* Nonzero means don't output line number information. */
207 char flag_no_line_commands;
209 /* Nonzero causes -E output not to be done, but directives such as
210 #define that have side effects are still obeyed. */
212 char flag_no_output;
214 /* Nonzero means dump macros in some fashion. */
216 char flag_dump_macros;
218 /* Nonzero means pass #include lines through to the output. */
220 char flag_dump_includes;
222 /* The file name to which we should write a precompiled header, or
223 NULL if no header will be written in this compile. */
225 const char *pch_file;
227 /* Nonzero if an ISO standard was selected. It rejects macros in the
228 user's namespace. */
229 int flag_iso;
231 /* Nonzero if -undef was given. It suppresses target built-in macros
232 and assertions. */
233 int flag_undef;
235 /* Nonzero means don't recognize the non-ANSI builtin functions. */
237 int flag_no_builtin;
239 /* Nonzero means don't recognize the non-ANSI builtin functions.
240 -ansi sets this. */
242 int flag_no_nonansi_builtin;
244 /* Nonzero means give `double' the same size as `float'. */
246 int flag_short_double;
248 /* Nonzero means give `wchar_t' the same size as `short'. */
250 int flag_short_wchar;
252 /* Nonzero means allow Microsoft extensions without warnings or errors. */
253 int flag_ms_extensions;
255 /* Nonzero means don't recognize the keyword `asm'. */
257 int flag_no_asm;
259 /* Nonzero means give string constants the type `const char *', as mandated
260 by the standard. */
262 int flag_const_strings;
264 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
266 int flag_signed_bitfields = 1;
267 int explicit_flag_signed_bitfields;
269 /* Nonzero means warn about pointer casts that can drop a type qualifier
270 from the pointer target type. */
272 int warn_cast_qual;
274 /* Warn about functions which might be candidates for format attributes. */
276 int warn_missing_format_attribute;
278 /* Nonzero means warn about sizeof(function) or addition/subtraction
279 of function pointers. */
281 int warn_pointer_arith;
283 /* Nonzero means warn for any global function def
284 without separate previous prototype decl. */
286 int warn_missing_prototypes;
288 /* Warn if adding () is suggested. */
290 int warn_parentheses;
292 /* Warn if initializer is not completely bracketed. */
294 int warn_missing_braces;
296 /* Warn about comparison of signed and unsigned values.
297 If -1, neither -Wsign-compare nor -Wno-sign-compare has been specified
298 (in which case -Wextra gets to decide). */
300 int warn_sign_compare = -1;
302 /* Nonzero means warn about usage of long long when `-pedantic'. */
304 int warn_long_long = 1;
306 /* Nonzero means warn about deprecated conversion from string constant to
307 `char *'. */
309 int warn_write_strings;
311 /* Nonzero means warn about multiple (redundant) decls for the same single
312 variable or function. */
314 int warn_redundant_decls;
316 /* Warn about testing equality of floating point numbers. */
318 int warn_float_equal;
320 /* Warn about a subscript that has type char. */
322 int warn_char_subscripts;
324 /* Warn if a type conversion is done that might have confusing results. */
326 int warn_conversion;
328 /* Warn about #pragma directives that are not recognized. */
330 int warn_unknown_pragmas; /* Tri state variable. */
332 /* Warn about format/argument anomalies in calls to formatted I/O functions
333 (*printf, *scanf, strftime, strfmon, etc.). */
335 int warn_format;
337 /* Warn about Y2K problems with strftime formats. */
339 int warn_format_y2k;
341 /* Warn about excess arguments to formats. */
343 int warn_format_extra_args;
345 /* Warn about zero-length formats. */
347 int warn_format_zero_length;
349 /* Warn about non-literal format arguments. */
351 int warn_format_nonliteral;
353 /* Warn about possible security problems with calls to format functions. */
355 int warn_format_security;
358 /* C/ObjC language option variables. */
361 /* Nonzero means message about use of implicit function declarations;
362 1 means warning; 2 means error. */
364 int mesg_implicit_function_declaration = -1;
366 /* Nonzero means allow type mismatches in conditional expressions;
367 just make their values `void'. */
369 int flag_cond_mismatch;
371 /* Nonzero means enable C89 Amendment 1 features. */
373 int flag_isoc94;
375 /* Nonzero means use the ISO C99 dialect of C. */
377 int flag_isoc99;
379 /* Nonzero means that we have builtin functions, and main is an int */
381 int flag_hosted = 1;
383 /* Nonzero means add default format_arg attributes for functions not
384 in ISO C. */
386 int flag_noniso_default_format_attributes = 1;
388 /* Nonzero means warn when casting a function call to a type that does
389 not match the return type (e.g. (float)sqrt() or (anything*)malloc()
390 when there is no previous declaration of sqrt or malloc. */
392 int warn_bad_function_cast;
394 /* Warn about traditional constructs whose meanings changed in ANSI C. */
396 int warn_traditional;
398 /* Nonzero means warn for non-prototype function decls
399 or non-prototyped defs without previous prototype. */
401 int warn_strict_prototypes;
403 /* Nonzero means warn for any global function def
404 without separate previous decl. */
406 int warn_missing_declarations;
408 /* Nonzero means warn about declarations of objects not at
409 file-scope level and about *all* declarations of functions (whether
410 or static) not at file-scope level. Note that we exclude
411 implicit function declarations. To get warnings about those, use
412 -Wimplicit. */
414 int warn_nested_externs;
416 /* Warn if main is suspicious. */
418 int warn_main;
420 /* Nonzero means warn about possible violations of sequence point rules. */
422 int warn_sequence_point;
424 /* Nonzero means to warn about compile-time division by zero. */
425 int warn_div_by_zero = 1;
427 /* Nonzero means warn about use of implicit int. */
429 int warn_implicit_int;
431 /* Warn about NULL being passed to argument slots marked as requiring
432 non-NULL. */
434 int warn_nonnull;
437 /* ObjC language option variables. */
440 /* Open and close the file for outputting class declarations, if
441 requested (ObjC). */
443 int flag_gen_declaration;
445 /* Generate code for GNU or NeXT runtime environment. */
447 #ifdef NEXT_OBJC_RUNTIME
448 int flag_next_runtime = 1;
449 #else
450 int flag_next_runtime = 0;
451 #endif
453 /* Tells the compiler that this is a special run. Do not perform any
454 compiling, instead we are to test some platform dependent features
455 and output a C header file with appropriate definitions. */
457 int print_struct_values;
459 /* ???. Undocumented. */
461 const char *constant_string_class_name;
463 /* Warn if multiple methods are seen for the same selector, but with
464 different argument types. Performs the check on the whole selector
465 table at the end of compilation. */
467 int warn_selector;
469 /* Warn if a @selector() is found, and no method with that selector
470 has been previously declared. The check is done on each
471 @selector() as soon as it is found - so it warns about forward
472 declarations. */
474 int warn_undeclared_selector;
476 /* Warn if methods required by a protocol are not implemented in the
477 class adopting it. When turned off, methods inherited to that
478 class are also considered implemented. */
480 int warn_protocol = 1;
483 /* C++ language option variables. */
486 /* Nonzero means don't recognize any extension keywords. */
488 int flag_no_gnu_keywords;
490 /* Nonzero means do emit exported implementations of functions even if
491 they can be inlined. */
493 int flag_implement_inlines = 1;
495 /* Nonzero means do emit exported implementations of templates, instead of
496 multiple static copies in each file that needs a definition. */
498 int flag_external_templates;
500 /* Nonzero means that the decision to emit or not emit the implementation of a
501 template depends on where the template is instantiated, rather than where
502 it is defined. */
504 int flag_alt_external_templates;
506 /* Nonzero means that implicit instantiations will be emitted if needed. */
508 int flag_implicit_templates = 1;
510 /* Nonzero means that implicit instantiations of inline templates will be
511 emitted if needed, even if instantiations of non-inline templates
512 aren't. */
514 int flag_implicit_inline_templates = 1;
516 /* Nonzero means generate separate instantiation control files and
517 juggle them at link time. */
519 int flag_use_repository;
521 /* Nonzero if we want to issue diagnostics that the standard says are not
522 required. */
524 int flag_optional_diags = 1;
526 /* Nonzero means we should attempt to elide constructors when possible. */
528 int flag_elide_constructors = 1;
530 /* Nonzero means that member functions defined in class scope are
531 inline by default. */
533 int flag_default_inline = 1;
535 /* Controls whether compiler generates 'type descriptor' that give
536 run-time type information. */
538 int flag_rtti = 1;
540 /* Nonzero if we want to conserve space in the .o files. We do this
541 by putting uninitialized data and runtime initialized data into
542 .common instead of .data at the expense of not flagging multiple
543 definitions. */
545 int flag_conserve_space;
547 /* Nonzero if we want to obey access control semantics. */
549 int flag_access_control = 1;
551 /* Nonzero if we want to check the return value of new and avoid calling
552 constructors if it is a null pointer. */
554 int flag_check_new;
556 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
557 initialization variables.
558 0: Old rules, set by -fno-for-scope.
559 2: New ISO rules, set by -ffor-scope.
560 1: Try to implement new ISO rules, but with backup compatibility
561 (and warnings). This is the default, for now. */
563 int flag_new_for_scope = 1;
565 /* Nonzero if we want to emit defined symbols with common-like linkage as
566 weak symbols where possible, in order to conform to C++ semantics.
567 Otherwise, emit them as local symbols. */
569 int flag_weak = 1;
571 /* Nonzero to use __cxa_atexit, rather than atexit, to register
572 destructors for local statics and global objects. */
574 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
576 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
578 int flag_vtable_gc;
580 /* Nonzero means make the default pedwarns warnings instead of errors.
581 The value of this flag is ignored if -pedantic is specified. */
583 int flag_permissive;
585 /* Nonzero means to implement standard semantics for exception
586 specifications, calling unexpected if an exception is thrown that
587 doesn't match the specification. Zero means to treat them as
588 assertions and optimize accordingly, but not check them. */
590 int flag_enforce_eh_specs = 1;
592 /* The version of the C++ ABI in use. The following values are
593 allowed:
595 0: The version of the ABI believed most conformant with the
596 C++ ABI specification. This ABI may change as bugs are
597 discovered and fixed. Therefore, 0 will not necessarily
598 indicate the same ABI in different versions of G++.
600 1: The version of the ABI first used in G++ 3.2.
602 Additional positive integers will be assigned as new versions of
603 the ABI become the default version of the ABI. */
605 int flag_abi_version = 1;
607 /* Nonzero means warn about things that will change when compiling
608 with an ABI-compliant compiler. */
610 int warn_abi = 0;
612 /* Nonzero means warn about invalid uses of offsetof. */
614 int warn_invalid_offsetof = 1;
616 /* Nonzero means warn about implicit declarations. */
618 int warn_implicit = 1;
620 /* Nonzero means warn when all ctors or dtors are private, and the class
621 has no friends. */
623 int warn_ctor_dtor_privacy = 0;
625 /* Nonzero means warn in function declared in derived class has the
626 same name as a virtual in the base class, but fails to match the
627 type signature of any virtual function in the base class. */
629 int warn_overloaded_virtual;
631 /* Nonzero means warn when declaring a class that has a non virtual
632 destructor, when it really ought to have a virtual one. */
634 int warn_nonvdtor;
636 /* Nonzero means warn when the compiler will reorder code. */
638 int warn_reorder;
640 /* Nonzero means warn when synthesis behavior differs from Cfront's. */
642 int warn_synth;
644 /* Nonzero means warn when we convert a pointer to member function
645 into a pointer to (void or function). */
647 int warn_pmf2ptr = 1;
649 /* Nonzero means warn about violation of some Effective C++ style rules. */
651 int warn_ecpp;
653 /* Nonzero means warn where overload resolution chooses a promotion from
654 unsigned to signed over a conversion to an unsigned of the same size. */
656 int warn_sign_promo;
658 /* Nonzero means warn when an old-style cast is used. */
660 int warn_old_style_cast;
662 /* Nonzero means warn when non-templatized friend functions are
663 declared within a template */
665 int warn_nontemplate_friend = 1;
667 /* Nonzero means complain about deprecated features. */
669 int warn_deprecated = 1;
671 /* Maximum template instantiation depth. This limit is rather
672 arbitrary, but it exists to limit the time it takes to notice
673 infinite template instantiations. */
675 int max_tinst_depth = 500;
679 /* The elements of `ridpointers' are identifier nodes for the reserved
680 type names and storage classes. It is indexed by a RID_... value. */
681 tree *ridpointers;
683 tree (*make_fname_decl) (tree, int);
685 /* If non-NULL, the address of a language-specific function that takes
686 any action required right before expand_function_end is called. */
687 void (*lang_expand_function_end) (void);
689 /* Nonzero means the expression being parsed will never be evaluated.
690 This is a count, since unevaluated expressions can nest. */
691 int skip_evaluation;
693 /* Information about how a function name is generated. */
694 struct fname_var_t
696 tree *const decl; /* pointer to the VAR_DECL. */
697 const unsigned rid; /* RID number for the identifier. */
698 const int pretty; /* How pretty is it? */
701 /* The three ways of getting then name of the current function. */
703 const struct fname_var_t fname_vars[] =
705 /* C99 compliant __func__, must be first. */
706 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
707 /* GCC __FUNCTION__ compliant. */
708 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
709 /* GCC __PRETTY_FUNCTION__ compliant. */
710 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
711 {NULL, 0, 0},
714 static int constant_fits_type_p (tree, tree);
716 /* Keep a stack of if statements. We record the number of compound
717 statements seen up to the if keyword, as well as the line number
718 and file of the if. If a potentially ambiguous else is seen, that
719 fact is recorded; the warning is issued when we can be sure that
720 the enclosing if statement does not have an else branch. */
721 typedef struct
723 int compstmt_count;
724 location_t locus;
725 int needs_warning;
726 tree if_stmt;
727 } if_elt;
729 static if_elt *if_stack;
731 /* Amount of space in the if statement stack. */
732 static int if_stack_space = 0;
734 /* Stack pointer. */
735 static int if_stack_pointer = 0;
737 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
738 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
739 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
740 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
741 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
742 static tree handle_always_inline_attribute (tree *, tree, tree, int,
743 bool *);
744 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
745 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
746 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
747 static tree handle_transparent_union_attribute (tree *, tree, tree,
748 int, bool *);
749 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
750 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
751 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
752 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
753 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
754 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
755 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
756 static tree handle_visibility_attribute (tree *, tree, tree, int,
757 bool *);
758 static tree handle_tls_model_attribute (tree *, tree, tree, int,
759 bool *);
760 static tree handle_no_instrument_function_attribute (tree *, tree,
761 tree, int, bool *);
762 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
763 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
764 bool *);
765 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
766 static tree handle_deprecated_attribute (tree *, tree, tree, int,
767 bool *);
768 static tree handle_vector_size_attribute (tree *, tree, tree, int,
769 bool *);
770 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
771 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
772 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
773 static tree vector_size_helper (tree, tree);
775 static void check_function_nonnull (tree, tree);
776 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
777 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
778 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
780 /* Table of machine-independent attributes common to all C-like languages. */
781 const struct attribute_spec c_common_attribute_table[] =
783 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
784 { "packed", 0, 0, false, false, false,
785 handle_packed_attribute },
786 { "nocommon", 0, 0, true, false, false,
787 handle_nocommon_attribute },
788 { "common", 0, 0, true, false, false,
789 handle_common_attribute },
790 /* FIXME: logically, noreturn attributes should be listed as
791 "false, true, true" and apply to function types. But implementing this
792 would require all the places in the compiler that use TREE_THIS_VOLATILE
793 on a decl to identify non-returning functions to be located and fixed
794 to check the function type instead. */
795 { "noreturn", 0, 0, true, false, false,
796 handle_noreturn_attribute },
797 { "volatile", 0, 0, true, false, false,
798 handle_noreturn_attribute },
799 { "noinline", 0, 0, true, false, false,
800 handle_noinline_attribute },
801 { "always_inline", 0, 0, true, false, false,
802 handle_always_inline_attribute },
803 { "used", 0, 0, true, false, false,
804 handle_used_attribute },
805 { "unused", 0, 0, false, false, false,
806 handle_unused_attribute },
807 /* The same comments as for noreturn attributes apply to const ones. */
808 { "const", 0, 0, true, false, false,
809 handle_const_attribute },
810 { "transparent_union", 0, 0, false, false, false,
811 handle_transparent_union_attribute },
812 { "constructor", 0, 0, true, false, false,
813 handle_constructor_attribute },
814 { "destructor", 0, 0, true, false, false,
815 handle_destructor_attribute },
816 { "mode", 1, 1, false, true, false,
817 handle_mode_attribute },
818 { "section", 1, 1, true, false, false,
819 handle_section_attribute },
820 { "aligned", 0, 1, false, false, false,
821 handle_aligned_attribute },
822 { "weak", 0, 0, true, false, false,
823 handle_weak_attribute },
824 { "alias", 1, 1, true, false, false,
825 handle_alias_attribute },
826 { "no_instrument_function", 0, 0, true, false, false,
827 handle_no_instrument_function_attribute },
828 { "malloc", 0, 0, true, false, false,
829 handle_malloc_attribute },
830 { "no_stack_limit", 0, 0, true, false, false,
831 handle_no_limit_stack_attribute },
832 { "pure", 0, 0, true, false, false,
833 handle_pure_attribute },
834 { "deprecated", 0, 0, false, false, false,
835 handle_deprecated_attribute },
836 { "vector_size", 1, 1, false, true, false,
837 handle_vector_size_attribute },
838 { "visibility", 1, 1, true, false, false,
839 handle_visibility_attribute },
840 { "tls_model", 1, 1, true, false, false,
841 handle_tls_model_attribute },
842 { "nonnull", 0, -1, false, true, true,
843 handle_nonnull_attribute },
844 { "nothrow", 0, 0, true, false, false,
845 handle_nothrow_attribute },
846 { "may_alias", 0, 0, false, true, false, NULL },
847 { "cleanup", 1, 1, true, false, false,
848 handle_cleanup_attribute },
849 { NULL, 0, 0, false, false, false, NULL }
852 /* Give the specifications for the format attributes, used by C and all
853 descendants. */
855 const struct attribute_spec c_common_format_attribute_table[] =
857 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
858 { "format", 3, 3, false, true, true,
859 handle_format_attribute },
860 { "format_arg", 1, 1, false, true, true,
861 handle_format_arg_attribute },
862 { NULL, 0, 0, false, false, false, NULL }
865 /* Record the start of an if-then, and record the start of it
866 for ambiguous else detection.
868 COND is the condition for the if-then statement.
870 IF_STMT is the statement node that has already been created for
871 this if-then statement. It is created before parsing the
872 condition to keep line number information accurate. */
874 void
875 c_expand_start_cond (tree cond, int compstmt_count, tree if_stmt)
877 /* Make sure there is enough space on the stack. */
878 if (if_stack_space == 0)
880 if_stack_space = 10;
881 if_stack = (if_elt *) xmalloc (10 * sizeof (if_elt));
883 else if (if_stack_space == if_stack_pointer)
885 if_stack_space += 10;
886 if_stack = (if_elt *) xrealloc (if_stack, if_stack_space * sizeof (if_elt));
889 IF_COND (if_stmt) = cond;
890 add_stmt (if_stmt);
892 /* Record this if statement. */
893 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
894 if_stack[if_stack_pointer].locus = input_location;
895 if_stack[if_stack_pointer].needs_warning = 0;
896 if_stack[if_stack_pointer].if_stmt = if_stmt;
897 if_stack_pointer++;
900 /* Called after the then-clause for an if-statement is processed. */
902 void
903 c_finish_then (void)
905 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
906 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
909 /* Record the end of an if-then. Optionally warn if a nested
910 if statement had an ambiguous else clause. */
912 void
913 c_expand_end_cond (void)
915 if_stack_pointer--;
916 if (if_stack[if_stack_pointer].needs_warning)
917 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
918 &if_stack[if_stack_pointer].locus);
919 last_expr_type = NULL_TREE;
922 /* Called between the then-clause and the else-clause
923 of an if-then-else. */
925 void
926 c_expand_start_else (void)
928 /* An ambiguous else warning must be generated for the enclosing if
929 statement, unless we see an else branch for that one, too. */
930 if (warn_parentheses
931 && if_stack_pointer > 1
932 && (if_stack[if_stack_pointer - 1].compstmt_count
933 == if_stack[if_stack_pointer - 2].compstmt_count))
934 if_stack[if_stack_pointer - 2].needs_warning = 1;
936 /* Even if a nested if statement had an else branch, it can't be
937 ambiguous if this one also has an else. So don't warn in that
938 case. Also don't warn for any if statements nested in this else. */
939 if_stack[if_stack_pointer - 1].needs_warning = 0;
940 if_stack[if_stack_pointer - 1].compstmt_count--;
943 /* Called after the else-clause for an if-statement is processed. */
945 void
946 c_finish_else (void)
948 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
949 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
952 /* Begin an if-statement. Returns a newly created IF_STMT if
953 appropriate.
955 Unlike the C++ front-end, we do not call add_stmt here; it is
956 probably safe to do so, but I am not very familiar with this
957 code so I am being extra careful not to change its behavior
958 beyond what is strictly necessary for correctness. */
960 tree
961 c_begin_if_stmt (void)
963 tree r;
964 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
965 return r;
968 /* Begin a while statement. Returns a newly created WHILE_STMT if
969 appropriate.
971 Unlike the C++ front-end, we do not call add_stmt here; it is
972 probably safe to do so, but I am not very familiar with this
973 code so I am being extra careful not to change its behavior
974 beyond what is strictly necessary for correctness. */
976 tree
977 c_begin_while_stmt (void)
979 tree r;
980 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
981 return r;
984 void
985 c_finish_while_stmt_cond (tree cond, tree while_stmt)
987 WHILE_COND (while_stmt) = cond;
990 /* Push current bindings for the function name VAR_DECLS. */
992 void
993 start_fname_decls (void)
995 unsigned ix;
996 tree saved = NULL_TREE;
998 for (ix = 0; fname_vars[ix].decl; ix++)
1000 tree decl = *fname_vars[ix].decl;
1002 if (decl)
1004 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
1005 *fname_vars[ix].decl = NULL_TREE;
1008 if (saved || saved_function_name_decls)
1009 /* Normally they'll have been NULL, so only push if we've got a
1010 stack, or they are non-NULL. */
1011 saved_function_name_decls = tree_cons (saved, NULL_TREE,
1012 saved_function_name_decls);
1015 /* Finish up the current bindings, adding them into the
1016 current function's statement tree. This is done by wrapping the
1017 function's body in a COMPOUND_STMT containing these decls too. This
1018 must be done _before_ finish_stmt_tree is called. If there is no
1019 current function, we must be at file scope and no statements are
1020 involved. Pop the previous bindings. */
1022 void
1023 finish_fname_decls (void)
1025 unsigned ix;
1026 tree body = NULL_TREE;
1027 tree stack = saved_function_name_decls;
1029 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
1030 body = chainon (TREE_VALUE (stack), body);
1032 if (body)
1034 /* They were called into existence, so add to statement tree. Add
1035 the DECL_STMTs inside the outermost scope. */
1036 tree *p = &DECL_SAVED_TREE (current_function_decl);
1037 /* Skip the dummy EXPR_STMT and any EH_SPEC_BLOCK. */
1038 while (TREE_CODE (*p) != COMPOUND_STMT)
1039 p = &TREE_CHAIN (*p);
1040 p = &COMPOUND_BODY (*p);
1041 if (TREE_CODE (*p) == SCOPE_STMT)
1042 p = &TREE_CHAIN (*p);
1044 body = chainon (body, *p);
1045 *p = body;
1048 for (ix = 0; fname_vars[ix].decl; ix++)
1049 *fname_vars[ix].decl = NULL_TREE;
1051 if (stack)
1053 /* We had saved values, restore them. */
1054 tree saved;
1056 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
1058 tree decl = TREE_PURPOSE (saved);
1059 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
1061 *fname_vars[ix].decl = decl;
1063 stack = TREE_CHAIN (stack);
1065 saved_function_name_decls = stack;
1068 /* Return the text name of the current function, suitably prettified
1069 by PRETTY_P. */
1071 const char *
1072 fname_as_string (int pretty_p)
1074 const char *name = NULL;
1076 if (pretty_p)
1077 name = (current_function_decl
1078 ? (*lang_hooks.decl_printable_name) (current_function_decl, 2)
1079 : "top level");
1080 else if (current_function_decl && DECL_NAME (current_function_decl))
1081 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
1082 else
1083 name = "";
1084 return name;
1087 /* Return the VAR_DECL for a const char array naming the current
1088 function. If the VAR_DECL has not yet been created, create it
1089 now. RID indicates how it should be formatted and IDENTIFIER_NODE
1090 ID is its name (unfortunately C and C++ hold the RID values of
1091 keywords in different places, so we can't derive RID from ID in
1092 this language independent code. */
1094 tree
1095 fname_decl (unsigned int rid, tree id)
1097 unsigned ix;
1098 tree decl = NULL_TREE;
1100 for (ix = 0; fname_vars[ix].decl; ix++)
1101 if (fname_vars[ix].rid == rid)
1102 break;
1104 decl = *fname_vars[ix].decl;
1105 if (!decl)
1107 tree saved_last_tree = last_tree;
1108 /* If a tree is built here, it would normally have the lineno of
1109 the current statement. Later this tree will be moved to the
1110 beginning of the function and this line number will be wrong.
1111 To avoid this problem set the lineno to 0 here; that prevents
1112 it from appearing in the RTL. */
1113 int saved_lineno = input_line;
1114 input_line = 0;
1116 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
1117 if (last_tree != saved_last_tree)
1119 /* We created some statement tree for the decl. This belongs
1120 at the start of the function, so remove it now and reinsert
1121 it after the function is complete. */
1122 tree stmts = TREE_CHAIN (saved_last_tree);
1124 TREE_CHAIN (saved_last_tree) = NULL_TREE;
1125 last_tree = saved_last_tree;
1126 saved_function_name_decls = tree_cons (decl, stmts,
1127 saved_function_name_decls);
1129 *fname_vars[ix].decl = decl;
1130 input_line = saved_lineno;
1132 if (!ix && !current_function_decl)
1133 pedwarn_with_decl (decl, "`%s' is not defined outside of function scope");
1135 return decl;
1138 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
1140 tree
1141 fix_string_type (tree value)
1143 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
1144 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
1145 const int nchars_max = flag_isoc99 ? 4095 : 509;
1146 int length = TREE_STRING_LENGTH (value);
1147 int nchars;
1149 /* Compute the number of elements, for the array type. */
1150 nchars = wide_flag ? length / wchar_bytes : length;
1152 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
1153 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
1154 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
1156 /* Create the array type for the string constant.
1157 -Wwrite-strings says make the string constant an array of const char
1158 so that copying it to a non-const pointer will get a warning.
1159 For C++, this is the standard behavior. */
1160 if (flag_const_strings && ! flag_writable_strings)
1162 tree elements
1163 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
1164 1, 0);
1165 TREE_TYPE (value)
1166 = build_array_type (elements,
1167 build_index_type (build_int_2 (nchars - 1, 0)));
1169 else
1170 TREE_TYPE (value)
1171 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
1172 build_index_type (build_int_2 (nchars - 1, 0)));
1174 TREE_CONSTANT (value) = 1;
1175 TREE_READONLY (value) = ! flag_writable_strings;
1176 TREE_STATIC (value) = 1;
1177 return value;
1180 static int is_valid_printf_arglist (tree);
1181 static rtx c_expand_builtin (tree, rtx, enum machine_mode,
1182 enum expand_modifier);
1183 static rtx c_expand_builtin_printf (tree, rtx, enum machine_mode,
1184 enum expand_modifier, int, int);
1185 static rtx c_expand_builtin_fprintf (tree, rtx, enum machine_mode,
1186 enum expand_modifier, int, int);
1188 /* Print a warning if a constant expression had overflow in folding.
1189 Invoke this function on every expression that the language
1190 requires to be a constant expression.
1191 Note the ANSI C standard says it is erroneous for a
1192 constant expression to overflow. */
1194 void
1195 constant_expression_warning (tree value)
1197 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1198 || TREE_CODE (value) == VECTOR_CST
1199 || TREE_CODE (value) == COMPLEX_CST)
1200 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1201 pedwarn ("overflow in constant expression");
1204 /* Print a warning if an expression had overflow in folding.
1205 Invoke this function on every expression that
1206 (1) appears in the source code, and
1207 (2) might be a constant expression that overflowed, and
1208 (3) is not already checked by convert_and_check;
1209 however, do not invoke this function on operands of explicit casts. */
1211 void
1212 overflow_warning (tree value)
1214 if ((TREE_CODE (value) == INTEGER_CST
1215 || (TREE_CODE (value) == COMPLEX_CST
1216 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1217 && TREE_OVERFLOW (value))
1219 TREE_OVERFLOW (value) = 0;
1220 if (skip_evaluation == 0)
1221 warning ("integer overflow in expression");
1223 else if ((TREE_CODE (value) == REAL_CST
1224 || (TREE_CODE (value) == COMPLEX_CST
1225 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1226 && TREE_OVERFLOW (value))
1228 TREE_OVERFLOW (value) = 0;
1229 if (skip_evaluation == 0)
1230 warning ("floating point overflow in expression");
1232 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
1234 TREE_OVERFLOW (value) = 0;
1235 if (skip_evaluation == 0)
1236 warning ("vector overflow in expression");
1240 /* Print a warning if a large constant is truncated to unsigned,
1241 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1242 Invoke this function on every expression that might be implicitly
1243 converted to an unsigned type. */
1245 void
1246 unsigned_conversion_warning (tree result, tree operand)
1248 tree type = TREE_TYPE (result);
1250 if (TREE_CODE (operand) == INTEGER_CST
1251 && TREE_CODE (type) == INTEGER_TYPE
1252 && TREE_UNSIGNED (type)
1253 && skip_evaluation == 0
1254 && !int_fits_type_p (operand, type))
1256 if (!int_fits_type_p (operand, c_common_signed_type (type)))
1257 /* This detects cases like converting -129 or 256 to unsigned char. */
1258 warning ("large integer implicitly truncated to unsigned type");
1259 else if (warn_conversion)
1260 warning ("negative integer implicitly converted to unsigned type");
1264 /* Nonzero if constant C has a value that is permissible
1265 for type TYPE (an INTEGER_TYPE). */
1267 static int
1268 constant_fits_type_p (tree c, tree type)
1270 if (TREE_CODE (c) == INTEGER_CST)
1271 return int_fits_type_p (c, type);
1273 c = convert (type, c);
1274 return !TREE_OVERFLOW (c);
1277 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1278 Invoke this function on every expression that is converted implicitly,
1279 i.e. because of language rules and not because of an explicit cast. */
1281 tree
1282 convert_and_check (tree type, tree expr)
1284 tree t = convert (type, expr);
1285 if (TREE_CODE (t) == INTEGER_CST)
1287 if (TREE_OVERFLOW (t))
1289 TREE_OVERFLOW (t) = 0;
1291 /* Do not diagnose overflow in a constant expression merely
1292 because a conversion overflowed. */
1293 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1295 /* No warning for converting 0x80000000 to int. */
1296 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1297 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1298 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1299 /* If EXPR fits in the unsigned version of TYPE,
1300 don't warn unless pedantic. */
1301 if ((pedantic
1302 || TREE_UNSIGNED (type)
1303 || ! constant_fits_type_p (expr,
1304 c_common_unsigned_type (type)))
1305 && skip_evaluation == 0)
1306 warning ("overflow in implicit constant conversion");
1308 else
1309 unsigned_conversion_warning (t, expr);
1311 return t;
1314 /* A node in a list that describes references to variables (EXPR), which are
1315 either read accesses if WRITER is zero, or write accesses, in which case
1316 WRITER is the parent of EXPR. */
1317 struct tlist
1319 struct tlist *next;
1320 tree expr, writer;
1323 /* Used to implement a cache the results of a call to verify_tree. We only
1324 use this for SAVE_EXPRs. */
1325 struct tlist_cache
1327 struct tlist_cache *next;
1328 struct tlist *cache_before_sp;
1329 struct tlist *cache_after_sp;
1330 tree expr;
1333 /* Obstack to use when allocating tlist structures, and corresponding
1334 firstobj. */
1335 static struct obstack tlist_obstack;
1336 static char *tlist_firstobj = 0;
1338 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1339 warnings. */
1340 static struct tlist *warned_ids;
1341 /* SAVE_EXPRs need special treatment. We process them only once and then
1342 cache the results. */
1343 static struct tlist_cache *save_expr_cache;
1345 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1346 static void merge_tlist (struct tlist **, struct tlist *, int);
1347 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1348 static int warning_candidate_p (tree);
1349 static void warn_for_collisions (struct tlist *);
1350 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1351 static struct tlist *new_tlist (struct tlist *, tree, tree);
1352 static void verify_sequence_points (tree);
1354 /* Create a new struct tlist and fill in its fields. */
1355 static struct tlist *
1356 new_tlist (struct tlist *next, tree t, tree writer)
1358 struct tlist *l;
1359 l = (struct tlist *) obstack_alloc (&tlist_obstack, sizeof *l);
1360 l->next = next;
1361 l->expr = t;
1362 l->writer = writer;
1363 return l;
1366 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1367 is nonnull, we ignore any node we find which has a writer equal to it. */
1369 static void
1370 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1372 while (add)
1374 struct tlist *next = add->next;
1375 if (! copy)
1376 add->next = *to;
1377 if (! exclude_writer || add->writer != exclude_writer)
1378 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1379 add = next;
1383 /* Merge the nodes of ADD into TO. This merging process is done so that for
1384 each variable that already exists in TO, no new node is added; however if
1385 there is a write access recorded in ADD, and an occurrence on TO is only
1386 a read access, then the occurrence in TO will be modified to record the
1387 write. */
1389 static void
1390 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1392 struct tlist **end = to;
1394 while (*end)
1395 end = &(*end)->next;
1397 while (add)
1399 int found = 0;
1400 struct tlist *tmp2;
1401 struct tlist *next = add->next;
1403 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1404 if (tmp2->expr == add->expr)
1406 found = 1;
1407 if (! tmp2->writer)
1408 tmp2->writer = add->writer;
1410 if (! found)
1412 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1413 end = &(*end)->next;
1414 *end = 0;
1416 add = next;
1420 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1421 references in list LIST conflict with it, excluding reads if ONLY writers
1422 is nonzero. */
1424 static void
1425 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1426 int only_writes)
1428 struct tlist *tmp;
1430 /* Avoid duplicate warnings. */
1431 for (tmp = warned_ids; tmp; tmp = tmp->next)
1432 if (tmp->expr == written)
1433 return;
1435 while (list)
1437 if (list->expr == written
1438 && list->writer != writer
1439 && (! only_writes || list->writer))
1441 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1442 warning ("operation on `%s' may be undefined",
1443 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1445 list = list->next;
1449 /* Given a list LIST of references to variables, find whether any of these
1450 can cause conflicts due to missing sequence points. */
1452 static void
1453 warn_for_collisions (struct tlist *list)
1455 struct tlist *tmp;
1457 for (tmp = list; tmp; tmp = tmp->next)
1459 if (tmp->writer)
1460 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1464 /* Return nonzero if X is a tree that can be verified by the sequence point
1465 warnings. */
1466 static int
1467 warning_candidate_p (tree x)
1469 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1472 /* Walk the tree X, and record accesses to variables. If X is written by the
1473 parent tree, WRITER is the parent.
1474 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1475 expression or its only operand forces a sequence point, then everything up
1476 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1477 in PNO_SP.
1478 Once we return, we will have emitted warnings if any subexpression before
1479 such a sequence point could be undefined. On a higher level, however, the
1480 sequence point may not be relevant, and we'll merge the two lists.
1482 Example: (b++, a) + b;
1483 The call that processes the COMPOUND_EXPR will store the increment of B
1484 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1485 processes the PLUS_EXPR will need to merge the two lists so that
1486 eventually, all accesses end up on the same list (and we'll warn about the
1487 unordered subexpressions b++ and b.
1489 A note on merging. If we modify the former example so that our expression
1490 becomes
1491 (b++, b) + a
1492 care must be taken not simply to add all three expressions into the final
1493 PNO_SP list. The function merge_tlist takes care of that by merging the
1494 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1495 way, so that no more than one access to B is recorded. */
1497 static void
1498 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1499 tree writer)
1501 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1502 enum tree_code code;
1503 char class;
1505 /* X may be NULL if it is the operand of an empty statement expression
1506 ({ }). */
1507 if (x == NULL)
1508 return;
1510 restart:
1511 code = TREE_CODE (x);
1512 class = TREE_CODE_CLASS (code);
1514 if (warning_candidate_p (x))
1516 *pno_sp = new_tlist (*pno_sp, x, writer);
1517 return;
1520 switch (code)
1522 case CONSTRUCTOR:
1523 return;
1525 case COMPOUND_EXPR:
1526 case TRUTH_ANDIF_EXPR:
1527 case TRUTH_ORIF_EXPR:
1528 tmp_before = tmp_nosp = tmp_list3 = 0;
1529 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1530 warn_for_collisions (tmp_nosp);
1531 merge_tlist (pbefore_sp, tmp_before, 0);
1532 merge_tlist (pbefore_sp, tmp_nosp, 0);
1533 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1534 merge_tlist (pbefore_sp, tmp_list3, 0);
1535 return;
1537 case COND_EXPR:
1538 tmp_before = tmp_list2 = 0;
1539 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1540 warn_for_collisions (tmp_list2);
1541 merge_tlist (pbefore_sp, tmp_before, 0);
1542 merge_tlist (pbefore_sp, tmp_list2, 1);
1544 tmp_list3 = tmp_nosp = 0;
1545 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1546 warn_for_collisions (tmp_nosp);
1547 merge_tlist (pbefore_sp, tmp_list3, 0);
1549 tmp_list3 = tmp_list2 = 0;
1550 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1551 warn_for_collisions (tmp_list2);
1552 merge_tlist (pbefore_sp, tmp_list3, 0);
1553 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1554 two first, to avoid warning for (a ? b++ : b++). */
1555 merge_tlist (&tmp_nosp, tmp_list2, 0);
1556 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1557 return;
1559 case PREDECREMENT_EXPR:
1560 case PREINCREMENT_EXPR:
1561 case POSTDECREMENT_EXPR:
1562 case POSTINCREMENT_EXPR:
1563 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1564 return;
1566 case MODIFY_EXPR:
1567 tmp_before = tmp_nosp = tmp_list3 = 0;
1568 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1569 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1570 /* Expressions inside the LHS are not ordered wrt. the sequence points
1571 in the RHS. Example:
1572 *a = (a++, 2)
1573 Despite the fact that the modification of "a" is in the before_sp
1574 list (tmp_before), it conflicts with the use of "a" in the LHS.
1575 We can handle this by adding the contents of tmp_list3
1576 to those of tmp_before, and redoing the collision warnings for that
1577 list. */
1578 add_tlist (&tmp_before, tmp_list3, x, 1);
1579 warn_for_collisions (tmp_before);
1580 /* Exclude the LHS itself here; we first have to merge it into the
1581 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1582 didn't exclude the LHS, we'd get it twice, once as a read and once
1583 as a write. */
1584 add_tlist (pno_sp, tmp_list3, x, 0);
1585 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1587 merge_tlist (pbefore_sp, tmp_before, 0);
1588 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1589 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1590 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1591 return;
1593 case CALL_EXPR:
1594 /* We need to warn about conflicts among arguments and conflicts between
1595 args and the function address. Side effects of the function address,
1596 however, are not ordered by the sequence point of the call. */
1597 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1598 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1599 if (TREE_OPERAND (x, 1))
1600 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1601 merge_tlist (&tmp_list3, tmp_list2, 0);
1602 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1603 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1604 warn_for_collisions (tmp_before);
1605 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1606 return;
1608 case TREE_LIST:
1609 /* Scan all the list, e.g. indices of multi dimensional array. */
1610 while (x)
1612 tmp_before = tmp_nosp = 0;
1613 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1614 merge_tlist (&tmp_nosp, tmp_before, 0);
1615 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1616 x = TREE_CHAIN (x);
1618 return;
1620 case SAVE_EXPR:
1622 struct tlist_cache *t;
1623 for (t = save_expr_cache; t; t = t->next)
1624 if (t->expr == x)
1625 break;
1627 if (! t)
1629 t = (struct tlist_cache *) obstack_alloc (&tlist_obstack,
1630 sizeof *t);
1631 t->next = save_expr_cache;
1632 t->expr = x;
1633 save_expr_cache = t;
1635 tmp_before = tmp_nosp = 0;
1636 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1637 warn_for_collisions (tmp_nosp);
1639 tmp_list3 = 0;
1640 while (tmp_nosp)
1642 struct tlist *t = tmp_nosp;
1643 tmp_nosp = t->next;
1644 merge_tlist (&tmp_list3, t, 0);
1646 t->cache_before_sp = tmp_before;
1647 t->cache_after_sp = tmp_list3;
1649 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1650 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1651 return;
1653 default:
1654 break;
1657 if (class == '1')
1659 if (first_rtl_op (code) == 0)
1660 return;
1661 x = TREE_OPERAND (x, 0);
1662 writer = 0;
1663 goto restart;
1666 switch (class)
1668 case 'r':
1669 case '<':
1670 case '2':
1671 case 'b':
1672 case 'e':
1673 case 's':
1674 case 'x':
1676 int lp;
1677 int max = first_rtl_op (TREE_CODE (x));
1678 for (lp = 0; lp < max; lp++)
1680 tmp_before = tmp_nosp = 0;
1681 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1682 merge_tlist (&tmp_nosp, tmp_before, 0);
1683 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1685 break;
1690 /* Try to warn for undefined behavior in EXPR due to missing sequence
1691 points. */
1693 static void
1694 verify_sequence_points (tree expr)
1696 struct tlist *before_sp = 0, *after_sp = 0;
1698 warned_ids = 0;
1699 save_expr_cache = 0;
1700 if (tlist_firstobj == 0)
1702 gcc_obstack_init (&tlist_obstack);
1703 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1706 verify_tree (expr, &before_sp, &after_sp, 0);
1707 warn_for_collisions (after_sp);
1708 obstack_free (&tlist_obstack, tlist_firstobj);
1711 tree
1712 c_expand_expr_stmt (tree expr)
1714 /* Do default conversion if safe and possibly important,
1715 in case within ({...}). */
1716 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1717 && (flag_isoc99 || lvalue_p (expr)))
1718 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1719 expr = default_conversion (expr);
1721 if (warn_sequence_point)
1722 verify_sequence_points (expr);
1724 if (TREE_TYPE (expr) != error_mark_node
1725 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1726 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1727 error ("expression statement has incomplete type");
1729 last_expr_type = TREE_TYPE (expr);
1730 return add_stmt (build_stmt (EXPR_STMT, expr));
1733 /* Validate the expression after `case' and apply default promotions. */
1735 tree
1736 check_case_value (tree value)
1738 if (value == NULL_TREE)
1739 return value;
1741 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1742 STRIP_TYPE_NOPS (value);
1743 /* In C++, the following is allowed:
1745 const int i = 3;
1746 switch (...) { case i: ... }
1748 So, we try to reduce the VALUE to a constant that way. */
1749 if (c_dialect_cxx ())
1751 value = decl_constant_value (value);
1752 STRIP_TYPE_NOPS (value);
1753 value = fold (value);
1756 if (TREE_CODE (value) != INTEGER_CST
1757 && value != error_mark_node)
1759 error ("case label does not reduce to an integer constant");
1760 value = error_mark_node;
1762 else
1763 /* Promote char or short to int. */
1764 value = default_conversion (value);
1766 constant_expression_warning (value);
1768 return value;
1771 /* Return an integer type with BITS bits of precision,
1772 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1774 tree
1775 c_common_type_for_size (unsigned int bits, int unsignedp)
1777 if (bits == TYPE_PRECISION (integer_type_node))
1778 return unsignedp ? unsigned_type_node : integer_type_node;
1780 if (bits == TYPE_PRECISION (signed_char_type_node))
1781 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1783 if (bits == TYPE_PRECISION (short_integer_type_node))
1784 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1786 if (bits == TYPE_PRECISION (long_integer_type_node))
1787 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1789 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1790 return (unsignedp ? long_long_unsigned_type_node
1791 : long_long_integer_type_node);
1793 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1794 return (unsignedp ? widest_unsigned_literal_type_node
1795 : widest_integer_literal_type_node);
1797 if (bits <= TYPE_PRECISION (intQI_type_node))
1798 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1800 if (bits <= TYPE_PRECISION (intHI_type_node))
1801 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1803 if (bits <= TYPE_PRECISION (intSI_type_node))
1804 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1806 if (bits <= TYPE_PRECISION (intDI_type_node))
1807 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1809 return 0;
1812 /* Return a data type that has machine mode MODE.
1813 If the mode is an integer,
1814 then UNSIGNEDP selects between signed and unsigned types. */
1816 tree
1817 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1819 if (mode == TYPE_MODE (integer_type_node))
1820 return unsignedp ? unsigned_type_node : integer_type_node;
1822 if (mode == TYPE_MODE (signed_char_type_node))
1823 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1825 if (mode == TYPE_MODE (short_integer_type_node))
1826 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1828 if (mode == TYPE_MODE (long_integer_type_node))
1829 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1831 if (mode == TYPE_MODE (long_long_integer_type_node))
1832 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1834 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1835 return unsignedp ? widest_unsigned_literal_type_node
1836 : widest_integer_literal_type_node;
1838 if (mode == QImode)
1839 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1841 if (mode == HImode)
1842 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1844 if (mode == SImode)
1845 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1847 if (mode == DImode)
1848 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1850 #if HOST_BITS_PER_WIDE_INT >= 64
1851 if (mode == TYPE_MODE (intTI_type_node))
1852 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1853 #endif
1855 if (mode == TYPE_MODE (float_type_node))
1856 return float_type_node;
1858 if (mode == TYPE_MODE (double_type_node))
1859 return double_type_node;
1861 if (mode == TYPE_MODE (long_double_type_node))
1862 return long_double_type_node;
1864 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1865 return build_pointer_type (char_type_node);
1867 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1868 return build_pointer_type (integer_type_node);
1870 switch (mode)
1872 case V16QImode:
1873 return unsignedp ? unsigned_V16QI_type_node : V16QI_type_node;
1874 case V8HImode:
1875 return unsignedp ? unsigned_V8HI_type_node : V8HI_type_node;
1876 case V4SImode:
1877 return unsignedp ? unsigned_V4SI_type_node : V4SI_type_node;
1878 case V2DImode:
1879 return unsignedp ? unsigned_V2DI_type_node : V2DI_type_node;
1880 case V2SImode:
1881 return unsignedp ? unsigned_V2SI_type_node : V2SI_type_node;
1882 case V2HImode:
1883 return unsignedp ? unsigned_V2HI_type_node : V2HI_type_node;
1884 case V4HImode:
1885 return unsignedp ? unsigned_V4HI_type_node : V4HI_type_node;
1886 case V8QImode:
1887 return unsignedp ? unsigned_V8QI_type_node : V8QI_type_node;
1888 case V1DImode:
1889 return unsignedp ? unsigned_V1DI_type_node : V1DI_type_node;
1890 case V16SFmode:
1891 return V16SF_type_node;
1892 case V4SFmode:
1893 return V4SF_type_node;
1894 case V2SFmode:
1895 return V2SF_type_node;
1896 case V2DFmode:
1897 return V2DF_type_node;
1898 default:
1899 break;
1902 return 0;
1905 /* Return an unsigned type the same as TYPE in other respects. */
1906 tree
1907 c_common_unsigned_type (tree type)
1909 tree type1 = TYPE_MAIN_VARIANT (type);
1910 if (type1 == signed_char_type_node || type1 == char_type_node)
1911 return unsigned_char_type_node;
1912 if (type1 == integer_type_node)
1913 return unsigned_type_node;
1914 if (type1 == short_integer_type_node)
1915 return short_unsigned_type_node;
1916 if (type1 == long_integer_type_node)
1917 return long_unsigned_type_node;
1918 if (type1 == long_long_integer_type_node)
1919 return long_long_unsigned_type_node;
1920 if (type1 == widest_integer_literal_type_node)
1921 return widest_unsigned_literal_type_node;
1922 #if HOST_BITS_PER_WIDE_INT >= 64
1923 if (type1 == intTI_type_node)
1924 return unsigned_intTI_type_node;
1925 #endif
1926 if (type1 == intDI_type_node)
1927 return unsigned_intDI_type_node;
1928 if (type1 == intSI_type_node)
1929 return unsigned_intSI_type_node;
1930 if (type1 == intHI_type_node)
1931 return unsigned_intHI_type_node;
1932 if (type1 == intQI_type_node)
1933 return unsigned_intQI_type_node;
1935 return c_common_signed_or_unsigned_type (1, type);
1938 /* Return a signed type the same as TYPE in other respects. */
1940 tree
1941 c_common_signed_type (tree type)
1943 tree type1 = TYPE_MAIN_VARIANT (type);
1944 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1945 return signed_char_type_node;
1946 if (type1 == unsigned_type_node)
1947 return integer_type_node;
1948 if (type1 == short_unsigned_type_node)
1949 return short_integer_type_node;
1950 if (type1 == long_unsigned_type_node)
1951 return long_integer_type_node;
1952 if (type1 == long_long_unsigned_type_node)
1953 return long_long_integer_type_node;
1954 if (type1 == widest_unsigned_literal_type_node)
1955 return widest_integer_literal_type_node;
1956 #if HOST_BITS_PER_WIDE_INT >= 64
1957 if (type1 == unsigned_intTI_type_node)
1958 return intTI_type_node;
1959 #endif
1960 if (type1 == unsigned_intDI_type_node)
1961 return intDI_type_node;
1962 if (type1 == unsigned_intSI_type_node)
1963 return intSI_type_node;
1964 if (type1 == unsigned_intHI_type_node)
1965 return intHI_type_node;
1966 if (type1 == unsigned_intQI_type_node)
1967 return intQI_type_node;
1969 return c_common_signed_or_unsigned_type (0, type);
1972 /* Return a type the same as TYPE except unsigned or
1973 signed according to UNSIGNEDP. */
1975 tree
1976 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1978 if (! INTEGRAL_TYPE_P (type)
1979 || TREE_UNSIGNED (type) == unsignedp)
1980 return type;
1982 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
1983 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1984 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1985 return unsignedp ? unsigned_type_node : integer_type_node;
1986 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
1987 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1988 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
1989 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1990 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
1991 return (unsignedp ? long_long_unsigned_type_node
1992 : long_long_integer_type_node);
1993 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
1994 return (unsignedp ? widest_unsigned_literal_type_node
1995 : widest_integer_literal_type_node);
1997 #if HOST_BITS_PER_WIDE_INT >= 64
1998 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
1999 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2000 #endif
2001 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
2002 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2003 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
2004 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2005 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
2006 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2007 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
2008 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2010 return type;
2013 /* Return the minimum number of bits needed to represent VALUE in a
2014 signed or unsigned type, UNSIGNEDP says which. */
2016 unsigned int
2017 min_precision (tree value, int unsignedp)
2019 int log;
2021 /* If the value is negative, compute its negative minus 1. The latter
2022 adjustment is because the absolute value of the largest negative value
2023 is one larger than the largest positive value. This is equivalent to
2024 a bit-wise negation, so use that operation instead. */
2026 if (tree_int_cst_sgn (value) < 0)
2027 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2029 /* Return the number of bits needed, taking into account the fact
2030 that we need one more bit for a signed than unsigned type. */
2032 if (integer_zerop (value))
2033 log = 0;
2034 else
2035 log = tree_floor_log2 (value);
2037 return log + 1 + ! unsignedp;
2040 /* Print an error message for invalid operands to arith operation
2041 CODE. NOP_EXPR is used as a special case (see
2042 c_common_truthvalue_conversion). */
2044 void
2045 binary_op_error (enum tree_code code)
2047 const char *opname;
2049 switch (code)
2051 case NOP_EXPR:
2052 error ("invalid truth-value expression");
2053 return;
2055 case PLUS_EXPR:
2056 opname = "+"; break;
2057 case MINUS_EXPR:
2058 opname = "-"; break;
2059 case MULT_EXPR:
2060 opname = "*"; break;
2061 case MAX_EXPR:
2062 opname = "max"; break;
2063 case MIN_EXPR:
2064 opname = "min"; break;
2065 case EQ_EXPR:
2066 opname = "=="; break;
2067 case NE_EXPR:
2068 opname = "!="; break;
2069 case LE_EXPR:
2070 opname = "<="; break;
2071 case GE_EXPR:
2072 opname = ">="; break;
2073 case LT_EXPR:
2074 opname = "<"; break;
2075 case GT_EXPR:
2076 opname = ">"; break;
2077 case LSHIFT_EXPR:
2078 opname = "<<"; break;
2079 case RSHIFT_EXPR:
2080 opname = ">>"; break;
2081 case TRUNC_MOD_EXPR:
2082 case FLOOR_MOD_EXPR:
2083 opname = "%"; break;
2084 case TRUNC_DIV_EXPR:
2085 case FLOOR_DIV_EXPR:
2086 opname = "/"; break;
2087 case BIT_AND_EXPR:
2088 opname = "&"; break;
2089 case BIT_IOR_EXPR:
2090 opname = "|"; break;
2091 case TRUTH_ANDIF_EXPR:
2092 opname = "&&"; break;
2093 case TRUTH_ORIF_EXPR:
2094 opname = "||"; break;
2095 case BIT_XOR_EXPR:
2096 opname = "^"; break;
2097 case LROTATE_EXPR:
2098 case RROTATE_EXPR:
2099 opname = "rotate"; break;
2100 default:
2101 opname = "unknown"; break;
2103 error ("invalid operands to binary %s", opname);
2106 /* Subroutine of build_binary_op, used for comparison operations.
2107 See if the operands have both been converted from subword integer types
2108 and, if so, perhaps change them both back to their original type.
2109 This function is also responsible for converting the two operands
2110 to the proper common type for comparison.
2112 The arguments of this function are all pointers to local variables
2113 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2114 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2116 If this function returns nonzero, it means that the comparison has
2117 a constant value. What this function returns is an expression for
2118 that value. */
2120 tree
2121 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
2122 enum tree_code *rescode_ptr)
2124 tree type;
2125 tree op0 = *op0_ptr;
2126 tree op1 = *op1_ptr;
2127 int unsignedp0, unsignedp1;
2128 int real1, real2;
2129 tree primop0, primop1;
2130 enum tree_code code = *rescode_ptr;
2132 /* Throw away any conversions to wider types
2133 already present in the operands. */
2135 primop0 = get_narrower (op0, &unsignedp0);
2136 primop1 = get_narrower (op1, &unsignedp1);
2138 /* Handle the case that OP0 does not *contain* a conversion
2139 but it *requires* conversion to FINAL_TYPE. */
2141 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2142 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2143 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2144 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2146 /* If one of the operands must be floated, we cannot optimize. */
2147 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2148 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2150 /* If first arg is constant, swap the args (changing operation
2151 so value is preserved), for canonicalization. Don't do this if
2152 the second arg is 0. */
2154 if (TREE_CONSTANT (primop0)
2155 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2157 tree tem = primop0;
2158 int temi = unsignedp0;
2159 primop0 = primop1;
2160 primop1 = tem;
2161 tem = op0;
2162 op0 = op1;
2163 op1 = tem;
2164 *op0_ptr = op0;
2165 *op1_ptr = op1;
2166 unsignedp0 = unsignedp1;
2167 unsignedp1 = temi;
2168 temi = real1;
2169 real1 = real2;
2170 real2 = temi;
2172 switch (code)
2174 case LT_EXPR:
2175 code = GT_EXPR;
2176 break;
2177 case GT_EXPR:
2178 code = LT_EXPR;
2179 break;
2180 case LE_EXPR:
2181 code = GE_EXPR;
2182 break;
2183 case GE_EXPR:
2184 code = LE_EXPR;
2185 break;
2186 default:
2187 break;
2189 *rescode_ptr = code;
2192 /* If comparing an integer against a constant more bits wide,
2193 maybe we can deduce a value of 1 or 0 independent of the data.
2194 Or else truncate the constant now
2195 rather than extend the variable at run time.
2197 This is only interesting if the constant is the wider arg.
2198 Also, it is not safe if the constant is unsigned and the
2199 variable arg is signed, since in this case the variable
2200 would be sign-extended and then regarded as unsigned.
2201 Our technique fails in this case because the lowest/highest
2202 possible unsigned results don't follow naturally from the
2203 lowest/highest possible values of the variable operand.
2204 For just EQ_EXPR and NE_EXPR there is another technique that
2205 could be used: see if the constant can be faithfully represented
2206 in the other operand's type, by truncating it and reextending it
2207 and see if that preserves the constant's value. */
2209 if (!real1 && !real2
2210 && TREE_CODE (primop1) == INTEGER_CST
2211 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2213 int min_gt, max_gt, min_lt, max_lt;
2214 tree maxval, minval;
2215 /* 1 if comparison is nominally unsigned. */
2216 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2217 tree val;
2219 type = c_common_signed_or_unsigned_type (unsignedp0,
2220 TREE_TYPE (primop0));
2222 /* If TYPE is an enumeration, then we need to get its min/max
2223 values from it's underlying integral type, not the enumerated
2224 type itself. */
2225 if (TREE_CODE (type) == ENUMERAL_TYPE)
2226 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
2228 maxval = TYPE_MAX_VALUE (type);
2229 minval = TYPE_MIN_VALUE (type);
2231 if (unsignedp && !unsignedp0)
2232 *restype_ptr = c_common_signed_type (*restype_ptr);
2234 if (TREE_TYPE (primop1) != *restype_ptr)
2235 primop1 = convert (*restype_ptr, primop1);
2236 if (type != *restype_ptr)
2238 minval = convert (*restype_ptr, minval);
2239 maxval = convert (*restype_ptr, maxval);
2242 if (unsignedp && unsignedp0)
2244 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2245 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2246 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2247 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2249 else
2251 min_gt = INT_CST_LT (primop1, minval);
2252 max_gt = INT_CST_LT (primop1, maxval);
2253 min_lt = INT_CST_LT (minval, primop1);
2254 max_lt = INT_CST_LT (maxval, primop1);
2257 val = 0;
2258 /* This used to be a switch, but Genix compiler can't handle that. */
2259 if (code == NE_EXPR)
2261 if (max_lt || min_gt)
2262 val = boolean_true_node;
2264 else if (code == EQ_EXPR)
2266 if (max_lt || min_gt)
2267 val = boolean_false_node;
2269 else if (code == LT_EXPR)
2271 if (max_lt)
2272 val = boolean_true_node;
2273 if (!min_lt)
2274 val = boolean_false_node;
2276 else if (code == GT_EXPR)
2278 if (min_gt)
2279 val = boolean_true_node;
2280 if (!max_gt)
2281 val = boolean_false_node;
2283 else if (code == LE_EXPR)
2285 if (!max_gt)
2286 val = boolean_true_node;
2287 if (min_gt)
2288 val = boolean_false_node;
2290 else if (code == GE_EXPR)
2292 if (!min_lt)
2293 val = boolean_true_node;
2294 if (max_lt)
2295 val = boolean_false_node;
2298 /* If primop0 was sign-extended and unsigned comparison specd,
2299 we did a signed comparison above using the signed type bounds.
2300 But the comparison we output must be unsigned.
2302 Also, for inequalities, VAL is no good; but if the signed
2303 comparison had *any* fixed result, it follows that the
2304 unsigned comparison just tests the sign in reverse
2305 (positive values are LE, negative ones GE).
2306 So we can generate an unsigned comparison
2307 against an extreme value of the signed type. */
2309 if (unsignedp && !unsignedp0)
2311 if (val != 0)
2312 switch (code)
2314 case LT_EXPR:
2315 case GE_EXPR:
2316 primop1 = TYPE_MIN_VALUE (type);
2317 val = 0;
2318 break;
2320 case LE_EXPR:
2321 case GT_EXPR:
2322 primop1 = TYPE_MAX_VALUE (type);
2323 val = 0;
2324 break;
2326 default:
2327 break;
2329 type = c_common_unsigned_type (type);
2332 if (TREE_CODE (primop0) != INTEGER_CST)
2334 if (val == boolean_false_node)
2335 warning ("comparison is always false due to limited range of data type");
2336 if (val == boolean_true_node)
2337 warning ("comparison is always true due to limited range of data type");
2340 if (val != 0)
2342 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2343 if (TREE_SIDE_EFFECTS (primop0))
2344 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2345 return val;
2348 /* Value is not predetermined, but do the comparison
2349 in the type of the operand that is not constant.
2350 TYPE is already properly set. */
2352 else if (real1 && real2
2353 && (TYPE_PRECISION (TREE_TYPE (primop0))
2354 == TYPE_PRECISION (TREE_TYPE (primop1))))
2355 type = TREE_TYPE (primop0);
2357 /* If args' natural types are both narrower than nominal type
2358 and both extend in the same manner, compare them
2359 in the type of the wider arg.
2360 Otherwise must actually extend both to the nominal
2361 common type lest different ways of extending
2362 alter the result.
2363 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2365 else if (unsignedp0 == unsignedp1 && real1 == real2
2366 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2367 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2369 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2370 type = c_common_signed_or_unsigned_type (unsignedp0
2371 || TREE_UNSIGNED (*restype_ptr),
2372 type);
2373 /* Make sure shorter operand is extended the right way
2374 to match the longer operand. */
2375 primop0
2376 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2377 TREE_TYPE (primop0)),
2378 primop0);
2379 primop1
2380 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2381 TREE_TYPE (primop1)),
2382 primop1);
2384 else
2386 /* Here we must do the comparison on the nominal type
2387 using the args exactly as we received them. */
2388 type = *restype_ptr;
2389 primop0 = op0;
2390 primop1 = op1;
2392 if (!real1 && !real2 && integer_zerop (primop1)
2393 && TREE_UNSIGNED (*restype_ptr))
2395 tree value = 0;
2396 switch (code)
2398 case GE_EXPR:
2399 /* All unsigned values are >= 0, so we warn if extra warnings
2400 are requested. However, if OP0 is a constant that is
2401 >= 0, the signedness of the comparison isn't an issue,
2402 so suppress the warning. */
2403 if (extra_warnings && !in_system_header
2404 && ! (TREE_CODE (primop0) == INTEGER_CST
2405 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2406 primop0))))
2407 warning ("comparison of unsigned expression >= 0 is always true");
2408 value = boolean_true_node;
2409 break;
2411 case LT_EXPR:
2412 if (extra_warnings && !in_system_header
2413 && ! (TREE_CODE (primop0) == INTEGER_CST
2414 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2415 primop0))))
2416 warning ("comparison of unsigned expression < 0 is always false");
2417 value = boolean_false_node;
2418 break;
2420 default:
2421 break;
2424 if (value != 0)
2426 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2427 if (TREE_SIDE_EFFECTS (primop0))
2428 return build (COMPOUND_EXPR, TREE_TYPE (value),
2429 primop0, value);
2430 return value;
2435 *op0_ptr = convert (type, primop0);
2436 *op1_ptr = convert (type, primop1);
2438 *restype_ptr = boolean_type_node;
2440 return 0;
2443 /* Return a tree for the sum or difference (RESULTCODE says which)
2444 of pointer PTROP and integer INTOP. */
2446 tree
2447 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2449 tree size_exp;
2451 tree result;
2452 tree folded;
2454 /* The result is a pointer of the same type that is being added. */
2456 tree result_type = TREE_TYPE (ptrop);
2458 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2460 if (pedantic || warn_pointer_arith)
2461 pedwarn ("pointer of type `void *' used in arithmetic");
2462 size_exp = integer_one_node;
2464 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2466 if (pedantic || warn_pointer_arith)
2467 pedwarn ("pointer to a function used in arithmetic");
2468 size_exp = integer_one_node;
2470 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2472 if (pedantic || warn_pointer_arith)
2473 pedwarn ("pointer to member function used in arithmetic");
2474 size_exp = integer_one_node;
2476 else if (TREE_CODE (TREE_TYPE (result_type)) == OFFSET_TYPE)
2478 if (pedantic || warn_pointer_arith)
2479 pedwarn ("pointer to a member used in arithmetic");
2480 size_exp = integer_one_node;
2482 else
2483 size_exp = size_in_bytes (TREE_TYPE (result_type));
2485 /* If what we are about to multiply by the size of the elements
2486 contains a constant term, apply distributive law
2487 and multiply that constant term separately.
2488 This helps produce common subexpressions. */
2490 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2491 && ! TREE_CONSTANT (intop)
2492 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2493 && TREE_CONSTANT (size_exp)
2494 /* If the constant comes from pointer subtraction,
2495 skip this optimization--it would cause an error. */
2496 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2497 /* If the constant is unsigned, and smaller than the pointer size,
2498 then we must skip this optimization. This is because it could cause
2499 an overflow error if the constant is negative but INTOP is not. */
2500 && (! TREE_UNSIGNED (TREE_TYPE (intop))
2501 || (TYPE_PRECISION (TREE_TYPE (intop))
2502 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2504 enum tree_code subcode = resultcode;
2505 tree int_type = TREE_TYPE (intop);
2506 if (TREE_CODE (intop) == MINUS_EXPR)
2507 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2508 /* Convert both subexpression types to the type of intop,
2509 because weird cases involving pointer arithmetic
2510 can result in a sum or difference with different type args. */
2511 ptrop = build_binary_op (subcode, ptrop,
2512 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2513 intop = convert (int_type, TREE_OPERAND (intop, 0));
2516 /* Convert the integer argument to a type the same size as sizetype
2517 so the multiply won't overflow spuriously. */
2519 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2520 || TREE_UNSIGNED (TREE_TYPE (intop)) != TREE_UNSIGNED (sizetype))
2521 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2522 TREE_UNSIGNED (sizetype)), intop);
2524 /* Replace the integer argument with a suitable product by the object size.
2525 Do this multiplication as signed, then convert to the appropriate
2526 pointer type (actually unsigned integral). */
2528 intop = convert (result_type,
2529 build_binary_op (MULT_EXPR, intop,
2530 convert (TREE_TYPE (intop), size_exp), 1));
2532 /* Create the sum or difference. */
2534 result = build (resultcode, result_type, ptrop, intop);
2536 folded = fold (result);
2537 if (folded == result)
2538 TREE_CONSTANT (folded) = TREE_CONSTANT (ptrop) & TREE_CONSTANT (intop);
2539 return folded;
2542 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2543 or validate its data type for an `if' or `while' statement or ?..: exp.
2545 This preparation consists of taking the ordinary
2546 representation of an expression expr and producing a valid tree
2547 boolean expression describing whether expr is nonzero. We could
2548 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
2549 but we optimize comparisons, &&, ||, and !.
2551 The resulting type should always be `boolean_type_node'. */
2553 tree
2554 c_common_truthvalue_conversion (tree expr)
2556 if (TREE_CODE (expr) == ERROR_MARK)
2557 return expr;
2559 #if 0 /* This appears to be wrong for C++. */
2560 /* These really should return error_mark_node after 2.4 is stable.
2561 But not all callers handle ERROR_MARK properly. */
2562 switch (TREE_CODE (TREE_TYPE (expr)))
2564 case RECORD_TYPE:
2565 error ("struct type value used where scalar is required");
2566 return boolean_false_node;
2568 case UNION_TYPE:
2569 error ("union type value used where scalar is required");
2570 return boolean_false_node;
2572 case ARRAY_TYPE:
2573 error ("array type value used where scalar is required");
2574 return boolean_false_node;
2576 default:
2577 break;
2579 #endif /* 0 */
2581 switch (TREE_CODE (expr))
2583 case EQ_EXPR:
2584 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2585 case TRUTH_ANDIF_EXPR:
2586 case TRUTH_ORIF_EXPR:
2587 case TRUTH_AND_EXPR:
2588 case TRUTH_OR_EXPR:
2589 case TRUTH_XOR_EXPR:
2590 case TRUTH_NOT_EXPR:
2591 TREE_TYPE (expr) = boolean_type_node;
2592 return expr;
2594 case ERROR_MARK:
2595 return expr;
2597 case INTEGER_CST:
2598 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
2600 case REAL_CST:
2601 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
2603 case ADDR_EXPR:
2604 /* If we are taking the address of an external decl, it might be zero
2605 if it is weak, so we cannot optimize. */
2606 if (DECL_P (TREE_OPERAND (expr, 0))
2607 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2608 break;
2610 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2611 return build (COMPOUND_EXPR, boolean_type_node,
2612 TREE_OPERAND (expr, 0), boolean_true_node);
2613 else
2614 return boolean_true_node;
2616 case COMPLEX_EXPR:
2617 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2618 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2619 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)),
2620 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2623 case NEGATE_EXPR:
2624 case ABS_EXPR:
2625 case FLOAT_EXPR:
2626 case FFS_EXPR:
2627 case POPCOUNT_EXPR:
2628 /* These don't change whether an object is nonzero or zero. */
2629 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2631 case LROTATE_EXPR:
2632 case RROTATE_EXPR:
2633 /* These don't change whether an object is zero or nonzero, but
2634 we can't ignore them if their second arg has side-effects. */
2635 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2636 return build (COMPOUND_EXPR, boolean_type_node, TREE_OPERAND (expr, 1),
2637 c_common_truthvalue_conversion (TREE_OPERAND (expr, 0)));
2638 else
2639 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2641 case COND_EXPR:
2642 /* Distribute the conversion into the arms of a COND_EXPR. */
2643 return fold (build (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
2644 c_common_truthvalue_conversion (TREE_OPERAND (expr, 1)),
2645 c_common_truthvalue_conversion (TREE_OPERAND (expr, 2))));
2647 case CONVERT_EXPR:
2648 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2649 since that affects how `default_conversion' will behave. */
2650 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2651 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2652 break;
2653 /* fall through... */
2654 case NOP_EXPR:
2655 /* If this is widening the argument, we can ignore it. */
2656 if (TYPE_PRECISION (TREE_TYPE (expr))
2657 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2658 return c_common_truthvalue_conversion (TREE_OPERAND (expr, 0));
2659 break;
2661 case MINUS_EXPR:
2662 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2663 aren't guaranteed to the be same for modes that can represent
2664 infinity, since if x and y are both +infinity, or both
2665 -infinity, then x - y is not a number.
2667 Note that this transformation is safe when x or y is NaN.
2668 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2669 be false. */
2670 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2671 break;
2672 /* fall through... */
2673 case BIT_XOR_EXPR:
2674 /* This and MINUS_EXPR can be changed into a comparison of the
2675 two objects. */
2676 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2677 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2678 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2679 TREE_OPERAND (expr, 1), 1);
2680 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2681 fold (build1 (NOP_EXPR,
2682 TREE_TYPE (TREE_OPERAND (expr, 0)),
2683 TREE_OPERAND (expr, 1))), 1);
2685 case BIT_AND_EXPR:
2686 if (integer_onep (TREE_OPERAND (expr, 1))
2687 && TREE_TYPE (expr) != boolean_type_node)
2688 /* Using convert here would cause infinite recursion. */
2689 return build1 (NOP_EXPR, boolean_type_node, expr);
2690 break;
2692 case MODIFY_EXPR:
2693 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2694 warning ("suggest parentheses around assignment used as truth value");
2695 break;
2697 default:
2698 break;
2701 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2703 tree t = save_expr (expr);
2704 return (build_binary_op
2705 ((TREE_SIDE_EFFECTS (expr)
2706 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2707 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2708 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2709 0));
2712 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2715 static tree builtin_function_2 (const char *, const char *, tree, tree,
2716 int, enum built_in_class, int, int,
2717 tree);
2719 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2720 down to the element type of an array. */
2722 tree
2723 c_build_qualified_type (tree type, int type_quals)
2725 /* A restrict-qualified pointer type must be a pointer to object or
2726 incomplete type. Note that the use of POINTER_TYPE_P also allows
2727 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2728 the C++ front-end also use POINTER_TYPE for pointer-to-member
2729 values, so even though it should be illegal to use `restrict'
2730 with such an entity we don't flag that here. Thus, special case
2731 code for that case is required in the C++ front-end. */
2732 if ((type_quals & TYPE_QUAL_RESTRICT)
2733 && (!POINTER_TYPE_P (type)
2734 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2736 error ("invalid use of `restrict'");
2737 type_quals &= ~TYPE_QUAL_RESTRICT;
2740 if (TREE_CODE (type) == ARRAY_TYPE)
2741 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2742 type_quals),
2743 TYPE_DOMAIN (type));
2744 return build_qualified_type (type, type_quals);
2747 /* Apply the TYPE_QUALS to the new DECL. */
2749 void
2750 c_apply_type_quals_to_decl (int type_quals, tree decl)
2752 if ((type_quals & TYPE_QUAL_CONST)
2753 || (TREE_TYPE (decl)
2754 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2755 TREE_READONLY (decl) = 1;
2756 if (type_quals & TYPE_QUAL_VOLATILE)
2758 TREE_SIDE_EFFECTS (decl) = 1;
2759 TREE_THIS_VOLATILE (decl) = 1;
2761 if (type_quals & TYPE_QUAL_RESTRICT)
2763 if (!TREE_TYPE (decl)
2764 || !POINTER_TYPE_P (TREE_TYPE (decl))
2765 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2766 error ("invalid use of `restrict'");
2767 else if (flag_strict_aliasing)
2768 /* Indicate we need to make a unique alias set for this pointer.
2769 We can't do it here because it might be pointing to an
2770 incomplete type. */
2771 DECL_POINTER_ALIAS_SET (decl) = -2;
2775 /* Return the typed-based alias set for T, which may be an expression
2776 or a type. Return -1 if we don't do anything special. */
2778 HOST_WIDE_INT
2779 c_common_get_alias_set (tree t)
2781 tree u;
2783 /* Permit type-punning when accessing a union, provided the access
2784 is directly through the union. For example, this code does not
2785 permit taking the address of a union member and then storing
2786 through it. Even the type-punning allowed here is a GCC
2787 extension, albeit a common and useful one; the C standard says
2788 that such accesses have implementation-defined behavior. */
2789 for (u = t;
2790 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2791 u = TREE_OPERAND (u, 0))
2792 if (TREE_CODE (u) == COMPONENT_REF
2793 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2794 return 0;
2796 /* That's all the expressions we handle specially. */
2797 if (! TYPE_P (t))
2798 return -1;
2800 /* The C standard guarantees that any object may be accessed via an
2801 lvalue that has character type. */
2802 if (t == char_type_node
2803 || t == signed_char_type_node
2804 || t == unsigned_char_type_node)
2805 return 0;
2807 /* If it has the may_alias attribute, it can alias anything. */
2808 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2809 return 0;
2811 /* The C standard specifically allows aliasing between signed and
2812 unsigned variants of the same type. We treat the signed
2813 variant as canonical. */
2814 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2816 tree t1 = c_common_signed_type (t);
2818 /* t1 == t can happen for boolean nodes which are always unsigned. */
2819 if (t1 != t)
2820 return get_alias_set (t1);
2822 else if (POINTER_TYPE_P (t))
2824 tree t1;
2826 /* Unfortunately, there is no canonical form of a pointer type.
2827 In particular, if we have `typedef int I', then `int *', and
2828 `I *' are different types. So, we have to pick a canonical
2829 representative. We do this below.
2831 Technically, this approach is actually more conservative that
2832 it needs to be. In particular, `const int *' and `int *'
2833 should be in different alias sets, according to the C and C++
2834 standard, since their types are not the same, and so,
2835 technically, an `int **' and `const int **' cannot point at
2836 the same thing.
2838 But, the standard is wrong. In particular, this code is
2839 legal C++:
2841 int *ip;
2842 int **ipp = &ip;
2843 const int* const* cipp = &ipp;
2845 And, it doesn't make sense for that to be legal unless you
2846 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2847 the pointed-to types. This issue has been reported to the
2848 C++ committee. */
2849 t1 = build_type_no_quals (t);
2850 if (t1 != t)
2851 return get_alias_set (t1);
2854 return -1;
2857 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2858 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2859 flag controls whether we should diagnose possibly ill-formed
2860 constructs or not. */
2861 tree
2862 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2864 const char *op_name;
2865 tree value = NULL;
2866 enum tree_code type_code = TREE_CODE (type);
2868 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2869 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2871 if (type_code == FUNCTION_TYPE)
2873 if (op == SIZEOF_EXPR)
2875 if (complain && (pedantic || warn_pointer_arith))
2876 pedwarn ("invalid application of `sizeof' to a function type");
2877 value = size_one_node;
2879 else
2880 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2882 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2884 if (type_code == VOID_TYPE
2885 && complain && (pedantic || warn_pointer_arith))
2886 pedwarn ("invalid application of `%s' to a void type", op_name);
2887 value = size_one_node;
2889 else if (!COMPLETE_TYPE_P (type))
2891 if (complain)
2892 error ("invalid application of `%s' to an incomplete type", op_name);
2893 value = size_zero_node;
2895 else
2897 if (op == SIZEOF_EXPR)
2898 /* Convert in case a char is more than one unit. */
2899 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2900 size_int (TYPE_PRECISION (char_type_node)
2901 / BITS_PER_UNIT));
2902 else
2903 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2906 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2907 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2908 never happen. However, this node should really have type
2909 `size_t', which is just a typedef for an ordinary integer type. */
2910 value = fold (build1 (NOP_EXPR, size_type_node, value));
2911 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2913 return value;
2916 /* Implement the __alignof keyword: Return the minimum required
2917 alignment of EXPR, measured in bytes. For VAR_DECL's and
2918 FIELD_DECL's return DECL_ALIGN (which can be set from an
2919 "aligned" __attribute__ specification). */
2921 tree
2922 c_alignof_expr (tree expr)
2924 tree t;
2926 if (TREE_CODE (expr) == VAR_DECL)
2927 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2929 else if (TREE_CODE (expr) == COMPONENT_REF
2930 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2932 error ("`__alignof' applied to a bit-field");
2933 t = size_one_node;
2935 else if (TREE_CODE (expr) == COMPONENT_REF
2936 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2937 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2939 else if (TREE_CODE (expr) == INDIRECT_REF)
2941 tree t = TREE_OPERAND (expr, 0);
2942 tree best = t;
2943 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2945 while (TREE_CODE (t) == NOP_EXPR
2946 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2948 int thisalign;
2950 t = TREE_OPERAND (t, 0);
2951 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2952 if (thisalign > bestalign)
2953 best = t, bestalign = thisalign;
2955 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2957 else
2958 return c_alignof (TREE_TYPE (expr));
2960 return fold (build1 (NOP_EXPR, size_type_node, t));
2963 /* Handle C and C++ default attributes. */
2965 enum built_in_attribute
2967 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2968 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2969 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2970 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2971 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No entry needed in enum. */
2972 #include "builtin-attrs.def"
2973 #undef DEF_ATTR_NULL_TREE
2974 #undef DEF_ATTR_INT
2975 #undef DEF_ATTR_IDENT
2976 #undef DEF_ATTR_TREE_LIST
2977 #undef DEF_FN_ATTR
2978 ATTR_LAST
2981 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2983 static bool c_attrs_initialized = false;
2985 static void c_init_attributes (void);
2987 /* Build tree nodes and builtin functions common to both C and C++ language
2988 frontends. */
2990 void
2991 c_common_nodes_and_builtins (void)
2993 enum builtin_type
2995 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2996 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2997 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2998 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2999 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3000 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3001 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3002 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3003 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3004 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3005 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3006 #include "builtin-types.def"
3007 #undef DEF_PRIMITIVE_TYPE
3008 #undef DEF_FUNCTION_TYPE_0
3009 #undef DEF_FUNCTION_TYPE_1
3010 #undef DEF_FUNCTION_TYPE_2
3011 #undef DEF_FUNCTION_TYPE_3
3012 #undef DEF_FUNCTION_TYPE_4
3013 #undef DEF_FUNCTION_TYPE_VAR_0
3014 #undef DEF_FUNCTION_TYPE_VAR_1
3015 #undef DEF_FUNCTION_TYPE_VAR_2
3016 #undef DEF_FUNCTION_TYPE_VAR_3
3017 #undef DEF_POINTER_TYPE
3018 BT_LAST
3021 typedef enum builtin_type builtin_type;
3023 tree builtin_types[(int) BT_LAST];
3024 int wchar_type_size;
3025 tree array_domain_type;
3026 tree va_list_ref_type_node;
3027 tree va_list_arg_type_node;
3029 /* Define `int' and `char' first so that dbx will output them first. */
3030 record_builtin_type (RID_INT, NULL, integer_type_node);
3031 record_builtin_type (RID_CHAR, "char", char_type_node);
3033 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3034 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3035 but not C. Are the conditionals here needed? */
3036 if (c_dialect_cxx ())
3037 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3038 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3039 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3040 record_builtin_type (RID_MAX, "long unsigned int",
3041 long_unsigned_type_node);
3042 if (c_dialect_cxx ())
3043 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3044 record_builtin_type (RID_MAX, "long long int",
3045 long_long_integer_type_node);
3046 record_builtin_type (RID_MAX, "long long unsigned int",
3047 long_long_unsigned_type_node);
3048 if (c_dialect_cxx ())
3049 record_builtin_type (RID_MAX, "long long unsigned",
3050 long_long_unsigned_type_node);
3051 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3052 record_builtin_type (RID_MAX, "short unsigned int",
3053 short_unsigned_type_node);
3054 if (c_dialect_cxx ())
3055 record_builtin_type (RID_MAX, "unsigned short",
3056 short_unsigned_type_node);
3058 /* Define both `signed char' and `unsigned char'. */
3059 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3060 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3062 /* These are types that c_common_type_for_size and
3063 c_common_type_for_mode use. */
3064 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3065 intQI_type_node));
3066 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3067 intHI_type_node));
3068 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3069 intSI_type_node));
3070 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3071 intDI_type_node));
3072 #if HOST_BITS_PER_WIDE_INT >= 64
3073 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3074 get_identifier ("__int128_t"),
3075 intTI_type_node));
3076 #endif
3077 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3078 unsigned_intQI_type_node));
3079 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3080 unsigned_intHI_type_node));
3081 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3082 unsigned_intSI_type_node));
3083 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3084 unsigned_intDI_type_node));
3085 #if HOST_BITS_PER_WIDE_INT >= 64
3086 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3087 get_identifier ("__uint128_t"),
3088 unsigned_intTI_type_node));
3089 #endif
3091 /* Create the widest literal types. */
3092 widest_integer_literal_type_node
3093 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3094 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3095 widest_integer_literal_type_node));
3097 widest_unsigned_literal_type_node
3098 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3099 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL, NULL_TREE,
3100 widest_unsigned_literal_type_node));
3102 /* `unsigned long' is the standard type for sizeof.
3103 Note that stddef.h uses `unsigned long',
3104 and this must agree, even if long and int are the same size. */
3105 size_type_node =
3106 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3107 signed_size_type_node = c_common_signed_type (size_type_node);
3108 set_sizetype (size_type_node);
3110 build_common_tree_nodes_2 (flag_short_double);
3112 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3113 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3114 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3116 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3117 get_identifier ("complex int"),
3118 complex_integer_type_node));
3119 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3120 get_identifier ("complex float"),
3121 complex_float_type_node));
3122 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3123 get_identifier ("complex double"),
3124 complex_double_type_node));
3125 (*lang_hooks.decls.pushdecl)
3126 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3127 complex_long_double_type_node));
3129 /* Types which are common to the fortran compiler and libf2c. When
3130 changing these, you also need to be concerned with f/com.h. */
3132 if (TYPE_PRECISION (float_type_node)
3133 == TYPE_PRECISION (long_integer_type_node))
3135 g77_integer_type_node = long_integer_type_node;
3136 g77_uinteger_type_node = long_unsigned_type_node;
3138 else if (TYPE_PRECISION (float_type_node)
3139 == TYPE_PRECISION (integer_type_node))
3141 g77_integer_type_node = integer_type_node;
3142 g77_uinteger_type_node = unsigned_type_node;
3144 else
3145 g77_integer_type_node = g77_uinteger_type_node = NULL_TREE;
3147 if (g77_integer_type_node != NULL_TREE)
3149 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3150 get_identifier ("__g77_integer"),
3151 g77_integer_type_node));
3152 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3153 get_identifier ("__g77_uinteger"),
3154 g77_uinteger_type_node));
3157 if (TYPE_PRECISION (float_type_node) * 2
3158 == TYPE_PRECISION (long_integer_type_node))
3160 g77_longint_type_node = long_integer_type_node;
3161 g77_ulongint_type_node = long_unsigned_type_node;
3163 else if (TYPE_PRECISION (float_type_node) * 2
3164 == TYPE_PRECISION (long_long_integer_type_node))
3166 g77_longint_type_node = long_long_integer_type_node;
3167 g77_ulongint_type_node = long_long_unsigned_type_node;
3169 else
3170 g77_longint_type_node = g77_ulongint_type_node = NULL_TREE;
3172 if (g77_longint_type_node != NULL_TREE)
3174 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3175 get_identifier ("__g77_longint"),
3176 g77_longint_type_node));
3177 (*lang_hooks.decls.pushdecl) (build_decl (TYPE_DECL,
3178 get_identifier ("__g77_ulongint"),
3179 g77_ulongint_type_node));
3182 record_builtin_type (RID_VOID, NULL, void_type_node);
3184 void_zero_node = build_int_2 (0, 0);
3185 TREE_TYPE (void_zero_node) = void_type_node;
3187 void_list_node = build_void_list_node ();
3189 /* Make a type to be the domain of a few array types
3190 whose domains don't really matter.
3191 200 is small enough that it always fits in size_t
3192 and large enough that it can hold most function names for the
3193 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3194 array_domain_type = build_index_type (size_int (200));
3196 /* Make a type for arrays of characters.
3197 With luck nothing will ever really depend on the length of this
3198 array type. */
3199 char_array_type_node
3200 = build_array_type (char_type_node, array_domain_type);
3202 /* Likewise for arrays of ints. */
3203 int_array_type_node
3204 = build_array_type (integer_type_node, array_domain_type);
3206 string_type_node = build_pointer_type (char_type_node);
3207 const_string_type_node
3208 = build_pointer_type (build_qualified_type
3209 (char_type_node, TYPE_QUAL_CONST));
3211 /* This is special for C++ so functions can be overloaded. */
3212 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3213 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3214 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3215 if (c_dialect_cxx ())
3217 if (TREE_UNSIGNED (wchar_type_node))
3218 wchar_type_node = make_unsigned_type (wchar_type_size);
3219 else
3220 wchar_type_node = make_signed_type (wchar_type_size);
3221 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3223 else
3225 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3226 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3229 /* This is for wide string constants. */
3230 wchar_array_type_node
3231 = build_array_type (wchar_type_node, array_domain_type);
3233 wint_type_node =
3234 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3236 intmax_type_node =
3237 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3238 uintmax_type_node =
3239 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3241 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3242 ptrdiff_type_node
3243 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3244 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3246 (*lang_hooks.decls.pushdecl)
3247 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3248 va_list_type_node));
3250 (*lang_hooks.decls.pushdecl)
3251 (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3252 ptrdiff_type_node));
3254 (*lang_hooks.decls.pushdecl)
3255 (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3256 sizetype));
3258 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3260 va_list_arg_type_node = va_list_ref_type_node =
3261 build_pointer_type (TREE_TYPE (va_list_type_node));
3263 else
3265 va_list_arg_type_node = va_list_type_node;
3266 va_list_ref_type_node = build_reference_type (va_list_type_node);
3269 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3270 builtin_types[(int) ENUM] = VALUE;
3271 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3272 builtin_types[(int) ENUM] \
3273 = build_function_type (builtin_types[(int) RETURN], \
3274 void_list_node);
3275 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3276 builtin_types[(int) ENUM] \
3277 = build_function_type (builtin_types[(int) RETURN], \
3278 tree_cons (NULL_TREE, \
3279 builtin_types[(int) ARG1], \
3280 void_list_node));
3281 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3282 builtin_types[(int) ENUM] \
3283 = build_function_type \
3284 (builtin_types[(int) RETURN], \
3285 tree_cons (NULL_TREE, \
3286 builtin_types[(int) ARG1], \
3287 tree_cons (NULL_TREE, \
3288 builtin_types[(int) ARG2], \
3289 void_list_node)));
3290 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3291 builtin_types[(int) ENUM] \
3292 = build_function_type \
3293 (builtin_types[(int) RETURN], \
3294 tree_cons (NULL_TREE, \
3295 builtin_types[(int) ARG1], \
3296 tree_cons (NULL_TREE, \
3297 builtin_types[(int) ARG2], \
3298 tree_cons (NULL_TREE, \
3299 builtin_types[(int) ARG3], \
3300 void_list_node))));
3301 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3302 builtin_types[(int) ENUM] \
3303 = build_function_type \
3304 (builtin_types[(int) RETURN], \
3305 tree_cons (NULL_TREE, \
3306 builtin_types[(int) ARG1], \
3307 tree_cons (NULL_TREE, \
3308 builtin_types[(int) ARG2], \
3309 tree_cons \
3310 (NULL_TREE, \
3311 builtin_types[(int) ARG3], \
3312 tree_cons (NULL_TREE, \
3313 builtin_types[(int) ARG4], \
3314 void_list_node)))));
3315 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3316 builtin_types[(int) ENUM] \
3317 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3318 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3319 builtin_types[(int) ENUM] \
3320 = build_function_type (builtin_types[(int) RETURN], \
3321 tree_cons (NULL_TREE, \
3322 builtin_types[(int) ARG1], \
3323 NULL_TREE));
3325 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3326 builtin_types[(int) ENUM] \
3327 = build_function_type \
3328 (builtin_types[(int) RETURN], \
3329 tree_cons (NULL_TREE, \
3330 builtin_types[(int) ARG1], \
3331 tree_cons (NULL_TREE, \
3332 builtin_types[(int) ARG2], \
3333 NULL_TREE)));
3335 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3336 builtin_types[(int) ENUM] \
3337 = build_function_type \
3338 (builtin_types[(int) RETURN], \
3339 tree_cons (NULL_TREE, \
3340 builtin_types[(int) ARG1], \
3341 tree_cons (NULL_TREE, \
3342 builtin_types[(int) ARG2], \
3343 tree_cons (NULL_TREE, \
3344 builtin_types[(int) ARG3], \
3345 NULL_TREE))));
3347 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3348 builtin_types[(int) ENUM] \
3349 = build_pointer_type (builtin_types[(int) TYPE]);
3350 #include "builtin-types.def"
3351 #undef DEF_PRIMITIVE_TYPE
3352 #undef DEF_FUNCTION_TYPE_1
3353 #undef DEF_FUNCTION_TYPE_2
3354 #undef DEF_FUNCTION_TYPE_3
3355 #undef DEF_FUNCTION_TYPE_4
3356 #undef DEF_FUNCTION_TYPE_VAR_0
3357 #undef DEF_FUNCTION_TYPE_VAR_1
3358 #undef DEF_FUNCTION_TYPE_VAR_2
3359 #undef DEF_FUNCTION_TYPE_VAR_3
3360 #undef DEF_POINTER_TYPE
3362 if (!c_attrs_initialized)
3363 c_init_attributes ();
3365 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3366 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3367 if (NAME) \
3369 tree decl; \
3371 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3372 abort (); \
3374 if (!BOTH_P) \
3375 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3376 CLASS, \
3377 (FALLBACK_P \
3378 ? (NAME + strlen ("__builtin_")) \
3379 : NULL), \
3380 built_in_attributes[(int) ATTRS]); \
3381 else \
3382 decl = builtin_function_2 (NAME, \
3383 NAME + strlen ("__builtin_"), \
3384 builtin_types[TYPE], \
3385 builtin_types[LIBTYPE], \
3386 ENUM, \
3387 CLASS, \
3388 FALLBACK_P, \
3389 NONANSI_P, \
3390 built_in_attributes[(int) ATTRS]); \
3392 built_in_decls[(int) ENUM] = decl; \
3393 if (IMPLICIT) \
3394 implicit_built_in_decls[(int) ENUM] = decl; \
3396 #include "builtins.def"
3397 #undef DEF_BUILTIN
3399 (*targetm.init_builtins) ();
3401 main_identifier_node = get_identifier ("main");
3404 tree
3405 build_va_arg (tree expr, tree type)
3407 return build1 (VA_ARG_EXPR, type, expr);
3411 /* Linked list of disabled built-in functions. */
3413 typedef struct disabled_builtin
3415 const char *name;
3416 struct disabled_builtin *next;
3417 } disabled_builtin;
3418 static disabled_builtin *disabled_builtins = NULL;
3420 static bool builtin_function_disabled_p (const char *);
3422 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3423 begins with "__builtin_", give an error. */
3425 void
3426 disable_builtin_function (const char *name)
3428 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3429 error ("cannot disable built-in function `%s'", name);
3430 else
3432 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3433 new->name = name;
3434 new->next = disabled_builtins;
3435 disabled_builtins = new;
3440 /* Return true if the built-in function NAME has been disabled, false
3441 otherwise. */
3443 static bool
3444 builtin_function_disabled_p (const char *name)
3446 disabled_builtin *p;
3447 for (p = disabled_builtins; p != NULL; p = p->next)
3449 if (strcmp (name, p->name) == 0)
3450 return true;
3452 return false;
3456 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3457 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3458 of these may be NULL (though both being NULL is useless).
3459 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3460 TYPE is the type of the function with the ordinary name. These
3461 may differ if the ordinary name is declared with a looser type to avoid
3462 conflicts with headers. FUNCTION_CODE and CLASS are as for
3463 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3464 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3465 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3466 ATTRS is the tree list representing the builtin's function attributes.
3467 Returns the declaration of BUILTIN_NAME, if any, otherwise
3468 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3469 or if NONANSI_P and flag_no_nonansi_builtin. */
3471 static tree
3472 builtin_function_2 (const char *builtin_name, const char *name,
3473 tree builtin_type, tree type, int function_code,
3474 enum built_in_class class, int library_name_p,
3475 int nonansi_p, tree attrs)
3477 tree bdecl = NULL_TREE;
3478 tree decl = NULL_TREE;
3480 if (builtin_name != 0)
3481 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3482 class, library_name_p ? name : NULL, attrs);
3484 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3485 && !(nonansi_p && flag_no_nonansi_builtin))
3486 decl = builtin_function (name, type, function_code, class, NULL, attrs);
3488 return (bdecl != 0 ? bdecl : decl);
3491 /* Nonzero if the type T promotes to int. This is (nearly) the
3492 integral promotions defined in ISO C99 6.3.1.1/2. */
3494 bool
3495 c_promoting_integer_type_p (tree t)
3497 switch (TREE_CODE (t))
3499 case INTEGER_TYPE:
3500 return (TYPE_MAIN_VARIANT (t) == char_type_node
3501 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3502 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3503 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3504 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3505 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3507 case ENUMERAL_TYPE:
3508 /* ??? Technically all enumerations not larger than an int
3509 promote to an int. But this is used along code paths
3510 that only want to notice a size change. */
3511 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3513 case BOOLEAN_TYPE:
3514 return 1;
3516 default:
3517 return 0;
3521 /* Return 1 if PARMS specifies a fixed number of parameters
3522 and none of their types is affected by default promotions. */
3525 self_promoting_args_p (tree parms)
3527 tree t;
3528 for (t = parms; t; t = TREE_CHAIN (t))
3530 tree type = TREE_VALUE (t);
3532 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3533 return 0;
3535 if (type == 0)
3536 return 0;
3538 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3539 return 0;
3541 if (c_promoting_integer_type_p (type))
3542 return 0;
3544 return 1;
3547 /* Recursively examines the array elements of TYPE, until a non-array
3548 element type is found. */
3550 tree
3551 strip_array_types (tree type)
3553 while (TREE_CODE (type) == ARRAY_TYPE)
3554 type = TREE_TYPE (type);
3556 return type;
3559 static tree expand_unordered_cmp (tree, tree, enum tree_code, enum tree_code);
3561 /* Expand a call to an unordered comparison function such as
3562 __builtin_isgreater(). FUNCTION is the function's declaration and
3563 PARAMS a list of the values passed. For __builtin_isunordered(),
3564 UNORDERED_CODE is UNORDERED_EXPR and ORDERED_CODE is NOP_EXPR. In
3565 other cases, UNORDERED_CODE and ORDERED_CODE are comparison codes
3566 that give the opposite of the desired result. UNORDERED_CODE is
3567 used for modes that can hold NaNs and ORDERED_CODE is used for the
3568 rest. */
3570 static tree
3571 expand_unordered_cmp (tree function, tree params,
3572 enum tree_code unordered_code,
3573 enum tree_code ordered_code)
3575 tree arg0, arg1, type;
3576 enum tree_code code0, code1;
3578 /* Check that we have exactly two arguments. */
3579 if (params == 0 || TREE_CHAIN (params) == 0)
3581 error ("too few arguments to function `%s'",
3582 IDENTIFIER_POINTER (DECL_NAME (function)));
3583 return error_mark_node;
3585 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3587 error ("too many arguments to function `%s'",
3588 IDENTIFIER_POINTER (DECL_NAME (function)));
3589 return error_mark_node;
3592 arg0 = TREE_VALUE (params);
3593 arg1 = TREE_VALUE (TREE_CHAIN (params));
3595 code0 = TREE_CODE (TREE_TYPE (arg0));
3596 code1 = TREE_CODE (TREE_TYPE (arg1));
3598 /* Make sure that the arguments have a common type of REAL. */
3599 type = 0;
3600 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3601 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3602 type = common_type (TREE_TYPE (arg0), TREE_TYPE (arg1));
3604 if (type == 0 || TREE_CODE (type) != REAL_TYPE)
3606 error ("non-floating-point argument to function `%s'",
3607 IDENTIFIER_POINTER (DECL_NAME (function)));
3608 return error_mark_node;
3611 if (unordered_code == UNORDERED_EXPR)
3613 if (MODE_HAS_NANS (TYPE_MODE (type)))
3614 return build_binary_op (unordered_code,
3615 convert (type, arg0),
3616 convert (type, arg1),
3618 else
3619 return integer_zero_node;
3622 return build_unary_op (TRUTH_NOT_EXPR,
3623 build_binary_op (MODE_HAS_NANS (TYPE_MODE (type))
3624 ? unordered_code
3625 : ordered_code,
3626 convert (type, arg0),
3627 convert (type, arg1),
3633 /* Recognize certain built-in functions so we can make tree-codes
3634 other than CALL_EXPR. We do this when it enables fold-const.c
3635 to do something useful. */
3636 /* ??? By rights this should go in builtins.c, but only C and C++
3637 implement build_{binary,unary}_op. Not exactly sure what bits
3638 of functionality are actually needed from those functions, or
3639 where the similar functionality exists in the other front ends. */
3641 tree
3642 expand_tree_builtin (tree function, tree params, tree coerced_params)
3644 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3645 return NULL_TREE;
3647 switch (DECL_FUNCTION_CODE (function))
3649 case BUILT_IN_ABS:
3650 case BUILT_IN_LABS:
3651 case BUILT_IN_LLABS:
3652 case BUILT_IN_IMAXABS:
3653 case BUILT_IN_FABS:
3654 case BUILT_IN_FABSL:
3655 case BUILT_IN_FABSF:
3656 if (coerced_params == 0)
3657 return integer_zero_node;
3658 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3660 case BUILT_IN_CONJ:
3661 case BUILT_IN_CONJF:
3662 case BUILT_IN_CONJL:
3663 if (coerced_params == 0)
3664 return integer_zero_node;
3665 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3667 case BUILT_IN_CREAL:
3668 case BUILT_IN_CREALF:
3669 case BUILT_IN_CREALL:
3670 if (coerced_params == 0)
3671 return integer_zero_node;
3672 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3674 case BUILT_IN_CIMAG:
3675 case BUILT_IN_CIMAGF:
3676 case BUILT_IN_CIMAGL:
3677 if (coerced_params == 0)
3678 return integer_zero_node;
3679 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3681 case BUILT_IN_ISGREATER:
3682 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
3684 case BUILT_IN_ISGREATEREQUAL:
3685 return expand_unordered_cmp (function, params, UNLT_EXPR, LT_EXPR);
3687 case BUILT_IN_ISLESS:
3688 return expand_unordered_cmp (function, params, UNGE_EXPR, GE_EXPR);
3690 case BUILT_IN_ISLESSEQUAL:
3691 return expand_unordered_cmp (function, params, UNGT_EXPR, GT_EXPR);
3693 case BUILT_IN_ISLESSGREATER:
3694 return expand_unordered_cmp (function, params, UNEQ_EXPR, EQ_EXPR);
3696 case BUILT_IN_ISUNORDERED:
3697 return expand_unordered_cmp (function, params, UNORDERED_EXPR, NOP_EXPR);
3699 default:
3700 break;
3703 return NULL_TREE;
3706 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3707 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3708 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3709 value, the traversal is aborted, and the value returned by FUNC is
3710 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3711 the node being visited are not walked.
3713 We don't need a without_duplicates variant of this one because the
3714 statement tree is a tree, not a graph. */
3716 tree
3717 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3719 enum tree_code code;
3720 int walk_subtrees;
3721 tree result;
3722 int i, len;
3724 #define WALK_SUBTREE(NODE) \
3725 do \
3727 result = walk_stmt_tree (&(NODE), func, data); \
3728 if (result) \
3729 return result; \
3731 while (0)
3733 /* Skip empty subtrees. */
3734 if (!*tp)
3735 return NULL_TREE;
3737 /* Skip subtrees below non-statement nodes. */
3738 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3739 return NULL_TREE;
3741 /* Call the function. */
3742 walk_subtrees = 1;
3743 result = (*func) (tp, &walk_subtrees, data);
3745 /* If we found something, return it. */
3746 if (result)
3747 return result;
3749 /* FUNC may have modified the tree, recheck that we're looking at a
3750 statement node. */
3751 code = TREE_CODE (*tp);
3752 if (!STATEMENT_CODE_P (code))
3753 return NULL_TREE;
3755 /* Visit the subtrees unless FUNC decided that there was nothing
3756 interesting below this point in the tree. */
3757 if (walk_subtrees)
3759 /* Walk over all the sub-trees of this operand. Statement nodes
3760 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3761 len = TREE_CODE_LENGTH (code);
3763 /* Go through the subtrees. We need to do this in forward order so
3764 that the scope of a FOR_EXPR is handled properly. */
3765 for (i = 0; i < len; ++i)
3766 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3769 /* Finally visit the chain. This can be tail-recursion optimized if
3770 we write it this way. */
3771 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3773 #undef WALK_SUBTREE
3776 /* Used to compare case labels. K1 and K2 are actually tree nodes
3777 representing case labels, or NULL_TREE for a `default' label.
3778 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3779 K2, and 0 if K1 and K2 are equal. */
3782 case_compare (splay_tree_key k1, splay_tree_key k2)
3784 /* Consider a NULL key (such as arises with a `default' label) to be
3785 smaller than anything else. */
3786 if (!k1)
3787 return k2 ? -1 : 0;
3788 else if (!k2)
3789 return k1 ? 1 : 0;
3791 return tree_int_cst_compare ((tree) k1, (tree) k2);
3794 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3795 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3796 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3797 case label was declared using the usual C/C++ syntax, rather than
3798 the GNU case range extension. CASES is a tree containing all the
3799 case ranges processed so far; COND is the condition for the
3800 switch-statement itself. Returns the CASE_LABEL created, or
3801 ERROR_MARK_NODE if no CASE_LABEL is created. */
3803 tree
3804 c_add_case_label (splay_tree cases, tree cond, tree low_value,
3805 tree high_value)
3807 tree type;
3808 tree label;
3809 tree case_label;
3810 splay_tree_node node;
3812 /* Create the LABEL_DECL itself. */
3813 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3814 DECL_CONTEXT (label) = current_function_decl;
3816 /* If there was an error processing the switch condition, bail now
3817 before we get more confused. */
3818 if (!cond || cond == error_mark_node)
3820 /* Add a label anyhow so that the back-end doesn't think that
3821 the beginning of the switch is unreachable. */
3822 if (!cases->root)
3823 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3824 return error_mark_node;
3827 if ((low_value && TREE_TYPE (low_value)
3828 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3829 || (high_value && TREE_TYPE (high_value)
3830 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3831 error ("pointers are not permitted as case values");
3833 /* Case ranges are a GNU extension. */
3834 if (high_value && pedantic)
3835 pedwarn ("range expressions in switch statements are non-standard");
3837 type = TREE_TYPE (cond);
3838 if (low_value)
3840 low_value = check_case_value (low_value);
3841 low_value = convert_and_check (type, low_value);
3843 if (high_value)
3845 high_value = check_case_value (high_value);
3846 high_value = convert_and_check (type, high_value);
3849 /* If an error has occurred, bail out now. */
3850 if (low_value == error_mark_node || high_value == error_mark_node)
3852 if (!cases->root)
3853 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3854 return error_mark_node;
3857 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3858 really a case range, even though it was written that way. Remove
3859 the HIGH_VALUE to simplify later processing. */
3860 if (tree_int_cst_equal (low_value, high_value))
3861 high_value = NULL_TREE;
3862 if (low_value && high_value
3863 && !tree_int_cst_lt (low_value, high_value))
3864 warning ("empty range specified");
3866 /* Look up the LOW_VALUE in the table of case labels we already
3867 have. */
3868 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3869 /* If there was not an exact match, check for overlapping ranges.
3870 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3871 that's a `default' label and the only overlap is an exact match. */
3872 if (!node && (low_value || high_value))
3874 splay_tree_node low_bound;
3875 splay_tree_node high_bound;
3877 /* Even though there wasn't an exact match, there might be an
3878 overlap between this case range and another case range.
3879 Since we've (inductively) not allowed any overlapping case
3880 ranges, we simply need to find the greatest low case label
3881 that is smaller that LOW_VALUE, and the smallest low case
3882 label that is greater than LOW_VALUE. If there is an overlap
3883 it will occur in one of these two ranges. */
3884 low_bound = splay_tree_predecessor (cases,
3885 (splay_tree_key) low_value);
3886 high_bound = splay_tree_successor (cases,
3887 (splay_tree_key) low_value);
3889 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3890 the LOW_VALUE, so there is no need to check unless the
3891 LOW_BOUND is in fact itself a case range. */
3892 if (low_bound
3893 && CASE_HIGH ((tree) low_bound->value)
3894 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3895 low_value) >= 0)
3896 node = low_bound;
3897 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3898 range is bigger than the low end of the current range, so we
3899 are only interested if the current range is a real range, and
3900 not an ordinary case label. */
3901 else if (high_bound
3902 && high_value
3903 && (tree_int_cst_compare ((tree) high_bound->key,
3904 high_value)
3905 <= 0))
3906 node = high_bound;
3908 /* If there was an overlap, issue an error. */
3909 if (node)
3911 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3913 if (high_value)
3915 error ("duplicate (or overlapping) case value");
3916 error_with_decl (duplicate,
3917 "this is the first entry overlapping that value");
3919 else if (low_value)
3921 error ("duplicate case value") ;
3922 error_with_decl (duplicate, "previously used here");
3924 else
3926 error ("multiple default labels in one switch");
3927 error_with_decl (duplicate, "this is the first default label");
3929 if (!cases->root)
3930 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3933 /* Add a CASE_LABEL to the statement-tree. */
3934 case_label = add_stmt (build_case_label (low_value, high_value, label));
3935 /* Register this case label in the splay tree. */
3936 splay_tree_insert (cases,
3937 (splay_tree_key) low_value,
3938 (splay_tree_value) case_label);
3940 return case_label;
3943 /* Finish an expression taking the address of LABEL (an
3944 IDENTIFIER_NODE). Returns an expression for the address. */
3946 tree
3947 finish_label_address_expr (tree label)
3949 tree result;
3951 if (pedantic)
3952 pedwarn ("taking the address of a label is non-standard");
3954 if (label == error_mark_node)
3955 return error_mark_node;
3957 label = lookup_label (label);
3958 if (label == NULL_TREE)
3959 result = null_pointer_node;
3960 else
3962 TREE_USED (label) = 1;
3963 result = build1 (ADDR_EXPR, ptr_type_node, label);
3964 TREE_CONSTANT (result) = 1;
3965 /* The current function in not necessarily uninlinable.
3966 Computed gotos are incompatible with inlining, but the value
3967 here could be used only in a diagnostic, for example. */
3970 return result;
3973 /* Hook used by expand_expr to expand language-specific tree codes. */
3976 c_expand_expr (tree exp, rtx target, enum machine_mode tmode, int modifier)
3977 /* Actually enum_modifier. */
3979 switch (TREE_CODE (exp))
3981 case STMT_EXPR:
3983 tree rtl_expr;
3984 rtx result;
3985 bool preserve_result = false;
3986 bool return_target = false;
3988 /* Since expand_expr_stmt calls free_temp_slots after every
3989 expression statement, we must call push_temp_slots here.
3990 Otherwise, any temporaries in use now would be considered
3991 out-of-scope after the first EXPR_STMT from within the
3992 STMT_EXPR. */
3993 push_temp_slots ();
3994 rtl_expr = expand_start_stmt_expr (!STMT_EXPR_NO_SCOPE (exp));
3996 /* If we want the result of this expression, find the last
3997 EXPR_STMT in the COMPOUND_STMT and mark it as addressable. */
3998 if (target != const0_rtx
3999 && TREE_CODE (STMT_EXPR_STMT (exp)) == COMPOUND_STMT
4000 && TREE_CODE (COMPOUND_BODY (STMT_EXPR_STMT (exp))) == SCOPE_STMT)
4002 tree expr = COMPOUND_BODY (STMT_EXPR_STMT (exp));
4003 tree last = TREE_CHAIN (expr);
4005 while (TREE_CHAIN (last))
4007 expr = last;
4008 last = TREE_CHAIN (last);
4011 if (TREE_CODE (last) == SCOPE_STMT
4012 && TREE_CODE (expr) == EXPR_STMT)
4014 if (target && TREE_CODE (EXPR_STMT_EXPR (expr)) == VAR_DECL
4015 && DECL_RTL_IF_SET (EXPR_STMT_EXPR (expr)) == target)
4016 /* If the last expression is a variable whose RTL is the
4017 same as our target, just return the target; if it
4018 isn't valid expanding the decl would produce different
4019 RTL, and store_expr would try to do a copy. */
4020 return_target = true;
4021 else
4023 /* Otherwise, note that we want the value from the last
4024 expression. */
4025 TREE_ADDRESSABLE (expr) = 1;
4026 preserve_result = true;
4031 expand_stmt (STMT_EXPR_STMT (exp));
4032 expand_end_stmt_expr (rtl_expr);
4034 result = expand_expr (rtl_expr, target, tmode, modifier);
4035 if (return_target)
4036 result = target;
4037 else if (preserve_result && GET_CODE (result) == MEM)
4039 if (GET_MODE (result) != BLKmode)
4040 result = copy_to_reg (result);
4041 else
4042 preserve_temp_slots (result);
4045 /* If the statment-expression does not have a scope, then the
4046 new temporaries we created within it must live beyond the
4047 statement-expression. */
4048 if (STMT_EXPR_NO_SCOPE (exp))
4049 preserve_temp_slots (NULL_RTX);
4051 pop_temp_slots ();
4052 return result;
4054 break;
4056 case CALL_EXPR:
4058 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4059 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4060 == FUNCTION_DECL)
4061 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4062 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4063 == BUILT_IN_FRONTEND))
4064 return c_expand_builtin (exp, target, tmode, modifier);
4065 else
4066 abort ();
4068 break;
4070 case COMPOUND_LITERAL_EXPR:
4072 /* Initialize the anonymous variable declared in the compound
4073 literal, then return the variable. */
4074 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
4075 emit_local_var (decl);
4076 return expand_expr (decl, target, tmode, modifier);
4079 default:
4080 abort ();
4083 abort ();
4084 return NULL;
4087 /* Hook used by safe_from_p to handle language-specific tree codes. */
4090 c_safe_from_p (rtx target, tree exp)
4092 /* We can see statements here when processing the body of a
4093 statement-expression. For a declaration statement declaring a
4094 variable, look at the variable's initializer. */
4095 if (TREE_CODE (exp) == DECL_STMT)
4097 tree decl = DECL_STMT_DECL (exp);
4099 if (TREE_CODE (decl) == VAR_DECL
4100 && DECL_INITIAL (decl)
4101 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4102 return 0;
4105 /* For any statement, we must follow the statement-chain. */
4106 if (STATEMENT_CODE_P (TREE_CODE (exp)) && TREE_CHAIN (exp))
4107 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4109 /* Assume everything else is safe. */
4110 return 1;
4113 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4116 c_common_unsafe_for_reeval (tree exp)
4118 /* Statement expressions may not be reevaluated, likewise compound
4119 literals. */
4120 if (TREE_CODE (exp) == STMT_EXPR
4121 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
4122 return 2;
4124 /* Walk all other expressions. */
4125 return -1;
4128 /* Hook used by staticp to handle language-specific tree codes. */
4131 c_staticp (tree exp)
4133 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
4134 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
4135 return 1;
4136 return 0;
4139 #define CALLED_AS_BUILT_IN(NODE) \
4140 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
4142 static rtx
4143 c_expand_builtin (tree exp, rtx target, enum machine_mode tmode,
4144 enum expand_modifier modifier)
4146 tree type = TREE_TYPE (exp);
4147 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4148 tree arglist = TREE_OPERAND (exp, 1);
4149 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
4150 enum tree_code code = TREE_CODE (exp);
4151 const int ignore = (target == const0_rtx
4152 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
4153 || code == CONVERT_EXPR || code == REFERENCE_EXPR
4154 || code == COND_EXPR)
4155 && TREE_CODE (type) == VOID_TYPE));
4157 if (! optimize && ! CALLED_AS_BUILT_IN (fndecl))
4158 return expand_call (exp, target, ignore);
4160 switch (fcode)
4162 case BUILT_IN_PRINTF:
4163 target = c_expand_builtin_printf (arglist, target, tmode,
4164 modifier, ignore, /*unlocked=*/ 0);
4165 if (target)
4166 return target;
4167 break;
4169 case BUILT_IN_PRINTF_UNLOCKED:
4170 target = c_expand_builtin_printf (arglist, target, tmode,
4171 modifier, ignore, /*unlocked=*/ 1);
4172 if (target)
4173 return target;
4174 break;
4176 case BUILT_IN_FPRINTF:
4177 target = c_expand_builtin_fprintf (arglist, target, tmode,
4178 modifier, ignore, /*unlocked=*/ 0);
4179 if (target)
4180 return target;
4181 break;
4183 case BUILT_IN_FPRINTF_UNLOCKED:
4184 target = c_expand_builtin_fprintf (arglist, target, tmode,
4185 modifier, ignore, /*unlocked=*/ 1);
4186 if (target)
4187 return target;
4188 break;
4190 default: /* just do library call, if unknown builtin */
4191 error ("built-in function `%s' not currently supported",
4192 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
4195 /* The switch statement above can drop through to cause the function
4196 to be called normally. */
4197 return expand_call (exp, target, ignore);
4200 /* Check an arglist to *printf for problems. The arglist should start
4201 at the format specifier, with the remaining arguments immediately
4202 following it. */
4203 static int
4204 is_valid_printf_arglist (tree arglist)
4206 /* Save this value so we can restore it later. */
4207 const int SAVE_pedantic = pedantic;
4208 int diagnostic_occurred = 0;
4209 tree attrs;
4211 /* Set this to a known value so the user setting won't affect code
4212 generation. */
4213 pedantic = 1;
4214 /* Check to make sure there are no format specifier errors. */
4215 attrs = tree_cons (get_identifier ("format"),
4216 tree_cons (NULL_TREE,
4217 get_identifier ("printf"),
4218 tree_cons (NULL_TREE,
4219 integer_one_node,
4220 tree_cons (NULL_TREE,
4221 build_int_2 (2, 0),
4222 NULL_TREE))),
4223 NULL_TREE);
4224 check_function_format (&diagnostic_occurred, attrs, arglist);
4226 /* Restore the value of `pedantic'. */
4227 pedantic = SAVE_pedantic;
4229 /* If calling `check_function_format_ptr' produces a warning, we
4230 return false, otherwise we return true. */
4231 return ! diagnostic_occurred;
4234 /* If the arguments passed to printf are suitable for optimizations,
4235 we attempt to transform the call. */
4236 static rtx
4237 c_expand_builtin_printf (tree arglist, rtx target, enum machine_mode tmode,
4238 enum expand_modifier modifier, int ignore,
4239 int unlocked)
4241 tree fn_putchar = unlocked ?
4242 implicit_built_in_decls[BUILT_IN_PUTCHAR_UNLOCKED] : implicit_built_in_decls[BUILT_IN_PUTCHAR];
4243 tree fn_puts = unlocked ?
4244 implicit_built_in_decls[BUILT_IN_PUTS_UNLOCKED] : implicit_built_in_decls[BUILT_IN_PUTS];
4245 tree fn, format_arg, stripped_string;
4247 /* If the return value is used, or the replacement _DECL isn't
4248 initialized, don't do the transformation. */
4249 if (!ignore || !fn_putchar || !fn_puts)
4250 return 0;
4252 /* Verify the required arguments in the original call. */
4253 if (arglist == 0
4254 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE))
4255 return 0;
4257 /* Check the specifier vs. the parameters. */
4258 if (!is_valid_printf_arglist (arglist))
4259 return 0;
4261 format_arg = TREE_VALUE (arglist);
4262 stripped_string = format_arg;
4263 STRIP_NOPS (stripped_string);
4264 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4265 stripped_string = TREE_OPERAND (stripped_string, 0);
4267 /* If the format specifier isn't a STRING_CST, punt. */
4268 if (TREE_CODE (stripped_string) != STRING_CST)
4269 return 0;
4271 /* OK! We can attempt optimization. */
4273 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4274 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s\n") == 0)
4276 arglist = TREE_CHAIN (arglist);
4277 fn = fn_puts;
4279 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4280 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4282 arglist = TREE_CHAIN (arglist);
4283 fn = fn_putchar;
4285 else
4287 /* We can't handle anything else with % args or %% ... yet. */
4288 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4289 return 0;
4291 /* If the resulting constant string has a length of 1, call
4292 putchar. Note, TREE_STRING_LENGTH includes the terminating
4293 NULL in its count. */
4294 if (TREE_STRING_LENGTH (stripped_string) == 2)
4296 /* Given printf("c"), (where c is any one character,)
4297 convert "c"[0] to an int and pass that to the replacement
4298 function. */
4299 arglist = build_int_2 (TREE_STRING_POINTER (stripped_string)[0], 0);
4300 arglist = build_tree_list (NULL_TREE, arglist);
4302 fn = fn_putchar;
4304 /* If the resulting constant was "string\n", call
4305 __builtin_puts("string"). Ensure "string" has at least one
4306 character besides the trailing \n. Note, TREE_STRING_LENGTH
4307 includes the terminating NULL in its count. */
4308 else if (TREE_STRING_LENGTH (stripped_string) > 2
4309 && TREE_STRING_POINTER (stripped_string)
4310 [TREE_STRING_LENGTH (stripped_string) - 2] == '\n')
4312 /* Create a NULL-terminated string that's one char shorter
4313 than the original, stripping off the trailing '\n'. */
4314 const int newlen = TREE_STRING_LENGTH (stripped_string) - 1;
4315 char *newstr = (char *) alloca (newlen);
4316 memcpy (newstr, TREE_STRING_POINTER (stripped_string), newlen - 1);
4317 newstr[newlen - 1] = 0;
4319 arglist = fix_string_type (build_string (newlen, newstr));
4320 arglist = build_tree_list (NULL_TREE, arglist);
4321 fn = fn_puts;
4323 else
4324 /* We'd like to arrange to call fputs(string) here, but we
4325 need stdout and don't have a way to get it ... yet. */
4326 return 0;
4329 return expand_expr (build_function_call (fn, arglist),
4330 (ignore ? const0_rtx : target),
4331 tmode, modifier);
4334 /* If the arguments passed to fprintf are suitable for optimizations,
4335 we attempt to transform the call. */
4336 static rtx
4337 c_expand_builtin_fprintf (tree arglist, rtx target, enum machine_mode tmode,
4338 enum expand_modifier modifier, int ignore,
4339 int unlocked)
4341 tree fn_fputc = unlocked ?
4342 implicit_built_in_decls[BUILT_IN_FPUTC_UNLOCKED] : implicit_built_in_decls[BUILT_IN_FPUTC];
4343 tree fn_fputs = unlocked ?
4344 implicit_built_in_decls[BUILT_IN_FPUTS_UNLOCKED] : implicit_built_in_decls[BUILT_IN_FPUTS];
4345 tree fn, format_arg, stripped_string;
4347 /* If the return value is used, or the replacement _DECL isn't
4348 initialized, don't do the transformation. */
4349 if (!ignore || !fn_fputc || !fn_fputs)
4350 return 0;
4352 /* Verify the required arguments in the original call. */
4353 if (arglist == 0
4354 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE)
4355 || (TREE_CHAIN (arglist) == 0)
4356 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist)))) !=
4357 POINTER_TYPE))
4358 return 0;
4360 /* Check the specifier vs. the parameters. */
4361 if (!is_valid_printf_arglist (TREE_CHAIN (arglist)))
4362 return 0;
4364 format_arg = TREE_VALUE (TREE_CHAIN (arglist));
4365 stripped_string = format_arg;
4366 STRIP_NOPS (stripped_string);
4367 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4368 stripped_string = TREE_OPERAND (stripped_string, 0);
4370 /* If the format specifier isn't a STRING_CST, punt. */
4371 if (TREE_CODE (stripped_string) != STRING_CST)
4372 return 0;
4374 /* OK! We can attempt optimization. */
4376 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4377 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s") == 0)
4379 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4380 arglist = tree_cons (NULL_TREE,
4381 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4382 newarglist);
4383 fn = fn_fputs;
4385 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4386 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4388 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4389 arglist = tree_cons (NULL_TREE,
4390 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4391 newarglist);
4392 fn = fn_fputc;
4394 else
4396 /* We can't handle anything else with % args or %% ... yet. */
4397 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4398 return 0;
4400 /* When "string" doesn't contain %, replace all cases of
4401 fprintf(stream,string) with fputs(string,stream). The fputs
4402 builtin will take take of special cases like length==1. */
4403 arglist = tree_cons (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)),
4404 build_tree_list (NULL_TREE, TREE_VALUE (arglist)));
4405 fn = fn_fputs;
4408 return expand_expr (build_function_call (fn, arglist),
4409 (ignore ? const0_rtx : target),
4410 tmode, modifier);
4414 /* Given a boolean expression ARG, return a tree representing an increment
4415 or decrement (as indicated by CODE) of ARG. The front end must check for
4416 invalid cases (e.g., decrement in C++). */
4417 tree
4418 boolean_increment (enum tree_code code, tree arg)
4420 tree val;
4421 tree true_res = (c_dialect_cxx () ? boolean_true_node : c_bool_true_node);
4423 arg = stabilize_reference (arg);
4424 switch (code)
4426 case PREINCREMENT_EXPR:
4427 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4428 break;
4429 case POSTINCREMENT_EXPR:
4430 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4431 arg = save_expr (arg);
4432 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4433 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4434 break;
4435 case PREDECREMENT_EXPR:
4436 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4437 break;
4438 case POSTDECREMENT_EXPR:
4439 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4440 arg = save_expr (arg);
4441 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4442 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4443 break;
4444 default:
4445 abort ();
4447 TREE_SIDE_EFFECTS (val) = 1;
4448 return val;
4451 /* Built-in macros for stddef.h, that require macros defined in this
4452 file. */
4453 void
4454 c_stddef_cpp_builtins(void)
4456 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
4457 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
4458 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
4459 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
4462 static void
4463 c_init_attributes (void)
4465 /* Fill in the built_in_attributes array. */
4466 #define DEF_ATTR_NULL_TREE(ENUM) \
4467 built_in_attributes[(int) ENUM] = NULL_TREE;
4468 #define DEF_ATTR_INT(ENUM, VALUE) \
4469 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
4470 #define DEF_ATTR_IDENT(ENUM, STRING) \
4471 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4472 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4473 built_in_attributes[(int) ENUM] \
4474 = tree_cons (built_in_attributes[(int) PURPOSE], \
4475 built_in_attributes[(int) VALUE], \
4476 built_in_attributes[(int) CHAIN]);
4477 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) /* No initialization needed. */
4478 #include "builtin-attrs.def"
4479 #undef DEF_ATTR_NULL_TREE
4480 #undef DEF_ATTR_INT
4481 #undef DEF_ATTR_IDENT
4482 #undef DEF_ATTR_TREE_LIST
4483 #undef DEF_FN_ATTR
4484 c_attrs_initialized = true;
4487 /* Depending on the name of DECL, apply default attributes to it. */
4489 void
4490 c_common_insert_default_attributes (tree decl)
4492 tree name = DECL_NAME (decl);
4494 if (!c_attrs_initialized)
4495 c_init_attributes ();
4497 #define DEF_ATTR_NULL_TREE(ENUM) /* Nothing needed after initialization. */
4498 #define DEF_ATTR_INT(ENUM, VALUE)
4499 #define DEF_ATTR_IDENT(ENUM, STRING)
4500 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN)
4501 #define DEF_FN_ATTR(NAME, ATTRS, PREDICATE) \
4502 if ((PREDICATE) && name == built_in_attributes[(int) NAME]) \
4503 decl_attributes (&decl, built_in_attributes[(int) ATTRS], \
4504 ATTR_FLAG_BUILT_IN);
4505 #include "builtin-attrs.def"
4506 #undef DEF_ATTR_NULL_TREE
4507 #undef DEF_ATTR_INT
4508 #undef DEF_ATTR_IDENT
4509 #undef DEF_ATTR_TREE_LIST
4510 #undef DEF_FN_ATTR
4513 /* Output a -Wshadow warning MSGCODE about NAME, and give the location
4514 of the previous declaration DECL. */
4515 void
4516 shadow_warning (enum sw_kind msgcode, const char *name, tree decl)
4518 static const char *const msgs[] = {
4519 /* SW_PARAM */ N_("declaration of \"%s\" shadows a parameter"),
4520 /* SW_LOCAL */ N_("declaration of \"%s\" shadows a previous local"),
4521 /* SW_GLOBAL */ N_("declaration of \"%s\" shadows a global declaration")
4524 warning (msgs[msgcode], name);
4525 warning ("%Hshadowed declaration is here", &DECL_SOURCE_LOCATION (decl));
4528 /* Attribute handlers common to C front ends. */
4530 /* Handle a "packed" attribute; arguments as in
4531 struct attribute_spec.handler. */
4533 static tree
4534 handle_packed_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4535 int flags, bool *no_add_attrs)
4537 tree *type = NULL;
4538 if (DECL_P (*node))
4540 if (TREE_CODE (*node) == TYPE_DECL)
4541 type = &TREE_TYPE (*node);
4543 else
4544 type = node;
4546 if (type)
4548 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4549 *type = build_type_copy (*type);
4550 TYPE_PACKED (*type) = 1;
4552 else if (TREE_CODE (*node) == FIELD_DECL)
4553 DECL_PACKED (*node) = 1;
4554 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4555 used for DECL_REGISTER. It wouldn't mean anything anyway. */
4556 else
4558 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4559 *no_add_attrs = true;
4562 return NULL_TREE;
4565 /* Handle a "nocommon" attribute; arguments as in
4566 struct attribute_spec.handler. */
4568 static tree
4569 handle_nocommon_attribute (tree *node, tree name,
4570 tree args ATTRIBUTE_UNUSED,
4571 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4573 if (TREE_CODE (*node) == VAR_DECL)
4574 DECL_COMMON (*node) = 0;
4575 else
4577 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4578 *no_add_attrs = true;
4581 return NULL_TREE;
4584 /* Handle a "common" attribute; arguments as in
4585 struct attribute_spec.handler. */
4587 static tree
4588 handle_common_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4589 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4591 if (TREE_CODE (*node) == VAR_DECL)
4592 DECL_COMMON (*node) = 1;
4593 else
4595 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4596 *no_add_attrs = true;
4599 return NULL_TREE;
4602 /* Handle a "noreturn" attribute; arguments as in
4603 struct attribute_spec.handler. */
4605 static tree
4606 handle_noreturn_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4607 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4609 tree type = TREE_TYPE (*node);
4611 /* See FIXME comment in c_common_attribute_table. */
4612 if (TREE_CODE (*node) == FUNCTION_DECL)
4613 TREE_THIS_VOLATILE (*node) = 1;
4614 else if (TREE_CODE (type) == POINTER_TYPE
4615 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4616 TREE_TYPE (*node)
4617 = build_pointer_type
4618 (build_type_variant (TREE_TYPE (type),
4619 TREE_READONLY (TREE_TYPE (type)), 1));
4620 else
4622 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4623 *no_add_attrs = true;
4626 return NULL_TREE;
4629 /* Handle a "noinline" attribute; arguments as in
4630 struct attribute_spec.handler. */
4632 static tree
4633 handle_noinline_attribute (tree *node, tree name,
4634 tree args ATTRIBUTE_UNUSED,
4635 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4637 if (TREE_CODE (*node) == FUNCTION_DECL)
4638 DECL_UNINLINABLE (*node) = 1;
4639 else
4641 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4642 *no_add_attrs = true;
4645 return NULL_TREE;
4648 /* Handle a "always_inline" attribute; arguments as in
4649 struct attribute_spec.handler. */
4651 static tree
4652 handle_always_inline_attribute (tree *node, tree name,
4653 tree args ATTRIBUTE_UNUSED,
4654 int flags ATTRIBUTE_UNUSED,
4655 bool *no_add_attrs)
4657 if (TREE_CODE (*node) == FUNCTION_DECL)
4659 /* Do nothing else, just set the attribute. We'll get at
4660 it later with lookup_attribute. */
4662 else
4664 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4665 *no_add_attrs = true;
4668 return NULL_TREE;
4671 /* Handle a "used" attribute; arguments as in
4672 struct attribute_spec.handler. */
4674 static tree
4675 handle_used_attribute (tree *pnode, tree name, tree args ATTRIBUTE_UNUSED,
4676 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4678 tree node = *pnode;
4680 if (TREE_CODE (node) == FUNCTION_DECL
4681 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4683 mark_referenced (DECL_ASSEMBLER_NAME (node));
4684 TREE_USED (node) = 1;
4686 else
4688 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4689 *no_add_attrs = true;
4692 return NULL_TREE;
4695 /* Handle a "unused" attribute; arguments as in
4696 struct attribute_spec.handler. */
4698 static tree
4699 handle_unused_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4700 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4702 if (DECL_P (*node))
4704 tree decl = *node;
4706 if (TREE_CODE (decl) == PARM_DECL
4707 || TREE_CODE (decl) == VAR_DECL
4708 || TREE_CODE (decl) == FUNCTION_DECL
4709 || TREE_CODE (decl) == LABEL_DECL
4710 || TREE_CODE (decl) == TYPE_DECL)
4711 TREE_USED (decl) = 1;
4712 else
4714 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4715 *no_add_attrs = true;
4718 else
4720 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4721 *node = build_type_copy (*node);
4722 TREE_USED (*node) = 1;
4725 return NULL_TREE;
4728 /* Handle a "const" attribute; arguments as in
4729 struct attribute_spec.handler. */
4731 static tree
4732 handle_const_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4733 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4735 tree type = TREE_TYPE (*node);
4737 /* See FIXME comment on noreturn in c_common_attribute_table. */
4738 if (TREE_CODE (*node) == FUNCTION_DECL)
4739 TREE_READONLY (*node) = 1;
4740 else if (TREE_CODE (type) == POINTER_TYPE
4741 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4742 TREE_TYPE (*node)
4743 = build_pointer_type
4744 (build_type_variant (TREE_TYPE (type), 1,
4745 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4746 else
4748 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4749 *no_add_attrs = true;
4752 return NULL_TREE;
4755 /* Handle a "transparent_union" attribute; arguments as in
4756 struct attribute_spec.handler. */
4758 static tree
4759 handle_transparent_union_attribute (tree *node, tree name,
4760 tree args ATTRIBUTE_UNUSED, int flags,
4761 bool *no_add_attrs)
4763 tree decl = NULL_TREE;
4764 tree *type = NULL;
4765 int is_type = 0;
4767 if (DECL_P (*node))
4769 decl = *node;
4770 type = &TREE_TYPE (decl);
4771 is_type = TREE_CODE (*node) == TYPE_DECL;
4773 else if (TYPE_P (*node))
4774 type = node, is_type = 1;
4776 if (is_type
4777 && TREE_CODE (*type) == UNION_TYPE
4778 && (decl == 0
4779 || (TYPE_FIELDS (*type) != 0
4780 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4782 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4783 *type = build_type_copy (*type);
4784 TYPE_TRANSPARENT_UNION (*type) = 1;
4786 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4787 && TREE_CODE (*type) == UNION_TYPE
4788 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4789 DECL_TRANSPARENT_UNION (decl) = 1;
4790 else
4792 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4793 *no_add_attrs = true;
4796 return NULL_TREE;
4799 /* Handle a "constructor" attribute; arguments as in
4800 struct attribute_spec.handler. */
4802 static tree
4803 handle_constructor_attribute (tree *node, tree name,
4804 tree args ATTRIBUTE_UNUSED,
4805 int flags ATTRIBUTE_UNUSED,
4806 bool *no_add_attrs)
4808 tree decl = *node;
4809 tree type = TREE_TYPE (decl);
4811 if (TREE_CODE (decl) == FUNCTION_DECL
4812 && TREE_CODE (type) == FUNCTION_TYPE
4813 && decl_function_context (decl) == 0)
4815 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4816 TREE_USED (decl) = 1;
4818 else
4820 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4821 *no_add_attrs = true;
4824 return NULL_TREE;
4827 /* Handle a "destructor" attribute; arguments as in
4828 struct attribute_spec.handler. */
4830 static tree
4831 handle_destructor_attribute (tree *node, tree name,
4832 tree args ATTRIBUTE_UNUSED,
4833 int flags ATTRIBUTE_UNUSED,
4834 bool *no_add_attrs)
4836 tree decl = *node;
4837 tree type = TREE_TYPE (decl);
4839 if (TREE_CODE (decl) == FUNCTION_DECL
4840 && TREE_CODE (type) == FUNCTION_TYPE
4841 && decl_function_context (decl) == 0)
4843 DECL_STATIC_DESTRUCTOR (decl) = 1;
4844 TREE_USED (decl) = 1;
4846 else
4848 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4849 *no_add_attrs = true;
4852 return NULL_TREE;
4855 /* Handle a "mode" attribute; arguments as in
4856 struct attribute_spec.handler. */
4858 static tree
4859 handle_mode_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
4860 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4862 tree type = *node;
4864 *no_add_attrs = true;
4866 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4867 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4868 else
4870 int j;
4871 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4872 int len = strlen (p);
4873 enum machine_mode mode = VOIDmode;
4874 tree typefm;
4875 tree ptr_type;
4877 if (len > 4 && p[0] == '_' && p[1] == '_'
4878 && p[len - 1] == '_' && p[len - 2] == '_')
4880 char *newp = (char *) alloca (len - 1);
4882 strcpy (newp, &p[2]);
4883 newp[len - 4] = '\0';
4884 p = newp;
4887 /* Change this type to have a type with the specified mode.
4888 First check for the special modes. */
4889 if (! strcmp (p, "byte"))
4890 mode = byte_mode;
4891 else if (!strcmp (p, "word"))
4892 mode = word_mode;
4893 else if (! strcmp (p, "pointer"))
4894 mode = ptr_mode;
4895 else
4896 for (j = 0; j < NUM_MACHINE_MODES; j++)
4897 if (!strcmp (p, GET_MODE_NAME (j)))
4898 mode = (enum machine_mode) j;
4900 if (mode == VOIDmode)
4901 error ("unknown machine mode `%s'", p);
4902 else if (0 == (typefm = (*lang_hooks.types.type_for_mode)
4903 (mode, TREE_UNSIGNED (type))))
4904 error ("no data type for mode `%s'", p);
4905 else if ((TREE_CODE (type) == POINTER_TYPE
4906 || TREE_CODE (type) == REFERENCE_TYPE)
4907 && !(*targetm.valid_pointer_mode) (mode))
4908 error ("invalid pointer mode `%s'", p);
4909 else
4911 /* If this is a vector, make sure we either have hardware
4912 support, or we can emulate it. */
4913 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4915 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4916 return NULL_TREE;
4919 if (TREE_CODE (type) == POINTER_TYPE)
4921 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4922 mode);
4923 *node = ptr_type;
4925 else if (TREE_CODE (type) == REFERENCE_TYPE)
4927 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4928 mode);
4929 *node = ptr_type;
4931 else
4932 *node = typefm;
4933 /* No need to layout the type here. The caller should do this. */
4937 return NULL_TREE;
4940 /* Handle a "section" attribute; arguments as in
4941 struct attribute_spec.handler. */
4943 static tree
4944 handle_section_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4945 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
4947 tree decl = *node;
4949 if (targetm.have_named_sections)
4951 if ((TREE_CODE (decl) == FUNCTION_DECL
4952 || TREE_CODE (decl) == VAR_DECL)
4953 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4955 if (TREE_CODE (decl) == VAR_DECL
4956 && current_function_decl != NULL_TREE
4957 && ! TREE_STATIC (decl))
4959 error_with_decl (decl,
4960 "section attribute cannot be specified for local variables");
4961 *no_add_attrs = true;
4964 /* The decl may have already been given a section attribute
4965 from a previous declaration. Ensure they match. */
4966 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4967 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4968 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4970 error_with_decl (*node,
4971 "section of `%s' conflicts with previous declaration");
4972 *no_add_attrs = true;
4974 else
4975 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4977 else
4979 error_with_decl (*node,
4980 "section attribute not allowed for `%s'");
4981 *no_add_attrs = true;
4984 else
4986 error_with_decl (*node,
4987 "section attributes are not supported for this target");
4988 *no_add_attrs = true;
4991 return NULL_TREE;
4994 /* Handle a "aligned" attribute; arguments as in
4995 struct attribute_spec.handler. */
4997 static tree
4998 handle_aligned_attribute (tree *node, tree name ATTRIBUTE_UNUSED, tree args,
4999 int flags, bool *no_add_attrs)
5001 tree decl = NULL_TREE;
5002 tree *type = NULL;
5003 int is_type = 0;
5004 tree align_expr = (args ? TREE_VALUE (args)
5005 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
5006 int i;
5008 if (DECL_P (*node))
5010 decl = *node;
5011 type = &TREE_TYPE (decl);
5012 is_type = TREE_CODE (*node) == TYPE_DECL;
5014 else if (TYPE_P (*node))
5015 type = node, is_type = 1;
5017 /* Strip any NOPs of any kind. */
5018 while (TREE_CODE (align_expr) == NOP_EXPR
5019 || TREE_CODE (align_expr) == CONVERT_EXPR
5020 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
5021 align_expr = TREE_OPERAND (align_expr, 0);
5023 if (TREE_CODE (align_expr) != INTEGER_CST)
5025 error ("requested alignment is not a constant");
5026 *no_add_attrs = true;
5028 else if ((i = tree_log2 (align_expr)) == -1)
5030 error ("requested alignment is not a power of 2");
5031 *no_add_attrs = true;
5033 else if (i > HOST_BITS_PER_INT - 2)
5035 error ("requested alignment is too large");
5036 *no_add_attrs = true;
5038 else if (is_type)
5040 /* If we have a TYPE_DECL, then copy the type, so that we
5041 don't accidentally modify a builtin type. See pushdecl. */
5042 if (decl && TREE_TYPE (decl) != error_mark_node
5043 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
5045 tree tt = TREE_TYPE (decl);
5046 *type = build_type_copy (*type);
5047 DECL_ORIGINAL_TYPE (decl) = tt;
5048 TYPE_NAME (*type) = decl;
5049 TREE_USED (*type) = TREE_USED (decl);
5050 TREE_TYPE (decl) = *type;
5052 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5053 *type = build_type_copy (*type);
5055 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
5056 TYPE_USER_ALIGN (*type) = 1;
5058 else if (TREE_CODE (decl) != VAR_DECL
5059 && TREE_CODE (decl) != FIELD_DECL)
5061 error_with_decl (decl,
5062 "alignment may not be specified for `%s'");
5063 *no_add_attrs = true;
5065 else
5067 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
5068 DECL_USER_ALIGN (decl) = 1;
5071 return NULL_TREE;
5074 /* Handle a "weak" attribute; arguments as in
5075 struct attribute_spec.handler. */
5077 static tree
5078 handle_weak_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5079 tree args ATTRIBUTE_UNUSED,
5080 int flags ATTRIBUTE_UNUSED,
5081 bool *no_add_attrs ATTRIBUTE_UNUSED)
5083 declare_weak (*node);
5085 return NULL_TREE;
5088 /* Handle an "alias" attribute; arguments as in
5089 struct attribute_spec.handler. */
5091 static tree
5092 handle_alias_attribute (tree *node, tree name, tree args,
5093 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5095 tree decl = *node;
5097 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
5098 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
5100 error_with_decl (decl,
5101 "`%s' defined both normally and as an alias");
5102 *no_add_attrs = true;
5104 else if (decl_function_context (decl) == 0)
5106 tree id;
5108 id = TREE_VALUE (args);
5109 if (TREE_CODE (id) != STRING_CST)
5111 error ("alias arg not a string");
5112 *no_add_attrs = true;
5113 return NULL_TREE;
5115 id = get_identifier (TREE_STRING_POINTER (id));
5116 /* This counts as a use of the object pointed to. */
5117 TREE_USED (id) = 1;
5119 if (TREE_CODE (decl) == FUNCTION_DECL)
5120 DECL_INITIAL (decl) = error_mark_node;
5121 else
5122 DECL_EXTERNAL (decl) = 0;
5124 else
5126 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5127 *no_add_attrs = true;
5130 return NULL_TREE;
5133 /* Handle an "visibility" attribute; arguments as in
5134 struct attribute_spec.handler. */
5136 static tree
5137 handle_visibility_attribute (tree *node, tree name, tree args,
5138 int flags ATTRIBUTE_UNUSED,
5139 bool *no_add_attrs)
5141 tree decl = *node;
5143 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
5145 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5146 *no_add_attrs = true;
5148 else
5150 tree id;
5152 id = TREE_VALUE (args);
5153 if (TREE_CODE (id) != STRING_CST)
5155 error ("visibility arg not a string");
5156 *no_add_attrs = true;
5157 return NULL_TREE;
5159 if (strcmp (TREE_STRING_POINTER (id), "hidden")
5160 && strcmp (TREE_STRING_POINTER (id), "protected")
5161 && strcmp (TREE_STRING_POINTER (id), "internal")
5162 && strcmp (TREE_STRING_POINTER (id), "default"))
5164 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5165 *no_add_attrs = true;
5166 return NULL_TREE;
5170 return NULL_TREE;
5173 /* Handle an "tls_model" attribute; arguments as in
5174 struct attribute_spec.handler. */
5176 static tree
5177 handle_tls_model_attribute (tree *node, tree name, tree args,
5178 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5180 tree decl = *node;
5182 if (! DECL_THREAD_LOCAL (decl))
5184 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5185 *no_add_attrs = true;
5187 else
5189 tree id;
5191 id = TREE_VALUE (args);
5192 if (TREE_CODE (id) != STRING_CST)
5194 error ("tls_model arg not a string");
5195 *no_add_attrs = true;
5196 return NULL_TREE;
5198 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
5199 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
5200 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
5201 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
5203 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5204 *no_add_attrs = true;
5205 return NULL_TREE;
5209 return NULL_TREE;
5212 /* Handle a "no_instrument_function" attribute; arguments as in
5213 struct attribute_spec.handler. */
5215 static tree
5216 handle_no_instrument_function_attribute (tree *node, tree name,
5217 tree args ATTRIBUTE_UNUSED,
5218 int flags ATTRIBUTE_UNUSED,
5219 bool *no_add_attrs)
5221 tree decl = *node;
5223 if (TREE_CODE (decl) != FUNCTION_DECL)
5225 error_with_decl (decl,
5226 "`%s' attribute applies only to functions",
5227 IDENTIFIER_POINTER (name));
5228 *no_add_attrs = true;
5230 else if (DECL_INITIAL (decl))
5232 error_with_decl (decl,
5233 "can't set `%s' attribute after definition",
5234 IDENTIFIER_POINTER (name));
5235 *no_add_attrs = true;
5237 else
5238 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
5240 return NULL_TREE;
5243 /* Handle a "malloc" attribute; arguments as in
5244 struct attribute_spec.handler. */
5246 static tree
5247 handle_malloc_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5248 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5250 if (TREE_CODE (*node) == FUNCTION_DECL)
5251 DECL_IS_MALLOC (*node) = 1;
5252 /* ??? TODO: Support types. */
5253 else
5255 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5256 *no_add_attrs = true;
5259 return NULL_TREE;
5262 /* Handle a "no_limit_stack" attribute; arguments as in
5263 struct attribute_spec.handler. */
5265 static tree
5266 handle_no_limit_stack_attribute (tree *node, tree name,
5267 tree args ATTRIBUTE_UNUSED,
5268 int flags ATTRIBUTE_UNUSED,
5269 bool *no_add_attrs)
5271 tree decl = *node;
5273 if (TREE_CODE (decl) != FUNCTION_DECL)
5275 error_with_decl (decl,
5276 "`%s' attribute applies only to functions",
5277 IDENTIFIER_POINTER (name));
5278 *no_add_attrs = true;
5280 else if (DECL_INITIAL (decl))
5282 error_with_decl (decl,
5283 "can't set `%s' attribute after definition",
5284 IDENTIFIER_POINTER (name));
5285 *no_add_attrs = true;
5287 else
5288 DECL_NO_LIMIT_STACK (decl) = 1;
5290 return NULL_TREE;
5293 /* Handle a "pure" attribute; arguments as in
5294 struct attribute_spec.handler. */
5296 static tree
5297 handle_pure_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5298 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5300 if (TREE_CODE (*node) == FUNCTION_DECL)
5301 DECL_IS_PURE (*node) = 1;
5302 /* ??? TODO: Support types. */
5303 else
5305 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5306 *no_add_attrs = true;
5309 return NULL_TREE;
5312 /* Handle a "deprecated" attribute; arguments as in
5313 struct attribute_spec.handler. */
5315 static tree
5316 handle_deprecated_attribute (tree *node, tree name,
5317 tree args ATTRIBUTE_UNUSED, int flags,
5318 bool *no_add_attrs)
5320 tree type = NULL_TREE;
5321 int warn = 0;
5322 const char *what = NULL;
5324 if (DECL_P (*node))
5326 tree decl = *node;
5327 type = TREE_TYPE (decl);
5329 if (TREE_CODE (decl) == TYPE_DECL
5330 || TREE_CODE (decl) == PARM_DECL
5331 || TREE_CODE (decl) == VAR_DECL
5332 || TREE_CODE (decl) == FUNCTION_DECL
5333 || TREE_CODE (decl) == FIELD_DECL)
5334 TREE_DEPRECATED (decl) = 1;
5335 else
5336 warn = 1;
5338 else if (TYPE_P (*node))
5340 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
5341 *node = build_type_copy (*node);
5342 TREE_DEPRECATED (*node) = 1;
5343 type = *node;
5345 else
5346 warn = 1;
5348 if (warn)
5350 *no_add_attrs = true;
5351 if (type && TYPE_NAME (type))
5353 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
5354 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
5355 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
5356 && DECL_NAME (TYPE_NAME (type)))
5357 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
5359 if (what)
5360 warning ("`%s' attribute ignored for `%s'",
5361 IDENTIFIER_POINTER (name), what);
5362 else
5363 warning ("`%s' attribute ignored",
5364 IDENTIFIER_POINTER (name));
5367 return NULL_TREE;
5370 /* Keep a list of vector type nodes we created in handle_vector_size_attribute,
5371 to prevent us from duplicating type nodes unnecessarily.
5372 The normal mechanism to prevent duplicates is to use type_hash_canon, but
5373 since we want to distinguish types that are essentially identical (except
5374 for their debug representation), we use a local list here. */
5375 static GTY(()) tree vector_type_node_list = 0;
5377 /* Handle a "vector_size" attribute; arguments as in
5378 struct attribute_spec.handler. */
5380 static tree
5381 handle_vector_size_attribute (tree *node, tree name, tree args,
5382 int flags ATTRIBUTE_UNUSED,
5383 bool *no_add_attrs)
5385 unsigned HOST_WIDE_INT vecsize, nunits;
5386 enum machine_mode mode, orig_mode, new_mode;
5387 tree type = *node, new_type = NULL_TREE;
5388 tree type_list_node;
5390 *no_add_attrs = true;
5392 if (! host_integerp (TREE_VALUE (args), 1))
5394 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5395 return NULL_TREE;
5398 /* Get the vector size (in bytes). */
5399 vecsize = tree_low_cst (TREE_VALUE (args), 1);
5401 /* We need to provide for vector pointers, vector arrays, and
5402 functions returning vectors. For example:
5404 __attribute__((vector_size(16))) short *foo;
5406 In this case, the mode is SI, but the type being modified is
5407 HI, so we need to look further. */
5409 while (POINTER_TYPE_P (type)
5410 || TREE_CODE (type) == FUNCTION_TYPE
5411 || TREE_CODE (type) == ARRAY_TYPE)
5412 type = TREE_TYPE (type);
5414 /* Get the mode of the type being modified. */
5415 orig_mode = TYPE_MODE (type);
5417 if (TREE_CODE (type) == RECORD_TYPE
5418 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
5419 && GET_MODE_CLASS (orig_mode) != MODE_INT)
5420 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
5422 error ("invalid vector type for attribute `%s'",
5423 IDENTIFIER_POINTER (name));
5424 return NULL_TREE;
5427 /* Calculate how many units fit in the vector. */
5428 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
5430 /* Find a suitably sized vector. */
5431 new_mode = VOIDmode;
5432 for (mode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_mode) == MODE_INT
5433 ? MODE_VECTOR_INT
5434 : MODE_VECTOR_FLOAT);
5435 mode != VOIDmode;
5436 mode = GET_MODE_WIDER_MODE (mode))
5437 if (vecsize == GET_MODE_SIZE (mode)
5438 && nunits == (unsigned HOST_WIDE_INT) GET_MODE_NUNITS (mode))
5440 new_mode = mode;
5441 break;
5444 if (new_mode == VOIDmode)
5446 error ("no vector mode with the size and type specified could be found");
5447 return NULL_TREE;
5450 for (type_list_node = vector_type_node_list; type_list_node;
5451 type_list_node = TREE_CHAIN (type_list_node))
5453 tree other_type = TREE_VALUE (type_list_node);
5454 tree record = TYPE_DEBUG_REPRESENTATION_TYPE (other_type);
5455 tree fields = TYPE_FIELDS (record);
5456 tree field_type = TREE_TYPE (fields);
5457 tree array_type = TREE_TYPE (field_type);
5458 if (TREE_CODE (fields) != FIELD_DECL
5459 || TREE_CODE (field_type) != ARRAY_TYPE)
5460 abort ();
5462 if (TYPE_MODE (other_type) == mode && type == array_type)
5464 new_type = other_type;
5465 break;
5469 if (new_type == NULL_TREE)
5471 tree index, array, rt, list_node;
5473 new_type = (*lang_hooks.types.type_for_mode) (new_mode,
5474 TREE_UNSIGNED (type));
5476 if (!new_type)
5478 error ("no vector mode with the size and type specified could be found");
5479 return NULL_TREE;
5482 new_type = build_type_copy (new_type);
5484 /* If this is a vector, make sure we either have hardware
5485 support, or we can emulate it. */
5486 if ((GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5487 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5488 && !vector_mode_valid_p (mode))
5490 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
5491 return NULL_TREE;
5494 /* Set the debug information here, because this is the only
5495 place where we know the underlying type for a vector made
5496 with vector_size. For debugging purposes we pretend a vector
5497 is an array within a structure. */
5498 index = build_int_2 (TYPE_VECTOR_SUBPARTS (new_type) - 1, 0);
5499 array = build_array_type (type, build_index_type (index));
5500 rt = make_node (RECORD_TYPE);
5502 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5503 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5504 layout_type (rt);
5505 TYPE_DEBUG_REPRESENTATION_TYPE (new_type) = rt;
5507 list_node = build_tree_list (NULL, new_type);
5508 TREE_CHAIN (list_node) = vector_type_node_list;
5509 vector_type_node_list = list_node;
5512 /* Build back pointers if needed. */
5513 *node = vector_size_helper (*node, new_type);
5515 return NULL_TREE;
5518 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5519 better way.
5521 If we requested a pointer to a vector, build up the pointers that
5522 we stripped off while looking for the inner type. Similarly for
5523 return values from functions.
5525 The argument "type" is the top of the chain, and "bottom" is the
5526 new type which we will point to. */
5528 static tree
5529 vector_size_helper (tree type, tree bottom)
5531 tree inner, outer;
5533 if (POINTER_TYPE_P (type))
5535 inner = vector_size_helper (TREE_TYPE (type), bottom);
5536 outer = build_pointer_type (inner);
5538 else if (TREE_CODE (type) == ARRAY_TYPE)
5540 inner = vector_size_helper (TREE_TYPE (type), bottom);
5541 outer = build_array_type (inner, TYPE_VALUES (type));
5543 else if (TREE_CODE (type) == FUNCTION_TYPE)
5545 inner = vector_size_helper (TREE_TYPE (type), bottom);
5546 outer = build_function_type (inner, TYPE_VALUES (type));
5548 else
5549 return bottom;
5551 TREE_READONLY (outer) = TREE_READONLY (type);
5552 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5554 return outer;
5557 /* Handle the "nonnull" attribute. */
5558 static tree
5559 handle_nonnull_attribute (tree *node, tree name ATTRIBUTE_UNUSED,
5560 tree args, int flags ATTRIBUTE_UNUSED,
5561 bool *no_add_attrs)
5563 tree type = *node;
5564 unsigned HOST_WIDE_INT attr_arg_num;
5566 /* If no arguments are specified, all pointer arguments should be
5567 non-null. Verify a full prototype is given so that the arguments
5568 will have the correct types when we actually check them later. */
5569 if (! args)
5571 if (! TYPE_ARG_TYPES (type))
5573 error ("nonnull attribute without arguments on a non-prototype");
5574 *no_add_attrs = true;
5576 return NULL_TREE;
5579 /* Argument list specified. Verify that each argument number references
5580 a pointer argument. */
5581 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
5583 tree argument;
5584 unsigned HOST_WIDE_INT arg_num, ck_num;
5586 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5588 error ("nonnull argument has invalid operand number (arg %lu)",
5589 (unsigned long) attr_arg_num);
5590 *no_add_attrs = true;
5591 return NULL_TREE;
5594 argument = TYPE_ARG_TYPES (type);
5595 if (argument)
5597 for (ck_num = 1; ; ck_num++)
5599 if (! argument || ck_num == arg_num)
5600 break;
5601 argument = TREE_CHAIN (argument);
5604 if (! argument
5605 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
5607 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
5608 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5609 *no_add_attrs = true;
5610 return NULL_TREE;
5613 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
5615 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
5616 (unsigned long) attr_arg_num, (unsigned long) arg_num);
5617 *no_add_attrs = true;
5618 return NULL_TREE;
5623 return NULL_TREE;
5626 /* Check the argument list of a function call for null in argument slots
5627 that are marked as requiring a non-null pointer argument. */
5629 static void
5630 check_function_nonnull (tree attrs, tree params)
5632 tree a, args, param;
5633 int param_num;
5635 for (a = attrs; a; a = TREE_CHAIN (a))
5637 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5639 args = TREE_VALUE (a);
5641 /* Walk the argument list. If we encounter an argument number we
5642 should check for non-null, do it. If the attribute has no args,
5643 then every pointer argument is checked (in which case the check
5644 for pointer type is done in check_nonnull_arg). */
5645 for (param = params, param_num = 1; ;
5646 param_num++, param = TREE_CHAIN (param))
5648 if (! param)
5649 break;
5650 if (! args || nonnull_check_p (args, param_num))
5651 check_function_arguments_recurse (check_nonnull_arg, NULL,
5652 TREE_VALUE (param),
5653 param_num);
5659 /* Helper for check_function_nonnull; given a list of operands which
5660 must be non-null in ARGS, determine if operand PARAM_NUM should be
5661 checked. */
5663 static bool
5664 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5666 unsigned HOST_WIDE_INT arg_num;
5668 for (; args; args = TREE_CHAIN (args))
5670 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5671 abort ();
5673 if (arg_num == param_num)
5674 return true;
5676 return false;
5679 /* Check that the function argument PARAM (which is operand number
5680 PARAM_NUM) is non-null. This is called by check_function_nonnull
5681 via check_function_arguments_recurse. */
5683 static void
5684 check_nonnull_arg (void *ctx ATTRIBUTE_UNUSED, tree param,
5685 unsigned HOST_WIDE_INT param_num)
5687 /* Just skip checking the argument if it's not a pointer. This can
5688 happen if the "nonnull" attribute was given without an operand
5689 list (which means to check every pointer argument). */
5691 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5692 return;
5694 if (integer_zerop (param))
5695 warning ("null argument where non-null required (arg %lu)",
5696 (unsigned long) param_num);
5699 /* Helper for nonnull attribute handling; fetch the operand number
5700 from the attribute argument list. */
5702 static bool
5703 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5705 /* Strip any conversions from the arg number and verify they
5706 are constants. */
5707 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5708 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5709 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5710 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5712 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5713 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5714 return false;
5716 *valp = TREE_INT_CST_LOW (arg_num_expr);
5717 return true;
5720 /* Handle a "nothrow" attribute; arguments as in
5721 struct attribute_spec.handler. */
5723 static tree
5724 handle_nothrow_attribute (tree *node, tree name, tree args ATTRIBUTE_UNUSED,
5725 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5727 if (TREE_CODE (*node) == FUNCTION_DECL)
5728 TREE_NOTHROW (*node) = 1;
5729 /* ??? TODO: Support types. */
5730 else
5732 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5733 *no_add_attrs = true;
5736 return NULL_TREE;
5739 /* Handle a "cleanup" attribute; arguments as in
5740 struct attribute_spec.handler. */
5742 static tree
5743 handle_cleanup_attribute (tree *node, tree name, tree args,
5744 int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)
5746 tree decl = *node;
5747 tree cleanup_id, cleanup_decl;
5749 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5750 for global destructors in C++. This requires infrastructure that
5751 we don't have generically at the moment. It's also not a feature
5752 we'd be missing too much, since we do have attribute constructor. */
5753 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5755 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5756 *no_add_attrs = true;
5757 return NULL_TREE;
5760 /* Verify that the argument is a function in scope. */
5761 /* ??? We could support pointers to functions here as well, if
5762 that was considered desirable. */
5763 cleanup_id = TREE_VALUE (args);
5764 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5766 error ("cleanup arg not an identifier");
5767 *no_add_attrs = true;
5768 return NULL_TREE;
5770 cleanup_decl = lookup_name (cleanup_id);
5771 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5773 error ("cleanup arg not a function");
5774 *no_add_attrs = true;
5775 return NULL_TREE;
5778 /* That the function has proper type is checked with the
5779 eventual call to build_function_call. */
5781 return NULL_TREE;
5784 /* Check for valid arguments being passed to a function. */
5785 void
5786 check_function_arguments (tree attrs, tree params)
5788 /* Check for null being passed in a pointer argument that must be
5789 non-null. We also need to do this if format checking is enabled. */
5791 if (warn_nonnull)
5792 check_function_nonnull (attrs, params);
5794 /* Check for errors in format strings. */
5796 if (warn_format)
5797 check_function_format (NULL, attrs, params);
5800 /* Generic argument checking recursion routine. PARAM is the argument to
5801 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5802 once the argument is resolved. CTX is context for the callback. */
5803 void
5804 check_function_arguments_recurse (void (*callback)
5805 (void *, tree, unsigned HOST_WIDE_INT),
5806 void *ctx, tree param,
5807 unsigned HOST_WIDE_INT param_num)
5809 if (TREE_CODE (param) == NOP_EXPR)
5811 /* Strip coercion. */
5812 check_function_arguments_recurse (callback, ctx,
5813 TREE_OPERAND (param, 0), param_num);
5814 return;
5817 if (TREE_CODE (param) == CALL_EXPR)
5819 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5820 tree attrs;
5821 bool found_format_arg = false;
5823 /* See if this is a call to a known internationalization function
5824 that modifies a format arg. Such a function may have multiple
5825 format_arg attributes (for example, ngettext). */
5827 for (attrs = TYPE_ATTRIBUTES (type);
5828 attrs;
5829 attrs = TREE_CHAIN (attrs))
5830 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5832 tree inner_args;
5833 tree format_num_expr;
5834 int format_num;
5835 int i;
5837 /* Extract the argument number, which was previously checked
5838 to be valid. */
5839 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5840 while (TREE_CODE (format_num_expr) == NOP_EXPR
5841 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5842 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5843 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5845 if (TREE_CODE (format_num_expr) != INTEGER_CST
5846 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5847 abort ();
5849 format_num = TREE_INT_CST_LOW (format_num_expr);
5851 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5852 inner_args != 0;
5853 inner_args = TREE_CHAIN (inner_args), i++)
5854 if (i == format_num)
5856 check_function_arguments_recurse (callback, ctx,
5857 TREE_VALUE (inner_args),
5858 param_num);
5859 found_format_arg = true;
5860 break;
5864 /* If we found a format_arg attribute and did a recursive check,
5865 we are done with checking this argument. Otherwise, we continue
5866 and this will be considered a non-literal. */
5867 if (found_format_arg)
5868 return;
5871 if (TREE_CODE (param) == COND_EXPR)
5873 /* Check both halves of the conditional expression. */
5874 check_function_arguments_recurse (callback, ctx,
5875 TREE_OPERAND (param, 1), param_num);
5876 check_function_arguments_recurse (callback, ctx,
5877 TREE_OPERAND (param, 2), param_num);
5878 return;
5881 (*callback) (ctx, param, param_num);
5884 #include "gt-c-common.h"