1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
49 cpp_reader *parse_in; /* Declared in c-pragma.h. */
51 /* We let tm.h override the types used here, to handle trivial differences
52 such as the choice of unsigned int or long unsigned int for size_t.
53 When machines start needing nontrivial differences in the size type,
54 it would be best to do something here to figure out automatically
55 from other information what type to use. */
58 #define SIZE_TYPE "long unsigned int"
62 #define PID_TYPE "int"
66 #define WCHAR_TYPE "int"
69 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
70 #define MODIFIED_WCHAR_TYPE \
71 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
74 #define PTRDIFF_TYPE "long int"
78 #define WINT_TYPE "unsigned int"
82 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
84 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
90 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
92 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
93 ? "long unsigned int" \
94 : "long long unsigned int"))
97 /* The following symbols are subsumed in the c_global_trees array, and
98 listed here individually for documentation purposes.
100 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
102 tree short_integer_type_node;
103 tree long_integer_type_node;
104 tree long_long_integer_type_node;
106 tree short_unsigned_type_node;
107 tree long_unsigned_type_node;
108 tree long_long_unsigned_type_node;
110 tree truthvalue_type_node;
111 tree truthvalue_false_node;
112 tree truthvalue_true_node;
114 tree ptrdiff_type_node;
116 tree unsigned_char_type_node;
117 tree signed_char_type_node;
118 tree wchar_type_node;
119 tree signed_wchar_type_node;
120 tree unsigned_wchar_type_node;
122 tree float_type_node;
123 tree double_type_node;
124 tree long_double_type_node;
126 tree complex_integer_type_node;
127 tree complex_float_type_node;
128 tree complex_double_type_node;
129 tree complex_long_double_type_node;
131 tree intQI_type_node;
132 tree intHI_type_node;
133 tree intSI_type_node;
134 tree intDI_type_node;
135 tree intTI_type_node;
137 tree unsigned_intQI_type_node;
138 tree unsigned_intHI_type_node;
139 tree unsigned_intSI_type_node;
140 tree unsigned_intDI_type_node;
141 tree unsigned_intTI_type_node;
143 tree widest_integer_literal_type_node;
144 tree widest_unsigned_literal_type_node;
146 Nodes for types `void *' and `const void *'.
148 tree ptr_type_node, const_ptr_type_node;
150 Nodes for types `char *' and `const char *'.
152 tree string_type_node, const_string_type_node;
154 Type `char[SOMENUMBER]'.
155 Used when an array of char is needed and the size is irrelevant.
157 tree char_array_type_node;
159 Type `int[SOMENUMBER]' or something like it.
160 Used when an array of int needed and the size is irrelevant.
162 tree int_array_type_node;
164 Type `wchar_t[SOMENUMBER]' or something like it.
165 Used when a wide string literal is created.
167 tree wchar_array_type_node;
169 Type `int ()' -- used for implicit declaration of functions.
171 tree default_function_type;
173 A VOID_TYPE node, packaged in a TREE_LIST.
177 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
178 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
179 VAR_DECLS, but C++ does.)
181 tree function_name_decl_node;
182 tree pretty_function_name_decl_node;
183 tree c99_function_name_decl_node;
185 Stack of nested function name VAR_DECLs.
187 tree saved_function_name_decls;
191 tree c_global_trees[CTI_MAX];
193 /* TRUE if a code represents a statement. The front end init
194 langhook should take care of initialization of this array. */
196 bool statement_code_p[MAX_TREE_CODES];
198 /* Switches common to the C front ends. */
200 /* Nonzero if prepreprocessing only. */
202 int flag_preprocess_only;
204 /* Nonzero means don't output line number information. */
206 char flag_no_line_commands;
208 /* Nonzero causes -E output not to be done, but directives such as
209 #define that have side effects are still obeyed. */
213 /* Nonzero means dump macros in some fashion. */
215 char flag_dump_macros;
217 /* Nonzero means pass #include lines through to the output. */
219 char flag_dump_includes;
221 /* Nonzero means process PCH files while preprocessing. */
223 bool flag_pch_preprocess;
225 /* The file name to which we should write a precompiled header, or
226 NULL if no header will be written in this compile. */
228 const char *pch_file;
230 /* Nonzero if an ISO standard was selected. It rejects macros in the
234 /* Nonzero if -undef was given. It suppresses target built-in macros
238 /* Nonzero means don't recognize the non-ANSI builtin functions. */
242 /* Nonzero means don't recognize the non-ANSI builtin functions.
245 int flag_no_nonansi_builtin;
247 /* Nonzero means give `double' the same size as `float'. */
249 int flag_short_double;
251 /* Nonzero means give `wchar_t' the same size as `short'. */
253 int flag_short_wchar;
255 /* Nonzero means allow Microsoft extensions without warnings or errors. */
256 int flag_ms_extensions;
258 /* Nonzero means don't recognize the keyword `asm'. */
262 /* Nonzero means give string constants the type `const char *', as mandated
265 int flag_const_strings;
267 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
269 int flag_signed_bitfields = 1;
270 int explicit_flag_signed_bitfields;
272 /* Nonzero means warn about deprecated conversion from string constant to
275 int warn_write_strings;
277 /* Warn about #pragma directives that are not recognized. */
279 int warn_unknown_pragmas; /* Tri state variable. */
281 /* Warn about format/argument anomalies in calls to formatted I/O functions
282 (*printf, *scanf, strftime, strfmon, etc.). */
286 /* Zero means that faster, ...NonNil variants of objc_msgSend...
287 calls will be used in ObjC; passing nil receivers to such calls
288 will most likely result in crashes. */
289 int flag_nil_receivers = 1;
291 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
292 @try, etc.) in source code. */
293 int flag_objc_exceptions = 0;
295 /* Nonzero means that we generate NeXT setjmp based exceptions. */
296 int flag_objc_sjlj_exceptions = -1;
298 /* Nonzero means that code generation will be altered to support
299 "zero-link" execution. This currently affects ObjC only, but may
300 affect other languages in the future. */
301 int flag_zero_link = 0;
303 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
304 unit. It will inform the ObjC runtime that class definition(s) herein
305 contained are to replace one(s) previously loaded. */
306 int flag_replace_objc_classes = 0;
308 /* C/ObjC language option variables. */
311 /* Nonzero means allow type mismatches in conditional expressions;
312 just make their values `void'. */
314 int flag_cond_mismatch;
316 /* Nonzero means enable C89 Amendment 1 features. */
320 /* Nonzero means use the ISO C99 dialect of C. */
324 /* Nonzero means that we have builtin functions, and main is an int. */
328 /* Warn if main is suspicious. */
333 /* ObjC language option variables. */
336 /* Open and close the file for outputting class declarations, if
339 int flag_gen_declaration;
341 /* Generate code for GNU or NeXT runtime environment. */
343 #ifdef NEXT_OBJC_RUNTIME
344 int flag_next_runtime = 1;
346 int flag_next_runtime = 0;
349 /* Tells the compiler that this is a special run. Do not perform any
350 compiling, instead we are to test some platform dependent features
351 and output a C header file with appropriate definitions. */
353 int print_struct_values;
355 /* ???. Undocumented. */
357 const char *constant_string_class_name;
360 /* C++ language option variables. */
363 /* Nonzero means don't recognize any extension keywords. */
365 int flag_no_gnu_keywords;
367 /* Nonzero means do emit exported implementations of functions even if
368 they can be inlined. */
370 int flag_implement_inlines = 1;
372 /* Nonzero means that implicit instantiations will be emitted if needed. */
374 int flag_implicit_templates = 1;
376 /* Nonzero means that implicit instantiations of inline templates will be
377 emitted if needed, even if instantiations of non-inline templates
380 int flag_implicit_inline_templates = 1;
382 /* Nonzero means generate separate instantiation control files and
383 juggle them at link time. */
385 int flag_use_repository;
387 /* Nonzero if we want to issue diagnostics that the standard says are not
390 int flag_optional_diags = 1;
392 /* Nonzero means we should attempt to elide constructors when possible. */
394 int flag_elide_constructors = 1;
396 /* Nonzero means that member functions defined in class scope are
397 inline by default. */
399 int flag_default_inline = 1;
401 /* Controls whether compiler generates 'type descriptor' that give
402 run-time type information. */
406 /* Nonzero if we want to conserve space in the .o files. We do this
407 by putting uninitialized data and runtime initialized data into
408 .common instead of .data at the expense of not flagging multiple
411 int flag_conserve_space;
413 /* Nonzero if we want to obey access control semantics. */
415 int flag_access_control = 1;
417 /* Nonzero if we want to check the return value of new and avoid calling
418 constructors if it is a null pointer. */
422 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
423 initialization variables.
424 0: Old rules, set by -fno-for-scope.
425 2: New ISO rules, set by -ffor-scope.
426 1: Try to implement new ISO rules, but with backup compatibility
427 (and warnings). This is the default, for now. */
429 int flag_new_for_scope = 1;
431 /* Nonzero if we want to emit defined symbols with common-like linkage as
432 weak symbols where possible, in order to conform to C++ semantics.
433 Otherwise, emit them as local symbols. */
437 /* 0 means we want the preprocessor to not emit line directives for
438 the current working directory. 1 means we want it to do it. -1
439 means we should decide depending on whether debugging information
440 is being emitted or not. */
442 int flag_working_directory = -1;
444 /* Nonzero to use __cxa_atexit, rather than atexit, to register
445 destructors for local statics and global objects. */
447 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
449 /* Nonzero means make the default pedwarns warnings instead of errors.
450 The value of this flag is ignored if -pedantic is specified. */
454 /* Nonzero means to implement standard semantics for exception
455 specifications, calling unexpected if an exception is thrown that
456 doesn't match the specification. Zero means to treat them as
457 assertions and optimize accordingly, but not check them. */
459 int flag_enforce_eh_specs = 1;
461 /* Nonzero means warn about implicit declarations. */
463 int warn_implicit = 1;
465 /* Maximum template instantiation depth. This limit is rather
466 arbitrary, but it exists to limit the time it takes to notice
467 infinite template instantiations. */
469 int max_tinst_depth = 500;
473 /* The elements of `ridpointers' are identifier nodes for the reserved
474 type names and storage classes. It is indexed by a RID_... value. */
477 tree (*make_fname_decl) (tree, int);
479 /* If non-NULL, the address of a language-specific function that
480 returns 1 for language-specific statement codes. */
481 int (*lang_statement_code_p) (enum tree_code);
483 /* If non-NULL, the address of a language-specific function that takes
484 any action required right before expand_function_end is called. */
485 void (*lang_expand_function_end) (void);
487 /* Nonzero means the expression being parsed will never be evaluated.
488 This is a count, since unevaluated expressions can nest. */
491 /* Information about how a function name is generated. */
494 tree *const decl; /* pointer to the VAR_DECL. */
495 const unsigned rid; /* RID number for the identifier. */
496 const int pretty; /* How pretty is it? */
499 /* The three ways of getting then name of the current function. */
501 const struct fname_var_t fname_vars[] =
503 /* C99 compliant __func__, must be first. */
504 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
505 /* GCC __FUNCTION__ compliant. */
506 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
507 /* GCC __PRETTY_FUNCTION__ compliant. */
508 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
512 static int constant_fits_type_p (tree, tree);
513 static tree check_case_value (tree);
514 static bool check_case_bounds (tree, tree, tree *, tree *);
516 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
517 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
518 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
519 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
520 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
521 static tree handle_always_inline_attribute (tree *, tree, tree, int,
523 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_transparent_union_attribute (tree *, tree, tree,
528 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
532 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
534 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
535 static tree handle_visibility_attribute (tree *, tree, tree, int,
537 static tree handle_tls_model_attribute (tree *, tree, tree, int,
539 static tree handle_no_instrument_function_attribute (tree *, tree,
541 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
542 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
544 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
545 static tree handle_deprecated_attribute (tree *, tree, tree, int,
547 static tree handle_vector_size_attribute (tree *, tree, tree, int,
549 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
550 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
551 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
552 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
555 static void check_function_nonnull (tree, tree);
556 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
557 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
558 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
559 static int resort_field_decl_cmp (const void *, const void *);
561 /* Table of machine-independent attributes common to all C-like languages. */
562 const struct attribute_spec c_common_attribute_table[] =
564 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
565 { "packed", 0, 0, false, false, false,
566 handle_packed_attribute },
567 { "nocommon", 0, 0, true, false, false,
568 handle_nocommon_attribute },
569 { "common", 0, 0, true, false, false,
570 handle_common_attribute },
571 /* FIXME: logically, noreturn attributes should be listed as
572 "false, true, true" and apply to function types. But implementing this
573 would require all the places in the compiler that use TREE_THIS_VOLATILE
574 on a decl to identify non-returning functions to be located and fixed
575 to check the function type instead. */
576 { "noreturn", 0, 0, true, false, false,
577 handle_noreturn_attribute },
578 { "volatile", 0, 0, true, false, false,
579 handle_noreturn_attribute },
580 { "noinline", 0, 0, true, false, false,
581 handle_noinline_attribute },
582 { "always_inline", 0, 0, true, false, false,
583 handle_always_inline_attribute },
584 { "used", 0, 0, true, false, false,
585 handle_used_attribute },
586 { "unused", 0, 0, false, false, false,
587 handle_unused_attribute },
588 /* The same comments as for noreturn attributes apply to const ones. */
589 { "const", 0, 0, true, false, false,
590 handle_const_attribute },
591 { "transparent_union", 0, 0, false, false, false,
592 handle_transparent_union_attribute },
593 { "constructor", 0, 0, true, false, false,
594 handle_constructor_attribute },
595 { "destructor", 0, 0, true, false, false,
596 handle_destructor_attribute },
597 { "mode", 1, 1, false, true, false,
598 handle_mode_attribute },
599 { "section", 1, 1, true, false, false,
600 handle_section_attribute },
601 { "aligned", 0, 1, false, false, false,
602 handle_aligned_attribute },
603 { "weak", 0, 0, true, false, false,
604 handle_weak_attribute },
605 { "alias", 1, 1, true, false, false,
606 handle_alias_attribute },
607 { "no_instrument_function", 0, 0, true, false, false,
608 handle_no_instrument_function_attribute },
609 { "malloc", 0, 0, true, false, false,
610 handle_malloc_attribute },
611 { "no_stack_limit", 0, 0, true, false, false,
612 handle_no_limit_stack_attribute },
613 { "pure", 0, 0, true, false, false,
614 handle_pure_attribute },
615 { "deprecated", 0, 0, false, false, false,
616 handle_deprecated_attribute },
617 { "vector_size", 1, 1, false, true, false,
618 handle_vector_size_attribute },
619 { "visibility", 1, 1, true, false, false,
620 handle_visibility_attribute },
621 { "tls_model", 1, 1, true, false, false,
622 handle_tls_model_attribute },
623 { "nonnull", 0, -1, false, true, true,
624 handle_nonnull_attribute },
625 { "nothrow", 0, 0, true, false, false,
626 handle_nothrow_attribute },
627 { "may_alias", 0, 0, false, true, false, NULL },
628 { "cleanup", 1, 1, true, false, false,
629 handle_cleanup_attribute },
630 { "warn_unused_result", 0, 0, false, true, true,
631 handle_warn_unused_result_attribute },
632 { NULL, 0, 0, false, false, false, NULL }
635 /* Give the specifications for the format attributes, used by C and all
638 const struct attribute_spec c_common_format_attribute_table[] =
640 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
641 { "format", 3, 3, false, true, true,
642 handle_format_attribute },
643 { "format_arg", 1, 1, false, true, true,
644 handle_format_arg_attribute },
645 { NULL, 0, 0, false, false, false, NULL }
648 /* Push current bindings for the function name VAR_DECLS. */
651 start_fname_decls (void)
654 tree saved = NULL_TREE;
656 for (ix = 0; fname_vars[ix].decl; ix++)
658 tree decl = *fname_vars[ix].decl;
662 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
663 *fname_vars[ix].decl = NULL_TREE;
666 if (saved || saved_function_name_decls)
667 /* Normally they'll have been NULL, so only push if we've got a
668 stack, or they are non-NULL. */
669 saved_function_name_decls = tree_cons (saved, NULL_TREE,
670 saved_function_name_decls);
673 /* Finish up the current bindings, adding them into the current function's
674 statement tree. This must be done _before_ finish_stmt_tree is called.
675 If there is no current function, we must be at file scope and no statements
676 are involved. Pop the previous bindings. */
679 finish_fname_decls (void)
682 tree stmts = NULL_TREE;
683 tree stack = saved_function_name_decls;
685 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
686 append_to_statement_list (TREE_VALUE (stack), &stmts);
690 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
692 if (TREE_CODE (*bodyp) == BIND_EXPR)
693 bodyp = &BIND_EXPR_BODY (*bodyp);
695 append_to_statement_list (*bodyp, &stmts);
699 for (ix = 0; fname_vars[ix].decl; ix++)
700 *fname_vars[ix].decl = NULL_TREE;
704 /* We had saved values, restore them. */
707 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
709 tree decl = TREE_PURPOSE (saved);
710 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
712 *fname_vars[ix].decl = decl;
714 stack = TREE_CHAIN (stack);
716 saved_function_name_decls = stack;
719 /* Return the text name of the current function, suitably prettified
720 by PRETTY_P. Return string must be freed by caller. */
723 fname_as_string (int pretty_p)
725 const char *name = "top level";
735 if (current_function_decl)
736 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
738 if (c_lex_string_translate)
740 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
741 cpp_string cstr = { 0, 0 }, strname;
743 namep = xmalloc (len);
744 snprintf (namep, len, "\"%s\"", name);
745 strname.text = (unsigned char *) namep;
746 strname.len = len - 1;
748 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
749 return (char *) cstr.text;
752 namep = xstrdup (name);
757 /* Expand DECL if it declares an entity not handled by the
761 c_expand_decl (tree decl)
763 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
765 /* Let the back-end know about this variable. */
766 if (!anon_aggr_type_p (TREE_TYPE (decl)))
767 emit_local_var (decl);
769 expand_anon_union_decl (decl, NULL_TREE,
770 DECL_ANON_UNION_ELEMS (decl));
772 else if (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
773 make_rtl_for_local_static (decl);
781 /* Return the VAR_DECL for a const char array naming the current
782 function. If the VAR_DECL has not yet been created, create it
783 now. RID indicates how it should be formatted and IDENTIFIER_NODE
784 ID is its name (unfortunately C and C++ hold the RID values of
785 keywords in different places, so we can't derive RID from ID in
786 this language independent code. */
789 fname_decl (unsigned int rid, tree id)
792 tree decl = NULL_TREE;
794 for (ix = 0; fname_vars[ix].decl; ix++)
795 if (fname_vars[ix].rid == rid)
798 decl = *fname_vars[ix].decl;
801 /* If a tree is built here, it would normally have the lineno of
802 the current statement. Later this tree will be moved to the
803 beginning of the function and this line number will be wrong.
804 To avoid this problem set the lineno to 0 here; that prevents
805 it from appearing in the RTL. */
807 location_t saved_location = input_location;
808 #ifdef USE_MAPPED_LOCATION
809 input_location = UNKNOWN_LOCATION;
814 stmts = push_stmt_list ();
815 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
816 stmts = pop_stmt_list (stmts);
817 if (!IS_EMPTY_STMT (stmts))
818 saved_function_name_decls
819 = tree_cons (decl, stmts, saved_function_name_decls);
820 *fname_vars[ix].decl = decl;
821 input_location = saved_location;
823 if (!ix && !current_function_decl)
824 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
829 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
832 fix_string_type (tree value)
834 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
835 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
836 const int nchars_max = flag_isoc99 ? 4095 : 509;
837 int length = TREE_STRING_LENGTH (value);
840 /* Compute the number of elements, for the array type. */
841 nchars = wide_flag ? length / wchar_bytes : length;
843 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
844 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
845 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
847 /* Create the array type for the string constant.
848 -Wwrite-strings says make the string constant an array of const char
849 so that copying it to a non-const pointer will get a warning.
850 For C++, this is the standard behavior. */
851 if (flag_const_strings)
854 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
857 = build_array_type (elements,
858 build_index_type (build_int_2 (nchars - 1, 0)));
862 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
863 build_index_type (build_int_2 (nchars - 1, 0)));
865 TREE_CONSTANT (value) = 1;
866 TREE_INVARIANT (value) = 1;
867 TREE_READONLY (value) = 1;
868 TREE_STATIC (value) = 1;
872 /* Print a warning if a constant expression had overflow in folding.
873 Invoke this function on every expression that the language
874 requires to be a constant expression.
875 Note the ANSI C standard says it is erroneous for a
876 constant expression to overflow. */
879 constant_expression_warning (tree value)
881 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
882 || TREE_CODE (value) == VECTOR_CST
883 || TREE_CODE (value) == COMPLEX_CST)
884 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
885 pedwarn ("overflow in constant expression");
888 /* Print a warning if an expression had overflow in folding.
889 Invoke this function on every expression that
890 (1) appears in the source code, and
891 (2) might be a constant expression that overflowed, and
892 (3) is not already checked by convert_and_check;
893 however, do not invoke this function on operands of explicit casts. */
896 overflow_warning (tree value)
898 if ((TREE_CODE (value) == INTEGER_CST
899 || (TREE_CODE (value) == COMPLEX_CST
900 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
901 && TREE_OVERFLOW (value))
903 TREE_OVERFLOW (value) = 0;
904 if (skip_evaluation == 0)
905 warning ("integer overflow in expression");
907 else if ((TREE_CODE (value) == REAL_CST
908 || (TREE_CODE (value) == COMPLEX_CST
909 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
910 && TREE_OVERFLOW (value))
912 TREE_OVERFLOW (value) = 0;
913 if (skip_evaluation == 0)
914 warning ("floating point overflow in expression");
916 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
918 TREE_OVERFLOW (value) = 0;
919 if (skip_evaluation == 0)
920 warning ("vector overflow in expression");
924 /* Print a warning if a large constant is truncated to unsigned,
925 or if -Wconversion is used and a constant < 0 is converted to unsigned.
926 Invoke this function on every expression that might be implicitly
927 converted to an unsigned type. */
930 unsigned_conversion_warning (tree result, tree operand)
932 tree type = TREE_TYPE (result);
934 if (TREE_CODE (operand) == INTEGER_CST
935 && TREE_CODE (type) == INTEGER_TYPE
936 && TYPE_UNSIGNED (type)
937 && skip_evaluation == 0
938 && !int_fits_type_p (operand, type))
940 if (!int_fits_type_p (operand, c_common_signed_type (type)))
941 /* This detects cases like converting -129 or 256 to unsigned char. */
942 warning ("large integer implicitly truncated to unsigned type");
943 else if (warn_conversion)
944 warning ("negative integer implicitly converted to unsigned type");
948 /* Nonzero if constant C has a value that is permissible
949 for type TYPE (an INTEGER_TYPE). */
952 constant_fits_type_p (tree c, tree type)
954 if (TREE_CODE (c) == INTEGER_CST)
955 return int_fits_type_p (c, type);
957 c = convert (type, c);
958 return !TREE_OVERFLOW (c);
961 /* Nonzero if vector types T1 and T2 can be converted to each other
962 without an explicit cast. */
964 vector_types_convertible_p (tree t1, tree t2)
966 return targetm.vector_opaque_p (t1)
967 || targetm.vector_opaque_p (t2)
968 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
969 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
970 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
973 /* Convert EXPR to TYPE, warning about conversion problems with constants.
974 Invoke this function on every expression that is converted implicitly,
975 i.e. because of language rules and not because of an explicit cast. */
978 convert_and_check (tree type, tree expr)
980 tree t = convert (type, expr);
981 if (TREE_CODE (t) == INTEGER_CST)
983 if (TREE_OVERFLOW (t))
985 TREE_OVERFLOW (t) = 0;
987 /* Do not diagnose overflow in a constant expression merely
988 because a conversion overflowed. */
989 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
991 /* No warning for converting 0x80000000 to int. */
992 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
993 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
994 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
995 /* If EXPR fits in the unsigned version of TYPE,
996 don't warn unless pedantic. */
998 || TYPE_UNSIGNED (type)
999 || ! constant_fits_type_p (expr,
1000 c_common_unsigned_type (type)))
1001 && skip_evaluation == 0)
1002 warning ("overflow in implicit constant conversion");
1005 unsigned_conversion_warning (t, expr);
1010 /* A node in a list that describes references to variables (EXPR), which are
1011 either read accesses if WRITER is zero, or write accesses, in which case
1012 WRITER is the parent of EXPR. */
1019 /* Used to implement a cache the results of a call to verify_tree. We only
1020 use this for SAVE_EXPRs. */
1023 struct tlist_cache *next;
1024 struct tlist *cache_before_sp;
1025 struct tlist *cache_after_sp;
1029 /* Obstack to use when allocating tlist structures, and corresponding
1031 static struct obstack tlist_obstack;
1032 static char *tlist_firstobj = 0;
1034 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1036 static struct tlist *warned_ids;
1037 /* SAVE_EXPRs need special treatment. We process them only once and then
1038 cache the results. */
1039 static struct tlist_cache *save_expr_cache;
1041 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1042 static void merge_tlist (struct tlist **, struct tlist *, int);
1043 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1044 static int warning_candidate_p (tree);
1045 static void warn_for_collisions (struct tlist *);
1046 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1047 static struct tlist *new_tlist (struct tlist *, tree, tree);
1049 /* Create a new struct tlist and fill in its fields. */
1050 static struct tlist *
1051 new_tlist (struct tlist *next, tree t, tree writer)
1054 l = obstack_alloc (&tlist_obstack, sizeof *l);
1061 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1062 is nonnull, we ignore any node we find which has a writer equal to it. */
1065 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1069 struct tlist *next = add->next;
1072 if (! exclude_writer || add->writer != exclude_writer)
1073 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1078 /* Merge the nodes of ADD into TO. This merging process is done so that for
1079 each variable that already exists in TO, no new node is added; however if
1080 there is a write access recorded in ADD, and an occurrence on TO is only
1081 a read access, then the occurrence in TO will be modified to record the
1085 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1087 struct tlist **end = to;
1090 end = &(*end)->next;
1096 struct tlist *next = add->next;
1098 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1099 if (tmp2->expr == add->expr)
1103 tmp2->writer = add->writer;
1107 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1108 end = &(*end)->next;
1115 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1116 references in list LIST conflict with it, excluding reads if ONLY writers
1120 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1125 /* Avoid duplicate warnings. */
1126 for (tmp = warned_ids; tmp; tmp = tmp->next)
1127 if (tmp->expr == written)
1132 if (list->expr == written
1133 && list->writer != writer
1134 && (! only_writes || list->writer)
1135 && DECL_NAME (list->expr))
1137 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1138 warning ("operation on `%s' may be undefined",
1139 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1145 /* Given a list LIST of references to variables, find whether any of these
1146 can cause conflicts due to missing sequence points. */
1149 warn_for_collisions (struct tlist *list)
1153 for (tmp = list; tmp; tmp = tmp->next)
1156 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1160 /* Return nonzero if X is a tree that can be verified by the sequence point
1163 warning_candidate_p (tree x)
1165 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1168 /* Walk the tree X, and record accesses to variables. If X is written by the
1169 parent tree, WRITER is the parent.
1170 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1171 expression or its only operand forces a sequence point, then everything up
1172 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1174 Once we return, we will have emitted warnings if any subexpression before
1175 such a sequence point could be undefined. On a higher level, however, the
1176 sequence point may not be relevant, and we'll merge the two lists.
1178 Example: (b++, a) + b;
1179 The call that processes the COMPOUND_EXPR will store the increment of B
1180 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1181 processes the PLUS_EXPR will need to merge the two lists so that
1182 eventually, all accesses end up on the same list (and we'll warn about the
1183 unordered subexpressions b++ and b.
1185 A note on merging. If we modify the former example so that our expression
1188 care must be taken not simply to add all three expressions into the final
1189 PNO_SP list. The function merge_tlist takes care of that by merging the
1190 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1191 way, so that no more than one access to B is recorded. */
1194 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1197 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1198 enum tree_code code;
1201 /* X may be NULL if it is the operand of an empty statement expression
1207 code = TREE_CODE (x);
1208 class = TREE_CODE_CLASS (code);
1210 if (warning_candidate_p (x))
1212 *pno_sp = new_tlist (*pno_sp, x, writer);
1222 case TRUTH_ANDIF_EXPR:
1223 case TRUTH_ORIF_EXPR:
1224 tmp_before = tmp_nosp = tmp_list3 = 0;
1225 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1226 warn_for_collisions (tmp_nosp);
1227 merge_tlist (pbefore_sp, tmp_before, 0);
1228 merge_tlist (pbefore_sp, tmp_nosp, 0);
1229 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1230 merge_tlist (pbefore_sp, tmp_list3, 0);
1234 tmp_before = tmp_list2 = 0;
1235 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1236 warn_for_collisions (tmp_list2);
1237 merge_tlist (pbefore_sp, tmp_before, 0);
1238 merge_tlist (pbefore_sp, tmp_list2, 1);
1240 tmp_list3 = tmp_nosp = 0;
1241 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1242 warn_for_collisions (tmp_nosp);
1243 merge_tlist (pbefore_sp, tmp_list3, 0);
1245 tmp_list3 = tmp_list2 = 0;
1246 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1247 warn_for_collisions (tmp_list2);
1248 merge_tlist (pbefore_sp, tmp_list3, 0);
1249 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1250 two first, to avoid warning for (a ? b++ : b++). */
1251 merge_tlist (&tmp_nosp, tmp_list2, 0);
1252 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1255 case PREDECREMENT_EXPR:
1256 case PREINCREMENT_EXPR:
1257 case POSTDECREMENT_EXPR:
1258 case POSTINCREMENT_EXPR:
1259 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1263 tmp_before = tmp_nosp = tmp_list3 = 0;
1264 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1265 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1266 /* Expressions inside the LHS are not ordered wrt. the sequence points
1267 in the RHS. Example:
1269 Despite the fact that the modification of "a" is in the before_sp
1270 list (tmp_before), it conflicts with the use of "a" in the LHS.
1271 We can handle this by adding the contents of tmp_list3
1272 to those of tmp_before, and redoing the collision warnings for that
1274 add_tlist (&tmp_before, tmp_list3, x, 1);
1275 warn_for_collisions (tmp_before);
1276 /* Exclude the LHS itself here; we first have to merge it into the
1277 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1278 didn't exclude the LHS, we'd get it twice, once as a read and once
1280 add_tlist (pno_sp, tmp_list3, x, 0);
1281 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1283 merge_tlist (pbefore_sp, tmp_before, 0);
1284 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1285 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1286 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1290 /* We need to warn about conflicts among arguments and conflicts between
1291 args and the function address. Side effects of the function address,
1292 however, are not ordered by the sequence point of the call. */
1293 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1294 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1295 if (TREE_OPERAND (x, 1))
1296 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1297 merge_tlist (&tmp_list3, tmp_list2, 0);
1298 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1299 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1300 warn_for_collisions (tmp_before);
1301 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1305 /* Scan all the list, e.g. indices of multi dimensional array. */
1308 tmp_before = tmp_nosp = 0;
1309 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1310 merge_tlist (&tmp_nosp, tmp_before, 0);
1311 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1318 struct tlist_cache *t;
1319 for (t = save_expr_cache; t; t = t->next)
1325 t = obstack_alloc (&tlist_obstack, sizeof *t);
1326 t->next = save_expr_cache;
1328 save_expr_cache = t;
1330 tmp_before = tmp_nosp = 0;
1331 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1332 warn_for_collisions (tmp_nosp);
1337 struct tlist *t = tmp_nosp;
1339 merge_tlist (&tmp_list3, t, 0);
1341 t->cache_before_sp = tmp_before;
1342 t->cache_after_sp = tmp_list3;
1344 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1345 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1354 if (first_rtl_op (code) == 0)
1356 x = TREE_OPERAND (x, 0);
1371 int max = first_rtl_op (TREE_CODE (x));
1372 for (lp = 0; lp < max; lp++)
1374 tmp_before = tmp_nosp = 0;
1375 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1376 merge_tlist (&tmp_nosp, tmp_before, 0);
1377 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1384 /* Try to warn for undefined behavior in EXPR due to missing sequence
1388 verify_sequence_points (tree expr)
1390 struct tlist *before_sp = 0, *after_sp = 0;
1393 save_expr_cache = 0;
1394 if (tlist_firstobj == 0)
1396 gcc_obstack_init (&tlist_obstack);
1397 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1400 verify_tree (expr, &before_sp, &after_sp, 0);
1401 warn_for_collisions (after_sp);
1402 obstack_free (&tlist_obstack, tlist_firstobj);
1405 /* Validate the expression after `case' and apply default promotions. */
1408 check_case_value (tree value)
1410 if (value == NULL_TREE)
1413 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1414 STRIP_TYPE_NOPS (value);
1415 /* In C++, the following is allowed:
1418 switch (...) { case i: ... }
1420 So, we try to reduce the VALUE to a constant that way. */
1421 if (c_dialect_cxx ())
1423 value = decl_constant_value (value);
1424 STRIP_TYPE_NOPS (value);
1425 value = fold (value);
1428 if (TREE_CODE (value) != INTEGER_CST
1429 && value != error_mark_node)
1431 error ("case label does not reduce to an integer constant");
1432 value = error_mark_node;
1435 /* Promote char or short to int. */
1436 value = default_conversion (value);
1438 constant_expression_warning (value);
1443 /* See if the case values LOW and HIGH are in the range of the original
1444 type (ie. before the default conversion to int) of the switch testing
1446 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1447 the type before promiting it. CASE_LOW_P is a pointer to the lower
1448 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1449 if the case is not a case range.
1450 The caller has to make sure that we are not called with NULL for
1451 CASE_LOW_P (ie. the defualt case).
1452 Returns true if the case label is in range of ORIG_TYPE (satured or
1453 untouched) or false if the label is out of range. */
1456 check_case_bounds (tree type, tree orig_type,
1457 tree *case_low_p, tree *case_high_p)
1459 tree min_value, max_value;
1460 tree case_low = *case_low_p;
1461 tree case_high = case_high_p ? *case_high_p : case_low;
1463 /* If there was a problem with the original type, do nothing. */
1464 if (orig_type == error_mark_node)
1467 min_value = TYPE_MIN_VALUE (orig_type);
1468 max_value = TYPE_MAX_VALUE (orig_type);
1470 /* Case label is less than minimum for type. */
1471 if (tree_int_cst_compare (case_low, min_value) < 0
1472 && tree_int_cst_compare (case_high, min_value) < 0)
1474 warning ("case label value is less than minimum value for type");
1478 /* Case value is greater than maximum for type. */
1479 if (tree_int_cst_compare (case_low, max_value) > 0
1480 && tree_int_cst_compare (case_high, max_value) > 0)
1482 warning ("case label value exceeds maximum value for type");
1486 /* Saturate lower case label value to minimum. */
1487 if (tree_int_cst_compare (case_high, min_value) >= 0
1488 && tree_int_cst_compare (case_low, min_value) < 0)
1490 warning ("lower value in case label range"
1491 " less than minimum value for type");
1492 case_low = min_value;
1495 /* Saturate upper case label value to maximum. */
1496 if (tree_int_cst_compare (case_low, max_value) <= 0
1497 && tree_int_cst_compare (case_high, max_value) > 0)
1499 warning ("upper value in case label range"
1500 " exceeds maximum value for type");
1501 case_high = max_value;
1504 if (*case_low_p != case_low)
1505 *case_low_p = convert (type, case_low);
1506 if (case_high_p && *case_high_p != case_high)
1507 *case_high_p = convert (type, case_high);
1512 /* Return an integer type with BITS bits of precision,
1513 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1516 c_common_type_for_size (unsigned int bits, int unsignedp)
1518 if (bits == TYPE_PRECISION (integer_type_node))
1519 return unsignedp ? unsigned_type_node : integer_type_node;
1521 if (bits == TYPE_PRECISION (signed_char_type_node))
1522 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1524 if (bits == TYPE_PRECISION (short_integer_type_node))
1525 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1527 if (bits == TYPE_PRECISION (long_integer_type_node))
1528 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1530 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1531 return (unsignedp ? long_long_unsigned_type_node
1532 : long_long_integer_type_node);
1534 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1535 return (unsignedp ? widest_unsigned_literal_type_node
1536 : widest_integer_literal_type_node);
1538 if (bits <= TYPE_PRECISION (intQI_type_node))
1539 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1541 if (bits <= TYPE_PRECISION (intHI_type_node))
1542 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1544 if (bits <= TYPE_PRECISION (intSI_type_node))
1545 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1547 if (bits <= TYPE_PRECISION (intDI_type_node))
1548 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1553 /* Used for communication between c_common_type_for_mode and
1554 c_register_builtin_type. */
1555 static GTY(()) tree registered_builtin_types;
1557 /* Return a data type that has machine mode MODE.
1558 If the mode is an integer,
1559 then UNSIGNEDP selects between signed and unsigned types. */
1562 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1566 if (mode == TYPE_MODE (integer_type_node))
1567 return unsignedp ? unsigned_type_node : integer_type_node;
1569 if (mode == TYPE_MODE (signed_char_type_node))
1570 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1572 if (mode == TYPE_MODE (short_integer_type_node))
1573 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1575 if (mode == TYPE_MODE (long_integer_type_node))
1576 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1578 if (mode == TYPE_MODE (long_long_integer_type_node))
1579 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1581 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1582 return unsignedp ? widest_unsigned_literal_type_node
1583 : widest_integer_literal_type_node;
1586 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1589 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1592 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1595 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1597 #if HOST_BITS_PER_WIDE_INT >= 64
1598 if (mode == TYPE_MODE (intTI_type_node))
1599 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1602 if (mode == TYPE_MODE (float_type_node))
1603 return float_type_node;
1605 if (mode == TYPE_MODE (double_type_node))
1606 return double_type_node;
1608 if (mode == TYPE_MODE (long_double_type_node))
1609 return long_double_type_node;
1611 if (mode == TYPE_MODE (void_type_node))
1612 return void_type_node;
1614 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1615 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1617 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1618 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1620 if (VECTOR_MODE_P (mode))
1622 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1623 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1624 if (inner_type != NULL_TREE)
1625 return build_vector_type_for_mode (inner_type, mode);
1628 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1629 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1630 return TREE_VALUE (t);
1635 /* Return an unsigned type the same as TYPE in other respects. */
1637 c_common_unsigned_type (tree type)
1639 tree type1 = TYPE_MAIN_VARIANT (type);
1640 if (type1 == signed_char_type_node || type1 == char_type_node)
1641 return unsigned_char_type_node;
1642 if (type1 == integer_type_node)
1643 return unsigned_type_node;
1644 if (type1 == short_integer_type_node)
1645 return short_unsigned_type_node;
1646 if (type1 == long_integer_type_node)
1647 return long_unsigned_type_node;
1648 if (type1 == long_long_integer_type_node)
1649 return long_long_unsigned_type_node;
1650 if (type1 == widest_integer_literal_type_node)
1651 return widest_unsigned_literal_type_node;
1652 #if HOST_BITS_PER_WIDE_INT >= 64
1653 if (type1 == intTI_type_node)
1654 return unsigned_intTI_type_node;
1656 if (type1 == intDI_type_node)
1657 return unsigned_intDI_type_node;
1658 if (type1 == intSI_type_node)
1659 return unsigned_intSI_type_node;
1660 if (type1 == intHI_type_node)
1661 return unsigned_intHI_type_node;
1662 if (type1 == intQI_type_node)
1663 return unsigned_intQI_type_node;
1665 return c_common_signed_or_unsigned_type (1, type);
1668 /* Return a signed type the same as TYPE in other respects. */
1671 c_common_signed_type (tree type)
1673 tree type1 = TYPE_MAIN_VARIANT (type);
1674 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1675 return signed_char_type_node;
1676 if (type1 == unsigned_type_node)
1677 return integer_type_node;
1678 if (type1 == short_unsigned_type_node)
1679 return short_integer_type_node;
1680 if (type1 == long_unsigned_type_node)
1681 return long_integer_type_node;
1682 if (type1 == long_long_unsigned_type_node)
1683 return long_long_integer_type_node;
1684 if (type1 == widest_unsigned_literal_type_node)
1685 return widest_integer_literal_type_node;
1686 #if HOST_BITS_PER_WIDE_INT >= 64
1687 if (type1 == unsigned_intTI_type_node)
1688 return intTI_type_node;
1690 if (type1 == unsigned_intDI_type_node)
1691 return intDI_type_node;
1692 if (type1 == unsigned_intSI_type_node)
1693 return intSI_type_node;
1694 if (type1 == unsigned_intHI_type_node)
1695 return intHI_type_node;
1696 if (type1 == unsigned_intQI_type_node)
1697 return intQI_type_node;
1699 return c_common_signed_or_unsigned_type (0, type);
1702 /* Return a type the same as TYPE except unsigned or
1703 signed according to UNSIGNEDP. */
1706 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1708 if (! INTEGRAL_TYPE_P (type)
1709 || TYPE_UNSIGNED (type) == unsignedp)
1712 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1713 the precision; they have precision set to match their range, but
1714 may use a wider mode to match an ABI. If we change modes, we may
1715 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1716 the precision as well, so as to yield correct results for
1717 bit-field types. C++ does not have these separate bit-field
1718 types, and producing a signed or unsigned variant of an
1719 ENUMERAL_TYPE may cause other problems as well. */
1721 #define TYPE_OK(node) \
1722 (TYPE_MODE (type) == TYPE_MODE (node) \
1723 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1724 if (TYPE_OK (signed_char_type_node))
1725 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1726 if (TYPE_OK (integer_type_node))
1727 return unsignedp ? unsigned_type_node : integer_type_node;
1728 if (TYPE_OK (short_integer_type_node))
1729 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1730 if (TYPE_OK (long_integer_type_node))
1731 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1732 if (TYPE_OK (long_long_integer_type_node))
1733 return (unsignedp ? long_long_unsigned_type_node
1734 : long_long_integer_type_node);
1735 if (TYPE_OK (widest_integer_literal_type_node))
1736 return (unsignedp ? widest_unsigned_literal_type_node
1737 : widest_integer_literal_type_node);
1739 #if HOST_BITS_PER_WIDE_INT >= 64
1740 if (TYPE_OK (intTI_type_node))
1741 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1743 if (TYPE_OK (intDI_type_node))
1744 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1745 if (TYPE_OK (intSI_type_node))
1746 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1747 if (TYPE_OK (intHI_type_node))
1748 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1749 if (TYPE_OK (intQI_type_node))
1750 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1753 if (c_dialect_cxx ())
1756 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
1759 /* The C version of the register_builtin_type langhook. */
1762 c_register_builtin_type (tree type, const char* name)
1766 decl = build_decl (TYPE_DECL, get_identifier (name), type);
1767 DECL_ARTIFICIAL (decl) = 1;
1768 if (!TYPE_NAME (type))
1769 TYPE_NAME (type) = decl;
1772 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
1776 /* Return the minimum number of bits needed to represent VALUE in a
1777 signed or unsigned type, UNSIGNEDP says which. */
1780 min_precision (tree value, int unsignedp)
1784 /* If the value is negative, compute its negative minus 1. The latter
1785 adjustment is because the absolute value of the largest negative value
1786 is one larger than the largest positive value. This is equivalent to
1787 a bit-wise negation, so use that operation instead. */
1789 if (tree_int_cst_sgn (value) < 0)
1790 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
1792 /* Return the number of bits needed, taking into account the fact
1793 that we need one more bit for a signed than unsigned type. */
1795 if (integer_zerop (value))
1798 log = tree_floor_log2 (value);
1800 return log + 1 + ! unsignedp;
1803 /* Print an error message for invalid operands to arith operation
1804 CODE. NOP_EXPR is used as a special case (see
1805 c_common_truthvalue_conversion). */
1808 binary_op_error (enum tree_code code)
1815 error ("invalid truth-value expression");
1819 opname = "+"; break;
1821 opname = "-"; break;
1823 opname = "*"; break;
1825 opname = "max"; break;
1827 opname = "min"; break;
1829 opname = "=="; break;
1831 opname = "!="; break;
1833 opname = "<="; break;
1835 opname = ">="; break;
1837 opname = "<"; break;
1839 opname = ">"; break;
1841 opname = "<<"; break;
1843 opname = ">>"; break;
1844 case TRUNC_MOD_EXPR:
1845 case FLOOR_MOD_EXPR:
1846 opname = "%"; break;
1847 case TRUNC_DIV_EXPR:
1848 case FLOOR_DIV_EXPR:
1849 opname = "/"; break;
1851 opname = "&"; break;
1853 opname = "|"; break;
1854 case TRUTH_ANDIF_EXPR:
1855 opname = "&&"; break;
1856 case TRUTH_ORIF_EXPR:
1857 opname = "||"; break;
1859 opname = "^"; break;
1862 opname = "rotate"; break;
1864 opname = "unknown"; break;
1866 error ("invalid operands to binary %s", opname);
1869 /* Subroutine of build_binary_op, used for comparison operations.
1870 See if the operands have both been converted from subword integer types
1871 and, if so, perhaps change them both back to their original type.
1872 This function is also responsible for converting the two operands
1873 to the proper common type for comparison.
1875 The arguments of this function are all pointers to local variables
1876 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1877 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1879 If this function returns nonzero, it means that the comparison has
1880 a constant value. What this function returns is an expression for
1884 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
1885 enum tree_code *rescode_ptr)
1888 tree op0 = *op0_ptr;
1889 tree op1 = *op1_ptr;
1890 int unsignedp0, unsignedp1;
1892 tree primop0, primop1;
1893 enum tree_code code = *rescode_ptr;
1895 /* Throw away any conversions to wider types
1896 already present in the operands. */
1898 primop0 = get_narrower (op0, &unsignedp0);
1899 primop1 = get_narrower (op1, &unsignedp1);
1901 /* Handle the case that OP0 does not *contain* a conversion
1902 but it *requires* conversion to FINAL_TYPE. */
1904 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
1905 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1906 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
1907 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1909 /* If one of the operands must be floated, we cannot optimize. */
1910 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
1911 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
1913 /* If first arg is constant, swap the args (changing operation
1914 so value is preserved), for canonicalization. Don't do this if
1915 the second arg is 0. */
1917 if (TREE_CONSTANT (primop0)
1918 && ! integer_zerop (primop1) && ! real_zerop (primop1))
1921 int temi = unsignedp0;
1929 unsignedp0 = unsignedp1;
1952 *rescode_ptr = code;
1955 /* If comparing an integer against a constant more bits wide,
1956 maybe we can deduce a value of 1 or 0 independent of the data.
1957 Or else truncate the constant now
1958 rather than extend the variable at run time.
1960 This is only interesting if the constant is the wider arg.
1961 Also, it is not safe if the constant is unsigned and the
1962 variable arg is signed, since in this case the variable
1963 would be sign-extended and then regarded as unsigned.
1964 Our technique fails in this case because the lowest/highest
1965 possible unsigned results don't follow naturally from the
1966 lowest/highest possible values of the variable operand.
1967 For just EQ_EXPR and NE_EXPR there is another technique that
1968 could be used: see if the constant can be faithfully represented
1969 in the other operand's type, by truncating it and reextending it
1970 and see if that preserves the constant's value. */
1972 if (!real1 && !real2
1973 && TREE_CODE (primop1) == INTEGER_CST
1974 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
1976 int min_gt, max_gt, min_lt, max_lt;
1977 tree maxval, minval;
1978 /* 1 if comparison is nominally unsigned. */
1979 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
1982 type = c_common_signed_or_unsigned_type (unsignedp0,
1983 TREE_TYPE (primop0));
1985 /* In C, if TYPE is an enumeration, then we need to get its
1986 min/max values from its underlying integral type, not the
1987 enumerated type itself. In C++, TYPE_MAX_VALUE and
1988 TYPE_MIN_VALUE have already been set correctly on the
1989 enumeration type. */
1990 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
1991 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
1993 maxval = TYPE_MAX_VALUE (type);
1994 minval = TYPE_MIN_VALUE (type);
1996 if (unsignedp && !unsignedp0)
1997 *restype_ptr = c_common_signed_type (*restype_ptr);
1999 if (TREE_TYPE (primop1) != *restype_ptr)
2001 tree tmp = convert (*restype_ptr, primop1);
2002 TREE_OVERFLOW (tmp) = TREE_OVERFLOW (primop1);
2003 TREE_CONSTANT_OVERFLOW (tmp) = TREE_CONSTANT_OVERFLOW (primop1);
2006 if (type != *restype_ptr)
2008 minval = convert (*restype_ptr, minval);
2009 maxval = convert (*restype_ptr, maxval);
2012 if (unsignedp && unsignedp0)
2014 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2015 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2016 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2017 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2021 min_gt = INT_CST_LT (primop1, minval);
2022 max_gt = INT_CST_LT (primop1, maxval);
2023 min_lt = INT_CST_LT (minval, primop1);
2024 max_lt = INT_CST_LT (maxval, primop1);
2028 /* This used to be a switch, but Genix compiler can't handle that. */
2029 if (code == NE_EXPR)
2031 if (max_lt || min_gt)
2032 val = truthvalue_true_node;
2034 else if (code == EQ_EXPR)
2036 if (max_lt || min_gt)
2037 val = truthvalue_false_node;
2039 else if (code == LT_EXPR)
2042 val = truthvalue_true_node;
2044 val = truthvalue_false_node;
2046 else if (code == GT_EXPR)
2049 val = truthvalue_true_node;
2051 val = truthvalue_false_node;
2053 else if (code == LE_EXPR)
2056 val = truthvalue_true_node;
2058 val = truthvalue_false_node;
2060 else if (code == GE_EXPR)
2063 val = truthvalue_true_node;
2065 val = truthvalue_false_node;
2068 /* If primop0 was sign-extended and unsigned comparison specd,
2069 we did a signed comparison above using the signed type bounds.
2070 But the comparison we output must be unsigned.
2072 Also, for inequalities, VAL is no good; but if the signed
2073 comparison had *any* fixed result, it follows that the
2074 unsigned comparison just tests the sign in reverse
2075 (positive values are LE, negative ones GE).
2076 So we can generate an unsigned comparison
2077 against an extreme value of the signed type. */
2079 if (unsignedp && !unsignedp0)
2086 primop1 = TYPE_MIN_VALUE (type);
2092 primop1 = TYPE_MAX_VALUE (type);
2099 type = c_common_unsigned_type (type);
2102 if (TREE_CODE (primop0) != INTEGER_CST)
2104 if (val == truthvalue_false_node)
2105 warning ("comparison is always false due to limited range of data type");
2106 if (val == truthvalue_true_node)
2107 warning ("comparison is always true due to limited range of data type");
2112 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2113 if (TREE_SIDE_EFFECTS (primop0))
2114 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2118 /* Value is not predetermined, but do the comparison
2119 in the type of the operand that is not constant.
2120 TYPE is already properly set. */
2122 else if (real1 && real2
2123 && (TYPE_PRECISION (TREE_TYPE (primop0))
2124 == TYPE_PRECISION (TREE_TYPE (primop1))))
2125 type = TREE_TYPE (primop0);
2127 /* If args' natural types are both narrower than nominal type
2128 and both extend in the same manner, compare them
2129 in the type of the wider arg.
2130 Otherwise must actually extend both to the nominal
2131 common type lest different ways of extending
2133 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2135 else if (unsignedp0 == unsignedp1 && real1 == real2
2136 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2137 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2139 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2140 type = c_common_signed_or_unsigned_type (unsignedp0
2141 || TYPE_UNSIGNED (*restype_ptr),
2143 /* Make sure shorter operand is extended the right way
2144 to match the longer operand. */
2146 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2147 TREE_TYPE (primop0)),
2150 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2151 TREE_TYPE (primop1)),
2156 /* Here we must do the comparison on the nominal type
2157 using the args exactly as we received them. */
2158 type = *restype_ptr;
2162 if (!real1 && !real2 && integer_zerop (primop1)
2163 && TYPE_UNSIGNED (*restype_ptr))
2169 /* All unsigned values are >= 0, so we warn if extra warnings
2170 are requested. However, if OP0 is a constant that is
2171 >= 0, the signedness of the comparison isn't an issue,
2172 so suppress the warning. */
2173 if (extra_warnings && !in_system_header
2174 && ! (TREE_CODE (primop0) == INTEGER_CST
2175 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2177 warning ("comparison of unsigned expression >= 0 is always true");
2178 value = truthvalue_true_node;
2182 if (extra_warnings && !in_system_header
2183 && ! (TREE_CODE (primop0) == INTEGER_CST
2184 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2186 warning ("comparison of unsigned expression < 0 is always false");
2187 value = truthvalue_false_node;
2196 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2197 if (TREE_SIDE_EFFECTS (primop0))
2198 return build (COMPOUND_EXPR, TREE_TYPE (value),
2205 *op0_ptr = convert (type, primop0);
2206 *op1_ptr = convert (type, primop1);
2208 *restype_ptr = truthvalue_type_node;
2213 /* Return a tree for the sum or difference (RESULTCODE says which)
2214 of pointer PTROP and integer INTOP. */
2217 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2221 /* The result is a pointer of the same type that is being added. */
2223 tree result_type = TREE_TYPE (ptrop);
2225 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2227 if (pedantic || warn_pointer_arith)
2228 pedwarn ("pointer of type `void *' used in arithmetic");
2229 size_exp = integer_one_node;
2231 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2233 if (pedantic || warn_pointer_arith)
2234 pedwarn ("pointer to a function used in arithmetic");
2235 size_exp = integer_one_node;
2237 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2239 if (pedantic || warn_pointer_arith)
2240 pedwarn ("pointer to member function used in arithmetic");
2241 size_exp = integer_one_node;
2244 size_exp = size_in_bytes (TREE_TYPE (result_type));
2246 /* If what we are about to multiply by the size of the elements
2247 contains a constant term, apply distributive law
2248 and multiply that constant term separately.
2249 This helps produce common subexpressions. */
2251 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2252 && ! TREE_CONSTANT (intop)
2253 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2254 && TREE_CONSTANT (size_exp)
2255 /* If the constant comes from pointer subtraction,
2256 skip this optimization--it would cause an error. */
2257 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2258 /* If the constant is unsigned, and smaller than the pointer size,
2259 then we must skip this optimization. This is because it could cause
2260 an overflow error if the constant is negative but INTOP is not. */
2261 && (! TYPE_UNSIGNED (TREE_TYPE (intop))
2262 || (TYPE_PRECISION (TREE_TYPE (intop))
2263 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2265 enum tree_code subcode = resultcode;
2266 tree int_type = TREE_TYPE (intop);
2267 if (TREE_CODE (intop) == MINUS_EXPR)
2268 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2269 /* Convert both subexpression types to the type of intop,
2270 because weird cases involving pointer arithmetic
2271 can result in a sum or difference with different type args. */
2272 ptrop = build_binary_op (subcode, ptrop,
2273 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2274 intop = convert (int_type, TREE_OPERAND (intop, 0));
2277 /* Convert the integer argument to a type the same size as sizetype
2278 so the multiply won't overflow spuriously. */
2280 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2281 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2282 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2283 TYPE_UNSIGNED (sizetype)), intop);
2285 /* Replace the integer argument with a suitable product by the object size.
2286 Do this multiplication as signed, then convert to the appropriate
2287 pointer type (actually unsigned integral). */
2289 intop = convert (result_type,
2290 build_binary_op (MULT_EXPR, intop,
2291 convert (TREE_TYPE (intop), size_exp), 1));
2293 /* Create the sum or difference. */
2294 return fold (build (resultcode, result_type, ptrop, intop));
2297 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2298 or validate its data type for an `if' or `while' statement or ?..: exp.
2300 This preparation consists of taking the ordinary
2301 representation of an expression expr and producing a valid tree
2302 boolean expression describing whether expr is nonzero. We could
2303 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2304 but we optimize comparisons, &&, ||, and !.
2306 The resulting type should always be `truthvalue_type_node'. */
2309 c_common_truthvalue_conversion (tree expr)
2311 if (TREE_CODE (expr) == ERROR_MARK)
2314 if (TREE_CODE (expr) == FUNCTION_DECL)
2315 expr = build_unary_op (ADDR_EXPR, expr, 0);
2317 switch (TREE_CODE (expr))
2319 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2320 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2321 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2322 case ORDERED_EXPR: case UNORDERED_EXPR:
2323 case TRUTH_ANDIF_EXPR:
2324 case TRUTH_ORIF_EXPR:
2325 case TRUTH_AND_EXPR:
2327 case TRUTH_XOR_EXPR:
2328 case TRUTH_NOT_EXPR:
2329 TREE_TYPE (expr) = truthvalue_type_node;
2336 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2339 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2343 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2344 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2346 /* Common Ada/Pascal programmer's mistake. We always warn
2347 about this since it is so bad. */
2348 warning ("the address of `%D', will always evaluate as `true'",
2349 TREE_OPERAND (expr, 0));
2350 return truthvalue_true_node;
2353 /* If we are taking the address of an external decl, it might be
2354 zero if it is weak, so we cannot optimize. */
2355 if (DECL_P (TREE_OPERAND (expr, 0))
2356 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2359 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2360 return build (COMPOUND_EXPR, truthvalue_type_node,
2361 TREE_OPERAND (expr, 0), truthvalue_true_node);
2363 return truthvalue_true_node;
2367 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2368 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2369 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2370 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2376 /* These don't change whether an object is nonzero or zero. */
2377 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2381 /* These don't change whether an object is zero or nonzero, but
2382 we can't ignore them if their second arg has side-effects. */
2383 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2384 return build (COMPOUND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 1),
2385 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2387 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2390 /* Distribute the conversion into the arms of a COND_EXPR. */
2391 return fold (build (COND_EXPR, truthvalue_type_node, TREE_OPERAND (expr, 0),
2392 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2393 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2396 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2397 since that affects how `default_conversion' will behave. */
2398 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2399 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2401 /* Fall through.... */
2403 /* If this is widening the argument, we can ignore it. */
2404 if (TYPE_PRECISION (TREE_TYPE (expr))
2405 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2406 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2410 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2411 aren't guaranteed to the be same for modes that can represent
2412 infinity, since if x and y are both +infinity, or both
2413 -infinity, then x - y is not a number.
2415 Note that this transformation is safe when x or y is NaN.
2416 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2418 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2420 /* Fall through.... */
2422 /* This and MINUS_EXPR can be changed into a comparison of the
2424 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2425 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2426 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2427 TREE_OPERAND (expr, 1), 1);
2428 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2429 fold (build1 (NOP_EXPR,
2430 TREE_TYPE (TREE_OPERAND (expr, 0)),
2431 TREE_OPERAND (expr, 1))), 1);
2434 if (integer_onep (TREE_OPERAND (expr, 1))
2435 && TREE_TYPE (expr) != truthvalue_type_node)
2436 /* Using convert here would cause infinite recursion. */
2437 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2441 if (warn_parentheses && !TREE_NO_WARNING (expr))
2442 warning ("suggest parentheses around assignment used as truth value");
2449 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2451 tree t = save_expr (expr);
2452 return (build_binary_op
2453 ((TREE_SIDE_EFFECTS (expr)
2454 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2455 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2456 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2460 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2463 static tree builtin_function_2 (const char *, const char *, tree, tree,
2464 int, enum built_in_class, int, int,
2467 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2468 down to the element type of an array. */
2471 c_build_qualified_type (tree type, int type_quals)
2473 if (type == error_mark_node)
2476 if (TREE_CODE (type) == ARRAY_TYPE)
2477 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2479 TYPE_DOMAIN (type));
2481 /* A restrict-qualified pointer type must be a pointer to object or
2482 incomplete type. Note that the use of POINTER_TYPE_P also allows
2483 REFERENCE_TYPEs, which is appropriate for C++. */
2484 if ((type_quals & TYPE_QUAL_RESTRICT)
2485 && (!POINTER_TYPE_P (type)
2486 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2488 error ("invalid use of `restrict'");
2489 type_quals &= ~TYPE_QUAL_RESTRICT;
2492 return build_qualified_type (type, type_quals);
2495 /* Apply the TYPE_QUALS to the new DECL. */
2498 c_apply_type_quals_to_decl (int type_quals, tree decl)
2500 tree type = TREE_TYPE (decl);
2502 if (type == error_mark_node)
2505 if (((type_quals & TYPE_QUAL_CONST)
2506 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2507 /* An object declared 'const' is only readonly after it is
2508 initialized. We don't have any way of expressing this currently,
2509 so we need to be conservative and unset TREE_READONLY for types
2510 with constructors. Otherwise aliasing code will ignore stores in
2511 an inline constructor. */
2512 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2513 TREE_READONLY (decl) = 1;
2514 if (type_quals & TYPE_QUAL_VOLATILE)
2516 TREE_SIDE_EFFECTS (decl) = 1;
2517 TREE_THIS_VOLATILE (decl) = 1;
2519 if (type_quals & TYPE_QUAL_RESTRICT)
2521 while (type && TREE_CODE (type) == ARRAY_TYPE)
2522 /* Allow 'restrict' on arrays of pointers.
2523 FIXME currently we just ignore it. */
2524 type = TREE_TYPE (type);
2526 || !POINTER_TYPE_P (type)
2527 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2528 error ("invalid use of `restrict'");
2529 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2530 /* Indicate we need to make a unique alias set for this pointer.
2531 We can't do it here because it might be pointing to an
2533 DECL_POINTER_ALIAS_SET (decl) = -2;
2537 /* Hash function for the problem of multiple type definitions in
2538 different files. This must hash all types that will compare
2539 equal via comptypes to the same value. In practice it hashes
2540 on some of the simple stuff and leaves the details to comptypes. */
2543 c_type_hash (const void *p)
2549 switch (TREE_CODE (t))
2551 /* For pointers, hash on pointee type plus some swizzling. */
2553 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2554 /* Hash on number of elements and total size. */
2557 t2 = TYPE_VALUES (t);
2561 t2 = TYPE_FIELDS (t);
2563 case QUAL_UNION_TYPE:
2565 t2 = TYPE_FIELDS (t);
2569 t2 = TYPE_FIELDS (t);
2574 for (; t2; t2 = TREE_CHAIN (t2))
2576 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2577 return ((size << 24) | (i << shift));
2580 /* Return the typed-based alias set for T, which may be an expression
2581 or a type. Return -1 if we don't do anything special. */
2584 c_common_get_alias_set (tree t)
2588 static htab_t type_hash_table;
2590 /* Permit type-punning when accessing a union, provided the access
2591 is directly through the union. For example, this code does not
2592 permit taking the address of a union member and then storing
2593 through it. Even the type-punning allowed here is a GCC
2594 extension, albeit a common and useful one; the C standard says
2595 that such accesses have implementation-defined behavior. */
2597 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2598 u = TREE_OPERAND (u, 0))
2599 if (TREE_CODE (u) == COMPONENT_REF
2600 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2603 /* That's all the expressions we handle specially. */
2607 /* The C standard guarantees that any object may be accessed via an
2608 lvalue that has character type. */
2609 if (t == char_type_node
2610 || t == signed_char_type_node
2611 || t == unsigned_char_type_node)
2614 /* If it has the may_alias attribute, it can alias anything. */
2615 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2618 /* The C standard specifically allows aliasing between signed and
2619 unsigned variants of the same type. We treat the signed
2620 variant as canonical. */
2621 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2623 tree t1 = c_common_signed_type (t);
2625 /* t1 == t can happen for boolean nodes which are always unsigned. */
2627 return get_alias_set (t1);
2629 else if (POINTER_TYPE_P (t))
2633 /* Unfortunately, there is no canonical form of a pointer type.
2634 In particular, if we have `typedef int I', then `int *', and
2635 `I *' are different types. So, we have to pick a canonical
2636 representative. We do this below.
2638 Technically, this approach is actually more conservative that
2639 it needs to be. In particular, `const int *' and `int *'
2640 should be in different alias sets, according to the C and C++
2641 standard, since their types are not the same, and so,
2642 technically, an `int **' and `const int **' cannot point at
2645 But, the standard is wrong. In particular, this code is
2650 const int* const* cipp = ipp;
2652 And, it doesn't make sense for that to be legal unless you
2653 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2654 the pointed-to types. This issue has been reported to the
2656 t1 = build_type_no_quals (t);
2658 return get_alias_set (t1);
2661 /* Handle the case of multiple type nodes referring to "the same" type,
2662 which occurs with IMA. These share an alias set. FIXME: Currently only
2663 C90 is handled. (In C99 type compatibility is not transitive, which
2664 complicates things mightily. The alias set splay trees can theoretically
2665 represent this, but insertion is tricky when you consider all the
2666 different orders things might arrive in.) */
2668 if (c_language != clk_c || flag_isoc99)
2671 /* Save time if there's only one input file. */
2672 if (!current_file_decl || TREE_CHAIN (current_file_decl) == NULL_TREE)
2675 /* Pointers need special handling if they point to any type that
2676 needs special handling (below). */
2677 if (TREE_CODE (t) == POINTER_TYPE)
2680 /* Find bottom type under any nested POINTERs. */
2681 for (t2 = TREE_TYPE (t);
2682 TREE_CODE (t2) == POINTER_TYPE;
2683 t2 = TREE_TYPE (t2))
2685 if (TREE_CODE (t2) != RECORD_TYPE
2686 && TREE_CODE (t2) != ENUMERAL_TYPE
2687 && TREE_CODE (t2) != QUAL_UNION_TYPE
2688 && TREE_CODE (t2) != UNION_TYPE)
2690 if (TYPE_SIZE (t2) == 0)
2693 /* These are the only cases that need special handling. */
2694 if (TREE_CODE (t) != RECORD_TYPE
2695 && TREE_CODE (t) != ENUMERAL_TYPE
2696 && TREE_CODE (t) != QUAL_UNION_TYPE
2697 && TREE_CODE (t) != UNION_TYPE
2698 && TREE_CODE (t) != POINTER_TYPE)
2701 if (TYPE_SIZE (t) == 0)
2704 /* Look up t in hash table. Only one of the compatible types within each
2705 alias set is recorded in the table. */
2706 if (!type_hash_table)
2707 type_hash_table = htab_create (1021, c_type_hash,
2708 (htab_eq) lang_hooks.types_compatible_p,
2710 slot = htab_find_slot (type_hash_table, t, INSERT);
2712 return TYPE_ALIAS_SET ((tree)*slot);
2714 /* Our caller will assign and record (in t) a new alias set; all we need
2715 to do is remember t in the hash table. */
2721 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2722 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2723 flag controls whether we should diagnose possibly ill-formed
2724 constructs or not. */
2726 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2728 const char *op_name;
2730 enum tree_code type_code = TREE_CODE (type);
2732 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2733 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2735 if (type_code == FUNCTION_TYPE)
2737 if (op == SIZEOF_EXPR)
2739 if (complain && (pedantic || warn_pointer_arith))
2740 pedwarn ("invalid application of `sizeof' to a function type");
2741 value = size_one_node;
2744 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2746 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2748 if (type_code == VOID_TYPE
2749 && complain && (pedantic || warn_pointer_arith))
2750 pedwarn ("invalid application of `%s' to a void type", op_name);
2751 value = size_one_node;
2753 else if (!COMPLETE_TYPE_P (type))
2756 error ("invalid application of `%s' to incomplete type `%T' ",
2758 value = size_zero_node;
2762 if (op == SIZEOF_EXPR)
2763 /* Convert in case a char is more than one unit. */
2764 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2765 size_int (TYPE_PRECISION (char_type_node)
2768 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2771 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2772 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2773 never happen. However, this node should really have type
2774 `size_t', which is just a typedef for an ordinary integer type. */
2775 value = fold (build1 (NOP_EXPR, size_type_node, value));
2776 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2781 /* Implement the __alignof keyword: Return the minimum required
2782 alignment of EXPR, measured in bytes. For VAR_DECL's and
2783 FIELD_DECL's return DECL_ALIGN (which can be set from an
2784 "aligned" __attribute__ specification). */
2787 c_alignof_expr (tree expr)
2791 if (TREE_CODE (expr) == VAR_DECL)
2792 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2794 else if (TREE_CODE (expr) == COMPONENT_REF
2795 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2797 error ("`__alignof' applied to a bit-field");
2800 else if (TREE_CODE (expr) == COMPONENT_REF
2801 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2802 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2804 else if (TREE_CODE (expr) == INDIRECT_REF)
2806 tree t = TREE_OPERAND (expr, 0);
2808 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2810 while (TREE_CODE (t) == NOP_EXPR
2811 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2815 t = TREE_OPERAND (t, 0);
2816 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2817 if (thisalign > bestalign)
2818 best = t, bestalign = thisalign;
2820 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2823 return c_alignof (TREE_TYPE (expr));
2825 return fold (build1 (NOP_EXPR, size_type_node, t));
2828 /* Handle C and C++ default attributes. */
2830 enum built_in_attribute
2832 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2833 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2834 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2835 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2836 #include "builtin-attrs.def"
2837 #undef DEF_ATTR_NULL_TREE
2839 #undef DEF_ATTR_IDENT
2840 #undef DEF_ATTR_TREE_LIST
2844 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2846 static void c_init_attributes (void);
2848 /* Build tree nodes and builtin functions common to both C and C++ language
2852 c_common_nodes_and_builtins (void)
2856 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2857 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2858 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2859 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2860 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2861 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2862 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2863 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2864 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2865 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2866 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2867 #include "builtin-types.def"
2868 #undef DEF_PRIMITIVE_TYPE
2869 #undef DEF_FUNCTION_TYPE_0
2870 #undef DEF_FUNCTION_TYPE_1
2871 #undef DEF_FUNCTION_TYPE_2
2872 #undef DEF_FUNCTION_TYPE_3
2873 #undef DEF_FUNCTION_TYPE_4
2874 #undef DEF_FUNCTION_TYPE_VAR_0
2875 #undef DEF_FUNCTION_TYPE_VAR_1
2876 #undef DEF_FUNCTION_TYPE_VAR_2
2877 #undef DEF_FUNCTION_TYPE_VAR_3
2878 #undef DEF_POINTER_TYPE
2882 typedef enum builtin_type builtin_type;
2884 tree builtin_types[(int) BT_LAST];
2885 int wchar_type_size;
2886 tree array_domain_type;
2887 tree va_list_ref_type_node;
2888 tree va_list_arg_type_node;
2890 /* Define `int' and `char' first so that dbx will output them first. */
2891 record_builtin_type (RID_INT, NULL, integer_type_node);
2892 record_builtin_type (RID_CHAR, "char", char_type_node);
2894 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2895 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2896 but not C. Are the conditionals here needed? */
2897 if (c_dialect_cxx ())
2898 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
2899 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
2900 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
2901 record_builtin_type (RID_MAX, "long unsigned int",
2902 long_unsigned_type_node);
2903 if (c_dialect_cxx ())
2904 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
2905 record_builtin_type (RID_MAX, "long long int",
2906 long_long_integer_type_node);
2907 record_builtin_type (RID_MAX, "long long unsigned int",
2908 long_long_unsigned_type_node);
2909 if (c_dialect_cxx ())
2910 record_builtin_type (RID_MAX, "long long unsigned",
2911 long_long_unsigned_type_node);
2912 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
2913 record_builtin_type (RID_MAX, "short unsigned int",
2914 short_unsigned_type_node);
2915 if (c_dialect_cxx ())
2916 record_builtin_type (RID_MAX, "unsigned short",
2917 short_unsigned_type_node);
2919 /* Define both `signed char' and `unsigned char'. */
2920 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
2921 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
2923 /* These are types that c_common_type_for_size and
2924 c_common_type_for_mode use. */
2925 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2927 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2929 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2931 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2933 #if HOST_BITS_PER_WIDE_INT >= 64
2934 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2935 get_identifier ("__int128_t"),
2938 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2939 unsigned_intQI_type_node));
2940 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2941 unsigned_intHI_type_node));
2942 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2943 unsigned_intSI_type_node));
2944 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2945 unsigned_intDI_type_node));
2946 #if HOST_BITS_PER_WIDE_INT >= 64
2947 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2948 get_identifier ("__uint128_t"),
2949 unsigned_intTI_type_node));
2952 /* Create the widest literal types. */
2953 widest_integer_literal_type_node
2954 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
2955 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2956 widest_integer_literal_type_node));
2958 widest_unsigned_literal_type_node
2959 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
2960 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2961 widest_unsigned_literal_type_node));
2963 /* `unsigned long' is the standard type for sizeof.
2964 Note that stddef.h uses `unsigned long',
2965 and this must agree, even if long and int are the same size. */
2967 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
2968 signed_size_type_node = c_common_signed_type (size_type_node);
2969 set_sizetype (size_type_node);
2972 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
2974 build_common_tree_nodes_2 (flag_short_double);
2976 record_builtin_type (RID_FLOAT, NULL, float_type_node);
2977 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
2978 record_builtin_type (RID_MAX, "long double", long_double_type_node);
2980 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2981 get_identifier ("complex int"),
2982 complex_integer_type_node));
2983 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2984 get_identifier ("complex float"),
2985 complex_float_type_node));
2986 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2987 get_identifier ("complex double"),
2988 complex_double_type_node));
2989 lang_hooks.decls.pushdecl
2990 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
2991 complex_long_double_type_node));
2993 if (c_dialect_cxx ())
2994 /* For C++, make fileptr_type_node a distinct void * type until
2995 FILE type is defined. */
2996 fileptr_type_node = build_type_copy (ptr_type_node);
2998 record_builtin_type (RID_VOID, NULL, void_type_node);
3000 void_zero_node = build_int_2 (0, 0);
3001 TREE_TYPE (void_zero_node) = void_type_node;
3003 void_list_node = build_void_list_node ();
3005 /* Make a type to be the domain of a few array types
3006 whose domains don't really matter.
3007 200 is small enough that it always fits in size_t
3008 and large enough that it can hold most function names for the
3009 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3010 array_domain_type = build_index_type (size_int (200));
3012 /* Make a type for arrays of characters.
3013 With luck nothing will ever really depend on the length of this
3015 char_array_type_node
3016 = build_array_type (char_type_node, array_domain_type);
3018 /* Likewise for arrays of ints. */
3020 = build_array_type (integer_type_node, array_domain_type);
3022 string_type_node = build_pointer_type (char_type_node);
3023 const_string_type_node
3024 = build_pointer_type (build_qualified_type
3025 (char_type_node, TYPE_QUAL_CONST));
3027 /* This is special for C++ so functions can be overloaded. */
3028 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3029 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3030 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3031 if (c_dialect_cxx ())
3033 if (TYPE_UNSIGNED (wchar_type_node))
3034 wchar_type_node = make_unsigned_type (wchar_type_size);
3036 wchar_type_node = make_signed_type (wchar_type_size);
3037 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3041 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3042 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3045 /* This is for wide string constants. */
3046 wchar_array_type_node
3047 = build_array_type (wchar_type_node, array_domain_type);
3050 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3053 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3055 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3057 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3059 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3060 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3062 lang_hooks.decls.pushdecl
3063 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3064 va_list_type_node));
3066 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3068 va_list_arg_type_node = va_list_ref_type_node =
3069 build_pointer_type (TREE_TYPE (va_list_type_node));
3073 va_list_arg_type_node = va_list_type_node;
3074 va_list_ref_type_node = build_reference_type (va_list_type_node);
3077 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3078 builtin_types[(int) ENUM] = VALUE;
3079 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3080 builtin_types[(int) ENUM] \
3081 = build_function_type (builtin_types[(int) RETURN], \
3083 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3084 builtin_types[(int) ENUM] \
3085 = build_function_type (builtin_types[(int) RETURN], \
3086 tree_cons (NULL_TREE, \
3087 builtin_types[(int) ARG1], \
3089 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3090 builtin_types[(int) ENUM] \
3091 = build_function_type \
3092 (builtin_types[(int) RETURN], \
3093 tree_cons (NULL_TREE, \
3094 builtin_types[(int) ARG1], \
3095 tree_cons (NULL_TREE, \
3096 builtin_types[(int) ARG2], \
3098 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3099 builtin_types[(int) ENUM] \
3100 = build_function_type \
3101 (builtin_types[(int) RETURN], \
3102 tree_cons (NULL_TREE, \
3103 builtin_types[(int) ARG1], \
3104 tree_cons (NULL_TREE, \
3105 builtin_types[(int) ARG2], \
3106 tree_cons (NULL_TREE, \
3107 builtin_types[(int) ARG3], \
3109 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3110 builtin_types[(int) ENUM] \
3111 = build_function_type \
3112 (builtin_types[(int) RETURN], \
3113 tree_cons (NULL_TREE, \
3114 builtin_types[(int) ARG1], \
3115 tree_cons (NULL_TREE, \
3116 builtin_types[(int) ARG2], \
3119 builtin_types[(int) ARG3], \
3120 tree_cons (NULL_TREE, \
3121 builtin_types[(int) ARG4], \
3122 void_list_node)))));
3123 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3124 builtin_types[(int) ENUM] \
3125 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3126 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3127 builtin_types[(int) ENUM] \
3128 = build_function_type (builtin_types[(int) RETURN], \
3129 tree_cons (NULL_TREE, \
3130 builtin_types[(int) ARG1], \
3133 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3134 builtin_types[(int) ENUM] \
3135 = build_function_type \
3136 (builtin_types[(int) RETURN], \
3137 tree_cons (NULL_TREE, \
3138 builtin_types[(int) ARG1], \
3139 tree_cons (NULL_TREE, \
3140 builtin_types[(int) ARG2], \
3143 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3144 builtin_types[(int) ENUM] \
3145 = build_function_type \
3146 (builtin_types[(int) RETURN], \
3147 tree_cons (NULL_TREE, \
3148 builtin_types[(int) ARG1], \
3149 tree_cons (NULL_TREE, \
3150 builtin_types[(int) ARG2], \
3151 tree_cons (NULL_TREE, \
3152 builtin_types[(int) ARG3], \
3155 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3156 builtin_types[(int) ENUM] \
3157 = build_pointer_type (builtin_types[(int) TYPE]);
3158 #include "builtin-types.def"
3159 #undef DEF_PRIMITIVE_TYPE
3160 #undef DEF_FUNCTION_TYPE_1
3161 #undef DEF_FUNCTION_TYPE_2
3162 #undef DEF_FUNCTION_TYPE_3
3163 #undef DEF_FUNCTION_TYPE_4
3164 #undef DEF_FUNCTION_TYPE_VAR_0
3165 #undef DEF_FUNCTION_TYPE_VAR_1
3166 #undef DEF_FUNCTION_TYPE_VAR_2
3167 #undef DEF_FUNCTION_TYPE_VAR_3
3168 #undef DEF_POINTER_TYPE
3170 c_init_attributes ();
3172 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3173 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3178 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3182 decl = lang_hooks.builtin_function (NAME, builtin_types[TYPE], \
3186 ? (NAME + strlen ("__builtin_")) \
3188 built_in_attributes[(int) ATTRS]); \
3190 decl = builtin_function_2 (NAME, \
3191 NAME + strlen ("__builtin_"), \
3192 builtin_types[TYPE], \
3193 builtin_types[LIBTYPE], \
3198 built_in_attributes[(int) ATTRS]); \
3200 built_in_decls[(int) ENUM] = decl; \
3202 implicit_built_in_decls[(int) ENUM] = decl; \
3204 #include "builtins.def"
3207 targetm.init_builtins ();
3211 main_identifier_node = get_identifier ("main");
3215 build_va_arg (tree expr, tree type)
3217 return build1 (VA_ARG_EXPR, type, expr);
3221 /* Linked list of disabled built-in functions. */
3223 typedef struct disabled_builtin
3226 struct disabled_builtin *next;
3228 static disabled_builtin *disabled_builtins = NULL;
3230 static bool builtin_function_disabled_p (const char *);
3232 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3233 begins with "__builtin_", give an error. */
3236 disable_builtin_function (const char *name)
3238 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3239 error ("cannot disable built-in function `%s'", name);
3242 disabled_builtin *new = xmalloc (sizeof (disabled_builtin));
3244 new->next = disabled_builtins;
3245 disabled_builtins = new;
3250 /* Return true if the built-in function NAME has been disabled, false
3254 builtin_function_disabled_p (const char *name)
3256 disabled_builtin *p;
3257 for (p = disabled_builtins; p != NULL; p = p->next)
3259 if (strcmp (name, p->name) == 0)
3266 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3267 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3268 of these may be NULL (though both being NULL is useless).
3269 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3270 TYPE is the type of the function with the ordinary name. These
3271 may differ if the ordinary name is declared with a looser type to avoid
3272 conflicts with headers. FUNCTION_CODE and CLASS are as for
3273 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3274 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3275 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name;
3276 ATTRS is the tree list representing the builtin's function attributes.
3277 Returns the declaration of BUILTIN_NAME, if any, otherwise
3278 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3279 or if NONANSI_P and flag_no_nonansi_builtin. */
3282 builtin_function_2 (const char *builtin_name, const char *name,
3283 tree builtin_type, tree type, int function_code,
3284 enum built_in_class class, int library_name_p,
3285 int nonansi_p, tree attrs)
3287 tree bdecl = NULL_TREE;
3288 tree decl = NULL_TREE;
3290 if (builtin_name != 0)
3291 bdecl = lang_hooks.builtin_function (builtin_name, builtin_type,
3292 function_code, class,
3293 library_name_p ? name : NULL, attrs);
3295 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3296 && !(nonansi_p && flag_no_nonansi_builtin))
3297 decl = lang_hooks.builtin_function (name, type, function_code, class,
3300 return (bdecl != 0 ? bdecl : decl);
3303 /* Nonzero if the type T promotes to int. This is (nearly) the
3304 integral promotions defined in ISO C99 6.3.1.1/2. */
3307 c_promoting_integer_type_p (tree t)
3309 switch (TREE_CODE (t))
3312 return (TYPE_MAIN_VARIANT (t) == char_type_node
3313 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3314 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3315 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3316 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3317 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3320 /* ??? Technically all enumerations not larger than an int
3321 promote to an int. But this is used along code paths
3322 that only want to notice a size change. */
3323 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3333 /* Return 1 if PARMS specifies a fixed number of parameters
3334 and none of their types is affected by default promotions. */
3337 self_promoting_args_p (tree parms)
3340 for (t = parms; t; t = TREE_CHAIN (t))
3342 tree type = TREE_VALUE (t);
3344 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3350 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3353 if (c_promoting_integer_type_p (type))
3359 /* Recursively examines the array elements of TYPE, until a non-array
3360 element type is found. */
3363 strip_array_types (tree type)
3365 while (TREE_CODE (type) == ARRAY_TYPE)
3366 type = TREE_TYPE (type);
3371 /* Recursively remove any '*' or '&' operator from TYPE. */
3373 strip_pointer_operator (tree t)
3375 while (POINTER_TYPE_P (t))
3380 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3381 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3382 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3383 value, the traversal is aborted, and the value returned by FUNC is
3384 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3385 the node being visited are not walked.
3387 We don't need a without_duplicates variant of this one because the
3388 statement tree is a tree, not a graph. */
3391 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3393 enum tree_code code;
3398 #define WALK_SUBTREE(NODE) \
3401 result = walk_stmt_tree (&(NODE), func, data); \
3407 /* Skip empty subtrees. */
3411 /* Skip subtrees below non-statement nodes. */
3412 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3415 /* Call the function. */
3417 result = (*func) (tp, &walk_subtrees, data);
3419 /* If we found something, return it. */
3423 /* FUNC may have modified the tree, recheck that we're looking at a
3425 code = TREE_CODE (*tp);
3426 if (!STATEMENT_CODE_P (code))
3429 /* Visit the subtrees unless FUNC decided that there was nothing
3430 interesting below this point in the tree. */
3433 /* Walk over all the sub-trees of this operand. Statement nodes
3434 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3435 len = TREE_CODE_LENGTH (code);
3437 /* Go through the subtrees. We need to do this in forward order so
3438 that the scope of a FOR_EXPR is handled properly. */
3439 for (i = 0; i < len; ++i)
3440 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3443 /* Finally visit the chain. This can be tail-recursion optimized if
3444 we write it this way. */
3445 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3450 /* Used to compare case labels. K1 and K2 are actually tree nodes
3451 representing case labels, or NULL_TREE for a `default' label.
3452 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3453 K2, and 0 if K1 and K2 are equal. */
3456 case_compare (splay_tree_key k1, splay_tree_key k2)
3458 /* Consider a NULL key (such as arises with a `default' label) to be
3459 smaller than anything else. */
3465 return tree_int_cst_compare ((tree) k1, (tree) k2);
3468 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3469 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3470 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3471 case label was declared using the usual C/C++ syntax, rather than
3472 the GNU case range extension. CASES is a tree containing all the
3473 case ranges processed so far; COND is the condition for the
3474 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3475 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3478 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3479 tree low_value, tree high_value)
3484 splay_tree_node node;
3486 /* Create the LABEL_DECL itself. */
3487 label = create_artificial_label ();
3489 /* If there was an error processing the switch condition, bail now
3490 before we get more confused. */
3491 if (!cond || cond == error_mark_node)
3494 if ((low_value && TREE_TYPE (low_value)
3495 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3496 || (high_value && TREE_TYPE (high_value)
3497 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3498 error ("pointers are not permitted as case values");
3500 /* Case ranges are a GNU extension. */
3501 if (high_value && pedantic)
3502 pedwarn ("range expressions in switch statements are non-standard");
3504 type = TREE_TYPE (cond);
3507 low_value = check_case_value (low_value);
3508 low_value = convert_and_check (type, low_value);
3512 high_value = check_case_value (high_value);
3513 high_value = convert_and_check (type, high_value);
3516 /* If an error has occurred, bail out now. */
3517 if (low_value == error_mark_node || high_value == error_mark_node)
3520 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3521 really a case range, even though it was written that way. Remove
3522 the HIGH_VALUE to simplify later processing. */
3523 if (tree_int_cst_equal (low_value, high_value))
3524 high_value = NULL_TREE;
3525 if (low_value && high_value
3526 && !tree_int_cst_lt (low_value, high_value))
3527 warning ("empty range specified");
3529 /* See if the case is in range of the type of the original testing
3530 expression. If both low_value and high_value are out of range,
3531 don't insert the case label and return NULL_TREE. */
3533 && ! check_case_bounds (type, orig_type,
3534 &low_value, high_value ? &high_value : NULL))
3537 /* Look up the LOW_VALUE in the table of case labels we already
3539 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3540 /* If there was not an exact match, check for overlapping ranges.
3541 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3542 that's a `default' label and the only overlap is an exact match. */
3543 if (!node && (low_value || high_value))
3545 splay_tree_node low_bound;
3546 splay_tree_node high_bound;
3548 /* Even though there wasn't an exact match, there might be an
3549 overlap between this case range and another case range.
3550 Since we've (inductively) not allowed any overlapping case
3551 ranges, we simply need to find the greatest low case label
3552 that is smaller that LOW_VALUE, and the smallest low case
3553 label that is greater than LOW_VALUE. If there is an overlap
3554 it will occur in one of these two ranges. */
3555 low_bound = splay_tree_predecessor (cases,
3556 (splay_tree_key) low_value);
3557 high_bound = splay_tree_successor (cases,
3558 (splay_tree_key) low_value);
3560 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3561 the LOW_VALUE, so there is no need to check unless the
3562 LOW_BOUND is in fact itself a case range. */
3564 && CASE_HIGH ((tree) low_bound->value)
3565 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3568 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3569 range is bigger than the low end of the current range, so we
3570 are only interested if the current range is a real range, and
3571 not an ordinary case label. */
3574 && (tree_int_cst_compare ((tree) high_bound->key,
3579 /* If there was an overlap, issue an error. */
3582 tree duplicate = CASE_LABEL ((tree) node->value);
3586 error ("duplicate (or overlapping) case value");
3587 error ("%Jthis is the first entry overlapping that value", duplicate);
3591 error ("duplicate case value") ;
3592 error ("%Jpreviously used here", duplicate);
3596 error ("multiple default labels in one switch");
3597 error ("%Jthis is the first default label", duplicate);
3602 /* Add a CASE_LABEL to the statement-tree. */
3603 case_label = add_stmt (build_case_label (low_value, high_value, label));
3604 /* Register this case label in the splay tree. */
3605 splay_tree_insert (cases,
3606 (splay_tree_key) low_value,
3607 (splay_tree_value) case_label);
3612 /* Add a label so that the back-end doesn't think that the beginning of
3613 the switch is unreachable. Note that we do not add a case label, as
3614 that just leads to duplicates and thence to aborts later on. */
3617 tree t = create_artificial_label ();
3618 add_stmt (build_stmt (LABEL_EXPR, t));
3620 return error_mark_node;
3623 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3624 Used to verify that case values match up with enumerator values. */
3627 match_case_to_enum_1 (tree key, tree type, tree label)
3629 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3631 /* ??? Not working too hard to print the double-word value.
3632 Should perhaps be done with %lwd in the diagnostic routines? */
3633 if (TREE_INT_CST_HIGH (key) == 0)
3634 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3635 TREE_INT_CST_LOW (key));
3636 else if (!TYPE_UNSIGNED (type)
3637 && TREE_INT_CST_HIGH (key) == -1
3638 && TREE_INT_CST_LOW (key) != 0)
3639 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3640 -TREE_INT_CST_LOW (key));
3642 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3643 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3645 if (TYPE_NAME (type) == 0)
3646 warning ("%Jcase value `%s' not in enumerated type",
3647 CASE_LABEL (label), buf);
3649 warning ("%Jcase value `%s' not in enumerated type `%T'",
3650 CASE_LABEL (label), buf, type);
3654 match_case_to_enum (splay_tree_node node, void *data)
3656 tree label = (tree) node->value;
3659 /* Skip default case. */
3660 if (!CASE_LOW (label))
3663 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3664 when we did our enum->case scan. Reset our scratch bit after. */
3665 if (!TREE_ADDRESSABLE (label))
3666 match_case_to_enum_1 (CASE_LOW (label), type, label);
3668 TREE_ADDRESSABLE (label) = 0;
3670 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3671 Note that the old code in stmt.c did not check for the values in
3672 the range either, just the endpoints. */
3673 if (CASE_HIGH (label))
3675 tree chain, key = CASE_HIGH (label);
3677 for (chain = TYPE_VALUES (type);
3678 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
3679 chain = TREE_CHAIN (chain))
3682 match_case_to_enum_1 (key, type, label);
3688 /* Handle -Wswitch*. Called from the front end after parsing the switch
3690 /* ??? Should probably be somewhere generic, since other languages besides
3691 C and C++ would want this. We'd want to agree on the datastructure,
3692 however, which is a problem. Alternately, we operate on gimplified
3693 switch_exprs, which I don't especially like. At the moment, however,
3694 C/C++ are the only tree-ssa languages that support enumerations at all,
3695 so the point is moot. */
3698 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
3700 splay_tree_node default_node;
3701 location_t switch_location;
3704 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
3707 if (EXPR_HAS_LOCATION (switch_stmt))
3708 switch_location = EXPR_LOCATION (switch_stmt);
3710 switch_location = input_location;
3712 type = SWITCH_TYPE (switch_stmt);
3714 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3715 if (warn_switch_default && !default_node)
3716 warning ("%Hswitch missing default case", &switch_location);
3718 /* If the switch expression was an enumerated type, check that
3719 exactly all enumeration literals are covered by the cases.
3720 The check is made when -Wswitch was specified and there is no
3721 default case, or when -Wswitch-enum was specified. */
3722 if (((warn_switch && !default_node) || warn_switch_enum)
3723 && type && TREE_CODE (type) == ENUMERAL_TYPE
3724 && TREE_CODE (SWITCH_COND (switch_stmt)) != INTEGER_CST)
3728 /* The time complexity here is O(N*lg(N)) worst case, but for the
3729 common case of monotonically increasing enumerators, it is
3730 O(N), since the nature of the splay tree will keep the next
3731 element adjacent to the root at all times. */
3733 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
3735 splay_tree_node node
3736 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
3740 /* Mark the CASE_LOW part of the case entry as seen, so
3741 that we save time later. Choose TREE_ADDRESSABLE
3742 randomly as a bit that won't have been set to-date. */
3743 tree label = (tree) node->value;
3744 TREE_ADDRESSABLE (label) = 1;
3748 /* Warn if there are enumerators that don't correspond to
3749 case expressions. */
3750 warning ("%Henumeration value `%E' not handled in switch",
3751 &switch_location, TREE_PURPOSE (chain));
3755 /* Warn if there are case expressions that don't correspond to
3756 enumerators. This can occur since C and C++ don't enforce
3757 type-checking of assignments to enumeration variables.
3759 The time complexity here is O(N**2) worst case, since we've
3760 not sorted the enumeration values. However, in the absence
3761 of case ranges this is O(N), since all single cases that
3762 corresponded to enumerations have been marked above. */
3764 splay_tree_foreach (cases, match_case_to_enum, type);
3768 /* Finish an expression taking the address of LABEL (an
3769 IDENTIFIER_NODE). Returns an expression for the address. */
3772 finish_label_address_expr (tree label)
3777 pedwarn ("taking the address of a label is non-standard");
3779 if (label == error_mark_node)
3780 return error_mark_node;
3782 label = lookup_label (label);
3783 if (label == NULL_TREE)
3784 result = null_pointer_node;
3787 TREE_USED (label) = 1;
3788 result = build1 (ADDR_EXPR, ptr_type_node, label);
3789 /* The current function in not necessarily uninlinable.
3790 Computed gotos are incompatible with inlining, but the value
3791 here could be used only in a diagnostic, for example. */
3797 /* Hook used by expand_expr to expand language-specific tree codes. */
3798 /* The only things that should go here are bits needed to expand
3799 constant initializers. Everything else should be handled by the
3800 gimplification routines. */
3803 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
3804 int modifier /* Actually enum_modifier. */,
3807 switch (TREE_CODE (exp))
3809 case COMPOUND_LITERAL_EXPR:
3811 /* Initialize the anonymous variable declared in the compound
3812 literal, then return the variable. */
3813 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
3814 emit_local_var (decl);
3815 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
3823 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
3826 c_common_unsafe_for_reeval (tree exp)
3828 /* Statement expressions may not be reevaluated, likewise compound
3830 if (TREE_CODE (exp) == STMT_EXPR
3831 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
3834 /* Walk all other expressions. */
3838 /* Hook used by staticp to handle language-specific tree codes. */
3841 c_staticp (tree exp)
3843 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
3844 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
3850 /* Given a boolean expression ARG, return a tree representing an increment
3851 or decrement (as indicated by CODE) of ARG. The front end must check for
3852 invalid cases (e.g., decrement in C++). */
3854 boolean_increment (enum tree_code code, tree arg)
3857 tree true_res = boolean_true_node;
3859 arg = stabilize_reference (arg);
3862 case PREINCREMENT_EXPR:
3863 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3865 case POSTINCREMENT_EXPR:
3866 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3867 arg = save_expr (arg);
3868 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3869 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3871 case PREDECREMENT_EXPR:
3872 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
3874 case POSTDECREMENT_EXPR:
3875 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
3876 arg = save_expr (arg);
3877 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3878 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3883 TREE_SIDE_EFFECTS (val) = 1;
3887 /* Built-in macros for stddef.h, that require macros defined in this
3890 c_stddef_cpp_builtins(void)
3892 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
3893 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
3894 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
3895 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
3899 c_init_attributes (void)
3901 /* Fill in the built_in_attributes array. */
3902 #define DEF_ATTR_NULL_TREE(ENUM) \
3903 built_in_attributes[(int) ENUM] = NULL_TREE;
3904 #define DEF_ATTR_INT(ENUM, VALUE) \
3905 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
3906 #define DEF_ATTR_IDENT(ENUM, STRING) \
3907 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3908 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3909 built_in_attributes[(int) ENUM] \
3910 = tree_cons (built_in_attributes[(int) PURPOSE], \
3911 built_in_attributes[(int) VALUE], \
3912 built_in_attributes[(int) CHAIN]);
3913 #include "builtin-attrs.def"
3914 #undef DEF_ATTR_NULL_TREE
3916 #undef DEF_ATTR_IDENT
3917 #undef DEF_ATTR_TREE_LIST
3920 /* Attribute handlers common to C front ends. */
3922 /* Handle a "packed" attribute; arguments as in
3923 struct attribute_spec.handler. */
3926 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3927 int flags, bool *no_add_attrs)
3931 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3932 *node = build_type_copy (*node);
3933 TYPE_PACKED (*node) = 1;
3934 if (TYPE_MAIN_VARIANT (*node) == *node)
3936 /* If it is the main variant, then pack the other variants
3937 too. This happens in,
3940 struct Foo const *ptr; // creates a variant w/o packed flag
3941 } __ attribute__((packed)); // packs it now.
3945 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
3946 TYPE_PACKED (probe) = 1;
3950 else if (TREE_CODE (*node) == FIELD_DECL)
3951 DECL_PACKED (*node) = 1;
3952 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
3953 used for DECL_REGISTER. It wouldn't mean anything anyway.
3954 We can't set DECL_PACKED on the type of a TYPE_DECL, because
3955 that changes what the typedef is typing. */
3958 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3959 *no_add_attrs = true;
3965 /* Handle a "nocommon" attribute; arguments as in
3966 struct attribute_spec.handler. */
3969 handle_nocommon_attribute (tree *node, tree name,
3970 tree ARG_UNUSED (args),
3971 int ARG_UNUSED (flags), bool *no_add_attrs)
3973 if (TREE_CODE (*node) == VAR_DECL)
3974 DECL_COMMON (*node) = 0;
3977 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3978 *no_add_attrs = true;
3984 /* Handle a "common" attribute; arguments as in
3985 struct attribute_spec.handler. */
3988 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3989 int ARG_UNUSED (flags), bool *no_add_attrs)
3991 if (TREE_CODE (*node) == VAR_DECL)
3992 DECL_COMMON (*node) = 1;
3995 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3996 *no_add_attrs = true;
4002 /* Handle a "noreturn" attribute; arguments as in
4003 struct attribute_spec.handler. */
4006 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4007 int ARG_UNUSED (flags), bool *no_add_attrs)
4009 tree type = TREE_TYPE (*node);
4011 /* See FIXME comment in c_common_attribute_table. */
4012 if (TREE_CODE (*node) == FUNCTION_DECL)
4013 TREE_THIS_VOLATILE (*node) = 1;
4014 else if (TREE_CODE (type) == POINTER_TYPE
4015 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4017 = build_pointer_type
4018 (build_type_variant (TREE_TYPE (type),
4019 TYPE_READONLY (TREE_TYPE (type)), 1));
4022 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4023 *no_add_attrs = true;
4029 /* Handle a "noinline" attribute; arguments as in
4030 struct attribute_spec.handler. */
4033 handle_noinline_attribute (tree *node, tree name,
4034 tree ARG_UNUSED (args),
4035 int ARG_UNUSED (flags), bool *no_add_attrs)
4037 if (TREE_CODE (*node) == FUNCTION_DECL)
4038 DECL_UNINLINABLE (*node) = 1;
4041 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4042 *no_add_attrs = true;
4048 /* Handle a "always_inline" attribute; arguments as in
4049 struct attribute_spec.handler. */
4052 handle_always_inline_attribute (tree *node, tree name,
4053 tree ARG_UNUSED (args),
4054 int ARG_UNUSED (flags),
4057 if (TREE_CODE (*node) == FUNCTION_DECL)
4059 /* Do nothing else, just set the attribute. We'll get at
4060 it later with lookup_attribute. */
4064 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4065 *no_add_attrs = true;
4071 /* Handle a "used" attribute; arguments as in
4072 struct attribute_spec.handler. */
4075 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4076 int ARG_UNUSED (flags), bool *no_add_attrs)
4080 if (TREE_CODE (node) == FUNCTION_DECL
4081 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4083 TREE_USED (node) = 1;
4087 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4088 *no_add_attrs = true;
4094 /* Handle a "unused" attribute; arguments as in
4095 struct attribute_spec.handler. */
4098 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4099 int flags, bool *no_add_attrs)
4105 if (TREE_CODE (decl) == PARM_DECL
4106 || TREE_CODE (decl) == VAR_DECL
4107 || TREE_CODE (decl) == FUNCTION_DECL
4108 || TREE_CODE (decl) == LABEL_DECL
4109 || TREE_CODE (decl) == TYPE_DECL)
4110 TREE_USED (decl) = 1;
4113 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4114 *no_add_attrs = true;
4119 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4120 *node = build_type_copy (*node);
4121 TREE_USED (*node) = 1;
4127 /* Handle a "const" attribute; arguments as in
4128 struct attribute_spec.handler. */
4131 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4132 int ARG_UNUSED (flags), bool *no_add_attrs)
4134 tree type = TREE_TYPE (*node);
4136 /* See FIXME comment on noreturn in c_common_attribute_table. */
4137 if (TREE_CODE (*node) == FUNCTION_DECL)
4138 TREE_READONLY (*node) = 1;
4139 else if (TREE_CODE (type) == POINTER_TYPE
4140 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4142 = build_pointer_type
4143 (build_type_variant (TREE_TYPE (type), 1,
4144 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4147 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4148 *no_add_attrs = true;
4154 /* Handle a "transparent_union" attribute; arguments as in
4155 struct attribute_spec.handler. */
4158 handle_transparent_union_attribute (tree *node, tree name,
4159 tree ARG_UNUSED (args), int flags,
4162 tree decl = NULL_TREE;
4169 type = &TREE_TYPE (decl);
4170 is_type = TREE_CODE (*node) == TYPE_DECL;
4172 else if (TYPE_P (*node))
4173 type = node, is_type = 1;
4176 && TREE_CODE (*type) == UNION_TYPE
4178 || (TYPE_FIELDS (*type) != 0
4179 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4181 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4182 *type = build_type_copy (*type);
4183 TYPE_TRANSPARENT_UNION (*type) = 1;
4185 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4186 && TREE_CODE (*type) == UNION_TYPE
4187 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4188 DECL_TRANSPARENT_UNION (decl) = 1;
4191 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4192 *no_add_attrs = true;
4198 /* Handle a "constructor" attribute; arguments as in
4199 struct attribute_spec.handler. */
4202 handle_constructor_attribute (tree *node, tree name,
4203 tree ARG_UNUSED (args),
4204 int ARG_UNUSED (flags),
4208 tree type = TREE_TYPE (decl);
4210 if (TREE_CODE (decl) == FUNCTION_DECL
4211 && TREE_CODE (type) == FUNCTION_TYPE
4212 && decl_function_context (decl) == 0)
4214 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4215 TREE_USED (decl) = 1;
4219 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4220 *no_add_attrs = true;
4226 /* Handle a "destructor" attribute; arguments as in
4227 struct attribute_spec.handler. */
4230 handle_destructor_attribute (tree *node, tree name,
4231 tree ARG_UNUSED (args),
4232 int ARG_UNUSED (flags),
4236 tree type = TREE_TYPE (decl);
4238 if (TREE_CODE (decl) == FUNCTION_DECL
4239 && TREE_CODE (type) == FUNCTION_TYPE
4240 && decl_function_context (decl) == 0)
4242 DECL_STATIC_DESTRUCTOR (decl) = 1;
4243 TREE_USED (decl) = 1;
4247 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4248 *no_add_attrs = true;
4254 /* Handle a "mode" attribute; arguments as in
4255 struct attribute_spec.handler. */
4258 handle_mode_attribute (tree *node, tree name, tree args,
4259 int ARG_UNUSED (flags), bool *no_add_attrs)
4263 *no_add_attrs = true;
4265 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4266 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4270 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4271 int len = strlen (p);
4272 enum machine_mode mode = VOIDmode;
4276 if (len > 4 && p[0] == '_' && p[1] == '_'
4277 && p[len - 1] == '_' && p[len - 2] == '_')
4279 char *newp = alloca (len - 1);
4281 strcpy (newp, &p[2]);
4282 newp[len - 4] = '\0';
4286 /* Change this type to have a type with the specified mode.
4287 First check for the special modes. */
4288 if (! strcmp (p, "byte"))
4290 else if (!strcmp (p, "word"))
4292 else if (! strcmp (p, "pointer"))
4295 for (j = 0; j < NUM_MACHINE_MODES; j++)
4296 if (!strcmp (p, GET_MODE_NAME (j)))
4297 mode = (enum machine_mode) j;
4299 if (mode == VOIDmode)
4301 error ("unknown machine mode `%s'", p);
4305 if (VECTOR_MODE_P (mode))
4307 warning ("specifying vector types with __attribute__ ((mode)) "
4309 warning ("use __attribute__ ((vector_size)) instead");
4312 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4313 if (typefm == NULL_TREE)
4314 error ("no data type for mode `%s'", p);
4316 else if ((TREE_CODE (type) == POINTER_TYPE
4317 || TREE_CODE (type) == REFERENCE_TYPE)
4318 && !targetm.valid_pointer_mode (mode))
4319 error ("invalid pointer mode `%s'", p);
4322 /* If this is a vector, make sure we either have hardware
4323 support, or we can emulate it. */
4324 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4326 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4330 if (TREE_CODE (type) == POINTER_TYPE)
4332 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4336 else if (TREE_CODE (type) == REFERENCE_TYPE)
4338 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4344 /* No need to layout the type here. The caller should do this. */
4351 /* Handle a "section" attribute; arguments as in
4352 struct attribute_spec.handler. */
4355 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4356 int ARG_UNUSED (flags), bool *no_add_attrs)
4360 if (targetm.have_named_sections)
4362 if ((TREE_CODE (decl) == FUNCTION_DECL
4363 || TREE_CODE (decl) == VAR_DECL)
4364 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4366 if (TREE_CODE (decl) == VAR_DECL
4367 && current_function_decl != NULL_TREE
4368 && ! TREE_STATIC (decl))
4370 error ("%Jsection attribute cannot be specified for "
4371 "local variables", decl);
4372 *no_add_attrs = true;
4375 /* The decl may have already been given a section attribute
4376 from a previous declaration. Ensure they match. */
4377 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4378 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4379 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4381 error ("%Jsection of '%D' conflicts with previous declaration",
4383 *no_add_attrs = true;
4386 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4390 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4391 *no_add_attrs = true;
4396 error ("%Jsection attributes are not supported for this target", *node);
4397 *no_add_attrs = true;
4403 /* Handle a "aligned" attribute; arguments as in
4404 struct attribute_spec.handler. */
4407 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4408 int flags, bool *no_add_attrs)
4410 tree decl = NULL_TREE;
4413 tree align_expr = (args ? TREE_VALUE (args)
4414 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4420 type = &TREE_TYPE (decl);
4421 is_type = TREE_CODE (*node) == TYPE_DECL;
4423 else if (TYPE_P (*node))
4424 type = node, is_type = 1;
4426 /* Strip any NOPs of any kind. */
4427 while (TREE_CODE (align_expr) == NOP_EXPR
4428 || TREE_CODE (align_expr) == CONVERT_EXPR
4429 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4430 align_expr = TREE_OPERAND (align_expr, 0);
4432 if (TREE_CODE (align_expr) != INTEGER_CST)
4434 error ("requested alignment is not a constant");
4435 *no_add_attrs = true;
4437 else if ((i = tree_log2 (align_expr)) == -1)
4439 error ("requested alignment is not a power of 2");
4440 *no_add_attrs = true;
4442 else if (i > HOST_BITS_PER_INT - 2)
4444 error ("requested alignment is too large");
4445 *no_add_attrs = true;
4449 /* If we have a TYPE_DECL, then copy the type, so that we
4450 don't accidentally modify a builtin type. See pushdecl. */
4451 if (decl && TREE_TYPE (decl) != error_mark_node
4452 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4454 tree tt = TREE_TYPE (decl);
4455 *type = build_type_copy (*type);
4456 DECL_ORIGINAL_TYPE (decl) = tt;
4457 TYPE_NAME (*type) = decl;
4458 TREE_USED (*type) = TREE_USED (decl);
4459 TREE_TYPE (decl) = *type;
4461 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4462 *type = build_type_copy (*type);
4464 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4465 TYPE_USER_ALIGN (*type) = 1;
4467 else if (TREE_CODE (decl) != VAR_DECL
4468 && TREE_CODE (decl) != FIELD_DECL)
4470 error ("%Jalignment may not be specified for '%D'", decl, decl);
4471 *no_add_attrs = true;
4475 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4476 DECL_USER_ALIGN (decl) = 1;
4482 /* Handle a "weak" attribute; arguments as in
4483 struct attribute_spec.handler. */
4486 handle_weak_attribute (tree *node, tree ARG_UNUSED (name),
4487 tree ARG_UNUSED (args),
4488 int ARG_UNUSED (flags),
4489 bool * ARG_UNUSED (no_add_attrs))
4491 declare_weak (*node);
4496 /* Handle an "alias" attribute; arguments as in
4497 struct attribute_spec.handler. */
4500 handle_alias_attribute (tree *node, tree name, tree args,
4501 int ARG_UNUSED (flags), bool *no_add_attrs)
4505 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4506 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4508 error ("%J'%D' defined both normally and as an alias", decl, decl);
4509 *no_add_attrs = true;
4512 /* Note that the very first time we process a nested declaration,
4513 decl_function_context will not be set. Indeed, *would* never
4514 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4515 we do below. After such frobbery, pushdecl would set the context.
4516 In any case, this is never what we want. */
4517 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4521 id = TREE_VALUE (args);
4522 if (TREE_CODE (id) != STRING_CST)
4524 error ("alias arg not a string");
4525 *no_add_attrs = true;
4528 id = get_identifier (TREE_STRING_POINTER (id));
4529 /* This counts as a use of the object pointed to. */
4532 if (TREE_CODE (decl) == FUNCTION_DECL)
4533 DECL_INITIAL (decl) = error_mark_node;
4536 DECL_EXTERNAL (decl) = 0;
4537 TREE_STATIC (decl) = 1;
4542 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4543 *no_add_attrs = true;
4549 /* Handle an "visibility" attribute; arguments as in
4550 struct attribute_spec.handler. */
4553 handle_visibility_attribute (tree *node, tree name, tree args,
4554 int ARG_UNUSED (flags),
4558 tree id = TREE_VALUE (args);
4560 *no_add_attrs = true;
4562 if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4564 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4568 if (TREE_CODE (id) != STRING_CST)
4570 error ("visibility arg not a string");
4574 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4575 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4576 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4577 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4578 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4579 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4580 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4581 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4583 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4588 /* Handle an "tls_model" attribute; arguments as in
4589 struct attribute_spec.handler. */
4592 handle_tls_model_attribute (tree *node, tree name, tree args,
4593 int ARG_UNUSED (flags), bool *no_add_attrs)
4597 if (! DECL_THREAD_LOCAL (decl))
4599 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4600 *no_add_attrs = true;
4606 id = TREE_VALUE (args);
4607 if (TREE_CODE (id) != STRING_CST)
4609 error ("tls_model arg not a string");
4610 *no_add_attrs = true;
4613 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4614 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4615 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4616 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4618 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4619 *no_add_attrs = true;
4627 /* Handle a "no_instrument_function" attribute; arguments as in
4628 struct attribute_spec.handler. */
4631 handle_no_instrument_function_attribute (tree *node, tree name,
4632 tree ARG_UNUSED (args),
4633 int ARG_UNUSED (flags),
4638 if (TREE_CODE (decl) != FUNCTION_DECL)
4640 error ("%J'%E' attribute applies only to functions", decl, name);
4641 *no_add_attrs = true;
4643 else if (DECL_INITIAL (decl))
4645 error ("%Jcan't set '%E' attribute after definition", decl, name);
4646 *no_add_attrs = true;
4649 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4654 /* Handle a "malloc" attribute; arguments as in
4655 struct attribute_spec.handler. */
4658 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4659 int ARG_UNUSED (flags), bool *no_add_attrs)
4661 if (TREE_CODE (*node) == FUNCTION_DECL)
4662 DECL_IS_MALLOC (*node) = 1;
4663 /* ??? TODO: Support types. */
4666 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4667 *no_add_attrs = true;
4673 /* Handle a "no_limit_stack" attribute; arguments as in
4674 struct attribute_spec.handler. */
4677 handle_no_limit_stack_attribute (tree *node, tree name,
4678 tree ARG_UNUSED (args),
4679 int ARG_UNUSED (flags),
4684 if (TREE_CODE (decl) != FUNCTION_DECL)
4686 error ("%J'%E' attribute applies only to functions", decl, name);
4687 *no_add_attrs = true;
4689 else if (DECL_INITIAL (decl))
4691 error ("%Jcan't set '%E' attribute after definition", decl, name);
4692 *no_add_attrs = true;
4695 DECL_NO_LIMIT_STACK (decl) = 1;
4700 /* Handle a "pure" attribute; arguments as in
4701 struct attribute_spec.handler. */
4704 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4705 int ARG_UNUSED (flags), bool *no_add_attrs)
4707 if (TREE_CODE (*node) == FUNCTION_DECL)
4708 DECL_IS_PURE (*node) = 1;
4709 /* ??? TODO: Support types. */
4712 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4713 *no_add_attrs = true;
4719 /* Handle a "deprecated" attribute; arguments as in
4720 struct attribute_spec.handler. */
4723 handle_deprecated_attribute (tree *node, tree name,
4724 tree ARG_UNUSED (args), int flags,
4727 tree type = NULL_TREE;
4729 const char *what = NULL;
4734 type = TREE_TYPE (decl);
4736 if (TREE_CODE (decl) == TYPE_DECL
4737 || TREE_CODE (decl) == PARM_DECL
4738 || TREE_CODE (decl) == VAR_DECL
4739 || TREE_CODE (decl) == FUNCTION_DECL
4740 || TREE_CODE (decl) == FIELD_DECL)
4741 TREE_DEPRECATED (decl) = 1;
4745 else if (TYPE_P (*node))
4747 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4748 *node = build_type_copy (*node);
4749 TREE_DEPRECATED (*node) = 1;
4757 *no_add_attrs = true;
4758 if (type && TYPE_NAME (type))
4760 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
4761 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
4762 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
4763 && DECL_NAME (TYPE_NAME (type)))
4764 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
4767 warning ("`%s' attribute ignored for `%s'",
4768 IDENTIFIER_POINTER (name), what);
4770 warning ("`%s' attribute ignored",
4771 IDENTIFIER_POINTER (name));
4777 /* Handle a "vector_size" attribute; arguments as in
4778 struct attribute_spec.handler. */
4781 handle_vector_size_attribute (tree *node, tree name, tree args,
4782 int ARG_UNUSED (flags),
4785 unsigned HOST_WIDE_INT vecsize, nunits;
4786 enum machine_mode orig_mode;
4787 tree type = *node, new_type, size;
4789 *no_add_attrs = true;
4791 /* Stripping NON_LVALUE_EXPR allows declarations such as
4792 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
4793 size = TREE_VALUE (args);
4794 if (TREE_CODE (size) == NON_LVALUE_EXPR)
4795 size = TREE_OPERAND (size, 0);
4797 if (! host_integerp (size, 1))
4799 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4803 /* Get the vector size (in bytes). */
4804 vecsize = tree_low_cst (size, 1);
4806 /* We need to provide for vector pointers, vector arrays, and
4807 functions returning vectors. For example:
4809 __attribute__((vector_size(16))) short *foo;
4811 In this case, the mode is SI, but the type being modified is
4812 HI, so we need to look further. */
4814 while (POINTER_TYPE_P (type)
4815 || TREE_CODE (type) == FUNCTION_TYPE
4816 || TREE_CODE (type) == METHOD_TYPE
4817 || TREE_CODE (type) == ARRAY_TYPE)
4818 type = TREE_TYPE (type);
4820 /* Get the mode of the type being modified. */
4821 orig_mode = TYPE_MODE (type);
4823 if (TREE_CODE (type) == RECORD_TYPE
4824 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
4825 && GET_MODE_CLASS (orig_mode) != MODE_INT)
4826 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
4828 error ("invalid vector type for attribute `%s'",
4829 IDENTIFIER_POINTER (name));
4833 /* Calculate how many units fit in the vector. */
4834 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
4835 if (nunits & (nunits - 1))
4837 error ("number of components of the vector not a power of two");
4841 new_type = build_vector_type (type, nunits);
4843 /* Build back pointers if needed. */
4844 *node = reconstruct_complex_type (*node, new_type);
4849 /* Handle the "nonnull" attribute. */
4851 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
4852 tree args, int ARG_UNUSED (flags),
4856 unsigned HOST_WIDE_INT attr_arg_num;
4858 /* If no arguments are specified, all pointer arguments should be
4859 non-null. Verify a full prototype is given so that the arguments
4860 will have the correct types when we actually check them later. */
4863 if (! TYPE_ARG_TYPES (type))
4865 error ("nonnull attribute without arguments on a non-prototype");
4866 *no_add_attrs = true;
4871 /* Argument list specified. Verify that each argument number references
4872 a pointer argument. */
4873 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
4876 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
4878 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
4880 error ("nonnull argument has invalid operand number (arg %lu)",
4881 (unsigned long) attr_arg_num);
4882 *no_add_attrs = true;
4886 argument = TYPE_ARG_TYPES (type);
4889 for (ck_num = 1; ; ck_num++)
4891 if (! argument || ck_num == arg_num)
4893 argument = TREE_CHAIN (argument);
4897 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
4899 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
4900 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4901 *no_add_attrs = true;
4905 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
4907 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
4908 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4909 *no_add_attrs = true;
4918 /* Check the argument list of a function call for null in argument slots
4919 that are marked as requiring a non-null pointer argument. */
4922 check_function_nonnull (tree attrs, tree params)
4924 tree a, args, param;
4927 for (a = attrs; a; a = TREE_CHAIN (a))
4929 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
4931 args = TREE_VALUE (a);
4933 /* Walk the argument list. If we encounter an argument number we
4934 should check for non-null, do it. If the attribute has no args,
4935 then every pointer argument is checked (in which case the check
4936 for pointer type is done in check_nonnull_arg). */
4937 for (param = params, param_num = 1; ;
4938 param_num++, param = TREE_CHAIN (param))
4942 if (! args || nonnull_check_p (args, param_num))
4943 check_function_arguments_recurse (check_nonnull_arg, NULL,
4951 /* Helper for check_function_nonnull; given a list of operands which
4952 must be non-null in ARGS, determine if operand PARAM_NUM should be
4956 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
4958 unsigned HOST_WIDE_INT arg_num = 0;
4960 for (; args; args = TREE_CHAIN (args))
4962 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
4965 if (arg_num == param_num)
4971 /* Check that the function argument PARAM (which is operand number
4972 PARAM_NUM) is non-null. This is called by check_function_nonnull
4973 via check_function_arguments_recurse. */
4976 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
4977 unsigned HOST_WIDE_INT param_num)
4979 /* Just skip checking the argument if it's not a pointer. This can
4980 happen if the "nonnull" attribute was given without an operand
4981 list (which means to check every pointer argument). */
4983 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
4986 if (integer_zerop (param))
4987 warning ("null argument where non-null required (arg %lu)",
4988 (unsigned long) param_num);
4991 /* Helper for nonnull attribute handling; fetch the operand number
4992 from the attribute argument list. */
4995 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
4997 /* Strip any conversions from the arg number and verify they
4999 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5000 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5001 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5002 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5004 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5005 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5008 *valp = TREE_INT_CST_LOW (arg_num_expr);
5012 /* Handle a "nothrow" attribute; arguments as in
5013 struct attribute_spec.handler. */
5016 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5017 int ARG_UNUSED (flags), bool *no_add_attrs)
5019 if (TREE_CODE (*node) == FUNCTION_DECL)
5020 TREE_NOTHROW (*node) = 1;
5021 /* ??? TODO: Support types. */
5024 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5025 *no_add_attrs = true;
5031 /* Handle a "cleanup" attribute; arguments as in
5032 struct attribute_spec.handler. */
5035 handle_cleanup_attribute (tree *node, tree name, tree args,
5036 int ARG_UNUSED (flags), bool *no_add_attrs)
5039 tree cleanup_id, cleanup_decl;
5041 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5042 for global destructors in C++. This requires infrastructure that
5043 we don't have generically at the moment. It's also not a feature
5044 we'd be missing too much, since we do have attribute constructor. */
5045 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5047 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5048 *no_add_attrs = true;
5052 /* Verify that the argument is a function in scope. */
5053 /* ??? We could support pointers to functions here as well, if
5054 that was considered desirable. */
5055 cleanup_id = TREE_VALUE (args);
5056 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5058 error ("cleanup arg not an identifier");
5059 *no_add_attrs = true;
5062 cleanup_decl = lookup_name (cleanup_id);
5063 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5065 error ("cleanup arg not a function");
5066 *no_add_attrs = true;
5070 /* That the function has proper type is checked with the
5071 eventual call to build_function_call. */
5076 /* Handle a "warn_unused_result" attribute. No special handling. */
5079 handle_warn_unused_result_attribute (tree *node, tree name,
5080 tree ARG_UNUSED (args),
5081 int ARG_UNUSED (flags), bool *no_add_attrs)
5083 /* Ignore the attribute for functions not returning any value. */
5084 if (VOID_TYPE_P (TREE_TYPE (*node)))
5086 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5087 *no_add_attrs = true;
5093 /* Check for valid arguments being passed to a function. */
5095 check_function_arguments (tree attrs, tree params)
5097 /* Check for null being passed in a pointer argument that must be
5098 non-null. We also need to do this if format checking is enabled. */
5101 check_function_nonnull (attrs, params);
5103 /* Check for errors in format strings. */
5106 check_function_format (attrs, params);
5109 /* Generic argument checking recursion routine. PARAM is the argument to
5110 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5111 once the argument is resolved. CTX is context for the callback. */
5113 check_function_arguments_recurse (void (*callback)
5114 (void *, tree, unsigned HOST_WIDE_INT),
5115 void *ctx, tree param,
5116 unsigned HOST_WIDE_INT param_num)
5118 if (TREE_CODE (param) == NOP_EXPR)
5120 /* Strip coercion. */
5121 check_function_arguments_recurse (callback, ctx,
5122 TREE_OPERAND (param, 0), param_num);
5126 if (TREE_CODE (param) == CALL_EXPR)
5128 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5130 bool found_format_arg = false;
5132 /* See if this is a call to a known internationalization function
5133 that modifies a format arg. Such a function may have multiple
5134 format_arg attributes (for example, ngettext). */
5136 for (attrs = TYPE_ATTRIBUTES (type);
5138 attrs = TREE_CHAIN (attrs))
5139 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5142 tree format_num_expr;
5146 /* Extract the argument number, which was previously checked
5148 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5149 while (TREE_CODE (format_num_expr) == NOP_EXPR
5150 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5151 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5152 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5154 if (TREE_CODE (format_num_expr) != INTEGER_CST
5155 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5158 format_num = TREE_INT_CST_LOW (format_num_expr);
5160 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5162 inner_args = TREE_CHAIN (inner_args), i++)
5163 if (i == format_num)
5165 check_function_arguments_recurse (callback, ctx,
5166 TREE_VALUE (inner_args),
5168 found_format_arg = true;
5173 /* If we found a format_arg attribute and did a recursive check,
5174 we are done with checking this argument. Otherwise, we continue
5175 and this will be considered a non-literal. */
5176 if (found_format_arg)
5180 if (TREE_CODE (param) == COND_EXPR)
5182 /* Check both halves of the conditional expression. */
5183 check_function_arguments_recurse (callback, ctx,
5184 TREE_OPERAND (param, 1), param_num);
5185 check_function_arguments_recurse (callback, ctx,
5186 TREE_OPERAND (param, 2), param_num);
5190 (*callback) (ctx, param, param_num);
5193 /* Function to help qsort sort FIELD_DECLs by name order. */
5196 field_decl_cmp (const void *x_p, const void *y_p)
5198 const tree *const x = x_p;
5199 const tree *const y = y_p;
5200 if (DECL_NAME (*x) == DECL_NAME (*y))
5201 /* A nontype is "greater" than a type. */
5202 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5203 if (DECL_NAME (*x) == NULL_TREE)
5205 if (DECL_NAME (*y) == NULL_TREE)
5207 if (DECL_NAME (*x) < DECL_NAME (*y))
5213 gt_pointer_operator new_value;
5217 /* This routine compares two fields like field_decl_cmp but using the
5218 pointer operator in resort_data. */
5221 resort_field_decl_cmp (const void *x_p, const void *y_p)
5223 const tree *const x = x_p;
5224 const tree *const y = y_p;
5226 if (DECL_NAME (*x) == DECL_NAME (*y))
5227 /* A nontype is "greater" than a type. */
5228 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5229 if (DECL_NAME (*x) == NULL_TREE)
5231 if (DECL_NAME (*y) == NULL_TREE)
5234 tree d1 = DECL_NAME (*x);
5235 tree d2 = DECL_NAME (*y);
5236 resort_data.new_value (&d1, resort_data.cookie);
5237 resort_data.new_value (&d2, resort_data.cookie);
5244 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5247 resort_sorted_fields (void *obj,
5248 void * ARG_UNUSED (orig_obj),
5249 gt_pointer_operator new_value,
5252 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
5253 resort_data.new_value = new_value;
5254 resort_data.cookie = cookie;
5255 qsort (&sf->elts[0], sf->len, sizeof (tree),
5256 resort_field_decl_cmp);
5259 /* Issue the error given by MSGID, indicating that it occurred before
5260 TOKEN, which had the associated VALUE. */
5263 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5265 const char *string = _(msgid);
5267 if (token == CPP_EOF)
5268 error ("%s at end of input", string);
5269 else if (token == CPP_CHAR || token == CPP_WCHAR)
5271 unsigned int val = TREE_INT_CST_LOW (value);
5272 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5273 if (val <= UCHAR_MAX && ISGRAPH (val))
5274 error ("%s before %s'%c'", string, ell, val);
5276 error ("%s before %s'\\x%x'", string, ell, val);
5278 else if (token == CPP_STRING
5279 || token == CPP_WSTRING)
5280 error ("%s before string constant", string);
5281 else if (token == CPP_NUMBER)
5282 error ("%s before numeric constant", string);
5283 else if (token == CPP_NAME)
5284 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5285 else if (token < N_TTYPES)
5286 error ("%s before '%s' token", string, cpp_type2name (token));
5288 error ("%s", string);
5291 /* Walk a gimplified function and warn for functions whose return value is
5292 ignored and attribute((warn_unused_result)) is set. This is done before
5293 inlining, so we don't have to worry about that. */
5296 c_warn_unused_result (tree *top_p)
5299 tree_stmt_iterator i;
5302 switch (TREE_CODE (t))
5304 case STATEMENT_LIST:
5305 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5306 c_warn_unused_result (tsi_stmt_ptr (i));
5310 c_warn_unused_result (&COND_EXPR_THEN (t));
5311 c_warn_unused_result (&COND_EXPR_ELSE (t));
5314 c_warn_unused_result (&BIND_EXPR_BODY (t));
5316 case TRY_FINALLY_EXPR:
5317 case TRY_CATCH_EXPR:
5318 c_warn_unused_result (&TREE_OPERAND (t, 0));
5319 c_warn_unused_result (&TREE_OPERAND (t, 1));
5322 c_warn_unused_result (&CATCH_BODY (t));
5324 case EH_FILTER_EXPR:
5325 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5329 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5330 a MODIFY_EXPR. All calls whose value is ignored should be
5331 represented like this. Look for the attribute. */
5332 fdecl = get_callee_fndecl (t);
5334 ftype = TREE_TYPE (fdecl);
5337 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5338 /* Look past pointer-to-function to the function type itself. */
5339 ftype = TREE_TYPE (ftype);
5342 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5345 warning ("%Hignoring return value of `%D', "
5346 "declared with attribute warn_unused_result",
5347 EXPR_LOCUS (t), fdecl);
5349 warning ("%Hignoring return value of function "
5350 "declared with attribute warn_unused_result",
5356 /* Not a container, not a call, or a call whose value is used. */
5361 #include "gt-c-common.h"