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 warn about implicit declarations. */
464 int warn_implicit = 1;
466 /* Maximum template instantiation depth. This limit is rather
467 arbitrary, but it exists to limit the time it takes to notice
468 infinite template instantiations. */
470 int max_tinst_depth = 500;
474 /* The elements of `ridpointers' are identifier nodes for the reserved
475 type names and storage classes. It is indexed by a RID_... value. */
478 tree (*make_fname_decl) (tree, int);
480 /* If non-NULL, the address of a language-specific function that
481 returns 1 for language-specific statement codes. */
482 int (*lang_statement_code_p) (enum tree_code);
484 /* If non-NULL, the address of a language-specific function that takes
485 any action required right before expand_function_end is called. */
486 void (*lang_expand_function_end) (void);
488 /* Nonzero means the expression being parsed will never be evaluated.
489 This is a count, since unevaluated expressions can nest. */
492 /* Information about how a function name is generated. */
495 tree *const decl; /* pointer to the VAR_DECL. */
496 const unsigned rid; /* RID number for the identifier. */
497 const int pretty; /* How pretty is it? */
500 /* The three ways of getting then name of the current function. */
502 const struct fname_var_t fname_vars[] =
504 /* C99 compliant __func__, must be first. */
505 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
506 /* GCC __FUNCTION__ compliant. */
507 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
508 /* GCC __PRETTY_FUNCTION__ compliant. */
509 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
513 static int constant_fits_type_p (tree, tree);
514 static tree check_case_value (tree);
515 static bool check_case_bounds (tree, tree, tree *, tree *);
517 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
518 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
519 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
520 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
521 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
522 static tree handle_always_inline_attribute (tree *, tree, tree, int,
524 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
525 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
526 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_transparent_union_attribute (tree *, tree, tree,
529 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
532 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
534 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
535 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
536 static tree handle_visibility_attribute (tree *, tree, tree, int,
538 static tree handle_tls_model_attribute (tree *, tree, tree, int,
540 static tree handle_no_instrument_function_attribute (tree *, tree,
542 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
543 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
545 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
546 static tree handle_deprecated_attribute (tree *, tree, tree, int,
548 static tree handle_vector_size_attribute (tree *, tree, tree, int,
550 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
551 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
552 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
553 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
556 static void check_function_nonnull (tree, tree);
557 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
558 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
559 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
560 static int resort_field_decl_cmp (const void *, const void *);
562 /* Table of machine-independent attributes common to all C-like languages. */
563 const struct attribute_spec c_common_attribute_table[] =
565 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
566 { "packed", 0, 0, false, false, false,
567 handle_packed_attribute },
568 { "nocommon", 0, 0, true, false, false,
569 handle_nocommon_attribute },
570 { "common", 0, 0, true, false, false,
571 handle_common_attribute },
572 /* FIXME: logically, noreturn attributes should be listed as
573 "false, true, true" and apply to function types. But implementing this
574 would require all the places in the compiler that use TREE_THIS_VOLATILE
575 on a decl to identify non-returning functions to be located and fixed
576 to check the function type instead. */
577 { "noreturn", 0, 0, true, false, false,
578 handle_noreturn_attribute },
579 { "volatile", 0, 0, true, false, false,
580 handle_noreturn_attribute },
581 { "noinline", 0, 0, true, false, false,
582 handle_noinline_attribute },
583 { "always_inline", 0, 0, true, false, false,
584 handle_always_inline_attribute },
585 { "used", 0, 0, true, false, false,
586 handle_used_attribute },
587 { "unused", 0, 0, false, false, false,
588 handle_unused_attribute },
589 /* The same comments as for noreturn attributes apply to const ones. */
590 { "const", 0, 0, true, false, false,
591 handle_const_attribute },
592 { "transparent_union", 0, 0, false, false, false,
593 handle_transparent_union_attribute },
594 { "constructor", 0, 0, true, false, false,
595 handle_constructor_attribute },
596 { "destructor", 0, 0, true, false, false,
597 handle_destructor_attribute },
598 { "mode", 1, 1, false, true, false,
599 handle_mode_attribute },
600 { "section", 1, 1, true, false, false,
601 handle_section_attribute },
602 { "aligned", 0, 1, false, false, false,
603 handle_aligned_attribute },
604 { "weak", 0, 0, true, false, false,
605 handle_weak_attribute },
606 { "alias", 1, 1, true, false, false,
607 handle_alias_attribute },
608 { "no_instrument_function", 0, 0, true, false, false,
609 handle_no_instrument_function_attribute },
610 { "malloc", 0, 0, true, false, false,
611 handle_malloc_attribute },
612 { "no_stack_limit", 0, 0, true, false, false,
613 handle_no_limit_stack_attribute },
614 { "pure", 0, 0, true, false, false,
615 handle_pure_attribute },
616 { "deprecated", 0, 0, false, false, false,
617 handle_deprecated_attribute },
618 { "vector_size", 1, 1, false, true, false,
619 handle_vector_size_attribute },
620 { "visibility", 1, 1, false, false, false,
621 handle_visibility_attribute },
622 { "tls_model", 1, 1, true, false, false,
623 handle_tls_model_attribute },
624 { "nonnull", 0, -1, false, true, true,
625 handle_nonnull_attribute },
626 { "nothrow", 0, 0, true, false, false,
627 handle_nothrow_attribute },
628 { "may_alias", 0, 0, false, true, false, NULL },
629 { "cleanup", 1, 1, true, false, false,
630 handle_cleanup_attribute },
631 { "warn_unused_result", 0, 0, false, true, true,
632 handle_warn_unused_result_attribute },
633 { NULL, 0, 0, false, false, false, NULL }
636 /* Give the specifications for the format attributes, used by C and all
639 const struct attribute_spec c_common_format_attribute_table[] =
641 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
642 { "format", 3, 3, false, true, true,
643 handle_format_attribute },
644 { "format_arg", 1, 1, false, true, true,
645 handle_format_arg_attribute },
646 { NULL, 0, 0, false, false, false, NULL }
649 /* Push current bindings for the function name VAR_DECLS. */
652 start_fname_decls (void)
655 tree saved = NULL_TREE;
657 for (ix = 0; fname_vars[ix].decl; ix++)
659 tree decl = *fname_vars[ix].decl;
663 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
664 *fname_vars[ix].decl = NULL_TREE;
667 if (saved || saved_function_name_decls)
668 /* Normally they'll have been NULL, so only push if we've got a
669 stack, or they are non-NULL. */
670 saved_function_name_decls = tree_cons (saved, NULL_TREE,
671 saved_function_name_decls);
674 /* Finish up the current bindings, adding them into the current function's
675 statement tree. This must be done _before_ finish_stmt_tree is called.
676 If there is no current function, we must be at file scope and no statements
677 are involved. Pop the previous bindings. */
680 finish_fname_decls (void)
683 tree stmts = NULL_TREE;
684 tree stack = saved_function_name_decls;
686 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
687 append_to_statement_list (TREE_VALUE (stack), &stmts);
691 tree *bodyp = &DECL_SAVED_TREE (current_function_decl);
693 if (TREE_CODE (*bodyp) == BIND_EXPR)
694 bodyp = &BIND_EXPR_BODY (*bodyp);
696 append_to_statement_list (*bodyp, &stmts);
700 for (ix = 0; fname_vars[ix].decl; ix++)
701 *fname_vars[ix].decl = NULL_TREE;
705 /* We had saved values, restore them. */
708 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
710 tree decl = TREE_PURPOSE (saved);
711 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
713 *fname_vars[ix].decl = decl;
715 stack = TREE_CHAIN (stack);
717 saved_function_name_decls = stack;
720 /* Return the text name of the current function, suitably prettified
721 by PRETTY_P. Return string must be freed by caller. */
724 fname_as_string (int pretty_p)
726 const char *name = "top level";
736 if (current_function_decl)
737 name = lang_hooks.decl_printable_name (current_function_decl, vrb);
739 if (c_lex_string_translate)
741 int len = strlen (name) + 3; /* Two for '"'s. One for NULL. */
742 cpp_string cstr = { 0, 0 }, strname;
744 namep = XNEWVEC (char, len);
745 snprintf (namep, len, "\"%s\"", name);
746 strname.text = (unsigned char *) namep;
747 strname.len = len - 1;
749 if (cpp_interpret_string (parse_in, &strname, 1, &cstr, false))
750 return (char *) cstr.text;
753 namep = xstrdup (name);
758 /* Expand DECL if it declares an entity not handled by the
762 c_expand_decl (tree decl)
764 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
766 /* Let the back-end know about this variable. */
767 if (!anon_aggr_type_p (TREE_TYPE (decl)))
768 emit_local_var (decl);
770 expand_anon_union_decl (decl, NULL_TREE,
771 DECL_ANON_UNION_ELEMS (decl));
780 /* Return the VAR_DECL for a const char array naming the current
781 function. If the VAR_DECL has not yet been created, create it
782 now. RID indicates how it should be formatted and IDENTIFIER_NODE
783 ID is its name (unfortunately C and C++ hold the RID values of
784 keywords in different places, so we can't derive RID from ID in
785 this language independent code. */
788 fname_decl (unsigned int rid, tree id)
791 tree decl = NULL_TREE;
793 for (ix = 0; fname_vars[ix].decl; ix++)
794 if (fname_vars[ix].rid == rid)
797 decl = *fname_vars[ix].decl;
800 /* If a tree is built here, it would normally have the lineno of
801 the current statement. Later this tree will be moved to the
802 beginning of the function and this line number will be wrong.
803 To avoid this problem set the lineno to 0 here; that prevents
804 it from appearing in the RTL. */
806 location_t saved_location = input_location;
807 #ifdef USE_MAPPED_LOCATION
808 input_location = UNKNOWN_LOCATION;
813 stmts = push_stmt_list ();
814 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
815 stmts = pop_stmt_list (stmts);
816 if (!IS_EMPTY_STMT (stmts))
817 saved_function_name_decls
818 = tree_cons (decl, stmts, saved_function_name_decls);
819 *fname_vars[ix].decl = decl;
820 input_location = saved_location;
822 if (!ix && !current_function_decl)
823 pedwarn ("%J'%D' is not defined outside of function scope", decl, decl);
828 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
831 fix_string_type (tree value)
833 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
834 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
835 const int nchars_max = flag_isoc99 ? 4095 : 509;
836 int length = TREE_STRING_LENGTH (value);
839 /* Compute the number of elements, for the array type. */
840 nchars = wide_flag ? length / wchar_bytes : length;
842 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
843 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
844 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
846 /* Create the array type for the string constant.
847 -Wwrite-strings says make the string constant an array of const char
848 so that copying it to a non-const pointer will get a warning.
849 For C++, this is the standard behavior. */
850 if (flag_const_strings)
853 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
856 = build_array_type (elements,
857 build_index_type (build_int_2 (nchars - 1, 0)));
861 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
862 build_index_type (build_int_2 (nchars - 1, 0)));
864 TREE_CONSTANT (value) = 1;
865 TREE_INVARIANT (value) = 1;
866 TREE_READONLY (value) = 1;
867 TREE_STATIC (value) = 1;
871 /* Print a warning if a constant expression had overflow in folding.
872 Invoke this function on every expression that the language
873 requires to be a constant expression.
874 Note the ANSI C standard says it is erroneous for a
875 constant expression to overflow. */
878 constant_expression_warning (tree value)
880 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
881 || TREE_CODE (value) == VECTOR_CST
882 || TREE_CODE (value) == COMPLEX_CST)
883 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
884 pedwarn ("overflow in constant expression");
887 /* Print a warning if an expression had overflow in folding.
888 Invoke this function on every expression that
889 (1) appears in the source code, and
890 (2) might be a constant expression that overflowed, and
891 (3) is not already checked by convert_and_check;
892 however, do not invoke this function on operands of explicit casts. */
895 overflow_warning (tree value)
897 if ((TREE_CODE (value) == INTEGER_CST
898 || (TREE_CODE (value) == COMPLEX_CST
899 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
900 && TREE_OVERFLOW (value))
902 TREE_OVERFLOW (value) = 0;
903 if (skip_evaluation == 0)
904 warning ("integer overflow in expression");
906 else if ((TREE_CODE (value) == REAL_CST
907 || (TREE_CODE (value) == COMPLEX_CST
908 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
909 && TREE_OVERFLOW (value))
911 TREE_OVERFLOW (value) = 0;
912 if (skip_evaluation == 0)
913 warning ("floating point overflow in expression");
915 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
917 TREE_OVERFLOW (value) = 0;
918 if (skip_evaluation == 0)
919 warning ("vector overflow in expression");
923 /* Print a warning if a large constant is truncated to unsigned,
924 or if -Wconversion is used and a constant < 0 is converted to unsigned.
925 Invoke this function on every expression that might be implicitly
926 converted to an unsigned type. */
929 unsigned_conversion_warning (tree result, tree operand)
931 tree type = TREE_TYPE (result);
933 if (TREE_CODE (operand) == INTEGER_CST
934 && TREE_CODE (type) == INTEGER_TYPE
935 && TYPE_UNSIGNED (type)
936 && skip_evaluation == 0
937 && !int_fits_type_p (operand, type))
939 if (!int_fits_type_p (operand, c_common_signed_type (type)))
940 /* This detects cases like converting -129 or 256 to unsigned char. */
941 warning ("large integer implicitly truncated to unsigned type");
942 else if (warn_conversion)
943 warning ("negative integer implicitly converted to unsigned type");
947 /* Nonzero if constant C has a value that is permissible
948 for type TYPE (an INTEGER_TYPE). */
951 constant_fits_type_p (tree c, tree type)
953 if (TREE_CODE (c) == INTEGER_CST)
954 return int_fits_type_p (c, type);
956 c = convert (type, c);
957 return !TREE_OVERFLOW (c);
960 /* Nonzero if vector types T1 and T2 can be converted to each other
961 without an explicit cast. */
963 vector_types_convertible_p (tree t1, tree t2)
965 return targetm.vector_opaque_p (t1)
966 || targetm.vector_opaque_p (t2)
967 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
968 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
969 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
972 /* Convert EXPR to TYPE, warning about conversion problems with constants.
973 Invoke this function on every expression that is converted implicitly,
974 i.e. because of language rules and not because of an explicit cast. */
977 convert_and_check (tree type, tree expr)
979 tree t = convert (type, expr);
980 if (TREE_CODE (t) == INTEGER_CST)
982 if (TREE_OVERFLOW (t))
984 TREE_OVERFLOW (t) = 0;
986 /* Do not diagnose overflow in a constant expression merely
987 because a conversion overflowed. */
988 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
990 /* No warning for converting 0x80000000 to int. */
991 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
992 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
993 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
994 /* If EXPR fits in the unsigned version of TYPE,
995 don't warn unless pedantic. */
997 || TYPE_UNSIGNED (type)
998 || ! constant_fits_type_p (expr,
999 c_common_unsigned_type (type)))
1000 && skip_evaluation == 0)
1001 warning ("overflow in implicit constant conversion");
1004 unsigned_conversion_warning (t, expr);
1009 /* A node in a list that describes references to variables (EXPR), which are
1010 either read accesses if WRITER is zero, or write accesses, in which case
1011 WRITER is the parent of EXPR. */
1018 /* Used to implement a cache the results of a call to verify_tree. We only
1019 use this for SAVE_EXPRs. */
1022 struct tlist_cache *next;
1023 struct tlist *cache_before_sp;
1024 struct tlist *cache_after_sp;
1028 /* Obstack to use when allocating tlist structures, and corresponding
1030 static struct obstack tlist_obstack;
1031 static char *tlist_firstobj = 0;
1033 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1035 static struct tlist *warned_ids;
1036 /* SAVE_EXPRs need special treatment. We process them only once and then
1037 cache the results. */
1038 static struct tlist_cache *save_expr_cache;
1040 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1041 static void merge_tlist (struct tlist **, struct tlist *, int);
1042 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1043 static int warning_candidate_p (tree);
1044 static void warn_for_collisions (struct tlist *);
1045 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1046 static struct tlist *new_tlist (struct tlist *, tree, tree);
1048 /* Create a new struct tlist and fill in its fields. */
1049 static struct tlist *
1050 new_tlist (struct tlist *next, tree t, tree writer)
1053 l = XOBNEW (&tlist_obstack, struct tlist);
1060 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1061 is nonnull, we ignore any node we find which has a writer equal to it. */
1064 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1068 struct tlist *next = add->next;
1071 if (! exclude_writer || add->writer != exclude_writer)
1072 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1077 /* Merge the nodes of ADD into TO. This merging process is done so that for
1078 each variable that already exists in TO, no new node is added; however if
1079 there is a write access recorded in ADD, and an occurrence on TO is only
1080 a read access, then the occurrence in TO will be modified to record the
1084 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1086 struct tlist **end = to;
1089 end = &(*end)->next;
1095 struct tlist *next = add->next;
1097 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1098 if (tmp2->expr == add->expr)
1102 tmp2->writer = add->writer;
1106 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1107 end = &(*end)->next;
1114 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1115 references in list LIST conflict with it, excluding reads if ONLY writers
1119 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1124 /* Avoid duplicate warnings. */
1125 for (tmp = warned_ids; tmp; tmp = tmp->next)
1126 if (tmp->expr == written)
1131 if (list->expr == written
1132 && list->writer != writer
1133 && (! only_writes || list->writer)
1134 && DECL_NAME (list->expr))
1136 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1137 warning ("operation on `%s' may be undefined",
1138 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1144 /* Given a list LIST of references to variables, find whether any of these
1145 can cause conflicts due to missing sequence points. */
1148 warn_for_collisions (struct tlist *list)
1152 for (tmp = list; tmp; tmp = tmp->next)
1155 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1159 /* Return nonzero if X is a tree that can be verified by the sequence point
1162 warning_candidate_p (tree x)
1164 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1167 /* Walk the tree X, and record accesses to variables. If X is written by the
1168 parent tree, WRITER is the parent.
1169 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1170 expression or its only operand forces a sequence point, then everything up
1171 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1173 Once we return, we will have emitted warnings if any subexpression before
1174 such a sequence point could be undefined. On a higher level, however, the
1175 sequence point may not be relevant, and we'll merge the two lists.
1177 Example: (b++, a) + b;
1178 The call that processes the COMPOUND_EXPR will store the increment of B
1179 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1180 processes the PLUS_EXPR will need to merge the two lists so that
1181 eventually, all accesses end up on the same list (and we'll warn about the
1182 unordered subexpressions b++ and b.
1184 A note on merging. If we modify the former example so that our expression
1187 care must be taken not simply to add all three expressions into the final
1188 PNO_SP list. The function merge_tlist takes care of that by merging the
1189 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1190 way, so that no more than one access to B is recorded. */
1193 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1196 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1197 enum tree_code code;
1200 /* X may be NULL if it is the operand of an empty statement expression
1206 code = TREE_CODE (x);
1207 cl = TREE_CODE_CLASS (code);
1209 if (warning_candidate_p (x))
1211 *pno_sp = new_tlist (*pno_sp, x, writer);
1221 case TRUTH_ANDIF_EXPR:
1222 case TRUTH_ORIF_EXPR:
1223 tmp_before = tmp_nosp = tmp_list3 = 0;
1224 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1225 warn_for_collisions (tmp_nosp);
1226 merge_tlist (pbefore_sp, tmp_before, 0);
1227 merge_tlist (pbefore_sp, tmp_nosp, 0);
1228 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1229 merge_tlist (pbefore_sp, tmp_list3, 0);
1233 tmp_before = tmp_list2 = 0;
1234 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1235 warn_for_collisions (tmp_list2);
1236 merge_tlist (pbefore_sp, tmp_before, 0);
1237 merge_tlist (pbefore_sp, tmp_list2, 1);
1239 tmp_list3 = tmp_nosp = 0;
1240 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1241 warn_for_collisions (tmp_nosp);
1242 merge_tlist (pbefore_sp, tmp_list3, 0);
1244 tmp_list3 = tmp_list2 = 0;
1245 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1246 warn_for_collisions (tmp_list2);
1247 merge_tlist (pbefore_sp, tmp_list3, 0);
1248 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1249 two first, to avoid warning for (a ? b++ : b++). */
1250 merge_tlist (&tmp_nosp, tmp_list2, 0);
1251 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1254 case PREDECREMENT_EXPR:
1255 case PREINCREMENT_EXPR:
1256 case POSTDECREMENT_EXPR:
1257 case POSTINCREMENT_EXPR:
1258 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1262 tmp_before = tmp_nosp = tmp_list3 = 0;
1263 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1264 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1265 /* Expressions inside the LHS are not ordered wrt. the sequence points
1266 in the RHS. Example:
1268 Despite the fact that the modification of "a" is in the before_sp
1269 list (tmp_before), it conflicts with the use of "a" in the LHS.
1270 We can handle this by adding the contents of tmp_list3
1271 to those of tmp_before, and redoing the collision warnings for that
1273 add_tlist (&tmp_before, tmp_list3, x, 1);
1274 warn_for_collisions (tmp_before);
1275 /* Exclude the LHS itself here; we first have to merge it into the
1276 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1277 didn't exclude the LHS, we'd get it twice, once as a read and once
1279 add_tlist (pno_sp, tmp_list3, x, 0);
1280 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1282 merge_tlist (pbefore_sp, tmp_before, 0);
1283 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1284 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1285 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1289 /* We need to warn about conflicts among arguments and conflicts between
1290 args and the function address. Side effects of the function address,
1291 however, are not ordered by the sequence point of the call. */
1292 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1293 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1294 if (TREE_OPERAND (x, 1))
1295 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1296 merge_tlist (&tmp_list3, tmp_list2, 0);
1297 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1298 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1299 warn_for_collisions (tmp_before);
1300 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1304 /* Scan all the list, e.g. indices of multi dimensional array. */
1307 tmp_before = tmp_nosp = 0;
1308 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1309 merge_tlist (&tmp_nosp, tmp_before, 0);
1310 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1317 struct tlist_cache *t;
1318 for (t = save_expr_cache; t; t = t->next)
1324 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1325 t->next = save_expr_cache;
1327 save_expr_cache = t;
1329 tmp_before = tmp_nosp = 0;
1330 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1331 warn_for_collisions (tmp_nosp);
1336 struct tlist *t = tmp_nosp;
1338 merge_tlist (&tmp_list3, t, 0);
1340 t->cache_before_sp = tmp_before;
1341 t->cache_after_sp = tmp_list3;
1343 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1344 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1353 if (first_rtl_op (code) == 0)
1355 x = TREE_OPERAND (x, 0);
1370 int max = first_rtl_op (TREE_CODE (x));
1371 for (lp = 0; lp < max; lp++)
1373 tmp_before = tmp_nosp = 0;
1374 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1375 merge_tlist (&tmp_nosp, tmp_before, 0);
1376 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1383 /* Try to warn for undefined behavior in EXPR due to missing sequence
1387 verify_sequence_points (tree expr)
1389 struct tlist *before_sp = 0, *after_sp = 0;
1392 save_expr_cache = 0;
1393 if (tlist_firstobj == 0)
1395 gcc_obstack_init (&tlist_obstack);
1396 tlist_firstobj = (char *) obstack_alloc (&tlist_obstack, 0);
1399 verify_tree (expr, &before_sp, &after_sp, 0);
1400 warn_for_collisions (after_sp);
1401 obstack_free (&tlist_obstack, tlist_firstobj);
1404 /* Validate the expression after `case' and apply default promotions. */
1407 check_case_value (tree value)
1409 if (value == NULL_TREE)
1412 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1413 STRIP_TYPE_NOPS (value);
1414 /* In C++, the following is allowed:
1417 switch (...) { case i: ... }
1419 So, we try to reduce the VALUE to a constant that way. */
1420 if (c_dialect_cxx ())
1422 value = decl_constant_value (value);
1423 STRIP_TYPE_NOPS (value);
1424 value = fold (value);
1427 if (TREE_CODE (value) != INTEGER_CST
1428 && value != error_mark_node)
1430 error ("case label does not reduce to an integer constant");
1431 value = error_mark_node;
1434 /* Promote char or short to int. */
1435 value = default_conversion (value);
1437 constant_expression_warning (value);
1442 /* See if the case values LOW and HIGH are in the range of the original
1443 type (ie. before the default conversion to int) of the switch testing
1445 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1446 the type before promiting it. CASE_LOW_P is a pointer to the lower
1447 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1448 if the case is not a case range.
1449 The caller has to make sure that we are not called with NULL for
1450 CASE_LOW_P (ie. the defualt case).
1451 Returns true if the case label is in range of ORIG_TYPE (satured or
1452 untouched) or false if the label is out of range. */
1455 check_case_bounds (tree type, tree orig_type,
1456 tree *case_low_p, tree *case_high_p)
1458 tree min_value, max_value;
1459 tree case_low = *case_low_p;
1460 tree case_high = case_high_p ? *case_high_p : case_low;
1462 /* If there was a problem with the original type, do nothing. */
1463 if (orig_type == error_mark_node)
1466 min_value = TYPE_MIN_VALUE (orig_type);
1467 max_value = TYPE_MAX_VALUE (orig_type);
1469 /* Case label is less than minimum for type. */
1470 if (tree_int_cst_compare (case_low, min_value) < 0
1471 && tree_int_cst_compare (case_high, min_value) < 0)
1473 warning ("case label value is less than minimum value for type");
1477 /* Case value is greater than maximum for type. */
1478 if (tree_int_cst_compare (case_low, max_value) > 0
1479 && tree_int_cst_compare (case_high, max_value) > 0)
1481 warning ("case label value exceeds maximum value for type");
1485 /* Saturate lower case label value to minimum. */
1486 if (tree_int_cst_compare (case_high, min_value) >= 0
1487 && tree_int_cst_compare (case_low, min_value) < 0)
1489 warning ("lower value in case label range"
1490 " less than minimum value for type");
1491 case_low = min_value;
1494 /* Saturate upper case label value to maximum. */
1495 if (tree_int_cst_compare (case_low, max_value) <= 0
1496 && tree_int_cst_compare (case_high, max_value) > 0)
1498 warning ("upper value in case label range"
1499 " exceeds maximum value for type");
1500 case_high = max_value;
1503 if (*case_low_p != case_low)
1504 *case_low_p = convert (type, case_low);
1505 if (case_high_p && *case_high_p != case_high)
1506 *case_high_p = convert (type, case_high);
1511 /* Return an integer type with BITS bits of precision,
1512 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1515 c_common_type_for_size (unsigned int bits, int unsignedp)
1517 if (bits == TYPE_PRECISION (integer_type_node))
1518 return unsignedp ? unsigned_type_node : integer_type_node;
1520 if (bits == TYPE_PRECISION (signed_char_type_node))
1521 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1523 if (bits == TYPE_PRECISION (short_integer_type_node))
1524 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1526 if (bits == TYPE_PRECISION (long_integer_type_node))
1527 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1529 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1530 return (unsignedp ? long_long_unsigned_type_node
1531 : long_long_integer_type_node);
1533 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1534 return (unsignedp ? widest_unsigned_literal_type_node
1535 : widest_integer_literal_type_node);
1537 if (bits <= TYPE_PRECISION (intQI_type_node))
1538 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1540 if (bits <= TYPE_PRECISION (intHI_type_node))
1541 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1543 if (bits <= TYPE_PRECISION (intSI_type_node))
1544 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1546 if (bits <= TYPE_PRECISION (intDI_type_node))
1547 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1552 /* Used for communication between c_common_type_for_mode and
1553 c_register_builtin_type. */
1554 static GTY(()) tree registered_builtin_types;
1556 /* Return a data type that has machine mode MODE.
1557 If the mode is an integer,
1558 then UNSIGNEDP selects between signed and unsigned types. */
1561 c_common_type_for_mode (enum machine_mode mode, int unsignedp)
1565 if (mode == TYPE_MODE (integer_type_node))
1566 return unsignedp ? unsigned_type_node : integer_type_node;
1568 if (mode == TYPE_MODE (signed_char_type_node))
1569 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1571 if (mode == TYPE_MODE (short_integer_type_node))
1572 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1574 if (mode == TYPE_MODE (long_integer_type_node))
1575 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1577 if (mode == TYPE_MODE (long_long_integer_type_node))
1578 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1580 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1581 return unsignedp ? widest_unsigned_literal_type_node
1582 : widest_integer_literal_type_node;
1585 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1588 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1591 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1594 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1596 #if HOST_BITS_PER_WIDE_INT >= 64
1597 if (mode == TYPE_MODE (intTI_type_node))
1598 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1601 if (mode == TYPE_MODE (float_type_node))
1602 return float_type_node;
1604 if (mode == TYPE_MODE (double_type_node))
1605 return double_type_node;
1607 if (mode == TYPE_MODE (long_double_type_node))
1608 return long_double_type_node;
1610 if (mode == TYPE_MODE (void_type_node))
1611 return void_type_node;
1613 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1614 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1616 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1617 return unsignedp ? make_unsigned_type (mode) : make_signed_type (mode);
1619 if (VECTOR_MODE_P (mode))
1621 enum machine_mode inner_mode = GET_MODE_INNER (mode);
1622 tree inner_type = c_common_type_for_mode (inner_mode, unsignedp);
1623 if (inner_type != NULL_TREE)
1624 return build_vector_type_for_mode (inner_type, mode);
1627 for (t = registered_builtin_types; t; t = TREE_CHAIN (t))
1628 if (TYPE_MODE (TREE_VALUE (t)) == mode)
1629 return TREE_VALUE (t);
1634 /* Return an unsigned type the same as TYPE in other respects. */
1636 c_common_unsigned_type (tree type)
1638 tree type1 = TYPE_MAIN_VARIANT (type);
1639 if (type1 == signed_char_type_node || type1 == char_type_node)
1640 return unsigned_char_type_node;
1641 if (type1 == integer_type_node)
1642 return unsigned_type_node;
1643 if (type1 == short_integer_type_node)
1644 return short_unsigned_type_node;
1645 if (type1 == long_integer_type_node)
1646 return long_unsigned_type_node;
1647 if (type1 == long_long_integer_type_node)
1648 return long_long_unsigned_type_node;
1649 if (type1 == widest_integer_literal_type_node)
1650 return widest_unsigned_literal_type_node;
1651 #if HOST_BITS_PER_WIDE_INT >= 64
1652 if (type1 == intTI_type_node)
1653 return unsigned_intTI_type_node;
1655 if (type1 == intDI_type_node)
1656 return unsigned_intDI_type_node;
1657 if (type1 == intSI_type_node)
1658 return unsigned_intSI_type_node;
1659 if (type1 == intHI_type_node)
1660 return unsigned_intHI_type_node;
1661 if (type1 == intQI_type_node)
1662 return unsigned_intQI_type_node;
1664 return c_common_signed_or_unsigned_type (1, type);
1667 /* Return a signed type the same as TYPE in other respects. */
1670 c_common_signed_type (tree type)
1672 tree type1 = TYPE_MAIN_VARIANT (type);
1673 if (type1 == unsigned_char_type_node || type1 == char_type_node)
1674 return signed_char_type_node;
1675 if (type1 == unsigned_type_node)
1676 return integer_type_node;
1677 if (type1 == short_unsigned_type_node)
1678 return short_integer_type_node;
1679 if (type1 == long_unsigned_type_node)
1680 return long_integer_type_node;
1681 if (type1 == long_long_unsigned_type_node)
1682 return long_long_integer_type_node;
1683 if (type1 == widest_unsigned_literal_type_node)
1684 return widest_integer_literal_type_node;
1685 #if HOST_BITS_PER_WIDE_INT >= 64
1686 if (type1 == unsigned_intTI_type_node)
1687 return intTI_type_node;
1689 if (type1 == unsigned_intDI_type_node)
1690 return intDI_type_node;
1691 if (type1 == unsigned_intSI_type_node)
1692 return intSI_type_node;
1693 if (type1 == unsigned_intHI_type_node)
1694 return intHI_type_node;
1695 if (type1 == unsigned_intQI_type_node)
1696 return intQI_type_node;
1698 return c_common_signed_or_unsigned_type (0, type);
1701 /* Return a type the same as TYPE except unsigned or
1702 signed according to UNSIGNEDP. */
1705 c_common_signed_or_unsigned_type (int unsignedp, tree type)
1707 if (! INTEGRAL_TYPE_P (type)
1708 || TYPE_UNSIGNED (type) == unsignedp)
1711 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
1712 the precision; they have precision set to match their range, but
1713 may use a wider mode to match an ABI. If we change modes, we may
1714 wind up with bad conversions. For INTEGER_TYPEs in C, must check
1715 the precision as well, so as to yield correct results for
1716 bit-field types. C++ does not have these separate bit-field
1717 types, and producing a signed or unsigned variant of an
1718 ENUMERAL_TYPE may cause other problems as well. */
1720 #define TYPE_OK(node) \
1721 (TYPE_MODE (type) == TYPE_MODE (node) \
1722 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
1723 if (TYPE_OK (signed_char_type_node))
1724 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1725 if (TYPE_OK (integer_type_node))
1726 return unsignedp ? unsigned_type_node : integer_type_node;
1727 if (TYPE_OK (short_integer_type_node))
1728 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1729 if (TYPE_OK (long_integer_type_node))
1730 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1731 if (TYPE_OK (long_long_integer_type_node))
1732 return (unsignedp ? long_long_unsigned_type_node
1733 : long_long_integer_type_node);
1734 if (TYPE_OK (widest_integer_literal_type_node))
1735 return (unsignedp ? widest_unsigned_literal_type_node
1736 : widest_integer_literal_type_node);
1738 #if HOST_BITS_PER_WIDE_INT >= 64
1739 if (TYPE_OK (intTI_type_node))
1740 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1742 if (TYPE_OK (intDI_type_node))
1743 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1744 if (TYPE_OK (intSI_type_node))
1745 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1746 if (TYPE_OK (intHI_type_node))
1747 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1748 if (TYPE_OK (intQI_type_node))
1749 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1752 if (c_dialect_cxx ())
1755 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
1758 /* The C version of the register_builtin_type langhook. */
1761 c_register_builtin_type (tree type, const char* name)
1765 decl = build_decl (TYPE_DECL, get_identifier (name), type);
1766 DECL_ARTIFICIAL (decl) = 1;
1767 if (!TYPE_NAME (type))
1768 TYPE_NAME (type) = decl;
1771 registered_builtin_types = tree_cons (0, type, registered_builtin_types);
1775 /* Return the minimum number of bits needed to represent VALUE in a
1776 signed or unsigned type, UNSIGNEDP says which. */
1779 min_precision (tree value, int unsignedp)
1783 /* If the value is negative, compute its negative minus 1. The latter
1784 adjustment is because the absolute value of the largest negative value
1785 is one larger than the largest positive value. This is equivalent to
1786 a bit-wise negation, so use that operation instead. */
1788 if (tree_int_cst_sgn (value) < 0)
1789 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
1791 /* Return the number of bits needed, taking into account the fact
1792 that we need one more bit for a signed than unsigned type. */
1794 if (integer_zerop (value))
1797 log = tree_floor_log2 (value);
1799 return log + 1 + ! unsignedp;
1802 /* Print an error message for invalid operands to arith operation
1803 CODE. NOP_EXPR is used as a special case (see
1804 c_common_truthvalue_conversion). */
1807 binary_op_error (enum tree_code code)
1814 error ("invalid truth-value expression");
1818 opname = "+"; break;
1820 opname = "-"; break;
1822 opname = "*"; break;
1824 opname = "max"; break;
1826 opname = "min"; break;
1828 opname = "=="; break;
1830 opname = "!="; break;
1832 opname = "<="; break;
1834 opname = ">="; break;
1836 opname = "<"; break;
1838 opname = ">"; break;
1840 opname = "<<"; break;
1842 opname = ">>"; break;
1843 case TRUNC_MOD_EXPR:
1844 case FLOOR_MOD_EXPR:
1845 opname = "%"; break;
1846 case TRUNC_DIV_EXPR:
1847 case FLOOR_DIV_EXPR:
1848 opname = "/"; break;
1850 opname = "&"; break;
1852 opname = "|"; break;
1853 case TRUTH_ANDIF_EXPR:
1854 opname = "&&"; break;
1855 case TRUTH_ORIF_EXPR:
1856 opname = "||"; break;
1858 opname = "^"; break;
1861 opname = "rotate"; break;
1863 opname = "unknown"; break;
1865 error ("invalid operands to binary %s", opname);
1868 /* Subroutine of build_binary_op, used for comparison operations.
1869 See if the operands have both been converted from subword integer types
1870 and, if so, perhaps change them both back to their original type.
1871 This function is also responsible for converting the two operands
1872 to the proper common type for comparison.
1874 The arguments of this function are all pointers to local variables
1875 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1876 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1878 If this function returns nonzero, it means that the comparison has
1879 a constant value. What this function returns is an expression for
1883 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
1884 enum tree_code *rescode_ptr)
1887 tree op0 = *op0_ptr;
1888 tree op1 = *op1_ptr;
1889 int unsignedp0, unsignedp1;
1891 tree primop0, primop1;
1892 enum tree_code code = *rescode_ptr;
1894 /* Throw away any conversions to wider types
1895 already present in the operands. */
1897 primop0 = get_narrower (op0, &unsignedp0);
1898 primop1 = get_narrower (op1, &unsignedp1);
1900 /* Handle the case that OP0 does not *contain* a conversion
1901 but it *requires* conversion to FINAL_TYPE. */
1903 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
1904 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1905 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
1906 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1908 /* If one of the operands must be floated, we cannot optimize. */
1909 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
1910 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
1912 /* If first arg is constant, swap the args (changing operation
1913 so value is preserved), for canonicalization. Don't do this if
1914 the second arg is 0. */
1916 if (TREE_CONSTANT (primop0)
1917 && ! integer_zerop (primop1) && ! real_zerop (primop1))
1920 int temi = unsignedp0;
1928 unsignedp0 = unsignedp1;
1951 *rescode_ptr = code;
1954 /* If comparing an integer against a constant more bits wide,
1955 maybe we can deduce a value of 1 or 0 independent of the data.
1956 Or else truncate the constant now
1957 rather than extend the variable at run time.
1959 This is only interesting if the constant is the wider arg.
1960 Also, it is not safe if the constant is unsigned and the
1961 variable arg is signed, since in this case the variable
1962 would be sign-extended and then regarded as unsigned.
1963 Our technique fails in this case because the lowest/highest
1964 possible unsigned results don't follow naturally from the
1965 lowest/highest possible values of the variable operand.
1966 For just EQ_EXPR and NE_EXPR there is another technique that
1967 could be used: see if the constant can be faithfully represented
1968 in the other operand's type, by truncating it and reextending it
1969 and see if that preserves the constant's value. */
1971 if (!real1 && !real2
1972 && TREE_CODE (primop1) == INTEGER_CST
1973 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
1975 int min_gt, max_gt, min_lt, max_lt;
1976 tree maxval, minval;
1977 /* 1 if comparison is nominally unsigned. */
1978 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
1981 type = c_common_signed_or_unsigned_type (unsignedp0,
1982 TREE_TYPE (primop0));
1984 /* In C, if TYPE is an enumeration, then we need to get its
1985 min/max values from its underlying integral type, not the
1986 enumerated type itself. In C++, TYPE_MAX_VALUE and
1987 TYPE_MIN_VALUE have already been set correctly on the
1988 enumeration type. */
1989 if (!c_dialect_cxx() && TREE_CODE (type) == ENUMERAL_TYPE)
1990 type = c_common_type_for_size (TYPE_PRECISION (type), unsignedp0);
1992 maxval = TYPE_MAX_VALUE (type);
1993 minval = TYPE_MIN_VALUE (type);
1995 if (unsignedp && !unsignedp0)
1996 *restype_ptr = c_common_signed_type (*restype_ptr);
1998 if (TREE_TYPE (primop1) != *restype_ptr)
2000 /* Convert primop1 to target type, but do not introduce
2001 additional overflow. We know primop1 is an int_cst. */
2002 tree tmp = build_int_2 (TREE_INT_CST_LOW (primop1),
2003 TREE_INT_CST_HIGH (primop1));
2005 TREE_TYPE (tmp) = *restype_ptr;
2006 primop1 = force_fit_type (tmp, 0, TREE_OVERFLOW (primop1),
2007 TREE_CONSTANT_OVERFLOW (primop1));
2009 if (type != *restype_ptr)
2011 minval = convert (*restype_ptr, minval);
2012 maxval = convert (*restype_ptr, maxval);
2015 if (unsignedp && unsignedp0)
2017 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2018 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2019 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2020 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2024 min_gt = INT_CST_LT (primop1, minval);
2025 max_gt = INT_CST_LT (primop1, maxval);
2026 min_lt = INT_CST_LT (minval, primop1);
2027 max_lt = INT_CST_LT (maxval, primop1);
2031 /* This used to be a switch, but Genix compiler can't handle that. */
2032 if (code == NE_EXPR)
2034 if (max_lt || min_gt)
2035 val = truthvalue_true_node;
2037 else if (code == EQ_EXPR)
2039 if (max_lt || min_gt)
2040 val = truthvalue_false_node;
2042 else if (code == LT_EXPR)
2045 val = truthvalue_true_node;
2047 val = truthvalue_false_node;
2049 else if (code == GT_EXPR)
2052 val = truthvalue_true_node;
2054 val = truthvalue_false_node;
2056 else if (code == LE_EXPR)
2059 val = truthvalue_true_node;
2061 val = truthvalue_false_node;
2063 else if (code == GE_EXPR)
2066 val = truthvalue_true_node;
2068 val = truthvalue_false_node;
2071 /* If primop0 was sign-extended and unsigned comparison specd,
2072 we did a signed comparison above using the signed type bounds.
2073 But the comparison we output must be unsigned.
2075 Also, for inequalities, VAL is no good; but if the signed
2076 comparison had *any* fixed result, it follows that the
2077 unsigned comparison just tests the sign in reverse
2078 (positive values are LE, negative ones GE).
2079 So we can generate an unsigned comparison
2080 against an extreme value of the signed type. */
2082 if (unsignedp && !unsignedp0)
2089 primop1 = TYPE_MIN_VALUE (type);
2095 primop1 = TYPE_MAX_VALUE (type);
2102 type = c_common_unsigned_type (type);
2105 if (TREE_CODE (primop0) != INTEGER_CST)
2107 if (val == truthvalue_false_node)
2108 warning ("comparison is always false due to limited range of data type");
2109 if (val == truthvalue_true_node)
2110 warning ("comparison is always true due to limited range of data type");
2115 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2116 if (TREE_SIDE_EFFECTS (primop0))
2117 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2121 /* Value is not predetermined, but do the comparison
2122 in the type of the operand that is not constant.
2123 TYPE is already properly set. */
2125 else if (real1 && real2
2126 && (TYPE_PRECISION (TREE_TYPE (primop0))
2127 == TYPE_PRECISION (TREE_TYPE (primop1))))
2128 type = TREE_TYPE (primop0);
2130 /* If args' natural types are both narrower than nominal type
2131 and both extend in the same manner, compare them
2132 in the type of the wider arg.
2133 Otherwise must actually extend both to the nominal
2134 common type lest different ways of extending
2136 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2138 else if (unsignedp0 == unsignedp1 && real1 == real2
2139 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2140 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2142 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2143 type = c_common_signed_or_unsigned_type (unsignedp0
2144 || TYPE_UNSIGNED (*restype_ptr),
2146 /* Make sure shorter operand is extended the right way
2147 to match the longer operand. */
2149 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2150 TREE_TYPE (primop0)),
2153 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2154 TREE_TYPE (primop1)),
2159 /* Here we must do the comparison on the nominal type
2160 using the args exactly as we received them. */
2161 type = *restype_ptr;
2165 if (!real1 && !real2 && integer_zerop (primop1)
2166 && TYPE_UNSIGNED (*restype_ptr))
2172 /* All unsigned values are >= 0, so we warn if extra warnings
2173 are requested. However, if OP0 is a constant that is
2174 >= 0, the signedness of the comparison isn't an issue,
2175 so suppress the warning. */
2176 if (extra_warnings && !in_system_header
2177 && ! (TREE_CODE (primop0) == INTEGER_CST
2178 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2180 warning ("comparison of unsigned expression >= 0 is always true");
2181 value = truthvalue_true_node;
2185 if (extra_warnings && !in_system_header
2186 && ! (TREE_CODE (primop0) == INTEGER_CST
2187 && ! TREE_OVERFLOW (convert (c_common_signed_type (type),
2189 warning ("comparison of unsigned expression < 0 is always false");
2190 value = truthvalue_false_node;
2199 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2200 if (TREE_SIDE_EFFECTS (primop0))
2201 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2208 *op0_ptr = convert (type, primop0);
2209 *op1_ptr = convert (type, primop1);
2211 *restype_ptr = truthvalue_type_node;
2216 /* Return a tree for the sum or difference (RESULTCODE says which)
2217 of pointer PTROP and integer INTOP. */
2220 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2224 /* The result is a pointer of the same type that is being added. */
2226 tree result_type = TREE_TYPE (ptrop);
2228 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2230 if (pedantic || warn_pointer_arith)
2231 pedwarn ("pointer of type `void *' used in arithmetic");
2232 size_exp = integer_one_node;
2234 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2236 if (pedantic || warn_pointer_arith)
2237 pedwarn ("pointer to a function used in arithmetic");
2238 size_exp = integer_one_node;
2240 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2242 if (pedantic || warn_pointer_arith)
2243 pedwarn ("pointer to member function used in arithmetic");
2244 size_exp = integer_one_node;
2247 size_exp = size_in_bytes (TREE_TYPE (result_type));
2249 /* If what we are about to multiply by the size of the elements
2250 contains a constant term, apply distributive law
2251 and multiply that constant term separately.
2252 This helps produce common subexpressions. */
2254 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2255 && ! TREE_CONSTANT (intop)
2256 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2257 && TREE_CONSTANT (size_exp)
2258 /* If the constant comes from pointer subtraction,
2259 skip this optimization--it would cause an error. */
2260 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2261 /* If the constant is unsigned, and smaller than the pointer size,
2262 then we must skip this optimization. This is because it could cause
2263 an overflow error if the constant is negative but INTOP is not. */
2264 && (! TYPE_UNSIGNED (TREE_TYPE (intop))
2265 || (TYPE_PRECISION (TREE_TYPE (intop))
2266 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2268 enum tree_code subcode = resultcode;
2269 tree int_type = TREE_TYPE (intop);
2270 if (TREE_CODE (intop) == MINUS_EXPR)
2271 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2272 /* Convert both subexpression types to the type of intop,
2273 because weird cases involving pointer arithmetic
2274 can result in a sum or difference with different type args. */
2275 ptrop = build_binary_op (subcode, ptrop,
2276 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2277 intop = convert (int_type, TREE_OPERAND (intop, 0));
2280 /* Convert the integer argument to a type the same size as sizetype
2281 so the multiply won't overflow spuriously. */
2283 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2284 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2285 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2286 TYPE_UNSIGNED (sizetype)), intop);
2288 /* Replace the integer argument with a suitable product by the object size.
2289 Do this multiplication as signed, then convert to the appropriate
2290 pointer type (actually unsigned integral). */
2292 intop = convert (result_type,
2293 build_binary_op (MULT_EXPR, intop,
2294 convert (TREE_TYPE (intop), size_exp), 1));
2296 /* Create the sum or difference. */
2297 return fold (build2 (resultcode, result_type, ptrop, intop));
2300 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2301 or validate its data type for an `if' or `while' statement or ?..: exp.
2303 This preparation consists of taking the ordinary
2304 representation of an expression expr and producing a valid tree
2305 boolean expression describing whether expr is nonzero. We could
2306 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2307 but we optimize comparisons, &&, ||, and !.
2309 The resulting type should always be `truthvalue_type_node'. */
2312 c_common_truthvalue_conversion (tree expr)
2314 if (TREE_CODE (expr) == ERROR_MARK)
2317 if (TREE_CODE (expr) == FUNCTION_DECL)
2318 expr = build_unary_op (ADDR_EXPR, expr, 0);
2320 switch (TREE_CODE (expr))
2322 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2323 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2324 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2325 case ORDERED_EXPR: case UNORDERED_EXPR:
2326 case TRUTH_ANDIF_EXPR:
2327 case TRUTH_ORIF_EXPR:
2328 case TRUTH_AND_EXPR:
2330 case TRUTH_XOR_EXPR:
2331 case TRUTH_NOT_EXPR:
2332 TREE_TYPE (expr) = truthvalue_type_node;
2339 return integer_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2342 return real_zerop (expr) ? truthvalue_false_node : truthvalue_true_node;
2346 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2347 && ! DECL_WEAK (TREE_OPERAND (expr, 0)))
2349 /* Common Ada/Pascal programmer's mistake. We always warn
2350 about this since it is so bad. */
2351 warning ("the address of `%D', will always evaluate as `true'",
2352 TREE_OPERAND (expr, 0));
2353 return truthvalue_true_node;
2356 /* If we are taking the address of an external decl, it might be
2357 zero if it is weak, so we cannot optimize. */
2358 if (DECL_P (TREE_OPERAND (expr, 0))
2359 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2362 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2363 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2364 TREE_OPERAND (expr, 0), truthvalue_true_node);
2366 return truthvalue_true_node;
2370 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2371 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2372 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2373 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2379 /* These don't change whether an object is nonzero or zero. */
2380 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2384 /* These don't change whether an object is zero or nonzero, but
2385 we can't ignore them if their second arg has side-effects. */
2386 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2387 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2388 TREE_OPERAND (expr, 1),
2389 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2391 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2394 /* Distribute the conversion into the arms of a COND_EXPR. */
2395 return fold (build3 (COND_EXPR, truthvalue_type_node,
2396 TREE_OPERAND (expr, 0),
2397 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2398 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2401 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2402 since that affects how `default_conversion' will behave. */
2403 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2404 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2406 /* Fall through.... */
2408 /* If this is widening the argument, we can ignore it. */
2409 if (TYPE_PRECISION (TREE_TYPE (expr))
2410 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2411 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2415 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2416 aren't guaranteed to the be same for modes that can represent
2417 infinity, since if x and y are both +infinity, or both
2418 -infinity, then x - y is not a number.
2420 Note that this transformation is safe when x or y is NaN.
2421 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2423 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2425 /* Fall through.... */
2427 /* This and MINUS_EXPR can be changed into a comparison of the
2429 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2430 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2431 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2432 TREE_OPERAND (expr, 1), 1);
2433 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2434 fold (build1 (NOP_EXPR,
2435 TREE_TYPE (TREE_OPERAND (expr, 0)),
2436 TREE_OPERAND (expr, 1))), 1);
2439 if (integer_onep (TREE_OPERAND (expr, 1))
2440 && TREE_TYPE (expr) != truthvalue_type_node)
2441 /* Using convert here would cause infinite recursion. */
2442 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2446 if (warn_parentheses && !TREE_NO_WARNING (expr))
2447 warning ("suggest parentheses around assignment used as truth value");
2454 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2456 tree t = save_expr (expr);
2457 return (build_binary_op
2458 ((TREE_SIDE_EFFECTS (expr)
2459 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2460 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2461 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2465 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2468 static tree builtin_function_2 (const char *builtin_name, const char *name,
2469 tree builtin_type, tree type,
2470 enum built_in_function function_code,
2471 enum built_in_class cl, int library_name_p,
2475 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2476 down to the element type of an array. */
2479 c_build_qualified_type (tree type, int type_quals)
2481 if (type == error_mark_node)
2484 if (TREE_CODE (type) == ARRAY_TYPE)
2485 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2487 TYPE_DOMAIN (type));
2489 /* A restrict-qualified pointer type must be a pointer to object or
2490 incomplete type. Note that the use of POINTER_TYPE_P also allows
2491 REFERENCE_TYPEs, which is appropriate for C++. */
2492 if ((type_quals & TYPE_QUAL_RESTRICT)
2493 && (!POINTER_TYPE_P (type)
2494 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2496 error ("invalid use of `restrict'");
2497 type_quals &= ~TYPE_QUAL_RESTRICT;
2500 return build_qualified_type (type, type_quals);
2503 /* Apply the TYPE_QUALS to the new DECL. */
2506 c_apply_type_quals_to_decl (int type_quals, tree decl)
2508 tree type = TREE_TYPE (decl);
2510 if (type == error_mark_node)
2513 if (((type_quals & TYPE_QUAL_CONST)
2514 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2515 /* An object declared 'const' is only readonly after it is
2516 initialized. We don't have any way of expressing this currently,
2517 so we need to be conservative and unset TREE_READONLY for types
2518 with constructors. Otherwise aliasing code will ignore stores in
2519 an inline constructor. */
2520 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2521 TREE_READONLY (decl) = 1;
2522 if (type_quals & TYPE_QUAL_VOLATILE)
2524 TREE_SIDE_EFFECTS (decl) = 1;
2525 TREE_THIS_VOLATILE (decl) = 1;
2527 if (type_quals & TYPE_QUAL_RESTRICT)
2529 while (type && TREE_CODE (type) == ARRAY_TYPE)
2530 /* Allow 'restrict' on arrays of pointers.
2531 FIXME currently we just ignore it. */
2532 type = TREE_TYPE (type);
2534 || !POINTER_TYPE_P (type)
2535 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2536 error ("invalid use of `restrict'");
2537 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2538 /* Indicate we need to make a unique alias set for this pointer.
2539 We can't do it here because it might be pointing to an
2541 DECL_POINTER_ALIAS_SET (decl) = -2;
2545 /* Hash function for the problem of multiple type definitions in
2546 different files. This must hash all types that will compare
2547 equal via comptypes to the same value. In practice it hashes
2548 on some of the simple stuff and leaves the details to comptypes. */
2551 c_type_hash (const void *p)
2557 switch (TREE_CODE (t))
2559 /* For pointers, hash on pointee type plus some swizzling. */
2561 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2562 /* Hash on number of elements and total size. */
2565 t2 = TYPE_VALUES (t);
2569 t2 = TYPE_FIELDS (t);
2571 case QUAL_UNION_TYPE:
2573 t2 = TYPE_FIELDS (t);
2577 t2 = TYPE_FIELDS (t);
2582 for (; t2; t2 = TREE_CHAIN (t2))
2584 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2585 return ((size << 24) | (i << shift));
2588 /* Return the typed-based alias set for T, which may be an expression
2589 or a type. Return -1 if we don't do anything special. */
2592 c_common_get_alias_set (tree t)
2596 static htab_t type_hash_table;
2598 /* Permit type-punning when accessing a union, provided the access
2599 is directly through the union. For example, this code does not
2600 permit taking the address of a union member and then storing
2601 through it. Even the type-punning allowed here is a GCC
2602 extension, albeit a common and useful one; the C standard says
2603 that such accesses have implementation-defined behavior. */
2605 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2606 u = TREE_OPERAND (u, 0))
2607 if (TREE_CODE (u) == COMPONENT_REF
2608 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2611 /* That's all the expressions we handle specially. */
2615 /* The C standard guarantees that any object may be accessed via an
2616 lvalue that has character type. */
2617 if (t == char_type_node
2618 || t == signed_char_type_node
2619 || t == unsigned_char_type_node)
2622 /* If it has the may_alias attribute, it can alias anything. */
2623 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2626 /* The C standard specifically allows aliasing between signed and
2627 unsigned variants of the same type. We treat the signed
2628 variant as canonical. */
2629 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2631 tree t1 = c_common_signed_type (t);
2633 /* t1 == t can happen for boolean nodes which are always unsigned. */
2635 return get_alias_set (t1);
2637 else if (POINTER_TYPE_P (t))
2641 /* Unfortunately, there is no canonical form of a pointer type.
2642 In particular, if we have `typedef int I', then `int *', and
2643 `I *' are different types. So, we have to pick a canonical
2644 representative. We do this below.
2646 Technically, this approach is actually more conservative that
2647 it needs to be. In particular, `const int *' and `int *'
2648 should be in different alias sets, according to the C and C++
2649 standard, since their types are not the same, and so,
2650 technically, an `int **' and `const int **' cannot point at
2653 But, the standard is wrong. In particular, this code is
2658 const int* const* cipp = ipp;
2660 And, it doesn't make sense for that to be legal unless you
2661 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2662 the pointed-to types. This issue has been reported to the
2664 t1 = build_type_no_quals (t);
2666 return get_alias_set (t1);
2669 /* Handle the case of multiple type nodes referring to "the same" type,
2670 which occurs with IMA. These share an alias set. FIXME: Currently only
2671 C90 is handled. (In C99 type compatibility is not transitive, which
2672 complicates things mightily. The alias set splay trees can theoretically
2673 represent this, but insertion is tricky when you consider all the
2674 different orders things might arrive in.) */
2676 if (c_language != clk_c || flag_isoc99)
2679 /* Save time if there's only one input file. */
2680 if (num_in_fnames == 1)
2683 /* Pointers need special handling if they point to any type that
2684 needs special handling (below). */
2685 if (TREE_CODE (t) == POINTER_TYPE)
2688 /* Find bottom type under any nested POINTERs. */
2689 for (t2 = TREE_TYPE (t);
2690 TREE_CODE (t2) == POINTER_TYPE;
2691 t2 = TREE_TYPE (t2))
2693 if (TREE_CODE (t2) != RECORD_TYPE
2694 && TREE_CODE (t2) != ENUMERAL_TYPE
2695 && TREE_CODE (t2) != QUAL_UNION_TYPE
2696 && TREE_CODE (t2) != UNION_TYPE)
2698 if (TYPE_SIZE (t2) == 0)
2701 /* These are the only cases that need special handling. */
2702 if (TREE_CODE (t) != RECORD_TYPE
2703 && TREE_CODE (t) != ENUMERAL_TYPE
2704 && TREE_CODE (t) != QUAL_UNION_TYPE
2705 && TREE_CODE (t) != UNION_TYPE
2706 && TREE_CODE (t) != POINTER_TYPE)
2709 if (TYPE_SIZE (t) == 0)
2712 /* Look up t in hash table. Only one of the compatible types within each
2713 alias set is recorded in the table. */
2714 if (!type_hash_table)
2715 type_hash_table = htab_create (1021, c_type_hash,
2716 (htab_eq) lang_hooks.types_compatible_p,
2718 slot = htab_find_slot (type_hash_table, t, INSERT);
2721 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
2722 return TYPE_ALIAS_SET ((tree)*slot);
2725 /* Our caller will assign and record (in t) a new alias set; all we need
2726 to do is remember t in the hash table. */
2732 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2733 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2734 flag controls whether we should diagnose possibly ill-formed
2735 constructs or not. */
2737 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2739 const char *op_name;
2741 enum tree_code type_code = TREE_CODE (type);
2743 my_friendly_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR, 20020720);
2744 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2746 if (type_code == FUNCTION_TYPE)
2748 if (op == SIZEOF_EXPR)
2750 if (complain && (pedantic || warn_pointer_arith))
2751 pedwarn ("invalid application of `sizeof' to a function type");
2752 value = size_one_node;
2755 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2757 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2759 if (type_code == VOID_TYPE
2760 && complain && (pedantic || warn_pointer_arith))
2761 pedwarn ("invalid application of `%s' to a void type", op_name);
2762 value = size_one_node;
2764 else if (!COMPLETE_TYPE_P (type))
2767 error ("invalid application of `%s' to incomplete type `%T' ",
2769 value = size_zero_node;
2773 if (op == (enum tree_code) SIZEOF_EXPR)
2774 /* Convert in case a char is more than one unit. */
2775 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2776 size_int (TYPE_PRECISION (char_type_node)
2779 value = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2782 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2783 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2784 never happen. However, this node should really have type
2785 `size_t', which is just a typedef for an ordinary integer type. */
2786 value = fold (build1 (NOP_EXPR, size_type_node, value));
2787 my_friendly_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)), 20001021);
2792 /* Implement the __alignof keyword: Return the minimum required
2793 alignment of EXPR, measured in bytes. For VAR_DECL's and
2794 FIELD_DECL's return DECL_ALIGN (which can be set from an
2795 "aligned" __attribute__ specification). */
2798 c_alignof_expr (tree expr)
2802 if (TREE_CODE (expr) == VAR_DECL)
2803 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2805 else if (TREE_CODE (expr) == COMPONENT_REF
2806 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2808 error ("`__alignof' applied to a bit-field");
2811 else if (TREE_CODE (expr) == COMPONENT_REF
2812 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2813 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2815 else if (TREE_CODE (expr) == INDIRECT_REF)
2817 tree t = TREE_OPERAND (expr, 0);
2819 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2821 while (TREE_CODE (t) == NOP_EXPR
2822 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2826 t = TREE_OPERAND (t, 0);
2827 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2828 if (thisalign > bestalign)
2829 best = t, bestalign = thisalign;
2831 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2834 return c_alignof (TREE_TYPE (expr));
2836 return fold (build1 (NOP_EXPR, size_type_node, t));
2839 /* Handle C and C++ default attributes. */
2841 enum built_in_attribute
2843 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2844 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2845 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2846 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2847 #include "builtin-attrs.def"
2848 #undef DEF_ATTR_NULL_TREE
2850 #undef DEF_ATTR_IDENT
2851 #undef DEF_ATTR_TREE_LIST
2855 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2857 static void c_init_attributes (void);
2859 /* Build tree nodes and builtin functions common to both C and C++ language
2863 c_common_nodes_and_builtins (void)
2867 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2868 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2869 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2870 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2871 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2872 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2873 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2874 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2875 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2876 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2877 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2878 #include "builtin-types.def"
2879 #undef DEF_PRIMITIVE_TYPE
2880 #undef DEF_FUNCTION_TYPE_0
2881 #undef DEF_FUNCTION_TYPE_1
2882 #undef DEF_FUNCTION_TYPE_2
2883 #undef DEF_FUNCTION_TYPE_3
2884 #undef DEF_FUNCTION_TYPE_4
2885 #undef DEF_FUNCTION_TYPE_VAR_0
2886 #undef DEF_FUNCTION_TYPE_VAR_1
2887 #undef DEF_FUNCTION_TYPE_VAR_2
2888 #undef DEF_FUNCTION_TYPE_VAR_3
2889 #undef DEF_POINTER_TYPE
2893 typedef enum builtin_type builtin_type;
2895 tree builtin_types[(int) BT_LAST];
2896 int wchar_type_size;
2897 tree array_domain_type;
2898 tree va_list_ref_type_node;
2899 tree va_list_arg_type_node;
2901 /* Define `int' and `char' first so that dbx will output them first. */
2902 record_builtin_type (RID_INT, NULL, integer_type_node);
2903 record_builtin_type (RID_CHAR, "char", char_type_node);
2905 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2906 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2907 but not C. Are the conditionals here needed? */
2908 if (c_dialect_cxx ())
2909 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
2910 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
2911 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
2912 record_builtin_type (RID_MAX, "long unsigned int",
2913 long_unsigned_type_node);
2914 if (c_dialect_cxx ())
2915 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
2916 record_builtin_type (RID_MAX, "long long int",
2917 long_long_integer_type_node);
2918 record_builtin_type (RID_MAX, "long long unsigned int",
2919 long_long_unsigned_type_node);
2920 if (c_dialect_cxx ())
2921 record_builtin_type (RID_MAX, "long long unsigned",
2922 long_long_unsigned_type_node);
2923 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
2924 record_builtin_type (RID_MAX, "short unsigned int",
2925 short_unsigned_type_node);
2926 if (c_dialect_cxx ())
2927 record_builtin_type (RID_MAX, "unsigned short",
2928 short_unsigned_type_node);
2930 /* Define both `signed char' and `unsigned char'. */
2931 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
2932 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
2934 /* These are types that c_common_type_for_size and
2935 c_common_type_for_mode use. */
2936 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2938 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2940 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2942 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2944 #if HOST_BITS_PER_WIDE_INT >= 64
2945 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2946 get_identifier ("__int128_t"),
2949 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2950 unsigned_intQI_type_node));
2951 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2952 unsigned_intHI_type_node));
2953 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2954 unsigned_intSI_type_node));
2955 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2956 unsigned_intDI_type_node));
2957 #if HOST_BITS_PER_WIDE_INT >= 64
2958 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2959 get_identifier ("__uint128_t"),
2960 unsigned_intTI_type_node));
2963 /* Create the widest literal types. */
2964 widest_integer_literal_type_node
2965 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
2966 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2967 widest_integer_literal_type_node));
2969 widest_unsigned_literal_type_node
2970 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
2971 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2972 widest_unsigned_literal_type_node));
2974 /* `unsigned long' is the standard type for sizeof.
2975 Note that stddef.h uses `unsigned long',
2976 and this must agree, even if long and int are the same size. */
2978 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
2979 signed_size_type_node = c_common_signed_type (size_type_node);
2980 set_sizetype (size_type_node);
2983 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
2985 build_common_tree_nodes_2 (flag_short_double);
2987 record_builtin_type (RID_FLOAT, NULL, float_type_node);
2988 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
2989 record_builtin_type (RID_MAX, "long double", long_double_type_node);
2991 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2992 get_identifier ("complex int"),
2993 complex_integer_type_node));
2994 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2995 get_identifier ("complex float"),
2996 complex_float_type_node));
2997 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2998 get_identifier ("complex double"),
2999 complex_double_type_node));
3000 lang_hooks.decls.pushdecl
3001 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3002 complex_long_double_type_node));
3004 if (c_dialect_cxx ())
3005 /* For C++, make fileptr_type_node a distinct void * type until
3006 FILE type is defined. */
3007 fileptr_type_node = build_type_copy (ptr_type_node);
3009 record_builtin_type (RID_VOID, NULL, void_type_node);
3011 void_zero_node = build_int_2 (0, 0);
3012 TREE_TYPE (void_zero_node) = void_type_node;
3014 void_list_node = build_void_list_node ();
3016 /* Make a type to be the domain of a few array types
3017 whose domains don't really matter.
3018 200 is small enough that it always fits in size_t
3019 and large enough that it can hold most function names for the
3020 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3021 array_domain_type = build_index_type (size_int (200));
3023 /* Make a type for arrays of characters.
3024 With luck nothing will ever really depend on the length of this
3026 char_array_type_node
3027 = build_array_type (char_type_node, array_domain_type);
3029 /* Likewise for arrays of ints. */
3031 = build_array_type (integer_type_node, array_domain_type);
3033 string_type_node = build_pointer_type (char_type_node);
3034 const_string_type_node
3035 = build_pointer_type (build_qualified_type
3036 (char_type_node, TYPE_QUAL_CONST));
3038 /* This is special for C++ so functions can be overloaded. */
3039 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3040 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3041 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3042 if (c_dialect_cxx ())
3044 if (TYPE_UNSIGNED (wchar_type_node))
3045 wchar_type_node = make_unsigned_type (wchar_type_size);
3047 wchar_type_node = make_signed_type (wchar_type_size);
3048 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3052 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3053 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3056 /* This is for wide string constants. */
3057 wchar_array_type_node
3058 = build_array_type (wchar_type_node, array_domain_type);
3061 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3064 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3066 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3068 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3070 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3071 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3073 lang_hooks.decls.pushdecl
3074 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3075 va_list_type_node));
3077 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3079 va_list_arg_type_node = va_list_ref_type_node =
3080 build_pointer_type (TREE_TYPE (va_list_type_node));
3084 va_list_arg_type_node = va_list_type_node;
3085 va_list_ref_type_node = build_reference_type (va_list_type_node);
3088 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3089 builtin_types[(int) ENUM] = VALUE;
3090 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3091 builtin_types[(int) ENUM] \
3092 = build_function_type (builtin_types[(int) RETURN], \
3094 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3095 builtin_types[(int) ENUM] \
3096 = build_function_type (builtin_types[(int) RETURN], \
3097 tree_cons (NULL_TREE, \
3098 builtin_types[(int) ARG1], \
3100 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3101 builtin_types[(int) ENUM] \
3102 = build_function_type \
3103 (builtin_types[(int) RETURN], \
3104 tree_cons (NULL_TREE, \
3105 builtin_types[(int) ARG1], \
3106 tree_cons (NULL_TREE, \
3107 builtin_types[(int) ARG2], \
3109 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3110 builtin_types[(int) ENUM] \
3111 = build_function_type \
3112 (builtin_types[(int) RETURN], \
3113 tree_cons (NULL_TREE, \
3114 builtin_types[(int) ARG1], \
3115 tree_cons (NULL_TREE, \
3116 builtin_types[(int) ARG2], \
3117 tree_cons (NULL_TREE, \
3118 builtin_types[(int) ARG3], \
3120 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3121 builtin_types[(int) ENUM] \
3122 = build_function_type \
3123 (builtin_types[(int) RETURN], \
3124 tree_cons (NULL_TREE, \
3125 builtin_types[(int) ARG1], \
3126 tree_cons (NULL_TREE, \
3127 builtin_types[(int) ARG2], \
3130 builtin_types[(int) ARG3], \
3131 tree_cons (NULL_TREE, \
3132 builtin_types[(int) ARG4], \
3133 void_list_node)))));
3134 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3135 builtin_types[(int) ENUM] \
3136 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3137 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3138 builtin_types[(int) ENUM] \
3139 = build_function_type (builtin_types[(int) RETURN], \
3140 tree_cons (NULL_TREE, \
3141 builtin_types[(int) ARG1], \
3144 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3145 builtin_types[(int) ENUM] \
3146 = build_function_type \
3147 (builtin_types[(int) RETURN], \
3148 tree_cons (NULL_TREE, \
3149 builtin_types[(int) ARG1], \
3150 tree_cons (NULL_TREE, \
3151 builtin_types[(int) ARG2], \
3154 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3155 builtin_types[(int) ENUM] \
3156 = build_function_type \
3157 (builtin_types[(int) RETURN], \
3158 tree_cons (NULL_TREE, \
3159 builtin_types[(int) ARG1], \
3160 tree_cons (NULL_TREE, \
3161 builtin_types[(int) ARG2], \
3162 tree_cons (NULL_TREE, \
3163 builtin_types[(int) ARG3], \
3166 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3167 builtin_types[(int) ENUM] \
3168 = build_pointer_type (builtin_types[(int) TYPE]);
3169 #include "builtin-types.def"
3170 #undef DEF_PRIMITIVE_TYPE
3171 #undef DEF_FUNCTION_TYPE_1
3172 #undef DEF_FUNCTION_TYPE_2
3173 #undef DEF_FUNCTION_TYPE_3
3174 #undef DEF_FUNCTION_TYPE_4
3175 #undef DEF_FUNCTION_TYPE_VAR_0
3176 #undef DEF_FUNCTION_TYPE_VAR_1
3177 #undef DEF_FUNCTION_TYPE_VAR_2
3178 #undef DEF_FUNCTION_TYPE_VAR_3
3179 #undef DEF_POINTER_TYPE
3181 c_init_attributes ();
3183 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3184 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3189 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3193 decl = lang_hooks.builtin_function (NAME, builtin_types[TYPE], \
3197 ? (NAME + strlen ("__builtin_")) \
3199 built_in_attributes[(int) ATTRS]); \
3201 decl = builtin_function_2 (NAME, \
3202 NAME + strlen ("__builtin_"), \
3203 builtin_types[TYPE], \
3204 builtin_types[LIBTYPE], \
3209 built_in_attributes[(int) ATTRS]); \
3211 built_in_decls[(int) ENUM] = decl; \
3213 implicit_built_in_decls[(int) ENUM] = decl; \
3215 #include "builtins.def"
3218 targetm.init_builtins ();
3222 main_identifier_node = get_identifier ("main");
3226 build_va_arg (tree expr, tree type)
3228 return build1 (VA_ARG_EXPR, type, expr);
3232 /* Linked list of disabled built-in functions. */
3234 typedef struct disabled_builtin
3237 struct disabled_builtin *next;
3239 static disabled_builtin *disabled_builtins = NULL;
3241 static bool builtin_function_disabled_p (const char *);
3243 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3244 begins with "__builtin_", give an error. */
3247 disable_builtin_function (const char *name)
3249 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3250 error ("cannot disable built-in function `%s'", name);
3253 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3254 new_disabled_builtin->name = name;
3255 new_disabled_builtin->next = disabled_builtins;
3256 disabled_builtins = new_disabled_builtin;
3261 /* Return true if the built-in function NAME has been disabled, false
3265 builtin_function_disabled_p (const char *name)
3267 disabled_builtin *p;
3268 for (p = disabled_builtins; p != NULL; p = p->next)
3270 if (strcmp (name, p->name) == 0)
3277 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3278 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3279 of these may be NULL (though both being NULL is useless).
3280 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3281 TYPE is the type of the function with the ordinary name. These
3282 may differ if the ordinary name is declared with a looser type to avoid
3283 conflicts with headers. FUNCTION_CODE and CL are as for
3284 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3285 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3286 If NONANSI_P is true, the name NAME is treated as a non-ANSI name;
3287 ATTRS is the tree list representing the builtin's function attributes.
3288 Returns the declaration of BUILTIN_NAME, if any, otherwise
3289 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3290 or if NONANSI_P and flag_no_nonansi_builtin. */
3293 builtin_function_2 (const char *builtin_name, const char *name,
3294 tree builtin_type, tree type,
3295 enum built_in_function function_code,
3296 enum built_in_class cl, int library_name_p,
3297 bool nonansi_p, tree attrs)
3299 tree bdecl = NULL_TREE;
3300 tree decl = NULL_TREE;
3302 if (builtin_name != 0)
3303 bdecl = lang_hooks.builtin_function (builtin_name, builtin_type,
3305 library_name_p ? name : NULL, attrs);
3307 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3308 && !(nonansi_p && flag_no_nonansi_builtin))
3309 decl = lang_hooks.builtin_function (name, type, function_code, cl,
3312 return (bdecl != 0 ? bdecl : decl);
3315 /* Nonzero if the type T promotes to int. This is (nearly) the
3316 integral promotions defined in ISO C99 6.3.1.1/2. */
3319 c_promoting_integer_type_p (tree t)
3321 switch (TREE_CODE (t))
3324 return (TYPE_MAIN_VARIANT (t) == char_type_node
3325 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3326 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3327 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3328 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3329 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3332 /* ??? Technically all enumerations not larger than an int
3333 promote to an int. But this is used along code paths
3334 that only want to notice a size change. */
3335 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3345 /* Return 1 if PARMS specifies a fixed number of parameters
3346 and none of their types is affected by default promotions. */
3349 self_promoting_args_p (tree parms)
3352 for (t = parms; t; t = TREE_CHAIN (t))
3354 tree type = TREE_VALUE (t);
3356 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3362 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3365 if (c_promoting_integer_type_p (type))
3371 /* Recursively examines the array elements of TYPE, until a non-array
3372 element type is found. */
3375 strip_array_types (tree type)
3377 while (TREE_CODE (type) == ARRAY_TYPE)
3378 type = TREE_TYPE (type);
3383 /* Recursively remove any '*' or '&' operator from TYPE. */
3385 strip_pointer_operator (tree t)
3387 while (POINTER_TYPE_P (t))
3392 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3393 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3394 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3395 value, the traversal is aborted, and the value returned by FUNC is
3396 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3397 the node being visited are not walked.
3399 We don't need a without_duplicates variant of this one because the
3400 statement tree is a tree, not a graph. */
3403 walk_stmt_tree (tree *tp, walk_tree_fn func, void *data)
3405 enum tree_code code;
3410 #define WALK_SUBTREE(NODE) \
3413 result = walk_stmt_tree (&(NODE), func, data); \
3419 /* Skip empty subtrees. */
3423 /* Skip subtrees below non-statement nodes. */
3424 if (!STATEMENT_CODE_P (TREE_CODE (*tp)))
3427 /* Call the function. */
3429 result = (*func) (tp, &walk_subtrees, data);
3431 /* If we found something, return it. */
3435 /* FUNC may have modified the tree, recheck that we're looking at a
3437 code = TREE_CODE (*tp);
3438 if (!STATEMENT_CODE_P (code))
3441 /* Visit the subtrees unless FUNC decided that there was nothing
3442 interesting below this point in the tree. */
3445 /* Walk over all the sub-trees of this operand. Statement nodes
3446 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3447 len = TREE_CODE_LENGTH (code);
3449 /* Go through the subtrees. We need to do this in forward order so
3450 that the scope of a FOR_EXPR is handled properly. */
3451 for (i = 0; i < len; ++i)
3452 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3455 /* Finally visit the chain. This can be tail-recursion optimized if
3456 we write it this way. */
3457 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3462 /* Used to compare case labels. K1 and K2 are actually tree nodes
3463 representing case labels, or NULL_TREE for a `default' label.
3464 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3465 K2, and 0 if K1 and K2 are equal. */
3468 case_compare (splay_tree_key k1, splay_tree_key k2)
3470 /* Consider a NULL key (such as arises with a `default' label) to be
3471 smaller than anything else. */
3477 return tree_int_cst_compare ((tree) k1, (tree) k2);
3480 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3481 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3482 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3483 case label was declared using the usual C/C++ syntax, rather than
3484 the GNU case range extension. CASES is a tree containing all the
3485 case ranges processed so far; COND is the condition for the
3486 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3487 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3490 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3491 tree low_value, tree high_value)
3496 splay_tree_node node;
3498 /* Create the LABEL_DECL itself. */
3499 label = create_artificial_label ();
3501 /* If there was an error processing the switch condition, bail now
3502 before we get more confused. */
3503 if (!cond || cond == error_mark_node)
3506 if ((low_value && TREE_TYPE (low_value)
3507 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3508 || (high_value && TREE_TYPE (high_value)
3509 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3510 error ("pointers are not permitted as case values");
3512 /* Case ranges are a GNU extension. */
3513 if (high_value && pedantic)
3514 pedwarn ("range expressions in switch statements are non-standard");
3516 type = TREE_TYPE (cond);
3519 low_value = check_case_value (low_value);
3520 low_value = convert_and_check (type, low_value);
3524 high_value = check_case_value (high_value);
3525 high_value = convert_and_check (type, high_value);
3528 /* If an error has occurred, bail out now. */
3529 if (low_value == error_mark_node || high_value == error_mark_node)
3532 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3533 really a case range, even though it was written that way. Remove
3534 the HIGH_VALUE to simplify later processing. */
3535 if (tree_int_cst_equal (low_value, high_value))
3536 high_value = NULL_TREE;
3537 if (low_value && high_value
3538 && !tree_int_cst_lt (low_value, high_value))
3539 warning ("empty range specified");
3541 /* See if the case is in range of the type of the original testing
3542 expression. If both low_value and high_value are out of range,
3543 don't insert the case label and return NULL_TREE. */
3545 && ! check_case_bounds (type, orig_type,
3546 &low_value, high_value ? &high_value : NULL))
3549 /* Look up the LOW_VALUE in the table of case labels we already
3551 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3552 /* If there was not an exact match, check for overlapping ranges.
3553 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3554 that's a `default' label and the only overlap is an exact match. */
3555 if (!node && (low_value || high_value))
3557 splay_tree_node low_bound;
3558 splay_tree_node high_bound;
3560 /* Even though there wasn't an exact match, there might be an
3561 overlap between this case range and another case range.
3562 Since we've (inductively) not allowed any overlapping case
3563 ranges, we simply need to find the greatest low case label
3564 that is smaller that LOW_VALUE, and the smallest low case
3565 label that is greater than LOW_VALUE. If there is an overlap
3566 it will occur in one of these two ranges. */
3567 low_bound = splay_tree_predecessor (cases,
3568 (splay_tree_key) low_value);
3569 high_bound = splay_tree_successor (cases,
3570 (splay_tree_key) low_value);
3572 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3573 the LOW_VALUE, so there is no need to check unless the
3574 LOW_BOUND is in fact itself a case range. */
3576 && CASE_HIGH ((tree) low_bound->value)
3577 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3580 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3581 range is bigger than the low end of the current range, so we
3582 are only interested if the current range is a real range, and
3583 not an ordinary case label. */
3586 && (tree_int_cst_compare ((tree) high_bound->key,
3591 /* If there was an overlap, issue an error. */
3594 tree duplicate = CASE_LABEL ((tree) node->value);
3598 error ("duplicate (or overlapping) case value");
3599 error ("%Jthis is the first entry overlapping that value", duplicate);
3603 error ("duplicate case value") ;
3604 error ("%Jpreviously used here", duplicate);
3608 error ("multiple default labels in one switch");
3609 error ("%Jthis is the first default label", duplicate);
3614 /* Add a CASE_LABEL to the statement-tree. */
3615 case_label = add_stmt (build_case_label (low_value, high_value, label));
3616 /* Register this case label in the splay tree. */
3617 splay_tree_insert (cases,
3618 (splay_tree_key) low_value,
3619 (splay_tree_value) case_label);
3624 /* Add a label so that the back-end doesn't think that the beginning of
3625 the switch is unreachable. Note that we do not add a case label, as
3626 that just leads to duplicates and thence to aborts later on. */
3629 tree t = create_artificial_label ();
3630 add_stmt (build_stmt (LABEL_EXPR, t));
3632 return error_mark_node;
3635 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3636 Used to verify that case values match up with enumerator values. */
3639 match_case_to_enum_1 (tree key, tree type, tree label)
3641 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3643 /* ??? Not working too hard to print the double-word value.
3644 Should perhaps be done with %lwd in the diagnostic routines? */
3645 if (TREE_INT_CST_HIGH (key) == 0)
3646 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3647 TREE_INT_CST_LOW (key));
3648 else if (!TYPE_UNSIGNED (type)
3649 && TREE_INT_CST_HIGH (key) == -1
3650 && TREE_INT_CST_LOW (key) != 0)
3651 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3652 -TREE_INT_CST_LOW (key));
3654 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3655 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3657 if (TYPE_NAME (type) == 0)
3658 warning ("%Jcase value `%s' not in enumerated type",
3659 CASE_LABEL (label), buf);
3661 warning ("%Jcase value `%s' not in enumerated type `%T'",
3662 CASE_LABEL (label), buf, type);
3666 match_case_to_enum (splay_tree_node node, void *data)
3668 tree label = (tree) node->value;
3669 tree type = (tree) data;
3671 /* Skip default case. */
3672 if (!CASE_LOW (label))
3675 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3676 when we did our enum->case scan. Reset our scratch bit after. */
3677 if (!TREE_ADDRESSABLE (label))
3678 match_case_to_enum_1 (CASE_LOW (label), type, label);
3680 TREE_ADDRESSABLE (label) = 0;
3682 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3683 Note that the old code in stmt.c did not check for the values in
3684 the range either, just the endpoints. */
3685 if (CASE_HIGH (label))
3687 tree chain, key = CASE_HIGH (label);
3689 for (chain = TYPE_VALUES (type);
3690 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
3691 chain = TREE_CHAIN (chain))
3694 match_case_to_enum_1 (key, type, label);
3700 /* Handle -Wswitch*. Called from the front end after parsing the switch
3702 /* ??? Should probably be somewhere generic, since other languages besides
3703 C and C++ would want this. We'd want to agree on the datastructure,
3704 however, which is a problem. Alternately, we operate on gimplified
3705 switch_exprs, which I don't especially like. At the moment, however,
3706 C/C++ are the only tree-ssa languages that support enumerations at all,
3707 so the point is moot. */
3710 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
3712 splay_tree_node default_node;
3713 location_t switch_location;
3716 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
3719 if (EXPR_HAS_LOCATION (switch_stmt))
3720 switch_location = EXPR_LOCATION (switch_stmt);
3722 switch_location = input_location;
3724 type = SWITCH_TYPE (switch_stmt);
3726 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3727 if (warn_switch_default && !default_node)
3728 warning ("%Hswitch missing default case", &switch_location);
3730 /* If the switch expression was an enumerated type, check that
3731 exactly all enumeration literals are covered by the cases.
3732 The check is made when -Wswitch was specified and there is no
3733 default case, or when -Wswitch-enum was specified. */
3734 if (((warn_switch && !default_node) || warn_switch_enum)
3735 && type && TREE_CODE (type) == ENUMERAL_TYPE
3736 && TREE_CODE (SWITCH_COND (switch_stmt)) != INTEGER_CST)
3740 /* The time complexity here is O(N*lg(N)) worst case, but for the
3741 common case of monotonically increasing enumerators, it is
3742 O(N), since the nature of the splay tree will keep the next
3743 element adjacent to the root at all times. */
3745 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
3747 splay_tree_node node
3748 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
3752 /* Mark the CASE_LOW part of the case entry as seen, so
3753 that we save time later. Choose TREE_ADDRESSABLE
3754 randomly as a bit that won't have been set to-date. */
3755 tree label = (tree) node->value;
3756 TREE_ADDRESSABLE (label) = 1;
3760 /* Warn if there are enumerators that don't correspond to
3761 case expressions. */
3762 warning ("%Henumeration value `%E' not handled in switch",
3763 &switch_location, TREE_PURPOSE (chain));
3767 /* Warn if there are case expressions that don't correspond to
3768 enumerators. This can occur since C and C++ don't enforce
3769 type-checking of assignments to enumeration variables.
3771 The time complexity here is O(N**2) worst case, since we've
3772 not sorted the enumeration values. However, in the absence
3773 of case ranges this is O(N), since all single cases that
3774 corresponded to enumerations have been marked above. */
3776 splay_tree_foreach (cases, match_case_to_enum, type);
3780 /* Finish an expression taking the address of LABEL (an
3781 IDENTIFIER_NODE). Returns an expression for the address. */
3784 finish_label_address_expr (tree label)
3789 pedwarn ("taking the address of a label is non-standard");
3791 if (label == error_mark_node)
3792 return error_mark_node;
3794 label = lookup_label (label);
3795 if (label == NULL_TREE)
3796 result = null_pointer_node;
3799 TREE_USED (label) = 1;
3800 result = build1 (ADDR_EXPR, ptr_type_node, label);
3801 /* The current function in not necessarily uninlinable.
3802 Computed gotos are incompatible with inlining, but the value
3803 here could be used only in a diagnostic, for example. */
3809 /* Hook used by expand_expr to expand language-specific tree codes. */
3810 /* The only things that should go here are bits needed to expand
3811 constant initializers. Everything else should be handled by the
3812 gimplification routines. */
3815 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
3816 int modifier /* Actually enum_modifier. */,
3819 switch (TREE_CODE (exp))
3821 case COMPOUND_LITERAL_EXPR:
3823 /* Initialize the anonymous variable declared in the compound
3824 literal, then return the variable. */
3825 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
3826 emit_local_var (decl);
3827 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
3835 /* Hook used by staticp to handle language-specific tree codes. */
3838 c_staticp (tree exp)
3840 if (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
3841 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp)))
3847 /* Given a boolean expression ARG, return a tree representing an increment
3848 or decrement (as indicated by CODE) of ARG. The front end must check for
3849 invalid cases (e.g., decrement in C++). */
3851 boolean_increment (enum tree_code code, tree arg)
3854 tree true_res = boolean_true_node;
3856 arg = stabilize_reference (arg);
3859 case PREINCREMENT_EXPR:
3860 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3862 case POSTINCREMENT_EXPR:
3863 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3864 arg = save_expr (arg);
3865 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3866 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3868 case PREDECREMENT_EXPR:
3869 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3870 invert_truthvalue (arg));
3872 case POSTDECREMENT_EXPR:
3873 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3874 invert_truthvalue (arg));
3875 arg = save_expr (arg);
3876 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3877 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3882 TREE_SIDE_EFFECTS (val) = 1;
3886 /* Built-in macros for stddef.h, that require macros defined in this
3889 c_stddef_cpp_builtins(void)
3891 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
3892 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
3893 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
3894 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
3895 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
3896 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
3900 c_init_attributes (void)
3902 /* Fill in the built_in_attributes array. */
3903 #define DEF_ATTR_NULL_TREE(ENUM) \
3904 built_in_attributes[(int) ENUM] = NULL_TREE;
3905 #define DEF_ATTR_INT(ENUM, VALUE) \
3906 built_in_attributes[(int) ENUM] = build_int_2 (VALUE, VALUE < 0 ? -1 : 0);
3907 #define DEF_ATTR_IDENT(ENUM, STRING) \
3908 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3909 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3910 built_in_attributes[(int) ENUM] \
3911 = tree_cons (built_in_attributes[(int) PURPOSE], \
3912 built_in_attributes[(int) VALUE], \
3913 built_in_attributes[(int) CHAIN]);
3914 #include "builtin-attrs.def"
3915 #undef DEF_ATTR_NULL_TREE
3917 #undef DEF_ATTR_IDENT
3918 #undef DEF_ATTR_TREE_LIST
3921 /* Attribute handlers common to C front ends. */
3923 /* Handle a "packed" attribute; arguments as in
3924 struct attribute_spec.handler. */
3927 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3928 int flags, bool *no_add_attrs)
3932 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3933 *node = build_type_copy (*node);
3934 TYPE_PACKED (*node) = 1;
3935 if (TYPE_MAIN_VARIANT (*node) == *node)
3937 /* If it is the main variant, then pack the other variants
3938 too. This happens in,
3941 struct Foo const *ptr; // creates a variant w/o packed flag
3942 } __ attribute__((packed)); // packs it now.
3946 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
3947 TYPE_PACKED (probe) = 1;
3951 else if (TREE_CODE (*node) == FIELD_DECL)
3952 DECL_PACKED (*node) = 1;
3953 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
3954 used for DECL_REGISTER. It wouldn't mean anything anyway.
3955 We can't set DECL_PACKED on the type of a TYPE_DECL, because
3956 that changes what the typedef is typing. */
3959 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3960 *no_add_attrs = true;
3966 /* Handle a "nocommon" attribute; arguments as in
3967 struct attribute_spec.handler. */
3970 handle_nocommon_attribute (tree *node, tree name,
3971 tree ARG_UNUSED (args),
3972 int ARG_UNUSED (flags), bool *no_add_attrs)
3974 if (TREE_CODE (*node) == VAR_DECL)
3975 DECL_COMMON (*node) = 0;
3978 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3979 *no_add_attrs = true;
3985 /* Handle a "common" attribute; arguments as in
3986 struct attribute_spec.handler. */
3989 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3990 int ARG_UNUSED (flags), bool *no_add_attrs)
3992 if (TREE_CODE (*node) == VAR_DECL)
3993 DECL_COMMON (*node) = 1;
3996 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3997 *no_add_attrs = true;
4003 /* Handle a "noreturn" attribute; arguments as in
4004 struct attribute_spec.handler. */
4007 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4008 int ARG_UNUSED (flags), bool *no_add_attrs)
4010 tree type = TREE_TYPE (*node);
4012 /* See FIXME comment in c_common_attribute_table. */
4013 if (TREE_CODE (*node) == FUNCTION_DECL)
4014 TREE_THIS_VOLATILE (*node) = 1;
4015 else if (TREE_CODE (type) == POINTER_TYPE
4016 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4018 = build_pointer_type
4019 (build_type_variant (TREE_TYPE (type),
4020 TYPE_READONLY (TREE_TYPE (type)), 1));
4023 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4024 *no_add_attrs = true;
4030 /* Handle a "noinline" attribute; arguments as in
4031 struct attribute_spec.handler. */
4034 handle_noinline_attribute (tree *node, tree name,
4035 tree ARG_UNUSED (args),
4036 int ARG_UNUSED (flags), bool *no_add_attrs)
4038 if (TREE_CODE (*node) == FUNCTION_DECL)
4039 DECL_UNINLINABLE (*node) = 1;
4042 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4043 *no_add_attrs = true;
4049 /* Handle a "always_inline" attribute; arguments as in
4050 struct attribute_spec.handler. */
4053 handle_always_inline_attribute (tree *node, tree name,
4054 tree ARG_UNUSED (args),
4055 int ARG_UNUSED (flags),
4058 if (TREE_CODE (*node) == FUNCTION_DECL)
4060 /* Do nothing else, just set the attribute. We'll get at
4061 it later with lookup_attribute. */
4065 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4066 *no_add_attrs = true;
4072 /* Handle a "used" attribute; arguments as in
4073 struct attribute_spec.handler. */
4076 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4077 int ARG_UNUSED (flags), bool *no_add_attrs)
4081 if (TREE_CODE (node) == FUNCTION_DECL
4082 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4084 TREE_USED (node) = 1;
4088 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4089 *no_add_attrs = true;
4095 /* Handle a "unused" attribute; arguments as in
4096 struct attribute_spec.handler. */
4099 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4100 int flags, bool *no_add_attrs)
4106 if (TREE_CODE (decl) == PARM_DECL
4107 || TREE_CODE (decl) == VAR_DECL
4108 || TREE_CODE (decl) == FUNCTION_DECL
4109 || TREE_CODE (decl) == LABEL_DECL
4110 || TREE_CODE (decl) == TYPE_DECL)
4111 TREE_USED (decl) = 1;
4114 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4115 *no_add_attrs = true;
4120 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4121 *node = build_type_copy (*node);
4122 TREE_USED (*node) = 1;
4128 /* Handle a "const" attribute; arguments as in
4129 struct attribute_spec.handler. */
4132 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4133 int ARG_UNUSED (flags), bool *no_add_attrs)
4135 tree type = TREE_TYPE (*node);
4137 /* See FIXME comment on noreturn in c_common_attribute_table. */
4138 if (TREE_CODE (*node) == FUNCTION_DECL)
4139 TREE_READONLY (*node) = 1;
4140 else if (TREE_CODE (type) == POINTER_TYPE
4141 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4143 = build_pointer_type
4144 (build_type_variant (TREE_TYPE (type), 1,
4145 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4148 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4149 *no_add_attrs = true;
4155 /* Handle a "transparent_union" attribute; arguments as in
4156 struct attribute_spec.handler. */
4159 handle_transparent_union_attribute (tree *node, tree name,
4160 tree ARG_UNUSED (args), int flags,
4163 tree decl = NULL_TREE;
4170 type = &TREE_TYPE (decl);
4171 is_type = TREE_CODE (*node) == TYPE_DECL;
4173 else if (TYPE_P (*node))
4174 type = node, is_type = 1;
4177 && TREE_CODE (*type) == UNION_TYPE
4179 || (TYPE_FIELDS (*type) != 0
4180 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4182 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4183 *type = build_type_copy (*type);
4184 TYPE_TRANSPARENT_UNION (*type) = 1;
4186 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4187 && TREE_CODE (*type) == UNION_TYPE
4188 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4189 DECL_TRANSPARENT_UNION (decl) = 1;
4192 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4193 *no_add_attrs = true;
4199 /* Handle a "constructor" attribute; arguments as in
4200 struct attribute_spec.handler. */
4203 handle_constructor_attribute (tree *node, tree name,
4204 tree ARG_UNUSED (args),
4205 int ARG_UNUSED (flags),
4209 tree type = TREE_TYPE (decl);
4211 if (TREE_CODE (decl) == FUNCTION_DECL
4212 && TREE_CODE (type) == FUNCTION_TYPE
4213 && decl_function_context (decl) == 0)
4215 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4216 TREE_USED (decl) = 1;
4220 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4221 *no_add_attrs = true;
4227 /* Handle a "destructor" attribute; arguments as in
4228 struct attribute_spec.handler. */
4231 handle_destructor_attribute (tree *node, tree name,
4232 tree ARG_UNUSED (args),
4233 int ARG_UNUSED (flags),
4237 tree type = TREE_TYPE (decl);
4239 if (TREE_CODE (decl) == FUNCTION_DECL
4240 && TREE_CODE (type) == FUNCTION_TYPE
4241 && decl_function_context (decl) == 0)
4243 DECL_STATIC_DESTRUCTOR (decl) = 1;
4244 TREE_USED (decl) = 1;
4248 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4249 *no_add_attrs = true;
4255 /* Handle a "mode" attribute; arguments as in
4256 struct attribute_spec.handler. */
4259 handle_mode_attribute (tree *node, tree name, tree args,
4260 int ARG_UNUSED (flags), bool *no_add_attrs)
4264 *no_add_attrs = true;
4266 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4267 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4271 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4272 int len = strlen (p);
4273 enum machine_mode mode = VOIDmode;
4277 if (len > 4 && p[0] == '_' && p[1] == '_'
4278 && p[len - 1] == '_' && p[len - 2] == '_')
4280 char *newp = (char *) alloca (len - 1);
4282 strcpy (newp, &p[2]);
4283 newp[len - 4] = '\0';
4287 /* Change this type to have a type with the specified mode.
4288 First check for the special modes. */
4289 if (! strcmp (p, "byte"))
4291 else if (!strcmp (p, "word"))
4293 else if (! strcmp (p, "pointer"))
4296 for (j = 0; j < NUM_MACHINE_MODES; j++)
4297 if (!strcmp (p, GET_MODE_NAME (j)))
4298 mode = (enum machine_mode) j;
4300 if (mode == VOIDmode)
4302 error ("unknown machine mode `%s'", p);
4306 if (VECTOR_MODE_P (mode))
4308 warning ("specifying vector types with __attribute__ ((mode)) "
4310 warning ("use __attribute__ ((vector_size)) instead");
4313 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4314 if (typefm == NULL_TREE)
4315 error ("no data type for mode `%s'", p);
4317 else if ((TREE_CODE (type) == POINTER_TYPE
4318 || TREE_CODE (type) == REFERENCE_TYPE)
4319 && !targetm.valid_pointer_mode (mode))
4320 error ("invalid pointer mode `%s'", p);
4323 /* If this is a vector, make sure we either have hardware
4324 support, or we can emulate it. */
4325 if (VECTOR_MODE_P (mode) && !vector_mode_valid_p (mode))
4327 error ("unable to emulate '%s'", GET_MODE_NAME (mode));
4331 if (TREE_CODE (type) == POINTER_TYPE)
4333 ptr_type = build_pointer_type_for_mode (TREE_TYPE (type),
4337 else if (TREE_CODE (type) == REFERENCE_TYPE)
4339 ptr_type = build_reference_type_for_mode (TREE_TYPE (type),
4345 /* No need to layout the type here. The caller should do this. */
4352 /* Handle a "section" attribute; arguments as in
4353 struct attribute_spec.handler. */
4356 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4357 int ARG_UNUSED (flags), bool *no_add_attrs)
4361 if (targetm.have_named_sections)
4363 if ((TREE_CODE (decl) == FUNCTION_DECL
4364 || TREE_CODE (decl) == VAR_DECL)
4365 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4367 if (TREE_CODE (decl) == VAR_DECL
4368 && current_function_decl != NULL_TREE
4369 && ! TREE_STATIC (decl))
4371 error ("%Jsection attribute cannot be specified for "
4372 "local variables", decl);
4373 *no_add_attrs = true;
4376 /* The decl may have already been given a section attribute
4377 from a previous declaration. Ensure they match. */
4378 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4379 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4380 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4382 error ("%Jsection of '%D' conflicts with previous declaration",
4384 *no_add_attrs = true;
4387 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4391 error ("%Jsection attribute not allowed for '%D'", *node, *node);
4392 *no_add_attrs = true;
4397 error ("%Jsection attributes are not supported for this target", *node);
4398 *no_add_attrs = true;
4404 /* Handle a "aligned" attribute; arguments as in
4405 struct attribute_spec.handler. */
4408 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4409 int flags, bool *no_add_attrs)
4411 tree decl = NULL_TREE;
4414 tree align_expr = (args ? TREE_VALUE (args)
4415 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4421 type = &TREE_TYPE (decl);
4422 is_type = TREE_CODE (*node) == TYPE_DECL;
4424 else if (TYPE_P (*node))
4425 type = node, is_type = 1;
4427 /* Strip any NOPs of any kind. */
4428 while (TREE_CODE (align_expr) == NOP_EXPR
4429 || TREE_CODE (align_expr) == CONVERT_EXPR
4430 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4431 align_expr = TREE_OPERAND (align_expr, 0);
4433 if (TREE_CODE (align_expr) != INTEGER_CST)
4435 error ("requested alignment is not a constant");
4436 *no_add_attrs = true;
4438 else if ((i = tree_log2 (align_expr)) == -1)
4440 error ("requested alignment is not a power of 2");
4441 *no_add_attrs = true;
4443 else if (i > HOST_BITS_PER_INT - 2)
4445 error ("requested alignment is too large");
4446 *no_add_attrs = true;
4450 /* If we have a TYPE_DECL, then copy the type, so that we
4451 don't accidentally modify a builtin type. See pushdecl. */
4452 if (decl && TREE_TYPE (decl) != error_mark_node
4453 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4455 tree tt = TREE_TYPE (decl);
4456 *type = build_type_copy (*type);
4457 DECL_ORIGINAL_TYPE (decl) = tt;
4458 TYPE_NAME (*type) = decl;
4459 TREE_USED (*type) = TREE_USED (decl);
4460 TREE_TYPE (decl) = *type;
4462 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4463 *type = build_type_copy (*type);
4465 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4466 TYPE_USER_ALIGN (*type) = 1;
4468 else if (TREE_CODE (decl) != VAR_DECL
4469 && TREE_CODE (decl) != FIELD_DECL)
4471 error ("%Jalignment may not be specified for '%D'", decl, decl);
4472 *no_add_attrs = true;
4476 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4477 DECL_USER_ALIGN (decl) = 1;
4483 /* Handle a "weak" attribute; arguments as in
4484 struct attribute_spec.handler. */
4487 handle_weak_attribute (tree *node, tree ARG_UNUSED (name),
4488 tree ARG_UNUSED (args),
4489 int ARG_UNUSED (flags),
4490 bool * ARG_UNUSED (no_add_attrs))
4492 declare_weak (*node);
4497 /* Handle an "alias" attribute; arguments as in
4498 struct attribute_spec.handler. */
4501 handle_alias_attribute (tree *node, tree name, tree args,
4502 int ARG_UNUSED (flags), bool *no_add_attrs)
4506 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4507 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
4509 error ("%J'%D' defined both normally and as an alias", decl, decl);
4510 *no_add_attrs = true;
4513 /* Note that the very first time we process a nested declaration,
4514 decl_function_context will not be set. Indeed, *would* never
4515 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4516 we do below. After such frobbery, pushdecl would set the context.
4517 In any case, this is never what we want. */
4518 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4522 id = TREE_VALUE (args);
4523 if (TREE_CODE (id) != STRING_CST)
4525 error ("alias arg not a string");
4526 *no_add_attrs = true;
4529 id = get_identifier (TREE_STRING_POINTER (id));
4530 /* This counts as a use of the object pointed to. */
4533 if (TREE_CODE (decl) == FUNCTION_DECL)
4534 DECL_INITIAL (decl) = error_mark_node;
4537 DECL_EXTERNAL (decl) = 0;
4538 TREE_STATIC (decl) = 1;
4543 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4544 *no_add_attrs = true;
4550 /* Handle an "visibility" attribute; arguments as in
4551 struct attribute_spec.handler. */
4554 handle_visibility_attribute (tree *node, tree name, tree args,
4555 int ARG_UNUSED (flags),
4559 tree id = TREE_VALUE (args);
4561 *no_add_attrs = true;
4565 if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
4567 warning ("`%s' attribute ignored on non-class types",
4568 IDENTIFIER_POINTER (name));
4572 else if (decl_function_context (decl) != 0 || ! TREE_PUBLIC (decl))
4574 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4578 if (TREE_CODE (id) != STRING_CST)
4580 error ("visibility arg not a string");
4584 /* If this is a type, set the visibility on the type decl. */
4587 decl = TYPE_NAME (decl);
4592 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4593 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4594 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4595 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4596 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4597 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4598 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4599 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4601 error ("visibility arg must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4602 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4604 /* For decls only, go ahead and attach the attribute to the node as well.
4605 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4606 because the visibility was not specified, or because it was explicitly
4607 overridden from the class visibility. */
4609 *no_add_attrs = false;
4614 /* Determine the ELF symbol visibility for DECL, which is either a
4615 variable or a function. It is an error to use this function if a
4616 definition of DECL is not available in this translation unit.
4617 Returns true if the final visibility has been determined by this
4618 function; false if the caller is free to make additional
4622 c_determine_visibility (tree decl)
4624 my_friendly_assert (TREE_CODE (decl) == VAR_DECL
4625 || TREE_CODE (decl) == FUNCTION_DECL,
4628 /* If the user explicitly specified the visibility with an
4629 attribute, honor that. DECL_VISIBILITY will have been set during
4630 the processing of the attribute. We check for an explicit
4631 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4632 to distinguish the use of an attribute from the use of a "#pragma
4633 GCC visibility push(...)"; in the latter case we still want other
4634 considerations to be able to overrule the #pragma. */
4635 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
4638 /* Anything that is exported must have default visibility. */
4639 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4640 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
4642 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4643 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4650 /* Handle an "tls_model" attribute; arguments as in
4651 struct attribute_spec.handler. */
4654 handle_tls_model_attribute (tree *node, tree name, tree args,
4655 int ARG_UNUSED (flags), bool *no_add_attrs)
4659 if (! DECL_THREAD_LOCAL (decl))
4661 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4662 *no_add_attrs = true;
4668 id = TREE_VALUE (args);
4669 if (TREE_CODE (id) != STRING_CST)
4671 error ("tls_model arg not a string");
4672 *no_add_attrs = true;
4675 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4676 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4677 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4678 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4680 error ("tls_model arg must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4681 *no_add_attrs = true;
4689 /* Handle a "no_instrument_function" attribute; arguments as in
4690 struct attribute_spec.handler. */
4693 handle_no_instrument_function_attribute (tree *node, tree name,
4694 tree ARG_UNUSED (args),
4695 int ARG_UNUSED (flags),
4700 if (TREE_CODE (decl) != FUNCTION_DECL)
4702 error ("%J'%E' attribute applies only to functions", decl, name);
4703 *no_add_attrs = true;
4705 else if (DECL_INITIAL (decl))
4707 error ("%Jcan't set '%E' attribute after definition", decl, name);
4708 *no_add_attrs = true;
4711 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4716 /* Handle a "malloc" attribute; arguments as in
4717 struct attribute_spec.handler. */
4720 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4721 int ARG_UNUSED (flags), bool *no_add_attrs)
4723 if (TREE_CODE (*node) == FUNCTION_DECL)
4724 DECL_IS_MALLOC (*node) = 1;
4725 /* ??? TODO: Support types. */
4728 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4729 *no_add_attrs = true;
4735 /* Handle a "no_limit_stack" attribute; arguments as in
4736 struct attribute_spec.handler. */
4739 handle_no_limit_stack_attribute (tree *node, tree name,
4740 tree ARG_UNUSED (args),
4741 int ARG_UNUSED (flags),
4746 if (TREE_CODE (decl) != FUNCTION_DECL)
4748 error ("%J'%E' attribute applies only to functions", decl, name);
4749 *no_add_attrs = true;
4751 else if (DECL_INITIAL (decl))
4753 error ("%Jcan't set '%E' attribute after definition", decl, name);
4754 *no_add_attrs = true;
4757 DECL_NO_LIMIT_STACK (decl) = 1;
4762 /* Handle a "pure" attribute; arguments as in
4763 struct attribute_spec.handler. */
4766 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4767 int ARG_UNUSED (flags), bool *no_add_attrs)
4769 if (TREE_CODE (*node) == FUNCTION_DECL)
4770 DECL_IS_PURE (*node) = 1;
4771 /* ??? TODO: Support types. */
4774 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4775 *no_add_attrs = true;
4781 /* Handle a "deprecated" attribute; arguments as in
4782 struct attribute_spec.handler. */
4785 handle_deprecated_attribute (tree *node, tree name,
4786 tree ARG_UNUSED (args), int flags,
4789 tree type = NULL_TREE;
4791 const char *what = NULL;
4796 type = TREE_TYPE (decl);
4798 if (TREE_CODE (decl) == TYPE_DECL
4799 || TREE_CODE (decl) == PARM_DECL
4800 || TREE_CODE (decl) == VAR_DECL
4801 || TREE_CODE (decl) == FUNCTION_DECL
4802 || TREE_CODE (decl) == FIELD_DECL)
4803 TREE_DEPRECATED (decl) = 1;
4807 else if (TYPE_P (*node))
4809 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4810 *node = build_type_copy (*node);
4811 TREE_DEPRECATED (*node) = 1;
4819 *no_add_attrs = true;
4820 if (type && TYPE_NAME (type))
4822 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
4823 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
4824 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
4825 && DECL_NAME (TYPE_NAME (type)))
4826 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
4829 warning ("`%s' attribute ignored for `%s'",
4830 IDENTIFIER_POINTER (name), what);
4832 warning ("`%s' attribute ignored",
4833 IDENTIFIER_POINTER (name));
4839 /* Handle a "vector_size" attribute; arguments as in
4840 struct attribute_spec.handler. */
4843 handle_vector_size_attribute (tree *node, tree name, tree args,
4844 int ARG_UNUSED (flags),
4847 unsigned HOST_WIDE_INT vecsize, nunits;
4848 enum machine_mode orig_mode;
4849 tree type = *node, new_type, size;
4851 *no_add_attrs = true;
4853 /* Stripping NON_LVALUE_EXPR allows declarations such as
4854 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
4855 size = TREE_VALUE (args);
4856 if (TREE_CODE (size) == NON_LVALUE_EXPR)
4857 size = TREE_OPERAND (size, 0);
4859 if (! host_integerp (size, 1))
4861 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
4865 /* Get the vector size (in bytes). */
4866 vecsize = tree_low_cst (size, 1);
4868 /* We need to provide for vector pointers, vector arrays, and
4869 functions returning vectors. For example:
4871 __attribute__((vector_size(16))) short *foo;
4873 In this case, the mode is SI, but the type being modified is
4874 HI, so we need to look further. */
4876 while (POINTER_TYPE_P (type)
4877 || TREE_CODE (type) == FUNCTION_TYPE
4878 || TREE_CODE (type) == METHOD_TYPE
4879 || TREE_CODE (type) == ARRAY_TYPE)
4880 type = TREE_TYPE (type);
4882 /* Get the mode of the type being modified. */
4883 orig_mode = TYPE_MODE (type);
4885 if (TREE_CODE (type) == RECORD_TYPE
4886 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
4887 && GET_MODE_CLASS (orig_mode) != MODE_INT)
4888 || ! host_integerp (TYPE_SIZE_UNIT (type), 1))
4890 error ("invalid vector type for attribute `%s'",
4891 IDENTIFIER_POINTER (name));
4895 /* Calculate how many units fit in the vector. */
4896 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
4897 if (nunits & (nunits - 1))
4899 error ("number of components of the vector not a power of two");
4903 new_type = build_vector_type (type, nunits);
4905 /* Build back pointers if needed. */
4906 *node = reconstruct_complex_type (*node, new_type);
4911 /* Handle the "nonnull" attribute. */
4913 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
4914 tree args, int ARG_UNUSED (flags),
4918 unsigned HOST_WIDE_INT attr_arg_num;
4920 /* If no arguments are specified, all pointer arguments should be
4921 non-null. Verify a full prototype is given so that the arguments
4922 will have the correct types when we actually check them later. */
4925 if (! TYPE_ARG_TYPES (type))
4927 error ("nonnull attribute without arguments on a non-prototype");
4928 *no_add_attrs = true;
4933 /* Argument list specified. Verify that each argument number references
4934 a pointer argument. */
4935 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
4938 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
4940 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
4942 error ("nonnull argument has invalid operand number (arg %lu)",
4943 (unsigned long) attr_arg_num);
4944 *no_add_attrs = true;
4948 argument = TYPE_ARG_TYPES (type);
4951 for (ck_num = 1; ; ck_num++)
4953 if (! argument || ck_num == arg_num)
4955 argument = TREE_CHAIN (argument);
4959 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
4961 error ("nonnull argument with out-of-range operand number (arg %lu, operand %lu)",
4962 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4963 *no_add_attrs = true;
4967 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
4969 error ("nonnull argument references non-pointer operand (arg %lu, operand %lu)",
4970 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4971 *no_add_attrs = true;
4980 /* Check the argument list of a function call for null in argument slots
4981 that are marked as requiring a non-null pointer argument. */
4984 check_function_nonnull (tree attrs, tree params)
4986 tree a, args, param;
4989 for (a = attrs; a; a = TREE_CHAIN (a))
4991 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
4993 args = TREE_VALUE (a);
4995 /* Walk the argument list. If we encounter an argument number we
4996 should check for non-null, do it. If the attribute has no args,
4997 then every pointer argument is checked (in which case the check
4998 for pointer type is done in check_nonnull_arg). */
4999 for (param = params, param_num = 1; ;
5000 param_num++, param = TREE_CHAIN (param))
5004 if (! args || nonnull_check_p (args, param_num))
5005 check_function_arguments_recurse (check_nonnull_arg, NULL,
5013 /* Helper for check_function_nonnull; given a list of operands which
5014 must be non-null in ARGS, determine if operand PARAM_NUM should be
5018 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5020 unsigned HOST_WIDE_INT arg_num = 0;
5022 for (; args; args = TREE_CHAIN (args))
5024 if (! get_nonnull_operand (TREE_VALUE (args), &arg_num))
5027 if (arg_num == param_num)
5033 /* Check that the function argument PARAM (which is operand number
5034 PARAM_NUM) is non-null. This is called by check_function_nonnull
5035 via check_function_arguments_recurse. */
5038 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5039 unsigned HOST_WIDE_INT param_num)
5041 /* Just skip checking the argument if it's not a pointer. This can
5042 happen if the "nonnull" attribute was given without an operand
5043 list (which means to check every pointer argument). */
5045 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5048 if (integer_zerop (param))
5049 warning ("null argument where non-null required (arg %lu)",
5050 (unsigned long) param_num);
5053 /* Helper for nonnull attribute handling; fetch the operand number
5054 from the attribute argument list. */
5057 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5059 /* Strip any conversions from the arg number and verify they
5061 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5062 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5063 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5064 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5066 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5067 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5070 *valp = TREE_INT_CST_LOW (arg_num_expr);
5074 /* Handle a "nothrow" attribute; arguments as in
5075 struct attribute_spec.handler. */
5078 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5079 int ARG_UNUSED (flags), bool *no_add_attrs)
5081 if (TREE_CODE (*node) == FUNCTION_DECL)
5082 TREE_NOTHROW (*node) = 1;
5083 /* ??? TODO: Support types. */
5086 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5087 *no_add_attrs = true;
5093 /* Handle a "cleanup" attribute; arguments as in
5094 struct attribute_spec.handler. */
5097 handle_cleanup_attribute (tree *node, tree name, tree args,
5098 int ARG_UNUSED (flags), bool *no_add_attrs)
5101 tree cleanup_id, cleanup_decl;
5103 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5104 for global destructors in C++. This requires infrastructure that
5105 we don't have generically at the moment. It's also not a feature
5106 we'd be missing too much, since we do have attribute constructor. */
5107 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5109 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5110 *no_add_attrs = true;
5114 /* Verify that the argument is a function in scope. */
5115 /* ??? We could support pointers to functions here as well, if
5116 that was considered desirable. */
5117 cleanup_id = TREE_VALUE (args);
5118 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5120 error ("cleanup arg not an identifier");
5121 *no_add_attrs = true;
5124 cleanup_decl = lookup_name (cleanup_id);
5125 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5127 error ("cleanup arg not a function");
5128 *no_add_attrs = true;
5132 /* That the function has proper type is checked with the
5133 eventual call to build_function_call. */
5138 /* Handle a "warn_unused_result" attribute. No special handling. */
5141 handle_warn_unused_result_attribute (tree *node, tree name,
5142 tree ARG_UNUSED (args),
5143 int ARG_UNUSED (flags), bool *no_add_attrs)
5145 /* Ignore the attribute for functions not returning any value. */
5146 if (VOID_TYPE_P (TREE_TYPE (*node)))
5148 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
5149 *no_add_attrs = true;
5155 /* Check for valid arguments being passed to a function. */
5157 check_function_arguments (tree attrs, tree params)
5159 /* Check for null being passed in a pointer argument that must be
5160 non-null. We also need to do this if format checking is enabled. */
5163 check_function_nonnull (attrs, params);
5165 /* Check for errors in format strings. */
5168 check_function_format (attrs, params);
5171 /* Generic argument checking recursion routine. PARAM is the argument to
5172 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5173 once the argument is resolved. CTX is context for the callback. */
5175 check_function_arguments_recurse (void (*callback)
5176 (void *, tree, unsigned HOST_WIDE_INT),
5177 void *ctx, tree param,
5178 unsigned HOST_WIDE_INT param_num)
5180 if (TREE_CODE (param) == NOP_EXPR)
5182 /* Strip coercion. */
5183 check_function_arguments_recurse (callback, ctx,
5184 TREE_OPERAND (param, 0), param_num);
5188 if (TREE_CODE (param) == CALL_EXPR)
5190 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5192 bool found_format_arg = false;
5194 /* See if this is a call to a known internationalization function
5195 that modifies a format arg. Such a function may have multiple
5196 format_arg attributes (for example, ngettext). */
5198 for (attrs = TYPE_ATTRIBUTES (type);
5200 attrs = TREE_CHAIN (attrs))
5201 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5204 tree format_num_expr;
5208 /* Extract the argument number, which was previously checked
5210 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5211 while (TREE_CODE (format_num_expr) == NOP_EXPR
5212 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5213 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5214 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5216 if (TREE_CODE (format_num_expr) != INTEGER_CST
5217 || TREE_INT_CST_HIGH (format_num_expr) != 0)
5220 format_num = TREE_INT_CST_LOW (format_num_expr);
5222 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5224 inner_args = TREE_CHAIN (inner_args), i++)
5225 if (i == format_num)
5227 check_function_arguments_recurse (callback, ctx,
5228 TREE_VALUE (inner_args),
5230 found_format_arg = true;
5235 /* If we found a format_arg attribute and did a recursive check,
5236 we are done with checking this argument. Otherwise, we continue
5237 and this will be considered a non-literal. */
5238 if (found_format_arg)
5242 if (TREE_CODE (param) == COND_EXPR)
5244 /* Check both halves of the conditional expression. */
5245 check_function_arguments_recurse (callback, ctx,
5246 TREE_OPERAND (param, 1), param_num);
5247 check_function_arguments_recurse (callback, ctx,
5248 TREE_OPERAND (param, 2), param_num);
5252 (*callback) (ctx, param, param_num);
5255 /* Function to help qsort sort FIELD_DECLs by name order. */
5258 field_decl_cmp (const void *x_p, const void *y_p)
5260 const tree *const x = (const tree *const) x_p;
5261 const tree *const y = (const tree *const) y_p;
5263 if (DECL_NAME (*x) == DECL_NAME (*y))
5264 /* A nontype is "greater" than a type. */
5265 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5266 if (DECL_NAME (*x) == NULL_TREE)
5268 if (DECL_NAME (*y) == NULL_TREE)
5270 if (DECL_NAME (*x) < DECL_NAME (*y))
5276 gt_pointer_operator new_value;
5280 /* This routine compares two fields like field_decl_cmp but using the
5281 pointer operator in resort_data. */
5284 resort_field_decl_cmp (const void *x_p, const void *y_p)
5286 const tree *const x = (const tree *const) x_p;
5287 const tree *const y = (const tree *const) y_p;
5289 if (DECL_NAME (*x) == DECL_NAME (*y))
5290 /* A nontype is "greater" than a type. */
5291 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5292 if (DECL_NAME (*x) == NULL_TREE)
5294 if (DECL_NAME (*y) == NULL_TREE)
5297 tree d1 = DECL_NAME (*x);
5298 tree d2 = DECL_NAME (*y);
5299 resort_data.new_value (&d1, resort_data.cookie);
5300 resort_data.new_value (&d2, resort_data.cookie);
5307 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5310 resort_sorted_fields (void *obj,
5311 void * ARG_UNUSED (orig_obj),
5312 gt_pointer_operator new_value,
5315 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
5316 resort_data.new_value = new_value;
5317 resort_data.cookie = cookie;
5318 qsort (&sf->elts[0], sf->len, sizeof (tree),
5319 resort_field_decl_cmp);
5322 /* Issue the error given by MSGID, indicating that it occurred before
5323 TOKEN, which had the associated VALUE. */
5326 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5328 const char *string = _(msgid);
5330 if (token == CPP_EOF)
5331 error ("%s at end of input", string);
5332 else if (token == CPP_CHAR || token == CPP_WCHAR)
5334 unsigned int val = TREE_INT_CST_LOW (value);
5335 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5336 if (val <= UCHAR_MAX && ISGRAPH (val))
5337 error ("%s before %s'%c'", string, ell, val);
5339 error ("%s before %s'\\x%x'", string, ell, val);
5341 else if (token == CPP_STRING
5342 || token == CPP_WSTRING)
5343 error ("%s before string constant", string);
5344 else if (token == CPP_NUMBER)
5345 error ("%s before numeric constant", string);
5346 else if (token == CPP_NAME)
5347 error ("%s before \"%s\"", string, IDENTIFIER_POINTER (value));
5348 else if (token < N_TTYPES)
5349 error ("%s before '%s' token", string, cpp_type2name (token));
5351 error ("%s", string);
5354 /* Walk a gimplified function and warn for functions whose return value is
5355 ignored and attribute((warn_unused_result)) is set. This is done before
5356 inlining, so we don't have to worry about that. */
5359 c_warn_unused_result (tree *top_p)
5362 tree_stmt_iterator i;
5365 switch (TREE_CODE (t))
5367 case STATEMENT_LIST:
5368 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5369 c_warn_unused_result (tsi_stmt_ptr (i));
5373 c_warn_unused_result (&COND_EXPR_THEN (t));
5374 c_warn_unused_result (&COND_EXPR_ELSE (t));
5377 c_warn_unused_result (&BIND_EXPR_BODY (t));
5379 case TRY_FINALLY_EXPR:
5380 case TRY_CATCH_EXPR:
5381 c_warn_unused_result (&TREE_OPERAND (t, 0));
5382 c_warn_unused_result (&TREE_OPERAND (t, 1));
5385 c_warn_unused_result (&CATCH_BODY (t));
5387 case EH_FILTER_EXPR:
5388 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5395 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5396 a MODIFY_EXPR. All calls whose value is ignored should be
5397 represented like this. Look for the attribute. */
5398 fdecl = get_callee_fndecl (t);
5400 ftype = TREE_TYPE (fdecl);
5403 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5404 /* Look past pointer-to-function to the function type itself. */
5405 ftype = TREE_TYPE (ftype);
5408 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5411 warning ("%Hignoring return value of `%D', "
5412 "declared with attribute warn_unused_result",
5413 EXPR_LOCUS (t), fdecl);
5415 warning ("%Hignoring return value of function "
5416 "declared with attribute warn_unused_result",
5422 /* Not a container, not a call, or a call whose value is used. */
5427 #include "gt-c-common.h"