1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
36 #include "diagnostic.h"
41 #include "langhooks.h"
42 #include "tree-inline.h"
45 #include "tree-iterator.h"
47 #include "tree-mudflap.h"
51 cpp_reader *parse_in; /* Declared in c-pragma.h. */
53 /* We let tm.h override the types used here, to handle trivial differences
54 such as the choice of unsigned int or long unsigned int for size_t.
55 When machines start needing nontrivial differences in the size type,
56 it would be best to do something here to figure out automatically
57 from other information what type to use. */
60 #define SIZE_TYPE "long unsigned int"
64 #define PID_TYPE "int"
68 #define WCHAR_TYPE "int"
71 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
72 #define MODIFIED_WCHAR_TYPE \
73 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
76 #define PTRDIFF_TYPE "long int"
80 #define WINT_TYPE "unsigned int"
84 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
86 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
92 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
94 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
95 ? "long unsigned int" \
96 : "long long unsigned int"))
99 /* The following symbols are subsumed in the c_global_trees array, and
100 listed here individually for documentation purposes.
102 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
104 tree short_integer_type_node;
105 tree long_integer_type_node;
106 tree long_long_integer_type_node;
108 tree short_unsigned_type_node;
109 tree long_unsigned_type_node;
110 tree long_long_unsigned_type_node;
112 tree truthvalue_type_node;
113 tree truthvalue_false_node;
114 tree truthvalue_true_node;
116 tree ptrdiff_type_node;
118 tree unsigned_char_type_node;
119 tree signed_char_type_node;
120 tree wchar_type_node;
121 tree signed_wchar_type_node;
122 tree unsigned_wchar_type_node;
124 tree float_type_node;
125 tree double_type_node;
126 tree long_double_type_node;
128 tree complex_integer_type_node;
129 tree complex_float_type_node;
130 tree complex_double_type_node;
131 tree complex_long_double_type_node;
133 tree intQI_type_node;
134 tree intHI_type_node;
135 tree intSI_type_node;
136 tree intDI_type_node;
137 tree intTI_type_node;
139 tree unsigned_intQI_type_node;
140 tree unsigned_intHI_type_node;
141 tree unsigned_intSI_type_node;
142 tree unsigned_intDI_type_node;
143 tree unsigned_intTI_type_node;
145 tree widest_integer_literal_type_node;
146 tree widest_unsigned_literal_type_node;
148 Nodes for types `void *' and `const void *'.
150 tree ptr_type_node, const_ptr_type_node;
152 Nodes for types `char *' and `const char *'.
154 tree string_type_node, const_string_type_node;
156 Type `char[SOMENUMBER]'.
157 Used when an array of char is needed and the size is irrelevant.
159 tree char_array_type_node;
161 Type `int[SOMENUMBER]' or something like it.
162 Used when an array of int needed and the size is irrelevant.
164 tree int_array_type_node;
166 Type `wchar_t[SOMENUMBER]' or something like it.
167 Used when a wide string literal is created.
169 tree wchar_array_type_node;
171 Type `int ()' -- used for implicit declaration of functions.
173 tree default_function_type;
175 A VOID_TYPE node, packaged in a TREE_LIST.
179 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
180 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
181 VAR_DECLS, but C++ does.)
183 tree function_name_decl_node;
184 tree pretty_function_name_decl_node;
185 tree c99_function_name_decl_node;
187 Stack of nested function name VAR_DECLs.
189 tree saved_function_name_decls;
193 tree c_global_trees[CTI_MAX];
195 /* TRUE if a code represents a statement. The front end init
196 langhook should take care of initialization of this array. */
198 bool statement_code_p[MAX_TREE_CODES];
200 /* Switches common to the C front ends. */
202 /* Nonzero if prepreprocessing only. */
204 int flag_preprocess_only;
206 /* Nonzero means don't output line number information. */
208 char flag_no_line_commands;
210 /* Nonzero causes -E output not to be done, but directives such as
211 #define that have side effects are still obeyed. */
215 /* Nonzero means dump macros in some fashion. */
217 char flag_dump_macros;
219 /* Nonzero means pass #include lines through to the output. */
221 char flag_dump_includes;
223 /* Nonzero means process PCH files while preprocessing. */
225 bool flag_pch_preprocess;
227 /* The file name to which we should write a precompiled header, or
228 NULL if no header will be written in this compile. */
230 const char *pch_file;
232 /* Nonzero if an ISO standard was selected. It rejects macros in the
236 /* Nonzero if -undef was given. It suppresses target built-in macros
240 /* Nonzero means don't recognize the non-ANSI builtin functions. */
244 /* Nonzero means don't recognize the non-ANSI builtin functions.
247 int flag_no_nonansi_builtin;
249 /* Nonzero means give `double' the same size as `float'. */
251 int flag_short_double;
253 /* Nonzero means give `wchar_t' the same size as `short'. */
255 int flag_short_wchar;
257 /* Nonzero means allow Microsoft extensions without warnings or errors. */
258 int flag_ms_extensions;
260 /* Nonzero means don't recognize the keyword `asm'. */
264 /* Nonzero means give string constants the type `const char *', as mandated
267 int flag_const_strings;
269 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
271 int flag_signed_bitfields = 1;
273 /* Nonzero means warn about deprecated conversion from string constant to
276 int warn_write_strings;
278 /* Warn about #pragma directives that are not recognized. */
280 int warn_unknown_pragmas; /* Tri state variable. */
282 /* Warn about format/argument anomalies in calls to formatted I/O functions
283 (*printf, *scanf, strftime, strfmon, etc.). */
287 /* Zero means that faster, ...NonNil variants of objc_msgSend...
288 calls will be used in ObjC; passing nil receivers to such calls
289 will most likely result in crashes. */
290 int flag_nil_receivers = 1;
292 /* Nonzero means that we will allow new ObjC exception syntax (@throw,
293 @try, etc.) in source code. */
294 int flag_objc_exceptions = 0;
296 /* Nonzero means that we generate NeXT setjmp based exceptions. */
297 int flag_objc_sjlj_exceptions = -1;
299 /* Nonzero means that code generation will be altered to support
300 "zero-link" execution. This currently affects ObjC only, but may
301 affect other languages in the future. */
302 int flag_zero_link = 0;
304 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
305 unit. It will inform the ObjC runtime that class definition(s) herein
306 contained are to replace one(s) previously loaded. */
307 int flag_replace_objc_classes = 0;
309 /* C/ObjC language option variables. */
312 /* Nonzero means allow type mismatches in conditional expressions;
313 just make their values `void'. */
315 int flag_cond_mismatch;
317 /* Nonzero means enable C89 Amendment 1 features. */
321 /* Nonzero means use the ISO C99 dialect of C. */
325 /* Nonzero means that we have builtin functions, and main is an int. */
329 /* Warn if main is suspicious. */
334 /* ObjC language option variables. */
337 /* Open and close the file for outputting class declarations, if
340 int flag_gen_declaration;
342 /* Generate code for GNU or NeXT runtime environment. */
344 #ifdef NEXT_OBJC_RUNTIME
345 int flag_next_runtime = 1;
347 int flag_next_runtime = 0;
350 /* Tells the compiler that this is a special run. Do not perform any
351 compiling, instead we are to test some platform dependent features
352 and output a C header file with appropriate definitions. */
354 int print_struct_values;
356 /* ???. Undocumented. */
358 const char *constant_string_class_name;
361 /* C++ language option variables. */
364 /* Nonzero means don't recognize any extension keywords. */
366 int flag_no_gnu_keywords;
368 /* Nonzero means do emit exported implementations of functions even if
369 they can be inlined. */
371 int flag_implement_inlines = 1;
373 /* Nonzero means that implicit instantiations will be emitted if needed. */
375 int flag_implicit_templates = 1;
377 /* Nonzero means that implicit instantiations of inline templates will be
378 emitted if needed, even if instantiations of non-inline templates
381 int flag_implicit_inline_templates = 1;
383 /* Nonzero means generate separate instantiation control files and
384 juggle them at link time. */
386 int flag_use_repository;
388 /* Nonzero if we want to issue diagnostics that the standard says are not
391 int flag_optional_diags = 1;
393 /* Nonzero means we should attempt to elide constructors when possible. */
395 int flag_elide_constructors = 1;
397 /* Nonzero means that member functions defined in class scope are
398 inline by default. */
400 int flag_default_inline = 1;
402 /* Controls whether compiler generates 'type descriptor' that give
403 run-time type information. */
407 /* Nonzero if we want to conserve space in the .o files. We do this
408 by putting uninitialized data and runtime initialized data into
409 .common instead of .data at the expense of not flagging multiple
412 int flag_conserve_space;
414 /* Nonzero if we want to obey access control semantics. */
416 int flag_access_control = 1;
418 /* Nonzero if we want to check the return value of new and avoid calling
419 constructors if it is a null pointer. */
423 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
424 initialization variables.
425 0: Old rules, set by -fno-for-scope.
426 2: New ISO rules, set by -ffor-scope.
427 1: Try to implement new ISO rules, but with backup compatibility
428 (and warnings). This is the default, for now. */
430 int flag_new_for_scope = 1;
432 /* Nonzero if we want to emit defined symbols with common-like linkage as
433 weak symbols where possible, in order to conform to C++ semantics.
434 Otherwise, emit them as local symbols. */
438 /* 0 means we want the preprocessor to not emit line directives for
439 the current working directory. 1 means we want it to do it. -1
440 means we should decide depending on whether debugging information
441 is being emitted or not. */
443 int flag_working_directory = -1;
445 /* Nonzero to use __cxa_atexit, rather than atexit, to register
446 destructors for local statics and global objects. */
448 int flag_use_cxa_atexit = DEFAULT_USE_CXA_ATEXIT;
450 /* Nonzero means make the default pedwarns warnings instead of errors.
451 The value of this flag is ignored if -pedantic is specified. */
455 /* Nonzero means to implement standard semantics for exception
456 specifications, calling unexpected if an exception is thrown that
457 doesn't match the specification. Zero means to treat them as
458 assertions and optimize accordingly, but not check them. */
460 int flag_enforce_eh_specs = 1;
462 /* Nonzero means to generate thread-safe code for initializing local
465 int flag_threadsafe_statics = 1;
467 /* Nonzero means warn about implicit declarations. */
469 int warn_implicit = 1;
471 /* Maximum template instantiation depth. This limit is rather
472 arbitrary, but it exists to limit the time it takes to notice
473 infinite template instantiations. */
475 int max_tinst_depth = 500;
479 /* The elements of `ridpointers' are identifier nodes for the reserved
480 type names and storage classes. It is indexed by a RID_... value. */
483 tree (*make_fname_decl) (tree, int);
485 /* Nonzero means the expression being parsed will never be evaluated.
486 This is a count, since unevaluated expressions can nest. */
489 /* Information about how a function name is generated. */
492 tree *const decl; /* pointer to the VAR_DECL. */
493 const unsigned rid; /* RID number for the identifier. */
494 const int pretty; /* How pretty is it? */
497 /* The three ways of getting then name of the current function. */
499 const struct fname_var_t fname_vars[] =
501 /* C99 compliant __func__, must be first. */
502 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
503 /* GCC __FUNCTION__ compliant. */
504 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
505 /* GCC __PRETTY_FUNCTION__ compliant. */
506 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
510 static int constant_fits_type_p (tree, tree);
511 static tree check_case_value (tree);
512 static bool check_case_bounds (tree, tree, tree *, tree *);
514 static tree handle_packed_attribute (tree *, tree, tree, int, bool *);
515 static tree handle_nocommon_attribute (tree *, tree, tree, int, bool *);
516 static tree handle_common_attribute (tree *, tree, tree, int, bool *);
517 static tree handle_noreturn_attribute (tree *, tree, tree, int, bool *);
518 static tree handle_noinline_attribute (tree *, tree, tree, int, bool *);
519 static tree handle_always_inline_attribute (tree *, tree, tree, int,
521 static tree handle_used_attribute (tree *, tree, tree, int, bool *);
522 static tree handle_unused_attribute (tree *, tree, tree, int, bool *);
523 static tree handle_const_attribute (tree *, tree, tree, int, bool *);
524 static tree handle_transparent_union_attribute (tree *, tree, tree,
526 static tree handle_constructor_attribute (tree *, tree, tree, int, bool *);
527 static tree handle_destructor_attribute (tree *, tree, tree, int, bool *);
528 static tree handle_mode_attribute (tree *, tree, tree, int, bool *);
529 static tree handle_section_attribute (tree *, tree, tree, int, bool *);
530 static tree handle_aligned_attribute (tree *, tree, tree, int, bool *);
531 static tree handle_weak_attribute (tree *, tree, tree, int, bool *) ;
532 static tree handle_alias_attribute (tree *, tree, tree, int, bool *);
533 static tree handle_visibility_attribute (tree *, tree, tree, int,
535 static tree handle_tls_model_attribute (tree *, tree, tree, int,
537 static tree handle_no_instrument_function_attribute (tree *, tree,
539 static tree handle_malloc_attribute (tree *, tree, tree, int, bool *);
540 static tree handle_no_limit_stack_attribute (tree *, tree, tree, int,
542 static tree handle_pure_attribute (tree *, tree, tree, int, bool *);
543 static tree handle_deprecated_attribute (tree *, tree, tree, int,
545 static tree handle_vector_size_attribute (tree *, tree, tree, int,
547 static tree handle_nonnull_attribute (tree *, tree, tree, int, bool *);
548 static tree handle_nothrow_attribute (tree *, tree, tree, int, bool *);
549 static tree handle_cleanup_attribute (tree *, tree, tree, int, bool *);
550 static tree handle_warn_unused_result_attribute (tree *, tree, tree, int,
552 static tree handle_sentinel_attribute (tree *, tree, tree, int, bool *);
554 static void check_function_nonnull (tree, tree);
555 static void check_nonnull_arg (void *, tree, unsigned HOST_WIDE_INT);
556 static bool nonnull_check_p (tree, unsigned HOST_WIDE_INT);
557 static bool get_nonnull_operand (tree, unsigned HOST_WIDE_INT *);
558 static int resort_field_decl_cmp (const void *, const void *);
560 /* Table of machine-independent attributes common to all C-like languages. */
561 const struct attribute_spec c_common_attribute_table[] =
563 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
564 { "packed", 0, 0, false, false, false,
565 handle_packed_attribute },
566 { "nocommon", 0, 0, true, false, false,
567 handle_nocommon_attribute },
568 { "common", 0, 0, true, false, false,
569 handle_common_attribute },
570 /* FIXME: logically, noreturn attributes should be listed as
571 "false, true, true" and apply to function types. But implementing this
572 would require all the places in the compiler that use TREE_THIS_VOLATILE
573 on a decl to identify non-returning functions to be located and fixed
574 to check the function type instead. */
575 { "noreturn", 0, 0, true, false, false,
576 handle_noreturn_attribute },
577 { "volatile", 0, 0, true, false, false,
578 handle_noreturn_attribute },
579 { "noinline", 0, 0, true, false, false,
580 handle_noinline_attribute },
581 { "always_inline", 0, 0, true, false, false,
582 handle_always_inline_attribute },
583 { "used", 0, 0, true, false, false,
584 handle_used_attribute },
585 { "unused", 0, 0, false, false, false,
586 handle_unused_attribute },
587 /* The same comments as for noreturn attributes apply to const ones. */
588 { "const", 0, 0, true, false, false,
589 handle_const_attribute },
590 { "transparent_union", 0, 0, false, false, false,
591 handle_transparent_union_attribute },
592 { "constructor", 0, 0, true, false, false,
593 handle_constructor_attribute },
594 { "destructor", 0, 0, true, false, false,
595 handle_destructor_attribute },
596 { "mode", 1, 1, false, true, false,
597 handle_mode_attribute },
598 { "section", 1, 1, true, false, false,
599 handle_section_attribute },
600 { "aligned", 0, 1, false, false, false,
601 handle_aligned_attribute },
602 { "weak", 0, 0, true, false, false,
603 handle_weak_attribute },
604 { "alias", 1, 1, true, false, false,
605 handle_alias_attribute },
606 { "no_instrument_function", 0, 0, true, false, false,
607 handle_no_instrument_function_attribute },
608 { "malloc", 0, 0, true, false, false,
609 handle_malloc_attribute },
610 { "no_stack_limit", 0, 0, true, false, false,
611 handle_no_limit_stack_attribute },
612 { "pure", 0, 0, true, false, false,
613 handle_pure_attribute },
614 { "deprecated", 0, 0, false, false, false,
615 handle_deprecated_attribute },
616 { "vector_size", 1, 1, false, true, false,
617 handle_vector_size_attribute },
618 { "visibility", 1, 1, false, false, false,
619 handle_visibility_attribute },
620 { "tls_model", 1, 1, true, false, false,
621 handle_tls_model_attribute },
622 { "nonnull", 0, -1, false, true, true,
623 handle_nonnull_attribute },
624 { "nothrow", 0, 0, true, false, false,
625 handle_nothrow_attribute },
626 { "may_alias", 0, 0, false, true, false, NULL },
627 { "cleanup", 1, 1, true, false, false,
628 handle_cleanup_attribute },
629 { "warn_unused_result", 0, 0, false, true, true,
630 handle_warn_unused_result_attribute },
631 { "sentinel", 0, 1, false, true, true,
632 handle_sentinel_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_cst (NULL_TREE, ix), 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))
752 return (char *) cstr.text;
756 namep = xstrdup (name);
761 /* Expand DECL if it declares an entity not handled by the
765 c_expand_decl (tree decl)
767 if (TREE_CODE (decl) == VAR_DECL && !TREE_STATIC (decl))
769 /* Let the back-end know about this variable. */
770 if (!anon_aggr_type_p (TREE_TYPE (decl)))
771 emit_local_var (decl);
773 expand_anon_union_decl (decl, NULL_TREE,
774 DECL_ANON_UNION_ELEMS (decl));
783 /* Return the VAR_DECL for a const char array naming the current
784 function. If the VAR_DECL has not yet been created, create it
785 now. RID indicates how it should be formatted and IDENTIFIER_NODE
786 ID is its name (unfortunately C and C++ hold the RID values of
787 keywords in different places, so we can't derive RID from ID in
788 this language independent code. */
791 fname_decl (unsigned int rid, tree id)
794 tree decl = NULL_TREE;
796 for (ix = 0; fname_vars[ix].decl; ix++)
797 if (fname_vars[ix].rid == rid)
800 decl = *fname_vars[ix].decl;
803 /* If a tree is built here, it would normally have the lineno of
804 the current statement. Later this tree will be moved to the
805 beginning of the function and this line number will be wrong.
806 To avoid this problem set the lineno to 0 here; that prevents
807 it from appearing in the RTL. */
809 location_t saved_location = input_location;
810 #ifdef USE_MAPPED_LOCATION
811 input_location = UNKNOWN_LOCATION;
816 stmts = push_stmt_list ();
817 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
818 stmts = pop_stmt_list (stmts);
819 if (!IS_EMPTY_STMT (stmts))
820 saved_function_name_decls
821 = tree_cons (decl, stmts, saved_function_name_decls);
822 *fname_vars[ix].decl = decl;
823 input_location = saved_location;
825 if (!ix && !current_function_decl)
826 pedwarn ("%qD is not defined outside of function scope", decl);
831 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
834 fix_string_type (tree value)
836 const int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
837 const int wide_flag = TREE_TYPE (value) == wchar_array_type_node;
838 const int nchars_max = flag_isoc99 ? 4095 : 509;
839 int length = TREE_STRING_LENGTH (value);
841 tree e_type, i_type, a_type;
843 /* Compute the number of elements, for the array type. */
844 nchars = wide_flag ? length / wchar_bytes : length;
846 if (pedantic && nchars - 1 > nchars_max && !c_dialect_cxx ())
847 pedwarn ("string length %qd is greater than the length %qd ISO C%d compilers are required to support",
848 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
850 e_type = wide_flag ? wchar_type_node : char_type_node;
851 /* Create the array type for the string constant. flag_const_strings
852 says make the string constant an array of const char so that
853 copying it to a non-const pointer will get a warning. For C++,
854 this is the standard behavior.
856 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
857 array type being the unqualified version of that type.
858 Therefore, if we are constructing an array of const char, we must
859 construct the matching unqualified array type first. The C front
860 end does not require this, but it does no harm, so we do it
862 i_type = build_index_type (build_int_cst (NULL_TREE, nchars - 1));
863 a_type = build_array_type (e_type, i_type);
864 if (flag_const_strings)
866 /* bleah, c_build_qualified_type should set TYPE_MAIN_VARIANT. */
867 tree qa_type = c_build_qualified_type (a_type, TYPE_QUAL_CONST);
868 TYPE_MAIN_VARIANT (qa_type) = a_type;
872 TREE_TYPE (value) = a_type;
873 TREE_CONSTANT (value) = 1;
874 TREE_INVARIANT (value) = 1;
875 TREE_READONLY (value) = 1;
876 TREE_STATIC (value) = 1;
880 /* Print a warning if a constant expression had overflow in folding.
881 Invoke this function on every expression that the language
882 requires to be a constant expression.
883 Note the ANSI C standard says it is erroneous for a
884 constant expression to overflow. */
887 constant_expression_warning (tree value)
889 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
890 || TREE_CODE (value) == VECTOR_CST
891 || TREE_CODE (value) == COMPLEX_CST)
892 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
893 pedwarn ("overflow in constant expression");
896 /* Print a warning if an expression had overflow in folding.
897 Invoke this function on every expression that
898 (1) appears in the source code, and
899 (2) might be a constant expression that overflowed, and
900 (3) is not already checked by convert_and_check;
901 however, do not invoke this function on operands of explicit casts. */
904 overflow_warning (tree value)
906 if ((TREE_CODE (value) == INTEGER_CST
907 || (TREE_CODE (value) == COMPLEX_CST
908 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
909 && TREE_OVERFLOW (value))
911 TREE_OVERFLOW (value) = 0;
912 if (skip_evaluation == 0)
913 warning ("integer overflow in expression");
915 else if ((TREE_CODE (value) == REAL_CST
916 || (TREE_CODE (value) == COMPLEX_CST
917 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
918 && TREE_OVERFLOW (value))
920 TREE_OVERFLOW (value) = 0;
921 if (skip_evaluation == 0)
922 warning ("floating point overflow in expression");
924 else if (TREE_CODE (value) == VECTOR_CST && TREE_OVERFLOW (value))
926 TREE_OVERFLOW (value) = 0;
927 if (skip_evaluation == 0)
928 warning ("vector overflow in expression");
932 /* Print a warning if a large constant is truncated to unsigned,
933 or if -Wconversion is used and a constant < 0 is converted to unsigned.
934 Invoke this function on every expression that might be implicitly
935 converted to an unsigned type. */
938 unsigned_conversion_warning (tree result, tree operand)
940 tree type = TREE_TYPE (result);
942 if (TREE_CODE (operand) == INTEGER_CST
943 && TREE_CODE (type) == INTEGER_TYPE
944 && TYPE_UNSIGNED (type)
945 && skip_evaluation == 0
946 && !int_fits_type_p (operand, type))
948 if (!int_fits_type_p (operand, c_common_signed_type (type)))
949 /* This detects cases like converting -129 or 256 to unsigned char. */
950 warning ("large integer implicitly truncated to unsigned type");
951 else if (warn_conversion)
952 warning ("negative integer implicitly converted to unsigned type");
956 /* Nonzero if constant C has a value that is permissible
957 for type TYPE (an INTEGER_TYPE). */
960 constant_fits_type_p (tree c, tree type)
962 if (TREE_CODE (c) == INTEGER_CST)
963 return int_fits_type_p (c, type);
965 c = convert (type, c);
966 return !TREE_OVERFLOW (c);
969 /* Nonzero if vector types T1 and T2 can be converted to each other
970 without an explicit cast. */
972 vector_types_convertible_p (tree t1, tree t2)
974 return targetm.vector_opaque_p (t1)
975 || targetm.vector_opaque_p (t2)
976 || (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))
977 && INTEGRAL_TYPE_P (TREE_TYPE (t1))
978 == INTEGRAL_TYPE_P (TREE_TYPE (t2)));
981 /* Convert EXPR to TYPE, warning about conversion problems with constants.
982 Invoke this function on every expression that is converted implicitly,
983 i.e. because of language rules and not because of an explicit cast. */
986 convert_and_check (tree type, tree expr)
988 tree t = convert (type, expr);
989 if (TREE_CODE (t) == INTEGER_CST)
991 if (TREE_OVERFLOW (t))
993 TREE_OVERFLOW (t) = 0;
995 /* Do not diagnose overflow in a constant expression merely
996 because a conversion overflowed. */
997 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
999 /* No warning for converting 0x80000000 to int. */
1000 if (!(TYPE_UNSIGNED (type) < TYPE_UNSIGNED (TREE_TYPE (expr))
1001 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1002 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1003 /* If EXPR fits in the unsigned version of TYPE,
1004 don't warn unless pedantic. */
1006 || TYPE_UNSIGNED (type)
1007 || !constant_fits_type_p (expr,
1008 c_common_unsigned_type (type)))
1009 && skip_evaluation == 0)
1010 warning ("overflow in implicit constant conversion");
1013 unsigned_conversion_warning (t, expr);
1018 /* A node in a list that describes references to variables (EXPR), which are
1019 either read accesses if WRITER is zero, or write accesses, in which case
1020 WRITER is the parent of EXPR. */
1027 /* Used to implement a cache the results of a call to verify_tree. We only
1028 use this for SAVE_EXPRs. */
1031 struct tlist_cache *next;
1032 struct tlist *cache_before_sp;
1033 struct tlist *cache_after_sp;
1037 /* Obstack to use when allocating tlist structures, and corresponding
1039 static struct obstack tlist_obstack;
1040 static char *tlist_firstobj = 0;
1042 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1044 static struct tlist *warned_ids;
1045 /* SAVE_EXPRs need special treatment. We process them only once and then
1046 cache the results. */
1047 static struct tlist_cache *save_expr_cache;
1049 static void add_tlist (struct tlist **, struct tlist *, tree, int);
1050 static void merge_tlist (struct tlist **, struct tlist *, int);
1051 static void verify_tree (tree, struct tlist **, struct tlist **, tree);
1052 static int warning_candidate_p (tree);
1053 static void warn_for_collisions (struct tlist *);
1054 static void warn_for_collisions_1 (tree, tree, struct tlist *, int);
1055 static struct tlist *new_tlist (struct tlist *, tree, tree);
1057 /* Create a new struct tlist and fill in its fields. */
1058 static struct tlist *
1059 new_tlist (struct tlist *next, tree t, tree writer)
1062 l = XOBNEW (&tlist_obstack, struct tlist);
1069 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1070 is nonnull, we ignore any node we find which has a writer equal to it. */
1073 add_tlist (struct tlist **to, struct tlist *add, tree exclude_writer, int copy)
1077 struct tlist *next = add->next;
1080 if (!exclude_writer || add->writer != exclude_writer)
1081 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1086 /* Merge the nodes of ADD into TO. This merging process is done so that for
1087 each variable that already exists in TO, no new node is added; however if
1088 there is a write access recorded in ADD, and an occurrence on TO is only
1089 a read access, then the occurrence in TO will be modified to record the
1093 merge_tlist (struct tlist **to, struct tlist *add, int copy)
1095 struct tlist **end = to;
1098 end = &(*end)->next;
1104 struct tlist *next = add->next;
1106 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1107 if (tmp2->expr == add->expr)
1111 tmp2->writer = add->writer;
1115 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1116 end = &(*end)->next;
1123 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1124 references in list LIST conflict with it, excluding reads if ONLY writers
1128 warn_for_collisions_1 (tree written, tree writer, struct tlist *list,
1133 /* Avoid duplicate warnings. */
1134 for (tmp = warned_ids; tmp; tmp = tmp->next)
1135 if (tmp->expr == written)
1140 if (list->expr == written
1141 && list->writer != writer
1142 && (!only_writes || list->writer)
1143 && DECL_NAME (list->expr))
1145 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1146 warning ("operation on %qs may be undefined",
1147 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1153 /* Given a list LIST of references to variables, find whether any of these
1154 can cause conflicts due to missing sequence points. */
1157 warn_for_collisions (struct tlist *list)
1161 for (tmp = list; tmp; tmp = tmp->next)
1164 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1168 /* Return nonzero if X is a tree that can be verified by the sequence point
1171 warning_candidate_p (tree x)
1173 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1176 /* Walk the tree X, and record accesses to variables. If X is written by the
1177 parent tree, WRITER is the parent.
1178 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1179 expression or its only operand forces a sequence point, then everything up
1180 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1182 Once we return, we will have emitted warnings if any subexpression before
1183 such a sequence point could be undefined. On a higher level, however, the
1184 sequence point may not be relevant, and we'll merge the two lists.
1186 Example: (b++, a) + b;
1187 The call that processes the COMPOUND_EXPR will store the increment of B
1188 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1189 processes the PLUS_EXPR will need to merge the two lists so that
1190 eventually, all accesses end up on the same list (and we'll warn about the
1191 unordered subexpressions b++ and b.
1193 A note on merging. If we modify the former example so that our expression
1196 care must be taken not simply to add all three expressions into the final
1197 PNO_SP list. The function merge_tlist takes care of that by merging the
1198 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1199 way, so that no more than one access to B is recorded. */
1202 verify_tree (tree x, struct tlist **pbefore_sp, struct tlist **pno_sp,
1205 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1206 enum tree_code code;
1207 enum tree_code_class cl;
1209 /* X may be NULL if it is the operand of an empty statement expression
1215 code = TREE_CODE (x);
1216 cl = TREE_CODE_CLASS (code);
1218 if (warning_candidate_p (x))
1220 *pno_sp = new_tlist (*pno_sp, x, writer);
1230 case TRUTH_ANDIF_EXPR:
1231 case TRUTH_ORIF_EXPR:
1232 tmp_before = tmp_nosp = tmp_list3 = 0;
1233 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1234 warn_for_collisions (tmp_nosp);
1235 merge_tlist (pbefore_sp, tmp_before, 0);
1236 merge_tlist (pbefore_sp, tmp_nosp, 0);
1237 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1238 merge_tlist (pbefore_sp, tmp_list3, 0);
1242 tmp_before = tmp_list2 = 0;
1243 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1244 warn_for_collisions (tmp_list2);
1245 merge_tlist (pbefore_sp, tmp_before, 0);
1246 merge_tlist (pbefore_sp, tmp_list2, 1);
1248 tmp_list3 = tmp_nosp = 0;
1249 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1250 warn_for_collisions (tmp_nosp);
1251 merge_tlist (pbefore_sp, tmp_list3, 0);
1253 tmp_list3 = tmp_list2 = 0;
1254 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1255 warn_for_collisions (tmp_list2);
1256 merge_tlist (pbefore_sp, tmp_list3, 0);
1257 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1258 two first, to avoid warning for (a ? b++ : b++). */
1259 merge_tlist (&tmp_nosp, tmp_list2, 0);
1260 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1263 case PREDECREMENT_EXPR:
1264 case PREINCREMENT_EXPR:
1265 case POSTDECREMENT_EXPR:
1266 case POSTINCREMENT_EXPR:
1267 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1271 tmp_before = tmp_nosp = tmp_list3 = 0;
1272 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1273 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1274 /* Expressions inside the LHS are not ordered wrt. the sequence points
1275 in the RHS. Example:
1277 Despite the fact that the modification of "a" is in the before_sp
1278 list (tmp_before), it conflicts with the use of "a" in the LHS.
1279 We can handle this by adding the contents of tmp_list3
1280 to those of tmp_before, and redoing the collision warnings for that
1282 add_tlist (&tmp_before, tmp_list3, x, 1);
1283 warn_for_collisions (tmp_before);
1284 /* Exclude the LHS itself here; we first have to merge it into the
1285 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1286 didn't exclude the LHS, we'd get it twice, once as a read and once
1288 add_tlist (pno_sp, tmp_list3, x, 0);
1289 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1291 merge_tlist (pbefore_sp, tmp_before, 0);
1292 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1293 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1294 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1298 /* We need to warn about conflicts among arguments and conflicts between
1299 args and the function address. Side effects of the function address,
1300 however, are not ordered by the sequence point of the call. */
1301 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1302 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1303 if (TREE_OPERAND (x, 1))
1304 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1305 merge_tlist (&tmp_list3, tmp_list2, 0);
1306 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1307 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1308 warn_for_collisions (tmp_before);
1309 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1313 /* Scan all the list, e.g. indices of multi dimensional array. */
1316 tmp_before = tmp_nosp = 0;
1317 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1318 merge_tlist (&tmp_nosp, tmp_before, 0);
1319 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1326 struct tlist_cache *t;
1327 for (t = save_expr_cache; t; t = t->next)
1333 t = XOBNEW (&tlist_obstack, struct tlist_cache);
1334 t->next = save_expr_cache;
1336 save_expr_cache = t;
1338 tmp_before = tmp_nosp = 0;
1339 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1340 warn_for_collisions (tmp_nosp);
1345 struct tlist *t = tmp_nosp;
1347 merge_tlist (&tmp_list3, t, 0);
1349 t->cache_before_sp = tmp_before;
1350 t->cache_after_sp = tmp_list3;
1352 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1353 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1358 /* For other expressions, simply recurse on their operands.
1359 Manual tail recursion for unary expressions.
1360 Other non-expressions need not be processed. */
1361 if (cl == tcc_unary)
1363 x = TREE_OPERAND (x, 0);
1367 else if (IS_EXPR_CODE_CLASS (cl))
1370 int max = TREE_CODE_LENGTH (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, 0);
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 (i.e. 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 promoting 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 (i.e. the default 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;
1862 error ("invalid operands to binary %s", opname);
1865 /* Subroutine of build_binary_op, used for comparison operations.
1866 See if the operands have both been converted from subword integer types
1867 and, if so, perhaps change them both back to their original type.
1868 This function is also responsible for converting the two operands
1869 to the proper common type for comparison.
1871 The arguments of this function are all pointers to local variables
1872 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
1873 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
1875 If this function returns nonzero, it means that the comparison has
1876 a constant value. What this function returns is an expression for
1880 shorten_compare (tree *op0_ptr, tree *op1_ptr, tree *restype_ptr,
1881 enum tree_code *rescode_ptr)
1884 tree op0 = *op0_ptr;
1885 tree op1 = *op1_ptr;
1886 int unsignedp0, unsignedp1;
1888 tree primop0, primop1;
1889 enum tree_code code = *rescode_ptr;
1891 /* Throw away any conversions to wider types
1892 already present in the operands. */
1894 primop0 = get_narrower (op0, &unsignedp0);
1895 primop1 = get_narrower (op1, &unsignedp1);
1897 /* Handle the case that OP0 does not *contain* a conversion
1898 but it *requires* conversion to FINAL_TYPE. */
1900 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
1901 unsignedp0 = TYPE_UNSIGNED (TREE_TYPE (op0));
1902 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
1903 unsignedp1 = TYPE_UNSIGNED (TREE_TYPE (op1));
1905 /* If one of the operands must be floated, we cannot optimize. */
1906 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
1907 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
1909 /* If first arg is constant, swap the args (changing operation
1910 so value is preserved), for canonicalization. Don't do this if
1911 the second arg is 0. */
1913 if (TREE_CONSTANT (primop0)
1914 && !integer_zerop (primop1) && !real_zerop (primop1))
1917 int temi = unsignedp0;
1925 unsignedp0 = unsignedp1;
1948 *rescode_ptr = code;
1951 /* If comparing an integer against a constant more bits wide,
1952 maybe we can deduce a value of 1 or 0 independent of the data.
1953 Or else truncate the constant now
1954 rather than extend the variable at run time.
1956 This is only interesting if the constant is the wider arg.
1957 Also, it is not safe if the constant is unsigned and the
1958 variable arg is signed, since in this case the variable
1959 would be sign-extended and then regarded as unsigned.
1960 Our technique fails in this case because the lowest/highest
1961 possible unsigned results don't follow naturally from the
1962 lowest/highest possible values of the variable operand.
1963 For just EQ_EXPR and NE_EXPR there is another technique that
1964 could be used: see if the constant can be faithfully represented
1965 in the other operand's type, by truncating it and reextending it
1966 and see if that preserves the constant's value. */
1968 if (!real1 && !real2
1969 && TREE_CODE (primop1) == INTEGER_CST
1970 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
1972 int min_gt, max_gt, min_lt, max_lt;
1973 tree maxval, minval;
1974 /* 1 if comparison is nominally unsigned. */
1975 int unsignedp = TYPE_UNSIGNED (*restype_ptr);
1978 type = c_common_signed_or_unsigned_type (unsignedp0,
1979 TREE_TYPE (primop0));
1981 maxval = TYPE_MAX_VALUE (type);
1982 minval = TYPE_MIN_VALUE (type);
1984 if (unsignedp && !unsignedp0)
1985 *restype_ptr = c_common_signed_type (*restype_ptr);
1987 if (TREE_TYPE (primop1) != *restype_ptr)
1989 /* Convert primop1 to target type, but do not introduce
1990 additional overflow. We know primop1 is an int_cst. */
1991 tree tmp = build_int_cst_wide (*restype_ptr,
1992 TREE_INT_CST_LOW (primop1),
1993 TREE_INT_CST_HIGH (primop1));
1995 primop1 = force_fit_type (tmp, 0, TREE_OVERFLOW (primop1),
1996 TREE_CONSTANT_OVERFLOW (primop1));
1998 if (type != *restype_ptr)
2000 minval = convert (*restype_ptr, minval);
2001 maxval = convert (*restype_ptr, maxval);
2004 if (unsignedp && unsignedp0)
2006 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2007 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2008 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2009 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2013 min_gt = INT_CST_LT (primop1, minval);
2014 max_gt = INT_CST_LT (primop1, maxval);
2015 min_lt = INT_CST_LT (minval, primop1);
2016 max_lt = INT_CST_LT (maxval, primop1);
2020 /* This used to be a switch, but Genix compiler can't handle that. */
2021 if (code == NE_EXPR)
2023 if (max_lt || min_gt)
2024 val = truthvalue_true_node;
2026 else if (code == EQ_EXPR)
2028 if (max_lt || min_gt)
2029 val = truthvalue_false_node;
2031 else if (code == LT_EXPR)
2034 val = truthvalue_true_node;
2036 val = truthvalue_false_node;
2038 else if (code == GT_EXPR)
2041 val = truthvalue_true_node;
2043 val = truthvalue_false_node;
2045 else if (code == LE_EXPR)
2048 val = truthvalue_true_node;
2050 val = truthvalue_false_node;
2052 else if (code == GE_EXPR)
2055 val = truthvalue_true_node;
2057 val = truthvalue_false_node;
2060 /* If primop0 was sign-extended and unsigned comparison specd,
2061 we did a signed comparison above using the signed type bounds.
2062 But the comparison we output must be unsigned.
2064 Also, for inequalities, VAL is no good; but if the signed
2065 comparison had *any* fixed result, it follows that the
2066 unsigned comparison just tests the sign in reverse
2067 (positive values are LE, negative ones GE).
2068 So we can generate an unsigned comparison
2069 against an extreme value of the signed type. */
2071 if (unsignedp && !unsignedp0)
2078 primop1 = TYPE_MIN_VALUE (type);
2084 primop1 = TYPE_MAX_VALUE (type);
2091 type = c_common_unsigned_type (type);
2094 if (TREE_CODE (primop0) != INTEGER_CST)
2096 if (val == truthvalue_false_node)
2097 warning ("comparison is always false due to limited range of data type");
2098 if (val == truthvalue_true_node)
2099 warning ("comparison is always true due to limited range of data type");
2104 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2105 if (TREE_SIDE_EFFECTS (primop0))
2106 return build2 (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2110 /* Value is not predetermined, but do the comparison
2111 in the type of the operand that is not constant.
2112 TYPE is already properly set. */
2114 else if (real1 && real2
2115 && (TYPE_PRECISION (TREE_TYPE (primop0))
2116 == TYPE_PRECISION (TREE_TYPE (primop1))))
2117 type = TREE_TYPE (primop0);
2119 /* If args' natural types are both narrower than nominal type
2120 and both extend in the same manner, compare them
2121 in the type of the wider arg.
2122 Otherwise must actually extend both to the nominal
2123 common type lest different ways of extending
2125 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2127 else if (unsignedp0 == unsignedp1 && real1 == real2
2128 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2129 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2131 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2132 type = c_common_signed_or_unsigned_type (unsignedp0
2133 || TYPE_UNSIGNED (*restype_ptr),
2135 /* Make sure shorter operand is extended the right way
2136 to match the longer operand. */
2138 = convert (c_common_signed_or_unsigned_type (unsignedp0,
2139 TREE_TYPE (primop0)),
2142 = convert (c_common_signed_or_unsigned_type (unsignedp1,
2143 TREE_TYPE (primop1)),
2148 /* Here we must do the comparison on the nominal type
2149 using the args exactly as we received them. */
2150 type = *restype_ptr;
2154 if (!real1 && !real2 && integer_zerop (primop1)
2155 && TYPE_UNSIGNED (*restype_ptr))
2161 /* All unsigned values are >= 0, so we warn if extra warnings
2162 are requested. However, if OP0 is a constant that is
2163 >= 0, the signedness of the comparison isn't an issue,
2164 so suppress the warning. */
2165 if (extra_warnings && !in_system_header
2166 && !(TREE_CODE (primop0) == INTEGER_CST
2167 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2169 warning ("comparison of unsigned expression >= 0 is always true");
2170 value = truthvalue_true_node;
2174 if (extra_warnings && !in_system_header
2175 && !(TREE_CODE (primop0) == INTEGER_CST
2176 && !TREE_OVERFLOW (convert (c_common_signed_type (type),
2178 warning ("comparison of unsigned expression < 0 is always false");
2179 value = truthvalue_false_node;
2188 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2189 if (TREE_SIDE_EFFECTS (primop0))
2190 return build2 (COMPOUND_EXPR, TREE_TYPE (value),
2197 *op0_ptr = convert (type, primop0);
2198 *op1_ptr = convert (type, primop1);
2200 *restype_ptr = truthvalue_type_node;
2205 /* Return a tree for the sum or difference (RESULTCODE says which)
2206 of pointer PTROP and integer INTOP. */
2209 pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
2213 /* The result is a pointer of the same type that is being added. */
2215 tree result_type = TREE_TYPE (ptrop);
2217 if (TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE)
2219 if (pedantic || warn_pointer_arith)
2220 pedwarn ("pointer of type %<void *%> used in arithmetic");
2221 size_exp = integer_one_node;
2223 else if (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE)
2225 if (pedantic || warn_pointer_arith)
2226 pedwarn ("pointer to a function used in arithmetic");
2227 size_exp = integer_one_node;
2229 else if (TREE_CODE (TREE_TYPE (result_type)) == METHOD_TYPE)
2231 if (pedantic || warn_pointer_arith)
2232 pedwarn ("pointer to member function used in arithmetic");
2233 size_exp = integer_one_node;
2236 size_exp = size_in_bytes (TREE_TYPE (result_type));
2238 /* If what we are about to multiply by the size of the elements
2239 contains a constant term, apply distributive law
2240 and multiply that constant term separately.
2241 This helps produce common subexpressions. */
2243 if ((TREE_CODE (intop) == PLUS_EXPR || TREE_CODE (intop) == MINUS_EXPR)
2244 && !TREE_CONSTANT (intop)
2245 && TREE_CONSTANT (TREE_OPERAND (intop, 1))
2246 && TREE_CONSTANT (size_exp)
2247 /* If the constant comes from pointer subtraction,
2248 skip this optimization--it would cause an error. */
2249 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop, 0))) == INTEGER_TYPE
2250 /* If the constant is unsigned, and smaller than the pointer size,
2251 then we must skip this optimization. This is because it could cause
2252 an overflow error if the constant is negative but INTOP is not. */
2253 && (!TYPE_UNSIGNED (TREE_TYPE (intop))
2254 || (TYPE_PRECISION (TREE_TYPE (intop))
2255 == TYPE_PRECISION (TREE_TYPE (ptrop)))))
2257 enum tree_code subcode = resultcode;
2258 tree int_type = TREE_TYPE (intop);
2259 if (TREE_CODE (intop) == MINUS_EXPR)
2260 subcode = (subcode == PLUS_EXPR ? MINUS_EXPR : PLUS_EXPR);
2261 /* Convert both subexpression types to the type of intop,
2262 because weird cases involving pointer arithmetic
2263 can result in a sum or difference with different type args. */
2264 ptrop = build_binary_op (subcode, ptrop,
2265 convert (int_type, TREE_OPERAND (intop, 1)), 1);
2266 intop = convert (int_type, TREE_OPERAND (intop, 0));
2269 /* Convert the integer argument to a type the same size as sizetype
2270 so the multiply won't overflow spuriously. */
2272 if (TYPE_PRECISION (TREE_TYPE (intop)) != TYPE_PRECISION (sizetype)
2273 || TYPE_UNSIGNED (TREE_TYPE (intop)) != TYPE_UNSIGNED (sizetype))
2274 intop = convert (c_common_type_for_size (TYPE_PRECISION (sizetype),
2275 TYPE_UNSIGNED (sizetype)), intop);
2277 /* Replace the integer argument with a suitable product by the object size.
2278 Do this multiplication as signed, then convert to the appropriate
2279 pointer type (actually unsigned integral). */
2281 intop = convert (result_type,
2282 build_binary_op (MULT_EXPR, intop,
2283 convert (TREE_TYPE (intop), size_exp), 1));
2285 /* Create the sum or difference. */
2286 return fold (build2 (resultcode, result_type, ptrop, intop));
2289 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2290 or validate its data type for an `if' or `while' statement or ?..: exp.
2292 This preparation consists of taking the ordinary
2293 representation of an expression expr and producing a valid tree
2294 boolean expression describing whether expr is nonzero. We could
2295 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2296 but we optimize comparisons, &&, ||, and !.
2298 The resulting type should always be `truthvalue_type_node'. */
2301 c_common_truthvalue_conversion (tree expr)
2303 if (TREE_CODE (expr) == ERROR_MARK)
2306 if (TREE_CODE (expr) == FUNCTION_DECL)
2307 expr = build_unary_op (ADDR_EXPR, expr, 0);
2309 switch (TREE_CODE (expr))
2311 case EQ_EXPR: case NE_EXPR: case UNEQ_EXPR: case LTGT_EXPR:
2312 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2313 case UNLE_EXPR: case UNGE_EXPR: case UNLT_EXPR: case UNGT_EXPR:
2314 case ORDERED_EXPR: case UNORDERED_EXPR:
2315 case TRUTH_ANDIF_EXPR:
2316 case TRUTH_ORIF_EXPR:
2317 case TRUTH_AND_EXPR:
2319 case TRUTH_XOR_EXPR:
2320 if (TREE_TYPE (expr) != truthvalue_type_node)
2321 return build2 (TREE_CODE (expr), truthvalue_type_node,
2322 TREE_OPERAND (expr, 0), TREE_OPERAND (expr, 1));
2325 case TRUTH_NOT_EXPR:
2326 if (TREE_TYPE (expr) != truthvalue_type_node)
2327 return build1 (TREE_CODE (expr), truthvalue_type_node,
2328 TREE_OPERAND (expr, 0));
2335 /* Avoid integer_zerop to ignore TREE_CONSTANT_OVERFLOW. */
2336 return (TREE_INT_CST_LOW (expr) != 0 || TREE_INT_CST_HIGH (expr) != 0)
2337 ? truthvalue_true_node
2338 : truthvalue_false_node;
2341 return real_compare (NE_EXPR, &TREE_REAL_CST (expr), &dconst0)
2342 ? truthvalue_true_node
2343 : truthvalue_false_node;
2347 if (TREE_CODE (TREE_OPERAND (expr, 0)) == FUNCTION_DECL
2348 && !DECL_WEAK (TREE_OPERAND (expr, 0)))
2350 /* Common Ada/Pascal programmer's mistake. We always warn
2351 about this since it is so bad. */
2352 warning ("the address of %qD, will always evaluate as %<true%>",
2353 TREE_OPERAND (expr, 0));
2354 return truthvalue_true_node;
2357 /* If we are taking the address of an external decl, it might be
2358 zero if it is weak, so we cannot optimize. */
2359 if (DECL_P (TREE_OPERAND (expr, 0))
2360 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2363 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2364 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2365 TREE_OPERAND (expr, 0), truthvalue_true_node);
2367 return truthvalue_true_node;
2371 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2372 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2373 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)),
2374 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2380 /* These don't change whether an object is nonzero or zero. */
2381 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2385 /* These don't change whether an object is zero or nonzero, but
2386 we can't ignore them if their second arg has side-effects. */
2387 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2388 return build2 (COMPOUND_EXPR, truthvalue_type_node,
2389 TREE_OPERAND (expr, 1),
2390 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0)));
2392 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2395 /* Distribute the conversion into the arms of a COND_EXPR. */
2396 return fold (build3 (COND_EXPR, truthvalue_type_node,
2397 TREE_OPERAND (expr, 0),
2398 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 1)),
2399 lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 2))));
2402 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2403 since that affects how `default_conversion' will behave. */
2404 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2405 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2407 /* Fall through.... */
2409 /* If this is widening the argument, we can ignore it. */
2410 if (TYPE_PRECISION (TREE_TYPE (expr))
2411 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2412 return lang_hooks.truthvalue_conversion (TREE_OPERAND (expr, 0));
2416 /* Perhaps reduce (x - y) != 0 to (x != y). The expressions
2417 aren't guaranteed to the be same for modes that can represent
2418 infinity, since if x and y are both +infinity, or both
2419 -infinity, then x - y is not a number.
2421 Note that this transformation is safe when x or y is NaN.
2422 (x - y) is then NaN, and both (x - y) != 0 and x != y will
2424 if (HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (TREE_OPERAND (expr, 0)))))
2426 /* Fall through.... */
2428 /* This and MINUS_EXPR can be changed into a comparison of the
2430 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2431 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2432 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2433 TREE_OPERAND (expr, 1), 1);
2434 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2435 fold (build1 (NOP_EXPR,
2436 TREE_TYPE (TREE_OPERAND (expr, 0)),
2437 TREE_OPERAND (expr, 1))), 1);
2440 if (integer_onep (TREE_OPERAND (expr, 1))
2441 && TREE_TYPE (expr) != truthvalue_type_node)
2442 /* Using convert here would cause infinite recursion. */
2443 return build1 (NOP_EXPR, truthvalue_type_node, expr);
2447 if (warn_parentheses && !TREE_NO_WARNING (expr))
2448 warning ("suggest parentheses around assignment used as truth value");
2455 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2457 tree t = save_expr (expr);
2458 return (build_binary_op
2459 ((TREE_SIDE_EFFECTS (expr)
2460 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2461 lang_hooks.truthvalue_conversion (build_unary_op (REALPART_EXPR, t, 0)),
2462 lang_hooks.truthvalue_conversion (build_unary_op (IMAGPART_EXPR, t, 0)),
2466 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2469 static tree builtin_function_2 (const char *builtin_name, const char *name,
2470 tree builtin_type, tree type,
2471 enum built_in_function function_code,
2472 enum built_in_class cl, int library_name_p,
2476 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2477 down to the element type of an array. */
2480 c_build_qualified_type (tree type, int type_quals)
2482 if (type == error_mark_node)
2485 if (TREE_CODE (type) == ARRAY_TYPE)
2486 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2488 TYPE_DOMAIN (type));
2490 /* A restrict-qualified pointer type must be a pointer to object or
2491 incomplete type. Note that the use of POINTER_TYPE_P also allows
2492 REFERENCE_TYPEs, which is appropriate for C++. */
2493 if ((type_quals & TYPE_QUAL_RESTRICT)
2494 && (!POINTER_TYPE_P (type)
2495 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2497 error ("invalid use of %<restrict%>");
2498 type_quals &= ~TYPE_QUAL_RESTRICT;
2501 return build_qualified_type (type, type_quals);
2504 /* Apply the TYPE_QUALS to the new DECL. */
2507 c_apply_type_quals_to_decl (int type_quals, tree decl)
2509 tree type = TREE_TYPE (decl);
2511 if (type == error_mark_node)
2514 if (((type_quals & TYPE_QUAL_CONST)
2515 || (type && TREE_CODE (type) == REFERENCE_TYPE))
2516 /* An object declared 'const' is only readonly after it is
2517 initialized. We don't have any way of expressing this currently,
2518 so we need to be conservative and unset TREE_READONLY for types
2519 with constructors. Otherwise aliasing code will ignore stores in
2520 an inline constructor. */
2521 && !(type && TYPE_NEEDS_CONSTRUCTING (type)))
2522 TREE_READONLY (decl) = 1;
2523 if (type_quals & TYPE_QUAL_VOLATILE)
2525 TREE_SIDE_EFFECTS (decl) = 1;
2526 TREE_THIS_VOLATILE (decl) = 1;
2528 if (type_quals & TYPE_QUAL_RESTRICT)
2530 while (type && TREE_CODE (type) == ARRAY_TYPE)
2531 /* Allow 'restrict' on arrays of pointers.
2532 FIXME currently we just ignore it. */
2533 type = TREE_TYPE (type);
2535 || !POINTER_TYPE_P (type)
2536 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type)))
2537 error ("invalid use of %<restrict%>");
2538 else if (flag_strict_aliasing && type == TREE_TYPE (decl))
2539 /* Indicate we need to make a unique alias set for this pointer.
2540 We can't do it here because it might be pointing to an
2542 DECL_POINTER_ALIAS_SET (decl) = -2;
2546 /* Hash function for the problem of multiple type definitions in
2547 different files. This must hash all types that will compare
2548 equal via comptypes to the same value. In practice it hashes
2549 on some of the simple stuff and leaves the details to comptypes. */
2552 c_type_hash (const void *p)
2558 switch (TREE_CODE (t))
2560 /* For pointers, hash on pointee type plus some swizzling. */
2562 return c_type_hash (TREE_TYPE (t)) ^ 0x3003003;
2563 /* Hash on number of elements and total size. */
2566 t2 = TYPE_VALUES (t);
2570 t2 = TYPE_FIELDS (t);
2572 case QUAL_UNION_TYPE:
2574 t2 = TYPE_FIELDS (t);
2578 t2 = TYPE_FIELDS (t);
2583 for (; t2; t2 = TREE_CHAIN (t2))
2585 size = TREE_INT_CST_LOW (TYPE_SIZE (t));
2586 return ((size << 24) | (i << shift));
2589 static GTY((param_is (union tree_node))) htab_t type_hash_table;
2591 /* Return the typed-based alias set for T, which may be an expression
2592 or a type. Return -1 if we don't do anything special. */
2595 c_common_get_alias_set (tree t)
2600 /* Permit type-punning when accessing a union, provided the access
2601 is directly through the union. For example, this code does not
2602 permit taking the address of a union member and then storing
2603 through it. Even the type-punning allowed here is a GCC
2604 extension, albeit a common and useful one; the C standard says
2605 that such accesses have implementation-defined behavior. */
2607 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2608 u = TREE_OPERAND (u, 0))
2609 if (TREE_CODE (u) == COMPONENT_REF
2610 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2613 /* That's all the expressions we handle specially. */
2617 /* The C standard guarantees that any object may be accessed via an
2618 lvalue that has character type. */
2619 if (t == char_type_node
2620 || t == signed_char_type_node
2621 || t == unsigned_char_type_node)
2624 /* If it has the may_alias attribute, it can alias anything. */
2625 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t)))
2628 /* The C standard specifically allows aliasing between signed and
2629 unsigned variants of the same type. We treat the signed
2630 variant as canonical. */
2631 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
2633 tree t1 = c_common_signed_type (t);
2635 /* t1 == t can happen for boolean nodes which are always unsigned. */
2637 return get_alias_set (t1);
2639 else if (POINTER_TYPE_P (t))
2643 /* Unfortunately, there is no canonical form of a pointer type.
2644 In particular, if we have `typedef int I', then `int *', and
2645 `I *' are different types. So, we have to pick a canonical
2646 representative. We do this below.
2648 Technically, this approach is actually more conservative that
2649 it needs to be. In particular, `const int *' and `int *'
2650 should be in different alias sets, according to the C and C++
2651 standard, since their types are not the same, and so,
2652 technically, an `int **' and `const int **' cannot point at
2655 But, the standard is wrong. In particular, this code is
2660 const int* const* cipp = ipp;
2662 And, it doesn't make sense for that to be legal unless you
2663 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2664 the pointed-to types. This issue has been reported to the
2666 t1 = build_type_no_quals (t);
2668 return get_alias_set (t1);
2671 /* Handle the case of multiple type nodes referring to "the same" type,
2672 which occurs with IMA. These share an alias set. FIXME: Currently only
2673 C90 is handled. (In C99 type compatibility is not transitive, which
2674 complicates things mightily. The alias set splay trees can theoretically
2675 represent this, but insertion is tricky when you consider all the
2676 different orders things might arrive in.) */
2678 if (c_language != clk_c || flag_isoc99)
2681 /* Save time if there's only one input file. */
2682 if (num_in_fnames == 1)
2685 /* Pointers need special handling if they point to any type that
2686 needs special handling (below). */
2687 if (TREE_CODE (t) == POINTER_TYPE)
2690 /* Find bottom type under any nested POINTERs. */
2691 for (t2 = TREE_TYPE (t);
2692 TREE_CODE (t2) == POINTER_TYPE;
2693 t2 = TREE_TYPE (t2))
2695 if (TREE_CODE (t2) != RECORD_TYPE
2696 && TREE_CODE (t2) != ENUMERAL_TYPE
2697 && TREE_CODE (t2) != QUAL_UNION_TYPE
2698 && TREE_CODE (t2) != UNION_TYPE)
2700 if (TYPE_SIZE (t2) == 0)
2703 /* These are the only cases that need special handling. */
2704 if (TREE_CODE (t) != RECORD_TYPE
2705 && TREE_CODE (t) != ENUMERAL_TYPE
2706 && TREE_CODE (t) != QUAL_UNION_TYPE
2707 && TREE_CODE (t) != UNION_TYPE
2708 && TREE_CODE (t) != POINTER_TYPE)
2711 if (TYPE_SIZE (t) == 0)
2714 /* Look up t in hash table. Only one of the compatible types within each
2715 alias set is recorded in the table. */
2716 if (!type_hash_table)
2717 type_hash_table = htab_create_ggc (1021, c_type_hash,
2718 (htab_eq) lang_hooks.types_compatible_p,
2720 slot = htab_find_slot (type_hash_table, t, INSERT);
2723 TYPE_ALIAS_SET (t) = TYPE_ALIAS_SET ((tree)*slot);
2724 return TYPE_ALIAS_SET ((tree)*slot);
2727 /* Our caller will assign and record (in t) a new alias set; all we need
2728 to do is remember t in the hash table. */
2734 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
2735 second parameter indicates which OPERATOR is being applied. The COMPLAIN
2736 flag controls whether we should diagnose possibly ill-formed
2737 constructs or not. */
2739 c_sizeof_or_alignof_type (tree type, enum tree_code op, int complain)
2741 const char *op_name;
2743 enum tree_code type_code = TREE_CODE (type);
2745 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
2746 op_name = op == SIZEOF_EXPR ? "sizeof" : "__alignof__";
2748 if (type_code == FUNCTION_TYPE)
2750 if (op == SIZEOF_EXPR)
2752 if (complain && (pedantic || warn_pointer_arith))
2753 pedwarn ("invalid application of %<sizeof%> to a function type");
2754 value = size_one_node;
2757 value = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2759 else if (type_code == VOID_TYPE || type_code == ERROR_MARK)
2761 if (type_code == VOID_TYPE
2762 && complain && (pedantic || warn_pointer_arith))
2763 pedwarn ("invalid application of %qs to a void type", op_name);
2764 value = size_one_node;
2766 else if (!COMPLETE_TYPE_P (type))
2769 error ("invalid application of %qs to incomplete type %qT ",
2771 value = size_zero_node;
2775 if (op == (enum tree_code) SIZEOF_EXPR)
2776 /* Convert in case a char is more than one unit. */
2777 value = size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
2778 size_int (TYPE_PRECISION (char_type_node)
2781 value = size_int (TYPE_ALIGN_UNIT (type));
2784 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
2785 TYPE_IS_SIZETYPE means that certain things (like overflow) will
2786 never happen. However, this node should really have type
2787 `size_t', which is just a typedef for an ordinary integer type. */
2788 value = fold (build1 (NOP_EXPR, size_type_node, value));
2789 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value)));
2794 /* Implement the __alignof keyword: Return the minimum required
2795 alignment of EXPR, measured in bytes. For VAR_DECL's and
2796 FIELD_DECL's return DECL_ALIGN (which can be set from an
2797 "aligned" __attribute__ specification). */
2800 c_alignof_expr (tree expr)
2804 if (TREE_CODE (expr) == VAR_DECL)
2805 t = size_int (DECL_ALIGN_UNIT (expr));
2807 else if (TREE_CODE (expr) == COMPONENT_REF
2808 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2810 error ("%<__alignof%> applied to a bit-field");
2813 else if (TREE_CODE (expr) == COMPONENT_REF
2814 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2815 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr, 1)));
2817 else if (TREE_CODE (expr) == INDIRECT_REF)
2819 tree t = TREE_OPERAND (expr, 0);
2821 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2823 while (TREE_CODE (t) == NOP_EXPR
2824 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2828 t = TREE_OPERAND (t, 0);
2829 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2830 if (thisalign > bestalign)
2831 best = t, bestalign = thisalign;
2833 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2836 return c_alignof (TREE_TYPE (expr));
2838 return fold (build1 (NOP_EXPR, size_type_node, t));
2841 /* Handle C and C++ default attributes. */
2843 enum built_in_attribute
2845 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
2846 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
2847 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
2848 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
2849 #include "builtin-attrs.def"
2850 #undef DEF_ATTR_NULL_TREE
2852 #undef DEF_ATTR_IDENT
2853 #undef DEF_ATTR_TREE_LIST
2857 static GTY(()) tree built_in_attributes[(int) ATTR_LAST];
2859 static void c_init_attributes (void);
2861 /* Build tree nodes and builtin functions common to both C and C++ language
2865 c_common_nodes_and_builtins (void)
2869 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2870 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2871 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2872 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2873 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2874 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2875 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2876 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2877 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2878 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2879 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2880 #include "builtin-types.def"
2881 #undef DEF_PRIMITIVE_TYPE
2882 #undef DEF_FUNCTION_TYPE_0
2883 #undef DEF_FUNCTION_TYPE_1
2884 #undef DEF_FUNCTION_TYPE_2
2885 #undef DEF_FUNCTION_TYPE_3
2886 #undef DEF_FUNCTION_TYPE_4
2887 #undef DEF_FUNCTION_TYPE_VAR_0
2888 #undef DEF_FUNCTION_TYPE_VAR_1
2889 #undef DEF_FUNCTION_TYPE_VAR_2
2890 #undef DEF_FUNCTION_TYPE_VAR_3
2891 #undef DEF_POINTER_TYPE
2895 typedef enum builtin_type builtin_type;
2897 tree builtin_types[(int) BT_LAST];
2898 int wchar_type_size;
2899 tree array_domain_type;
2900 tree va_list_ref_type_node;
2901 tree va_list_arg_type_node;
2903 /* Define `int' and `char' first so that dbx will output them first. */
2904 record_builtin_type (RID_INT, NULL, integer_type_node);
2905 record_builtin_type (RID_CHAR, "char", char_type_node);
2907 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
2908 "unsigned long", "long long unsigned" and "unsigned short" were in C++
2909 but not C. Are the conditionals here needed? */
2910 if (c_dialect_cxx ())
2911 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
2912 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
2913 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
2914 record_builtin_type (RID_MAX, "long unsigned int",
2915 long_unsigned_type_node);
2916 if (c_dialect_cxx ())
2917 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
2918 record_builtin_type (RID_MAX, "long long int",
2919 long_long_integer_type_node);
2920 record_builtin_type (RID_MAX, "long long unsigned int",
2921 long_long_unsigned_type_node);
2922 if (c_dialect_cxx ())
2923 record_builtin_type (RID_MAX, "long long unsigned",
2924 long_long_unsigned_type_node);
2925 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
2926 record_builtin_type (RID_MAX, "short unsigned int",
2927 short_unsigned_type_node);
2928 if (c_dialect_cxx ())
2929 record_builtin_type (RID_MAX, "unsigned short",
2930 short_unsigned_type_node);
2932 /* Define both `signed char' and `unsigned char'. */
2933 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
2934 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
2936 /* These are types that c_common_type_for_size and
2937 c_common_type_for_mode use. */
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 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2946 #if HOST_BITS_PER_WIDE_INT >= 64
2947 if (targetm.scalar_mode_supported_p (TImode))
2948 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2949 get_identifier ("__int128_t"),
2952 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2953 unsigned_intQI_type_node));
2954 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2955 unsigned_intHI_type_node));
2956 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2957 unsigned_intSI_type_node));
2958 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2959 unsigned_intDI_type_node));
2960 #if HOST_BITS_PER_WIDE_INT >= 64
2961 if (targetm.scalar_mode_supported_p (TImode))
2962 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2963 get_identifier ("__uint128_t"),
2964 unsigned_intTI_type_node));
2967 /* Create the widest literal types. */
2968 widest_integer_literal_type_node
2969 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
2970 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2971 widest_integer_literal_type_node));
2973 widest_unsigned_literal_type_node
2974 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
2975 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL, NULL_TREE,
2976 widest_unsigned_literal_type_node));
2978 /* `unsigned long' is the standard type for sizeof.
2979 Note that stddef.h uses `unsigned long',
2980 and this must agree, even if long and int are the same size. */
2982 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
2983 signed_size_type_node = c_common_signed_type (size_type_node);
2984 set_sizetype (size_type_node);
2987 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE)));
2989 build_common_tree_nodes_2 (flag_short_double);
2991 record_builtin_type (RID_FLOAT, NULL, float_type_node);
2992 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
2993 record_builtin_type (RID_MAX, "long double", long_double_type_node);
2995 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2996 get_identifier ("complex int"),
2997 complex_integer_type_node));
2998 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
2999 get_identifier ("complex float"),
3000 complex_float_type_node));
3001 lang_hooks.decls.pushdecl (build_decl (TYPE_DECL,
3002 get_identifier ("complex double"),
3003 complex_double_type_node));
3004 lang_hooks.decls.pushdecl
3005 (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3006 complex_long_double_type_node));
3008 if (c_dialect_cxx ())
3009 /* For C++, make fileptr_type_node a distinct void * type until
3010 FILE type is defined. */
3011 fileptr_type_node = build_variant_type_copy (ptr_type_node);
3013 record_builtin_type (RID_VOID, NULL, void_type_node);
3015 /* This node must not be shared. */
3016 void_zero_node = make_node (INTEGER_CST);
3017 TREE_TYPE (void_zero_node) = void_type_node;
3019 void_list_node = build_void_list_node ();
3021 /* Make a type to be the domain of a few array types
3022 whose domains don't really matter.
3023 200 is small enough that it always fits in size_t
3024 and large enough that it can hold most function names for the
3025 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3026 array_domain_type = build_index_type (size_int (200));
3028 /* Make a type for arrays of characters.
3029 With luck nothing will ever really depend on the length of this
3031 char_array_type_node
3032 = build_array_type (char_type_node, array_domain_type);
3034 /* Likewise for arrays of ints. */
3036 = build_array_type (integer_type_node, array_domain_type);
3038 string_type_node = build_pointer_type (char_type_node);
3039 const_string_type_node
3040 = build_pointer_type (build_qualified_type
3041 (char_type_node, TYPE_QUAL_CONST));
3043 /* This is special for C++ so functions can be overloaded. */
3044 wchar_type_node = get_identifier (MODIFIED_WCHAR_TYPE);
3045 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3046 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3047 if (c_dialect_cxx ())
3049 if (TYPE_UNSIGNED (wchar_type_node))
3050 wchar_type_node = make_unsigned_type (wchar_type_size);
3052 wchar_type_node = make_signed_type (wchar_type_size);
3053 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3057 signed_wchar_type_node = c_common_signed_type (wchar_type_node);
3058 unsigned_wchar_type_node = c_common_unsigned_type (wchar_type_node);
3061 /* This is for wide string constants. */
3062 wchar_array_type_node
3063 = build_array_type (wchar_type_node, array_domain_type);
3066 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3069 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3071 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3073 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3075 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3076 unsigned_ptrdiff_type_node = c_common_unsigned_type (ptrdiff_type_node);
3078 lang_hooks.decls.pushdecl
3079 (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3080 va_list_type_node));
3082 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3084 va_list_arg_type_node = va_list_ref_type_node =
3085 build_pointer_type (TREE_TYPE (va_list_type_node));
3089 va_list_arg_type_node = va_list_type_node;
3090 va_list_ref_type_node = build_reference_type (va_list_type_node);
3093 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3094 builtin_types[(int) ENUM] = VALUE;
3095 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3096 builtin_types[(int) ENUM] \
3097 = build_function_type (builtin_types[(int) RETURN], \
3099 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3100 builtin_types[(int) ENUM] \
3101 = build_function_type (builtin_types[(int) RETURN], \
3102 tree_cons (NULL_TREE, \
3103 builtin_types[(int) ARG1], \
3105 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3106 builtin_types[(int) ENUM] \
3107 = build_function_type \
3108 (builtin_types[(int) RETURN], \
3109 tree_cons (NULL_TREE, \
3110 builtin_types[(int) ARG1], \
3111 tree_cons (NULL_TREE, \
3112 builtin_types[(int) ARG2], \
3114 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3115 builtin_types[(int) ENUM] \
3116 = build_function_type \
3117 (builtin_types[(int) RETURN], \
3118 tree_cons (NULL_TREE, \
3119 builtin_types[(int) ARG1], \
3120 tree_cons (NULL_TREE, \
3121 builtin_types[(int) ARG2], \
3122 tree_cons (NULL_TREE, \
3123 builtin_types[(int) ARG3], \
3125 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3126 builtin_types[(int) ENUM] \
3127 = build_function_type \
3128 (builtin_types[(int) RETURN], \
3129 tree_cons (NULL_TREE, \
3130 builtin_types[(int) ARG1], \
3131 tree_cons (NULL_TREE, \
3132 builtin_types[(int) ARG2], \
3135 builtin_types[(int) ARG3], \
3136 tree_cons (NULL_TREE, \
3137 builtin_types[(int) ARG4], \
3138 void_list_node)))));
3139 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3140 builtin_types[(int) ENUM] \
3141 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3142 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3143 builtin_types[(int) ENUM] \
3144 = build_function_type (builtin_types[(int) RETURN], \
3145 tree_cons (NULL_TREE, \
3146 builtin_types[(int) ARG1], \
3149 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3150 builtin_types[(int) ENUM] \
3151 = build_function_type \
3152 (builtin_types[(int) RETURN], \
3153 tree_cons (NULL_TREE, \
3154 builtin_types[(int) ARG1], \
3155 tree_cons (NULL_TREE, \
3156 builtin_types[(int) ARG2], \
3159 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3160 builtin_types[(int) ENUM] \
3161 = build_function_type \
3162 (builtin_types[(int) RETURN], \
3163 tree_cons (NULL_TREE, \
3164 builtin_types[(int) ARG1], \
3165 tree_cons (NULL_TREE, \
3166 builtin_types[(int) ARG2], \
3167 tree_cons (NULL_TREE, \
3168 builtin_types[(int) ARG3], \
3171 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3172 builtin_types[(int) ENUM] \
3173 = build_pointer_type (builtin_types[(int) TYPE]);
3174 #include "builtin-types.def"
3175 #undef DEF_PRIMITIVE_TYPE
3176 #undef DEF_FUNCTION_TYPE_1
3177 #undef DEF_FUNCTION_TYPE_2
3178 #undef DEF_FUNCTION_TYPE_3
3179 #undef DEF_FUNCTION_TYPE_4
3180 #undef DEF_FUNCTION_TYPE_VAR_0
3181 #undef DEF_FUNCTION_TYPE_VAR_1
3182 #undef DEF_FUNCTION_TYPE_VAR_2
3183 #undef DEF_FUNCTION_TYPE_VAR_3
3184 #undef DEF_POINTER_TYPE
3186 c_init_attributes ();
3188 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, \
3189 BOTH_P, FALLBACK_P, NONANSI_P, ATTRS, IMPLICIT) \
3194 gcc_assert (!strncmp (NAME, "__builtin_", \
3195 strlen ("__builtin_"))); \
3198 decl = lang_hooks.builtin_function (NAME, builtin_types[TYPE], \
3202 ? (NAME + strlen ("__builtin_")) \
3204 built_in_attributes[(int) ATTRS]); \
3206 decl = builtin_function_2 (NAME, \
3207 NAME + strlen ("__builtin_"), \
3208 builtin_types[TYPE], \
3209 builtin_types[LIBTYPE], \
3214 built_in_attributes[(int) ATTRS]); \
3216 built_in_decls[(int) ENUM] = decl; \
3218 implicit_built_in_decls[(int) ENUM] = decl; \
3220 #include "builtins.def"
3223 targetm.init_builtins ();
3227 main_identifier_node = get_identifier ("main");
3230 /* Look up the function in built_in_decls that corresponds to DECL
3231 and set ASMSPEC as its user assembler name. DECL must be a
3232 function decl that declares a builtin. */
3235 set_builtin_user_assembler_name (tree decl, const char *asmspec)
3238 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
3239 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL
3242 builtin = built_in_decls [DECL_FUNCTION_CODE (decl)];
3243 set_user_assembler_name (builtin, asmspec);
3244 if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMCPY)
3245 init_block_move_fn (asmspec);
3246 else if (DECL_FUNCTION_CODE (decl) == BUILT_IN_MEMSET)
3247 init_block_clear_fn (asmspec);
3251 build_va_arg (tree expr, tree type)
3253 return build1 (VA_ARG_EXPR, type, expr);
3257 /* Linked list of disabled built-in functions. */
3259 typedef struct disabled_builtin
3262 struct disabled_builtin *next;
3264 static disabled_builtin *disabled_builtins = NULL;
3266 static bool builtin_function_disabled_p (const char *);
3268 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3269 begins with "__builtin_", give an error. */
3272 disable_builtin_function (const char *name)
3274 if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0)
3275 error ("cannot disable built-in function %qs", name);
3278 disabled_builtin *new_disabled_builtin = XNEW (disabled_builtin);
3279 new_disabled_builtin->name = name;
3280 new_disabled_builtin->next = disabled_builtins;
3281 disabled_builtins = new_disabled_builtin;
3286 /* Return true if the built-in function NAME has been disabled, false
3290 builtin_function_disabled_p (const char *name)
3292 disabled_builtin *p;
3293 for (p = disabled_builtins; p != NULL; p = p->next)
3295 if (strcmp (name, p->name) == 0)
3302 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3303 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3304 of these may be NULL (though both being NULL is useless).
3305 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3306 TYPE is the type of the function with the ordinary name. These
3307 may differ if the ordinary name is declared with a looser type to avoid
3308 conflicts with headers. FUNCTION_CODE and CL are as for
3309 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3310 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3311 If NONANSI_P is true, the name NAME is treated as a non-ANSI name;
3312 ATTRS is the tree list representing the builtin's function attributes.
3313 Returns the declaration of BUILTIN_NAME, if any, otherwise
3314 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3315 or if NONANSI_P and flag_no_nonansi_builtin. */
3318 builtin_function_2 (const char *builtin_name, const char *name,
3319 tree builtin_type, tree type,
3320 enum built_in_function function_code,
3321 enum built_in_class cl, int library_name_p,
3322 bool nonansi_p, tree attrs)
3324 tree bdecl = NULL_TREE;
3325 tree decl = NULL_TREE;
3327 if (builtin_name != 0)
3328 bdecl = lang_hooks.builtin_function (builtin_name, builtin_type,
3330 library_name_p ? name : NULL, attrs);
3332 if (name != 0 && !flag_no_builtin && !builtin_function_disabled_p (name)
3333 && !(nonansi_p && flag_no_nonansi_builtin))
3334 decl = lang_hooks.builtin_function (name, type, function_code, cl,
3337 return (bdecl != 0 ? bdecl : decl);
3340 /* Nonzero if the type T promotes to int. This is (nearly) the
3341 integral promotions defined in ISO C99 6.3.1.1/2. */
3344 c_promoting_integer_type_p (tree t)
3346 switch (TREE_CODE (t))
3349 return (TYPE_MAIN_VARIANT (t) == char_type_node
3350 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3351 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3352 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3353 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node
3354 || TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node));
3357 /* ??? Technically all enumerations not larger than an int
3358 promote to an int. But this is used along code paths
3359 that only want to notice a size change. */
3360 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3370 /* Return 1 if PARMS specifies a fixed number of parameters
3371 and none of their types is affected by default promotions. */
3374 self_promoting_args_p (tree parms)
3377 for (t = parms; t; t = TREE_CHAIN (t))
3379 tree type = TREE_VALUE (t);
3381 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3387 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3390 if (c_promoting_integer_type_p (type))
3396 /* Recursively examines the array elements of TYPE, until a non-array
3397 element type is found. */
3400 strip_array_types (tree type)
3402 while (TREE_CODE (type) == ARRAY_TYPE)
3403 type = TREE_TYPE (type);
3408 /* Recursively remove any '*' or '&' operator from TYPE. */
3410 strip_pointer_operator (tree t)
3412 while (POINTER_TYPE_P (t))
3417 /* Used to compare case labels. K1 and K2 are actually tree nodes
3418 representing case labels, or NULL_TREE for a `default' label.
3419 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3420 K2, and 0 if K1 and K2 are equal. */
3423 case_compare (splay_tree_key k1, splay_tree_key k2)
3425 /* Consider a NULL key (such as arises with a `default' label) to be
3426 smaller than anything else. */
3432 return tree_int_cst_compare ((tree) k1, (tree) k2);
3435 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3436 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3437 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3438 case label was declared using the usual C/C++ syntax, rather than
3439 the GNU case range extension. CASES is a tree containing all the
3440 case ranges processed so far; COND is the condition for the
3441 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3442 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3445 c_add_case_label (splay_tree cases, tree cond, tree orig_type,
3446 tree low_value, tree high_value)
3451 splay_tree_node node;
3453 /* Create the LABEL_DECL itself. */
3454 label = create_artificial_label ();
3456 /* If there was an error processing the switch condition, bail now
3457 before we get more confused. */
3458 if (!cond || cond == error_mark_node)
3461 if ((low_value && TREE_TYPE (low_value)
3462 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3463 || (high_value && TREE_TYPE (high_value)
3464 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3465 error ("pointers are not permitted as case values");
3467 /* Case ranges are a GNU extension. */
3468 if (high_value && pedantic)
3469 pedwarn ("range expressions in switch statements are non-standard");
3471 type = TREE_TYPE (cond);
3474 low_value = check_case_value (low_value);
3475 low_value = convert_and_check (type, low_value);
3479 high_value = check_case_value (high_value);
3480 high_value = convert_and_check (type, high_value);
3483 /* If an error has occurred, bail out now. */
3484 if (low_value == error_mark_node || high_value == error_mark_node)
3487 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3488 really a case range, even though it was written that way. Remove
3489 the HIGH_VALUE to simplify later processing. */
3490 if (tree_int_cst_equal (low_value, high_value))
3491 high_value = NULL_TREE;
3492 if (low_value && high_value
3493 && !tree_int_cst_lt (low_value, high_value))
3494 warning ("empty range specified");
3496 /* See if the case is in range of the type of the original testing
3497 expression. If both low_value and high_value are out of range,
3498 don't insert the case label and return NULL_TREE. */
3500 && !check_case_bounds (type, orig_type,
3501 &low_value, high_value ? &high_value : NULL))
3504 /* Look up the LOW_VALUE in the table of case labels we already
3506 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3507 /* If there was not an exact match, check for overlapping ranges.
3508 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3509 that's a `default' label and the only overlap is an exact match. */
3510 if (!node && (low_value || high_value))
3512 splay_tree_node low_bound;
3513 splay_tree_node high_bound;
3515 /* Even though there wasn't an exact match, there might be an
3516 overlap between this case range and another case range.
3517 Since we've (inductively) not allowed any overlapping case
3518 ranges, we simply need to find the greatest low case label
3519 that is smaller that LOW_VALUE, and the smallest low case
3520 label that is greater than LOW_VALUE. If there is an overlap
3521 it will occur in one of these two ranges. */
3522 low_bound = splay_tree_predecessor (cases,
3523 (splay_tree_key) low_value);
3524 high_bound = splay_tree_successor (cases,
3525 (splay_tree_key) low_value);
3527 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3528 the LOW_VALUE, so there is no need to check unless the
3529 LOW_BOUND is in fact itself a case range. */
3531 && CASE_HIGH ((tree) low_bound->value)
3532 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3535 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3536 range is bigger than the low end of the current range, so we
3537 are only interested if the current range is a real range, and
3538 not an ordinary case label. */
3541 && (tree_int_cst_compare ((tree) high_bound->key,
3546 /* If there was an overlap, issue an error. */
3549 tree duplicate = CASE_LABEL ((tree) node->value);
3553 error ("duplicate (or overlapping) case value");
3554 error ("%Jthis is the first entry overlapping that value", duplicate);
3558 error ("duplicate case value") ;
3559 error ("%Jpreviously used here", duplicate);
3563 error ("multiple default labels in one switch");
3564 error ("%Jthis is the first default label", duplicate);
3569 /* Add a CASE_LABEL to the statement-tree. */
3570 case_label = add_stmt (build_case_label (low_value, high_value, label));
3571 /* Register this case label in the splay tree. */
3572 splay_tree_insert (cases,
3573 (splay_tree_key) low_value,
3574 (splay_tree_value) case_label);
3579 /* Add a label so that the back-end doesn't think that the beginning of
3580 the switch is unreachable. Note that we do not add a case label, as
3581 that just leads to duplicates and thence to aborts later on. */
3584 tree t = create_artificial_label ();
3585 add_stmt (build_stmt (LABEL_EXPR, t));
3587 return error_mark_node;
3590 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
3591 Used to verify that case values match up with enumerator values. */
3594 match_case_to_enum_1 (tree key, tree type, tree label)
3596 char buf[2 + 2*HOST_BITS_PER_WIDE_INT/4 + 1];
3598 /* ??? Not working too hard to print the double-word value.
3599 Should perhaps be done with %lwd in the diagnostic routines? */
3600 if (TREE_INT_CST_HIGH (key) == 0)
3601 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_UNSIGNED,
3602 TREE_INT_CST_LOW (key));
3603 else if (!TYPE_UNSIGNED (type)
3604 && TREE_INT_CST_HIGH (key) == -1
3605 && TREE_INT_CST_LOW (key) != 0)
3606 snprintf (buf, sizeof (buf), "-" HOST_WIDE_INT_PRINT_UNSIGNED,
3607 -TREE_INT_CST_LOW (key));
3609 snprintf (buf, sizeof (buf), HOST_WIDE_INT_PRINT_DOUBLE_HEX,
3610 TREE_INT_CST_HIGH (key), TREE_INT_CST_LOW (key));
3612 if (TYPE_NAME (type) == 0)
3613 warning ("%Jcase value %qs not in enumerated type",
3614 CASE_LABEL (label), buf);
3616 warning ("%Jcase value %qs not in enumerated type %qT",
3617 CASE_LABEL (label), buf, type);
3621 match_case_to_enum (splay_tree_node node, void *data)
3623 tree label = (tree) node->value;
3624 tree type = (tree) data;
3626 /* Skip default case. */
3627 if (!CASE_LOW (label))
3630 /* If TREE_ADDRESSABLE is not set, that means CASE_LOW did not appear
3631 when we did our enum->case scan. Reset our scratch bit after. */
3632 if (!TREE_ADDRESSABLE (label))
3633 match_case_to_enum_1 (CASE_LOW (label), type, label);
3635 TREE_ADDRESSABLE (label) = 0;
3637 /* If CASE_HIGH is non-null, we have a range. Here we must search.
3638 Note that the old code in stmt.c did not check for the values in
3639 the range either, just the endpoints. */
3640 if (CASE_HIGH (label))
3642 tree chain, key = CASE_HIGH (label);
3644 for (chain = TYPE_VALUES (type);
3645 chain && !tree_int_cst_equal (key, TREE_VALUE (chain));
3646 chain = TREE_CHAIN (chain))
3649 match_case_to_enum_1 (key, type, label);
3655 /* Handle -Wswitch*. Called from the front end after parsing the switch
3657 /* ??? Should probably be somewhere generic, since other languages besides
3658 C and C++ would want this. We'd want to agree on the datastructure,
3659 however, which is a problem. Alternately, we operate on gimplified
3660 switch_exprs, which I don't especially like. At the moment, however,
3661 C/C++ are the only tree-ssa languages that support enumerations at all,
3662 so the point is moot. */
3665 c_do_switch_warnings (splay_tree cases, tree switch_stmt)
3667 splay_tree_node default_node;
3668 location_t switch_location;
3671 if (!warn_switch && !warn_switch_enum && !warn_switch_default)
3674 if (EXPR_HAS_LOCATION (switch_stmt))
3675 switch_location = EXPR_LOCATION (switch_stmt);
3677 switch_location = input_location;
3679 type = SWITCH_STMT_TYPE (switch_stmt);
3681 default_node = splay_tree_lookup (cases, (splay_tree_key) NULL);
3682 if (warn_switch_default && !default_node)
3683 warning ("%Hswitch missing default case", &switch_location);
3685 /* If the switch expression was an enumerated type, check that
3686 exactly all enumeration literals are covered by the cases.
3687 The check is made when -Wswitch was specified and there is no
3688 default case, or when -Wswitch-enum was specified. */
3689 if (((warn_switch && !default_node) || warn_switch_enum)
3690 && type && TREE_CODE (type) == ENUMERAL_TYPE
3691 && TREE_CODE (SWITCH_STMT_COND (switch_stmt)) != INTEGER_CST)
3695 /* The time complexity here is O(N*lg(N)) worst case, but for the
3696 common case of monotonically increasing enumerators, it is
3697 O(N), since the nature of the splay tree will keep the next
3698 element adjacent to the root at all times. */
3700 for (chain = TYPE_VALUES (type); chain; chain = TREE_CHAIN (chain))
3702 splay_tree_node node
3703 = splay_tree_lookup (cases, (splay_tree_key) TREE_VALUE (chain));
3707 /* Mark the CASE_LOW part of the case entry as seen, so
3708 that we save time later. Choose TREE_ADDRESSABLE
3709 randomly as a bit that won't have been set to-date. */
3710 tree label = (tree) node->value;
3711 TREE_ADDRESSABLE (label) = 1;
3715 /* Warn if there are enumerators that don't correspond to
3716 case expressions. */
3717 warning ("%Henumeration value %qE not handled in switch",
3718 &switch_location, TREE_PURPOSE (chain));
3722 /* Warn if there are case expressions that don't correspond to
3723 enumerators. This can occur since C and C++ don't enforce
3724 type-checking of assignments to enumeration variables.
3726 The time complexity here is O(N**2) worst case, since we've
3727 not sorted the enumeration values. However, in the absence
3728 of case ranges this is O(N), since all single cases that
3729 corresponded to enumerations have been marked above. */
3731 splay_tree_foreach (cases, match_case_to_enum, type);
3735 /* Finish an expression taking the address of LABEL (an
3736 IDENTIFIER_NODE). Returns an expression for the address. */
3739 finish_label_address_expr (tree label)
3744 pedwarn ("taking the address of a label is non-standard");
3746 if (label == error_mark_node)
3747 return error_mark_node;
3749 label = lookup_label (label);
3750 if (label == NULL_TREE)
3751 result = null_pointer_node;
3754 TREE_USED (label) = 1;
3755 result = build1 (ADDR_EXPR, ptr_type_node, label);
3756 /* The current function in not necessarily uninlinable.
3757 Computed gotos are incompatible with inlining, but the value
3758 here could be used only in a diagnostic, for example. */
3764 /* Hook used by expand_expr to expand language-specific tree codes. */
3765 /* The only things that should go here are bits needed to expand
3766 constant initializers. Everything else should be handled by the
3767 gimplification routines. */
3770 c_expand_expr (tree exp, rtx target, enum machine_mode tmode,
3771 int modifier /* Actually enum_modifier. */,
3774 switch (TREE_CODE (exp))
3776 case COMPOUND_LITERAL_EXPR:
3778 /* Initialize the anonymous variable declared in the compound
3779 literal, then return the variable. */
3780 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
3781 emit_local_var (decl);
3782 return expand_expr_real (decl, target, tmode, modifier, alt_rtl);
3790 /* Hook used by staticp to handle language-specific tree codes. */
3793 c_staticp (tree exp)
3795 return (TREE_CODE (exp) == COMPOUND_LITERAL_EXPR
3796 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp))
3801 /* Given a boolean expression ARG, return a tree representing an increment
3802 or decrement (as indicated by CODE) of ARG. The front end must check for
3803 invalid cases (e.g., decrement in C++). */
3805 boolean_increment (enum tree_code code, tree arg)
3808 tree true_res = boolean_true_node;
3810 arg = stabilize_reference (arg);
3813 case PREINCREMENT_EXPR:
3814 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3816 case POSTINCREMENT_EXPR:
3817 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
3818 arg = save_expr (arg);
3819 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3820 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3822 case PREDECREMENT_EXPR:
3823 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3824 invert_truthvalue (arg));
3826 case POSTDECREMENT_EXPR:
3827 val = build2 (MODIFY_EXPR, TREE_TYPE (arg), arg,
3828 invert_truthvalue (arg));
3829 arg = save_expr (arg);
3830 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
3831 val = build2 (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
3836 TREE_SIDE_EFFECTS (val) = 1;
3840 /* Built-in macros for stddef.h, that require macros defined in this
3843 c_stddef_cpp_builtins(void)
3845 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE, 0);
3846 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE, 0);
3847 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE, 0);
3848 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE, 0);
3849 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE, 0);
3850 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE, 0);
3854 c_init_attributes (void)
3856 /* Fill in the built_in_attributes array. */
3857 #define DEF_ATTR_NULL_TREE(ENUM) \
3858 built_in_attributes[(int) ENUM] = NULL_TREE;
3859 #define DEF_ATTR_INT(ENUM, VALUE) \
3860 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
3861 #define DEF_ATTR_IDENT(ENUM, STRING) \
3862 built_in_attributes[(int) ENUM] = get_identifier (STRING);
3863 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
3864 built_in_attributes[(int) ENUM] \
3865 = tree_cons (built_in_attributes[(int) PURPOSE], \
3866 built_in_attributes[(int) VALUE], \
3867 built_in_attributes[(int) CHAIN]);
3868 #include "builtin-attrs.def"
3869 #undef DEF_ATTR_NULL_TREE
3871 #undef DEF_ATTR_IDENT
3872 #undef DEF_ATTR_TREE_LIST
3875 /* Attribute handlers common to C front ends. */
3877 /* Handle a "packed" attribute; arguments as in
3878 struct attribute_spec.handler. */
3881 handle_packed_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3882 int flags, bool *no_add_attrs)
3886 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
3887 *node = build_variant_type_copy (*node);
3888 TYPE_PACKED (*node) = 1;
3889 if (TYPE_MAIN_VARIANT (*node) == *node)
3891 /* If it is the main variant, then pack the other variants
3892 too. This happens in,
3895 struct Foo const *ptr; // creates a variant w/o packed flag
3896 } __ attribute__((packed)); // packs it now.
3900 for (probe = *node; probe; probe = TYPE_NEXT_VARIANT (probe))
3901 TYPE_PACKED (probe) = 1;
3905 else if (TREE_CODE (*node) == FIELD_DECL)
3906 DECL_PACKED (*node) = 1;
3907 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
3908 used for DECL_REGISTER. It wouldn't mean anything anyway.
3909 We can't set DECL_PACKED on the type of a TYPE_DECL, because
3910 that changes what the typedef is typing. */
3913 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3914 *no_add_attrs = true;
3920 /* Handle a "nocommon" attribute; arguments as in
3921 struct attribute_spec.handler. */
3924 handle_nocommon_attribute (tree *node, tree name,
3925 tree ARG_UNUSED (args),
3926 int ARG_UNUSED (flags), bool *no_add_attrs)
3928 if (TREE_CODE (*node) == VAR_DECL)
3929 DECL_COMMON (*node) = 0;
3932 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3933 *no_add_attrs = true;
3939 /* Handle a "common" attribute; arguments as in
3940 struct attribute_spec.handler. */
3943 handle_common_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3944 int ARG_UNUSED (flags), bool *no_add_attrs)
3946 if (TREE_CODE (*node) == VAR_DECL)
3947 DECL_COMMON (*node) = 1;
3950 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3951 *no_add_attrs = true;
3957 /* Handle a "noreturn" attribute; arguments as in
3958 struct attribute_spec.handler. */
3961 handle_noreturn_attribute (tree *node, tree name, tree ARG_UNUSED (args),
3962 int ARG_UNUSED (flags), bool *no_add_attrs)
3964 tree type = TREE_TYPE (*node);
3966 /* See FIXME comment in c_common_attribute_table. */
3967 if (TREE_CODE (*node) == FUNCTION_DECL)
3968 TREE_THIS_VOLATILE (*node) = 1;
3969 else if (TREE_CODE (type) == POINTER_TYPE
3970 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
3972 = build_pointer_type
3973 (build_type_variant (TREE_TYPE (type),
3974 TYPE_READONLY (TREE_TYPE (type)), 1));
3977 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3978 *no_add_attrs = true;
3984 /* Handle a "noinline" attribute; arguments as in
3985 struct attribute_spec.handler. */
3988 handle_noinline_attribute (tree *node, tree name,
3989 tree ARG_UNUSED (args),
3990 int ARG_UNUSED (flags), bool *no_add_attrs)
3992 if (TREE_CODE (*node) == FUNCTION_DECL)
3993 DECL_UNINLINABLE (*node) = 1;
3996 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
3997 *no_add_attrs = true;
4003 /* Handle a "always_inline" attribute; arguments as in
4004 struct attribute_spec.handler. */
4007 handle_always_inline_attribute (tree *node, tree name,
4008 tree ARG_UNUSED (args),
4009 int ARG_UNUSED (flags),
4012 if (TREE_CODE (*node) == FUNCTION_DECL)
4014 /* Do nothing else, just set the attribute. We'll get at
4015 it later with lookup_attribute. */
4019 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4020 *no_add_attrs = true;
4026 /* Handle a "used" attribute; arguments as in
4027 struct attribute_spec.handler. */
4030 handle_used_attribute (tree *pnode, tree name, tree ARG_UNUSED (args),
4031 int ARG_UNUSED (flags), bool *no_add_attrs)
4035 if (TREE_CODE (node) == FUNCTION_DECL
4036 || (TREE_CODE (node) == VAR_DECL && TREE_STATIC (node)))
4038 TREE_USED (node) = 1;
4039 DECL_PRESERVE_P (node) = 1;
4043 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4044 *no_add_attrs = true;
4050 /* Handle a "unused" attribute; arguments as in
4051 struct attribute_spec.handler. */
4054 handle_unused_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4055 int flags, bool *no_add_attrs)
4061 if (TREE_CODE (decl) == PARM_DECL
4062 || TREE_CODE (decl) == VAR_DECL
4063 || TREE_CODE (decl) == FUNCTION_DECL
4064 || TREE_CODE (decl) == LABEL_DECL
4065 || TREE_CODE (decl) == TYPE_DECL)
4066 TREE_USED (decl) = 1;
4069 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4070 *no_add_attrs = true;
4075 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4076 *node = build_variant_type_copy (*node);
4077 TREE_USED (*node) = 1;
4083 /* Handle a "const" attribute; arguments as in
4084 struct attribute_spec.handler. */
4087 handle_const_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4088 int ARG_UNUSED (flags), bool *no_add_attrs)
4090 tree type = TREE_TYPE (*node);
4092 /* See FIXME comment on noreturn in c_common_attribute_table. */
4093 if (TREE_CODE (*node) == FUNCTION_DECL)
4094 TREE_READONLY (*node) = 1;
4095 else if (TREE_CODE (type) == POINTER_TYPE
4096 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
4098 = build_pointer_type
4099 (build_type_variant (TREE_TYPE (type), 1,
4100 TREE_THIS_VOLATILE (TREE_TYPE (type))));
4103 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4104 *no_add_attrs = true;
4110 /* Handle a "transparent_union" attribute; arguments as in
4111 struct attribute_spec.handler. */
4114 handle_transparent_union_attribute (tree *node, tree name,
4115 tree ARG_UNUSED (args), int flags,
4118 tree decl = NULL_TREE;
4125 type = &TREE_TYPE (decl);
4126 is_type = TREE_CODE (*node) == TYPE_DECL;
4128 else if (TYPE_P (*node))
4129 type = node, is_type = 1;
4132 && TREE_CODE (*type) == UNION_TYPE
4134 || (TYPE_FIELDS (*type) != 0
4135 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))))
4137 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4138 *type = build_variant_type_copy (*type);
4139 TYPE_TRANSPARENT_UNION (*type) = 1;
4141 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
4142 && TREE_CODE (*type) == UNION_TYPE
4143 && TYPE_MODE (*type) == DECL_MODE (TYPE_FIELDS (*type)))
4144 DECL_TRANSPARENT_UNION (decl) = 1;
4147 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4148 *no_add_attrs = true;
4154 /* Handle a "constructor" attribute; arguments as in
4155 struct attribute_spec.handler. */
4158 handle_constructor_attribute (tree *node, tree name,
4159 tree ARG_UNUSED (args),
4160 int ARG_UNUSED (flags),
4164 tree type = TREE_TYPE (decl);
4166 if (TREE_CODE (decl) == FUNCTION_DECL
4167 && TREE_CODE (type) == FUNCTION_TYPE
4168 && decl_function_context (decl) == 0)
4170 DECL_STATIC_CONSTRUCTOR (decl) = 1;
4171 TREE_USED (decl) = 1;
4175 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4176 *no_add_attrs = true;
4182 /* Handle a "destructor" attribute; arguments as in
4183 struct attribute_spec.handler. */
4186 handle_destructor_attribute (tree *node, tree name,
4187 tree ARG_UNUSED (args),
4188 int ARG_UNUSED (flags),
4192 tree type = TREE_TYPE (decl);
4194 if (TREE_CODE (decl) == FUNCTION_DECL
4195 && TREE_CODE (type) == FUNCTION_TYPE
4196 && decl_function_context (decl) == 0)
4198 DECL_STATIC_DESTRUCTOR (decl) = 1;
4199 TREE_USED (decl) = 1;
4203 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4204 *no_add_attrs = true;
4210 /* Handle a "mode" attribute; arguments as in
4211 struct attribute_spec.handler. */
4214 handle_mode_attribute (tree *node, tree name, tree args,
4215 int ARG_UNUSED (flags), bool *no_add_attrs)
4219 *no_add_attrs = true;
4221 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
4222 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4226 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
4227 int len = strlen (p);
4228 enum machine_mode mode = VOIDmode;
4232 if (len > 4 && p[0] == '_' && p[1] == '_'
4233 && p[len - 1] == '_' && p[len - 2] == '_')
4235 char *newp = (char *) alloca (len - 1);
4237 strcpy (newp, &p[2]);
4238 newp[len - 4] = '\0';
4242 /* Change this type to have a type with the specified mode.
4243 First check for the special modes. */
4244 if (!strcmp (p, "byte"))
4246 else if (!strcmp (p, "word"))
4248 else if (!strcmp (p, "pointer"))
4251 for (j = 0; j < NUM_MACHINE_MODES; j++)
4252 if (!strcmp (p, GET_MODE_NAME (j)))
4254 mode = (enum machine_mode) j;
4258 if (mode == VOIDmode)
4260 error ("unknown machine mode %qs", p);
4265 switch (GET_MODE_CLASS (mode))
4268 case MODE_PARTIAL_INT:
4270 valid_mode = targetm.scalar_mode_supported_p (mode);
4273 case MODE_COMPLEX_INT:
4274 case MODE_COMPLEX_FLOAT:
4275 valid_mode = targetm.scalar_mode_supported_p (GET_MODE_INNER (mode));
4278 case MODE_VECTOR_INT:
4279 case MODE_VECTOR_FLOAT:
4280 warning ("specifying vector types with __attribute__ ((mode)) "
4282 warning ("use __attribute__ ((vector_size)) instead");
4283 valid_mode = vector_mode_valid_p (mode);
4291 error ("unable to emulate %qs", p);
4295 if (POINTER_TYPE_P (type))
4297 tree (*fn)(tree, enum machine_mode, bool);
4299 if (!targetm.valid_pointer_mode (mode))
4301 error ("invalid pointer mode %qs", p);
4305 if (TREE_CODE (type) == POINTER_TYPE)
4306 fn = build_pointer_type_for_mode;
4308 fn = build_reference_type_for_mode;
4309 typefm = fn (TREE_TYPE (type), mode, false);
4312 typefm = lang_hooks.types.type_for_mode (mode, TYPE_UNSIGNED (type));
4314 if (typefm == NULL_TREE)
4316 error ("no data type for mode %qs", p);
4319 else if (TREE_CODE (type) == ENUMERAL_TYPE)
4321 /* For enumeral types, copy the precision from the integer
4322 type returned above. If not an INTEGER_TYPE, we can't use
4323 this mode for this type. */
4324 if (TREE_CODE (typefm) != INTEGER_TYPE)
4326 error ("cannot use mode %qs for enumeral types", p);
4330 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4331 type = build_variant_type_copy (type);
4333 /* We cannot use layout_type here, because that will attempt
4334 to re-layout all variants, corrupting our original. */
4335 TYPE_PRECISION (type) = TYPE_PRECISION (typefm);
4336 TYPE_MIN_VALUE (type) = TYPE_MIN_VALUE (typefm);
4337 TYPE_MAX_VALUE (type) = TYPE_MAX_VALUE (typefm);
4338 TYPE_SIZE (type) = TYPE_SIZE (typefm);
4339 TYPE_SIZE_UNIT (type) = TYPE_SIZE_UNIT (typefm);
4340 TYPE_MODE (type) = TYPE_MODE (typefm);
4341 if (!TYPE_USER_ALIGN (type))
4342 TYPE_ALIGN (type) = TYPE_ALIGN (typefm);
4346 else if (VECTOR_MODE_P (mode)
4347 ? TREE_CODE (type) != TREE_CODE (TREE_TYPE (typefm))
4348 : TREE_CODE (type) != TREE_CODE (typefm))
4350 error ("mode %qs applied to inappropriate type", p);
4360 /* Handle a "section" attribute; arguments as in
4361 struct attribute_spec.handler. */
4364 handle_section_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4365 int ARG_UNUSED (flags), bool *no_add_attrs)
4369 if (targetm.have_named_sections)
4371 user_defined_section_attribute = true;
4373 if ((TREE_CODE (decl) == FUNCTION_DECL
4374 || TREE_CODE (decl) == VAR_DECL)
4375 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
4377 if (TREE_CODE (decl) == VAR_DECL
4378 && current_function_decl != NULL_TREE
4379 && !TREE_STATIC (decl))
4381 error ("%Jsection attribute cannot be specified for "
4382 "local variables", decl);
4383 *no_add_attrs = true;
4386 /* The decl may have already been given a section attribute
4387 from a previous declaration. Ensure they match. */
4388 else if (DECL_SECTION_NAME (decl) != NULL_TREE
4389 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
4390 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
4392 error ("%Jsection of %qD conflicts with previous declaration",
4394 *no_add_attrs = true;
4397 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
4401 error ("%Jsection attribute not allowed for %qD", *node, *node);
4402 *no_add_attrs = true;
4407 error ("%Jsection attributes are not supported for this target", *node);
4408 *no_add_attrs = true;
4414 /* Handle a "aligned" attribute; arguments as in
4415 struct attribute_spec.handler. */
4418 handle_aligned_attribute (tree *node, tree ARG_UNUSED (name), tree args,
4419 int flags, bool *no_add_attrs)
4421 tree decl = NULL_TREE;
4424 tree align_expr = (args ? TREE_VALUE (args)
4425 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
4431 type = &TREE_TYPE (decl);
4432 is_type = TREE_CODE (*node) == TYPE_DECL;
4434 else if (TYPE_P (*node))
4435 type = node, is_type = 1;
4437 /* Strip any NOPs of any kind. */
4438 while (TREE_CODE (align_expr) == NOP_EXPR
4439 || TREE_CODE (align_expr) == CONVERT_EXPR
4440 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
4441 align_expr = TREE_OPERAND (align_expr, 0);
4443 if (TREE_CODE (align_expr) != INTEGER_CST)
4445 error ("requested alignment is not a constant");
4446 *no_add_attrs = true;
4448 else if ((i = tree_log2 (align_expr)) == -1)
4450 error ("requested alignment is not a power of 2");
4451 *no_add_attrs = true;
4453 else if (i > HOST_BITS_PER_INT - 2)
4455 error ("requested alignment is too large");
4456 *no_add_attrs = true;
4460 /* If we have a TYPE_DECL, then copy the type, so that we
4461 don't accidentally modify a builtin type. See pushdecl. */
4462 if (decl && TREE_TYPE (decl) != error_mark_node
4463 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
4465 tree tt = TREE_TYPE (decl);
4466 *type = build_variant_type_copy (*type);
4467 DECL_ORIGINAL_TYPE (decl) = tt;
4468 TYPE_NAME (*type) = decl;
4469 TREE_USED (*type) = TREE_USED (decl);
4470 TREE_TYPE (decl) = *type;
4472 else if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4473 *type = build_variant_type_copy (*type);
4475 TYPE_ALIGN (*type) = (1 << i) * BITS_PER_UNIT;
4476 TYPE_USER_ALIGN (*type) = 1;
4478 else if (TREE_CODE (decl) != VAR_DECL
4479 && TREE_CODE (decl) != FIELD_DECL)
4481 error ("%Jalignment may not be specified for %qD", decl, decl);
4482 *no_add_attrs = true;
4486 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
4487 DECL_USER_ALIGN (decl) = 1;
4493 /* Handle a "weak" attribute; arguments as in
4494 struct attribute_spec.handler. */
4497 handle_weak_attribute (tree *node, tree ARG_UNUSED (name),
4498 tree ARG_UNUSED (args),
4499 int ARG_UNUSED (flags),
4500 bool * ARG_UNUSED (no_add_attrs))
4502 declare_weak (*node);
4507 /* Handle an "alias" attribute; arguments as in
4508 struct attribute_spec.handler. */
4511 handle_alias_attribute (tree *node, tree name, tree args,
4512 int ARG_UNUSED (flags), bool *no_add_attrs)
4516 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
4517 || (TREE_CODE (decl) != FUNCTION_DECL && !DECL_EXTERNAL (decl)))
4519 error ("%J%qD defined both normally and as an alias", decl, decl);
4520 *no_add_attrs = true;
4523 /* Note that the very first time we process a nested declaration,
4524 decl_function_context will not be set. Indeed, *would* never
4525 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
4526 we do below. After such frobbery, pushdecl would set the context.
4527 In any case, this is never what we want. */
4528 else if (decl_function_context (decl) == 0 && current_function_decl == NULL)
4532 id = TREE_VALUE (args);
4533 if (TREE_CODE (id) != STRING_CST)
4535 error ("alias argument not a string");
4536 *no_add_attrs = true;
4539 id = get_identifier (TREE_STRING_POINTER (id));
4540 /* This counts as a use of the object pointed to. */
4543 if (TREE_CODE (decl) == FUNCTION_DECL)
4544 DECL_INITIAL (decl) = error_mark_node;
4547 DECL_EXTERNAL (decl) = 0;
4548 TREE_STATIC (decl) = 1;
4553 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4554 *no_add_attrs = true;
4560 /* Handle an "visibility" attribute; arguments as in
4561 struct attribute_spec.handler. */
4564 handle_visibility_attribute (tree *node, tree name, tree args,
4565 int ARG_UNUSED (flags),
4569 tree id = TREE_VALUE (args);
4571 *no_add_attrs = true;
4575 if (TREE_CODE (*node) != RECORD_TYPE && TREE_CODE (*node) != UNION_TYPE)
4577 warning ("%qs attribute ignored on non-class types",
4578 IDENTIFIER_POINTER (name));
4582 else if (decl_function_context (decl) != 0 || !TREE_PUBLIC (decl))
4584 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4588 if (TREE_CODE (id) != STRING_CST)
4590 error ("visibility argument not a string");
4594 /* If this is a type, set the visibility on the type decl. */
4597 decl = TYPE_NAME (decl);
4600 if (TREE_CODE (decl) == IDENTIFIER_NODE)
4602 warning ("%qE attribute ignored on types",
4608 if (strcmp (TREE_STRING_POINTER (id), "default") == 0)
4609 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4610 else if (strcmp (TREE_STRING_POINTER (id), "internal") == 0)
4611 DECL_VISIBILITY (decl) = VISIBILITY_INTERNAL;
4612 else if (strcmp (TREE_STRING_POINTER (id), "hidden") == 0)
4613 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
4614 else if (strcmp (TREE_STRING_POINTER (id), "protected") == 0)
4615 DECL_VISIBILITY (decl) = VISIBILITY_PROTECTED;
4617 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
4618 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4620 /* For decls only, go ahead and attach the attribute to the node as well.
4621 This is needed so we can determine whether we have VISIBILITY_DEFAULT
4622 because the visibility was not specified, or because it was explicitly
4623 overridden from the class visibility. */
4625 *no_add_attrs = false;
4630 /* Determine the ELF symbol visibility for DECL, which is either a
4631 variable or a function. It is an error to use this function if a
4632 definition of DECL is not available in this translation unit.
4633 Returns true if the final visibility has been determined by this
4634 function; false if the caller is free to make additional
4638 c_determine_visibility (tree decl)
4640 gcc_assert (TREE_CODE (decl) == VAR_DECL
4641 || TREE_CODE (decl) == FUNCTION_DECL);
4643 /* If the user explicitly specified the visibility with an
4644 attribute, honor that. DECL_VISIBILITY will have been set during
4645 the processing of the attribute. We check for an explicit
4646 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
4647 to distinguish the use of an attribute from the use of a "#pragma
4648 GCC visibility push(...)"; in the latter case we still want other
4649 considerations to be able to overrule the #pragma. */
4650 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl)))
4653 /* Anything that is exported must have default visibility. */
4654 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
4655 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl)))
4657 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
4658 DECL_VISIBILITY_SPECIFIED (decl) = 1;
4665 /* Handle an "tls_model" attribute; arguments as in
4666 struct attribute_spec.handler. */
4669 handle_tls_model_attribute (tree *node, tree name, tree args,
4670 int ARG_UNUSED (flags), bool *no_add_attrs)
4674 if (!DECL_THREAD_LOCAL (decl))
4676 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4677 *no_add_attrs = true;
4683 id = TREE_VALUE (args);
4684 if (TREE_CODE (id) != STRING_CST)
4686 error ("tls_model argument not a string");
4687 *no_add_attrs = true;
4690 if (strcmp (TREE_STRING_POINTER (id), "local-exec")
4691 && strcmp (TREE_STRING_POINTER (id), "initial-exec")
4692 && strcmp (TREE_STRING_POINTER (id), "local-dynamic")
4693 && strcmp (TREE_STRING_POINTER (id), "global-dynamic"))
4695 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
4696 *no_add_attrs = true;
4704 /* Handle a "no_instrument_function" attribute; arguments as in
4705 struct attribute_spec.handler. */
4708 handle_no_instrument_function_attribute (tree *node, tree name,
4709 tree ARG_UNUSED (args),
4710 int ARG_UNUSED (flags),
4715 if (TREE_CODE (decl) != FUNCTION_DECL)
4717 error ("%J%qE attribute applies only to functions", decl, name);
4718 *no_add_attrs = true;
4720 else if (DECL_INITIAL (decl))
4722 error ("%Jcan%'t set %qE attribute after definition", decl, name);
4723 *no_add_attrs = true;
4726 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
4731 /* Handle a "malloc" attribute; arguments as in
4732 struct attribute_spec.handler. */
4735 handle_malloc_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4736 int ARG_UNUSED (flags), bool *no_add_attrs)
4738 if (TREE_CODE (*node) == FUNCTION_DECL)
4739 DECL_IS_MALLOC (*node) = 1;
4740 /* ??? TODO: Support types. */
4743 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4744 *no_add_attrs = true;
4750 /* Handle a "no_limit_stack" attribute; arguments as in
4751 struct attribute_spec.handler. */
4754 handle_no_limit_stack_attribute (tree *node, tree name,
4755 tree ARG_UNUSED (args),
4756 int ARG_UNUSED (flags),
4761 if (TREE_CODE (decl) != FUNCTION_DECL)
4763 error ("%J%qE attribute applies only to functions", decl, name);
4764 *no_add_attrs = true;
4766 else if (DECL_INITIAL (decl))
4768 error ("%Jcan%'t set %qE attribute after definition", decl, name);
4769 *no_add_attrs = true;
4772 DECL_NO_LIMIT_STACK (decl) = 1;
4777 /* Handle a "pure" attribute; arguments as in
4778 struct attribute_spec.handler. */
4781 handle_pure_attribute (tree *node, tree name, tree ARG_UNUSED (args),
4782 int ARG_UNUSED (flags), bool *no_add_attrs)
4784 if (TREE_CODE (*node) == FUNCTION_DECL)
4785 DECL_IS_PURE (*node) = 1;
4786 /* ??? TODO: Support types. */
4789 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4790 *no_add_attrs = true;
4796 /* Handle a "deprecated" attribute; arguments as in
4797 struct attribute_spec.handler. */
4800 handle_deprecated_attribute (tree *node, tree name,
4801 tree ARG_UNUSED (args), int flags,
4804 tree type = NULL_TREE;
4806 const char *what = NULL;
4811 type = TREE_TYPE (decl);
4813 if (TREE_CODE (decl) == TYPE_DECL
4814 || TREE_CODE (decl) == PARM_DECL
4815 || TREE_CODE (decl) == VAR_DECL
4816 || TREE_CODE (decl) == FUNCTION_DECL
4817 || TREE_CODE (decl) == FIELD_DECL)
4818 TREE_DEPRECATED (decl) = 1;
4822 else if (TYPE_P (*node))
4824 if (!(flags & (int) ATTR_FLAG_TYPE_IN_PLACE))
4825 *node = build_variant_type_copy (*node);
4826 TREE_DEPRECATED (*node) = 1;
4834 *no_add_attrs = true;
4835 if (type && TYPE_NAME (type))
4837 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
4838 what = IDENTIFIER_POINTER (TYPE_NAME (*node));
4839 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
4840 && DECL_NAME (TYPE_NAME (type)))
4841 what = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
4844 warning ("%qs attribute ignored for %qs",
4845 IDENTIFIER_POINTER (name), what);
4847 warning ("%qs attribute ignored",
4848 IDENTIFIER_POINTER (name));
4854 /* Handle a "vector_size" attribute; arguments as in
4855 struct attribute_spec.handler. */
4858 handle_vector_size_attribute (tree *node, tree name, tree args,
4859 int ARG_UNUSED (flags),
4862 unsigned HOST_WIDE_INT vecsize, nunits;
4863 enum machine_mode orig_mode;
4864 tree type = *node, new_type, size;
4866 *no_add_attrs = true;
4868 /* Stripping NON_LVALUE_EXPR allows declarations such as
4869 typedef short v4si __attribute__((vector_size (4 * sizeof(short)))). */
4870 size = TREE_VALUE (args);
4871 if (TREE_CODE (size) == NON_LVALUE_EXPR)
4872 size = TREE_OPERAND (size, 0);
4874 if (!host_integerp (size, 1))
4876 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
4880 /* Get the vector size (in bytes). */
4881 vecsize = tree_low_cst (size, 1);
4883 /* We need to provide for vector pointers, vector arrays, and
4884 functions returning vectors. For example:
4886 __attribute__((vector_size(16))) short *foo;
4888 In this case, the mode is SI, but the type being modified is
4889 HI, so we need to look further. */
4891 while (POINTER_TYPE_P (type)
4892 || TREE_CODE (type) == FUNCTION_TYPE
4893 || TREE_CODE (type) == METHOD_TYPE
4894 || TREE_CODE (type) == ARRAY_TYPE)
4895 type = TREE_TYPE (type);
4897 /* Get the mode of the type being modified. */
4898 orig_mode = TYPE_MODE (type);
4900 if (TREE_CODE (type) == RECORD_TYPE
4901 || (GET_MODE_CLASS (orig_mode) != MODE_FLOAT
4902 && GET_MODE_CLASS (orig_mode) != MODE_INT)
4903 || !host_integerp (TYPE_SIZE_UNIT (type), 1))
4905 error ("invalid vector type for attribute %qs",
4906 IDENTIFIER_POINTER (name));
4910 /* Calculate how many units fit in the vector. */
4911 nunits = vecsize / tree_low_cst (TYPE_SIZE_UNIT (type), 1);
4912 if (nunits & (nunits - 1))
4914 error ("number of components of the vector not a power of two");
4918 new_type = build_vector_type (type, nunits);
4920 /* Build back pointers if needed. */
4921 *node = reconstruct_complex_type (*node, new_type);
4926 /* Handle the "nonnull" attribute. */
4928 handle_nonnull_attribute (tree *node, tree ARG_UNUSED (name),
4929 tree args, int ARG_UNUSED (flags),
4933 unsigned HOST_WIDE_INT attr_arg_num;
4935 /* If no arguments are specified, all pointer arguments should be
4936 non-null. Verify a full prototype is given so that the arguments
4937 will have the correct types when we actually check them later. */
4940 if (!TYPE_ARG_TYPES (type))
4942 error ("nonnull attribute without arguments on a non-prototype");
4943 *no_add_attrs = true;
4948 /* Argument list specified. Verify that each argument number references
4949 a pointer argument. */
4950 for (attr_arg_num = 1; args; args = TREE_CHAIN (args))
4953 unsigned HOST_WIDE_INT arg_num = 0, ck_num;
4955 if (!get_nonnull_operand (TREE_VALUE (args), &arg_num))
4957 error ("nonnull argument has invalid operand number (argument %lu)",
4958 (unsigned long) attr_arg_num);
4959 *no_add_attrs = true;
4963 argument = TYPE_ARG_TYPES (type);
4966 for (ck_num = 1; ; ck_num++)
4968 if (!argument || ck_num == arg_num)
4970 argument = TREE_CHAIN (argument);
4974 || TREE_CODE (TREE_VALUE (argument)) == VOID_TYPE)
4976 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
4977 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4978 *no_add_attrs = true;
4982 if (TREE_CODE (TREE_VALUE (argument)) != POINTER_TYPE)
4984 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
4985 (unsigned long) attr_arg_num, (unsigned long) arg_num);
4986 *no_add_attrs = true;
4995 /* Check the argument list of a function call for null in argument slots
4996 that are marked as requiring a non-null pointer argument. */
4999 check_function_nonnull (tree attrs, tree params)
5001 tree a, args, param;
5004 for (a = attrs; a; a = TREE_CHAIN (a))
5006 if (is_attribute_p ("nonnull", TREE_PURPOSE (a)))
5008 args = TREE_VALUE (a);
5010 /* Walk the argument list. If we encounter an argument number we
5011 should check for non-null, do it. If the attribute has no args,
5012 then every pointer argument is checked (in which case the check
5013 for pointer type is done in check_nonnull_arg). */
5014 for (param = params, param_num = 1; ;
5015 param_num++, param = TREE_CHAIN (param))
5019 if (!args || nonnull_check_p (args, param_num))
5020 check_function_arguments_recurse (check_nonnull_arg, NULL,
5028 /* Check that the Nth argument of a function call (counting backwards
5029 from the end) is a (pointer)0. */
5032 check_function_sentinel (tree attrs, tree params)
5034 tree attr = lookup_attribute ("sentinel", attrs);
5039 warning ("missing sentinel in function call");
5045 if (TREE_VALUE (attr))
5047 tree p = TREE_VALUE (TREE_VALUE (attr));
5049 pos = TREE_INT_CST_LOW (p);
5052 sentinel = end = params;
5054 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5055 while (pos > 0 && TREE_CHAIN (end))
5058 end = TREE_CHAIN (end);
5062 warning ("not enough arguments to fit a sentinel");
5066 /* Now advance both until we find the last parameter. */
5067 while (TREE_CHAIN (end))
5069 end = TREE_CHAIN (end);
5070 sentinel = TREE_CHAIN (sentinel);
5073 /* Validate the sentinel. */
5074 if (!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel)))
5075 || !integer_zerop (TREE_VALUE (sentinel)))
5076 warning ("missing sentinel in function call");
5081 /* Helper for check_function_nonnull; given a list of operands which
5082 must be non-null in ARGS, determine if operand PARAM_NUM should be
5086 nonnull_check_p (tree args, unsigned HOST_WIDE_INT param_num)
5088 unsigned HOST_WIDE_INT arg_num = 0;
5090 for (; args; args = TREE_CHAIN (args))
5092 bool found = get_nonnull_operand (TREE_VALUE (args), &arg_num);
5096 if (arg_num == param_num)
5102 /* Check that the function argument PARAM (which is operand number
5103 PARAM_NUM) is non-null. This is called by check_function_nonnull
5104 via check_function_arguments_recurse. */
5107 check_nonnull_arg (void * ARG_UNUSED (ctx), tree param,
5108 unsigned HOST_WIDE_INT param_num)
5110 /* Just skip checking the argument if it's not a pointer. This can
5111 happen if the "nonnull" attribute was given without an operand
5112 list (which means to check every pointer argument). */
5114 if (TREE_CODE (TREE_TYPE (param)) != POINTER_TYPE)
5117 if (integer_zerop (param))
5118 warning ("null argument where non-null required (argument %lu)",
5119 (unsigned long) param_num);
5122 /* Helper for nonnull attribute handling; fetch the operand number
5123 from the attribute argument list. */
5126 get_nonnull_operand (tree arg_num_expr, unsigned HOST_WIDE_INT *valp)
5128 /* Strip any conversions from the arg number and verify they
5130 while (TREE_CODE (arg_num_expr) == NOP_EXPR
5131 || TREE_CODE (arg_num_expr) == CONVERT_EXPR
5132 || TREE_CODE (arg_num_expr) == NON_LVALUE_EXPR)
5133 arg_num_expr = TREE_OPERAND (arg_num_expr, 0);
5135 if (TREE_CODE (arg_num_expr) != INTEGER_CST
5136 || TREE_INT_CST_HIGH (arg_num_expr) != 0)
5139 *valp = TREE_INT_CST_LOW (arg_num_expr);
5143 /* Handle a "nothrow" attribute; arguments as in
5144 struct attribute_spec.handler. */
5147 handle_nothrow_attribute (tree *node, tree name, tree ARG_UNUSED (args),
5148 int ARG_UNUSED (flags), bool *no_add_attrs)
5150 if (TREE_CODE (*node) == FUNCTION_DECL)
5151 TREE_NOTHROW (*node) = 1;
5152 /* ??? TODO: Support types. */
5155 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
5156 *no_add_attrs = true;
5162 /* Handle a "cleanup" attribute; arguments as in
5163 struct attribute_spec.handler. */
5166 handle_cleanup_attribute (tree *node, tree name, tree args,
5167 int ARG_UNUSED (flags), bool *no_add_attrs)
5170 tree cleanup_id, cleanup_decl;
5172 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5173 for global destructors in C++. This requires infrastructure that
5174 we don't have generically at the moment. It's also not a feature
5175 we'd be missing too much, since we do have attribute constructor. */
5176 if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
5178 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
5179 *no_add_attrs = true;
5183 /* Verify that the argument is a function in scope. */
5184 /* ??? We could support pointers to functions here as well, if
5185 that was considered desirable. */
5186 cleanup_id = TREE_VALUE (args);
5187 if (TREE_CODE (cleanup_id) != IDENTIFIER_NODE)
5189 error ("cleanup argument not an identifier");
5190 *no_add_attrs = true;
5193 cleanup_decl = lookup_name (cleanup_id);
5194 if (!cleanup_decl || TREE_CODE (cleanup_decl) != FUNCTION_DECL)
5196 error ("cleanup argument not a function");
5197 *no_add_attrs = true;
5201 /* That the function has proper type is checked with the
5202 eventual call to build_function_call. */
5207 /* Handle a "warn_unused_result" attribute. No special handling. */
5210 handle_warn_unused_result_attribute (tree *node, tree name,
5211 tree ARG_UNUSED (args),
5212 int ARG_UNUSED (flags), bool *no_add_attrs)
5214 /* Ignore the attribute for functions not returning any value. */
5215 if (VOID_TYPE_P (TREE_TYPE (*node)))
5217 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name));
5218 *no_add_attrs = true;
5224 /* Handle a "sentinel" attribute. */
5227 handle_sentinel_attribute (tree *node, tree name, tree args,
5228 int ARG_UNUSED (flags), bool *no_add_attrs)
5230 tree params = TYPE_ARG_TYPES (*node);
5234 warning ("%qs attribute requires prototypes with named arguments",
5235 IDENTIFIER_POINTER (name));
5236 *no_add_attrs = true;
5240 while (TREE_CHAIN (params))
5241 params = TREE_CHAIN (params);
5243 if (VOID_TYPE_P (TREE_VALUE (params)))
5245 warning ("%qs attribute only applies to variadic functions",
5246 IDENTIFIER_POINTER (name));
5247 *no_add_attrs = true;
5253 tree position = TREE_VALUE (args);
5255 STRIP_NOPS (position);
5256 if (TREE_CODE (position) != INTEGER_CST)
5258 warning ("requested position is not an integer constant");
5259 *no_add_attrs = true;
5263 if (tree_int_cst_lt (position, integer_zero_node))
5265 warning ("requested position is less than zero");
5266 *no_add_attrs = true;
5274 /* Check for valid arguments being passed to a function. */
5276 check_function_arguments (tree attrs, tree params)
5278 /* Check for null being passed in a pointer argument that must be
5279 non-null. We also need to do this if format checking is enabled. */
5282 check_function_nonnull (attrs, params);
5284 /* Check for errors in format strings. */
5288 check_function_format (attrs, params);
5289 check_function_sentinel (attrs, params);
5293 /* Generic argument checking recursion routine. PARAM is the argument to
5294 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
5295 once the argument is resolved. CTX is context for the callback. */
5297 check_function_arguments_recurse (void (*callback)
5298 (void *, tree, unsigned HOST_WIDE_INT),
5299 void *ctx, tree param,
5300 unsigned HOST_WIDE_INT param_num)
5302 if (TREE_CODE (param) == NOP_EXPR)
5304 /* Strip coercion. */
5305 check_function_arguments_recurse (callback, ctx,
5306 TREE_OPERAND (param, 0), param_num);
5310 if (TREE_CODE (param) == CALL_EXPR)
5312 tree type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (param, 0)));
5314 bool found_format_arg = false;
5316 /* See if this is a call to a known internationalization function
5317 that modifies a format arg. Such a function may have multiple
5318 format_arg attributes (for example, ngettext). */
5320 for (attrs = TYPE_ATTRIBUTES (type);
5322 attrs = TREE_CHAIN (attrs))
5323 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs)))
5326 tree format_num_expr;
5330 /* Extract the argument number, which was previously checked
5332 format_num_expr = TREE_VALUE (TREE_VALUE (attrs));
5333 while (TREE_CODE (format_num_expr) == NOP_EXPR
5334 || TREE_CODE (format_num_expr) == CONVERT_EXPR
5335 || TREE_CODE (format_num_expr) == NON_LVALUE_EXPR)
5336 format_num_expr = TREE_OPERAND (format_num_expr, 0);
5338 gcc_assert (TREE_CODE (format_num_expr) == INTEGER_CST
5339 && !TREE_INT_CST_HIGH (format_num_expr));
5341 format_num = TREE_INT_CST_LOW (format_num_expr);
5343 for (inner_args = TREE_OPERAND (param, 1), i = 1;
5345 inner_args = TREE_CHAIN (inner_args), i++)
5346 if (i == format_num)
5348 check_function_arguments_recurse (callback, ctx,
5349 TREE_VALUE (inner_args),
5351 found_format_arg = true;
5356 /* If we found a format_arg attribute and did a recursive check,
5357 we are done with checking this argument. Otherwise, we continue
5358 and this will be considered a non-literal. */
5359 if (found_format_arg)
5363 if (TREE_CODE (param) == COND_EXPR)
5365 /* Check both halves of the conditional expression. */
5366 check_function_arguments_recurse (callback, ctx,
5367 TREE_OPERAND (param, 1), param_num);
5368 check_function_arguments_recurse (callback, ctx,
5369 TREE_OPERAND (param, 2), param_num);
5373 (*callback) (ctx, param, param_num);
5376 /* Function to help qsort sort FIELD_DECLs by name order. */
5379 field_decl_cmp (const void *x_p, const void *y_p)
5381 const tree *const x = (const tree *const) x_p;
5382 const tree *const y = (const tree *const) y_p;
5384 if (DECL_NAME (*x) == DECL_NAME (*y))
5385 /* A nontype is "greater" than a type. */
5386 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5387 if (DECL_NAME (*x) == NULL_TREE)
5389 if (DECL_NAME (*y) == NULL_TREE)
5391 if (DECL_NAME (*x) < DECL_NAME (*y))
5397 gt_pointer_operator new_value;
5401 /* This routine compares two fields like field_decl_cmp but using the
5402 pointer operator in resort_data. */
5405 resort_field_decl_cmp (const void *x_p, const void *y_p)
5407 const tree *const x = (const tree *const) x_p;
5408 const tree *const y = (const tree *const) y_p;
5410 if (DECL_NAME (*x) == DECL_NAME (*y))
5411 /* A nontype is "greater" than a type. */
5412 return (TREE_CODE (*y) == TYPE_DECL) - (TREE_CODE (*x) == TYPE_DECL);
5413 if (DECL_NAME (*x) == NULL_TREE)
5415 if (DECL_NAME (*y) == NULL_TREE)
5418 tree d1 = DECL_NAME (*x);
5419 tree d2 = DECL_NAME (*y);
5420 resort_data.new_value (&d1, resort_data.cookie);
5421 resort_data.new_value (&d2, resort_data.cookie);
5428 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
5431 resort_sorted_fields (void *obj,
5432 void * ARG_UNUSED (orig_obj),
5433 gt_pointer_operator new_value,
5436 struct sorted_fields_type *sf = (struct sorted_fields_type *) obj;
5437 resort_data.new_value = new_value;
5438 resort_data.cookie = cookie;
5439 qsort (&sf->elts[0], sf->len, sizeof (tree),
5440 resort_field_decl_cmp);
5443 /* Subroutine of c_parse_error.
5444 Return the result of concatenating LHS and RHS. RHS is really
5445 a string literal, its first character is indicated by RHS_START and
5446 RHS_SIZE is its length (including the terminating NUL character).
5448 The caller is responsible for deleting the returned pointer. */
5451 catenate_strings (const char *lhs, const char *rhs_start, int rhs_size)
5453 const int lhs_size = strlen (lhs);
5454 char *result = XNEWVEC (char, lhs_size + rhs_size);
5455 strncpy (result, lhs, lhs_size);
5456 strncpy (result + lhs_size, rhs_start, rhs_size);
5460 /* Issue the error given by MSGID, indicating that it occurred before
5461 TOKEN, which had the associated VALUE. */
5464 c_parse_error (const char *msgid, enum cpp_ttype token, tree value)
5466 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
5468 char *message = NULL;
5470 if (token == CPP_EOF)
5471 message = catenate_messages (msgid, " at end of input");
5472 else if (token == CPP_CHAR || token == CPP_WCHAR)
5474 unsigned int val = TREE_INT_CST_LOW (value);
5475 const char *const ell = (token == CPP_CHAR) ? "" : "L";
5476 if (val <= UCHAR_MAX && ISGRAPH (val))
5477 message = catenate_messages (msgid, " before %s'%c'");
5479 message = catenate_messages (msgid, " before %s'\\x%x'");
5481 error (message, ell, val);
5485 else if (token == CPP_STRING || token == CPP_WSTRING)
5486 message = catenate_messages (msgid, " before string constant");
5487 else if (token == CPP_NUMBER)
5488 message = catenate_messages (msgid, " before numeric constant");
5489 else if (token == CPP_NAME)
5491 message = catenate_messages (msgid, " before %qs");
5492 error (message, IDENTIFIER_POINTER (value));
5496 else if (token < N_TTYPES)
5498 message = catenate_messages (msgid, " before %qs token");
5499 error (message, cpp_type2name (token));
5511 #undef catenate_messages
5514 /* Walk a gimplified function and warn for functions whose return value is
5515 ignored and attribute((warn_unused_result)) is set. This is done before
5516 inlining, so we don't have to worry about that. */
5519 c_warn_unused_result (tree *top_p)
5522 tree_stmt_iterator i;
5525 switch (TREE_CODE (t))
5527 case STATEMENT_LIST:
5528 for (i = tsi_start (*top_p); !tsi_end_p (i); tsi_next (&i))
5529 c_warn_unused_result (tsi_stmt_ptr (i));
5533 c_warn_unused_result (&COND_EXPR_THEN (t));
5534 c_warn_unused_result (&COND_EXPR_ELSE (t));
5537 c_warn_unused_result (&BIND_EXPR_BODY (t));
5539 case TRY_FINALLY_EXPR:
5540 case TRY_CATCH_EXPR:
5541 c_warn_unused_result (&TREE_OPERAND (t, 0));
5542 c_warn_unused_result (&TREE_OPERAND (t, 1));
5545 c_warn_unused_result (&CATCH_BODY (t));
5547 case EH_FILTER_EXPR:
5548 c_warn_unused_result (&EH_FILTER_FAILURE (t));
5555 /* This is a naked call, as opposed to a CALL_EXPR nested inside
5556 a MODIFY_EXPR. All calls whose value is ignored should be
5557 represented like this. Look for the attribute. */
5558 fdecl = get_callee_fndecl (t);
5560 ftype = TREE_TYPE (fdecl);
5563 ftype = TREE_TYPE (TREE_OPERAND (t, 0));
5564 /* Look past pointer-to-function to the function type itself. */
5565 ftype = TREE_TYPE (ftype);
5568 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
5571 warning ("%Hignoring return value of %qD, "
5572 "declared with attribute warn_unused_result",
5573 EXPR_LOCUS (t), fdecl);
5575 warning ("%Hignoring return value of function "
5576 "declared with attribute warn_unused_result",
5582 /* Not a container, not a call, or a call whose value is used. */
5587 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
5588 component references, with an INDIRECT_REF at the bottom; much like
5589 the traditional rendering of offsetof as a macro. Returns the folded
5590 and properly cast result. */
5593 fold_offsetof_1 (tree expr)
5595 enum tree_code code = PLUS_EXPR;
5598 switch (TREE_CODE (expr))
5604 return size_zero_node;
5607 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5608 if (base == error_mark_node)
5611 t = TREE_OPERAND (expr, 1);
5612 if (DECL_C_BIT_FIELD (t))
5614 error ("attempt to take address of bit-field structure "
5615 "member %qs", IDENTIFIER_POINTER (DECL_NAME (t)));
5616 return error_mark_node;
5618 off = size_binop (PLUS_EXPR, DECL_FIELD_OFFSET (t),
5619 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t), 1)
5624 base = fold_offsetof_1 (TREE_OPERAND (expr, 0));
5625 if (base == error_mark_node)
5628 t = TREE_OPERAND (expr, 1);
5629 if (TREE_CODE (t) == INTEGER_CST && tree_int_cst_sgn (t) < 0)
5632 t = fold (build1 (NEGATE_EXPR, TREE_TYPE (t), t));
5634 t = convert (sizetype, t);
5635 off = size_binop (MULT_EXPR, TYPE_SIZE_UNIT (TREE_TYPE (expr)), t);
5642 return size_binop (code, base, off);
5646 fold_offsetof (tree expr)
5648 /* Convert back from the internal sizetype to size_t. */
5649 return convert (size_type_node, fold_offsetof_1 (expr));
5652 /* Return nonzero if REF is an lvalue valid for this language;
5653 otherwise, print an error message and return zero. USE says
5654 how the lvalue is being used and so selects the error message. */
5657 lvalue_or_else (tree ref, enum lvalue_use use)
5659 int win = lvalue_p (ref);
5666 error ("invalid lvalue in assignment");
5669 error ("invalid lvalue in increment");
5672 error ("invalid lvalue in decrement");
5675 error ("invalid lvalue in unary %<&%>");
5678 error ("invalid lvalue in asm statement");
5688 #include "gt-c-common.h"