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"
50 cpp_reader *parse_in; /* Declared in c-pragma.h. */
52 /* We let tm.h override the types used here, to handle trivial differences
53 such as the choice of unsigned int or long unsigned int for size_t.
54 When machines start needing nontrivial differences in the size type,
55 it would be best to do something here to figure out automatically
56 from other information what type to use. */
59 #define SIZE_TYPE "long unsigned int"
63 #define PID_TYPE "int"
67 #define WCHAR_TYPE "int"
70 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
71 #define MODIFIED_WCHAR_TYPE \
72 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
75 #define PTRDIFF_TYPE "long int"
79 #define WINT_TYPE "unsigned int"
83 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
85 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
91 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
93 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
94 ? "long unsigned int" \
95 : "long long unsigned int"))
98 /* The following symbols are subsumed in the c_global_trees array, and
99 listed here individually for documentation purposes.
101 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
103 tree short_integer_type_node;
104 tree long_integer_type_node;
105 tree long_long_integer_type_node;
107 tree short_unsigned_type_node;
108 tree long_unsigned_type_node;
109 tree long_long_unsigned_type_node;
111 tree truthvalue_type_node;
112 tree truthvalue_false_node;
113 tree truthvalue_true_node;
115 tree ptrdiff_type_node;
117 tree unsigned_char_type_node;
118 tree signed_char_type_node;
119 tree wchar_type_node;
120 tree signed_wchar_type_node;
121 tree unsigned_wchar_type_node;
123 tree float_type_node;
124 tree double_type_node;
125 tree long_double_type_node;
127 tree complex_integer_type_node;
128 tree complex_float_type_node;
129 tree complex_double_type_node;
130 tree complex_long_double_type_node;
132 tree intQI_type_node;
133 tree intHI_type_node;
134 tree intSI_type_node;
135 tree intDI_type_node;
136 tree intTI_type_node;
138 tree unsigned_intQI_type_node;
139 tree unsigned_intHI_type_node;
140 tree unsigned_intSI_type_node;
141 tree unsigned_intDI_type_node;
142 tree unsigned_intTI_type_node;
144 tree widest_integer_literal_type_node;
145 tree widest_unsigned_literal_type_node;
147 Nodes for types `void *' and `const void *'.
149 tree ptr_type_node, const_ptr_type_node;
151 Nodes for types `char *' and `const char *'.
153 tree string_type_node, const_string_type_node;
155 Type `char[SOMENUMBER]'.
156 Used when an array of char is needed and the size is irrelevant.
158 tree char_array_type_node;
160 Type `int[SOMENUMBER]' or something like it.
161 Used when an array of int needed and the size is irrelevant.
163 tree int_array_type_node;
165 Type `wchar_t[SOMENUMBER]' or something like it.
166 Used when a wide string literal is created.
168 tree wchar_array_type_node;
170 Type `int ()' -- used for implicit declaration of functions.
172 tree default_function_type;
174 A VOID_TYPE node, packaged in a TREE_LIST.
178 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
179 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
180 VAR_DECLS, but C++ does.)
182 tree function_name_decl_node;
183 tree pretty_function_name_decl_node;
184 tree c99_function_name_decl_node;
186 Stack of nested function name VAR_DECLs.
188 tree saved_function_name_decls;
192 tree c_global_trees[CTI_MAX];
194 /* TRUE if a code represents a statement. The front end init
195 langhook should take care of initialization of this array. */
197 bool statement_code_p[MAX_TREE_CODES];
199 /* Switches common to the C front ends. */
201 /* Nonzero if prepreprocessing only. */
203 int flag_preprocess_only;
205 /* Nonzero means don't output line number information. */
207 char flag_no_line_commands;
209 /* Nonzero causes -E output not to be done, but directives such as
210 #define that have side effects are still obeyed. */
214 /* Nonzero means dump macros in some fashion. */
216 char flag_dump_macros;
218 /* Nonzero means pass #include lines through to the output. */
220 char flag_dump_includes;
222 /* Nonzero means process PCH files while preprocessing. */
224 bool flag_pch_preprocess;
226 /* The file name to which we should write a precompiled header, or
227 NULL if no header will be written in this compile. */
229 const char *pch_file;
231 /* Nonzero if an ISO standard was selected. It rejects macros in the
235 /* Nonzero if -undef was given. It suppresses target built-in macros
239 /* Nonzero means don't recognize the non-ANSI builtin functions. */
243 /* Nonzero means don't recognize the non-ANSI builtin functions.
246 int flag_no_nonansi_builtin;
248 /* Nonzero means give `double' the same size as `float'. */
250 int flag_short_double;
252 /* Nonzero means give `wchar_t' the same size as `short'. */
254 int flag_short_wchar;
256 /* Nonzero means allow Microsoft extensions without warnings or errors. */
257 int flag_ms_extensions;
259 /* Nonzero means don't recognize the keyword `asm'. */
263 /* Nonzero means give string constants the type `const char *', as mandated
266 int flag_const_strings;
268 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
270 int flag_signed_bitfields = 1;
271 int explicit_flag_signed_bitfields;
273 /* Nonzero means warn about deprecated conversion from string constant to
276 int warn_write_strings;
278 /* Warn about #pragma directives that are not recognized. */
280 int warn_unknown_pragmas; /* Tri state variable. */
282 /* Warn about format/argument anomalies in calls to formatted I/O functions
283 (*printf, *scanf, strftime, strfmon, etc.). */
287 /* Zero means that faster, ...NonNil variants of objc_msgSend...
288 calls will be used in ObjC; passing nil receivers to such calls
289 will most likely result in crashes. */
290 int flag_nil_receivers = 1;
292 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
293 @try, etc.) in source code. */
294 int flag_objc_exceptions = 0;
296 /* Nonzero means that we generate NeXT setjmp based exceptions. */
297 int flag_objc_sjlj_exceptions = -1;
299 /* Nonzero means that code generation will be altered to support
300 "zero-link" execution. This currently affects ObjC only, but may
301 affect other languages in the future. */
302 int flag_zero_link = 0;
304 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
305 unit. It will inform the ObjC runtime that class definition(s) herein
306 contained are to replace one(s) previously loaded. */
307 int flag_replace_objc_classes = 0;
309 /* C/ObjC language option variables. */
312 /* Nonzero means allow type mismatches in conditional expressions;
313 just make their values `void'. */
315 int flag_cond_mismatch;
317 /* Nonzero means enable C89 Amendment 1 features. */
321 /* Nonzero means use the ISO C99 dialect of C. */
325 /* Nonzero means that we have builtin functions, and main is an int. */
329 /* Warn if main is suspicious. */
334 /* ObjC language option variables. */
337 /* Open and close the file for outputting class declarations, if
340 int flag_gen_declaration;
342 /* Generate code for GNU or NeXT runtime environment. */
344 #ifdef NEXT_OBJC_RUNTIME
345 int flag_next_runtime = 1;
347 int flag_next_runtime = 0;
350 /* Tells the compiler that this is a special run. Do not perform any
351 compiling, instead we are to test some platform dependent features
352 and output a C header file with appropriate definitions. */
354 int print_struct_values;
356 /* ???. Undocumented. */
358 const char *constant_string_class_name;
361 /* C++ language option variables. */
364 /* Nonzero means don't recognize any extension keywords. */
366 int flag_no_gnu_keywords;
368 /* Nonzero means do emit exported implementations of functions even if
369 they can be inlined. */
371 int flag_implement_inlines = 1;
373 /* Nonzero means that implicit instantiations will be emitted if needed. */
375 int flag_implicit_templates = 1;
377 /* Nonzero means that implicit instantiations of inline templates will be
378 emitted if needed, even if instantiations of non-inline templates
381 int flag_implicit_inline_templates = 1;
383 /* Nonzero means generate separate instantiation control files and
384 juggle them at link time. */
386 int flag_use_repository;
388 /* Nonzero if we want to issue diagnostics that the standard says are not
391 int flag_optional_diags = 1;
393 /* Nonzero means we should attempt to elide constructors when possible. */
395 int flag_elide_constructors = 1;
397 /* Nonzero means that member functions defined in class scope are
398 inline by default. */
400 int flag_default_inline = 1;
402 /* Controls whether compiler generates 'type descriptor' that give
403 run-time type information. */
407 /* Nonzero if we want to conserve space in the .o files. We do this
408 by putting uninitialized data and runtime initialized data into
409 .common instead of .data at the expense of not flagging multiple
412 int flag_conserve_space;
414 /* Nonzero if we want to obey access control semantics. */
416 int flag_access_control = 1;
418 /* Nonzero if we want to check the return value of new and avoid calling
419 constructors if it is a null pointer. */
423 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
424 initialization variables.
425 0: Old rules, set by -fno-for-scope.
426 2: New ISO rules, set by -ffor-scope.
427 1: Try to implement new ISO rules, but with backup compatibility
428 (and warnings). This is the default, for now. */
430 int flag_new_for_scope = 1;
432 /* Nonzero if we want to emit defined symbols with common-like linkage as
433 weak symbols where possible, in order to conform to C++ semantics.
434 Otherwise, emit them as local symbols. */
438 /* 0 means we want the preprocessor to not emit line directives for
439 the current working directory. 1 means we want it to do it. -1
440 means we should decide depending on whether debugging information
441 is being emitted or not. */
443 int flag_working_directory = -1;
445 /* Nonzero to use __cxa_atexit, rather than atexit, to register
446 destructors for local statics and global objects. */
448 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
450 /* Nonzero means make the default pedwarns warnings instead of errors.
451 The value of this flag is ignored if -pedantic is specified. */
455 /* Nonzero means to implement standard semantics for exception
456 specifications, calling unexpected if an exception is thrown that
457 doesn't match the specification. Zero means to treat them as
458 assertions and optimize accordingly, but not check them. */
460 int flag_enforce_eh_specs = 1;
462 /* Nonzero means to generate thread-safe code for initializing local
465 int flag_threadsafe_statics = 1;
467 /* Nonzero means warn about implicit declarations. */
469 int warn_implicit = 1;
471 /* Maximum template instantiation depth. This limit is rather
472 arbitrary, but it exists to limit the time it takes to notice
473 infinite template instantiations. */
475 int max_tinst_depth = 500;
479 /* The elements of `ridpointers' are identifier nodes for the reserved
480 type names and storage classes. It is indexed by a RID_... value. */
483 tree (*make_fname_decl) (tree, int);
485 /* If non-NULL, the address of a language-specific function that
486 returns 1 for language-specific statement codes. */
487 int (*lang_statement_code_p) (enum tree_code);
489 /* If non-NULL, the address of a language-specific function that takes
490 any action required right before expand_function_end is called. */
491 void (*lang_expand_function_end) (void);
493 /* Nonzero means the expression being parsed will never be evaluated.
494 This is a count, since unevaluated expressions can nest. */
497 /* Information about how a function name is generated. */
500 tree *const decl; /* pointer to the VAR_DECL. */
501 const unsigned rid; /* RID number for the identifier. */
502 const int pretty; /* How pretty is it? */
505 /* The three ways of getting then name of the current function. */
507 const struct fname_var_t fname_vars[] =
509 /* C99 compliant __func__, must be first. */
510 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
511 /* GCC __FUNCTION__ compliant. */
512 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
513 /* GCC __PRETTY_FUNCTION__ compliant. */
514 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
518 static int constant_fits_type_p (tree, tree);
519 static tree check_case_value (tree);
520 static bool check_case_bounds (tree, tree, tree *, tree *);
522 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_always_inline_attribute (tree *, tree, tree, int,
529 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
532 static tree handle_transparent_union_attribute (tree *, tree, tree,
534 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
535 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
536 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
537 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
538 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
539 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
540 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
541 static tree handle_visibility_attribute (tree *, tree, tree, int,
543 static tree handle_tls_model_attribute (tree *, tree, tree, int,
545 static tree handle_no_instrument_function_attribute (tree *, tree,
547 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
548 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
550 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
551 static tree handle_deprecated_attribute (tree *, tree, tree, int,
553 static tree handle_vector_size_attribute (tree *, tree, tree, int,
555 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
556 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
557 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
558 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
560 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
562 static void check_function_nonnull (tree, tree);
563 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
564 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
565 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
566 static int resort_field_decl_cmp (const void *, const void *);
568 /* Table of machine-independent attributes common to all C-like languages. */
569 const struct attribute_spec c_common_attribute_table[] =
571 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
572 { "packed", 0, 0, false, false, false,
573 handle_packed_attribute },
574 { "nocommon", 0, 0, true, false, false,
575 handle_nocommon_attribute },
576 { "common", 0, 0, true, false, false,
577 handle_common_attribute },
578 /* FIXME: logically, noreturn attributes should be listed as
579 "false, true, true" and apply to function types. But implementing this
580 would require all the places in the compiler that use TREE_THIS_VOLATILE
581 on a decl to identify non-returning functions to be located and fixed
582 to check the function type instead. */
583 { "noreturn", 0, 0, true, false, false,
584 handle_noreturn_attribute },
585 { "volatile", 0, 0, true, false, false,
586 handle_noreturn_attribute },
587 { "noinline", 0, 0, true, false, false,
588 handle_noinline_attribute },
589 { "always_inline", 0, 0, true, false, false,
590 handle_always_inline_attribute },
591 { "used", 0, 0, true, false, false,
592 handle_used_attribute },
593 { "unused", 0, 0, false, false, false,
594 handle_unused_attribute },
595 /* The same comments as for noreturn attributes apply to const ones. */
596 { "const", 0, 0, true, false, false,
597 handle_const_attribute },
598 { "transparent_union", 0, 0, false, false, false,
599 handle_transparent_union_attribute },
600 { "constructor", 0, 0, true, false, false,
601 handle_constructor_attribute },
602 { "destructor", 0, 0, true, false, false,
603 handle_destructor_attribute },
604 { "mode", 1, 1, false, true, false,
605 handle_mode_attribute },
606 { "section", 1, 1, true, false, false,
607 handle_section_attribute },
608 { "aligned", 0, 1, false, false, false,
609 handle_aligned_attribute },
610 { "weak", 0, 0, true, false, false,
611 handle_weak_attribute },
612 { "alias", 1, 1, true, false, false,
613 handle_alias_attribute },
614 { "no_instrument_function", 0, 0, true, false, false,
615 handle_no_instrument_function_attribute },
616 { "malloc", 0, 0, true, false, false,
617 handle_malloc_attribute },
618 { "no_stack_limit", 0, 0, true, false, false,
619 handle_no_limit_stack_attribute },
620 { "pure", 0, 0, true, false, false,
621 handle_pure_attribute },
622 { "deprecated", 0, 0, false, false, false,
623 handle_deprecated_attribute },
624 { "vector_size", 1, 1, false, true, false,
625 handle_vector_size_attribute },
626 { "visibility", 1, 1, false, false, false,
627 handle_visibility_attribute },
628 { "tls_model", 1, 1, true, false, false,
629 handle_tls_model_attribute },
630 { "nonnull", 0, -1, false, true, true,
631 handle_nonnull_attribute },
632 { "nothrow", 0, 0, true, false, false,
633 handle_nothrow_attribute },
634 { "may_alias", 0, 0, false, true, false, NULL },
635 { "cleanup", 1, 1, true, false, false,
636 handle_cleanup_attribute },
637 { "warn_unused_result", 0, 0, false, true, true,
638 handle_warn_unused_result_attribute },
639 { "sentinel", 0, 1, false, true, true,
640 handle_sentinel_attribute },
641 { NULL, 0, 0, false, false, false, NULL }
644 /* Give the specifications for the format attributes, used by C and all
647 const struct attribute_spec c_common_format_attribute_table[] =
649 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
650 { "format", 3, 3, false, true, true,
651 handle_format_attribute },
652 { "format_arg", 1, 1, false, true, true,
653 handle_format_arg_attribute },
654 { NULL, 0, 0, false, false, false, NULL }
657 /* Push current bindings for the function name VAR_DECLS. */
660 start_fname_decls (void)
663 tree saved = NULL_TREE;
665 for (ix = 0; fname_vars[ix].decl; ix++)
667 tree decl = *fname_vars[ix].decl;
671 saved = tree_cons (decl, build_int_cst (NULL_TREE, ix), saved);
672 *fname_vars[ix].decl = NULL_TREE;
675 if (saved || saved_function_name_decls)
676 /* Normally they'll have been NULL, so only push if we've got a
677 stack, or they are non-NULL. */
678 saved_function_name_decls = tree_cons (saved, NULL_TREE,
679 saved_function_name_decls);
682 /* Finish up the current bindings, adding them into the current function's
683 statement tree. This must be done _before_ finish_stmt_tree is called.
684 If there is no current function, we must be at file scope and no statements
685 are involved. Pop the previous bindings. */
688 finish_fname_decls (void)
691 tree stmts = NULL_TREE;
692 tree stack = saved_function_name_decls;
694 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
695 append_to_statement_list (TREE_VALUE (stack), &stmts);
699 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
701 if (TREE_CODE (*bodyp) == BIND_EXPR)
702 bodyp = &BIND_EXPR_BODY (*bodyp);
704 append_to_statement_list (*bodyp, &stmts);
708 for (ix = 0; fname_vars[ix].decl; ix++)
709 *fname_vars[ix].decl = NULL_TREE;
713 /* We had saved values, restore them. */
716 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
718 tree decl = TREE_PURPOSE (saved);
719 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
721 *fname_vars[ix].decl = decl;
723 stack = TREE_CHAIN (stack);
725 saved_function_name_decls = stack;
728 /* Return the text name of the current function, suitably prettified
729 by PRETTY_P. Return string must be freed by caller. */
732 fname_as_string (int pretty_p)
734 const char *name = "top level";
744 if (current_function_decl)
745 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
747 if (c_lex_string_translate)
749 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
750 cpp_string cstr = { 0, 0 }, strname;
752 namep = XNEWVEC (char, len);
753 snprintf (namep, len, "\"%s\"", name);
754 strname.text = (unsigned char *) namep;
755 strname.len = len - 1;
757 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
758 return (char *) cstr.text;
761 namep = xstrdup (name);
766 /* Expand DECL if it declares an entity not handled by the
770 c_expand_decl (tree decl)
772 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
774 /* Let the back-end know about this variable. */
775 if (!anon_aggr_type_p (TREE_TYPE (decl)))
776 emit_local_var (decl);
778 expand_anon_union_decl (decl, NULL_TREE,
779 DECL_ANON_UNION_ELEMS (decl));
788 /* Return the VAR_DECL for a const char array naming the current
789 function. If the VAR_DECL has not yet been created, create it
790 now. RID indicates how it should be formatted and IDENTIFIER_NODE
791 ID is its name (unfortunately C and C++ hold the RID values of
792 keywords in different places, so we can't derive RID from ID in
793 this language independent code. */
796 fname_decl (unsigned int rid, tree id)
799 tree decl = NULL_TREE;
801 for (ix = 0; fname_vars[ix].decl; ix++)
802 if (fname_vars[ix].rid == rid)
805 decl = *fname_vars[ix].decl;
808 /* If a tree is built here, it would normally have the lineno of
809 the current statement. Later this tree will be moved to the
810 beginning of the function and this line number will be wrong.
811 To avoid this problem set the lineno to 0 here; that prevents
812 it from appearing in the RTL. */
814 location_t saved_location = input_location;
815 #ifdef USE_MAPPED_LOCATION
816 input_location = UNKNOWN_LOCATION;
821 stmts = push_stmt_list ();
822 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
823 stmts = pop_stmt_list (stmts);
824 if (!IS_EMPTY_STMT (stmts))
825 saved_function_name_decls
826 = tree_cons (decl, stmts, saved_function_name_decls);
827 *fname_vars[ix].decl = decl;
828 input_location = saved_location;
830 if (!ix && !current_function_decl)
831 pedwarn ("%qD is not defined outside of function scope", decl);
836 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
839 fix_string_type (tree value)
841 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
842 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
843 const int nchars_max = flag_isoc99 ? 4095 : 509;
844 int length = TREE_STRING_LENGTH (value);
846 tree e_type, i_type, a_type;
848 /* Compute the number of elements, for the array type. */
849 nchars = wide_flag ? length / wchar_bytes : length;
851 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
852 pedwarn ("string length %qd is greater than the length %qd ISO C%d compilers are required to support",
853 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
855 e_type = wide_flag ? wchar_type_node : char_type_node;
856 /* Create the array type for the string constant. flag_const_strings
857 says make the string constant an array of const char so that
858 copying it to a non-const pointer will get a warning. For C++,
859 this is the standard behavior.
861 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
862 array type being the unqualified version of that type.
863 Therefore, if we are constructing an array of const char, we must
864 construct the matching unqualified array type first. The C front
865 end does not require this, but it does no harm, so we do it
867 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
868 a_type = build_array_type (e_type, i_type);
869 if (flag_const_strings)
871 /* bleah, c_build_qualified_type should set TYPE_MAIN_VARIANT. */
872 tree qa_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
873 TYPE_MAIN_VARIANT (qa_type) = a_type;
877 TREE_TYPE (value) = a_type;
878 TREE_CONSTANT (value) = 1;
879 TREE_INVARIANT (value) = 1;
880 TREE_READONLY (value) = 1;
881 TREE_STATIC (value) = 1;
885 /* Print a warning if a constant expression had overflow in folding.
886 Invoke this function on every expression that the language
887 requires to be a constant expression.
888 Note the ANSI C standard says it is erroneous for a
889 constant expression to overflow. */
892 constant_expression_warning (tree value)
894 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
895 || TREE_CODE (value) == VECTOR_CST
896 || TREE_CODE (value) == COMPLEX_CST)
897 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
898 pedwarn ("overflow in constant expression");
901 /* Print a warning if an expression had overflow in folding.
902 Invoke this function on every expression that
903 (1) appears in the source code, and
904 (2) might be a constant expression that overflowed, and
905 (3) is not already checked by convert_and_check;
906 however, do not invoke this function on operands of explicit casts. */
909 overflow_warning (tree value)
911 if ((TREE_CODE (value) == INTEGER_CST
912 || (TREE_CODE (value) == COMPLEX_CST
913 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
914 && TREE_OVERFLOW (value))
916 TREE_OVERFLOW (value) = 0;
917 if (skip_evaluation == 0)
918 warning ("integer overflow in expression");
920 else if ((TREE_CODE (value) == REAL_CST
921 || (TREE_CODE (value) == COMPLEX_CST
922 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
923 && TREE_OVERFLOW (value))
925 TREE_OVERFLOW (value) = 0;
926 if (skip_evaluation == 0)
927 warning ("floating point overflow in expression");
929 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
931 TREE_OVERFLOW (value) = 0;
932 if (skip_evaluation == 0)
933 warning ("vector overflow in expression");
937 /* Print a warning if a large constant is truncated to unsigned,
938 or if -Wconversion is used and a constant < 0 is converted to unsigned.
939 Invoke this function on every expression that might be implicitly
940 converted to an unsigned type. */
943 unsigned_conversion_warning (tree result, tree operand)
945 tree type = TREE_TYPE (result);
947 if (TREE_CODE (operand) == INTEGER_CST
948 && TREE_CODE (type) == INTEGER_TYPE
949 && TYPE_UNSIGNED (type)
950 && skip_evaluation == 0
951 && !int_fits_type_p (operand, type))
953 if (!int_fits_type_p (operand, c_common_signed_type (type)))
954 /* This detects cases like converting -129 or 256 to unsigned char. */
955 warning ("large integer implicitly truncated to unsigned type");
956 else if (warn_conversion)
957 warning ("negative integer implicitly converted to unsigned type");
961 /* Nonzero if constant C has a value that is permissible
962 for type TYPE (an INTEGER_TYPE). */
965 constant_fits_type_p (tree c, tree type)
967 if (TREE_CODE (c) == INTEGER_CST)
968 return int_fits_type_p (c, type);
970 c = convert (type, c);
971 return !TREE_OVERFLOW (c);
974 /* Nonzero if vector types T1 and T2 can be converted to each other
975 without an explicit cast. */
977 vector_types_convertible_p (tree t1, tree t2)
979 return targetm.vector_opaque_p (t1)
980 || targetm.vector_opaque_p (t2)
981 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
982 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
983 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
986 /* Convert EXPR to TYPE, warning about conversion problems with constants.
987 Invoke this function on every expression that is converted implicitly,
988 i.e. because of language rules and not because of an explicit cast. */
991 convert_and_check (tree type, tree expr)
993 tree t = convert (type, expr);
994 if (TREE_CODE (t) == INTEGER_CST)
996 if (TREE_OVERFLOW (t))
998 TREE_OVERFLOW (t) = 0;
1000 /* Do not diagnose overflow in a constant expression merely
1001 because a conversion overflowed. */
1002 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1004 /* No warning for converting 0x80000000 to int. */
1005 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1006 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1007 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1008 /* If EXPR fits in the unsigned version of TYPE,
1009 don't warn unless pedantic. */
1011 || TYPE_UNSIGNED (type)
1012 || !constant_fits_type_p (expr,
1013 c_common_unsigned_type (type)))
1014 && skip_evaluation == 0)
1015 warning ("overflow in implicit constant conversion");
1018 unsigned_conversion_warning (t, expr);
1023 /* A node in a list that describes references to variables (EXPR), which are
1024 either read accesses if WRITER is zero, or write accesses, in which case
1025 WRITER is the parent of EXPR. */
1032 /* Used to implement a cache the results of a call to verify_tree. We only
1033 use this for SAVE_EXPRs. */
1036 struct tlist_cache *next;
1037 struct tlist *cache_before_sp;
1038 struct tlist *cache_after_sp;
1042 /* Obstack to use when allocating tlist structures, and corresponding
1044 static struct obstack tlist_obstack;
1045 static char *tlist_firstobj = 0;
1047 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1049 static struct tlist *warned_ids;
1050 /* SAVE_EXPRs need special treatment. We process them only once and then
1051 cache the results. */
1052 static struct tlist_cache *save_expr_cache;
1054 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1055 static void merge_tlist (struct tlist **, struct tlist *, int);
1056 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1057 static int warning_candidate_p (tree);
1058 static void warn_for_collisions (struct tlist *);
1059 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1060 static struct tlist *new_tlist (struct tlist *, tree, tree);
1062 /* Create a new struct tlist and fill in its fields. */
1063 static struct tlist *
1064 new_tlist (struct tlist *next, tree t, tree writer)
1067 l = XOBNEW (&tlist_obstack, struct tlist);
1074 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1075 is nonnull, we ignore any node we find which has a writer equal to it. */
1078 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1082 struct tlist *next = add->next;
1085 if (!exclude_writer || add->writer != exclude_writer)
1086 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1091 /* Merge the nodes of ADD into TO. This merging process is done so that for
1092 each variable that already exists in TO, no new node is added; however if
1093 there is a write access recorded in ADD, and an occurrence on TO is only
1094 a read access, then the occurrence in TO will be modified to record the
1098 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1100 struct tlist **end = to;
1103 end = &(*end)->next;
1109 struct tlist *next = add->next;
1111 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1112 if (tmp2->expr == add->expr)
1116 tmp2->writer = add->writer;
1120 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1121 end = &(*end)->next;
1128 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1129 references in list LIST conflict with it, excluding reads if ONLY writers
1133 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1138 /* Avoid duplicate warnings. */
1139 for (tmp = warned_ids; tmp; tmp = tmp->next)
1140 if (tmp->expr == written)
1145 if (list->expr == written
1146 && list->writer != writer
1147 && (!only_writes || list->writer)
1148 && DECL_NAME (list->expr))
1150 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1151 warning ("operation on %qs may be undefined",
1152 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1158 /* Given a list LIST of references to variables, find whether any of these
1159 can cause conflicts due to missing sequence points. */
1162 warn_for_collisions (struct tlist *list)
1166 for (tmp = list; tmp; tmp = tmp->next)
1169 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1173 /* Return nonzero if X is a tree that can be verified by the sequence point
1176 warning_candidate_p (tree x)
1178 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1181 /* Walk the tree X, and record accesses to variables. If X is written by the
1182 parent tree, WRITER is the parent.
1183 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1184 expression or its only operand forces a sequence point, then everything up
1185 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1187 Once we return, we will have emitted warnings if any subexpression before
1188 such a sequence point could be undefined. On a higher level, however, the
1189 sequence point may not be relevant, and we'll merge the two lists.
1191 Example: (b++, a) + b;
1192 The call that processes the COMPOUND_EXPR will store the increment of B
1193 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1194 processes the PLUS_EXPR will need to merge the two lists so that
1195 eventually, all accesses end up on the same list (and we'll warn about the
1196 unordered subexpressions b++ and b.
1198 A note on merging. If we modify the former example so that our expression
1201 care must be taken not simply to add all three expressions into the final
1202 PNO_SP list. The function merge_tlist takes care of that by merging the
1203 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1204 way, so that no more than one access to B is recorded. */
1207 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1210 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1211 enum tree_code code;
1212 enum tree_code_class cl;
1214 /* X may be NULL if it is the operand of an empty statement expression
1220 code = TREE_CODE (x);
1221 cl = TREE_CODE_CLASS (code);
1223 if (warning_candidate_p (x))
1225 *pno_sp = new_tlist (*pno_sp, x, writer);
1235 case TRUTH_ANDIF_EXPR:
1236 case TRUTH_ORIF_EXPR:
1237 tmp_before = tmp_nosp = tmp_list3 = 0;
1238 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1239 warn_for_collisions (tmp_nosp);
1240 merge_tlist (pbefore_sp, tmp_before, 0);
1241 merge_tlist (pbefore_sp, tmp_nosp, 0);
1242 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1243 merge_tlist (pbefore_sp, tmp_list3, 0);
1247 tmp_before = tmp_list2 = 0;
1248 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1249 warn_for_collisions (tmp_list2);
1250 merge_tlist (pbefore_sp, tmp_before, 0);
1251 merge_tlist (pbefore_sp, tmp_list2, 1);
1253 tmp_list3 = tmp_nosp = 0;
1254 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1255 warn_for_collisions (tmp_nosp);
1256 merge_tlist (pbefore_sp, tmp_list3, 0);
1258 tmp_list3 = tmp_list2 = 0;
1259 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1260 warn_for_collisions (tmp_list2);
1261 merge_tlist (pbefore_sp, tmp_list3, 0);
1262 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1263 two first, to avoid warning for (a ? b++ : b++). */
1264 merge_tlist (&tmp_nosp, tmp_list2, 0);
1265 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1268 case PREDECREMENT_EXPR:
1269 case PREINCREMENT_EXPR:
1270 case POSTDECREMENT_EXPR:
1271 case POSTINCREMENT_EXPR:
1272 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1276 tmp_before = tmp_nosp = tmp_list3 = 0;
1277 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1278 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1279 /* Expressions inside the LHS are not ordered wrt. the sequence points
1280 in the RHS. Example:
1282 Despite the fact that the modification of "a" is in the before_sp
1283 list (tmp_before), it conflicts with the use of "a" in the LHS.
1284 We can handle this by adding the contents of tmp_list3
1285 to those of tmp_before, and redoing the collision warnings for that
1287 add_tlist (&tmp_before, tmp_list3, x, 1);
1288 warn_for_collisions (tmp_before);
1289 /* Exclude the LHS itself here; we first have to merge it into the
1290 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1291 didn't exclude the LHS, we'd get it twice, once as a read and once
1293 add_tlist (pno_sp, tmp_list3, x, 0);
1294 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1296 merge_tlist (pbefore_sp, tmp_before, 0);
1297 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1298 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1299 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1303 /* We need to warn about conflicts among arguments and conflicts between
1304 args and the function address. Side effects of the function address,
1305 however, are not ordered by the sequence point of the call. */
1306 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1307 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1308 if (TREE_OPERAND (x, 1))
1309 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1310 merge_tlist (&tmp_list3, tmp_list2, 0);
1311 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1312 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1313 warn_for_collisions (tmp_before);
1314 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1318 /* Scan all the list, e.g. indices of multi dimensional array. */
1321 tmp_before = tmp_nosp = 0;
1322 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1323 merge_tlist (&tmp_nosp, tmp_before, 0);
1324 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1331 struct tlist_cache *t;
1332 for (t = save_expr_cache; t; t = t->next)
1338 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1339 t->next = save_expr_cache;
1341 save_expr_cache = t;
1343 tmp_before = tmp_nosp = 0;
1344 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1345 warn_for_collisions (tmp_nosp);
1350 struct tlist *t = tmp_nosp;
1352 merge_tlist (&tmp_list3, t, 0);
1354 t->cache_before_sp = tmp_before;
1355 t->cache_after_sp = tmp_list3;
1357 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1358 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1363 /* For other expressions, simply recurse on their operands.
1364 Manual tail recursion for unary expressions.
1365 Other non-expressions need not be processed. */
1366 if (cl == tcc_unary)
1368 if (first_rtl_op (code) == 0)
1370 x = TREE_OPERAND (x, 0);
1374 else if (IS_EXPR_CODE_CLASS (cl))
1377 int max = first_rtl_op (TREE_CODE (x));
1378 for (lp = 0; lp < max; lp++)
1380 tmp_before = tmp_nosp = 0;
1381 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, 0);
1382 merge_tlist (&tmp_nosp, tmp_before, 0);
1383 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1390 /* Try to warn for undefined behavior in EXPR due to missing sequence
1394 verify_sequence_points (tree expr)
1396 struct tlist *before_sp = 0, *after_sp = 0;
1399 save_expr_cache = 0;
1400 if (tlist_firstobj == 0)
1402 gcc_obstack_init (&tlist_obstack);
1403 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1406 verify_tree (expr, &before_sp, &after_sp, 0);
1407 warn_for_collisions (after_sp);
1408 obstack_free (&tlist_obstack, tlist_firstobj);
1411 /* Validate the expression after `case' and apply default promotions. */
1414 check_case_value (tree value)
1416 if (value == NULL_TREE)
1419 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1420 STRIP_TYPE_NOPS (value);
1421 /* In C++, the following is allowed:
1424 switch (...) { case i: ... }
1426 So, we try to reduce the VALUE to a constant that way. */
1427 if (c_dialect_cxx ())
1429 value = decl_constant_value (value);
1430 STRIP_TYPE_NOPS (value);
1431 value = fold (value);
1434 if (TREE_CODE (value) != INTEGER_CST
1435 && value != error_mark_node)
1437 error ("case label does not reduce to an integer constant");
1438 value = error_mark_node;
1441 /* Promote char or short to int. */
1442 value = default_conversion (value);
1444 constant_expression_warning (value);
1449 /* See if the case values LOW and HIGH are in the range of the original
1450 type (i.e. before the default conversion to int) of the switch testing
1452 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1453 the type before promoting it. CASE_LOW_P is a pointer to the lower
1454 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1455 if the case is not a case range.
1456 The caller has to make sure that we are not called with NULL for
1457 CASE_LOW_P (i.e. the default case).
1458 Returns true if the case label is in range of ORIG_TYPE (satured or
1459 untouched) or false if the label is out of range. */
1462 check_case_bounds (tree type, tree orig_type,
1463 tree *case_low_p, tree *case_high_p)
1465 tree min_value, max_value;
1466 tree case_low = *case_low_p;
1467 tree case_high = case_high_p ? *case_high_p : case_low;
1469 /* If there was a problem with the original type, do nothing. */
1470 if (orig_type == error_mark_node)
1473 min_value = TYPE_MIN_VALUE (orig_type);
1474 max_value = TYPE_MAX_VALUE (orig_type);
1476 /* Case label is less than minimum for type. */
1477 if (tree_int_cst_compare (case_low, min_value) < 0
1478 && tree_int_cst_compare (case_high, min_value) < 0)
1480 warning ("case label value is less than minimum value for type");
1484 /* Case value is greater than maximum for type. */
1485 if (tree_int_cst_compare (case_low, max_value) > 0
1486 && tree_int_cst_compare (case_high, max_value) > 0)
1488 warning ("case label value exceeds maximum value for type");
1492 /* Saturate lower case label value to minimum. */
1493 if (tree_int_cst_compare (case_high, min_value) >= 0
1494 && tree_int_cst_compare (case_low, min_value) < 0)
1496 warning ("lower value in case label range"
1497 " less than minimum value for type");
1498 case_low = min_value;
1501 /* Saturate upper case label value to maximum. */
1502 if (tree_int_cst_compare (case_low, max_value) <= 0
1503 && tree_int_cst_compare (case_high, max_value) > 0)
1505 warning ("upper value in case label range"
1506 " exceeds maximum value for type");
1507 case_high = max_value;
1510 if (*case_low_p != case_low)
1511 *case_low_p = convert (type, case_low);
1512 if (case_high_p && *case_high_p != case_high)
1513 *case_high_p = convert (type, case_high);
1518 /* Return an integer type with BITS bits of precision,
1519 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1522 c_common_type_for_size (unsigned int bits, int unsignedp)
1524 if (bits == TYPE_PRECISION (integer_type_node))
1525 return unsignedp ? unsigned_type_node : integer_type_node;
1527 if (bits == TYPE_PRECISION (signed_char_type_node))
1528 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1530 if (bits == TYPE_PRECISION (short_integer_type_node))
1531 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1533 if (bits == TYPE_PRECISION (long_integer_type_node))
1534 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1536 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1537 return (unsignedp ? long_long_unsigned_type_node
1538 : long_long_integer_type_node);
1540 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1541 return (unsignedp ? widest_unsigned_literal_type_node
1542 : widest_integer_literal_type_node);
1544 if (bits <= TYPE_PRECISION (intQI_type_node))
1545 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1547 if (bits <= TYPE_PRECISION (intHI_type_node))
1548 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1550 if (bits <= TYPE_PRECISION (intSI_type_node))
1551 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1553 if (bits <= TYPE_PRECISION (intDI_type_node))
1554 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1559 /* Used for communication between c_common_type_for_mode and
1560 c_register_builtin_type. */
1561 static GTY(()) tree registered_builtin_types;
1563 /* Return a data type that has machine mode MODE.
1564 If the mode is an integer,
1565 then UNSIGNEDP selects between signed and unsigned types. */
1568 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1572 if (mode == TYPE_MODE (integer_type_node))
1573 return unsignedp ? unsigned_type_node : integer_type_node;
1575 if (mode == TYPE_MODE (signed_char_type_node))
1576 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1578 if (mode == TYPE_MODE (short_integer_type_node))
1579 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1581 if (mode == TYPE_MODE (long_integer_type_node))
1582 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1584 if (mode == TYPE_MODE (long_long_integer_type_node))
1585 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1587 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1588 return unsignedp ? widest_unsigned_literal_type_node
1589 : widest_integer_literal_type_node;
1592 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1595 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1598 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1601 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1603 #if HOST_BITS_PER_WIDE_INT >= 64
1604 if (mode == TYPE_MODE (intTI_type_node))
1605 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1608 if (mode == TYPE_MODE (float_type_node))
1609 return float_type_node;
1611 if (mode == TYPE_MODE (double_type_node))
1612 return double_type_node;
1614 if (mode == TYPE_MODE (long_double_type_node))
1615 return long_double_type_node;
1617 if (mode == TYPE_MODE (void_type_node))
1618 return void_type_node;
1620 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1621 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1623 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1624 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1626 if (VECTOR_MODE_P (mode))
1628 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1629 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1630 if (inner_type != NULL_TREE)
1631 return build_vector_type_for_mode (inner_type, mode);
1634 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1635 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1636 return TREE_VALUE (t);
1641 /* Return an unsigned type the same as TYPE in other respects. */
1643 c_common_unsigned_type (tree type)
1645 tree type1 = TYPE_MAIN_VARIANT (type);
1646 if (type1 == signed_char_type_node || type1 == char_type_node)
1647 return unsigned_char_type_node;
1648 if (type1 == integer_type_node)
1649 return unsigned_type_node;
1650 if (type1 == short_integer_type_node)
1651 return short_unsigned_type_node;
1652 if (type1 == long_integer_type_node)
1653 return long_unsigned_type_node;
1654 if (type1 == long_long_integer_type_node)
1655 return long_long_unsigned_type_node;
1656 if (type1 == widest_integer_literal_type_node)
1657 return widest_unsigned_literal_type_node;
1658 #if HOST_BITS_PER_WIDE_INT >= 64
1659 if (type1 == intTI_type_node)
1660 return unsigned_intTI_type_node;
1662 if (type1 == intDI_type_node)
1663 return unsigned_intDI_type_node;
1664 if (type1 == intSI_type_node)
1665 return unsigned_intSI_type_node;
1666 if (type1 == intHI_type_node)
1667 return unsigned_intHI_type_node;
1668 if (type1 == intQI_type_node)
1669 return unsigned_intQI_type_node;
1671 return c_common_signed_or_unsigned_type (1, type);
1674 /* Return a signed type the same as TYPE in other respects. */
1677 c_common_signed_type (tree type)
1679 tree type1 = TYPE_MAIN_VARIANT (type);
1680 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1681 return signed_char_type_node;
1682 if (type1 == unsigned_type_node)
1683 return integer_type_node;
1684 if (type1 == short_unsigned_type_node)
1685 return short_integer_type_node;
1686 if (type1 == long_unsigned_type_node)
1687 return long_integer_type_node;
1688 if (type1 == long_long_unsigned_type_node)
1689 return long_long_integer_type_node;
1690 if (type1 == widest_unsigned_literal_type_node)
1691 return widest_integer_literal_type_node;
1692 #if HOST_BITS_PER_WIDE_INT >= 64
1693 if (type1 == unsigned_intTI_type_node)
1694 return intTI_type_node;
1696 if (type1 == unsigned_intDI_type_node)
1697 return intDI_type_node;
1698 if (type1 == unsigned_intSI_type_node)
1699 return intSI_type_node;
1700 if (type1 == unsigned_intHI_type_node)
1701 return intHI_type_node;
1702 if (type1 == unsigned_intQI_type_node)
1703 return intQI_type_node;
1705 return c_common_signed_or_unsigned_type (0, type);
1708 /* Return a type the same as TYPE except unsigned or
1709 signed according to UNSIGNEDP. */
1712 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1714 if (!INTEGRAL_TYPE_P (type)
1715 || TYPE_UNSIGNED (type) == unsignedp)
1718 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1719 the precision; they have precision set to match their range, but
1720 may use a wider mode to match an ABI. If we change modes, we may
1721 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1722 the precision as well, so as to yield correct results for
1723 bit-field types. C++ does not have these separate bit-field
1724 types, and producing a signed or unsigned variant of an
1725 ENUMERAL_TYPE may cause other problems as well. */
1727 #define TYPE_OK(node) \
1728 (TYPE_MODE (type) == TYPE_MODE (node) \
1729 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1730 if (TYPE_OK (signed_char_type_node))
1731 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1732 if (TYPE_OK (integer_type_node))
1733 return unsignedp ? unsigned_type_node : integer_type_node;
1734 if (TYPE_OK (short_integer_type_node))
1735 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1736 if (TYPE_OK (long_integer_type_node))
1737 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1738 if (TYPE_OK (long_long_integer_type_node))
1739 return (unsignedp ? long_long_unsigned_type_node
1740 : long_long_integer_type_node);
1741 if (TYPE_OK (widest_integer_literal_type_node))
1742 return (unsignedp ? widest_unsigned_literal_type_node
1743 : widest_integer_literal_type_node);
1745 #if HOST_BITS_PER_WIDE_INT >= 64
1746 if (TYPE_OK (intTI_type_node))
1747 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1749 if (TYPE_OK (intDI_type_node))
1750 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1751 if (TYPE_OK (intSI_type_node))
1752 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1753 if (TYPE_OK (intHI_type_node))
1754 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1755 if (TYPE_OK (intQI_type_node))
1756 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1759 if (c_dialect_cxx ())
1762 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
1765 /* The C version of the register_builtin_type langhook. */
1768 c_register_builtin_type (tree type, const char* name)
1772 decl = build_decl (TYPE_DECL, get_identifier (name), type);
1773 DECL_ARTIFICIAL (decl) = 1;
1774 if (!TYPE_NAME (type))
1775 TYPE_NAME (type) = decl;
1778 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
1782 /* Return the minimum number of bits needed to represent VALUE in a
1783 signed or unsigned type, UNSIGNEDP says which. */
1786 min_precision (tree value, int unsignedp)
1790 /* If the value is negative, compute its negative minus 1. The latter
1791 adjustment is because the absolute value of the largest negative value
1792 is one larger than the largest positive value. This is equivalent to
1793 a bit-wise negation, so use that operation instead. */
1795 if (tree_int_cst_sgn (value) < 0)
1796 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
1798 /* Return the number of bits needed, taking into account the fact
1799 that we need one more bit for a signed than unsigned type. */
1801 if (integer_zerop (value))
1804 log = tree_floor_log2 (value);
1806 return log + 1 + !unsignedp;
1809 /* Print an error message for invalid operands to arith operation
1810 CODE. NOP_EXPR is used as a special case (see
1811 c_common_truthvalue_conversion). */
1814 binary_op_error (enum tree_code code)
1821 error ("invalid truth-value expression");
1825 opname = "+"; break;
1827 opname = "-"; break;
1829 opname = "*"; break;
1831 opname = "max"; break;
1833 opname = "min"; break;
1835 opname = "=="; break;
1837 opname = "!="; break;
1839 opname = "<="; break;
1841 opname = ">="; break;
1843 opname = "<"; break;
1845 opname = ">"; break;
1847 opname = "<<"; break;
1849 opname = ">>"; break;
1850 case TRUNC_MOD_EXPR:
1851 case FLOOR_MOD_EXPR:
1852 opname = "%"; break;
1853 case TRUNC_DIV_EXPR:
1854 case FLOOR_DIV_EXPR:
1855 opname = "/"; break;
1857 opname = "&"; break;
1859 opname = "|"; break;
1860 case TRUTH_ANDIF_EXPR:
1861 opname = "&&"; break;
1862 case TRUTH_ORIF_EXPR:
1863 opname = "||"; break;
1865 opname = "^"; break;
1869 error ("invalid operands to binary %s", opname);
1872 /* Subroutine of build_binary_op, used for comparison operations.
1873 See if the operands have both been converted from subword integer types
1874 and, if so, perhaps change them both back to their original type.
1875 This function is also responsible for converting the two operands
1876 to the proper common type for comparison.
1878 The arguments of this function are all pointers to local variables
1879 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1880 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1882 If this function returns nonzero, it means that the comparison has
1883 a constant value. What this function returns is an expression for
1887 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
1888 enum tree_code *rescode_ptr)
1891 tree op0 = *op0_ptr;
1892 tree op1 = *op1_ptr;
1893 int unsignedp0, unsignedp1;
1895 tree primop0, primop1;
1896 enum tree_code code = *rescode_ptr;
1898 /* Throw away any conversions to wider types
1899 already present in the operands. */
1901 primop0 = get_narrower (op0, &unsignedp0);
1902 primop1 = get_narrower (op1, &unsignedp1);
1904 /* Handle the case that OP0 does not *contain* a conversion
1905 but it *requires* conversion to FINAL_TYPE. */
1907 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
1908 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1909 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
1910 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1912 /* If one of the operands must be floated, we cannot optimize. */
1913 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
1914 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
1916 /* If first arg is constant, swap the args (changing operation
1917 so value is preserved), for canonicalization. Don't do this if
1918 the second arg is 0. */
1920 if (TREE_CONSTANT (primop0)
1921 && !integer_zerop (primop1) && !real_zerop (primop1))
1924 int temi = unsignedp0;
1932 unsignedp0 = unsignedp1;
1955 *rescode_ptr = code;
1958 /* If comparing an integer against a constant more bits wide,
1959 maybe we can deduce a value of 1 or 0 independent of the data.
1960 Or else truncate the constant now
1961 rather than extend the variable at run time.
1963 This is only interesting if the constant is the wider arg.
1964 Also, it is not safe if the constant is unsigned and the
1965 variable arg is signed, since in this case the variable
1966 would be sign-extended and then regarded as unsigned.
1967 Our technique fails in this case because the lowest/highest
1968 possible unsigned results don't follow naturally from the
1969 lowest/highest possible values of the variable operand.
1970 For just EQ_EXPR and NE_EXPR there is another technique that
1971 could be used: see if the constant can be faithfully represented
1972 in the other operand's type, by truncating it and reextending it
1973 and see if that preserves the constant's value. */
1975 if (!real1 && !real2
1976 && TREE_CODE (primop1) == INTEGER_CST
1977 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
1979 int min_gt, max_gt, min_lt, max_lt;
1980 tree maxval, minval;
1981 /* 1 if comparison is nominally unsigned. */
1982 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
1985 type = c_common_signed_or_unsigned_type (unsignedp0,
1986 TREE_TYPE (primop0));
1988 /* In C, if TYPE is an enumeration, then we need to get its
1989 min/max values from its underlying integral type, not the
1990 enumerated type itself. In C++, TYPE_MAX_VALUE and
1991 TYPE_MIN_VALUE have already been set correctly on the
1992 enumeration type. */
1993 if (!c_dialect_cxx () && TREE_CODE (type) == ENUMERAL_TYPE)
1994 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
1996 maxval = TYPE_MAX_VALUE (type);
1997 minval = TYPE_MIN_VALUE (type);
1999 if (unsignedp && !unsignedp0)
2000 *restype_ptr = c_common_signed_type (*restype_ptr);
2002 if (TREE_TYPE (primop1) != *restype_ptr)
2004 /* Convert primop1 to target type, but do not introduce
2005 additional overflow. We know primop1 is an int_cst. */
2006 tree tmp = build_int_cst_wide (*restype_ptr,
2007 TREE_INT_CST_LOW (primop1),
2008 TREE_INT_CST_HIGH (primop1));
2010 primop1 = force_fit_type (tmp, 0, TREE_OVERFLOW (primop1),
2011 TREE_CONSTANT_OVERFLOW (primop1));
2013 if (type != *restype_ptr)
2015 minval = convert (*restype_ptr, minval);
2016 maxval = convert (*restype_ptr, maxval);
2019 if (unsignedp && unsignedp0)
2021 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2022 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2023 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2024 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2028 min_gt = INT_CST_LT (primop1, minval);
2029 max_gt = INT_CST_LT (primop1, maxval);
2030 min_lt = INT_CST_LT (minval, primop1);
2031 max_lt = INT_CST_LT (maxval, primop1);
2035 /* This used to be a switch, but Genix compiler can't handle that. */
2036 if (code == NE_EXPR)
2038 if (max_lt || min_gt)
2039 val = truthvalue_true_node;
2041 else if (code == EQ_EXPR)
2043 if (max_lt || min_gt)
2044 val = truthvalue_false_node;
2046 else if (code == LT_EXPR)
2049 val = truthvalue_true_node;
2051 val = truthvalue_false_node;
2053 else if (code == GT_EXPR)
2056 val = truthvalue_true_node;
2058 val = truthvalue_false_node;
2060 else if (code == LE_EXPR)
2063 val = truthvalue_true_node;
2065 val = truthvalue_false_node;
2067 else if (code == GE_EXPR)
2070 val = truthvalue_true_node;
2072 val = truthvalue_false_node;
2075 /* If primop0 was sign-extended and unsigned comparison specd,
2076 we did a signed comparison above using the signed type bounds.
2077 But the comparison we output must be unsigned.
2079 Also, for inequalities, VAL is no good; but if the signed
2080 comparison had *any* fixed result, it follows that the
2081 unsigned comparison just tests the sign in reverse
2082 (positive values are LE, negative ones GE).
2083 So we can generate an unsigned comparison
2084 against an extreme value of the signed type. */
2086 if (unsignedp && !unsignedp0)
2093 primop1 = TYPE_MIN_VALUE (type);
2099 primop1 = TYPE_MAX_VALUE (type);
2106 type = c_common_unsigned_type (type);
2109 if (TREE_CODE (primop0) != INTEGER_CST)
2111 if (val == truthvalue_false_node)
2112 warning ("comparison is always false due to limited range of data type");
2113 if (val == truthvalue_true_node)
2114 warning ("comparison is always true due to limited range of data type");
2119 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2120 if (TREE_SIDE_EFFECTS (primop0))
2121 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2125 /* Value is not predetermined, but do the comparison
2126 in the type of the operand that is not constant.
2127 TYPE is already properly set. */
2129 else if (real1 && real2
2130 && (TYPE_PRECISION (TREE_TYPE (primop0))
2131 == TYPE_PRECISION (TREE_TYPE (primop1))))
2132 type = TREE_TYPE (primop0);
2134 /* If args' natural types are both narrower than nominal type
2135 and both extend in the same manner, compare them
2136 in the type of the wider arg.
2137 Otherwise must actually extend both to the nominal
2138 common type lest different ways of extending
2140 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2142 else if (unsignedp0 == unsignedp1 && real1 == real2
2143 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2144 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2146 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2147 type = c_common_signed_or_unsigned_type (unsignedp0
2148 || TYPE_UNSIGNED (*restype_ptr),
2150 /* Make sure shorter operand is extended the right way
2151 to match the longer operand. */
2153 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2154 TREE_TYPE (primop0)),
2157 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2158 TREE_TYPE (primop1)),
2163 /* Here we must do the comparison on the nominal type
2164 using the args exactly as we received them. */
2165 type = *restype_ptr;
2169 if (!real1 && !real2 && integer_zerop (primop1)
2170 && TYPE_UNSIGNED (*restype_ptr))
2176 /* All unsigned values are >= 0, so we warn if extra warnings
2177 are requested. However, if OP0 is a constant that is
2178 >= 0, the signedness of the comparison isn't an issue,
2179 so suppress the warning. */
2180 if (extra_warnings && !in_system_header
2181 && !(TREE_CODE (primop0) == INTEGER_CST
2182 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2184 warning ("comparison of unsigned expression >= 0 is always true");
2185 value = truthvalue_true_node;
2189 if (extra_warnings && !in_system_header
2190 && !(TREE_CODE (primop0) == INTEGER_CST
2191 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2193 warning ("comparison of unsigned expression < 0 is always false");
2194 value = truthvalue_false_node;
2203 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2204 if (TREE_SIDE_EFFECTS (primop0))
2205 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2212 *op0_ptr = convert (type, primop0);
2213 *op1_ptr = convert (type, primop1);
2215 *restype_ptr = truthvalue_type_node;
2220 /* Return a tree for the sum or difference (RESULTCODE says which)
2221 of pointer PTROP and integer INTOP. */
2224 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2228 /* The result is a pointer of the same type that is being added. */
2230 tree result_type = TREE_TYPE (ptrop);
2232 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2234 if (pedantic || warn_pointer_arith)
2235 pedwarn ("pointer of type %<void *%> used in arithmetic");
2236 size_exp = integer_one_node;
2238 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2240 if (pedantic || warn_pointer_arith)
2241 pedwarn ("pointer to a function used in arithmetic");
2242 size_exp = integer_one_node;
2244 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2246 if (pedantic || warn_pointer_arith)
2247 pedwarn ("pointer to member function used in arithmetic");
2248 size_exp = integer_one_node;
2251 size_exp = size_in_bytes (TREE_TYPE (result_type));
2253 /* If what we are about to multiply by the size of the elements
2254 contains a constant term, apply distributive law
2255 and multiply that constant term separately.
2256 This helps produce common subexpressions. */
2258 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2259 && !TREE_CONSTANT (intop)
2260 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2261 && TREE_CONSTANT (size_exp)
2262 /* If the constant comes from pointer subtraction,
2263 skip this optimization--it would cause an error. */
2264 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2265 /* If the constant is unsigned, and smaller than the pointer size,
2266 then we must skip this optimization. This is because it could cause
2267 an overflow error if the constant is negative but INTOP is not. */
2268 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2269 || (TYPE_PRECISION (TREE_TYPE (intop))
2270 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2272 enum tree_code subcode = resultcode;
2273 tree int_type = TREE_TYPE (intop);
2274 if (TREE_CODE (intop) == MINUS_EXPR)
2275 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2276 /* Convert both subexpression types to the type of intop,
2277 because weird cases involving pointer arithmetic
2278 can result in a sum or difference with different type args. */
2279 ptrop = build_binary_op (subcode, ptrop,
2280 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2281 intop = convert (int_type, TREE_OPERAND (intop, 0));
2284 /* Convert the integer argument to a type the same size as sizetype
2285 so the multiply won't overflow spuriously. */
2287 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2288 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2289 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2290 TYPE_UNSIGNED (sizetype)), intop);
2292 /* Replace the integer argument with a suitable product by the object size.
2293 Do this multiplication as signed, then convert to the appropriate
2294 pointer type (actually unsigned integral). */
2296 intop = convert (result_type,
2297 build_binary_op (MULT_EXPR, intop,
2298 convert (TREE_TYPE (intop), size_exp), 1));
2300 /* Create the sum or difference. */
2301 return fold (build2 (resultcode, result_type, ptrop, intop));
2304 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2305 or validate its data type for an `if' or `while' statement or ?..: exp.
2307 This preparation consists of taking the ordinary
2308 representation of an expression expr and producing a valid tree
2309 boolean expression describing whether expr is nonzero. We could
2310 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2311 but we optimize comparisons, &&, ||, and !.
2313 The resulting type should always be `truthvalue_type_node'. */
2316 c_common_truthvalue_conversion (tree expr)
2318 if (TREE_CODE (expr) == ERROR_MARK)
2321 if (TREE_CODE (expr) == FUNCTION_DECL)
2322 expr = build_unary_op (ADDR_EXPR, expr, 0);
2324 switch (TREE_CODE (expr))
2326 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2327 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2328 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2329 case ORDERED_EXPR: case UNORDERED_EXPR:
2330 case TRUTH_ANDIF_EXPR:
2331 case TRUTH_ORIF_EXPR:
2332 case TRUTH_AND_EXPR:
2334 case TRUTH_XOR_EXPR:
2335 case TRUTH_NOT_EXPR:
2336 TREE_TYPE (expr) = truthvalue_type_node;
2343 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2346 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2350 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2351 && !DECL_WEAK (TREE_OPERAND (expr, 0)))
2353 /* Common Ada/Pascal programmer's mistake. We always warn
2354 about this since it is so bad. */
2355 warning ("the address of %qD, will always evaluate as %<true%>",
2356 TREE_OPERAND (expr, 0));
2357 return truthvalue_true_node;
2360 /* If we are taking the address of an external decl, it might be
2361 zero if it is weak, so we cannot optimize. */
2362 if (DECL_P (TREE_OPERAND (expr, 0))
2363 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2366 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2367 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2368 TREE_OPERAND (expr, 0), truthvalue_true_node);
2370 return truthvalue_true_node;
2374 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2375 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2376 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2377 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2383 /* These don't change whether an object is nonzero or zero. */
2384 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2388 /* These don't change whether an object is zero or nonzero, but
2389 we can't ignore them if their second arg has side-effects. */
2390 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2391 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2392 TREE_OPERAND (expr, 1),
2393 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2395 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2398 /* Distribute the conversion into the arms of a COND_EXPR. */
2399 return fold (build3 (COND_EXPR, truthvalue_type_node,
2400 TREE_OPERAND (expr, 0),
2401 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2402 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2405 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2406 since that affects how `default_conversion' will behave. */
2407 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2408 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2410 /* Fall through.... */
2412 /* If this is widening the argument, we can ignore it. */
2413 if (TYPE_PRECISION (TREE_TYPE (expr))
2414 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2415 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2419 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2420 aren't guaranteed to the be same for modes that can represent
2421 infinity, since if x and y are both +infinity, or both
2422 -infinity, then x - y is not a number.
2424 Note that this transformation is safe when x or y is NaN.
2425 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2427 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2429 /* Fall through.... */
2431 /* This and MINUS_EXPR can be changed into a comparison of the
2433 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2434 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2435 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2436 TREE_OPERAND (expr, 1), 1);
2437 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2438 fold (build1 (NOP_EXPR,
2439 TREE_TYPE (TREE_OPERAND (expr, 0)),
2440 TREE_OPERAND (expr, 1))), 1);
2443 if (integer_onep (TREE_OPERAND (expr, 1))
2444 && TREE_TYPE (expr) != truthvalue_type_node)
2445 /* Using convert here would cause infinite recursion. */
2446 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2450 if (warn_parentheses && !TREE_NO_WARNING (expr))
2451 warning ("suggest parentheses around assignment used as truth value");
2458 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2460 tree t = save_expr (expr);
2461 return (build_binary_op
2462 ((TREE_SIDE_EFFECTS (expr)
2463 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2464 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2465 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2469 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2472 static tree builtin_function_2 (const char *builtin_name, const char *name,
2473 tree builtin_type, tree type,
2474 enum built_in_function function_code,
2475 enum built_in_class cl, int library_name_p,
2479 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2480 down to the element type of an array. */
2483 c_build_qualified_type (tree type, int type_quals)
2485 if (type == error_mark_node)
2488 if (TREE_CODE (type) == ARRAY_TYPE)
2489 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2491 TYPE_DOMAIN (type));
2493 /* A restrict-qualified pointer type must be a pointer to object or
2494 incomplete type. Note that the use of POINTER_TYPE_P also allows
2495 REFERENCE_TYPEs, which is appropriate for C++. */
2496 if ((type_quals & TYPE_QUAL_RESTRICT)
2497 && (!POINTER_TYPE_P (type)
2498 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2500 error ("invalid use of %<restrict%>");
2501 type_quals &= ~TYPE_QUAL_RESTRICT;
2504 return build_qualified_type (type, type_quals);
2507 /* Apply the TYPE_QUALS to the new DECL. */
2510 c_apply_type_quals_to_decl (int type_quals, tree decl)
2512 tree type = TREE_TYPE (decl);
2514 if (type == error_mark_node)
2517 if (((type_quals & TYPE_QUAL_CONST)
2518 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2519 /* An object declared 'const' is only readonly after it is
2520 initialized. We don't have any way of expressing this currently,
2521 so we need to be conservative and unset TREE_READONLY for types
2522 with constructors. Otherwise aliasing code will ignore stores in
2523 an inline constructor. */
2524 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2525 TREE_READONLY (decl) = 1;
2526 if (type_quals & TYPE_QUAL_VOLATILE)
2528 TREE_SIDE_EFFECTS (decl) = 1;
2529 TREE_THIS_VOLATILE (decl) = 1;
2531 if (type_quals & TYPE_QUAL_RESTRICT)
2533 while (type && TREE_CODE (type) == ARRAY_TYPE)
2534 /* Allow 'restrict' on arrays of pointers.
2535 FIXME currently we just ignore it. */
2536 type = TREE_TYPE (type);
2538 || !POINTER_TYPE_P (type)
2539 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2540 error ("invalid use of %<restrict%>");
2541 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2542 /* Indicate we need to make a unique alias set for this pointer.
2543 We can't do it here because it might be pointing to an
2545 DECL_POINTER_ALIAS_SET (decl) = -2;
2549 /* Hash function for the problem of multiple type definitions in
2550 different files. This must hash all types that will compare
2551 equal via comptypes to the same value. In practice it hashes
2552 on some of the simple stuff and leaves the details to comptypes. */
2555 c_type_hash (const void *p)
2561 switch (TREE_CODE (t))
2563 /* For pointers, hash on pointee type plus some swizzling. */
2565 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2566 /* Hash on number of elements and total size. */
2569 t2 = TYPE_VALUES (t);
2573 t2 = TYPE_FIELDS (t);
2575 case QUAL_UNION_TYPE:
2577 t2 = TYPE_FIELDS (t);
2581 t2 = TYPE_FIELDS (t);
2586 for (; t2; t2 = TREE_CHAIN (t2))
2588 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2589 return ((size << 24) | (i << shift));
2592 static GTY((param_is (union tree_node))) htab_t type_hash_table;
2594 /* Return the typed-based alias set for T, which may be an expression
2595 or a type. Return -1 if we don't do anything special. */
2598 c_common_get_alias_set (tree t)
2603 /* Permit type-punning when accessing a union, provided the access
2604 is directly through the union. For example, this code does not
2605 permit taking the address of a union member and then storing
2606 through it. Even the type-punning allowed here is a GCC
2607 extension, albeit a common and useful one; the C standard says
2608 that such accesses have implementation-defined behavior. */
2610 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2611 u = TREE_OPERAND (u, 0))
2612 if (TREE_CODE (u) == COMPONENT_REF
2613 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2616 /* That's all the expressions we handle specially. */
2620 /* The C standard guarantees that any object may be accessed via an
2621 lvalue that has character type. */
2622 if (t == char_type_node
2623 || t == signed_char_type_node
2624 || t == unsigned_char_type_node)
2627 /* If it has the may_alias attribute, it can alias anything. */
2628 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2631 /* The C standard specifically allows aliasing between signed and
2632 unsigned variants of the same type. We treat the signed
2633 variant as canonical. */
2634 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2636 tree t1 = c_common_signed_type (t);
2638 /* t1 == t can happen for boolean nodes which are always unsigned. */
2640 return get_alias_set (t1);
2642 else if (POINTER_TYPE_P (t))
2646 /* Unfortunately, there is no canonical form of a pointer type.
2647 In particular, if we have `typedef int I', then `int *', and
2648 `I *' are different types. So, we have to pick a canonical
2649 representative. We do this below.
2651 Technically, this approach is actually more conservative that
2652 it needs to be. In particular, `const int *' and `int *'
2653 should be in different alias sets, according to the C and C++
2654 standard, since their types are not the same, and so,
2655 technically, an `int **' and `const int **' cannot point at
2658 But, the standard is wrong. In particular, this code is
2663 const int* const* cipp = ipp;
2665 And, it doesn't make sense for that to be legal unless you
2666 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2667 the pointed-to types. This issue has been reported to the
2669 t1 = build_type_no_quals (t);
2671 return get_alias_set (t1);
2674 /* Handle the case of multiple type nodes referring to "the same" type,
2675 which occurs with IMA. These share an alias set. FIXME: Currently only
2676 C90 is handled. (In C99 type compatibility is not transitive, which
2677 complicates things mightily. The alias set splay trees can theoretically
2678 represent this, but insertion is tricky when you consider all the
2679 different orders things might arrive in.) */
2681 if (c_language != clk_c || flag_isoc99)
2684 /* Save time if there's only one input file. */
2685 if (num_in_fnames == 1)
2688 /* Pointers need special handling if they point to any type that
2689 needs special handling (below). */
2690 if (TREE_CODE (t) == POINTER_TYPE)
2693 /* Find bottom type under any nested POINTERs. */
2694 for (t2 = TREE_TYPE (t);
2695 TREE_CODE (t2) == POINTER_TYPE;
2696 t2 = TREE_TYPE (t2))
2698 if (TREE_CODE (t2) != RECORD_TYPE
2699 && TREE_CODE (t2) != ENUMERAL_TYPE
2700 && TREE_CODE (t2) != QUAL_UNION_TYPE
2701 && TREE_CODE (t2) != UNION_TYPE)
2703 if (TYPE_SIZE (t2) == 0)
2706 /* These are the only cases that need special handling. */
2707 if (TREE_CODE (t) != RECORD_TYPE
2708 && TREE_CODE (t) != ENUMERAL_TYPE
2709 && TREE_CODE (t) != QUAL_UNION_TYPE
2710 && TREE_CODE (t) != UNION_TYPE
2711 && TREE_CODE (t) != POINTER_TYPE)
2714 if (TYPE_SIZE (t) == 0)
2717 /* Look up t in hash table. Only one of the compatible types within each
2718 alias set is recorded in the table. */
2719 if (!type_hash_table)
2720 type_hash_table = htab_create_ggc (1021, c_type_hash,
2721 (htab_eq) lang_hooks.types_compatible_p,
2723 slot = htab_find_slot (type_hash_table, t, INSERT);
2726 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
2727 return TYPE_ALIAS_SET ((tree)*slot);
2730 /* Our caller will assign and record (in t) a new alias set; all we need
2731 to do is remember t in the hash table. */
2737 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2738 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2739 flag controls whether we should diagnose possibly ill-formed
2740 constructs or not. */
2742 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2744 const char *op_name;
2746 enum tree_code type_code = TREE_CODE (type);
2748 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
2749 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2751 if (type_code == FUNCTION_TYPE)
2753 if (op == SIZEOF_EXPR)
2755 if (complain && (pedantic || warn_pointer_arith))
2756 pedwarn ("invalid application of %<sizeof%> to a function type");
2757 value = size_one_node;
2760 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2762 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2764 if (type_code == VOID_TYPE
2765 && complain && (pedantic || warn_pointer_arith))
2766 pedwarn ("invalid application of %qs to a void type", op_name);
2767 value = size_one_node;
2769 else if (!COMPLETE_TYPE_P (type))
2772 error ("invalid application of %qs to incomplete type %qT ",
2774 value = size_zero_node;
2778 if (op == (enum tree_code) SIZEOF_EXPR)
2779 /* Convert in case a char is more than one unit. */
2780 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2781 size_int (TYPE_PRECISION (char_type_node)
2784 value = size_int (TYPE_ALIGN_UNIT (type));
2787 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2788 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2789 never happen. However, this node should really have type
2790 `size_t', which is just a typedef for an ordinary integer type. */
2791 value = fold (build1 (NOP_EXPR, size_type_node, value));
2792 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
2797 /* Implement the __alignof keyword: Return the minimum required
2798 alignment of EXPR, measured in bytes. For VAR_DECL's and
2799 FIELD_DECL's return DECL_ALIGN (which can be set from an
2800 "aligned" __attribute__ specification). */
2803 c_alignof_expr (tree expr)
2807 if (TREE_CODE (expr) == VAR_DECL)
2808 t = size_int (DECL_ALIGN_UNIT (expr));
2810 else if (TREE_CODE (expr) == COMPONENT_REF
2811 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2813 error ("%<__alignof%> applied to a bit-field");
2816 else if (TREE_CODE (expr) == COMPONENT_REF
2817 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2818 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
2820 else if (TREE_CODE (expr) == INDIRECT_REF)
2822 tree t = TREE_OPERAND (expr, 0);
2824 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2826 while (TREE_CODE (t) == NOP_EXPR
2827 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2831 t = TREE_OPERAND (t, 0);
2832 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2833 if (thisalign > bestalign)
2834 best = t, bestalign = thisalign;
2836 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2839 return c_alignof (TREE_TYPE (expr));
2841 return fold (build1 (NOP_EXPR, size_type_node, t));
2844 /* Handle C and C++ default attributes. */
2846 enum built_in_attribute
2848 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2849 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2850 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2851 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2852 #include "builtin-attrs.def"
2853 #undef DEF_ATTR_NULL_TREE
2855 #undef DEF_ATTR_IDENT
2856 #undef DEF_ATTR_TREE_LIST
2860 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2862 static void c_init_attributes (void);
2864 /* Build tree nodes and builtin functions common to both C and C++ language
2868 c_common_nodes_and_builtins (void)
2872 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2873 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2874 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2875 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2876 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2877 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2878 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2879 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2880 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2881 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2882 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2883 #include "builtin-types.def"
2884 #undef DEF_PRIMITIVE_TYPE
2885 #undef DEF_FUNCTION_TYPE_0
2886 #undef DEF_FUNCTION_TYPE_1
2887 #undef DEF_FUNCTION_TYPE_2
2888 #undef DEF_FUNCTION_TYPE_3
2889 #undef DEF_FUNCTION_TYPE_4
2890 #undef DEF_FUNCTION_TYPE_VAR_0
2891 #undef DEF_FUNCTION_TYPE_VAR_1
2892 #undef DEF_FUNCTION_TYPE_VAR_2
2893 #undef DEF_FUNCTION_TYPE_VAR_3
2894 #undef DEF_POINTER_TYPE
2898 typedef enum builtin_type builtin_type;
2900 tree builtin_types[(int) BT_LAST];
2901 int wchar_type_size;
2902 tree array_domain_type;
2903 tree va_list_ref_type_node;
2904 tree va_list_arg_type_node;
2906 /* Define `int' and `char' first so that dbx will output them first. */
2907 record_builtin_type (RID_INT, NULL, integer_type_node);
2908 record_builtin_type (RID_CHAR, "char", char_type_node);
2910 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2911 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2912 but not C. Are the conditionals here needed? */
2913 if (c_dialect_cxx ())
2914 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
2915 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
2916 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
2917 record_builtin_type (RID_MAX, "long unsigned int",
2918 long_unsigned_type_node);
2919 if (c_dialect_cxx ())
2920 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
2921 record_builtin_type (RID_MAX, "long long int",
2922 long_long_integer_type_node);
2923 record_builtin_type (RID_MAX, "long long unsigned int",
2924 long_long_unsigned_type_node);
2925 if (c_dialect_cxx ())
2926 record_builtin_type (RID_MAX, "long long unsigned",
2927 long_long_unsigned_type_node);
2928 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
2929 record_builtin_type (RID_MAX, "short unsigned int",
2930 short_unsigned_type_node);
2931 if (c_dialect_cxx ())
2932 record_builtin_type (RID_MAX, "unsigned short",
2933 short_unsigned_type_node);
2935 /* Define both `signed char' and `unsigned char'. */
2936 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
2937 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
2939 /* These are types that c_common_type_for_size and
2940 c_common_type_for_mode use. */
2941 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2943 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2945 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2947 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2949 #if HOST_BITS_PER_WIDE_INT >= 64
2950 if (targetm.scalar_mode_supported_p (TImode))
2951 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2952 get_identifier ("__int128_t"),
2955 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2956 unsigned_intQI_type_node));
2957 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2958 unsigned_intHI_type_node));
2959 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2960 unsigned_intSI_type_node));
2961 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2962 unsigned_intDI_type_node));
2963 #if HOST_BITS_PER_WIDE_INT >= 64
2964 if (targetm.scalar_mode_supported_p (TImode))
2965 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2966 get_identifier ("__uint128_t"),
2967 unsigned_intTI_type_node));
2970 /* Create the widest literal types. */
2971 widest_integer_literal_type_node
2972 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
2973 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2974 widest_integer_literal_type_node));
2976 widest_unsigned_literal_type_node
2977 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
2978 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2979 widest_unsigned_literal_type_node));
2981 /* `unsigned long' is the standard type for sizeof.
2982 Note that stddef.h uses `unsigned long',
2983 and this must agree, even if long and int are the same size. */
2985 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
2986 signed_size_type_node = c_common_signed_type (size_type_node);
2987 set_sizetype (size_type_node);
2990 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
2992 build_common_tree_nodes_2 (flag_short_double);
2994 record_builtin_type (RID_FLOAT, NULL, float_type_node);
2995 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
2996 record_builtin_type (RID_MAX, "long double", long_double_type_node);
2998 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2999 get_identifier ("complex int"),
3000 complex_integer_type_node));
3001 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3002 get_identifier ("complex float"),
3003 complex_float_type_node));
3004 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3005 get_identifier ("complex double"),
3006 complex_double_type_node));
3007 lang_hooks.decls.pushdecl
3008 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3009 complex_long_double_type_node));
3011 if (c_dialect_cxx ())
3012 /* For C++, make fileptr_type_node a distinct void * type until
3013 FILE type is defined. */
3014 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3016 record_builtin_type (RID_VOID, NULL, void_type_node);
3018 /* This node must not be shared. */
3019 void_zero_node = make_node (INTEGER_CST);
3020 TREE_TYPE (void_zero_node) = void_type_node;
3022 void_list_node = build_void_list_node ();
3024 /* Make a type to be the domain of a few array types
3025 whose domains don't really matter.
3026 200 is small enough that it always fits in size_t
3027 and large enough that it can hold most function names for the
3028 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3029 array_domain_type = build_index_type (size_int (200));
3031 /* Make a type for arrays of characters.
3032 With luck nothing will ever really depend on the length of this
3034 char_array_type_node
3035 = build_array_type (char_type_node, array_domain_type);
3037 /* Likewise for arrays of ints. */
3039 = build_array_type (integer_type_node, array_domain_type);
3041 string_type_node = build_pointer_type (char_type_node);
3042 const_string_type_node
3043 = build_pointer_type (build_qualified_type
3044 (char_type_node, TYPE_QUAL_CONST));
3046 /* This is special for C++ so functions can be overloaded. */
3047 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3048 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3049 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3050 if (c_dialect_cxx ())
3052 if (TYPE_UNSIGNED (wchar_type_node))
3053 wchar_type_node = make_unsigned_type (wchar_type_size);
3055 wchar_type_node = make_signed_type (wchar_type_size);
3056 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3060 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3061 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3064 /* This is for wide string constants. */
3065 wchar_array_type_node
3066 = build_array_type (wchar_type_node, array_domain_type);
3069 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3072 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3074 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3076 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3078 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3079 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3081 lang_hooks.decls.pushdecl
3082 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3083 va_list_type_node));
3085 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3087 va_list_arg_type_node = va_list_ref_type_node =
3088 build_pointer_type (TREE_TYPE (va_list_type_node));
3092 va_list_arg_type_node = va_list_type_node;
3093 va_list_ref_type_node = build_reference_type (va_list_type_node);
3096 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3097 builtin_types[(int) ENUM] = VALUE;
3098 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3099 builtin_types[(int) ENUM] \
3100 = build_function_type (builtin_types[(int) RETURN], \
3102 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3103 builtin_types[(int) ENUM] \
3104 = build_function_type (builtin_types[(int) RETURN], \
3105 tree_cons (NULL_TREE, \
3106 builtin_types[(int) ARG1], \
3108 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3109 builtin_types[(int) ENUM] \
3110 = build_function_type \
3111 (builtin_types[(int) RETURN], \
3112 tree_cons (NULL_TREE, \
3113 builtin_types[(int) ARG1], \
3114 tree_cons (NULL_TREE, \
3115 builtin_types[(int) ARG2], \
3117 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3118 builtin_types[(int) ENUM] \
3119 = build_function_type \
3120 (builtin_types[(int) RETURN], \
3121 tree_cons (NULL_TREE, \
3122 builtin_types[(int) ARG1], \
3123 tree_cons (NULL_TREE, \
3124 builtin_types[(int) ARG2], \
3125 tree_cons (NULL_TREE, \
3126 builtin_types[(int) ARG3], \
3128 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3129 builtin_types[(int) ENUM] \
3130 = build_function_type \
3131 (builtin_types[(int) RETURN], \
3132 tree_cons (NULL_TREE, \
3133 builtin_types[(int) ARG1], \
3134 tree_cons (NULL_TREE, \
3135 builtin_types[(int) ARG2], \
3138 builtin_types[(int) ARG3], \
3139 tree_cons (NULL_TREE, \
3140 builtin_types[(int) ARG4], \
3141 void_list_node)))));
3142 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3143 builtin_types[(int) ENUM] \
3144 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3145 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3146 builtin_types[(int) ENUM] \
3147 = build_function_type (builtin_types[(int) RETURN], \
3148 tree_cons (NULL_TREE, \
3149 builtin_types[(int) ARG1], \
3152 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3153 builtin_types[(int) ENUM] \
3154 = build_function_type \
3155 (builtin_types[(int) RETURN], \
3156 tree_cons (NULL_TREE, \
3157 builtin_types[(int) ARG1], \
3158 tree_cons (NULL_TREE, \
3159 builtin_types[(int) ARG2], \
3162 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3163 builtin_types[(int) ENUM] \
3164 = build_function_type \
3165 (builtin_types[(int) RETURN], \
3166 tree_cons (NULL_TREE, \
3167 builtin_types[(int) ARG1], \
3168 tree_cons (NULL_TREE, \
3169 builtin_types[(int) ARG2], \
3170 tree_cons (NULL_TREE, \
3171 builtin_types[(int) ARG3], \
3174 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3175 builtin_types[(int) ENUM] \
3176 = build_pointer_type (builtin_types[(int) TYPE]);
3177 #include "builtin-types.def"
3178 #undef DEF_PRIMITIVE_TYPE
3179 #undef DEF_FUNCTION_TYPE_1
3180 #undef DEF_FUNCTION_TYPE_2
3181 #undef DEF_FUNCTION_TYPE_3
3182 #undef DEF_FUNCTION_TYPE_4
3183 #undef DEF_FUNCTION_TYPE_VAR_0
3184 #undef DEF_FUNCTION_TYPE_VAR_1
3185 #undef DEF_FUNCTION_TYPE_VAR_2
3186 #undef DEF_FUNCTION_TYPE_VAR_3
3187 #undef DEF_POINTER_TYPE
3189 c_init_attributes ();
3191 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3192 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3197 gcc_assert (!strncmp (NAME, "__builtin_", \
3198 strlen ("__builtin_"))); \
3201 decl = lang_hooks.builtin_function (NAME, builtin_types[TYPE], \
3205 ? (NAME + strlen ("__builtin_")) \
3207 built_in_attributes[(int) ATTRS]); \
3209 decl = builtin_function_2 (NAME, \
3210 NAME + strlen ("__builtin_"), \
3211 builtin_types[TYPE], \
3212 builtin_types[LIBTYPE], \
3217 built_in_attributes[(int) ATTRS]); \
3219 built_in_decls[(int) ENUM] = decl; \
3221 implicit_built_in_decls[(int) ENUM] = decl; \
3223 #include "builtins.def"
3226 targetm.init_builtins ();
3230 main_identifier_node = get_identifier ("main");
3234 build_va_arg (tree expr, tree type)
3236 return build1 (VA_ARG_EXPR, type, expr);
3240 /* Linked list of disabled built-in functions. */
3242 typedef struct disabled_builtin
3245 struct disabled_builtin *next;
3247 static disabled_builtin *disabled_builtins = NULL;
3249 static bool builtin_function_disabled_p (const char *);
3251 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3252 begins with "__builtin_", give an error. */
3255 disable_builtin_function (const char *name)
3257 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3258 error ("cannot disable built-in function %qs", name);
3261 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3262 new_disabled_builtin->name = name;
3263 new_disabled_builtin->next = disabled_builtins;
3264 disabled_builtins = new_disabled_builtin;
3269 /* Return true if the built-in function NAME has been disabled, false
3273 builtin_function_disabled_p (const char *name)
3275 disabled_builtin *p;
3276 for (p = disabled_builtins; p != NULL; p = p->next)
3278 if (strcmp (name, p->name) == 0)
3285 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3286 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3287 of these may be NULL (though both being NULL is useless).
3288 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3289 TYPE is the type of the function with the ordinary name. These
3290 may differ if the ordinary name is declared with a looser type to avoid
3291 conflicts with headers. FUNCTION_CODE and CL are as for
3292 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3293 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3294 If NONANSI_P is true, the name NAME is treated as a non-ANSI name;
3295 ATTRS is the tree list representing the builtin's function attributes.
3296 Returns the declaration of BUILTIN_NAME, if any, otherwise
3297 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3298 or if NONANSI_P and flag_no_nonansi_builtin. */
3301 builtin_function_2 (const char *builtin_name, const char *name,
3302 tree builtin_type, tree type,
3303 enum built_in_function function_code,
3304 enum built_in_class cl, int library_name_p,
3305 bool nonansi_p, tree attrs)
3307 tree bdecl = NULL_TREE;
3308 tree decl = NULL_TREE;
3310 if (builtin_name != 0)
3311 bdecl = lang_hooks.builtin_function (builtin_name, builtin_type,
3313 library_name_p ? name : NULL, attrs);
3315 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3316 && !(nonansi_p && flag_no_nonansi_builtin))
3317 decl = lang_hooks.builtin_function (name, type, function_code, cl,
3320 return (bdecl != 0 ? bdecl : decl);
3323 /* Nonzero if the type T promotes to int. This is (nearly) the
3324 integral promotions defined in ISO C99 6.3.1.1/2. */
3327 c_promoting_integer_type_p (tree t)
3329 switch (TREE_CODE (t))
3332 return (TYPE_MAIN_VARIANT (t) == char_type_node
3333 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3334 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3335 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3336 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3337 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3340 /* ??? Technically all enumerations not larger than an int
3341 promote to an int. But this is used along code paths
3342 that only want to notice a size change. */
3343 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3353 /* Return 1 if PARMS specifies a fixed number of parameters
3354 and none of their types is affected by default promotions. */
3357 self_promoting_args_p (tree parms)
3360 for (t = parms; t; t = TREE_CHAIN (t))
3362 tree type = TREE_VALUE (t);
3364 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3370 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3373 if (c_promoting_integer_type_p (type))
3379 /* Recursively examines the array elements of TYPE, until a non-array
3380 element type is found. */
3383 strip_array_types (tree type)
3385 while (TREE_CODE (type) == ARRAY_TYPE)
3386 type = TREE_TYPE (type);
3391 /* Recursively remove any '*' or '&' operator from TYPE. */
3393 strip_pointer_operator (tree t)
3395 while (POINTER_TYPE_P (t))
3400 /* Used to compare case labels. K1 and K2 are actually tree nodes
3401 representing case labels, or NULL_TREE for a `default' label.
3402 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3403 K2, and 0 if K1 and K2 are equal. */
3406 case_compare (splay_tree_key k1, splay_tree_key k2)
3408 /* Consider a NULL key (such as arises with a `default' label) to be
3409 smaller than anything else. */
3415 return tree_int_cst_compare ((tree) k1, (tree) k2);
3418 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3419 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3420 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3421 case label was declared using the usual C/C++ syntax, rather than
3422 the GNU case range extension. CASES is a tree containing all the
3423 case ranges processed so far; COND is the condition for the
3424 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3425 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3428 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3429 tree low_value, tree high_value)
3434 splay_tree_node node;
3436 /* Create the LABEL_DECL itself. */
3437 label = create_artificial_label ();
3439 /* If there was an error processing the switch condition, bail now
3440 before we get more confused. */
3441 if (!cond || cond == error_mark_node)
3444 if ((low_value && TREE_TYPE (low_value)
3445 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3446 || (high_value && TREE_TYPE (high_value)
3447 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3448 error ("pointers are not permitted as case values");
3450 /* Case ranges are a GNU extension. */
3451 if (high_value && pedantic)
3452 pedwarn ("range expressions in switch statements are non-standard");
3454 type = TREE_TYPE (cond);
3457 low_value = check_case_value (low_value);
3458 low_value = convert_and_check (type, low_value);
3462 high_value = check_case_value (high_value);
3463 high_value = convert_and_check (type, high_value);
3466 /* If an error has occurred, bail out now. */
3467 if (low_value == error_mark_node || high_value == error_mark_node)
3470 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3471 really a case range, even though it was written that way. Remove
3472 the HIGH_VALUE to simplify later processing. */
3473 if (tree_int_cst_equal (low_value, high_value))
3474 high_value = NULL_TREE;
3475 if (low_value && high_value
3476 && !tree_int_cst_lt (low_value, high_value))
3477 warning ("empty range specified");
3479 /* See if the case is in range of the type of the original testing
3480 expression. If both low_value and high_value are out of range,
3481 don't insert the case label and return NULL_TREE. */
3483 && !check_case_bounds (type, orig_type,
3484 &low_value, high_value ? &high_value : NULL))
3487 /* Look up the LOW_VALUE in the table of case labels we already
3489 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3490 /* If there was not an exact match, check for overlapping ranges.
3491 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3492 that's a `default' label and the only overlap is an exact match. */
3493 if (!node && (low_value || high_value))
3495 splay_tree_node low_bound;
3496 splay_tree_node high_bound;
3498 /* Even though there wasn't an exact match, there might be an
3499 overlap between this case range and another case range.
3500 Since we've (inductively) not allowed any overlapping case
3501 ranges, we simply need to find the greatest low case label
3502 that is smaller that LOW_VALUE, and the smallest low case
3503 label that is greater than LOW_VALUE. If there is an overlap
3504 it will occur in one of these two ranges. */
3505 low_bound = splay_tree_predecessor (cases,
3506 (splay_tree_key) low_value);
3507 high_bound = splay_tree_successor (cases,
3508 (splay_tree_key) low_value);
3510 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3511 the LOW_VALUE, so there is no need to check unless the
3512 LOW_BOUND is in fact itself a case range. */
3514 && CASE_HIGH ((tree) low_bound->value)
3515 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3518 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3519 range is bigger than the low end of the current range, so we
3520 are only interested if the current range is a real range, and
3521 not an ordinary case label. */
3524 && (tree_int_cst_compare ((tree) high_bound->key,
3529 /* If there was an overlap, issue an error. */
3532 tree duplicate = CASE_LABEL ((tree) node->value);
3536 error ("duplicate (or overlapping) case value");
3537 error ("%Jthis is the first entry overlapping that value", duplicate);
3541 error ("duplicate case value") ;
3542 error ("%Jpreviously used here", duplicate);
3546 error ("multiple default labels in one switch");
3547 error ("%Jthis is the first default label", duplicate);
3552 /* Add a CASE_LABEL to the statement-tree. */
3553 case_label = add_stmt (build_case_label (low_value, high_value, label));
3554 /* Register this case label in the splay tree. */
3555 splay_tree_insert (cases,
3556 (splay_tree_key) low_value,
3557 (splay_tree_value) case_label);
3562 /* Add a label so that the back-end doesn't think that the beginning of
3563 the switch is unreachable. Note that we do not add a case label, as
3564 that just leads to duplicates and thence to aborts later on. */
3567 tree t = create_artificial_label ();
3568 add_stmt (build_stmt (LABEL_EXPR, t));
3570 return error_mark_node;
3573 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3574 Used to verify that case values match up with enumerator values. */
3577 match_case_to_enum_1 (tree key, tree type, tree label)
3579 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3581 /* ??? Not working too hard to print the double-word value.
3582 Should perhaps be done with %lwd in the diagnostic routines? */
3583 if (TREE_INT_CST_HIGH (key) == 0)
3584 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3585 TREE_INT_CST_LOW (key));
3586 else if (!TYPE_UNSIGNED (type)
3587 && TREE_INT_CST_HIGH (key) == -1
3588 && TREE_INT_CST_LOW (key) != 0)
3589 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3590 -TREE_INT_CST_LOW (key));
3592 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3593 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3595 if (TYPE_NAME (type) == 0)
3596 warning ("%Jcase value %qs not in enumerated type",
3597 CASE_LABEL (label), buf);
3599 warning ("%Jcase value %qs not in enumerated type %qT",
3600 CASE_LABEL (label), buf, type);
3604 match_case_to_enum (splay_tree_node node, void *data)
3606 tree label = (tree) node->value;
3607 tree type = (tree) data;
3609 /* Skip default case. */
3610 if (!CASE_LOW (label))
3613 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3614 when we did our enum->case scan. Reset our scratch bit after. */
3615 if (!TREE_ADDRESSABLE (label))
3616 match_case_to_enum_1 (CASE_LOW (label), type, label);
3618 TREE_ADDRESSABLE (label) = 0;
3620 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3621 Note that the old code in stmt.c did not check for the values in
3622 the range either, just the endpoints. */
3623 if (CASE_HIGH (label))
3625 tree chain, key = CASE_HIGH (label);
3627 for (chain = TYPE_VALUES (type);
3628 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
3629 chain = TREE_CHAIN (chain))
3632 match_case_to_enum_1 (key, type, label);
3638 /* Handle -Wswitch*. Called from the front end after parsing the switch
3640 /* ??? Should probably be somewhere generic, since other languages besides
3641 C and C++ would want this. We'd want to agree on the datastructure,
3642 however, which is a problem. Alternately, we operate on gimplified
3643 switch_exprs, which I don't especially like. At the moment, however,
3644 C/C++ are the only tree-ssa languages that support enumerations at all,
3645 so the point is moot. */
3648 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
3650 splay_tree_node default_node;
3651 location_t switch_location;
3654 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
3657 if (EXPR_HAS_LOCATION (switch_stmt))
3658 switch_location = EXPR_LOCATION (switch_stmt);
3660 switch_location = input_location;
3662 type = SWITCH_TYPE (switch_stmt);
3664 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3665 if (warn_switch_default && !default_node)
3666 warning ("%Hswitch missing default case", &switch_location);
3668 /* If the switch expression was an enumerated type, check that
3669 exactly all enumeration literals are covered by the cases.
3670 The check is made when -Wswitch was specified and there is no
3671 default case, or when -Wswitch-enum was specified. */
3672 if (((warn_switch && !default_node) || warn_switch_enum)
3673 && type && TREE_CODE (type) == ENUMERAL_TYPE
3674 && TREE_CODE (SWITCH_COND (switch_stmt)) != INTEGER_CST)
3678 /* The time complexity here is O(N*lg(N)) worst case, but for the
3679 common case of monotonically increasing enumerators, it is
3680 O(N), since the nature of the splay tree will keep the next
3681 element adjacent to the root at all times. */
3683 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
3685 splay_tree_node node
3686 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
3690 /* Mark the CASE_LOW part of the case entry as seen, so
3691 that we save time later. Choose TREE_ADDRESSABLE
3692 randomly as a bit that won't have been set to-date. */
3693 tree label = (tree) node->value;
3694 TREE_ADDRESSABLE (label) = 1;
3698 /* Warn if there are enumerators that don't correspond to
3699 case expressions. */
3700 warning ("%Henumeration value %qE not handled in switch",
3701 &switch_location, TREE_PURPOSE (chain));
3705 /* Warn if there are case expressions that don't correspond to
3706 enumerators. This can occur since C and C++ don't enforce
3707 type-checking of assignments to enumeration variables.
3709 The time complexity here is O(N**2) worst case, since we've
3710 not sorted the enumeration values. However, in the absence
3711 of case ranges this is O(N), since all single cases that
3712 corresponded to enumerations have been marked above. */
3714 splay_tree_foreach (cases, match_case_to_enum, type);
3718 /* Finish an expression taking the address of LABEL (an
3719 IDENTIFIER_NODE). Returns an expression for the address. */
3722 finish_label_address_expr (tree label)
3727 pedwarn ("taking the address of a label is non-standard");
3729 if (label == error_mark_node)
3730 return error_mark_node;
3732 label = lookup_label (label);
3733 if (label == NULL_TREE)
3734 result = null_pointer_node;
3737 TREE_USED (label) = 1;
3738 result = build1 (ADDR_EXPR, ptr_type_node, label);
3739 /* The current function in not necessarily uninlinable.
3740 Computed gotos are incompatible with inlining, but the value
3741 here could be used only in a diagnostic, for example. */
3747 /* Hook used by expand_expr to expand language-specific tree codes. */
3748 /* The only things that should go here are bits needed to expand
3749 constant initializers. Everything else should be handled by the
3750 gimplification routines. */
3753 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
3754 int modifier /* Actually enum_modifier. */,
3757 switch (TREE_CODE (exp))
3759 case COMPOUND_LITERAL_EXPR:
3761 /* Initialize the anonymous variable declared in the compound
3762 literal, then return the variable. */
3763 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
3764 emit_local_var (decl);
3765 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
3773 /* Hook used by staticp to handle language-specific tree codes. */
3776 c_staticp (tree exp)
3778 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
3779 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
3784 /* Given a boolean expression ARG, return a tree representing an increment
3785 or decrement (as indicated by CODE) of ARG. The front end must check for
3786 invalid cases (e.g., decrement in C++). */
3788 boolean_increment (enum tree_code code, tree arg)
3791 tree true_res = boolean_true_node;
3793 arg = stabilize_reference (arg);
3796 case PREINCREMENT_EXPR:
3797 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3799 case POSTINCREMENT_EXPR:
3800 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3801 arg = save_expr (arg);
3802 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3803 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3805 case PREDECREMENT_EXPR:
3806 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3807 invert_truthvalue (arg));
3809 case POSTDECREMENT_EXPR:
3810 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3811 invert_truthvalue (arg));
3812 arg = save_expr (arg);
3813 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3814 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3819 TREE_SIDE_EFFECTS (val) = 1;
3823 /* Built-in macros for stddef.h, that require macros defined in this
3826 c_stddef_cpp_builtins(void)
3828 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
3829 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
3830 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
3831 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
3832 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
3833 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
3837 c_init_attributes (void)
3839 /* Fill in the built_in_attributes array. */
3840 #define DEF_ATTR_NULL_TREE(ENUM) \
3841 built_in_attributes[(int) ENUM] = NULL_TREE;
3842 #define DEF_ATTR_INT(ENUM, VALUE) \
3843 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
3844 #define DEF_ATTR_IDENT(ENUM, STRING) \
3845 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3846 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3847 built_in_attributes[(int) ENUM] \
3848 = tree_cons (built_in_attributes[(int) PURPOSE], \
3849 built_in_attributes[(int) VALUE], \
3850 built_in_attributes[(int) CHAIN]);
3851 #include "builtin-attrs.def"
3852 #undef DEF_ATTR_NULL_TREE
3854 #undef DEF_ATTR_IDENT
3855 #undef DEF_ATTR_TREE_LIST
3858 /* Attribute handlers common to C front ends. */
3860 /* Handle a "packed" attribute; arguments as in
3861 struct attribute_spec.handler. */
3864 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3865 int flags, bool *no_add_attrs)
3869 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3870 *node = build_variant_type_copy (*node);
3871 TYPE_PACKED (*node) = 1;
3872 if (TYPE_MAIN_VARIANT (*node) == *node)
3874 /* If it is the main variant, then pack the other variants
3875 too. This happens in,
3878 struct Foo const *ptr; // creates a variant w/o packed flag
3879 } __ attribute__((packed)); // packs it now.
3883 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
3884 TYPE_PACKED (probe) = 1;
3888 else if (TREE_CODE (*node) == FIELD_DECL)
3889 DECL_PACKED (*node) = 1;
3890 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
3891 used for DECL_REGISTER. It wouldn't mean anything anyway.
3892 We can't set DECL_PACKED on the type of a TYPE_DECL, because
3893 that changes what the typedef is typing. */
3896 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3897 *no_add_attrs = true;
3903 /* Handle a "nocommon" attribute; arguments as in
3904 struct attribute_spec.handler. */
3907 handle_nocommon_attribute (tree *node, tree name,
3908 tree ARG_UNUSED (args),
3909 int ARG_UNUSED (flags), bool *no_add_attrs)
3911 if (TREE_CODE (*node) == VAR_DECL)
3912 DECL_COMMON (*node) = 0;
3915 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3916 *no_add_attrs = true;
3922 /* Handle a "common" attribute; arguments as in
3923 struct attribute_spec.handler. */
3926 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3927 int ARG_UNUSED (flags), bool *no_add_attrs)
3929 if (TREE_CODE (*node) == VAR_DECL)
3930 DECL_COMMON (*node) = 1;
3933 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3934 *no_add_attrs = true;
3940 /* Handle a "noreturn" attribute; arguments as in
3941 struct attribute_spec.handler. */
3944 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3945 int ARG_UNUSED (flags), bool *no_add_attrs)
3947 tree type = TREE_TYPE (*node);
3949 /* See FIXME comment in c_common_attribute_table. */
3950 if (TREE_CODE (*node) == FUNCTION_DECL)
3951 TREE_THIS_VOLATILE (*node) = 1;
3952 else if (TREE_CODE (type) == POINTER_TYPE
3953 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
3955 = build_pointer_type
3956 (build_type_variant (TREE_TYPE (type),
3957 TYPE_READONLY (TREE_TYPE (type)), 1));
3960 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3961 *no_add_attrs = true;
3967 /* Handle a "noinline" attribute; arguments as in
3968 struct attribute_spec.handler. */
3971 handle_noinline_attribute (tree *node, tree name,
3972 tree ARG_UNUSED (args),
3973 int ARG_UNUSED (flags), bool *no_add_attrs)
3975 if (TREE_CODE (*node) == FUNCTION_DECL)
3976 DECL_UNINLINABLE (*node) = 1;
3979 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3980 *no_add_attrs = true;
3986 /* Handle a "always_inline" attribute; arguments as in
3987 struct attribute_spec.handler. */
3990 handle_always_inline_attribute (tree *node, tree name,
3991 tree ARG_UNUSED (args),
3992 int ARG_UNUSED (flags),
3995 if (TREE_CODE (*node) == FUNCTION_DECL)
3997 /* Do nothing else, just set the attribute. We'll get at
3998 it later with lookup_attribute. */
4002 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4003 *no_add_attrs = true;
4009 /* Handle a "used" attribute; arguments as in
4010 struct attribute_spec.handler. */
4013 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4014 int ARG_UNUSED (flags), bool *no_add_attrs)
4018 if (TREE_CODE (node) == FUNCTION_DECL
4019 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4021 TREE_USED (node) = 1;
4022 DECL_PRESERVE_P (node) = 1;
4026 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4027 *no_add_attrs = true;
4033 /* Handle a "unused" attribute; arguments as in
4034 struct attribute_spec.handler. */
4037 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4038 int flags, bool *no_add_attrs)
4044 if (TREE_CODE (decl) == PARM_DECL
4045 || TREE_CODE (decl) == VAR_DECL
4046 || TREE_CODE (decl) == FUNCTION_DECL
4047 || TREE_CODE (decl) == LABEL_DECL
4048 || TREE_CODE (decl) == TYPE_DECL)
4049 TREE_USED (decl) = 1;
4052 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4053 *no_add_attrs = true;
4058 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4059 *node = build_variant_type_copy (*node);
4060 TREE_USED (*node) = 1;
4066 /* Handle a "const" attribute; arguments as in
4067 struct attribute_spec.handler. */
4070 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4071 int ARG_UNUSED (flags), bool *no_add_attrs)
4073 tree type = TREE_TYPE (*node);
4075 /* See FIXME comment on noreturn in c_common_attribute_table. */
4076 if (TREE_CODE (*node) == FUNCTION_DECL)
4077 TREE_READONLY (*node) = 1;
4078 else if (TREE_CODE (type) == POINTER_TYPE
4079 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4081 = build_pointer_type
4082 (build_type_variant (TREE_TYPE (type), 1,
4083 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4086 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4087 *no_add_attrs = true;
4093 /* Handle a "transparent_union" attribute; arguments as in
4094 struct attribute_spec.handler. */
4097 handle_transparent_union_attribute (tree *node, tree name,
4098 tree ARG_UNUSED (args), int flags,
4101 tree decl = NULL_TREE;
4108 type = &TREE_TYPE (decl);
4109 is_type = TREE_CODE (*node) == TYPE_DECL;
4111 else if (TYPE_P (*node))
4112 type = node, is_type = 1;
4115 && TREE_CODE (*type) == UNION_TYPE
4117 || (TYPE_FIELDS (*type) != 0
4118 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4120 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4121 *type = build_variant_type_copy (*type);
4122 TYPE_TRANSPARENT_UNION (*type) = 1;
4124 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4125 && TREE_CODE (*type) == UNION_TYPE
4126 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4127 DECL_TRANSPARENT_UNION (decl) = 1;
4130 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4131 *no_add_attrs = true;
4137 /* Handle a "constructor" attribute; arguments as in
4138 struct attribute_spec.handler. */
4141 handle_constructor_attribute (tree *node, tree name,
4142 tree ARG_UNUSED (args),
4143 int ARG_UNUSED (flags),
4147 tree type = TREE_TYPE (decl);
4149 if (TREE_CODE (decl) == FUNCTION_DECL
4150 && TREE_CODE (type) == FUNCTION_TYPE
4151 && decl_function_context (decl) == 0)
4153 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4154 TREE_USED (decl) = 1;
4158 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4159 *no_add_attrs = true;
4165 /* Handle a "destructor" attribute; arguments as in
4166 struct attribute_spec.handler. */
4169 handle_destructor_attribute (tree *node, tree name,
4170 tree ARG_UNUSED (args),
4171 int ARG_UNUSED (flags),
4175 tree type = TREE_TYPE (decl);
4177 if (TREE_CODE (decl) == FUNCTION_DECL
4178 && TREE_CODE (type) == FUNCTION_TYPE
4179 && decl_function_context (decl) == 0)
4181 DECL_STATIC_DESTRUCTOR (decl) = 1;
4182 TREE_USED (decl) = 1;
4186 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4187 *no_add_attrs = true;
4193 /* Handle a "mode" attribute; arguments as in
4194 struct attribute_spec.handler. */
4197 handle_mode_attribute (tree *node, tree name, tree args,
4198 int ARG_UNUSED (flags), bool *no_add_attrs)
4202 *no_add_attrs = true;
4204 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4205 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4209 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4210 int len = strlen (p);
4211 enum machine_mode mode = VOIDmode;
4215 if (len > 4 && p[0] == '_' && p[1] == '_'
4216 && p[len - 1] == '_' && p[len - 2] == '_')
4218 char *newp = (char *) alloca (len - 1);
4220 strcpy (newp, &p[2]);
4221 newp[len - 4] = '\0';
4225 /* Change this type to have a type with the specified mode.
4226 First check for the special modes. */
4227 if (!strcmp (p, "byte"))
4229 else if (!strcmp (p, "word"))
4231 else if (!strcmp (p, "pointer"))
4234 for (j = 0; j < NUM_MACHINE_MODES; j++)
4235 if (!strcmp (p, GET_MODE_NAME (j)))
4237 mode = (enum machine_mode) j;
4241 if (mode == VOIDmode)
4243 error ("unknown machine mode %qs", p);
4248 switch (GET_MODE_CLASS (mode))
4251 case MODE_PARTIAL_INT:
4253 valid_mode = targetm.scalar_mode_supported_p (mode);
4256 case MODE_COMPLEX_INT:
4257 case MODE_COMPLEX_FLOAT:
4258 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
4261 case MODE_VECTOR_INT:
4262 case MODE_VECTOR_FLOAT:
4263 warning ("specifying vector types with __attribute__ ((mode)) "
4265 warning ("use __attribute__ ((vector_size)) instead");
4266 valid_mode = vector_mode_valid_p (mode);
4274 error ("unable to emulate %qs", p);
4278 if (POINTER_TYPE_P (type))
4280 tree (*fn)(tree, enum machine_mode, bool);
4282 if (!targetm.valid_pointer_mode (mode))
4284 error ("invalid pointer mode %qs", p);
4288 if (TREE_CODE (type) == POINTER_TYPE)
4289 fn = build_pointer_type_for_mode;
4291 fn = build_reference_type_for_mode;
4292 typefm = fn (TREE_TYPE (type), mode, false);
4295 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4297 if (typefm == NULL_TREE)
4299 error ("no data type for mode %qs", p);
4302 else if (TREE_CODE (type) == ENUMERAL_TYPE)
4304 /* For enumeral types, copy the precision from the integer
4305 type returned above. If not an INTEGER_TYPE, we can't use
4306 this mode for this type. */
4307 if (TREE_CODE (typefm) != INTEGER_TYPE)
4309 error ("cannot use mode %qs for enumeral types", p);
4313 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4314 type = build_variant_type_copy (type);
4315 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
4318 else if (VECTOR_MODE_P (mode)
4319 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
4320 : TREE_CODE (type) != TREE_CODE (typefm))
4322 error ("mode %qs applied to inappropriate type", p);
4328 /* No need to layout the type here. The caller should do this. */
4334 /* Handle a "section" attribute; arguments as in
4335 struct attribute_spec.handler. */
4338 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4339 int ARG_UNUSED (flags), bool *no_add_attrs)
4343 if (targetm.have_named_sections)
4345 user_defined_section_attribute = true;
4347 if ((TREE_CODE (decl) == FUNCTION_DECL
4348 || TREE_CODE (decl) == VAR_DECL)
4349 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4351 if (TREE_CODE (decl) == VAR_DECL
4352 && current_function_decl != NULL_TREE
4353 && !TREE_STATIC (decl))
4355 error ("%Jsection attribute cannot be specified for "
4356 "local variables", decl);
4357 *no_add_attrs = true;
4360 /* The decl may have already been given a section attribute
4361 from a previous declaration. Ensure they match. */
4362 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4363 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4364 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4366 error ("%Jsection of %qD conflicts with previous declaration",
4368 *no_add_attrs = true;
4371 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4375 error ("%Jsection attribute not allowed for %qD", *node, *node);
4376 *no_add_attrs = true;
4381 error ("%Jsection attributes are not supported for this target", *node);
4382 *no_add_attrs = true;
4388 /* Handle a "aligned" attribute; arguments as in
4389 struct attribute_spec.handler. */
4392 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4393 int flags, bool *no_add_attrs)
4395 tree decl = NULL_TREE;
4398 tree align_expr = (args ? TREE_VALUE (args)
4399 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4405 type = &TREE_TYPE (decl);
4406 is_type = TREE_CODE (*node) == TYPE_DECL;
4408 else if (TYPE_P (*node))
4409 type = node, is_type = 1;
4411 /* Strip any NOPs of any kind. */
4412 while (TREE_CODE (align_expr) == NOP_EXPR
4413 || TREE_CODE (align_expr) == CONVERT_EXPR
4414 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4415 align_expr = TREE_OPERAND (align_expr, 0);
4417 if (TREE_CODE (align_expr) != INTEGER_CST)
4419 error ("requested alignment is not a constant");
4420 *no_add_attrs = true;
4422 else if ((i = tree_log2 (align_expr)) == -1)
4424 error ("requested alignment is not a power of 2");
4425 *no_add_attrs = true;
4427 else if (i > HOST_BITS_PER_INT - 2)
4429 error ("requested alignment is too large");
4430 *no_add_attrs = true;
4434 /* If we have a TYPE_DECL, then copy the type, so that we
4435 don't accidentally modify a builtin type. See pushdecl. */
4436 if (decl && TREE_TYPE (decl) != error_mark_node
4437 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4439 tree tt = TREE_TYPE (decl);
4440 *type = build_variant_type_copy (*type);
4441 DECL_ORIGINAL_TYPE (decl) = tt;
4442 TYPE_NAME (*type) = decl;
4443 TREE_USED (*type) = TREE_USED (decl);
4444 TREE_TYPE (decl) = *type;
4446 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4447 *type = build_variant_type_copy (*type);
4449 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4450 TYPE_USER_ALIGN (*type) = 1;
4452 else if (TREE_CODE (decl) != VAR_DECL
4453 && TREE_CODE (decl) != FIELD_DECL)
4455 error ("%Jalignment may not be specified for %qD", decl, decl);
4456 *no_add_attrs = true;
4460 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4461 DECL_USER_ALIGN (decl) = 1;
4467 /* Handle a "weak" attribute; arguments as in
4468 struct attribute_spec.handler. */
4471 handle_weak_attribute (tree *node, tree ARG_UNUSED (name),
4472 tree ARG_UNUSED (args),
4473 int ARG_UNUSED (flags),
4474 bool * ARG_UNUSED (no_add_attrs))
4476 declare_weak (*node);
4481 /* Handle an "alias" attribute; arguments as in
4482 struct attribute_spec.handler. */
4485 handle_alias_attribute (tree *node, tree name, tree args,
4486 int ARG_UNUSED (flags), bool *no_add_attrs)
4490 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4491 || (TREE_CODE (decl) != FUNCTION_DECL && !DECL_EXTERNAL (decl)))
4493 error ("%J%qD defined both normally and as an alias", decl, decl);
4494 *no_add_attrs = true;
4497 /* Note that the very first time we process a nested declaration,
4498 decl_function_context will not be set. Indeed, *would* never
4499 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4500 we do below. After such frobbery, pushdecl would set the context.
4501 In any case, this is never what we want. */
4502 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4506 id = TREE_VALUE (args);
4507 if (TREE_CODE (id) != STRING_CST)
4509 error ("alias argument not a string");
4510 *no_add_attrs = true;
4513 id = get_identifier (TREE_STRING_POINTER (id));
4514 /* This counts as a use of the object pointed to. */
4517 if (TREE_CODE (decl) == FUNCTION_DECL)
4518 DECL_INITIAL (decl) = error_mark_node;
4521 DECL_EXTERNAL (decl) = 0;
4522 TREE_STATIC (decl) = 1;
4527 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4528 *no_add_attrs = true;
4534 /* Handle an "visibility" attribute; arguments as in
4535 struct attribute_spec.handler. */
4538 handle_visibility_attribute (tree *node, tree name, tree args,
4539 int ARG_UNUSED (flags),
4543 tree id = TREE_VALUE (args);
4545 *no_add_attrs = true;
4549 if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
4551 warning ("%qs attribute ignored on non-class types",
4552 IDENTIFIER_POINTER (name));
4556 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
4558 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4562 if (TREE_CODE (id) != STRING_CST)
4564 error ("visibility argument not a string");
4568 /* If this is a type, set the visibility on the type decl. */
4571 decl = TYPE_NAME (decl);
4576 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4577 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4578 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4579 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4580 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4581 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4582 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4583 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4585 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4586 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4588 /* For decls only, go ahead and attach the attribute to the node as well.
4589 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4590 because the visibility was not specified, or because it was explicitly
4591 overridden from the class visibility. */
4593 *no_add_attrs = false;
4598 /* Determine the ELF symbol visibility for DECL, which is either a
4599 variable or a function. It is an error to use this function if a
4600 definition of DECL is not available in this translation unit.
4601 Returns true if the final visibility has been determined by this
4602 function; false if the caller is free to make additional
4606 c_determine_visibility (tree decl)
4608 gcc_assert (TREE_CODE (decl) == VAR_DECL
4609 || TREE_CODE (decl) == FUNCTION_DECL);
4611 /* If the user explicitly specified the visibility with an
4612 attribute, honor that. DECL_VISIBILITY will have been set during
4613 the processing of the attribute. We check for an explicit
4614 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4615 to distinguish the use of an attribute from the use of a "#pragma
4616 GCC visibility push(...)"; in the latter case we still want other
4617 considerations to be able to overrule the #pragma. */
4618 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
4621 /* Anything that is exported must have default visibility. */
4622 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4623 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
4625 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4626 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4633 /* Handle an "tls_model" attribute; arguments as in
4634 struct attribute_spec.handler. */
4637 handle_tls_model_attribute (tree *node, tree name, tree args,
4638 int ARG_UNUSED (flags), bool *no_add_attrs)
4642 if (!DECL_THREAD_LOCAL (decl))
4644 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4645 *no_add_attrs = true;
4651 id = TREE_VALUE (args);
4652 if (TREE_CODE (id) != STRING_CST)
4654 error ("tls_model argument not a string");
4655 *no_add_attrs = true;
4658 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4659 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4660 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4661 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4663 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4664 *no_add_attrs = true;
4672 /* Handle a "no_instrument_function" attribute; arguments as in
4673 struct attribute_spec.handler. */
4676 handle_no_instrument_function_attribute (tree *node, tree name,
4677 tree ARG_UNUSED (args),
4678 int ARG_UNUSED (flags),
4683 if (TREE_CODE (decl) != FUNCTION_DECL)
4685 error ("%J%qE attribute applies only to functions", decl, name);
4686 *no_add_attrs = true;
4688 else if (DECL_INITIAL (decl))
4690 error ("%Jcan%'t set %qE attribute after definition", decl, name);
4691 *no_add_attrs = true;
4694 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4699 /* Handle a "malloc" attribute; arguments as in
4700 struct attribute_spec.handler. */
4703 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4704 int ARG_UNUSED (flags), bool *no_add_attrs)
4706 if (TREE_CODE (*node) == FUNCTION_DECL)
4707 DECL_IS_MALLOC (*node) = 1;
4708 /* ??? TODO: Support types. */
4711 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4712 *no_add_attrs = true;
4718 /* Handle a "no_limit_stack" attribute; arguments as in
4719 struct attribute_spec.handler. */
4722 handle_no_limit_stack_attribute (tree *node, tree name,
4723 tree ARG_UNUSED (args),
4724 int ARG_UNUSED (flags),
4729 if (TREE_CODE (decl) != FUNCTION_DECL)
4731 error ("%J%qE attribute applies only to functions", decl, name);
4732 *no_add_attrs = true;
4734 else if (DECL_INITIAL (decl))
4736 error ("%Jcan%'t set %qE attribute after definition", decl, name);
4737 *no_add_attrs = true;
4740 DECL_NO_LIMIT_STACK (decl) = 1;
4745 /* Handle a "pure" attribute; arguments as in
4746 struct attribute_spec.handler. */
4749 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4750 int ARG_UNUSED (flags), bool *no_add_attrs)
4752 if (TREE_CODE (*node) == FUNCTION_DECL)
4753 DECL_IS_PURE (*node) = 1;
4754 /* ??? TODO: Support types. */
4757 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4758 *no_add_attrs = true;
4764 /* Handle a "deprecated" attribute; arguments as in
4765 struct attribute_spec.handler. */
4768 handle_deprecated_attribute (tree *node, tree name,
4769 tree ARG_UNUSED (args), int flags,
4772 tree type = NULL_TREE;
4774 const char *what = NULL;
4779 type = TREE_TYPE (decl);
4781 if (TREE_CODE (decl) == TYPE_DECL
4782 || TREE_CODE (decl) == PARM_DECL
4783 || TREE_CODE (decl) == VAR_DECL
4784 || TREE_CODE (decl) == FUNCTION_DECL
4785 || TREE_CODE (decl) == FIELD_DECL)
4786 TREE_DEPRECATED (decl) = 1;
4790 else if (TYPE_P (*node))
4792 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4793 *node = build_variant_type_copy (*node);
4794 TREE_DEPRECATED (*node) = 1;
4802 *no_add_attrs = true;
4803 if (type && TYPE_NAME (type))
4805 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
4806 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
4807 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
4808 && DECL_NAME (TYPE_NAME (type)))
4809 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
4812 warning ("%qs attribute ignored for %qs",
4813 IDENTIFIER_POINTER (name), what);
4815 warning ("%qs attribute ignored",
4816 IDENTIFIER_POINTER (name));
4822 /* Handle a "vector_size" attribute; arguments as in
4823 struct attribute_spec.handler. */
4826 handle_vector_size_attribute (tree *node, tree name, tree args,
4827 int ARG_UNUSED (flags),
4830 unsigned HOST_WIDE_INT vecsize, nunits;
4831 enum machine_mode orig_mode;
4832 tree type = *node, new_type, size;
4834 *no_add_attrs = true;
4836 /* Stripping NON_LVALUE_EXPR allows declarations such as
4837 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
4838 size = TREE_VALUE (args);
4839 if (TREE_CODE (size) == NON_LVALUE_EXPR)
4840 size = TREE_OPERAND (size, 0);
4842 if (!host_integerp (size, 1))
4844 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4848 /* Get the vector size (in bytes). */
4849 vecsize = tree_low_cst (size, 1);
4851 /* We need to provide for vector pointers, vector arrays, and
4852 functions returning vectors. For example:
4854 __attribute__((vector_size(16))) short *foo;
4856 In this case, the mode is SI, but the type being modified is
4857 HI, so we need to look further. */
4859 while (POINTER_TYPE_P (type)
4860 || TREE_CODE (type) == FUNCTION_TYPE
4861 || TREE_CODE (type) == METHOD_TYPE
4862 || TREE_CODE (type) == ARRAY_TYPE)
4863 type = TREE_TYPE (type);
4865 /* Get the mode of the type being modified. */
4866 orig_mode = TYPE_MODE (type);
4868 if (TREE_CODE (type) == RECORD_TYPE
4869 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
4870 && GET_MODE_CLASS (orig_mode) != MODE_INT)
4871 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
4873 error ("invalid vector type for attribute %qs",
4874 IDENTIFIER_POINTER (name));
4878 /* Calculate how many units fit in the vector. */
4879 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
4880 if (nunits & (nunits - 1))
4882 error ("number of components of the vector not a power of two");
4886 new_type = build_vector_type (type, nunits);
4888 /* Build back pointers if needed. */
4889 *node = reconstruct_complex_type (*node, new_type);
4894 /* Handle the "nonnull" attribute. */
4896 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
4897 tree args, int ARG_UNUSED (flags),
4901 unsigned HOST_WIDE_INT attr_arg_num;
4903 /* If no arguments are specified, all pointer arguments should be
4904 non-null. Verify a full prototype is given so that the arguments
4905 will have the correct types when we actually check them later. */
4908 if (!TYPE_ARG_TYPES (type))
4910 error ("nonnull attribute without arguments on a non-prototype");
4911 *no_add_attrs = true;
4916 /* Argument list specified. Verify that each argument number references
4917 a pointer argument. */
4918 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
4921 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
4923 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
4925 error ("nonnull argument has invalid operand number (argument %lu)",
4926 (unsigned long) attr_arg_num);
4927 *no_add_attrs = true;
4931 argument = TYPE_ARG_TYPES (type);
4934 for (ck_num = 1; ; ck_num++)
4936 if (!argument || ck_num == arg_num)
4938 argument = TREE_CHAIN (argument);
4942 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
4944 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
4945 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4946 *no_add_attrs = true;
4950 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
4952 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
4953 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4954 *no_add_attrs = true;
4963 /* Check the argument list of a function call for null in argument slots
4964 that are marked as requiring a non-null pointer argument. */
4967 check_function_nonnull (tree attrs, tree params)
4969 tree a, args, param;
4972 for (a = attrs; a; a = TREE_CHAIN (a))
4974 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
4976 args = TREE_VALUE (a);
4978 /* Walk the argument list. If we encounter an argument number we
4979 should check for non-null, do it. If the attribute has no args,
4980 then every pointer argument is checked (in which case the check
4981 for pointer type is done in check_nonnull_arg). */
4982 for (param = params, param_num = 1; ;
4983 param_num++, param = TREE_CHAIN (param))
4987 if (!args || nonnull_check_p (args, param_num))
4988 check_function_arguments_recurse (check_nonnull_arg, NULL,
4996 /* Check that the Nth argument of a function call (counting backwards
4997 from the end) is a (pointer)0. */
5000 check_function_sentinel (tree attrs, tree params)
5002 tree attr = lookup_attribute ("sentinel", attrs);
5007 warning ("missing sentinel in function call");
5013 if (TREE_VALUE (attr))
5015 tree p = TREE_VALUE (TREE_VALUE (attr));
5017 pos = TREE_INT_CST_LOW (p);
5020 sentinel = end = params;
5022 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5023 while (pos > 0 && TREE_CHAIN (end))
5026 end = TREE_CHAIN (end);
5030 warning ("not enough arguments to fit a sentinel");
5034 /* Now advance both until we find the last parameter. */
5035 while (TREE_CHAIN (end))
5037 end = TREE_CHAIN (end);
5038 sentinel = TREE_CHAIN (sentinel);
5041 /* Validate the sentinel. */
5042 if (!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel)))
5043 || !integer_zerop (TREE_VALUE (sentinel)))
5044 warning ("missing sentinel in function call");
5049 /* Helper for check_function_nonnull; given a list of operands which
5050 must be non-null in ARGS, determine if operand PARAM_NUM should be
5054 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5056 unsigned HOST_WIDE_INT arg_num = 0;
5058 for (; args; args = TREE_CHAIN (args))
5060 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
5064 if (arg_num == param_num)
5070 /* Check that the function argument PARAM (which is operand number
5071 PARAM_NUM) is non-null. This is called by check_function_nonnull
5072 via check_function_arguments_recurse. */
5075 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5076 unsigned HOST_WIDE_INT param_num)
5078 /* Just skip checking the argument if it's not a pointer. This can
5079 happen if the "nonnull" attribute was given without an operand
5080 list (which means to check every pointer argument). */
5082 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5085 if (integer_zerop (param))
5086 warning ("null argument where non-null required (argument %lu)",
5087 (unsigned long) param_num);
5090 /* Helper for nonnull attribute handling; fetch the operand number
5091 from the attribute argument list. */
5094 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5096 /* Strip any conversions from the arg number and verify they
5098 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5099 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5100 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5101 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5103 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5104 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5107 *valp = TREE_INT_CST_LOW (arg_num_expr);
5111 /* Handle a "nothrow" attribute; arguments as in
5112 struct attribute_spec.handler. */
5115 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5116 int ARG_UNUSED (flags), bool *no_add_attrs)
5118 if (TREE_CODE (*node) == FUNCTION_DECL)
5119 TREE_NOTHROW (*node) = 1;
5120 /* ??? TODO: Support types. */
5123 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
5124 *no_add_attrs = true;
5130 /* Handle a "cleanup" attribute; arguments as in
5131 struct attribute_spec.handler. */
5134 handle_cleanup_attribute (tree *node, tree name, tree args,
5135 int ARG_UNUSED (flags), bool *no_add_attrs)
5138 tree cleanup_id, cleanup_decl;
5140 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5141 for global destructors in C++. This requires infrastructure that
5142 we don't have generically at the moment. It's also not a feature
5143 we'd be missing too much, since we do have attribute constructor. */
5144 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5146 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
5147 *no_add_attrs = true;
5151 /* Verify that the argument is a function in scope. */
5152 /* ??? We could support pointers to functions here as well, if
5153 that was considered desirable. */
5154 cleanup_id = TREE_VALUE (args);
5155 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5157 error ("cleanup argument not an identifier");
5158 *no_add_attrs = true;
5161 cleanup_decl = lookup_name (cleanup_id);
5162 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5164 error ("cleanup argument not a function");
5165 *no_add_attrs = true;
5169 /* That the function has proper type is checked with the
5170 eventual call to build_function_call. */
5175 /* Handle a "warn_unused_result" attribute. No special handling. */
5178 handle_warn_unused_result_attribute (tree *node, tree name,
5179 tree ARG_UNUSED (args),
5180 int ARG_UNUSED (flags), bool *no_add_attrs)
5182 /* Ignore the attribute for functions not returning any value. */
5183 if (VOID_TYPE_P (TREE_TYPE (*node)))
5185 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
5186 *no_add_attrs = true;
5192 /* Handle a "sentinel" attribute. */
5195 handle_sentinel_attribute (tree *node, tree name, tree args,
5196 int ARG_UNUSED (flags), bool *no_add_attrs)
5198 tree params = TYPE_ARG_TYPES (*node);
5202 warning ("%qs attribute requires prototypes with named arguments",
5203 IDENTIFIER_POINTER (name));
5204 *no_add_attrs = true;
5208 while (TREE_CHAIN (params))
5209 params = TREE_CHAIN (params);
5211 if (VOID_TYPE_P (TREE_VALUE (params)))
5213 warning ("%qs attribute only applies to variadic functions",
5214 IDENTIFIER_POINTER (name));
5215 *no_add_attrs = true;
5221 tree position = TREE_VALUE (args);
5223 STRIP_NOPS (position);
5224 if (TREE_CODE (position) != INTEGER_CST)
5226 warning ("requested position is not an integer constant");
5227 *no_add_attrs = true;
5231 if (tree_int_cst_lt (position, integer_zero_node))
5233 warning ("requested position is less than zero");
5234 *no_add_attrs = true;
5242 /* Check for valid arguments being passed to a function. */
5244 check_function_arguments (tree attrs, tree params)
5246 /* Check for null being passed in a pointer argument that must be
5247 non-null. We also need to do this if format checking is enabled. */
5250 check_function_nonnull (attrs, params);
5252 /* Check for errors in format strings. */
5256 check_function_format (attrs, params);
5257 check_function_sentinel (attrs, params);
5261 /* Generic argument checking recursion routine. PARAM is the argument to
5262 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5263 once the argument is resolved. CTX is context for the callback. */
5265 check_function_arguments_recurse (void (*callback)
5266 (void *, tree, unsigned HOST_WIDE_INT),
5267 void *ctx, tree param,
5268 unsigned HOST_WIDE_INT param_num)
5270 if (TREE_CODE (param) == NOP_EXPR)
5272 /* Strip coercion. */
5273 check_function_arguments_recurse (callback, ctx,
5274 TREE_OPERAND (param, 0), param_num);
5278 if (TREE_CODE (param) == CALL_EXPR)
5280 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5282 bool found_format_arg = false;
5284 /* See if this is a call to a known internationalization function
5285 that modifies a format arg. Such a function may have multiple
5286 format_arg attributes (for example, ngettext). */
5288 for (attrs = TYPE_ATTRIBUTES (type);
5290 attrs = TREE_CHAIN (attrs))
5291 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5294 tree format_num_expr;
5298 /* Extract the argument number, which was previously checked
5300 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5301 while (TREE_CODE (format_num_expr) == NOP_EXPR
5302 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5303 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5304 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5306 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
5307 && !TREE_INT_CST_HIGH (format_num_expr));
5309 format_num = TREE_INT_CST_LOW (format_num_expr);
5311 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5313 inner_args = TREE_CHAIN (inner_args), i++)
5314 if (i == format_num)
5316 check_function_arguments_recurse (callback, ctx,
5317 TREE_VALUE (inner_args),
5319 found_format_arg = true;
5324 /* If we found a format_arg attribute and did a recursive check,
5325 we are done with checking this argument. Otherwise, we continue
5326 and this will be considered a non-literal. */
5327 if (found_format_arg)
5331 if (TREE_CODE (param) == COND_EXPR)
5333 /* Check both halves of the conditional expression. */
5334 check_function_arguments_recurse (callback, ctx,
5335 TREE_OPERAND (param, 1), param_num);
5336 check_function_arguments_recurse (callback, ctx,
5337 TREE_OPERAND (param, 2), param_num);
5341 (*callback) (ctx, param, param_num);
5344 /* Function to help qsort sort FIELD_DECLs by name order. */
5347 field_decl_cmp (const void *x_p, const void *y_p)
5349 const tree *const x = (const tree *const) x_p;
5350 const tree *const y = (const tree *const) y_p;
5352 if (DECL_NAME (*x) == DECL_NAME (*y))
5353 /* A nontype is "greater" than a type. */
5354 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5355 if (DECL_NAME (*x) == NULL_TREE)
5357 if (DECL_NAME (*y) == NULL_TREE)
5359 if (DECL_NAME (*x) < DECL_NAME (*y))
5365 gt_pointer_operator new_value;
5369 /* This routine compares two fields like field_decl_cmp but using the
5370 pointer operator in resort_data. */
5373 resort_field_decl_cmp (const void *x_p, const void *y_p)
5375 const tree *const x = (const tree *const) x_p;
5376 const tree *const y = (const tree *const) y_p;
5378 if (DECL_NAME (*x) == DECL_NAME (*y))
5379 /* A nontype is "greater" than a type. */
5380 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5381 if (DECL_NAME (*x) == NULL_TREE)
5383 if (DECL_NAME (*y) == NULL_TREE)
5386 tree d1 = DECL_NAME (*x);
5387 tree d2 = DECL_NAME (*y);
5388 resort_data.new_value (&d1, resort_data.cookie);
5389 resort_data.new_value (&d2, resort_data.cookie);
5396 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5399 resort_sorted_fields (void *obj,
5400 void * ARG_UNUSED (orig_obj),
5401 gt_pointer_operator new_value,
5404 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
5405 resort_data.new_value = new_value;
5406 resort_data.cookie = cookie;
5407 qsort (&sf->elts[0], sf->len, sizeof (tree),
5408 resort_field_decl_cmp);
5411 /* Subroutine of c_parse_error.
5412 Return the result of concatenating LHS and RHS. RHS is really
5413 a string literal, its first character is indicated by RHS_START and
5414 RHS_SIZE is its length (including the terminating NUL character).
5416 The caller is responsible for deleting the returned pointer. */
5419 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
5421 const int lhs_size = strlen (lhs);
5422 char *result = XNEWVEC (char, lhs_size + rhs_size);
5423 strncpy (result, lhs, lhs_size);
5424 strncpy (result + lhs_size, rhs_start, rhs_size);
5428 /* Issue the error given by MSGID, indicating that it occurred before
5429 TOKEN, which had the associated VALUE. */
5432 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5434 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5436 char *message = NULL;
5438 if (token == CPP_EOF)
5439 message = catenate_messages (msgid, " at end of input");
5440 else if (token == CPP_CHAR || token == CPP_WCHAR)
5442 unsigned int val = TREE_INT_CST_LOW (value);
5443 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5444 if (val <= UCHAR_MAX && ISGRAPH (val))
5445 message = catenate_messages (msgid, " before %s'%c'");
5447 message = catenate_messages (msgid, " before %s'\\x%x'");
5449 error (message, ell, val);
5453 else if (token == CPP_STRING || token == CPP_WSTRING)
5454 message = catenate_messages (msgid, " before string constant");
5455 else if (token == CPP_NUMBER)
5456 message = catenate_messages (msgid, " before numeric constant");
5457 else if (token == CPP_NAME)
5459 message = catenate_messages (msgid, " before %qs");
5460 error (message, IDENTIFIER_POINTER (value));
5464 else if (token < N_TTYPES)
5466 message = catenate_messages (msgid, " before %qs token");
5467 error (message, cpp_type2name (token));
5479 #undef catenate_messages
5482 /* Walk a gimplified function and warn for functions whose return value is
5483 ignored and attribute((warn_unused_result)) is set. This is done before
5484 inlining, so we don't have to worry about that. */
5487 c_warn_unused_result (tree *top_p)
5490 tree_stmt_iterator i;
5493 switch (TREE_CODE (t))
5495 case STATEMENT_LIST:
5496 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5497 c_warn_unused_result (tsi_stmt_ptr (i));
5501 c_warn_unused_result (&COND_EXPR_THEN (t));
5502 c_warn_unused_result (&COND_EXPR_ELSE (t));
5505 c_warn_unused_result (&BIND_EXPR_BODY (t));
5507 case TRY_FINALLY_EXPR:
5508 case TRY_CATCH_EXPR:
5509 c_warn_unused_result (&TREE_OPERAND (t, 0));
5510 c_warn_unused_result (&TREE_OPERAND (t, 1));
5513 c_warn_unused_result (&CATCH_BODY (t));
5515 case EH_FILTER_EXPR:
5516 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5523 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5524 a MODIFY_EXPR. All calls whose value is ignored should be
5525 represented like this. Look for the attribute. */
5526 fdecl = get_callee_fndecl (t);
5528 ftype = TREE_TYPE (fdecl);
5531 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5532 /* Look past pointer-to-function to the function type itself. */
5533 ftype = TREE_TYPE (ftype);
5536 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5539 warning ("%Hignoring return value of %qD, "
5540 "declared with attribute warn_unused_result",
5541 EXPR_LOCUS (t), fdecl);
5543 warning ("%Hignoring return value of function "
5544 "declared with attribute warn_unused_result",
5550 /* Not a container, not a call, or a call whose value is used. */
5555 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
5556 component references, with an INDIRECT_REF at the bottom; much like
5557 the traditional rendering of offsetof as a macro. Returns the folded
5558 and properly cast result. */
5561 fold_offsetof_1 (tree expr)
5563 enum tree_code code = PLUS_EXPR;
5566 switch (TREE_CODE (expr))
5572 return size_zero_node;
5575 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5576 if (base == error_mark_node)
5579 t = TREE_OPERAND (expr, 1);
5580 if (DECL_C_BIT_FIELD (t))
5582 error ("attempt to take address of bit-field structure "
5583 "member %qs", IDENTIFIER_POINTER (DECL_NAME (t)));
5584 return error_mark_node;
5586 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
5587 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
5592 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5593 if (base == error_mark_node)
5596 t = TREE_OPERAND (expr, 1);
5597 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
5600 t = fold (build1 (NEGATE_EXPR, TREE_TYPE (t), t));
5602 t = convert (sizetype, t);
5603 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
5610 return size_binop (code, base, off);
5614 fold_offsetof (tree expr)
5616 /* Convert back from the internal sizetype to size_t. */
5617 return convert (size_type_node, fold_offsetof_1 (expr));
5620 /* Return nonzero if REF is an lvalue valid for this language;
5621 otherwise, print an error message and return zero. USE says
5622 how the lvalue is being used and so selects the error message. */
5625 lvalue_or_else (tree ref, enum lvalue_use use)
5627 int win = lvalue_p (ref);
5634 error ("invalid lvalue in assignment");
5637 error ("invalid lvalue in increment");
5640 error ("invalid lvalue in decrement");
5643 error ("invalid lvalue in unary %<&%>");
5646 error ("invalid lvalue in asm statement");
5656 #include "gt-c-common.h"