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, 2006, 2007 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, 51 Franklin Street, Fifth Floor, 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"
52 cpp_reader
*parse_in
; /* Declared in c-pragma.h. */
54 /* We let tm.h override the types used here, to handle trivial differences
55 such as the choice of unsigned int or long unsigned int for size_t.
56 When machines start needing nontrivial differences in the size type,
57 it would be best to do something here to figure out automatically
58 from other information what type to use. */
61 #define SIZE_TYPE "long unsigned int"
65 #define PID_TYPE "int"
69 #define WCHAR_TYPE "int"
72 /* WCHAR_TYPE gets overridden by -fshort-wchar. */
73 #define MODIFIED_WCHAR_TYPE \
74 (flag_short_wchar ? "short unsigned int" : WCHAR_TYPE)
77 #define PTRDIFF_TYPE "long int"
81 #define WINT_TYPE "unsigned int"
85 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
87 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
93 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
95 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 ? "long unsigned int" \
97 : "long long unsigned int"))
100 /* The following symbols are subsumed in the c_global_trees array, and
101 listed here individually for documentation purposes.
103 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
105 tree short_integer_type_node;
106 tree long_integer_type_node;
107 tree long_long_integer_type_node;
109 tree short_unsigned_type_node;
110 tree long_unsigned_type_node;
111 tree long_long_unsigned_type_node;
113 tree truthvalue_type_node;
114 tree truthvalue_false_node;
115 tree truthvalue_true_node;
117 tree ptrdiff_type_node;
119 tree unsigned_char_type_node;
120 tree signed_char_type_node;
121 tree wchar_type_node;
122 tree signed_wchar_type_node;
123 tree unsigned_wchar_type_node;
125 tree float_type_node;
126 tree double_type_node;
127 tree long_double_type_node;
129 tree complex_integer_type_node;
130 tree complex_float_type_node;
131 tree complex_double_type_node;
132 tree complex_long_double_type_node;
134 tree dfloat32_type_node;
135 tree dfloat64_type_node;
136 tree_dfloat128_type_node;
138 tree intQI_type_node;
139 tree intHI_type_node;
140 tree intSI_type_node;
141 tree intDI_type_node;
142 tree intTI_type_node;
144 tree unsigned_intQI_type_node;
145 tree unsigned_intHI_type_node;
146 tree unsigned_intSI_type_node;
147 tree unsigned_intDI_type_node;
148 tree unsigned_intTI_type_node;
150 tree widest_integer_literal_type_node;
151 tree widest_unsigned_literal_type_node;
153 Nodes for types `void *' and `const void *'.
155 tree ptr_type_node, const_ptr_type_node;
157 Nodes for types `char *' and `const char *'.
159 tree string_type_node, const_string_type_node;
161 Type `char[SOMENUMBER]'.
162 Used when an array of char is needed and the size is irrelevant.
164 tree char_array_type_node;
166 Type `int[SOMENUMBER]' or something like it.
167 Used when an array of int needed and the size is irrelevant.
169 tree int_array_type_node;
171 Type `wchar_t[SOMENUMBER]' or something like it.
172 Used when a wide string literal is created.
174 tree wchar_array_type_node;
176 Type `int ()' -- used for implicit declaration of functions.
178 tree default_function_type;
180 A VOID_TYPE node, packaged in a TREE_LIST.
184 The lazily created VAR_DECLs for __FUNCTION__, __PRETTY_FUNCTION__,
185 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
186 VAR_DECLS, but C++ does.)
188 tree function_name_decl_node;
189 tree pretty_function_name_decl_node;
190 tree c99_function_name_decl_node;
192 Stack of nested function name VAR_DECLs.
194 tree saved_function_name_decls;
198 tree c_global_trees
[CTI_MAX
];
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 implicit conversions between vectors with
258 differing numbers of subparts and/or differing element types. */
259 int flag_lax_vector_conversions
;
261 /* Nonzero means allow Microsoft extensions without warnings or errors. */
262 int flag_ms_extensions
;
264 /* Nonzero means don't recognize the keyword `asm'. */
268 /* Nonzero means to treat bitfields as signed unless they say `unsigned'. */
270 int flag_signed_bitfields
= 1;
272 /* Warn about #pragma directives that are not recognized. */
274 int warn_unknown_pragmas
; /* Tri state variable. */
276 /* Warn about format/argument anomalies in calls to formatted I/O functions
277 (*printf, *scanf, strftime, strfmon, etc.). */
281 /* Warn about using __null (as NULL in C++) as sentinel. For code compiled
282 with GCC this doesn't matter as __null is guaranteed to have the right
285 int warn_strict_null_sentinel
;
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 code generation will be altered to support
293 "zero-link" execution. This currently affects ObjC only, but may
294 affect other languages in the future. */
295 int flag_zero_link
= 0;
297 /* Nonzero means emit an '__OBJC, __image_info' for the current translation
298 unit. It will inform the ObjC runtime that class definition(s) herein
299 contained are to replace one(s) previously loaded. */
300 int flag_replace_objc_classes
= 0;
302 /* C/ObjC language option variables. */
305 /* Nonzero means allow type mismatches in conditional expressions;
306 just make their values `void'. */
308 int flag_cond_mismatch
;
310 /* Nonzero means enable C89 Amendment 1 features. */
314 /* Nonzero means use the ISO C99 dialect of C. */
318 /* Nonzero means that we have builtin functions, and main is an int. */
322 /* Warn if main is suspicious. */
327 /* ObjC language option variables. */
330 /* Open and close the file for outputting class declarations, if
333 int flag_gen_declaration
;
335 /* Tells the compiler that this is a special run. Do not perform any
336 compiling, instead we are to test some platform dependent features
337 and output a C header file with appropriate definitions. */
339 int print_struct_values
;
341 /* Tells the compiler what is the constant string class for Objc. */
343 const char *constant_string_class_name
;
346 /* C++ language option variables. */
349 /* Nonzero means don't recognize any extension keywords. */
351 int flag_no_gnu_keywords
;
353 /* Nonzero means do emit exported implementations of functions even if
354 they can be inlined. */
356 int flag_implement_inlines
= 1;
358 /* Nonzero means that implicit instantiations will be emitted if needed. */
360 int flag_implicit_templates
= 1;
362 /* Nonzero means that implicit instantiations of inline templates will be
363 emitted if needed, even if instantiations of non-inline templates
366 int flag_implicit_inline_templates
= 1;
368 /* Nonzero means generate separate instantiation control files and
369 juggle them at link time. */
371 int flag_use_repository
;
373 /* Nonzero if we want to issue diagnostics that the standard says are not
376 int flag_optional_diags
= 1;
378 /* Nonzero means we should attempt to elide constructors when possible. */
380 int flag_elide_constructors
= 1;
382 /* Nonzero means that member functions defined in class scope are
383 inline by default. */
385 int flag_default_inline
= 1;
387 /* Controls whether compiler generates 'type descriptor' that give
388 run-time type information. */
392 /* Nonzero if we want to conserve space in the .o files. We do this
393 by putting uninitialized data and runtime initialized data into
394 .common instead of .data at the expense of not flagging multiple
397 int flag_conserve_space
;
399 /* Nonzero if we want to obey access control semantics. */
401 int flag_access_control
= 1;
403 /* Nonzero if we want to check the return value of new and avoid calling
404 constructors if it is a null pointer. */
408 /* Nonzero if we want to allow the use of experimental features that
409 are likely to become part of C++0x. */
413 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
414 initialization variables.
415 0: Old rules, set by -fno-for-scope.
416 2: New ISO rules, set by -ffor-scope.
417 1: Try to implement new ISO rules, but with backup compatibility
418 (and warnings). This is the default, for now. */
420 int flag_new_for_scope
= 1;
422 /* Nonzero if we want to emit defined symbols with common-like linkage as
423 weak symbols where possible, in order to conform to C++ semantics.
424 Otherwise, emit them as local symbols. */
428 /* 0 means we want the preprocessor to not emit line directives for
429 the current working directory. 1 means we want it to do it. -1
430 means we should decide depending on whether debugging information
431 is being emitted or not. */
433 int flag_working_directory
= -1;
435 /* Nonzero to use __cxa_atexit, rather than atexit, to register
436 destructors for local statics and global objects. '2' means it has been
437 set nonzero as a default, not by a command-line flag. */
439 int flag_use_cxa_atexit
= DEFAULT_USE_CXA_ATEXIT
;
441 /* Nonzero to use __cxa_get_exception_ptr in C++ exception-handling
442 code. '2' means it has not been set explicitly on the command line. */
444 int flag_use_cxa_get_exception_ptr
= 2;
446 /* Nonzero means make the default pedwarns warnings instead of errors.
447 The value of this flag is ignored if -pedantic is specified. */
451 /* Nonzero means to implement standard semantics for exception
452 specifications, calling unexpected if an exception is thrown that
453 doesn't match the specification. Zero means to treat them as
454 assertions and optimize accordingly, but not check them. */
456 int flag_enforce_eh_specs
= 1;
458 /* Nonzero means to generate thread-safe code for initializing local
461 int flag_threadsafe_statics
= 1;
463 /* Nonzero means warn about implicit declarations. */
465 int warn_implicit
= 1;
467 /* Maximum template instantiation depth. This limit is rather
468 arbitrary, but it exists to limit the time it takes to notice
469 infinite template instantiations. */
471 int max_tinst_depth
= 500;
475 /* The elements of `ridpointers' are identifier nodes for the reserved
476 type names and storage classes. It is indexed by a RID_... value. */
479 tree (*make_fname_decl
) (tree
, int);
481 /* Nonzero means the expression being parsed will never be evaluated.
482 This is a count, since unevaluated expressions can nest. */
485 /* Information about how a function name is generated. */
488 tree
*const decl
; /* pointer to the VAR_DECL. */
489 const unsigned rid
; /* RID number for the identifier. */
490 const int pretty
; /* How pretty is it? */
493 /* The three ways of getting then name of the current function. */
495 const struct fname_var_t fname_vars
[] =
497 /* C99 compliant __func__, must be first. */
498 {&c99_function_name_decl_node
, RID_C99_FUNCTION_NAME
, 0},
499 /* GCC __FUNCTION__ compliant. */
500 {&function_name_decl_node
, RID_FUNCTION_NAME
, 0},
501 /* GCC __PRETTY_FUNCTION__ compliant. */
502 {&pretty_function_name_decl_node
, RID_PRETTY_FUNCTION_NAME
, 1},
506 static tree
check_case_value (tree
);
507 static bool check_case_bounds (tree
, tree
, tree
*, tree
*);
509 static tree
handle_packed_attribute (tree
*, tree
, tree
, int, bool *);
510 static tree
handle_nocommon_attribute (tree
*, tree
, tree
, int, bool *);
511 static tree
handle_common_attribute (tree
*, tree
, tree
, int, bool *);
512 static tree
handle_noreturn_attribute (tree
*, tree
, tree
, int, bool *);
513 static tree
handle_noinline_attribute (tree
*, tree
, tree
, int, bool *);
514 static tree
handle_always_inline_attribute (tree
*, tree
, tree
, int,
516 static tree
handle_gnu_inline_attribute (tree
*, tree
, tree
, int,
518 static tree
handle_flatten_attribute (tree
*, tree
, tree
, int, bool *);
519 static tree
handle_used_attribute (tree
*, tree
, tree
, int, bool *);
520 static tree
handle_unused_attribute (tree
*, tree
, tree
, int, bool *);
521 static tree
handle_externally_visible_attribute (tree
*, tree
, tree
, int,
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_weakref_attribute (tree
*, tree
, tree
, int, bool *) ;
534 static tree
handle_visibility_attribute (tree
*, tree
, tree
, int,
536 static tree
handle_tls_model_attribute (tree
*, tree
, tree
, int,
538 static tree
handle_no_instrument_function_attribute (tree
*, tree
,
540 static tree
handle_malloc_attribute (tree
*, tree
, tree
, int, bool *);
541 static tree
handle_returns_twice_attribute (tree
*, tree
, tree
, int, bool *);
542 static tree
handle_no_limit_stack_attribute (tree
*, tree
, tree
, int,
544 static tree
handle_pure_attribute (tree
*, tree
, tree
, int, bool *);
545 static tree
handle_novops_attribute (tree
*, tree
, tree
, int, bool *);
546 static tree
handle_deprecated_attribute (tree
*, tree
, tree
, int,
548 static tree
handle_vector_size_attribute (tree
*, tree
, tree
, int,
550 static tree
handle_nonnull_attribute (tree
*, tree
, tree
, int, bool *);
551 static tree
handle_nothrow_attribute (tree
*, tree
, tree
, int, bool *);
552 static tree
handle_cleanup_attribute (tree
*, tree
, tree
, int, bool *);
553 static tree
handle_warn_unused_result_attribute (tree
*, tree
, tree
, int,
555 static tree
handle_sentinel_attribute (tree
*, tree
, tree
, int, bool *);
557 static void check_function_nonnull (tree
, tree
);
558 static void check_nonnull_arg (void *, tree
, unsigned HOST_WIDE_INT
);
559 static bool nonnull_check_p (tree
, unsigned HOST_WIDE_INT
);
560 static bool get_nonnull_operand (tree
, unsigned HOST_WIDE_INT
*);
561 static int resort_field_decl_cmp (const void *, const void *);
563 /* Table of machine-independent attributes common to all C-like languages. */
564 const struct attribute_spec c_common_attribute_table
[] =
566 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
567 { "packed", 0, 0, false, false, false,
568 handle_packed_attribute
},
569 { "nocommon", 0, 0, true, false, false,
570 handle_nocommon_attribute
},
571 { "common", 0, 0, true, false, false,
572 handle_common_attribute
},
573 /* FIXME: logically, noreturn attributes should be listed as
574 "false, true, true" and apply to function types. But implementing this
575 would require all the places in the compiler that use TREE_THIS_VOLATILE
576 on a decl to identify non-returning functions to be located and fixed
577 to check the function type instead. */
578 { "noreturn", 0, 0, true, false, false,
579 handle_noreturn_attribute
},
580 { "volatile", 0, 0, true, false, false,
581 handle_noreturn_attribute
},
582 { "noinline", 0, 0, true, false, false,
583 handle_noinline_attribute
},
584 { "always_inline", 0, 0, true, false, false,
585 handle_always_inline_attribute
},
586 { "gnu_inline", 0, 0, true, false, false,
587 handle_gnu_inline_attribute
},
588 { "flatten", 0, 0, true, false, false,
589 handle_flatten_attribute
},
590 { "used", 0, 0, true, false, false,
591 handle_used_attribute
},
592 { "unused", 0, 0, false, false, false,
593 handle_unused_attribute
},
594 { "externally_visible", 0, 0, true, false, false,
595 handle_externally_visible_attribute
},
596 /* The same comments as for noreturn attributes apply to const ones. */
597 { "const", 0, 0, true, false, false,
598 handle_const_attribute
},
599 { "transparent_union", 0, 0, false, false, false,
600 handle_transparent_union_attribute
},
601 { "constructor", 0, 1, true, false, false,
602 handle_constructor_attribute
},
603 { "destructor", 0, 1, true, false, false,
604 handle_destructor_attribute
},
605 { "mode", 1, 1, false, true, false,
606 handle_mode_attribute
},
607 { "section", 1, 1, true, false, false,
608 handle_section_attribute
},
609 { "aligned", 0, 1, false, false, false,
610 handle_aligned_attribute
},
611 { "weak", 0, 0, true, false, false,
612 handle_weak_attribute
},
613 { "alias", 1, 1, true, false, false,
614 handle_alias_attribute
},
615 { "weakref", 0, 1, true, false, false,
616 handle_weakref_attribute
},
617 { "no_instrument_function", 0, 0, true, false, false,
618 handle_no_instrument_function_attribute
},
619 { "malloc", 0, 0, true, false, false,
620 handle_malloc_attribute
},
621 { "returns_twice", 0, 0, true, false, false,
622 handle_returns_twice_attribute
},
623 { "no_stack_limit", 0, 0, true, false, false,
624 handle_no_limit_stack_attribute
},
625 { "pure", 0, 0, true, false, false,
626 handle_pure_attribute
},
627 /* For internal use (marking of builtins) only. The name contains space
628 to prevent its usage in source code. */
629 { "no vops", 0, 0, true, false, false,
630 handle_novops_attribute
},
631 { "deprecated", 0, 0, false, false, false,
632 handle_deprecated_attribute
},
633 { "vector_size", 1, 1, false, true, false,
634 handle_vector_size_attribute
},
635 { "visibility", 1, 1, false, false, false,
636 handle_visibility_attribute
},
637 { "tls_model", 1, 1, true, false, false,
638 handle_tls_model_attribute
},
639 { "nonnull", 0, -1, false, true, true,
640 handle_nonnull_attribute
},
641 { "nothrow", 0, 0, true, false, false,
642 handle_nothrow_attribute
},
643 { "may_alias", 0, 0, false, true, false, NULL
},
644 { "cleanup", 1, 1, true, false, false,
645 handle_cleanup_attribute
},
646 { "warn_unused_result", 0, 0, false, true, true,
647 handle_warn_unused_result_attribute
},
648 { "sentinel", 0, 1, false, true, true,
649 handle_sentinel_attribute
},
650 { NULL
, 0, 0, false, false, false, NULL
}
653 /* Give the specifications for the format attributes, used by C and all
656 const struct attribute_spec c_common_format_attribute_table
[] =
658 /* { name, min_len, max_len, decl_req, type_req, fn_type_req, handler } */
659 { "format", 3, 3, false, true, true,
660 handle_format_attribute
},
661 { "format_arg", 1, 1, false, true, true,
662 handle_format_arg_attribute
},
663 { NULL
, 0, 0, false, false, false, NULL
}
666 /* Functions called automatically at the beginning and end of execution. */
671 /* Push current bindings for the function name VAR_DECLS. */
674 start_fname_decls (void)
677 tree saved
= NULL_TREE
;
679 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
681 tree decl
= *fname_vars
[ix
].decl
;
685 saved
= tree_cons (decl
, build_int_cst (NULL_TREE
, ix
), saved
);
686 *fname_vars
[ix
].decl
= NULL_TREE
;
689 if (saved
|| saved_function_name_decls
)
690 /* Normally they'll have been NULL, so only push if we've got a
691 stack, or they are non-NULL. */
692 saved_function_name_decls
= tree_cons (saved
, NULL_TREE
,
693 saved_function_name_decls
);
696 /* Finish up the current bindings, adding them into the current function's
697 statement tree. This must be done _before_ finish_stmt_tree is called.
698 If there is no current function, we must be at file scope and no statements
699 are involved. Pop the previous bindings. */
702 finish_fname_decls (void)
705 tree stmts
= NULL_TREE
;
706 tree stack
= saved_function_name_decls
;
708 for (; stack
&& TREE_VALUE (stack
); stack
= TREE_CHAIN (stack
))
709 append_to_statement_list (TREE_VALUE (stack
), &stmts
);
713 tree
*bodyp
= &DECL_SAVED_TREE (current_function_decl
);
715 if (TREE_CODE (*bodyp
) == BIND_EXPR
)
716 bodyp
= &BIND_EXPR_BODY (*bodyp
);
718 append_to_statement_list_force (*bodyp
, &stmts
);
722 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
723 *fname_vars
[ix
].decl
= NULL_TREE
;
727 /* We had saved values, restore them. */
730 for (saved
= TREE_PURPOSE (stack
); saved
; saved
= TREE_CHAIN (saved
))
732 tree decl
= TREE_PURPOSE (saved
);
733 unsigned ix
= TREE_INT_CST_LOW (TREE_VALUE (saved
));
735 *fname_vars
[ix
].decl
= decl
;
737 stack
= TREE_CHAIN (stack
);
739 saved_function_name_decls
= stack
;
742 /* Return the text name of the current function, suitably prettified
743 by PRETTY_P. Return string must be freed by caller. */
746 fname_as_string (int pretty_p
)
748 const char *name
= "top level";
758 if (current_function_decl
)
759 name
= lang_hooks
.decl_printable_name (current_function_decl
, vrb
);
761 if (c_lex_string_translate
)
763 int len
= strlen (name
) + 3; /* Two for '"'s. One for NULL. */
764 cpp_string cstr
= { 0, 0 }, strname
;
766 namep
= XNEWVEC (char, len
);
767 snprintf (namep
, len
, "\"%s\"", name
);
768 strname
.text
= (unsigned char *) namep
;
769 strname
.len
= len
- 1;
771 if (cpp_interpret_string (parse_in
, &strname
, 1, &cstr
, false))
774 return (char *) cstr
.text
;
778 namep
= xstrdup (name
);
783 /* Expand DECL if it declares an entity not handled by the
787 c_expand_decl (tree decl
)
789 if (TREE_CODE (decl
) == VAR_DECL
&& !TREE_STATIC (decl
))
791 /* Let the back-end know about this variable. */
792 if (!anon_aggr_type_p (TREE_TYPE (decl
)))
793 emit_local_var (decl
);
795 expand_anon_union_decl (decl
, NULL_TREE
,
796 DECL_ANON_UNION_ELEMS (decl
));
805 /* Return the VAR_DECL for a const char array naming the current
806 function. If the VAR_DECL has not yet been created, create it
807 now. RID indicates how it should be formatted and IDENTIFIER_NODE
808 ID is its name (unfortunately C and C++ hold the RID values of
809 keywords in different places, so we can't derive RID from ID in
810 this language independent code. */
813 fname_decl (unsigned int rid
, tree id
)
816 tree decl
= NULL_TREE
;
818 for (ix
= 0; fname_vars
[ix
].decl
; ix
++)
819 if (fname_vars
[ix
].rid
== rid
)
822 decl
= *fname_vars
[ix
].decl
;
825 /* If a tree is built here, it would normally have the lineno of
826 the current statement. Later this tree will be moved to the
827 beginning of the function and this line number will be wrong.
828 To avoid this problem set the lineno to 0 here; that prevents
829 it from appearing in the RTL. */
831 location_t saved_location
= input_location
;
832 #ifdef USE_MAPPED_LOCATION
833 input_location
= UNKNOWN_LOCATION
;
838 stmts
= push_stmt_list ();
839 decl
= (*make_fname_decl
) (id
, fname_vars
[ix
].pretty
);
840 stmts
= pop_stmt_list (stmts
);
841 if (!IS_EMPTY_STMT (stmts
))
842 saved_function_name_decls
843 = tree_cons (decl
, stmts
, saved_function_name_decls
);
844 *fname_vars
[ix
].decl
= decl
;
845 input_location
= saved_location
;
847 if (!ix
&& !current_function_decl
)
848 pedwarn ("%qD is not defined outside of function scope", decl
);
853 /* Given a STRING_CST, give it a suitable array-of-chars data type. */
856 fix_string_type (tree value
)
858 const int wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
859 const int wide_flag
= TREE_TYPE (value
) == wchar_array_type_node
;
860 int length
= TREE_STRING_LENGTH (value
);
862 tree e_type
, i_type
, a_type
;
864 /* Compute the number of elements, for the array type. */
865 nchars
= wide_flag
? length
/ wchar_bytes
: length
;
867 /* C89 2.2.4.1, C99 5.2.4.1 (Translation limits). The analogous
868 limit in C++98 Annex B is very large (65536) and is not normative,
869 so we do not diagnose it (warn_overlength_strings is forced off
870 in c_common_post_options). */
871 if (warn_overlength_strings
)
873 const int nchars_max
= flag_isoc99
? 4095 : 509;
874 const int relevant_std
= flag_isoc99
? 99 : 90;
875 if (nchars
- 1 > nchars_max
)
876 /* Translators: The %d after 'ISO C' will be 90 or 99. Do not
877 separate the %d from the 'C'. 'ISO' should not be
878 translated, but it may be moved after 'C%d' in languages
879 where modifiers follow nouns. */
880 pedwarn ("string length %qd is greater than the length %qd "
881 "ISO C%d compilers are required to support",
882 nchars
- 1, nchars_max
, relevant_std
);
885 /* Create the array type for the string constant. The ISO C++
886 standard says that a string literal has type `const char[N]' or
887 `const wchar_t[N]'. We use the same logic when invoked as a C
888 front-end with -Wwrite-strings.
889 ??? We should change the type of an expression depending on the
890 state of a warning flag. We should just be warning -- see how
891 this is handled in the C++ front-end for the deprecated implicit
892 conversion from string literals to `char*' or `wchar_t*'.
894 The C++ front end relies on TYPE_MAIN_VARIANT of a cv-qualified
895 array type being the unqualified version of that type.
896 Therefore, if we are constructing an array of const char, we must
897 construct the matching unqualified array type first. The C front
898 end does not require this, but it does no harm, so we do it
900 e_type
= wide_flag
? wchar_type_node
: char_type_node
;
901 i_type
= build_index_type (build_int_cst (NULL_TREE
, nchars
- 1));
902 a_type
= build_array_type (e_type
, i_type
);
903 if (c_dialect_cxx() || warn_write_strings
)
904 a_type
= c_build_qualified_type (a_type
, TYPE_QUAL_CONST
);
906 TREE_TYPE (value
) = a_type
;
907 TREE_CONSTANT (value
) = 1;
908 TREE_INVARIANT (value
) = 1;
909 TREE_READONLY (value
) = 1;
910 TREE_STATIC (value
) = 1;
914 /* Print a warning if a constant expression had overflow in folding.
915 Invoke this function on every expression that the language
916 requires to be a constant expression.
917 Note the ANSI C standard says it is erroneous for a
918 constant expression to overflow. */
921 constant_expression_warning (tree value
)
923 if ((TREE_CODE (value
) == INTEGER_CST
|| TREE_CODE (value
) == REAL_CST
924 || TREE_CODE (value
) == VECTOR_CST
925 || TREE_CODE (value
) == COMPLEX_CST
)
926 && TREE_OVERFLOW (value
)
929 pedwarn ("overflow in constant expression");
932 /* Print a warning if an expression had overflow in folding and its
935 Invoke this function on every expression that
936 (1) appears in the source code, and
937 (2) is a constant expression that overflowed, and
938 (3) is not already checked by convert_and_check;
939 however, do not invoke this function on operands of explicit casts
940 or when the expression is the result of an operator and any operand
941 already overflowed. */
944 overflow_warning (tree value
)
946 if (skip_evaluation
) return;
948 switch (TREE_CODE (value
))
951 warning (OPT_Woverflow
, "integer overflow in expression");
955 warning (OPT_Woverflow
, "floating point overflow in expression");
959 warning (OPT_Woverflow
, "vector overflow in expression");
963 if (TREE_CODE (TREE_REALPART (value
)) == INTEGER_CST
)
964 warning (OPT_Woverflow
, "complex integer overflow in expression");
965 else if (TREE_CODE (TREE_REALPART (value
)) == REAL_CST
)
966 warning (OPT_Woverflow
, "complex floating point overflow in expression");
974 /* Print a warning about casts that might indicate violation
975 of strict aliasing rules if -Wstrict-aliasing is used and
976 strict aliasing mode is in effect. OTYPE is the original
977 TREE_TYPE of EXPR, and TYPE the type we're casting to. */
980 strict_aliasing_warning (tree otype
, tree type
, tree expr
)
982 if (flag_strict_aliasing
&& warn_strict_aliasing
983 && POINTER_TYPE_P (type
) && POINTER_TYPE_P (otype
)
984 && TREE_CODE (expr
) == ADDR_EXPR
985 && (DECL_P (TREE_OPERAND (expr
, 0))
986 || handled_component_p (TREE_OPERAND (expr
, 0)))
987 && !VOID_TYPE_P (TREE_TYPE (type
)))
989 /* Casting the address of an object to non void pointer. Warn
990 if the cast breaks type based aliasing. */
991 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)))
992 warning (OPT_Wstrict_aliasing
, "type-punning to incomplete type "
993 "might break strict-aliasing rules");
996 HOST_WIDE_INT set1
= get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
997 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
999 if (!alias_sets_conflict_p (set1
, set2
))
1000 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1001 "pointer will break strict-aliasing rules");
1002 else if (warn_strict_aliasing
> 1
1003 && !alias_sets_might_conflict_p (set1
, set2
))
1004 warning (OPT_Wstrict_aliasing
, "dereferencing type-punned "
1005 "pointer might break strict-aliasing rules");
1010 /* Print a warning about if (); or if () .. else; constructs
1011 via the special empty statement node that we create. INNER_THEN
1012 and INNER_ELSE are the statement lists of the if and the else
1016 empty_body_warning (tree inner_then
, tree inner_else
)
1018 if (warn_empty_body
)
1020 if (TREE_CODE (inner_then
) == STATEMENT_LIST
1021 && STATEMENT_LIST_TAIL (inner_then
))
1022 inner_then
= STATEMENT_LIST_TAIL (inner_then
)->stmt
;
1024 if (inner_else
&& TREE_CODE (inner_else
) == STATEMENT_LIST
1025 && STATEMENT_LIST_TAIL (inner_else
))
1026 inner_else
= STATEMENT_LIST_TAIL (inner_else
)->stmt
;
1028 if (IS_EMPTY_STMT (inner_then
) && !inner_else
)
1029 warning (OPT_Wempty_body
, "%Hempty body in an if-statement",
1030 EXPR_LOCUS (inner_then
));
1032 if (inner_else
&& IS_EMPTY_STMT (inner_else
))
1033 warning (OPT_Wempty_body
, "%Hempty body in an else-statement",
1034 EXPR_LOCUS (inner_else
));
1038 /* Warn for unlikely, improbable, or stupid DECL declarations
1042 check_main_parameter_types (tree decl
)
1047 for (args
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); args
;
1048 args
= TREE_CHAIN (args
))
1050 tree type
= args
? TREE_VALUE (args
) : 0;
1052 if (type
== void_type_node
|| type
== error_mark_node
)
1059 if (TYPE_MAIN_VARIANT (type
) != integer_type_node
)
1060 pedwarn ("first argument of %q+D should be %<int%>", decl
);
1064 if (TREE_CODE (type
) != POINTER_TYPE
1065 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1066 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1068 pedwarn ("second argument of %q+D should be %<char **%>",
1073 if (TREE_CODE (type
) != POINTER_TYPE
1074 || TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
1075 || (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
)))
1077 pedwarn ("third argument of %q+D should probably be "
1078 "%<char **%>", decl
);
1083 /* It is intentional that this message does not mention the third
1084 argument because it's only mentioned in an appendix of the
1086 if (argct
> 0 && (argct
< 2 || argct
> 3))
1087 pedwarn ("%q+D takes only zero or two arguments", decl
);
1090 /* True if vector types T1 and T2 can be converted to each other
1091 without an explicit cast. If EMIT_LAX_NOTE is true, and T1 and T2
1092 can only be converted with -flax-vector-conversions yet that is not
1093 in effect, emit a note telling the user about that option if such
1094 a note has not previously been emitted. */
1096 vector_types_convertible_p (tree t1
, tree t2
, bool emit_lax_note
)
1098 static bool emitted_lax_note
= false;
1099 bool convertible_lax
;
1101 if ((targetm
.vector_opaque_p (t1
) || targetm
.vector_opaque_p (t2
))
1102 && tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
)))
1106 (tree_int_cst_equal (TYPE_SIZE (t1
), TYPE_SIZE (t2
))
1107 && (TREE_CODE (TREE_TYPE (t1
)) != REAL_TYPE
||
1108 TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
))
1109 && (INTEGRAL_TYPE_P (TREE_TYPE (t1
))
1110 == INTEGRAL_TYPE_P (TREE_TYPE (t2
))));
1112 if (!convertible_lax
|| flag_lax_vector_conversions
)
1113 return convertible_lax
;
1115 if (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1116 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1119 if (emit_lax_note
&& !emitted_lax_note
)
1121 emitted_lax_note
= true;
1122 inform ("use -flax-vector-conversions to permit "
1123 "conversions between vectors with differing "
1124 "element types or numbers of subparts");
1130 /* Warns if the conversion of EXPR to TYPE may alter a value.
1131 This function is called from convert_and_check. */
1134 conversion_warning (tree type
, tree expr
)
1136 bool give_warning
= false;
1138 unsigned int formal_prec
= TYPE_PRECISION (type
);
1140 if (TREE_CODE (expr
) == REAL_CST
|| TREE_CODE (expr
) == INTEGER_CST
)
1142 /* Warn for real constant that is not an exact integer converted
1144 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1145 && TREE_CODE (type
) == INTEGER_TYPE
)
1147 if (!real_isinteger (TREE_REAL_CST_PTR (expr
), TYPE_MODE (TREE_TYPE (expr
))))
1148 give_warning
= true;
1150 /* Warn for an integer constant that does not fit into integer type. */
1151 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1152 && TREE_CODE (type
) == INTEGER_TYPE
1153 && !int_fits_type_p (expr
, type
))
1155 if (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (TREE_TYPE (expr
)))
1156 warning (OPT_Wconversion
,
1157 "negative integer implicitly converted to unsigned type");
1159 give_warning
= true;
1161 else if (TREE_CODE (type
) == REAL_TYPE
)
1163 /* Warn for an integer constant that does not fit into real type. */
1164 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
)
1166 REAL_VALUE_TYPE a
= real_value_from_int_cst (0, expr
);
1167 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1168 give_warning
= true;
1170 /* Warn for a real constant that does not fit into a smaller
1172 else if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1173 && formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1175 REAL_VALUE_TYPE a
= TREE_REAL_CST (expr
);
1176 if (!exact_real_truncate (TYPE_MODE (type
), &a
))
1177 give_warning
= true;
1182 warning (OPT_Wconversion
,
1183 "conversion to %qT alters %qT constant value",
1184 type
, TREE_TYPE (expr
));
1186 else /* 'expr' is not a constant. */
1188 /* Warn for real types converted to integer types. */
1189 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1190 && TREE_CODE (type
) == INTEGER_TYPE
)
1191 give_warning
= true;
1193 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1194 && TREE_CODE (type
) == INTEGER_TYPE
)
1196 /* Warn for integer types converted to smaller integer types. */
1197 if (formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
))
1198 /* When they are the same width but different signedness,
1199 then the value may change. */
1200 || (formal_prec
== TYPE_PRECISION (TREE_TYPE (expr
))
1201 && TYPE_UNSIGNED (TREE_TYPE (expr
)) != TYPE_UNSIGNED (type
))
1202 /* Even when converted to a bigger type, if the type is
1203 unsigned but expr is signed, then negative values
1205 || (TYPE_UNSIGNED (type
) && !TYPE_UNSIGNED (TREE_TYPE (expr
))))
1206 give_warning
= true;
1209 /* Warn for integer types converted to real types if and only if
1210 all the range of values of the integer type cannot be
1211 represented by the real type. */
1212 else if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
1213 && TREE_CODE (type
) == REAL_TYPE
)
1215 tree type_low_bound
= TYPE_MIN_VALUE (TREE_TYPE (expr
));
1216 tree type_high_bound
= TYPE_MAX_VALUE (TREE_TYPE (expr
));
1217 REAL_VALUE_TYPE real_low_bound
= real_value_from_int_cst (0, type_low_bound
);
1218 REAL_VALUE_TYPE real_high_bound
= real_value_from_int_cst (0, type_high_bound
);
1220 if (!exact_real_truncate (TYPE_MODE (type
), &real_low_bound
)
1221 || !exact_real_truncate (TYPE_MODE (type
), &real_high_bound
))
1222 give_warning
= true;
1225 /* Warn for real types converted to smaller real types. */
1226 else if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
1227 && TREE_CODE (type
) == REAL_TYPE
1228 && formal_prec
< TYPE_PRECISION (TREE_TYPE (expr
)))
1229 give_warning
= true;
1233 warning (OPT_Wconversion
,
1234 "conversion to %qT from %qT may alter its value",
1235 type
, TREE_TYPE (expr
));
1239 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1240 Invoke this function on every expression that is converted implicitly,
1241 i.e. because of language rules and not because of an explicit cast. */
1244 convert_and_check (tree type
, tree expr
)
1248 if (TREE_TYPE (expr
) == type
)
1251 result
= convert (type
, expr
);
1253 if (skip_evaluation
)
1257 if (TREE_CODE (expr
) == INTEGER_CST
1258 && (TREE_CODE (type
) == INTEGER_TYPE
1259 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1260 && !int_fits_type_p (expr
, type
))
1262 /* Do not diagnose overflow in a constant expression merely
1263 because a conversion overflowed. */
1264 if (TREE_OVERFLOW (result
))
1265 TREE_OVERFLOW (result
) = TREE_OVERFLOW (expr
);
1267 if (TYPE_UNSIGNED (type
))
1269 /* This detects cases like converting -129 or 256 to
1271 if (!int_fits_type_p (expr
, c_common_signed_type (type
)))
1272 warning (OPT_Woverflow
,
1273 "large integer implicitly truncated to unsigned type");
1274 else if (warn_conversion
)
1275 conversion_warning (type
, expr
);
1279 if (!int_fits_type_p (expr
, c_common_unsigned_type (type
)))
1280 warning (OPT_Woverflow
,
1281 "overflow in implicit constant conversion");
1282 /* No warning for converting 0x80000000 to int. */
1284 && (TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
1285 || TYPE_PRECISION (TREE_TYPE (expr
))
1286 != TYPE_PRECISION (type
)))
1287 warning (OPT_Woverflow
,
1288 "overflow in implicit constant conversion");
1289 else if (warn_conversion
)
1290 conversion_warning (type
, expr
);
1293 else if (TREE_CODE (result
) == INTEGER_CST
&& TREE_OVERFLOW (result
))
1294 warning (OPT_Woverflow
,
1295 "overflow in implicit constant conversion");
1296 else if (warn_conversion
)
1297 conversion_warning (type
, expr
);
1302 /* A node in a list that describes references to variables (EXPR), which are
1303 either read accesses if WRITER is zero, or write accesses, in which case
1304 WRITER is the parent of EXPR. */
1311 /* Used to implement a cache the results of a call to verify_tree. We only
1312 use this for SAVE_EXPRs. */
1315 struct tlist_cache
*next
;
1316 struct tlist
*cache_before_sp
;
1317 struct tlist
*cache_after_sp
;
1321 /* Obstack to use when allocating tlist structures, and corresponding
1323 static struct obstack tlist_obstack
;
1324 static char *tlist_firstobj
= 0;
1326 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1328 static struct tlist
*warned_ids
;
1329 /* SAVE_EXPRs need special treatment. We process them only once and then
1330 cache the results. */
1331 static struct tlist_cache
*save_expr_cache
;
1333 static void add_tlist (struct tlist
**, struct tlist
*, tree
, int);
1334 static void merge_tlist (struct tlist
**, struct tlist
*, int);
1335 static void verify_tree (tree
, struct tlist
**, struct tlist
**, tree
);
1336 static int warning_candidate_p (tree
);
1337 static void warn_for_collisions (struct tlist
*);
1338 static void warn_for_collisions_1 (tree
, tree
, struct tlist
*, int);
1339 static struct tlist
*new_tlist (struct tlist
*, tree
, tree
);
1341 /* Create a new struct tlist and fill in its fields. */
1342 static struct tlist
*
1343 new_tlist (struct tlist
*next
, tree t
, tree writer
)
1346 l
= XOBNEW (&tlist_obstack
, struct tlist
);
1353 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1354 is nonnull, we ignore any node we find which has a writer equal to it. */
1357 add_tlist (struct tlist
**to
, struct tlist
*add
, tree exclude_writer
, int copy
)
1361 struct tlist
*next
= add
->next
;
1364 if (!exclude_writer
|| add
->writer
!= exclude_writer
)
1365 *to
= copy
? new_tlist (*to
, add
->expr
, add
->writer
) : add
;
1370 /* Merge the nodes of ADD into TO. This merging process is done so that for
1371 each variable that already exists in TO, no new node is added; however if
1372 there is a write access recorded in ADD, and an occurrence on TO is only
1373 a read access, then the occurrence in TO will be modified to record the
1377 merge_tlist (struct tlist
**to
, struct tlist
*add
, int copy
)
1379 struct tlist
**end
= to
;
1382 end
= &(*end
)->next
;
1388 struct tlist
*next
= add
->next
;
1390 for (tmp2
= *to
; tmp2
; tmp2
= tmp2
->next
)
1391 if (tmp2
->expr
== add
->expr
)
1395 tmp2
->writer
= add
->writer
;
1399 *end
= copy
? add
: new_tlist (NULL
, add
->expr
, add
->writer
);
1400 end
= &(*end
)->next
;
1407 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1408 references in list LIST conflict with it, excluding reads if ONLY writers
1412 warn_for_collisions_1 (tree written
, tree writer
, struct tlist
*list
,
1417 /* Avoid duplicate warnings. */
1418 for (tmp
= warned_ids
; tmp
; tmp
= tmp
->next
)
1419 if (tmp
->expr
== written
)
1424 if (list
->expr
== written
1425 && list
->writer
!= writer
1426 && (!only_writes
|| list
->writer
)
1427 && DECL_NAME (list
->expr
))
1429 warned_ids
= new_tlist (warned_ids
, written
, NULL_TREE
);
1430 warning (0, "operation on %qE may be undefined", list
->expr
);
1436 /* Given a list LIST of references to variables, find whether any of these
1437 can cause conflicts due to missing sequence points. */
1440 warn_for_collisions (struct tlist
*list
)
1444 for (tmp
= list
; tmp
; tmp
= tmp
->next
)
1447 warn_for_collisions_1 (tmp
->expr
, tmp
->writer
, list
, 0);
1451 /* Return nonzero if X is a tree that can be verified by the sequence point
1454 warning_candidate_p (tree x
)
1456 return TREE_CODE (x
) == VAR_DECL
|| TREE_CODE (x
) == PARM_DECL
;
1459 /* Walk the tree X, and record accesses to variables. If X is written by the
1460 parent tree, WRITER is the parent.
1461 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1462 expression or its only operand forces a sequence point, then everything up
1463 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1465 Once we return, we will have emitted warnings if any subexpression before
1466 such a sequence point could be undefined. On a higher level, however, the
1467 sequence point may not be relevant, and we'll merge the two lists.
1469 Example: (b++, a) + b;
1470 The call that processes the COMPOUND_EXPR will store the increment of B
1471 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1472 processes the PLUS_EXPR will need to merge the two lists so that
1473 eventually, all accesses end up on the same list (and we'll warn about the
1474 unordered subexpressions b++ and b.
1476 A note on merging. If we modify the former example so that our expression
1479 care must be taken not simply to add all three expressions into the final
1480 PNO_SP list. The function merge_tlist takes care of that by merging the
1481 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1482 way, so that no more than one access to B is recorded. */
1485 verify_tree (tree x
, struct tlist
**pbefore_sp
, struct tlist
**pno_sp
,
1488 struct tlist
*tmp_before
, *tmp_nosp
, *tmp_list2
, *tmp_list3
;
1489 enum tree_code code
;
1490 enum tree_code_class cl
;
1492 /* X may be NULL if it is the operand of an empty statement expression
1498 code
= TREE_CODE (x
);
1499 cl
= TREE_CODE_CLASS (code
);
1501 if (warning_candidate_p (x
))
1503 *pno_sp
= new_tlist (*pno_sp
, x
, writer
);
1513 case TRUTH_ANDIF_EXPR
:
1514 case TRUTH_ORIF_EXPR
:
1515 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1516 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1517 warn_for_collisions (tmp_nosp
);
1518 merge_tlist (pbefore_sp
, tmp_before
, 0);
1519 merge_tlist (pbefore_sp
, tmp_nosp
, 0);
1520 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, pno_sp
, NULL_TREE
);
1521 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1525 tmp_before
= tmp_list2
= 0;
1526 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_list2
, NULL_TREE
);
1527 warn_for_collisions (tmp_list2
);
1528 merge_tlist (pbefore_sp
, tmp_before
, 0);
1529 merge_tlist (pbefore_sp
, tmp_list2
, 1);
1531 tmp_list3
= tmp_nosp
= 0;
1532 verify_tree (TREE_OPERAND (x
, 1), &tmp_list3
, &tmp_nosp
, NULL_TREE
);
1533 warn_for_collisions (tmp_nosp
);
1534 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1536 tmp_list3
= tmp_list2
= 0;
1537 verify_tree (TREE_OPERAND (x
, 2), &tmp_list3
, &tmp_list2
, NULL_TREE
);
1538 warn_for_collisions (tmp_list2
);
1539 merge_tlist (pbefore_sp
, tmp_list3
, 0);
1540 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1541 two first, to avoid warning for (a ? b++ : b++). */
1542 merge_tlist (&tmp_nosp
, tmp_list2
, 0);
1543 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1546 case PREDECREMENT_EXPR
:
1547 case PREINCREMENT_EXPR
:
1548 case POSTDECREMENT_EXPR
:
1549 case POSTINCREMENT_EXPR
:
1550 verify_tree (TREE_OPERAND (x
, 0), pno_sp
, pno_sp
, x
);
1554 tmp_before
= tmp_nosp
= tmp_list3
= 0;
1555 verify_tree (TREE_OPERAND (x
, 1), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1556 verify_tree (TREE_OPERAND (x
, 0), &tmp_list3
, &tmp_list3
, x
);
1557 /* Expressions inside the LHS are not ordered wrt. the sequence points
1558 in the RHS. Example:
1560 Despite the fact that the modification of "a" is in the before_sp
1561 list (tmp_before), it conflicts with the use of "a" in the LHS.
1562 We can handle this by adding the contents of tmp_list3
1563 to those of tmp_before, and redoing the collision warnings for that
1565 add_tlist (&tmp_before
, tmp_list3
, x
, 1);
1566 warn_for_collisions (tmp_before
);
1567 /* Exclude the LHS itself here; we first have to merge it into the
1568 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1569 didn't exclude the LHS, we'd get it twice, once as a read and once
1571 add_tlist (pno_sp
, tmp_list3
, x
, 0);
1572 warn_for_collisions_1 (TREE_OPERAND (x
, 0), x
, tmp_nosp
, 1);
1574 merge_tlist (pbefore_sp
, tmp_before
, 0);
1575 if (warning_candidate_p (TREE_OPERAND (x
, 0)))
1576 merge_tlist (&tmp_nosp
, new_tlist (NULL
, TREE_OPERAND (x
, 0), x
), 0);
1577 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 1);
1581 /* We need to warn about conflicts among arguments and conflicts between
1582 args and the function address. Side effects of the function address,
1583 however, are not ordered by the sequence point of the call. */
1585 call_expr_arg_iterator iter
;
1587 tmp_before
= tmp_nosp
= 0;
1588 verify_tree (CALL_EXPR_FN (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1589 FOR_EACH_CALL_EXPR_ARG (arg
, iter
, x
)
1591 tmp_list2
= tmp_list3
= 0;
1592 verify_tree (arg
, &tmp_list2
, &tmp_list3
, NULL_TREE
);
1593 merge_tlist (&tmp_list3
, tmp_list2
, 0);
1594 add_tlist (&tmp_before
, tmp_list3
, NULL_TREE
, 0);
1596 add_tlist (&tmp_before
, tmp_nosp
, NULL_TREE
, 0);
1597 warn_for_collisions (tmp_before
);
1598 add_tlist (pbefore_sp
, tmp_before
, NULL_TREE
, 0);
1603 /* Scan all the list, e.g. indices of multi dimensional array. */
1606 tmp_before
= tmp_nosp
= 0;
1607 verify_tree (TREE_VALUE (x
), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1608 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1609 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1616 struct tlist_cache
*t
;
1617 for (t
= save_expr_cache
; t
; t
= t
->next
)
1623 t
= XOBNEW (&tlist_obstack
, struct tlist_cache
);
1624 t
->next
= save_expr_cache
;
1626 save_expr_cache
= t
;
1628 tmp_before
= tmp_nosp
= 0;
1629 verify_tree (TREE_OPERAND (x
, 0), &tmp_before
, &tmp_nosp
, NULL_TREE
);
1630 warn_for_collisions (tmp_nosp
);
1635 struct tlist
*t
= tmp_nosp
;
1637 merge_tlist (&tmp_list3
, t
, 0);
1639 t
->cache_before_sp
= tmp_before
;
1640 t
->cache_after_sp
= tmp_list3
;
1642 merge_tlist (pbefore_sp
, t
->cache_before_sp
, 1);
1643 add_tlist (pno_sp
, t
->cache_after_sp
, NULL_TREE
, 1);
1648 /* For other expressions, simply recurse on their operands.
1649 Manual tail recursion for unary expressions.
1650 Other non-expressions need not be processed. */
1651 if (cl
== tcc_unary
)
1653 x
= TREE_OPERAND (x
, 0);
1657 else if (IS_EXPR_CODE_CLASS (cl
))
1660 int max
= TREE_OPERAND_LENGTH (x
);
1661 for (lp
= 0; lp
< max
; lp
++)
1663 tmp_before
= tmp_nosp
= 0;
1664 verify_tree (TREE_OPERAND (x
, lp
), &tmp_before
, &tmp_nosp
, 0);
1665 merge_tlist (&tmp_nosp
, tmp_before
, 0);
1666 add_tlist (pno_sp
, tmp_nosp
, NULL_TREE
, 0);
1673 /* Try to warn for undefined behavior in EXPR due to missing sequence
1677 verify_sequence_points (tree expr
)
1679 struct tlist
*before_sp
= 0, *after_sp
= 0;
1682 save_expr_cache
= 0;
1683 if (tlist_firstobj
== 0)
1685 gcc_obstack_init (&tlist_obstack
);
1686 tlist_firstobj
= (char *) obstack_alloc (&tlist_obstack
, 0);
1689 verify_tree (expr
, &before_sp
, &after_sp
, 0);
1690 warn_for_collisions (after_sp
);
1691 obstack_free (&tlist_obstack
, tlist_firstobj
);
1694 /* Validate the expression after `case' and apply default promotions. */
1697 check_case_value (tree value
)
1699 if (value
== NULL_TREE
)
1702 /* ??? Can we ever get nops here for a valid case value? We
1704 STRIP_TYPE_NOPS (value
);
1705 /* In C++, the following is allowed:
1708 switch (...) { case i: ... }
1710 So, we try to reduce the VALUE to a constant that way. */
1711 if (c_dialect_cxx ())
1713 value
= decl_constant_value (value
);
1714 STRIP_TYPE_NOPS (value
);
1715 value
= fold (value
);
1718 if (TREE_CODE (value
) == INTEGER_CST
)
1719 /* Promote char or short to int. */
1720 value
= perform_integral_promotions (value
);
1721 else if (value
!= error_mark_node
)
1723 error ("case label does not reduce to an integer constant");
1724 value
= error_mark_node
;
1727 constant_expression_warning (value
);
1732 /* See if the case values LOW and HIGH are in the range of the original
1733 type (i.e. before the default conversion to int) of the switch testing
1735 TYPE is the promoted type of the testing expression, and ORIG_TYPE is
1736 the type before promoting it. CASE_LOW_P is a pointer to the lower
1737 bound of the case label, and CASE_HIGH_P is the upper bound or NULL
1738 if the case is not a case range.
1739 The caller has to make sure that we are not called with NULL for
1740 CASE_LOW_P (i.e. the default case).
1741 Returns true if the case label is in range of ORIG_TYPE (saturated or
1742 untouched) or false if the label is out of range. */
1745 check_case_bounds (tree type
, tree orig_type
,
1746 tree
*case_low_p
, tree
*case_high_p
)
1748 tree min_value
, max_value
;
1749 tree case_low
= *case_low_p
;
1750 tree case_high
= case_high_p
? *case_high_p
: case_low
;
1752 /* If there was a problem with the original type, do nothing. */
1753 if (orig_type
== error_mark_node
)
1756 min_value
= TYPE_MIN_VALUE (orig_type
);
1757 max_value
= TYPE_MAX_VALUE (orig_type
);
1759 /* Case label is less than minimum for type. */
1760 if (tree_int_cst_compare (case_low
, min_value
) < 0
1761 && tree_int_cst_compare (case_high
, min_value
) < 0)
1763 warning (0, "case label value is less than minimum value for type");
1767 /* Case value is greater than maximum for type. */
1768 if (tree_int_cst_compare (case_low
, max_value
) > 0
1769 && tree_int_cst_compare (case_high
, max_value
) > 0)
1771 warning (0, "case label value exceeds maximum value for type");
1775 /* Saturate lower case label value to minimum. */
1776 if (tree_int_cst_compare (case_high
, min_value
) >= 0
1777 && tree_int_cst_compare (case_low
, min_value
) < 0)
1779 warning (0, "lower value in case label range"
1780 " less than minimum value for type");
1781 case_low
= min_value
;
1784 /* Saturate upper case label value to maximum. */
1785 if (tree_int_cst_compare (case_low
, max_value
) <= 0
1786 && tree_int_cst_compare (case_high
, max_value
) > 0)
1788 warning (0, "upper value in case label range"
1789 " exceeds maximum value for type");
1790 case_high
= max_value
;
1793 if (*case_low_p
!= case_low
)
1794 *case_low_p
= convert (type
, case_low
);
1795 if (case_high_p
&& *case_high_p
!= case_high
)
1796 *case_high_p
= convert (type
, case_high
);
1801 /* Return an integer type with BITS bits of precision,
1802 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1805 c_common_type_for_size (unsigned int bits
, int unsignedp
)
1807 if (bits
== TYPE_PRECISION (integer_type_node
))
1808 return unsignedp
? unsigned_type_node
: integer_type_node
;
1810 if (bits
== TYPE_PRECISION (signed_char_type_node
))
1811 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1813 if (bits
== TYPE_PRECISION (short_integer_type_node
))
1814 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1816 if (bits
== TYPE_PRECISION (long_integer_type_node
))
1817 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1819 if (bits
== TYPE_PRECISION (long_long_integer_type_node
))
1820 return (unsignedp
? long_long_unsigned_type_node
1821 : long_long_integer_type_node
);
1823 if (bits
== TYPE_PRECISION (widest_integer_literal_type_node
))
1824 return (unsignedp
? widest_unsigned_literal_type_node
1825 : widest_integer_literal_type_node
);
1827 if (bits
<= TYPE_PRECISION (intQI_type_node
))
1828 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1830 if (bits
<= TYPE_PRECISION (intHI_type_node
))
1831 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1833 if (bits
<= TYPE_PRECISION (intSI_type_node
))
1834 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1836 if (bits
<= TYPE_PRECISION (intDI_type_node
))
1837 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1842 /* Used for communication between c_common_type_for_mode and
1843 c_register_builtin_type. */
1844 static GTY(()) tree registered_builtin_types
;
1846 /* Return a data type that has machine mode MODE.
1847 If the mode is an integer,
1848 then UNSIGNEDP selects between signed and unsigned types. */
1851 c_common_type_for_mode (enum machine_mode mode
, int unsignedp
)
1855 if (mode
== TYPE_MODE (integer_type_node
))
1856 return unsignedp
? unsigned_type_node
: integer_type_node
;
1858 if (mode
== TYPE_MODE (signed_char_type_node
))
1859 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1861 if (mode
== TYPE_MODE (short_integer_type_node
))
1862 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1864 if (mode
== TYPE_MODE (long_integer_type_node
))
1865 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1867 if (mode
== TYPE_MODE (long_long_integer_type_node
))
1868 return unsignedp
? long_long_unsigned_type_node
: long_long_integer_type_node
;
1870 if (mode
== TYPE_MODE (widest_integer_literal_type_node
))
1871 return unsignedp
? widest_unsigned_literal_type_node
1872 : widest_integer_literal_type_node
;
1875 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
1878 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
1881 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
1884 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
1886 #if HOST_BITS_PER_WIDE_INT >= 64
1887 if (mode
== TYPE_MODE (intTI_type_node
))
1888 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
1891 if (mode
== TYPE_MODE (float_type_node
))
1892 return float_type_node
;
1894 if (mode
== TYPE_MODE (double_type_node
))
1895 return double_type_node
;
1897 if (mode
== TYPE_MODE (long_double_type_node
))
1898 return long_double_type_node
;
1900 if (mode
== TYPE_MODE (void_type_node
))
1901 return void_type_node
;
1903 if (mode
== TYPE_MODE (build_pointer_type (char_type_node
)))
1905 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1906 : make_signed_type (GET_MODE_PRECISION (mode
)));
1908 if (mode
== TYPE_MODE (build_pointer_type (integer_type_node
)))
1910 ? make_unsigned_type (GET_MODE_PRECISION (mode
))
1911 : make_signed_type (GET_MODE_PRECISION (mode
)));
1913 if (COMPLEX_MODE_P (mode
))
1915 enum machine_mode inner_mode
;
1918 if (mode
== TYPE_MODE (complex_float_type_node
))
1919 return complex_float_type_node
;
1920 if (mode
== TYPE_MODE (complex_double_type_node
))
1921 return complex_double_type_node
;
1922 if (mode
== TYPE_MODE (complex_long_double_type_node
))
1923 return complex_long_double_type_node
;
1925 if (mode
== TYPE_MODE (complex_integer_type_node
) && !unsignedp
)
1926 return complex_integer_type_node
;
1928 inner_mode
= GET_MODE_INNER (mode
);
1929 inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1930 if (inner_type
!= NULL_TREE
)
1931 return build_complex_type (inner_type
);
1933 else if (VECTOR_MODE_P (mode
))
1935 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
1936 tree inner_type
= c_common_type_for_mode (inner_mode
, unsignedp
);
1937 if (inner_type
!= NULL_TREE
)
1938 return build_vector_type_for_mode (inner_type
, mode
);
1941 if (mode
== TYPE_MODE (dfloat32_type_node
))
1942 return dfloat32_type_node
;
1943 if (mode
== TYPE_MODE (dfloat64_type_node
))
1944 return dfloat64_type_node
;
1945 if (mode
== TYPE_MODE (dfloat128_type_node
))
1946 return dfloat128_type_node
;
1948 for (t
= registered_builtin_types
; t
; t
= TREE_CHAIN (t
))
1949 if (TYPE_MODE (TREE_VALUE (t
)) == mode
)
1950 return TREE_VALUE (t
);
1955 /* Return an unsigned type the same as TYPE in other respects. */
1957 c_common_unsigned_type (tree type
)
1959 tree type1
= TYPE_MAIN_VARIANT (type
);
1960 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1961 return unsigned_char_type_node
;
1962 if (type1
== integer_type_node
)
1963 return unsigned_type_node
;
1964 if (type1
== short_integer_type_node
)
1965 return short_unsigned_type_node
;
1966 if (type1
== long_integer_type_node
)
1967 return long_unsigned_type_node
;
1968 if (type1
== long_long_integer_type_node
)
1969 return long_long_unsigned_type_node
;
1970 if (type1
== widest_integer_literal_type_node
)
1971 return widest_unsigned_literal_type_node
;
1972 #if HOST_BITS_PER_WIDE_INT >= 64
1973 if (type1
== intTI_type_node
)
1974 return unsigned_intTI_type_node
;
1976 if (type1
== intDI_type_node
)
1977 return unsigned_intDI_type_node
;
1978 if (type1
== intSI_type_node
)
1979 return unsigned_intSI_type_node
;
1980 if (type1
== intHI_type_node
)
1981 return unsigned_intHI_type_node
;
1982 if (type1
== intQI_type_node
)
1983 return unsigned_intQI_type_node
;
1985 return c_common_signed_or_unsigned_type (1, type
);
1988 /* Return a signed type the same as TYPE in other respects. */
1991 c_common_signed_type (tree type
)
1993 tree type1
= TYPE_MAIN_VARIANT (type
);
1994 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1995 return signed_char_type_node
;
1996 if (type1
== unsigned_type_node
)
1997 return integer_type_node
;
1998 if (type1
== short_unsigned_type_node
)
1999 return short_integer_type_node
;
2000 if (type1
== long_unsigned_type_node
)
2001 return long_integer_type_node
;
2002 if (type1
== long_long_unsigned_type_node
)
2003 return long_long_integer_type_node
;
2004 if (type1
== widest_unsigned_literal_type_node
)
2005 return widest_integer_literal_type_node
;
2006 #if HOST_BITS_PER_WIDE_INT >= 64
2007 if (type1
== unsigned_intTI_type_node
)
2008 return intTI_type_node
;
2010 if (type1
== unsigned_intDI_type_node
)
2011 return intDI_type_node
;
2012 if (type1
== unsigned_intSI_type_node
)
2013 return intSI_type_node
;
2014 if (type1
== unsigned_intHI_type_node
)
2015 return intHI_type_node
;
2016 if (type1
== unsigned_intQI_type_node
)
2017 return intQI_type_node
;
2019 return c_common_signed_or_unsigned_type (0, type
);
2022 /* Return a type the same as TYPE except unsigned or
2023 signed according to UNSIGNEDP. */
2026 c_common_signed_or_unsigned_type (int unsignedp
, tree type
)
2028 if (!INTEGRAL_TYPE_P (type
)
2029 || TYPE_UNSIGNED (type
) == unsignedp
)
2032 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2033 the precision; they have precision set to match their range, but
2034 may use a wider mode to match an ABI. If we change modes, we may
2035 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2036 the precision as well, so as to yield correct results for
2037 bit-field types. C++ does not have these separate bit-field
2038 types, and producing a signed or unsigned variant of an
2039 ENUMERAL_TYPE may cause other problems as well. */
2041 #define TYPE_OK(node) \
2042 (TYPE_MODE (type) == TYPE_MODE (node) \
2043 && (c_dialect_cxx () || TYPE_PRECISION (type) == TYPE_PRECISION (node)))
2044 if (TYPE_OK (signed_char_type_node
))
2045 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2046 if (TYPE_OK (integer_type_node
))
2047 return unsignedp
? unsigned_type_node
: integer_type_node
;
2048 if (TYPE_OK (short_integer_type_node
))
2049 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2050 if (TYPE_OK (long_integer_type_node
))
2051 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2052 if (TYPE_OK (long_long_integer_type_node
))
2053 return (unsignedp
? long_long_unsigned_type_node
2054 : long_long_integer_type_node
);
2055 if (TYPE_OK (widest_integer_literal_type_node
))
2056 return (unsignedp
? widest_unsigned_literal_type_node
2057 : widest_integer_literal_type_node
);
2059 #if HOST_BITS_PER_WIDE_INT >= 64
2060 if (TYPE_OK (intTI_type_node
))
2061 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2063 if (TYPE_OK (intDI_type_node
))
2064 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2065 if (TYPE_OK (intSI_type_node
))
2066 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2067 if (TYPE_OK (intHI_type_node
))
2068 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2069 if (TYPE_OK (intQI_type_node
))
2070 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2073 if (c_dialect_cxx ())
2076 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2079 /* Build a bit-field integer type for the given WIDTH and UNSIGNEDP. */
2082 c_build_bitfield_integer_type (unsigned HOST_WIDE_INT width
, int unsignedp
)
2084 /* Extended integer types of the same width as a standard type have
2085 lesser rank, so those of the same width as int promote to int or
2086 unsigned int and are valid for printf formats expecting int or
2087 unsigned int. To avoid such special cases, avoid creating
2088 extended integer types for bit-fields if a standard integer type
2090 if (width
== TYPE_PRECISION (integer_type_node
))
2091 return unsignedp
? unsigned_type_node
: integer_type_node
;
2092 if (width
== TYPE_PRECISION (signed_char_type_node
))
2093 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2094 if (width
== TYPE_PRECISION (short_integer_type_node
))
2095 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2096 if (width
== TYPE_PRECISION (long_integer_type_node
))
2097 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2098 if (width
== TYPE_PRECISION (long_long_integer_type_node
))
2099 return (unsignedp
? long_long_unsigned_type_node
2100 : long_long_integer_type_node
);
2101 return build_nonstandard_integer_type (width
, unsignedp
);
2104 /* The C version of the register_builtin_type langhook. */
2107 c_register_builtin_type (tree type
, const char* name
)
2111 decl
= build_decl (TYPE_DECL
, get_identifier (name
), type
);
2112 DECL_ARTIFICIAL (decl
) = 1;
2113 if (!TYPE_NAME (type
))
2114 TYPE_NAME (type
) = decl
;
2117 registered_builtin_types
= tree_cons (0, type
, registered_builtin_types
);
2121 /* Return the minimum number of bits needed to represent VALUE in a
2122 signed or unsigned type, UNSIGNEDP says which. */
2125 min_precision (tree value
, int unsignedp
)
2129 /* If the value is negative, compute its negative minus 1. The latter
2130 adjustment is because the absolute value of the largest negative value
2131 is one larger than the largest positive value. This is equivalent to
2132 a bit-wise negation, so use that operation instead. */
2134 if (tree_int_cst_sgn (value
) < 0)
2135 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
2137 /* Return the number of bits needed, taking into account the fact
2138 that we need one more bit for a signed than unsigned type. */
2140 if (integer_zerop (value
))
2143 log
= tree_floor_log2 (value
);
2145 return log
+ 1 + !unsignedp
;
2148 /* Print an error message for invalid operands to arith operation
2152 binary_op_error (enum tree_code code
)
2159 opname
= "+"; break;
2161 opname
= "-"; break;
2163 opname
= "*"; break;
2165 opname
= "max"; break;
2167 opname
= "min"; break;
2169 opname
= "=="; break;
2171 opname
= "!="; break;
2173 opname
= "<="; break;
2175 opname
= ">="; break;
2177 opname
= "<"; break;
2179 opname
= ">"; break;
2181 opname
= "<<"; break;
2183 opname
= ">>"; break;
2184 case TRUNC_MOD_EXPR
:
2185 case FLOOR_MOD_EXPR
:
2186 opname
= "%"; break;
2187 case TRUNC_DIV_EXPR
:
2188 case FLOOR_DIV_EXPR
:
2189 opname
= "/"; break;
2191 opname
= "&"; break;
2193 opname
= "|"; break;
2194 case TRUTH_ANDIF_EXPR
:
2195 opname
= "&&"; break;
2196 case TRUTH_ORIF_EXPR
:
2197 opname
= "||"; break;
2199 opname
= "^"; break;
2203 error ("invalid operands to binary %s", opname
);
2206 /* Subroutine of build_binary_op, used for comparison operations.
2207 See if the operands have both been converted from subword integer types
2208 and, if so, perhaps change them both back to their original type.
2209 This function is also responsible for converting the two operands
2210 to the proper common type for comparison.
2212 The arguments of this function are all pointers to local variables
2213 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2214 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2216 If this function returns nonzero, it means that the comparison has
2217 a constant value. What this function returns is an expression for
2221 shorten_compare (tree
*op0_ptr
, tree
*op1_ptr
, tree
*restype_ptr
,
2222 enum tree_code
*rescode_ptr
)
2225 tree op0
= *op0_ptr
;
2226 tree op1
= *op1_ptr
;
2227 int unsignedp0
, unsignedp1
;
2229 tree primop0
, primop1
;
2230 enum tree_code code
= *rescode_ptr
;
2232 /* Throw away any conversions to wider types
2233 already present in the operands. */
2235 primop0
= get_narrower (op0
, &unsignedp0
);
2236 primop1
= get_narrower (op1
, &unsignedp1
);
2238 /* Handle the case that OP0 does not *contain* a conversion
2239 but it *requires* conversion to FINAL_TYPE. */
2241 if (op0
== primop0
&& TREE_TYPE (op0
) != *restype_ptr
)
2242 unsignedp0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
2243 if (op1
== primop1
&& TREE_TYPE (op1
) != *restype_ptr
)
2244 unsignedp1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
2246 /* If one of the operands must be floated, we cannot optimize. */
2247 real1
= TREE_CODE (TREE_TYPE (primop0
)) == REAL_TYPE
;
2248 real2
= TREE_CODE (TREE_TYPE (primop1
)) == REAL_TYPE
;
2250 /* If first arg is constant, swap the args (changing operation
2251 so value is preserved), for canonicalization. Don't do this if
2252 the second arg is 0. */
2254 if (TREE_CONSTANT (primop0
)
2255 && !integer_zerop (primop1
) && !real_zerop (primop1
))
2258 int temi
= unsignedp0
;
2266 unsignedp0
= unsignedp1
;
2289 *rescode_ptr
= code
;
2292 /* If comparing an integer against a constant more bits wide,
2293 maybe we can deduce a value of 1 or 0 independent of the data.
2294 Or else truncate the constant now
2295 rather than extend the variable at run time.
2297 This is only interesting if the constant is the wider arg.
2298 Also, it is not safe if the constant is unsigned and the
2299 variable arg is signed, since in this case the variable
2300 would be sign-extended and then regarded as unsigned.
2301 Our technique fails in this case because the lowest/highest
2302 possible unsigned results don't follow naturally from the
2303 lowest/highest possible values of the variable operand.
2304 For just EQ_EXPR and NE_EXPR there is another technique that
2305 could be used: see if the constant can be faithfully represented
2306 in the other operand's type, by truncating it and reextending it
2307 and see if that preserves the constant's value. */
2309 if (!real1
&& !real2
2310 && TREE_CODE (primop1
) == INTEGER_CST
2311 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
))
2313 int min_gt
, max_gt
, min_lt
, max_lt
;
2314 tree maxval
, minval
;
2315 /* 1 if comparison is nominally unsigned. */
2316 int unsignedp
= TYPE_UNSIGNED (*restype_ptr
);
2319 type
= c_common_signed_or_unsigned_type (unsignedp0
,
2320 TREE_TYPE (primop0
));
2322 maxval
= TYPE_MAX_VALUE (type
);
2323 minval
= TYPE_MIN_VALUE (type
);
2325 if (unsignedp
&& !unsignedp0
)
2326 *restype_ptr
= c_common_signed_type (*restype_ptr
);
2328 if (TREE_TYPE (primop1
) != *restype_ptr
)
2330 /* Convert primop1 to target type, but do not introduce
2331 additional overflow. We know primop1 is an int_cst. */
2332 primop1
= force_fit_type_double (*restype_ptr
,
2333 TREE_INT_CST_LOW (primop1
),
2334 TREE_INT_CST_HIGH (primop1
), 0,
2335 TREE_OVERFLOW (primop1
));
2337 if (type
!= *restype_ptr
)
2339 minval
= convert (*restype_ptr
, minval
);
2340 maxval
= convert (*restype_ptr
, maxval
);
2343 if (unsignedp
&& unsignedp0
)
2345 min_gt
= INT_CST_LT_UNSIGNED (primop1
, minval
);
2346 max_gt
= INT_CST_LT_UNSIGNED (primop1
, maxval
);
2347 min_lt
= INT_CST_LT_UNSIGNED (minval
, primop1
);
2348 max_lt
= INT_CST_LT_UNSIGNED (maxval
, primop1
);
2352 min_gt
= INT_CST_LT (primop1
, minval
);
2353 max_gt
= INT_CST_LT (primop1
, maxval
);
2354 min_lt
= INT_CST_LT (minval
, primop1
);
2355 max_lt
= INT_CST_LT (maxval
, primop1
);
2359 /* This used to be a switch, but Genix compiler can't handle that. */
2360 if (code
== NE_EXPR
)
2362 if (max_lt
|| min_gt
)
2363 val
= truthvalue_true_node
;
2365 else if (code
== EQ_EXPR
)
2367 if (max_lt
|| min_gt
)
2368 val
= truthvalue_false_node
;
2370 else if (code
== LT_EXPR
)
2373 val
= truthvalue_true_node
;
2375 val
= truthvalue_false_node
;
2377 else if (code
== GT_EXPR
)
2380 val
= truthvalue_true_node
;
2382 val
= truthvalue_false_node
;
2384 else if (code
== LE_EXPR
)
2387 val
= truthvalue_true_node
;
2389 val
= truthvalue_false_node
;
2391 else if (code
== GE_EXPR
)
2394 val
= truthvalue_true_node
;
2396 val
= truthvalue_false_node
;
2399 /* If primop0 was sign-extended and unsigned comparison specd,
2400 we did a signed comparison above using the signed type bounds.
2401 But the comparison we output must be unsigned.
2403 Also, for inequalities, VAL is no good; but if the signed
2404 comparison had *any* fixed result, it follows that the
2405 unsigned comparison just tests the sign in reverse
2406 (positive values are LE, negative ones GE).
2407 So we can generate an unsigned comparison
2408 against an extreme value of the signed type. */
2410 if (unsignedp
&& !unsignedp0
)
2417 primop1
= TYPE_MIN_VALUE (type
);
2423 primop1
= TYPE_MAX_VALUE (type
);
2430 type
= c_common_unsigned_type (type
);
2433 if (TREE_CODE (primop0
) != INTEGER_CST
)
2435 if (val
== truthvalue_false_node
)
2436 warning (0, "comparison is always false due to limited range of data type");
2437 if (val
== truthvalue_true_node
)
2438 warning (0, "comparison is always true due to limited range of data type");
2443 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2444 if (TREE_SIDE_EFFECTS (primop0
))
2445 return build2 (COMPOUND_EXPR
, TREE_TYPE (val
), primop0
, val
);
2449 /* Value is not predetermined, but do the comparison
2450 in the type of the operand that is not constant.
2451 TYPE is already properly set. */
2454 /* If either arg is decimal float and the other is float, find the
2455 proper common type to use for comparison. */
2456 else if (real1
&& real2
2457 && (DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop0
)))
2458 || DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (primop1
)))))
2459 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2461 else if (real1
&& real2
2462 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2463 == TYPE_PRECISION (TREE_TYPE (primop1
))))
2464 type
= TREE_TYPE (primop0
);
2466 /* If args' natural types are both narrower than nominal type
2467 and both extend in the same manner, compare them
2468 in the type of the wider arg.
2469 Otherwise must actually extend both to the nominal
2470 common type lest different ways of extending
2472 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2474 else if (unsignedp0
== unsignedp1
&& real1
== real2
2475 && TYPE_PRECISION (TREE_TYPE (primop0
)) < TYPE_PRECISION (*restype_ptr
)
2476 && TYPE_PRECISION (TREE_TYPE (primop1
)) < TYPE_PRECISION (*restype_ptr
))
2478 type
= common_type (TREE_TYPE (primop0
), TREE_TYPE (primop1
));
2479 type
= c_common_signed_or_unsigned_type (unsignedp0
2480 || TYPE_UNSIGNED (*restype_ptr
),
2482 /* Make sure shorter operand is extended the right way
2483 to match the longer operand. */
2485 = convert (c_common_signed_or_unsigned_type (unsignedp0
,
2486 TREE_TYPE (primop0
)),
2489 = convert (c_common_signed_or_unsigned_type (unsignedp1
,
2490 TREE_TYPE (primop1
)),
2495 /* Here we must do the comparison on the nominal type
2496 using the args exactly as we received them. */
2497 type
= *restype_ptr
;
2501 if (!real1
&& !real2
&& integer_zerop (primop1
)
2502 && TYPE_UNSIGNED (*restype_ptr
))
2508 /* All unsigned values are >= 0, so we warn if extra warnings
2509 are requested. However, if OP0 is a constant that is
2510 >= 0, the signedness of the comparison isn't an issue,
2511 so suppress the warning. */
2512 if (extra_warnings
&& !in_system_header
2513 && !(TREE_CODE (primop0
) == INTEGER_CST
2514 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2516 warning (0, "comparison of unsigned expression >= 0 is always true");
2517 value
= truthvalue_true_node
;
2521 if (extra_warnings
&& !in_system_header
2522 && !(TREE_CODE (primop0
) == INTEGER_CST
2523 && !TREE_OVERFLOW (convert (c_common_signed_type (type
),
2525 warning (0, "comparison of unsigned expression < 0 is always false");
2526 value
= truthvalue_false_node
;
2535 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2536 if (TREE_SIDE_EFFECTS (primop0
))
2537 return build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2544 *op0_ptr
= convert (type
, primop0
);
2545 *op1_ptr
= convert (type
, primop1
);
2547 *restype_ptr
= truthvalue_type_node
;
2552 /* Return a tree for the sum or difference (RESULTCODE says which)
2553 of pointer PTROP and integer INTOP. */
2556 pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
2560 /* The result is a pointer of the same type that is being added. */
2562 tree result_type
= TREE_TYPE (ptrop
);
2564 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2566 if (pedantic
|| warn_pointer_arith
)
2567 pedwarn ("pointer of type %<void *%> used in arithmetic");
2568 size_exp
= integer_one_node
;
2570 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2572 if (pedantic
|| warn_pointer_arith
)
2573 pedwarn ("pointer to a function used in arithmetic");
2574 size_exp
= integer_one_node
;
2576 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
2578 if (pedantic
|| warn_pointer_arith
)
2579 pedwarn ("pointer to member function used in arithmetic");
2580 size_exp
= integer_one_node
;
2583 size_exp
= size_in_bytes (TREE_TYPE (result_type
));
2585 /* We are manipulating pointer values, so we don't need to warn
2586 about relying on undefined signed overflow. We disable the
2587 warning here because we use integer types so fold won't know that
2588 they are really pointers. */
2589 fold_defer_overflow_warnings ();
2591 /* If what we are about to multiply by the size of the elements
2592 contains a constant term, apply distributive law
2593 and multiply that constant term separately.
2594 This helps produce common subexpressions. */
2596 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2597 && !TREE_CONSTANT (intop
)
2598 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2599 && TREE_CONSTANT (size_exp
)
2600 /* If the constant comes from pointer subtraction,
2601 skip this optimization--it would cause an error. */
2602 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2603 /* If the constant is unsigned, and smaller than the pointer size,
2604 then we must skip this optimization. This is because it could cause
2605 an overflow error if the constant is negative but INTOP is not. */
2606 && (!TYPE_UNSIGNED (TREE_TYPE (intop
))
2607 || (TYPE_PRECISION (TREE_TYPE (intop
))
2608 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2610 enum tree_code subcode
= resultcode
;
2611 tree int_type
= TREE_TYPE (intop
);
2612 if (TREE_CODE (intop
) == MINUS_EXPR
)
2613 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2614 /* Convert both subexpression types to the type of intop,
2615 because weird cases involving pointer arithmetic
2616 can result in a sum or difference with different type args. */
2617 ptrop
= build_binary_op (subcode
, ptrop
,
2618 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2619 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2622 /* Convert the integer argument to a type the same size as sizetype
2623 so the multiply won't overflow spuriously. */
2625 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2626 || TYPE_UNSIGNED (TREE_TYPE (intop
)) != TYPE_UNSIGNED (sizetype
))
2627 intop
= convert (c_common_type_for_size (TYPE_PRECISION (sizetype
),
2628 TYPE_UNSIGNED (sizetype
)), intop
);
2630 /* Replace the integer argument with a suitable product by the object size.
2631 Do this multiplication as signed, then convert to the appropriate
2632 pointer type (actually unsigned integral). */
2634 intop
= convert (result_type
,
2635 build_binary_op (MULT_EXPR
, intop
,
2636 convert (TREE_TYPE (intop
), size_exp
), 1));
2638 /* Create the sum or difference. */
2639 ret
= fold_build2 (resultcode
, result_type
, ptrop
, intop
);
2641 fold_undefer_and_ignore_overflow_warnings ();
2646 /* Return whether EXPR is a declaration whose address can never be
2650 decl_with_nonnull_addr_p (tree expr
)
2652 return (DECL_P (expr
)
2653 && (TREE_CODE (expr
) == PARM_DECL
2654 || TREE_CODE (expr
) == LABEL_DECL
2655 || !DECL_WEAK (expr
)));
2658 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2659 or for an `if' or `while' statement or ?..: exp. It should already
2660 have been validated to be of suitable type; otherwise, a bad
2661 diagnostic may result.
2663 This preparation consists of taking the ordinary
2664 representation of an expression expr and producing a valid tree
2665 boolean expression describing whether expr is nonzero. We could
2666 simply always do build_binary_op (NE_EXPR, expr, truthvalue_false_node, 1),
2667 but we optimize comparisons, &&, ||, and !.
2669 The resulting type should always be `truthvalue_type_node'. */
2672 c_common_truthvalue_conversion (tree expr
)
2674 switch (TREE_CODE (expr
))
2676 case EQ_EXPR
: case NE_EXPR
: case UNEQ_EXPR
: case LTGT_EXPR
:
2677 case LE_EXPR
: case GE_EXPR
: case LT_EXPR
: case GT_EXPR
:
2678 case UNLE_EXPR
: case UNGE_EXPR
: case UNLT_EXPR
: case UNGT_EXPR
:
2679 case ORDERED_EXPR
: case UNORDERED_EXPR
:
2680 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2682 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2683 TREE_OPERAND (expr
, 0), TREE_OPERAND (expr
, 1));
2685 case TRUTH_ANDIF_EXPR
:
2686 case TRUTH_ORIF_EXPR
:
2687 case TRUTH_AND_EXPR
:
2689 case TRUTH_XOR_EXPR
:
2690 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2692 return build2 (TREE_CODE (expr
), truthvalue_type_node
,
2693 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2694 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)));
2696 case TRUTH_NOT_EXPR
:
2697 if (TREE_TYPE (expr
) == truthvalue_type_node
)
2699 return build1 (TREE_CODE (expr
), truthvalue_type_node
,
2700 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2706 return integer_zerop (expr
) ? truthvalue_false_node
2707 : truthvalue_true_node
;
2710 return real_compare (NE_EXPR
, &TREE_REAL_CST (expr
), &dconst0
)
2711 ? truthvalue_true_node
2712 : truthvalue_false_node
;
2715 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
2720 tree inner
= TREE_OPERAND (expr
, 0);
2721 if (decl_with_nonnull_addr_p (inner
))
2723 /* Common Ada/Pascal programmer's mistake. */
2724 warning (OPT_Waddress
,
2725 "the address of %qD will always evaluate as %<true%>",
2727 return truthvalue_true_node
;
2730 /* If we still have a decl, it is possible for its address to
2731 be NULL, so we cannot optimize. */
2734 gcc_assert (DECL_WEAK (inner
));
2738 if (TREE_SIDE_EFFECTS (inner
))
2739 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2740 inner
, truthvalue_true_node
);
2742 return truthvalue_true_node
;
2746 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1))
2747 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2748 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)),
2749 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2755 /* These don't change whether an object is nonzero or zero. */
2756 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2760 /* These don't change whether an object is zero or nonzero, but
2761 we can't ignore them if their second arg has side-effects. */
2762 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr
, 1)))
2763 return build2 (COMPOUND_EXPR
, truthvalue_type_node
,
2764 TREE_OPERAND (expr
, 1),
2765 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0)));
2767 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2770 /* Distribute the conversion into the arms of a COND_EXPR. */
2771 return fold_build3 (COND_EXPR
, truthvalue_type_node
,
2772 TREE_OPERAND (expr
, 0),
2773 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 1)),
2774 c_common_truthvalue_conversion (TREE_OPERAND (expr
, 2)));
2778 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2779 since that affects how `default_conversion' will behave. */
2780 if (TREE_CODE (TREE_TYPE (expr
)) == REFERENCE_TYPE
2781 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0))) == REFERENCE_TYPE
)
2783 /* If this is widening the argument, we can ignore it. */
2784 if (TYPE_PRECISION (TREE_TYPE (expr
))
2785 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2786 return c_common_truthvalue_conversion (TREE_OPERAND (expr
, 0));
2790 if (!TREE_NO_WARNING (expr
)
2791 && warn_parentheses
)
2793 warning (OPT_Wparentheses
,
2794 "suggest parentheses around assignment used as truth value");
2795 TREE_NO_WARNING (expr
) = 1;
2803 if (TREE_CODE (TREE_TYPE (expr
)) == COMPLEX_TYPE
)
2805 tree t
= save_expr (expr
);
2806 return (build_binary_op
2807 ((TREE_SIDE_EFFECTS (expr
)
2808 ? TRUTH_OR_EXPR
: TRUTH_ORIF_EXPR
),
2809 c_common_truthvalue_conversion (build_unary_op (REALPART_EXPR
, t
, 0)),
2810 c_common_truthvalue_conversion (build_unary_op (IMAGPART_EXPR
, t
, 0)),
2814 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
2817 static void def_builtin_1 (enum built_in_function fncode
,
2819 enum built_in_class fnclass
,
2820 tree fntype
, tree libtype
,
2821 bool both_p
, bool fallback_p
, bool nonansi_p
,
2822 tree fnattrs
, bool implicit_p
);
2824 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2825 down to the element type of an array. */
2828 c_build_qualified_type (tree type
, int type_quals
)
2830 if (type
== error_mark_node
)
2833 if (TREE_CODE (type
) == ARRAY_TYPE
)
2836 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
2839 /* See if we already have an identically qualified type. */
2840 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2842 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
2843 && TYPE_NAME (t
) == TYPE_NAME (type
)
2844 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
2845 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
2846 TYPE_ATTRIBUTES (type
)))
2851 t
= build_variant_type_copy (type
);
2852 TREE_TYPE (t
) = element_type
;
2857 /* A restrict-qualified pointer type must be a pointer to object or
2858 incomplete type. Note that the use of POINTER_TYPE_P also allows
2859 REFERENCE_TYPEs, which is appropriate for C++. */
2860 if ((type_quals
& TYPE_QUAL_RESTRICT
)
2861 && (!POINTER_TYPE_P (type
)
2862 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
2864 error ("invalid use of %<restrict%>");
2865 type_quals
&= ~TYPE_QUAL_RESTRICT
;
2868 return build_qualified_type (type
, type_quals
);
2871 /* Apply the TYPE_QUALS to the new DECL. */
2874 c_apply_type_quals_to_decl (int type_quals
, tree decl
)
2876 tree type
= TREE_TYPE (decl
);
2878 if (type
== error_mark_node
)
2881 if (((type_quals
& TYPE_QUAL_CONST
)
2882 || (type
&& TREE_CODE (type
) == REFERENCE_TYPE
))
2883 /* An object declared 'const' is only readonly after it is
2884 initialized. We don't have any way of expressing this currently,
2885 so we need to be conservative and unset TREE_READONLY for types
2886 with constructors. Otherwise aliasing code will ignore stores in
2887 an inline constructor. */
2888 && !(type
&& TYPE_NEEDS_CONSTRUCTING (type
)))
2889 TREE_READONLY (decl
) = 1;
2890 if (type_quals
& TYPE_QUAL_VOLATILE
)
2892 TREE_SIDE_EFFECTS (decl
) = 1;
2893 TREE_THIS_VOLATILE (decl
) = 1;
2895 if (type_quals
& TYPE_QUAL_RESTRICT
)
2897 while (type
&& TREE_CODE (type
) == ARRAY_TYPE
)
2898 /* Allow 'restrict' on arrays of pointers.
2899 FIXME currently we just ignore it. */
2900 type
= TREE_TYPE (type
);
2902 || !POINTER_TYPE_P (type
)
2903 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
)))
2904 error ("invalid use of %<restrict%>");
2905 else if (flag_strict_aliasing
&& type
== TREE_TYPE (decl
))
2906 /* Indicate we need to make a unique alias set for this pointer.
2907 We can't do it here because it might be pointing to an
2909 DECL_POINTER_ALIAS_SET (decl
) = -2;
2913 /* Hash function for the problem of multiple type definitions in
2914 different files. This must hash all types that will compare
2915 equal via comptypes to the same value. In practice it hashes
2916 on some of the simple stuff and leaves the details to comptypes. */
2919 c_type_hash (const void *p
)
2925 switch (TREE_CODE (t
))
2927 /* For pointers, hash on pointee type plus some swizzling. */
2929 return c_type_hash (TREE_TYPE (t
)) ^ 0x3003003;
2930 /* Hash on number of elements and total size. */
2933 t2
= TYPE_VALUES (t
);
2937 t2
= TYPE_FIELDS (t
);
2939 case QUAL_UNION_TYPE
:
2941 t2
= TYPE_FIELDS (t
);
2945 t2
= TYPE_FIELDS (t
);
2950 for (; t2
; t2
= TREE_CHAIN (t2
))
2952 size
= TREE_INT_CST_LOW (TYPE_SIZE (t
));
2953 return ((size
<< 24) | (i
<< shift
));
2956 static GTY((param_is (union tree_node
))) htab_t type_hash_table
;
2958 /* Return the typed-based alias set for T, which may be an expression
2959 or a type. Return -1 if we don't do anything special. */
2962 c_common_get_alias_set (tree t
)
2967 /* Permit type-punning when accessing a union, provided the access
2968 is directly through the union. For example, this code does not
2969 permit taking the address of a union member and then storing
2970 through it. Even the type-punning allowed here is a GCC
2971 extension, albeit a common and useful one; the C standard says
2972 that such accesses have implementation-defined behavior. */
2974 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2975 u
= TREE_OPERAND (u
, 0))
2976 if (TREE_CODE (u
) == COMPONENT_REF
2977 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2980 /* That's all the expressions we handle specially. */
2984 /* The C standard guarantees that any object may be accessed via an
2985 lvalue that has character type. */
2986 if (t
== char_type_node
2987 || t
== signed_char_type_node
2988 || t
== unsigned_char_type_node
)
2991 /* If it has the may_alias attribute, it can alias anything. */
2992 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (t
)))
2995 /* The C standard specifically allows aliasing between signed and
2996 unsigned variants of the same type. We treat the signed
2997 variant as canonical. */
2998 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3000 tree t1
= c_common_signed_type (t
);
3002 /* t1 == t can happen for boolean nodes which are always unsigned. */
3004 return get_alias_set (t1
);
3006 else if (POINTER_TYPE_P (t
))
3010 /* Unfortunately, there is no canonical form of a pointer type.
3011 In particular, if we have `typedef int I', then `int *', and
3012 `I *' are different types. So, we have to pick a canonical
3013 representative. We do this below.
3015 Technically, this approach is actually more conservative that
3016 it needs to be. In particular, `const int *' and `int *'
3017 should be in different alias sets, according to the C and C++
3018 standard, since their types are not the same, and so,
3019 technically, an `int **' and `const int **' cannot point at
3022 But, the standard is wrong. In particular, this code is
3027 const int* const* cipp = ipp;
3029 And, it doesn't make sense for that to be legal unless you
3030 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
3031 the pointed-to types. This issue has been reported to the
3033 t1
= build_type_no_quals (t
);
3035 return get_alias_set (t1
);
3038 /* Handle the case of multiple type nodes referring to "the same" type,
3039 which occurs with IMA. These share an alias set. FIXME: Currently only
3040 C90 is handled. (In C99 type compatibility is not transitive, which
3041 complicates things mightily. The alias set splay trees can theoretically
3042 represent this, but insertion is tricky when you consider all the
3043 different orders things might arrive in.) */
3045 if (c_language
!= clk_c
|| flag_isoc99
)
3048 /* Save time if there's only one input file. */
3049 if (num_in_fnames
== 1)
3052 /* Pointers need special handling if they point to any type that
3053 needs special handling (below). */
3054 if (TREE_CODE (t
) == POINTER_TYPE
)
3057 /* Find bottom type under any nested POINTERs. */
3058 for (t2
= TREE_TYPE (t
);
3059 TREE_CODE (t2
) == POINTER_TYPE
;
3060 t2
= TREE_TYPE (t2
))
3062 if (TREE_CODE (t2
) != RECORD_TYPE
3063 && TREE_CODE (t2
) != ENUMERAL_TYPE
3064 && TREE_CODE (t2
) != QUAL_UNION_TYPE
3065 && TREE_CODE (t2
) != UNION_TYPE
)
3067 if (TYPE_SIZE (t2
) == 0)
3070 /* These are the only cases that need special handling. */
3071 if (TREE_CODE (t
) != RECORD_TYPE
3072 && TREE_CODE (t
) != ENUMERAL_TYPE
3073 && TREE_CODE (t
) != QUAL_UNION_TYPE
3074 && TREE_CODE (t
) != UNION_TYPE
3075 && TREE_CODE (t
) != POINTER_TYPE
)
3078 if (TYPE_SIZE (t
) == 0)
3081 /* Look up t in hash table. Only one of the compatible types within each
3082 alias set is recorded in the table. */
3083 if (!type_hash_table
)
3084 type_hash_table
= htab_create_ggc (1021, c_type_hash
,
3085 (htab_eq
) lang_hooks
.types_compatible_p
,
3087 slot
= htab_find_slot (type_hash_table
, t
, INSERT
);
3090 TYPE_ALIAS_SET (t
) = TYPE_ALIAS_SET ((tree
)*slot
);
3091 return TYPE_ALIAS_SET ((tree
)*slot
);
3094 /* Our caller will assign and record (in t) a new alias set; all we need
3095 to do is remember t in the hash table. */
3101 /* Compute the value of 'sizeof (TYPE)' or '__alignof__ (TYPE)', where the
3102 second parameter indicates which OPERATOR is being applied. The COMPLAIN
3103 flag controls whether we should diagnose possibly ill-formed
3104 constructs or not. */
3107 c_sizeof_or_alignof_type (tree type
, bool is_sizeof
, int complain
)
3109 const char *op_name
;
3111 enum tree_code type_code
= TREE_CODE (type
);
3113 op_name
= is_sizeof
? "sizeof" : "__alignof__";
3115 if (type_code
== FUNCTION_TYPE
)
3119 if (complain
&& (pedantic
|| warn_pointer_arith
))
3120 pedwarn ("invalid application of %<sizeof%> to a function type");
3121 value
= size_one_node
;
3124 value
= size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
3126 else if (type_code
== VOID_TYPE
|| type_code
== ERROR_MARK
)
3128 if (type_code
== VOID_TYPE
3129 && complain
&& (pedantic
|| warn_pointer_arith
))
3130 pedwarn ("invalid application of %qs to a void type", op_name
);
3131 value
= size_one_node
;
3133 else if (!COMPLETE_TYPE_P (type
))
3136 error ("invalid application of %qs to incomplete type %qT ",
3138 value
= size_zero_node
;
3143 /* Convert in case a char is more than one unit. */
3144 value
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
3145 size_int (TYPE_PRECISION (char_type_node
)
3148 value
= size_int (TYPE_ALIGN_UNIT (type
));
3151 /* VALUE will have an integer type with TYPE_IS_SIZETYPE set.
3152 TYPE_IS_SIZETYPE means that certain things (like overflow) will
3153 never happen. However, this node should really have type
3154 `size_t', which is just a typedef for an ordinary integer type. */
3155 value
= fold_convert (size_type_node
, value
);
3156 gcc_assert (!TYPE_IS_SIZETYPE (TREE_TYPE (value
)));
3161 /* Implement the __alignof keyword: Return the minimum required
3162 alignment of EXPR, measured in bytes. For VAR_DECL's and
3163 FIELD_DECL's return DECL_ALIGN (which can be set from an
3164 "aligned" __attribute__ specification). */
3167 c_alignof_expr (tree expr
)
3171 if (TREE_CODE (expr
) == VAR_DECL
)
3172 t
= size_int (DECL_ALIGN_UNIT (expr
));
3174 else if (TREE_CODE (expr
) == COMPONENT_REF
3175 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
3177 error ("%<__alignof%> applied to a bit-field");
3180 else if (TREE_CODE (expr
) == COMPONENT_REF
3181 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
3182 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (expr
, 1)));
3184 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3186 tree t
= TREE_OPERAND (expr
, 0);
3188 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3190 while ((TREE_CODE (t
) == NOP_EXPR
|| TREE_CODE (t
) == CONVERT_EXPR
)
3191 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
3195 t
= TREE_OPERAND (t
, 0);
3196 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
3197 if (thisalign
> bestalign
)
3198 best
= t
, bestalign
= thisalign
;
3200 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
3203 return c_alignof (TREE_TYPE (expr
));
3205 return fold_convert (size_type_node
, t
);
3208 /* Handle C and C++ default attributes. */
3210 enum built_in_attribute
3212 #define DEF_ATTR_NULL_TREE(ENUM) ENUM,
3213 #define DEF_ATTR_INT(ENUM, VALUE) ENUM,
3214 #define DEF_ATTR_IDENT(ENUM, STRING) ENUM,
3215 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) ENUM,
3216 #include "builtin-attrs.def"
3217 #undef DEF_ATTR_NULL_TREE
3219 #undef DEF_ATTR_IDENT
3220 #undef DEF_ATTR_TREE_LIST
3224 static GTY(()) tree built_in_attributes
[(int) ATTR_LAST
];
3226 static void c_init_attributes (void);
3230 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
3231 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
3232 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
3233 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
3234 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3235 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3236 #define DEF_FUNCTION_TYPE_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) NAME,
3237 #define DEF_FUNCTION_TYPE_6(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6) NAME,
3238 #define DEF_FUNCTION_TYPE_7(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7) NAME,
3239 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
3240 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
3241 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
3242 #define DEF_FUNCTION_TYPE_VAR_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
3243 #define DEF_FUNCTION_TYPE_VAR_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
3244 #define DEF_FUNCTION_TYPE_VAR_5(NAME, RETURN, ARG1, ARG2, ARG3, ARG4, ARG6) \
3246 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
3247 #include "builtin-types.def"
3248 #undef DEF_PRIMITIVE_TYPE
3249 #undef DEF_FUNCTION_TYPE_0
3250 #undef DEF_FUNCTION_TYPE_1
3251 #undef DEF_FUNCTION_TYPE_2
3252 #undef DEF_FUNCTION_TYPE_3
3253 #undef DEF_FUNCTION_TYPE_4
3254 #undef DEF_FUNCTION_TYPE_5
3255 #undef DEF_FUNCTION_TYPE_6
3256 #undef DEF_FUNCTION_TYPE_7
3257 #undef DEF_FUNCTION_TYPE_VAR_0
3258 #undef DEF_FUNCTION_TYPE_VAR_1
3259 #undef DEF_FUNCTION_TYPE_VAR_2
3260 #undef DEF_FUNCTION_TYPE_VAR_3
3261 #undef DEF_FUNCTION_TYPE_VAR_4
3262 #undef DEF_FUNCTION_TYPE_VAR_5
3263 #undef DEF_POINTER_TYPE
3267 typedef enum c_builtin_type builtin_type
;
3269 /* A temporary array for c_common_nodes_and_builtins. Used in
3270 communication with def_fn_type. */
3271 static tree builtin_types
[(int) BT_LAST
+ 1];
3273 /* A helper function for c_common_nodes_and_builtins. Build function type
3274 for DEF with return type RET and N arguments. If VAR is true, then the
3275 function should be variadic after those N arguments.
3277 Takes special care not to ICE if any of the types involved are
3278 error_mark_node, which indicates that said type is not in fact available
3279 (see builtin_type_for_size). In which case the function type as a whole
3280 should be error_mark_node. */
3283 def_fn_type (builtin_type def
, builtin_type ret
, bool var
, int n
, ...)
3285 tree args
= NULL
, t
;
3290 for (i
= 0; i
< n
; ++i
)
3292 builtin_type a
= va_arg (list
, builtin_type
);
3293 t
= builtin_types
[a
];
3294 if (t
== error_mark_node
)
3296 args
= tree_cons (NULL_TREE
, t
, args
);
3300 args
= nreverse (args
);
3302 args
= chainon (args
, void_list_node
);
3304 t
= builtin_types
[ret
];
3305 if (t
== error_mark_node
)
3307 t
= build_function_type (t
, args
);
3310 builtin_types
[def
] = t
;
3313 /* Build builtin functions common to both C and C++ language
3317 c_define_builtins (tree va_list_ref_type_node
, tree va_list_arg_type_node
)
3319 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3320 builtin_types[ENUM] = VALUE;
3321 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3322 def_fn_type (ENUM, RETURN, 0, 0);
3323 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3324 def_fn_type (ENUM, RETURN, 0, 1, ARG1);
3325 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3326 def_fn_type (ENUM, RETURN, 0, 2, ARG1, ARG2);
3327 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3328 def_fn_type (ENUM, RETURN, 0, 3, ARG1, ARG2, ARG3);
3329 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3330 def_fn_type (ENUM, RETURN, 0, 4, ARG1, ARG2, ARG3, ARG4);
3331 #define DEF_FUNCTION_TYPE_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3332 def_fn_type (ENUM, RETURN, 0, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3333 #define DEF_FUNCTION_TYPE_6(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3335 def_fn_type (ENUM, RETURN, 0, 6, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6);
3336 #define DEF_FUNCTION_TYPE_7(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5, \
3338 def_fn_type (ENUM, RETURN, 0, 7, ARG1, ARG2, ARG3, ARG4, ARG5, ARG6, ARG7);
3339 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3340 def_fn_type (ENUM, RETURN, 1, 0);
3341 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3342 def_fn_type (ENUM, RETURN, 1, 1, ARG1);
3343 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3344 def_fn_type (ENUM, RETURN, 1, 2, ARG1, ARG2);
3345 #define DEF_FUNCTION_TYPE_VAR_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3346 def_fn_type (ENUM, RETURN, 1, 3, ARG1, ARG2, ARG3);
3347 #define DEF_FUNCTION_TYPE_VAR_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3348 def_fn_type (ENUM, RETURN, 1, 4, ARG1, ARG2, ARG3, ARG4);
3349 #define DEF_FUNCTION_TYPE_VAR_5(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4, ARG5) \
3350 def_fn_type (ENUM, RETURN, 1, 5, ARG1, ARG2, ARG3, ARG4, ARG5);
3351 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3352 builtin_types[(int) ENUM] = build_pointer_type (builtin_types[(int) TYPE]);
3354 #include "builtin-types.def"
3356 #undef DEF_PRIMITIVE_TYPE
3357 #undef DEF_FUNCTION_TYPE_1
3358 #undef DEF_FUNCTION_TYPE_2
3359 #undef DEF_FUNCTION_TYPE_3
3360 #undef DEF_FUNCTION_TYPE_4
3361 #undef DEF_FUNCTION_TYPE_5
3362 #undef DEF_FUNCTION_TYPE_6
3363 #undef DEF_FUNCTION_TYPE_VAR_0
3364 #undef DEF_FUNCTION_TYPE_VAR_1
3365 #undef DEF_FUNCTION_TYPE_VAR_2
3366 #undef DEF_FUNCTION_TYPE_VAR_3
3367 #undef DEF_FUNCTION_TYPE_VAR_4
3368 #undef DEF_FUNCTION_TYPE_VAR_5
3369 #undef DEF_POINTER_TYPE
3370 builtin_types
[(int) BT_LAST
] = NULL_TREE
;
3372 c_init_attributes ();
3374 #define DEF_BUILTIN(ENUM, NAME, CLASS, TYPE, LIBTYPE, BOTH_P, FALLBACK_P, \
3375 NONANSI_P, ATTRS, IMPLICIT, COND) \
3377 def_builtin_1 (ENUM, NAME, CLASS, \
3378 builtin_types[(int) TYPE], \
3379 builtin_types[(int) LIBTYPE], \
3380 BOTH_P, FALLBACK_P, NONANSI_P, \
3381 built_in_attributes[(int) ATTRS], IMPLICIT);
3382 #include "builtins.def"
3385 build_common_builtin_nodes ();
3387 targetm
.init_builtins ();
3392 /* Build tree nodes and builtin functions common to both C and C++ language
3396 c_common_nodes_and_builtins (void)
3398 int wchar_type_size
;
3399 tree array_domain_type
;
3400 tree va_list_ref_type_node
;
3401 tree va_list_arg_type_node
;
3403 /* Define `int' and `char' first so that dbx will output them first. */
3404 record_builtin_type (RID_INT
, NULL
, integer_type_node
);
3405 record_builtin_type (RID_CHAR
, "char", char_type_node
);
3407 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3408 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3409 but not C. Are the conditionals here needed? */
3410 if (c_dialect_cxx ())
3411 record_builtin_type (RID_SIGNED
, NULL
, integer_type_node
);
3412 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
3413 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
3414 record_builtin_type (RID_MAX
, "long unsigned int",
3415 long_unsigned_type_node
);
3416 if (c_dialect_cxx ())
3417 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
3418 record_builtin_type (RID_MAX
, "long long int",
3419 long_long_integer_type_node
);
3420 record_builtin_type (RID_MAX
, "long long unsigned int",
3421 long_long_unsigned_type_node
);
3422 if (c_dialect_cxx ())
3423 record_builtin_type (RID_MAX
, "long long unsigned",
3424 long_long_unsigned_type_node
);
3425 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
3426 record_builtin_type (RID_MAX
, "short unsigned int",
3427 short_unsigned_type_node
);
3428 if (c_dialect_cxx ())
3429 record_builtin_type (RID_MAX
, "unsigned short",
3430 short_unsigned_type_node
);
3432 /* Define both `signed char' and `unsigned char'. */
3433 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
3434 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
3436 /* These are types that c_common_type_for_size and
3437 c_common_type_for_mode use. */
3438 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3440 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3442 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3444 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3446 #if HOST_BITS_PER_WIDE_INT >= 64
3447 if (targetm
.scalar_mode_supported_p (TImode
))
3448 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3449 get_identifier ("__int128_t"),
3452 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3453 unsigned_intQI_type_node
));
3454 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3455 unsigned_intHI_type_node
));
3456 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3457 unsigned_intSI_type_node
));
3458 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3459 unsigned_intDI_type_node
));
3460 #if HOST_BITS_PER_WIDE_INT >= 64
3461 if (targetm
.scalar_mode_supported_p (TImode
))
3462 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3463 get_identifier ("__uint128_t"),
3464 unsigned_intTI_type_node
));
3467 /* Create the widest literal types. */
3468 widest_integer_literal_type_node
3469 = make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
3470 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3471 widest_integer_literal_type_node
));
3473 widest_unsigned_literal_type_node
3474 = make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
3475 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
3476 widest_unsigned_literal_type_node
));
3478 /* `unsigned long' is the standard type for sizeof.
3479 Note that stddef.h uses `unsigned long',
3480 and this must agree, even if long and int are the same size. */
3482 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE
)));
3483 signed_size_type_node
= c_common_signed_type (size_type_node
);
3484 set_sizetype (size_type_node
);
3487 TREE_TYPE (identifier_global_value (get_identifier (PID_TYPE
)));
3489 build_common_tree_nodes_2 (flag_short_double
);
3491 record_builtin_type (RID_FLOAT
, NULL
, float_type_node
);
3492 record_builtin_type (RID_DOUBLE
, NULL
, double_type_node
);
3493 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
3495 /* Only supported decimal floating point extension if the target
3496 actually supports underlying modes. */
3497 if (targetm
.scalar_mode_supported_p (SDmode
)
3498 && targetm
.scalar_mode_supported_p (DDmode
)
3499 && targetm
.scalar_mode_supported_p (TDmode
))
3501 record_builtin_type (RID_DFLOAT32
, NULL
, dfloat32_type_node
);
3502 record_builtin_type (RID_DFLOAT64
, NULL
, dfloat64_type_node
);
3503 record_builtin_type (RID_DFLOAT128
, NULL
, dfloat128_type_node
);
3506 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3507 get_identifier ("complex int"),
3508 complex_integer_type_node
));
3509 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3510 get_identifier ("complex float"),
3511 complex_float_type_node
));
3512 lang_hooks
.decls
.pushdecl (build_decl (TYPE_DECL
,
3513 get_identifier ("complex double"),
3514 complex_double_type_node
));
3515 lang_hooks
.decls
.pushdecl
3516 (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
3517 complex_long_double_type_node
));
3519 if (c_dialect_cxx ())
3520 /* For C++, make fileptr_type_node a distinct void * type until
3521 FILE type is defined. */
3522 fileptr_type_node
= build_variant_type_copy (ptr_type_node
);
3524 record_builtin_type (RID_VOID
, NULL
, void_type_node
);
3526 /* Set the TYPE_NAME for any variants that were built before
3527 record_builtin_type gave names to the built-in types. */
3529 tree void_name
= TYPE_NAME (void_type_node
);
3530 TYPE_NAME (void_type_node
) = NULL_TREE
;
3531 TYPE_NAME (build_qualified_type (void_type_node
, TYPE_QUAL_CONST
))
3533 TYPE_NAME (void_type_node
) = void_name
;
3536 /* This node must not be shared. */
3537 void_zero_node
= make_node (INTEGER_CST
);
3538 TREE_TYPE (void_zero_node
) = void_type_node
;
3540 void_list_node
= build_void_list_node ();
3542 /* Make a type to be the domain of a few array types
3543 whose domains don't really matter.
3544 200 is small enough that it always fits in size_t
3545 and large enough that it can hold most function names for the
3546 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3547 array_domain_type
= build_index_type (size_int (200));
3549 /* Make a type for arrays of characters.
3550 With luck nothing will ever really depend on the length of this
3552 char_array_type_node
3553 = build_array_type (char_type_node
, array_domain_type
);
3555 /* Likewise for arrays of ints. */
3557 = build_array_type (integer_type_node
, array_domain_type
);
3559 string_type_node
= build_pointer_type (char_type_node
);
3560 const_string_type_node
3561 = build_pointer_type (build_qualified_type
3562 (char_type_node
, TYPE_QUAL_CONST
));
3564 /* This is special for C++ so functions can be overloaded. */
3565 wchar_type_node
= get_identifier (MODIFIED_WCHAR_TYPE
);
3566 wchar_type_node
= TREE_TYPE (identifier_global_value (wchar_type_node
));
3567 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
3568 if (c_dialect_cxx ())
3570 if (TYPE_UNSIGNED (wchar_type_node
))
3571 wchar_type_node
= make_unsigned_type (wchar_type_size
);
3573 wchar_type_node
= make_signed_type (wchar_type_size
);
3574 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
3578 signed_wchar_type_node
= c_common_signed_type (wchar_type_node
);
3579 unsigned_wchar_type_node
= c_common_unsigned_type (wchar_type_node
);
3582 /* This is for wide string constants. */
3583 wchar_array_type_node
3584 = build_array_type (wchar_type_node
, array_domain_type
);
3587 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE
)));
3590 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE
)));
3592 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE
)));
3594 default_function_type
= build_function_type (integer_type_node
, NULL_TREE
);
3596 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE
)));
3597 unsigned_ptrdiff_type_node
= c_common_unsigned_type (ptrdiff_type_node
);
3599 lang_hooks
.decls
.pushdecl
3600 (build_decl (TYPE_DECL
, get_identifier ("__builtin_va_list"),
3601 va_list_type_node
));
3603 if (TREE_CODE (va_list_type_node
) == ARRAY_TYPE
)
3605 va_list_arg_type_node
= va_list_ref_type_node
=
3606 build_pointer_type (TREE_TYPE (va_list_type_node
));
3610 va_list_arg_type_node
= va_list_type_node
;
3611 va_list_ref_type_node
= build_reference_type (va_list_type_node
);
3614 if (!flag_preprocess_only
)
3615 c_define_builtins (va_list_ref_type_node
, va_list_arg_type_node
);
3617 main_identifier_node
= get_identifier ("main");
3619 /* Create the built-in __null node. It is important that this is
3621 null_node
= make_node (INTEGER_CST
);
3622 TREE_TYPE (null_node
) = c_common_type_for_size (POINTER_SIZE
, 0);
3624 /* Since builtin_types isn't gc'ed, don't export these nodes. */
3625 memset (builtin_types
, 0, sizeof (builtin_types
));
3628 /* Look up the function in built_in_decls that corresponds to DECL
3629 and set ASMSPEC as its user assembler name. DECL must be a
3630 function decl that declares a builtin. */
3633 set_builtin_user_assembler_name (tree decl
, const char *asmspec
)
3636 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
3637 && DECL_BUILT_IN_CLASS (decl
) == BUILT_IN_NORMAL
3640 builtin
= built_in_decls
[DECL_FUNCTION_CODE (decl
)];
3641 set_user_assembler_name (builtin
, asmspec
);
3642 if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMCPY
)
3643 init_block_move_fn (asmspec
);
3644 else if (DECL_FUNCTION_CODE (decl
) == BUILT_IN_MEMSET
)
3645 init_block_clear_fn (asmspec
);
3648 /* The number of named compound-literals generated thus far. */
3649 static GTY(()) int compound_literal_number
;
3651 /* Set DECL_NAME for DECL, a VAR_DECL for a compound-literal. */
3654 set_compound_literal_name (tree decl
)
3657 ASM_FORMAT_PRIVATE_NAME (name
, "__compound_literal",
3658 compound_literal_number
);
3659 compound_literal_number
++;
3660 DECL_NAME (decl
) = get_identifier (name
);
3664 build_va_arg (tree expr
, tree type
)
3666 return build1 (VA_ARG_EXPR
, type
, expr
);
3670 /* Linked list of disabled built-in functions. */
3672 typedef struct disabled_builtin
3675 struct disabled_builtin
*next
;
3677 static disabled_builtin
*disabled_builtins
= NULL
;
3679 static bool builtin_function_disabled_p (const char *);
3681 /* Disable a built-in function specified by -fno-builtin-NAME. If NAME
3682 begins with "__builtin_", give an error. */
3685 disable_builtin_function (const char *name
)
3687 if (strncmp (name
, "__builtin_", strlen ("__builtin_")) == 0)
3688 error ("cannot disable built-in function %qs", name
);
3691 disabled_builtin
*new_disabled_builtin
= XNEW (disabled_builtin
);
3692 new_disabled_builtin
->name
= name
;
3693 new_disabled_builtin
->next
= disabled_builtins
;
3694 disabled_builtins
= new_disabled_builtin
;
3699 /* Return true if the built-in function NAME has been disabled, false
3703 builtin_function_disabled_p (const char *name
)
3705 disabled_builtin
*p
;
3706 for (p
= disabled_builtins
; p
!= NULL
; p
= p
->next
)
3708 if (strcmp (name
, p
->name
) == 0)
3715 /* Worker for DEF_BUILTIN.
3716 Possibly define a builtin function with one or two names.
3717 Does not declare a non-__builtin_ function if flag_no_builtin, or if
3718 nonansi_p and flag_no_nonansi_builtin. */
3721 def_builtin_1 (enum built_in_function fncode
,
3723 enum built_in_class fnclass
,
3724 tree fntype
, tree libtype
,
3725 bool both_p
, bool fallback_p
, bool nonansi_p
,
3726 tree fnattrs
, bool implicit_p
)
3729 const char *libname
;
3731 if (fntype
== error_mark_node
)
3734 gcc_assert ((!both_p
&& !fallback_p
)
3735 || !strncmp (name
, "__builtin_",
3736 strlen ("__builtin_")));
3738 libname
= name
+ strlen ("__builtin_");
3739 decl
= add_builtin_function (name
, fntype
, fncode
, fnclass
,
3740 (fallback_p
? libname
: NULL
),
3743 && !flag_no_builtin
&& !builtin_function_disabled_p (libname
)
3744 && !(nonansi_p
&& flag_no_nonansi_builtin
))
3745 add_builtin_function (libname
, libtype
, fncode
, fnclass
,
3748 built_in_decls
[(int) fncode
] = decl
;
3750 implicit_built_in_decls
[(int) fncode
] = decl
;
3753 /* Nonzero if the type T promotes to int. This is (nearly) the
3754 integral promotions defined in ISO C99 6.3.1.1/2. */
3757 c_promoting_integer_type_p (tree t
)
3759 switch (TREE_CODE (t
))
3762 return (TYPE_MAIN_VARIANT (t
) == char_type_node
3763 || TYPE_MAIN_VARIANT (t
) == signed_char_type_node
3764 || TYPE_MAIN_VARIANT (t
) == unsigned_char_type_node
3765 || TYPE_MAIN_VARIANT (t
) == short_integer_type_node
3766 || TYPE_MAIN_VARIANT (t
) == short_unsigned_type_node
3767 || TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
));
3770 /* ??? Technically all enumerations not larger than an int
3771 promote to an int. But this is used along code paths
3772 that only want to notice a size change. */
3773 return TYPE_PRECISION (t
) < TYPE_PRECISION (integer_type_node
);
3783 /* Return 1 if PARMS specifies a fixed number of parameters
3784 and none of their types is affected by default promotions. */
3787 self_promoting_args_p (tree parms
)
3790 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
3792 tree type
= TREE_VALUE (t
);
3794 if (type
== error_mark_node
)
3797 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
3803 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
3806 if (c_promoting_integer_type_p (type
))
3812 /* Recursively examines the array elements of TYPE, until a non-array
3813 element type is found. */
3816 strip_array_types (tree type
)
3818 while (TREE_CODE (type
) == ARRAY_TYPE
)
3819 type
= TREE_TYPE (type
);
3824 /* Recursively remove any '*' or '&' operator from TYPE. */
3826 strip_pointer_operator (tree t
)
3828 while (POINTER_TYPE_P (t
))
3833 /* Used to compare case labels. K1 and K2 are actually tree nodes
3834 representing case labels, or NULL_TREE for a `default' label.
3835 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3836 K2, and 0 if K1 and K2 are equal. */
3839 case_compare (splay_tree_key k1
, splay_tree_key k2
)
3841 /* Consider a NULL key (such as arises with a `default' label) to be
3842 smaller than anything else. */
3848 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
3851 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3852 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3853 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3854 case label was declared using the usual C/C++ syntax, rather than
3855 the GNU case range extension. CASES is a tree containing all the
3856 case ranges processed so far; COND is the condition for the
3857 switch-statement itself. Returns the CASE_LABEL_EXPR created, or
3858 ERROR_MARK_NODE if no CASE_LABEL_EXPR is created. */
3861 c_add_case_label (splay_tree cases
, tree cond
, tree orig_type
,
3862 tree low_value
, tree high_value
)
3867 splay_tree_node node
;
3869 /* Create the LABEL_DECL itself. */
3870 label
= create_artificial_label ();
3872 /* If there was an error processing the switch condition, bail now
3873 before we get more confused. */
3874 if (!cond
|| cond
== error_mark_node
)
3877 if ((low_value
&& TREE_TYPE (low_value
)
3878 && POINTER_TYPE_P (TREE_TYPE (low_value
)))
3879 || (high_value
&& TREE_TYPE (high_value
)
3880 && POINTER_TYPE_P (TREE_TYPE (high_value
))))
3882 error ("pointers are not permitted as case values");
3886 /* Case ranges are a GNU extension. */
3887 if (high_value
&& pedantic
)
3888 pedwarn ("range expressions in switch statements are non-standard");
3890 type
= TREE_TYPE (cond
);
3893 low_value
= check_case_value (low_value
);
3894 low_value
= convert_and_check (type
, low_value
);
3895 if (low_value
== error_mark_node
)
3900 high_value
= check_case_value (high_value
);
3901 high_value
= convert_and_check (type
, high_value
);
3902 if (high_value
== error_mark_node
)
3906 if (low_value
&& high_value
)
3908 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3909 really a case range, even though it was written that way.
3910 Remove the HIGH_VALUE to simplify later processing. */
3911 if (tree_int_cst_equal (low_value
, high_value
))
3912 high_value
= NULL_TREE
;
3913 else if (!tree_int_cst_lt (low_value
, high_value
))
3914 warning (0, "empty range specified");
3917 /* See if the case is in range of the type of the original testing
3918 expression. If both low_value and high_value are out of range,
3919 don't insert the case label and return NULL_TREE. */
3921 && !check_case_bounds (type
, orig_type
,
3922 &low_value
, high_value
? &high_value
: NULL
))
3925 /* Look up the LOW_VALUE in the table of case labels we already
3927 node
= splay_tree_lookup (cases
, (splay_tree_key
) low_value
);
3928 /* If there was not an exact match, check for overlapping ranges.
3929 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3930 that's a `default' label and the only overlap is an exact match. */
3931 if (!node
&& (low_value
|| high_value
))
3933 splay_tree_node low_bound
;
3934 splay_tree_node high_bound
;
3936 /* Even though there wasn't an exact match, there might be an
3937 overlap between this case range and another case range.
3938 Since we've (inductively) not allowed any overlapping case
3939 ranges, we simply need to find the greatest low case label
3940 that is smaller that LOW_VALUE, and the smallest low case
3941 label that is greater than LOW_VALUE. If there is an overlap
3942 it will occur in one of these two ranges. */
3943 low_bound
= splay_tree_predecessor (cases
,
3944 (splay_tree_key
) low_value
);
3945 high_bound
= splay_tree_successor (cases
,
3946 (splay_tree_key
) low_value
);
3948 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3949 the LOW_VALUE, so there is no need to check unless the
3950 LOW_BOUND is in fact itself a case range. */
3952 && CASE_HIGH ((tree
) low_bound
->value
)
3953 && tree_int_cst_compare (CASE_HIGH ((tree
) low_bound
->value
),
3956 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3957 range is bigger than the low end of the current range, so we
3958 are only interested if the current range is a real range, and
3959 not an ordinary case label. */
3962 && (tree_int_cst_compare ((tree
) high_bound
->key
,
3967 /* If there was an overlap, issue an error. */
3970 tree duplicate
= CASE_LABEL ((tree
) node
->value
);
3974 error ("duplicate (or overlapping) case value");
3975 error ("%Jthis is the first entry overlapping that value", duplicate
);
3979 error ("duplicate case value") ;
3980 error ("%Jpreviously used here", duplicate
);
3984 error ("multiple default labels in one switch");
3985 error ("%Jthis is the first default label", duplicate
);
3990 /* Add a CASE_LABEL to the statement-tree. */
3991 case_label
= add_stmt (build_case_label (low_value
, high_value
, label
));
3992 /* Register this case label in the splay tree. */
3993 splay_tree_insert (cases
,
3994 (splay_tree_key
) low_value
,
3995 (splay_tree_value
) case_label
);
4000 /* Add a label so that the back-end doesn't think that the beginning of
4001 the switch is unreachable. Note that we do not add a case label, as
4002 that just leads to duplicates and thence to failure later on. */
4005 tree t
= create_artificial_label ();
4006 add_stmt (build_stmt (LABEL_EXPR
, t
));
4008 return error_mark_node
;
4011 /* Subroutines of c_do_switch_warnings, called via splay_tree_foreach.
4012 Used to verify that case values match up with enumerator values. */
4015 match_case_to_enum_1 (tree key
, tree type
, tree label
)
4017 char buf
[2 + 2*HOST_BITS_PER_WIDE_INT
/4 + 1];
4019 /* ??? Not working too hard to print the double-word value.
4020 Should perhaps be done with %lwd in the diagnostic routines? */
4021 if (TREE_INT_CST_HIGH (key
) == 0)
4022 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_UNSIGNED
,
4023 TREE_INT_CST_LOW (key
));
4024 else if (!TYPE_UNSIGNED (type
)
4025 && TREE_INT_CST_HIGH (key
) == -1
4026 && TREE_INT_CST_LOW (key
) != 0)
4027 snprintf (buf
, sizeof (buf
), "-" HOST_WIDE_INT_PRINT_UNSIGNED
,
4028 -TREE_INT_CST_LOW (key
));
4030 snprintf (buf
, sizeof (buf
), HOST_WIDE_INT_PRINT_DOUBLE_HEX
,
4031 TREE_INT_CST_HIGH (key
), TREE_INT_CST_LOW (key
));
4033 if (TYPE_NAME (type
) == 0)
4034 warning (0, "%Jcase value %qs not in enumerated type",
4035 CASE_LABEL (label
), buf
);
4037 warning (0, "%Jcase value %qs not in enumerated type %qT",
4038 CASE_LABEL (label
), buf
, type
);
4041 /* Subroutine of c_do_switch_warnings, called via splay_tree_foreach.
4042 Used to verify that case values match up with enumerator values. */
4045 match_case_to_enum (splay_tree_node node
, void *data
)
4047 tree label
= (tree
) node
->value
;
4048 tree type
= (tree
) data
;
4050 /* Skip default case. */
4051 if (!CASE_LOW (label
))
4054 /* If CASE_LOW_SEEN is not set, that means CASE_LOW did not appear
4055 when we did our enum->case scan. Reset our scratch bit after. */
4056 if (!CASE_LOW_SEEN (label
))
4057 match_case_to_enum_1 (CASE_LOW (label
), type
, label
);
4059 CASE_LOW_SEEN (label
) = 0;
4061 /* If CASE_HIGH is non-null, we have a range. If CASE_HIGH_SEEN is
4062 not set, that means that CASE_HIGH did not appear when we did our
4063 enum->case scan. Reset our scratch bit after. */
4064 if (CASE_HIGH (label
))
4066 if (!CASE_HIGH_SEEN (label
))
4067 match_case_to_enum_1 (CASE_HIGH (label
), type
, label
);
4069 CASE_HIGH_SEEN (label
) = 0;
4075 /* Handle -Wswitch*. Called from the front end after parsing the
4076 switch construct. */
4077 /* ??? Should probably be somewhere generic, since other languages
4078 besides C and C++ would want this. At the moment, however, C/C++
4079 are the only tree-ssa languages that support enumerations at all,
4080 so the point is moot. */
4083 c_do_switch_warnings (splay_tree cases
, location_t switch_location
,
4084 tree type
, tree cond
)
4086 splay_tree_node default_node
;
4087 splay_tree_node node
;
4090 if (!warn_switch
&& !warn_switch_enum
&& !warn_switch_default
)
4093 default_node
= splay_tree_lookup (cases
, (splay_tree_key
) NULL
);
4095 warning (OPT_Wswitch_default
, "%Hswitch missing default case",
4098 /* From here on, we only care about about enumerated types. */
4099 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
4102 /* If the switch expression was an enumerated type, check that
4103 exactly all enumeration literals are covered by the cases.
4104 The check is made when -Wswitch was specified and there is no
4105 default case, or when -Wswitch-enum was specified. */
4107 if (!warn_switch_enum
4108 && !(warn_switch
&& !default_node
))
4111 /* Clearing COND if it is not an integer constant simplifies
4112 the tests inside the loop below. */
4113 if (TREE_CODE (cond
) != INTEGER_CST
)
4116 /* The time complexity here is O(N*lg(N)) worst case, but for the
4117 common case of monotonically increasing enumerators, it is
4118 O(N), since the nature of the splay tree will keep the next
4119 element adjacent to the root at all times. */
4121 for (chain
= TYPE_VALUES (type
); chain
; chain
= TREE_CHAIN (chain
))
4123 tree value
= TREE_VALUE (chain
);
4124 node
= splay_tree_lookup (cases
, (splay_tree_key
) value
);
4127 /* Mark the CASE_LOW part of the case entry as seen. */
4128 tree label
= (tree
) node
->value
;
4129 CASE_LOW_SEEN (label
) = 1;
4133 /* Even though there wasn't an exact match, there might be a
4134 case range which includes the enumator's value. */
4135 node
= splay_tree_predecessor (cases
, (splay_tree_key
) value
);
4136 if (node
&& CASE_HIGH ((tree
) node
->value
))
4138 tree label
= (tree
) node
->value
;
4139 int cmp
= tree_int_cst_compare (CASE_HIGH (label
), value
);
4142 /* If we match the upper bound exactly, mark the CASE_HIGH
4143 part of the case entry as seen. */
4145 CASE_HIGH_SEEN (label
) = 1;
4150 /* We've now determined that this enumerated literal isn't
4151 handled by the case labels of the switch statement. */
4153 /* If the switch expression is a constant, we only really care
4154 about whether that constant is handled by the switch. */
4155 if (cond
&& tree_int_cst_compare (cond
, value
))
4158 warning (0, "%Henumeration value %qE not handled in switch",
4159 &switch_location
, TREE_PURPOSE (chain
));
4162 /* Warn if there are case expressions that don't correspond to
4163 enumerators. This can occur since C and C++ don't enforce
4164 type-checking of assignments to enumeration variables.
4166 The time complexity here is now always O(N) worst case, since
4167 we should have marked both the lower bound and upper bound of
4168 every disjoint case label, with CASE_LOW_SEEN and CASE_HIGH_SEEN
4169 above. This scan also resets those fields. */
4170 splay_tree_foreach (cases
, match_case_to_enum
, type
);
4173 /* Finish an expression taking the address of LABEL (an
4174 IDENTIFIER_NODE). Returns an expression for the address. */
4177 finish_label_address_expr (tree label
)
4182 pedwarn ("taking the address of a label is non-standard");
4184 if (label
== error_mark_node
)
4185 return error_mark_node
;
4187 label
= lookup_label (label
);
4188 if (label
== NULL_TREE
)
4189 result
= null_pointer_node
;
4192 TREE_USED (label
) = 1;
4193 result
= build1 (ADDR_EXPR
, ptr_type_node
, label
);
4194 /* The current function in not necessarily uninlinable.
4195 Computed gotos are incompatible with inlining, but the value
4196 here could be used only in a diagnostic, for example. */
4202 /* Hook used by expand_expr to expand language-specific tree codes. */
4203 /* The only things that should go here are bits needed to expand
4204 constant initializers. Everything else should be handled by the
4205 gimplification routines. */
4208 c_expand_expr (tree exp
, rtx target
, enum machine_mode tmode
,
4209 int modifier
/* Actually enum_modifier. */,
4212 switch (TREE_CODE (exp
))
4214 case COMPOUND_LITERAL_EXPR
:
4216 /* Initialize the anonymous variable declared in the compound
4217 literal, then return the variable. */
4218 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
4219 emit_local_var (decl
);
4220 return expand_expr_real (decl
, target
, tmode
, modifier
, alt_rtl
);
4229 /* Generate the RTL for the body of FNDECL. */
4232 c_expand_body (tree fndecl
)
4235 if (!DECL_INITIAL (fndecl
)
4236 || DECL_INITIAL (fndecl
) == error_mark_node
)
4239 tree_rest_of_compilation (fndecl
);
4241 if (DECL_STATIC_CONSTRUCTOR (fndecl
)
4242 && targetm
.have_ctors_dtors
)
4243 targetm
.asm_out
.constructor (XEXP (DECL_RTL (fndecl
), 0),
4244 decl_init_priority_lookup (fndecl
));
4245 if (DECL_STATIC_DESTRUCTOR (fndecl
)
4246 && targetm
.have_ctors_dtors
)
4247 targetm
.asm_out
.destructor (XEXP (DECL_RTL (fndecl
), 0),
4248 decl_fini_priority_lookup (fndecl
));
4251 /* Hook used by staticp to handle language-specific tree codes. */
4254 c_staticp (tree exp
)
4256 return (TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
4257 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
))
4262 /* Given a boolean expression ARG, return a tree representing an increment
4263 or decrement (as indicated by CODE) of ARG. The front end must check for
4264 invalid cases (e.g., decrement in C++). */
4266 boolean_increment (enum tree_code code
, tree arg
)
4269 tree true_res
= boolean_true_node
;
4271 arg
= stabilize_reference (arg
);
4274 case PREINCREMENT_EXPR
:
4275 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4277 case POSTINCREMENT_EXPR
:
4278 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
, true_res
);
4279 arg
= save_expr (arg
);
4280 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4281 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4283 case PREDECREMENT_EXPR
:
4284 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4285 invert_truthvalue (arg
));
4287 case POSTDECREMENT_EXPR
:
4288 val
= build2 (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4289 invert_truthvalue (arg
));
4290 arg
= save_expr (arg
);
4291 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4292 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4297 TREE_SIDE_EFFECTS (val
) = 1;
4301 /* Built-in macros for stddef.h, that require macros defined in this
4304 c_stddef_cpp_builtins(void)
4306 builtin_define_with_value ("__SIZE_TYPE__", SIZE_TYPE
, 0);
4307 builtin_define_with_value ("__PTRDIFF_TYPE__", PTRDIFF_TYPE
, 0);
4308 builtin_define_with_value ("__WCHAR_TYPE__", MODIFIED_WCHAR_TYPE
, 0);
4309 builtin_define_with_value ("__WINT_TYPE__", WINT_TYPE
, 0);
4310 builtin_define_with_value ("__INTMAX_TYPE__", INTMAX_TYPE
, 0);
4311 builtin_define_with_value ("__UINTMAX_TYPE__", UINTMAX_TYPE
, 0);
4315 c_init_attributes (void)
4317 /* Fill in the built_in_attributes array. */
4318 #define DEF_ATTR_NULL_TREE(ENUM) \
4319 built_in_attributes[(int) ENUM] = NULL_TREE;
4320 #define DEF_ATTR_INT(ENUM, VALUE) \
4321 built_in_attributes[(int) ENUM] = build_int_cst (NULL_TREE, VALUE);
4322 #define DEF_ATTR_IDENT(ENUM, STRING) \
4323 built_in_attributes[(int) ENUM] = get_identifier (STRING);
4324 #define DEF_ATTR_TREE_LIST(ENUM, PURPOSE, VALUE, CHAIN) \
4325 built_in_attributes[(int) ENUM] \
4326 = tree_cons (built_in_attributes[(int) PURPOSE], \
4327 built_in_attributes[(int) VALUE], \
4328 built_in_attributes[(int) CHAIN]);
4329 #include "builtin-attrs.def"
4330 #undef DEF_ATTR_NULL_TREE
4332 #undef DEF_ATTR_IDENT
4333 #undef DEF_ATTR_TREE_LIST
4336 /* Attribute handlers common to C front ends. */
4338 /* Handle a "packed" attribute; arguments as in
4339 struct attribute_spec.handler. */
4342 handle_packed_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4343 int flags
, bool *no_add_attrs
)
4347 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4348 *node
= build_variant_type_copy (*node
);
4349 TYPE_PACKED (*node
) = 1;
4351 else if (TREE_CODE (*node
) == FIELD_DECL
)
4353 if (TYPE_ALIGN (TREE_TYPE (*node
)) <= BITS_PER_UNIT
)
4354 warning (OPT_Wattributes
,
4355 "%qE attribute ignored for field of type %qT",
4356 name
, TREE_TYPE (*node
));
4358 DECL_PACKED (*node
) = 1;
4360 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
4361 used for DECL_REGISTER. It wouldn't mean anything anyway.
4362 We can't set DECL_PACKED on the type of a TYPE_DECL, because
4363 that changes what the typedef is typing. */
4366 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4367 *no_add_attrs
= true;
4373 /* Handle a "nocommon" attribute; arguments as in
4374 struct attribute_spec.handler. */
4377 handle_nocommon_attribute (tree
*node
, tree name
,
4378 tree
ARG_UNUSED (args
),
4379 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4381 if (TREE_CODE (*node
) == VAR_DECL
)
4382 DECL_COMMON (*node
) = 0;
4385 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4386 *no_add_attrs
= true;
4392 /* Handle a "common" attribute; arguments as in
4393 struct attribute_spec.handler. */
4396 handle_common_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4397 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4399 if (TREE_CODE (*node
) == VAR_DECL
)
4400 DECL_COMMON (*node
) = 1;
4403 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4404 *no_add_attrs
= true;
4410 /* Handle a "noreturn" attribute; arguments as in
4411 struct attribute_spec.handler. */
4414 handle_noreturn_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4415 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4417 tree type
= TREE_TYPE (*node
);
4419 /* See FIXME comment in c_common_attribute_table. */
4420 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4421 TREE_THIS_VOLATILE (*node
) = 1;
4422 else if (TREE_CODE (type
) == POINTER_TYPE
4423 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4425 = build_pointer_type
4426 (build_type_variant (TREE_TYPE (type
),
4427 TYPE_READONLY (TREE_TYPE (type
)), 1));
4430 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4431 *no_add_attrs
= true;
4437 /* Handle a "noinline" attribute; arguments as in
4438 struct attribute_spec.handler. */
4441 handle_noinline_attribute (tree
*node
, tree name
,
4442 tree
ARG_UNUSED (args
),
4443 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4445 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4446 DECL_UNINLINABLE (*node
) = 1;
4449 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4450 *no_add_attrs
= true;
4456 /* Handle a "always_inline" attribute; arguments as in
4457 struct attribute_spec.handler. */
4460 handle_always_inline_attribute (tree
*node
, tree name
,
4461 tree
ARG_UNUSED (args
),
4462 int ARG_UNUSED (flags
),
4465 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4467 /* Do nothing else, just set the attribute. We'll get at
4468 it later with lookup_attribute. */
4472 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4473 *no_add_attrs
= true;
4479 /* Handle a "gnu_inline" attribute; arguments as in
4480 struct attribute_spec.handler. */
4483 handle_gnu_inline_attribute (tree
*node
, tree name
,
4484 tree
ARG_UNUSED (args
),
4485 int ARG_UNUSED (flags
),
4488 if (TREE_CODE (*node
) == FUNCTION_DECL
&& DECL_DECLARED_INLINE_P (*node
))
4490 /* Do nothing else, just set the attribute. We'll get at
4491 it later with lookup_attribute. */
4495 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4496 *no_add_attrs
= true;
4502 /* Handle a "flatten" attribute; arguments as in
4503 struct attribute_spec.handler. */
4506 handle_flatten_attribute (tree
*node
, tree name
,
4507 tree args ATTRIBUTE_UNUSED
,
4508 int flags ATTRIBUTE_UNUSED
, bool *no_add_attrs
)
4510 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4511 /* Do nothing else, just set the attribute. We'll get at
4512 it later with lookup_attribute. */
4516 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4517 *no_add_attrs
= true;
4524 /* Handle a "used" attribute; arguments as in
4525 struct attribute_spec.handler. */
4528 handle_used_attribute (tree
*pnode
, tree name
, tree
ARG_UNUSED (args
),
4529 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4533 if (TREE_CODE (node
) == FUNCTION_DECL
4534 || (TREE_CODE (node
) == VAR_DECL
&& TREE_STATIC (node
)))
4536 TREE_USED (node
) = 1;
4537 DECL_PRESERVE_P (node
) = 1;
4541 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4542 *no_add_attrs
= true;
4548 /* Handle a "unused" attribute; arguments as in
4549 struct attribute_spec.handler. */
4552 handle_unused_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4553 int flags
, bool *no_add_attrs
)
4559 if (TREE_CODE (decl
) == PARM_DECL
4560 || TREE_CODE (decl
) == VAR_DECL
4561 || TREE_CODE (decl
) == FUNCTION_DECL
4562 || TREE_CODE (decl
) == LABEL_DECL
4563 || TREE_CODE (decl
) == TYPE_DECL
)
4564 TREE_USED (decl
) = 1;
4567 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4568 *no_add_attrs
= true;
4573 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4574 *node
= build_variant_type_copy (*node
);
4575 TREE_USED (*node
) = 1;
4581 /* Handle a "externally_visible" attribute; arguments as in
4582 struct attribute_spec.handler. */
4585 handle_externally_visible_attribute (tree
*pnode
, tree name
,
4586 tree
ARG_UNUSED (args
),
4587 int ARG_UNUSED (flags
),
4592 if (TREE_CODE (node
) == FUNCTION_DECL
|| TREE_CODE (node
) == VAR_DECL
)
4594 if ((!TREE_STATIC (node
) && TREE_CODE (node
) != FUNCTION_DECL
4595 && !DECL_EXTERNAL (node
)) || !TREE_PUBLIC (node
))
4597 warning (OPT_Wattributes
,
4598 "%qE attribute have effect only on public objects", name
);
4599 *no_add_attrs
= true;
4604 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4605 *no_add_attrs
= true;
4611 /* Handle a "const" attribute; arguments as in
4612 struct attribute_spec.handler. */
4615 handle_const_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
4616 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4618 tree type
= TREE_TYPE (*node
);
4620 /* See FIXME comment on noreturn in c_common_attribute_table. */
4621 if (TREE_CODE (*node
) == FUNCTION_DECL
)
4622 TREE_READONLY (*node
) = 1;
4623 else if (TREE_CODE (type
) == POINTER_TYPE
4624 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
4626 = build_pointer_type
4627 (build_type_variant (TREE_TYPE (type
), 1,
4628 TREE_THIS_VOLATILE (TREE_TYPE (type
))));
4631 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4632 *no_add_attrs
= true;
4638 /* Handle a "transparent_union" attribute; arguments as in
4639 struct attribute_spec.handler. */
4642 handle_transparent_union_attribute (tree
*node
, tree name
,
4643 tree
ARG_UNUSED (args
), int flags
,
4648 *no_add_attrs
= true;
4652 if (TREE_CODE (*node
) != TYPE_DECL
)
4654 node
= &TREE_TYPE (*node
);
4657 else if (TYPE_P (*node
))
4662 if (TREE_CODE (type
) == UNION_TYPE
)
4664 /* When IN_PLACE is set, leave the check for FIELDS and MODE to
4665 the code in finish_struct. */
4666 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
4668 if (TYPE_FIELDS (type
) == NULL_TREE
4669 || TYPE_MODE (type
) != DECL_MODE (TYPE_FIELDS (type
)))
4672 /* A type variant isn't good enough, since we don't a cast
4673 to such a type removed as a no-op. */
4674 *node
= type
= build_duplicate_type (type
);
4677 TYPE_TRANSPARENT_UNION (type
) = 1;
4682 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4686 /* Subroutine of handle_{con,de}structor_attribute. Evaluate ARGS to
4687 get the requested priority for a constructor or destructor,
4688 possibly issuing diagnostics for invalid or reserved
4691 static priority_type
4692 get_priority (tree args
, bool is_destructor
)
4698 return DEFAULT_INIT_PRIORITY
;
4700 arg
= TREE_VALUE (args
);
4701 if (!host_integerp (arg
, /*pos=*/0)
4702 || !INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4705 pri
= tree_low_cst (TREE_VALUE (args
), /*pos=*/0);
4706 if (pri
< 0 || pri
> MAX_INIT_PRIORITY
)
4709 if (pri
<= MAX_RESERVED_INIT_PRIORITY
)
4713 "destructor priorities from 0 to %d are reserved "
4714 "for the implementation",
4715 MAX_RESERVED_INIT_PRIORITY
);
4718 "constructor priorities from 0 to %d are reserved "
4719 "for the implementation",
4720 MAX_RESERVED_INIT_PRIORITY
);
4726 error ("destructor priorities must be integers from 0 to %d inclusive",
4729 error ("constructor priorities must be integers from 0 to %d inclusive",
4731 return DEFAULT_INIT_PRIORITY
;
4734 /* Handle a "constructor" attribute; arguments as in
4735 struct attribute_spec.handler. */
4738 handle_constructor_attribute (tree
*node
, tree name
, tree args
,
4739 int ARG_UNUSED (flags
),
4743 tree type
= TREE_TYPE (decl
);
4745 if (TREE_CODE (decl
) == FUNCTION_DECL
4746 && TREE_CODE (type
) == FUNCTION_TYPE
4747 && decl_function_context (decl
) == 0)
4749 priority_type priority
;
4750 DECL_STATIC_CONSTRUCTOR (decl
) = 1;
4751 priority
= get_priority (args
, /*is_destructor=*/false);
4752 SET_DECL_INIT_PRIORITY (decl
, priority
);
4753 TREE_USED (decl
) = 1;
4757 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4758 *no_add_attrs
= true;
4764 /* Handle a "destructor" attribute; arguments as in
4765 struct attribute_spec.handler. */
4768 handle_destructor_attribute (tree
*node
, tree name
, tree args
,
4769 int ARG_UNUSED (flags
),
4773 tree type
= TREE_TYPE (decl
);
4775 if (TREE_CODE (decl
) == FUNCTION_DECL
4776 && TREE_CODE (type
) == FUNCTION_TYPE
4777 && decl_function_context (decl
) == 0)
4779 priority_type priority
;
4780 DECL_STATIC_DESTRUCTOR (decl
) = 1;
4781 priority
= get_priority (args
, /*is_destructor=*/true);
4782 SET_DECL_FINI_PRIORITY (decl
, priority
);
4783 TREE_USED (decl
) = 1;
4787 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4788 *no_add_attrs
= true;
4794 /* Handle a "mode" attribute; arguments as in
4795 struct attribute_spec.handler. */
4798 handle_mode_attribute (tree
*node
, tree name
, tree args
,
4799 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4803 *no_add_attrs
= true;
4805 if (TREE_CODE (TREE_VALUE (args
)) != IDENTIFIER_NODE
)
4806 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
4810 const char *p
= IDENTIFIER_POINTER (TREE_VALUE (args
));
4811 int len
= strlen (p
);
4812 enum machine_mode mode
= VOIDmode
;
4816 if (len
> 4 && p
[0] == '_' && p
[1] == '_'
4817 && p
[len
- 1] == '_' && p
[len
- 2] == '_')
4819 char *newp
= (char *) alloca (len
- 1);
4821 strcpy (newp
, &p
[2]);
4822 newp
[len
- 4] = '\0';
4826 /* Change this type to have a type with the specified mode.
4827 First check for the special modes. */
4828 if (!strcmp (p
, "byte"))
4830 else if (!strcmp (p
, "word"))
4832 else if (!strcmp (p
, "pointer"))
4835 for (j
= 0; j
< NUM_MACHINE_MODES
; j
++)
4836 if (!strcmp (p
, GET_MODE_NAME (j
)))
4838 mode
= (enum machine_mode
) j
;
4842 if (mode
== VOIDmode
)
4844 error ("unknown machine mode %qs", p
);
4849 switch (GET_MODE_CLASS (mode
))
4852 case MODE_PARTIAL_INT
:
4854 case MODE_DECIMAL_FLOAT
:
4855 valid_mode
= targetm
.scalar_mode_supported_p (mode
);
4858 case MODE_COMPLEX_INT
:
4859 case MODE_COMPLEX_FLOAT
:
4860 valid_mode
= targetm
.scalar_mode_supported_p (GET_MODE_INNER (mode
));
4863 case MODE_VECTOR_INT
:
4864 case MODE_VECTOR_FLOAT
:
4865 warning (OPT_Wattributes
, "specifying vector types with "
4866 "__attribute__ ((mode)) is deprecated");
4867 warning (OPT_Wattributes
,
4868 "use __attribute__ ((vector_size)) instead");
4869 valid_mode
= vector_mode_valid_p (mode
);
4877 error ("unable to emulate %qs", p
);
4881 if (POINTER_TYPE_P (type
))
4883 tree (*fn
)(tree
, enum machine_mode
, bool);
4885 if (!targetm
.valid_pointer_mode (mode
))
4887 error ("invalid pointer mode %qs", p
);
4891 if (TREE_CODE (type
) == POINTER_TYPE
)
4892 fn
= build_pointer_type_for_mode
;
4894 fn
= build_reference_type_for_mode
;
4895 typefm
= fn (TREE_TYPE (type
), mode
, false);
4898 typefm
= lang_hooks
.types
.type_for_mode (mode
, TYPE_UNSIGNED (type
));
4900 if (typefm
== NULL_TREE
)
4902 error ("no data type for mode %qs", p
);
4905 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
4907 /* For enumeral types, copy the precision from the integer
4908 type returned above. If not an INTEGER_TYPE, we can't use
4909 this mode for this type. */
4910 if (TREE_CODE (typefm
) != INTEGER_TYPE
)
4912 error ("cannot use mode %qs for enumeral types", p
);
4916 if (flags
& ATTR_FLAG_TYPE_IN_PLACE
)
4918 TYPE_PRECISION (type
) = TYPE_PRECISION (typefm
);
4923 /* We cannot build a type variant, as there's code that assumes
4924 that TYPE_MAIN_VARIANT has the same mode. This includes the
4925 debug generators. Instead, create a subrange type. This
4926 results in all of the enumeral values being emitted only once
4927 in the original, and the subtype gets them by reference. */
4928 if (TYPE_UNSIGNED (type
))
4929 typefm
= make_unsigned_type (TYPE_PRECISION (typefm
));
4931 typefm
= make_signed_type (TYPE_PRECISION (typefm
));
4932 TREE_TYPE (typefm
) = type
;
4935 else if (VECTOR_MODE_P (mode
)
4936 ? TREE_CODE (type
) != TREE_CODE (TREE_TYPE (typefm
))
4937 : TREE_CODE (type
) != TREE_CODE (typefm
))
4939 error ("mode %qs applied to inappropriate type", p
);
4949 /* Handle a "section" attribute; arguments as in
4950 struct attribute_spec.handler. */
4953 handle_section_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
4954 int ARG_UNUSED (flags
), bool *no_add_attrs
)
4958 if (targetm
.have_named_sections
)
4960 user_defined_section_attribute
= true;
4962 if ((TREE_CODE (decl
) == FUNCTION_DECL
4963 || TREE_CODE (decl
) == VAR_DECL
)
4964 && TREE_CODE (TREE_VALUE (args
)) == STRING_CST
)
4966 if (TREE_CODE (decl
) == VAR_DECL
4967 && current_function_decl
!= NULL_TREE
4968 && !TREE_STATIC (decl
))
4970 error ("%Jsection attribute cannot be specified for "
4971 "local variables", decl
);
4972 *no_add_attrs
= true;
4975 /* The decl may have already been given a section attribute
4976 from a previous declaration. Ensure they match. */
4977 else if (DECL_SECTION_NAME (decl
) != NULL_TREE
4978 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl
)),
4979 TREE_STRING_POINTER (TREE_VALUE (args
))) != 0)
4981 error ("section of %q+D conflicts with previous declaration",
4983 *no_add_attrs
= true;
4986 DECL_SECTION_NAME (decl
) = TREE_VALUE (args
);
4990 error ("section attribute not allowed for %q+D", *node
);
4991 *no_add_attrs
= true;
4996 error ("%Jsection attributes are not supported for this target", *node
);
4997 *no_add_attrs
= true;
5003 /* Handle a "aligned" attribute; arguments as in
5004 struct attribute_spec.handler. */
5007 handle_aligned_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5008 int flags
, bool *no_add_attrs
)
5010 tree decl
= NULL_TREE
;
5013 tree align_expr
= (args
? TREE_VALUE (args
)
5014 : size_int (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
5020 type
= &TREE_TYPE (decl
);
5021 is_type
= TREE_CODE (*node
) == TYPE_DECL
;
5023 else if (TYPE_P (*node
))
5024 type
= node
, is_type
= 1;
5026 if (TREE_CODE (align_expr
) != INTEGER_CST
)
5028 error ("requested alignment is not a constant");
5029 *no_add_attrs
= true;
5031 else if ((i
= tree_log2 (align_expr
)) == -1)
5033 error ("requested alignment is not a power of 2");
5034 *no_add_attrs
= true;
5036 else if (i
> HOST_BITS_PER_INT
- 2)
5038 error ("requested alignment is too large");
5039 *no_add_attrs
= true;
5043 /* If we have a TYPE_DECL, then copy the type, so that we
5044 don't accidentally modify a builtin type. See pushdecl. */
5045 if (decl
&& TREE_TYPE (decl
) != error_mark_node
5046 && DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
)
5048 tree tt
= TREE_TYPE (decl
);
5049 *type
= build_variant_type_copy (*type
);
5050 DECL_ORIGINAL_TYPE (decl
) = tt
;
5051 TYPE_NAME (*type
) = decl
;
5052 TREE_USED (*type
) = TREE_USED (decl
);
5053 TREE_TYPE (decl
) = *type
;
5055 else if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5056 *type
= build_variant_type_copy (*type
);
5058 TYPE_ALIGN (*type
) = (1 << i
) * BITS_PER_UNIT
;
5059 TYPE_USER_ALIGN (*type
) = 1;
5061 else if (TREE_CODE (decl
) != VAR_DECL
5062 && TREE_CODE (decl
) != FIELD_DECL
)
5064 error ("alignment may not be specified for %q+D", decl
);
5065 *no_add_attrs
= true;
5069 DECL_ALIGN (decl
) = (1 << i
) * BITS_PER_UNIT
;
5070 DECL_USER_ALIGN (decl
) = 1;
5076 /* Handle a "weak" attribute; arguments as in
5077 struct attribute_spec.handler. */
5080 handle_weak_attribute (tree
*node
, tree name
,
5081 tree
ARG_UNUSED (args
),
5082 int ARG_UNUSED (flags
),
5083 bool * ARG_UNUSED (no_add_attrs
))
5085 if (TREE_CODE (*node
) == FUNCTION_DECL
5086 || TREE_CODE (*node
) == VAR_DECL
)
5087 declare_weak (*node
);
5089 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5095 /* Handle an "alias" attribute; arguments as in
5096 struct attribute_spec.handler. */
5099 handle_alias_attribute (tree
*node
, tree name
, tree args
,
5100 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5104 if ((TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INITIAL (decl
))
5105 || (TREE_CODE (decl
) != FUNCTION_DECL
5106 && TREE_PUBLIC (decl
) && !DECL_EXTERNAL (decl
))
5107 /* A static variable declaration is always a tentative definition,
5108 but the alias is a non-tentative definition which overrides. */
5109 || (TREE_CODE (decl
) != FUNCTION_DECL
5110 && ! TREE_PUBLIC (decl
) && DECL_INITIAL (decl
)))
5112 error ("%q+D defined both normally and as an alias", decl
);
5113 *no_add_attrs
= true;
5116 /* Note that the very first time we process a nested declaration,
5117 decl_function_context will not be set. Indeed, *would* never
5118 be set except for the DECL_INITIAL/DECL_EXTERNAL frobbery that
5119 we do below. After such frobbery, pushdecl would set the context.
5120 In any case, this is never what we want. */
5121 else if (decl_function_context (decl
) == 0 && current_function_decl
== NULL
)
5125 id
= TREE_VALUE (args
);
5126 if (TREE_CODE (id
) != STRING_CST
)
5128 error ("alias argument not a string");
5129 *no_add_attrs
= true;
5132 id
= get_identifier (TREE_STRING_POINTER (id
));
5133 /* This counts as a use of the object pointed to. */
5136 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5137 DECL_INITIAL (decl
) = error_mark_node
;
5140 if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl
)))
5141 DECL_EXTERNAL (decl
) = 1;
5143 DECL_EXTERNAL (decl
) = 0;
5144 TREE_STATIC (decl
) = 1;
5149 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5150 *no_add_attrs
= true;
5156 /* Handle a "weakref" attribute; arguments as in struct
5157 attribute_spec.handler. */
5160 handle_weakref_attribute (tree
*node
, tree
ARG_UNUSED (name
), tree args
,
5161 int flags
, bool *no_add_attrs
)
5163 tree attr
= NULL_TREE
;
5165 /* We must ignore the attribute when it is associated with
5166 local-scoped decls, since attribute alias is ignored and many
5167 such symbols do not even have a DECL_WEAK field. */
5168 if (decl_function_context (*node
) || current_function_decl
)
5170 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5171 *no_add_attrs
= true;
5175 /* The idea here is that `weakref("name")' mutates into `weakref,
5176 alias("name")', and weakref without arguments, in turn,
5177 implicitly adds weak. */
5181 attr
= tree_cons (get_identifier ("alias"), args
, attr
);
5182 attr
= tree_cons (get_identifier ("weakref"), NULL_TREE
, attr
);
5184 *no_add_attrs
= true;
5186 decl_attributes (node
, attr
, flags
);
5190 if (lookup_attribute ("alias", DECL_ATTRIBUTES (*node
)))
5191 error ("%Jweakref attribute must appear before alias attribute",
5194 /* Can't call declare_weak because it wants this to be TREE_PUBLIC,
5195 and that isn't supported; and because it wants to add it to
5196 the list of weak decls, which isn't helpful. */
5197 DECL_WEAK (*node
) = 1;
5203 /* Handle an "visibility" attribute; arguments as in
5204 struct attribute_spec.handler. */
5207 handle_visibility_attribute (tree
*node
, tree name
, tree args
,
5208 int ARG_UNUSED (flags
),
5209 bool *ARG_UNUSED (no_add_attrs
))
5212 tree id
= TREE_VALUE (args
);
5213 enum symbol_visibility vis
;
5217 if (TREE_CODE (*node
) == ENUMERAL_TYPE
)
5219 else if (TREE_CODE (*node
) != RECORD_TYPE
&& TREE_CODE (*node
) != UNION_TYPE
)
5221 warning (OPT_Wattributes
, "%qE attribute ignored on non-class types",
5225 else if (TYPE_FIELDS (*node
))
5227 error ("%qE attribute ignored because %qT is already defined",
5232 else if (decl_function_context (decl
) != 0 || !TREE_PUBLIC (decl
))
5234 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5238 if (TREE_CODE (id
) != STRING_CST
)
5240 error ("visibility argument not a string");
5244 /* If this is a type, set the visibility on the type decl. */
5247 decl
= TYPE_NAME (decl
);
5250 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
5252 warning (OPT_Wattributes
, "%qE attribute ignored on types",
5258 if (strcmp (TREE_STRING_POINTER (id
), "default") == 0)
5259 vis
= VISIBILITY_DEFAULT
;
5260 else if (strcmp (TREE_STRING_POINTER (id
), "internal") == 0)
5261 vis
= VISIBILITY_INTERNAL
;
5262 else if (strcmp (TREE_STRING_POINTER (id
), "hidden") == 0)
5263 vis
= VISIBILITY_HIDDEN
;
5264 else if (strcmp (TREE_STRING_POINTER (id
), "protected") == 0)
5265 vis
= VISIBILITY_PROTECTED
;
5268 error ("visibility argument must be one of \"default\", \"hidden\", \"protected\" or \"internal\"");
5269 vis
= VISIBILITY_DEFAULT
;
5272 if (DECL_VISIBILITY_SPECIFIED (decl
)
5273 && vis
!= DECL_VISIBILITY (decl
)
5274 && lookup_attribute ("visibility", (TYPE_P (*node
)
5275 ? TYPE_ATTRIBUTES (*node
)
5276 : DECL_ATTRIBUTES (decl
))))
5277 error ("%qD redeclared with different visibility", decl
);
5279 DECL_VISIBILITY (decl
) = vis
;
5280 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5282 /* Go ahead and attach the attribute to the node as well. This is needed
5283 so we can determine whether we have VISIBILITY_DEFAULT because the
5284 visibility was not specified, or because it was explicitly overridden
5285 from the containing scope. */
5290 /* Determine the ELF symbol visibility for DECL, which is either a
5291 variable or a function. It is an error to use this function if a
5292 definition of DECL is not available in this translation unit.
5293 Returns true if the final visibility has been determined by this
5294 function; false if the caller is free to make additional
5298 c_determine_visibility (tree decl
)
5300 gcc_assert (TREE_CODE (decl
) == VAR_DECL
5301 || TREE_CODE (decl
) == FUNCTION_DECL
);
5303 /* If the user explicitly specified the visibility with an
5304 attribute, honor that. DECL_VISIBILITY will have been set during
5305 the processing of the attribute. We check for an explicit
5306 attribute, rather than just checking DECL_VISIBILITY_SPECIFIED,
5307 to distinguish the use of an attribute from the use of a "#pragma
5308 GCC visibility push(...)"; in the latter case we still want other
5309 considerations to be able to overrule the #pragma. */
5310 if (lookup_attribute ("visibility", DECL_ATTRIBUTES (decl
)))
5313 /* Anything that is exported must have default visibility. */
5314 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
5315 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl
)))
5317 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5318 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
5322 /* Set default visibility to whatever the user supplied with
5323 visibility_specified depending on #pragma GCC visibility. */
5324 if (!DECL_VISIBILITY_SPECIFIED (decl
))
5326 DECL_VISIBILITY (decl
) = default_visibility
;
5327 DECL_VISIBILITY_SPECIFIED (decl
) = visibility_options
.inpragma
;
5332 /* Handle an "tls_model" attribute; arguments as in
5333 struct attribute_spec.handler. */
5336 handle_tls_model_attribute (tree
*node
, tree name
, tree args
,
5337 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5341 enum tls_model kind
;
5343 *no_add_attrs
= true;
5345 if (!DECL_THREAD_LOCAL_P (decl
))
5347 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5351 kind
= DECL_TLS_MODEL (decl
);
5352 id
= TREE_VALUE (args
);
5353 if (TREE_CODE (id
) != STRING_CST
)
5355 error ("tls_model argument not a string");
5359 if (!strcmp (TREE_STRING_POINTER (id
), "local-exec"))
5360 kind
= TLS_MODEL_LOCAL_EXEC
;
5361 else if (!strcmp (TREE_STRING_POINTER (id
), "initial-exec"))
5362 kind
= TLS_MODEL_INITIAL_EXEC
;
5363 else if (!strcmp (TREE_STRING_POINTER (id
), "local-dynamic"))
5364 kind
= optimize
? TLS_MODEL_LOCAL_DYNAMIC
: TLS_MODEL_GLOBAL_DYNAMIC
;
5365 else if (!strcmp (TREE_STRING_POINTER (id
), "global-dynamic"))
5366 kind
= TLS_MODEL_GLOBAL_DYNAMIC
;
5368 error ("tls_model argument must be one of \"local-exec\", \"initial-exec\", \"local-dynamic\" or \"global-dynamic\"");
5370 DECL_TLS_MODEL (decl
) = kind
;
5374 /* Handle a "no_instrument_function" attribute; arguments as in
5375 struct attribute_spec.handler. */
5378 handle_no_instrument_function_attribute (tree
*node
, tree name
,
5379 tree
ARG_UNUSED (args
),
5380 int ARG_UNUSED (flags
),
5385 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5387 error ("%J%qE attribute applies only to functions", decl
, name
);
5388 *no_add_attrs
= true;
5390 else if (DECL_INITIAL (decl
))
5392 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5393 *no_add_attrs
= true;
5396 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl
) = 1;
5401 /* Handle a "malloc" attribute; arguments as in
5402 struct attribute_spec.handler. */
5405 handle_malloc_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5406 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5408 if (TREE_CODE (*node
) == FUNCTION_DECL
5409 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (*node
))))
5410 DECL_IS_MALLOC (*node
) = 1;
5413 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5414 *no_add_attrs
= true;
5420 /* Handle a "returns_twice" attribute; arguments as in
5421 struct attribute_spec.handler. */
5424 handle_returns_twice_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5425 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5427 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5428 DECL_IS_RETURNS_TWICE (*node
) = 1;
5431 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5432 *no_add_attrs
= true;
5438 /* Handle a "no_limit_stack" attribute; arguments as in
5439 struct attribute_spec.handler. */
5442 handle_no_limit_stack_attribute (tree
*node
, tree name
,
5443 tree
ARG_UNUSED (args
),
5444 int ARG_UNUSED (flags
),
5449 if (TREE_CODE (decl
) != FUNCTION_DECL
)
5451 error ("%J%qE attribute applies only to functions", decl
, name
);
5452 *no_add_attrs
= true;
5454 else if (DECL_INITIAL (decl
))
5456 error ("%Jcan%'t set %qE attribute after definition", decl
, name
);
5457 *no_add_attrs
= true;
5460 DECL_NO_LIMIT_STACK (decl
) = 1;
5465 /* Handle a "pure" attribute; arguments as in
5466 struct attribute_spec.handler. */
5469 handle_pure_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5470 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5472 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5473 DECL_IS_PURE (*node
) = 1;
5474 /* ??? TODO: Support types. */
5477 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5478 *no_add_attrs
= true;
5484 /* Handle a "no vops" attribute; arguments as in
5485 struct attribute_spec.handler. */
5488 handle_novops_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5489 tree
ARG_UNUSED (args
), int ARG_UNUSED (flags
),
5490 bool *ARG_UNUSED (no_add_attrs
))
5492 gcc_assert (TREE_CODE (*node
) == FUNCTION_DECL
);
5493 DECL_IS_NOVOPS (*node
) = 1;
5497 /* Handle a "deprecated" attribute; arguments as in
5498 struct attribute_spec.handler. */
5501 handle_deprecated_attribute (tree
*node
, tree name
,
5502 tree
ARG_UNUSED (args
), int flags
,
5505 tree type
= NULL_TREE
;
5507 tree what
= NULL_TREE
;
5512 type
= TREE_TYPE (decl
);
5514 if (TREE_CODE (decl
) == TYPE_DECL
5515 || TREE_CODE (decl
) == PARM_DECL
5516 || TREE_CODE (decl
) == VAR_DECL
5517 || TREE_CODE (decl
) == FUNCTION_DECL
5518 || TREE_CODE (decl
) == FIELD_DECL
)
5519 TREE_DEPRECATED (decl
) = 1;
5523 else if (TYPE_P (*node
))
5525 if (!(flags
& (int) ATTR_FLAG_TYPE_IN_PLACE
))
5526 *node
= build_variant_type_copy (*node
);
5527 TREE_DEPRECATED (*node
) = 1;
5535 *no_add_attrs
= true;
5536 if (type
&& TYPE_NAME (type
))
5538 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
5539 what
= TYPE_NAME (*node
);
5540 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
5541 && DECL_NAME (TYPE_NAME (type
)))
5542 what
= DECL_NAME (TYPE_NAME (type
));
5545 warning (OPT_Wattributes
, "%qE attribute ignored for %qE", name
, what
);
5547 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5553 /* Handle a "vector_size" attribute; arguments as in
5554 struct attribute_spec.handler. */
5557 handle_vector_size_attribute (tree
*node
, tree name
, tree args
,
5558 int ARG_UNUSED (flags
),
5561 unsigned HOST_WIDE_INT vecsize
, nunits
;
5562 enum machine_mode orig_mode
;
5563 tree type
= *node
, new_type
, size
;
5565 *no_add_attrs
= true;
5567 size
= TREE_VALUE (args
);
5569 if (!host_integerp (size
, 1))
5571 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5575 /* Get the vector size (in bytes). */
5576 vecsize
= tree_low_cst (size
, 1);
5578 /* We need to provide for vector pointers, vector arrays, and
5579 functions returning vectors. For example:
5581 __attribute__((vector_size(16))) short *foo;
5583 In this case, the mode is SI, but the type being modified is
5584 HI, so we need to look further. */
5586 while (POINTER_TYPE_P (type
)
5587 || TREE_CODE (type
) == FUNCTION_TYPE
5588 || TREE_CODE (type
) == METHOD_TYPE
5589 || TREE_CODE (type
) == ARRAY_TYPE
)
5590 type
= TREE_TYPE (type
);
5592 /* Get the mode of the type being modified. */
5593 orig_mode
= TYPE_MODE (type
);
5595 if (TREE_CODE (type
) == RECORD_TYPE
5596 || TREE_CODE (type
) == UNION_TYPE
5597 || TREE_CODE (type
) == VECTOR_TYPE
5598 || (!SCALAR_FLOAT_MODE_P (orig_mode
)
5599 && GET_MODE_CLASS (orig_mode
) != MODE_INT
)
5600 || !host_integerp (TYPE_SIZE_UNIT (type
), 1))
5602 error ("invalid vector type for attribute %qE", name
);
5606 if (vecsize
% tree_low_cst (TYPE_SIZE_UNIT (type
), 1))
5608 error ("vector size not an integral multiple of component size");
5614 error ("zero vector size");
5618 /* Calculate how many units fit in the vector. */
5619 nunits
= vecsize
/ tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
5620 if (nunits
& (nunits
- 1))
5622 error ("number of components of the vector not a power of two");
5626 new_type
= build_vector_type (type
, nunits
);
5628 /* Build back pointers if needed. */
5629 *node
= reconstruct_complex_type (*node
, new_type
);
5634 /* Handle the "nonnull" attribute. */
5636 handle_nonnull_attribute (tree
*node
, tree
ARG_UNUSED (name
),
5637 tree args
, int ARG_UNUSED (flags
),
5641 unsigned HOST_WIDE_INT attr_arg_num
;
5643 /* If no arguments are specified, all pointer arguments should be
5644 non-null. Verify a full prototype is given so that the arguments
5645 will have the correct types when we actually check them later. */
5648 if (!TYPE_ARG_TYPES (type
))
5650 error ("nonnull attribute without arguments on a non-prototype");
5651 *no_add_attrs
= true;
5656 /* Argument list specified. Verify that each argument number references
5657 a pointer argument. */
5658 for (attr_arg_num
= 1; args
; args
= TREE_CHAIN (args
))
5661 unsigned HOST_WIDE_INT arg_num
= 0, ck_num
;
5663 if (!get_nonnull_operand (TREE_VALUE (args
), &arg_num
))
5665 error ("nonnull argument has invalid operand number (argument %lu)",
5666 (unsigned long) attr_arg_num
);
5667 *no_add_attrs
= true;
5671 argument
= TYPE_ARG_TYPES (type
);
5674 for (ck_num
= 1; ; ck_num
++)
5676 if (!argument
|| ck_num
== arg_num
)
5678 argument
= TREE_CHAIN (argument
);
5682 || TREE_CODE (TREE_VALUE (argument
)) == VOID_TYPE
)
5684 error ("nonnull argument with out-of-range operand number (argument %lu, operand %lu)",
5685 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5686 *no_add_attrs
= true;
5690 if (TREE_CODE (TREE_VALUE (argument
)) != POINTER_TYPE
)
5692 error ("nonnull argument references non-pointer operand (argument %lu, operand %lu)",
5693 (unsigned long) attr_arg_num
, (unsigned long) arg_num
);
5694 *no_add_attrs
= true;
5703 /* Check the argument list of a function call for null in argument slots
5704 that are marked as requiring a non-null pointer argument. */
5707 check_function_nonnull (tree attrs
, tree params
)
5709 tree a
, args
, param
;
5712 for (a
= attrs
; a
; a
= TREE_CHAIN (a
))
5714 if (is_attribute_p ("nonnull", TREE_PURPOSE (a
)))
5716 args
= TREE_VALUE (a
);
5718 /* Walk the argument list. If we encounter an argument number we
5719 should check for non-null, do it. If the attribute has no args,
5720 then every pointer argument is checked (in which case the check
5721 for pointer type is done in check_nonnull_arg). */
5722 for (param
= params
, param_num
= 1; ;
5723 param_num
++, param
= TREE_CHAIN (param
))
5727 if (!args
|| nonnull_check_p (args
, param_num
))
5728 check_function_arguments_recurse (check_nonnull_arg
, NULL
,
5736 /* Check that the Nth argument of a function call (counting backwards
5737 from the end) is a (pointer)0. */
5740 check_function_sentinel (tree attrs
, tree params
, tree typelist
)
5742 tree attr
= lookup_attribute ("sentinel", attrs
);
5746 /* Skip over the named arguments. */
5747 while (typelist
&& params
)
5749 typelist
= TREE_CHAIN (typelist
);
5750 params
= TREE_CHAIN (params
);
5753 if (typelist
|| !params
)
5754 warning (OPT_Wformat
,
5755 "not enough variable arguments to fit a sentinel");
5761 if (TREE_VALUE (attr
))
5763 tree p
= TREE_VALUE (TREE_VALUE (attr
));
5764 pos
= TREE_INT_CST_LOW (p
);
5767 sentinel
= end
= params
;
5769 /* Advance `end' ahead of `sentinel' by `pos' positions. */
5770 while (pos
> 0 && TREE_CHAIN (end
))
5773 end
= TREE_CHAIN (end
);
5777 warning (OPT_Wformat
,
5778 "not enough variable arguments to fit a sentinel");
5782 /* Now advance both until we find the last parameter. */
5783 while (TREE_CHAIN (end
))
5785 end
= TREE_CHAIN (end
);
5786 sentinel
= TREE_CHAIN (sentinel
);
5789 /* Validate the sentinel. */
5790 if ((!POINTER_TYPE_P (TREE_TYPE (TREE_VALUE (sentinel
)))
5791 || !integer_zerop (TREE_VALUE (sentinel
)))
5792 /* Although __null (in C++) is only an integer we allow it
5793 nevertheless, as we are guaranteed that it's exactly
5794 as wide as a pointer, and we don't want to force
5795 users to cast the NULL they have written there.
5796 We warn with -Wstrict-null-sentinel, though. */
5797 && (warn_strict_null_sentinel
5798 || null_node
!= TREE_VALUE (sentinel
)))
5799 warning (OPT_Wformat
, "missing sentinel in function call");
5804 /* Helper for check_function_nonnull; given a list of operands which
5805 must be non-null in ARGS, determine if operand PARAM_NUM should be
5809 nonnull_check_p (tree args
, unsigned HOST_WIDE_INT param_num
)
5811 unsigned HOST_WIDE_INT arg_num
= 0;
5813 for (; args
; args
= TREE_CHAIN (args
))
5815 bool found
= get_nonnull_operand (TREE_VALUE (args
), &arg_num
);
5819 if (arg_num
== param_num
)
5825 /* Check that the function argument PARAM (which is operand number
5826 PARAM_NUM) is non-null. This is called by check_function_nonnull
5827 via check_function_arguments_recurse. */
5830 check_nonnull_arg (void * ARG_UNUSED (ctx
), tree param
,
5831 unsigned HOST_WIDE_INT param_num
)
5833 /* Just skip checking the argument if it's not a pointer. This can
5834 happen if the "nonnull" attribute was given without an operand
5835 list (which means to check every pointer argument). */
5837 if (TREE_CODE (TREE_TYPE (param
)) != POINTER_TYPE
)
5840 if (integer_zerop (param
))
5841 warning (OPT_Wnonnull
, "null argument where non-null required "
5842 "(argument %lu)", (unsigned long) param_num
);
5845 /* Helper for nonnull attribute handling; fetch the operand number
5846 from the attribute argument list. */
5849 get_nonnull_operand (tree arg_num_expr
, unsigned HOST_WIDE_INT
*valp
)
5851 /* Verify the arg number is a constant. */
5852 if (TREE_CODE (arg_num_expr
) != INTEGER_CST
5853 || TREE_INT_CST_HIGH (arg_num_expr
) != 0)
5856 *valp
= TREE_INT_CST_LOW (arg_num_expr
);
5860 /* Handle a "nothrow" attribute; arguments as in
5861 struct attribute_spec.handler. */
5864 handle_nothrow_attribute (tree
*node
, tree name
, tree
ARG_UNUSED (args
),
5865 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5867 if (TREE_CODE (*node
) == FUNCTION_DECL
)
5868 TREE_NOTHROW (*node
) = 1;
5869 /* ??? TODO: Support types. */
5872 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5873 *no_add_attrs
= true;
5879 /* Handle a "cleanup" attribute; arguments as in
5880 struct attribute_spec.handler. */
5883 handle_cleanup_attribute (tree
*node
, tree name
, tree args
,
5884 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5887 tree cleanup_id
, cleanup_decl
;
5889 /* ??? Could perhaps support cleanups on TREE_STATIC, much like we do
5890 for global destructors in C++. This requires infrastructure that
5891 we don't have generically at the moment. It's also not a feature
5892 we'd be missing too much, since we do have attribute constructor. */
5893 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
5895 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5896 *no_add_attrs
= true;
5900 /* Verify that the argument is a function in scope. */
5901 /* ??? We could support pointers to functions here as well, if
5902 that was considered desirable. */
5903 cleanup_id
= TREE_VALUE (args
);
5904 if (TREE_CODE (cleanup_id
) != IDENTIFIER_NODE
)
5906 error ("cleanup argument not an identifier");
5907 *no_add_attrs
= true;
5910 cleanup_decl
= lookup_name (cleanup_id
);
5911 if (!cleanup_decl
|| TREE_CODE (cleanup_decl
) != FUNCTION_DECL
)
5913 error ("cleanup argument not a function");
5914 *no_add_attrs
= true;
5918 /* That the function has proper type is checked with the
5919 eventual call to build_function_call. */
5924 /* Handle a "warn_unused_result" attribute. No special handling. */
5927 handle_warn_unused_result_attribute (tree
*node
, tree name
,
5928 tree
ARG_UNUSED (args
),
5929 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5931 /* Ignore the attribute for functions not returning any value. */
5932 if (VOID_TYPE_P (TREE_TYPE (*node
)))
5934 warning (OPT_Wattributes
, "%qE attribute ignored", name
);
5935 *no_add_attrs
= true;
5941 /* Handle a "sentinel" attribute. */
5944 handle_sentinel_attribute (tree
*node
, tree name
, tree args
,
5945 int ARG_UNUSED (flags
), bool *no_add_attrs
)
5947 tree params
= TYPE_ARG_TYPES (*node
);
5951 warning (OPT_Wattributes
,
5952 "%qE attribute requires prototypes with named arguments", name
);
5953 *no_add_attrs
= true;
5957 while (TREE_CHAIN (params
))
5958 params
= TREE_CHAIN (params
);
5960 if (VOID_TYPE_P (TREE_VALUE (params
)))
5962 warning (OPT_Wattributes
,
5963 "%qE attribute only applies to variadic functions", name
);
5964 *no_add_attrs
= true;
5970 tree position
= TREE_VALUE (args
);
5972 if (TREE_CODE (position
) != INTEGER_CST
)
5974 warning (0, "requested position is not an integer constant");
5975 *no_add_attrs
= true;
5979 if (tree_int_cst_lt (position
, integer_zero_node
))
5981 warning (0, "requested position is less than zero");
5982 *no_add_attrs
= true;
5990 /* Check for valid arguments being passed to a function. */
5992 check_function_arguments (tree attrs
, tree params
, tree typelist
)
5994 /* Check for null being passed in a pointer argument that must be
5995 non-null. We also need to do this if format checking is enabled. */
5998 check_function_nonnull (attrs
, params
);
6000 /* Check for errors in format strings. */
6002 if (warn_format
|| warn_missing_format_attribute
)
6003 check_function_format (attrs
, params
);
6006 check_function_sentinel (attrs
, params
, typelist
);
6009 /* Generic argument checking recursion routine. PARAM is the argument to
6010 be checked. PARAM_NUM is the number of the argument. CALLBACK is invoked
6011 once the argument is resolved. CTX is context for the callback. */
6013 check_function_arguments_recurse (void (*callback
)
6014 (void *, tree
, unsigned HOST_WIDE_INT
),
6015 void *ctx
, tree param
,
6016 unsigned HOST_WIDE_INT param_num
)
6018 if ((TREE_CODE (param
) == NOP_EXPR
|| TREE_CODE (param
) == CONVERT_EXPR
)
6019 && (TYPE_PRECISION (TREE_TYPE (param
))
6020 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (param
, 0)))))
6022 /* Strip coercion. */
6023 check_function_arguments_recurse (callback
, ctx
,
6024 TREE_OPERAND (param
, 0), param_num
);
6028 if (TREE_CODE (param
) == CALL_EXPR
)
6030 tree type
= TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (param
)));
6032 bool found_format_arg
= false;
6034 /* See if this is a call to a known internationalization function
6035 that modifies a format arg. Such a function may have multiple
6036 format_arg attributes (for example, ngettext). */
6038 for (attrs
= TYPE_ATTRIBUTES (type
);
6040 attrs
= TREE_CHAIN (attrs
))
6041 if (is_attribute_p ("format_arg", TREE_PURPOSE (attrs
)))
6044 tree format_num_expr
;
6047 call_expr_arg_iterator iter
;
6049 /* Extract the argument number, which was previously checked
6051 format_num_expr
= TREE_VALUE (TREE_VALUE (attrs
));
6053 gcc_assert (TREE_CODE (format_num_expr
) == INTEGER_CST
6054 && !TREE_INT_CST_HIGH (format_num_expr
));
6056 format_num
= TREE_INT_CST_LOW (format_num_expr
);
6058 for (inner_arg
= first_call_expr_arg (param
, &iter
), i
= 1;
6060 inner_arg
= next_call_expr_arg (&iter
), i
++)
6061 if (i
== format_num
)
6063 check_function_arguments_recurse (callback
, ctx
,
6064 inner_arg
, param_num
);
6065 found_format_arg
= true;
6070 /* If we found a format_arg attribute and did a recursive check,
6071 we are done with checking this argument. Otherwise, we continue
6072 and this will be considered a non-literal. */
6073 if (found_format_arg
)
6077 if (TREE_CODE (param
) == COND_EXPR
)
6079 /* Check both halves of the conditional expression. */
6080 check_function_arguments_recurse (callback
, ctx
,
6081 TREE_OPERAND (param
, 1), param_num
);
6082 check_function_arguments_recurse (callback
, ctx
,
6083 TREE_OPERAND (param
, 2), param_num
);
6087 (*callback
) (ctx
, param
, param_num
);
6090 /* Function to help qsort sort FIELD_DECLs by name order. */
6093 field_decl_cmp (const void *x_p
, const void *y_p
)
6095 const tree
*const x
= (const tree
*const) x_p
;
6096 const tree
*const y
= (const tree
*const) y_p
;
6098 if (DECL_NAME (*x
) == DECL_NAME (*y
))
6099 /* A nontype is "greater" than a type. */
6100 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
6101 if (DECL_NAME (*x
) == NULL_TREE
)
6103 if (DECL_NAME (*y
) == NULL_TREE
)
6105 if (DECL_NAME (*x
) < DECL_NAME (*y
))
6111 gt_pointer_operator new_value
;
6115 /* This routine compares two fields like field_decl_cmp but using the
6116 pointer operator in resort_data. */
6119 resort_field_decl_cmp (const void *x_p
, const void *y_p
)
6121 const tree
*const x
= (const tree
*const) x_p
;
6122 const tree
*const y
= (const tree
*const) y_p
;
6124 if (DECL_NAME (*x
) == DECL_NAME (*y
))
6125 /* A nontype is "greater" than a type. */
6126 return (TREE_CODE (*y
) == TYPE_DECL
) - (TREE_CODE (*x
) == TYPE_DECL
);
6127 if (DECL_NAME (*x
) == NULL_TREE
)
6129 if (DECL_NAME (*y
) == NULL_TREE
)
6132 tree d1
= DECL_NAME (*x
);
6133 tree d2
= DECL_NAME (*y
);
6134 resort_data
.new_value (&d1
, resort_data
.cookie
);
6135 resort_data
.new_value (&d2
, resort_data
.cookie
);
6142 /* Resort DECL_SORTED_FIELDS because pointers have been reordered. */
6145 resort_sorted_fields (void *obj
,
6146 void * ARG_UNUSED (orig_obj
),
6147 gt_pointer_operator new_value
,
6150 struct sorted_fields_type
*sf
= (struct sorted_fields_type
*) obj
;
6151 resort_data
.new_value
= new_value
;
6152 resort_data
.cookie
= cookie
;
6153 qsort (&sf
->elts
[0], sf
->len
, sizeof (tree
),
6154 resort_field_decl_cmp
);
6157 /* Subroutine of c_parse_error.
6158 Return the result of concatenating LHS and RHS. RHS is really
6159 a string literal, its first character is indicated by RHS_START and
6160 RHS_SIZE is its length (including the terminating NUL character).
6162 The caller is responsible for deleting the returned pointer. */
6165 catenate_strings (const char *lhs
, const char *rhs_start
, int rhs_size
)
6167 const int lhs_size
= strlen (lhs
);
6168 char *result
= XNEWVEC (char, lhs_size
+ rhs_size
);
6169 strncpy (result
, lhs
, lhs_size
);
6170 strncpy (result
+ lhs_size
, rhs_start
, rhs_size
);
6174 /* Issue the error given by GMSGID, indicating that it occurred before
6175 TOKEN, which had the associated VALUE. */
6178 c_parse_error (const char *gmsgid
, enum cpp_ttype token
, tree value
)
6180 #define catenate_messages(M1, M2) catenate_strings ((M1), (M2), sizeof (M2))
6182 char *message
= NULL
;
6184 if (token
== CPP_EOF
)
6185 message
= catenate_messages (gmsgid
, " at end of input");
6186 else if (token
== CPP_CHAR
|| token
== CPP_WCHAR
)
6188 unsigned int val
= TREE_INT_CST_LOW (value
);
6189 const char *const ell
= (token
== CPP_CHAR
) ? "" : "L";
6190 if (val
<= UCHAR_MAX
&& ISGRAPH (val
))
6191 message
= catenate_messages (gmsgid
, " before %s'%c'");
6193 message
= catenate_messages (gmsgid
, " before %s'\\x%x'");
6195 error (message
, ell
, val
);
6199 else if (token
== CPP_STRING
|| token
== CPP_WSTRING
)
6200 message
= catenate_messages (gmsgid
, " before string constant");
6201 else if (token
== CPP_NUMBER
)
6202 message
= catenate_messages (gmsgid
, " before numeric constant");
6203 else if (token
== CPP_NAME
)
6205 message
= catenate_messages (gmsgid
, " before %qE");
6206 error (message
, value
);
6210 else if (token
== CPP_PRAGMA
)
6211 message
= catenate_messages (gmsgid
, " before %<#pragma%>");
6212 else if (token
== CPP_PRAGMA_EOL
)
6213 message
= catenate_messages (gmsgid
, " before end of line");
6214 else if (token
< N_TTYPES
)
6216 message
= catenate_messages (gmsgid
, " before %qs token");
6217 error (message
, cpp_type2name (token
));
6229 #undef catenate_messages
6232 /* Walk a gimplified function and warn for functions whose return value is
6233 ignored and attribute((warn_unused_result)) is set. This is done before
6234 inlining, so we don't have to worry about that. */
6237 c_warn_unused_result (tree
*top_p
)
6240 tree_stmt_iterator i
;
6243 switch (TREE_CODE (t
))
6245 case STATEMENT_LIST
:
6246 for (i
= tsi_start (*top_p
); !tsi_end_p (i
); tsi_next (&i
))
6247 c_warn_unused_result (tsi_stmt_ptr (i
));
6251 c_warn_unused_result (&COND_EXPR_THEN (t
));
6252 c_warn_unused_result (&COND_EXPR_ELSE (t
));
6255 c_warn_unused_result (&BIND_EXPR_BODY (t
));
6257 case TRY_FINALLY_EXPR
:
6258 case TRY_CATCH_EXPR
:
6259 c_warn_unused_result (&TREE_OPERAND (t
, 0));
6260 c_warn_unused_result (&TREE_OPERAND (t
, 1));
6263 c_warn_unused_result (&CATCH_BODY (t
));
6265 case EH_FILTER_EXPR
:
6266 c_warn_unused_result (&EH_FILTER_FAILURE (t
));
6273 /* This is a naked call, as opposed to a CALL_EXPR nested inside
6274 a MODIFY_EXPR. All calls whose value is ignored should be
6275 represented like this. Look for the attribute. */
6276 fdecl
= get_callee_fndecl (t
);
6278 ftype
= TREE_TYPE (fdecl
);
6281 ftype
= TREE_TYPE (CALL_EXPR_FN (t
));
6282 /* Look past pointer-to-function to the function type itself. */
6283 ftype
= TREE_TYPE (ftype
);
6286 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
6289 warning (0, "%Hignoring return value of %qD, "
6290 "declared with attribute warn_unused_result",
6291 EXPR_LOCUS (t
), fdecl
);
6293 warning (0, "%Hignoring return value of function "
6294 "declared with attribute warn_unused_result",
6300 /* Not a container, not a call, or a call whose value is used. */
6305 /* Convert a character from the host to the target execution character
6306 set. cpplib handles this, mostly. */
6309 c_common_to_target_charset (HOST_WIDE_INT c
)
6311 /* Character constants in GCC proper are sign-extended under -fsigned-char,
6312 zero-extended under -fno-signed-char. cpplib insists that characters
6313 and character constants are always unsigned. Hence we must convert
6315 cppchar_t uc
= ((cppchar_t
)c
) & ((((cppchar_t
)1) << CHAR_BIT
)-1);
6317 uc
= cpp_host_to_exec_charset (parse_in
, uc
);
6319 if (flag_signed_char
)
6320 return ((HOST_WIDE_INT
)uc
) << (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
)
6321 >> (HOST_BITS_PER_WIDE_INT
- CHAR_TYPE_SIZE
);
6326 /* Build the result of __builtin_offsetof. EXPR is a nested sequence of
6327 component references, with STOP_REF, or alternatively an INDIRECT_REF of
6328 NULL, at the bottom; much like the traditional rendering of offsetof as a
6329 macro. Returns the folded and properly cast result. */
6332 fold_offsetof_1 (tree expr
, tree stop_ref
)
6334 enum tree_code code
= PLUS_EXPR
;
6337 if (expr
== stop_ref
&& TREE_CODE (expr
) != ERROR_MARK
)
6338 return size_zero_node
;
6340 switch (TREE_CODE (expr
))
6346 error ("cannot apply %<offsetof%> to static data member %qD", expr
);
6347 return error_mark_node
;
6350 error ("cannot apply %<offsetof%> when %<operator[]%> is overloaded");
6351 return error_mark_node
;
6354 gcc_assert (integer_zerop (expr
));
6355 return size_zero_node
;
6359 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6360 gcc_assert (base
== error_mark_node
|| base
== size_zero_node
);
6364 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6365 if (base
== error_mark_node
)
6368 t
= TREE_OPERAND (expr
, 1);
6369 if (DECL_C_BIT_FIELD (t
))
6371 error ("attempt to take address of bit-field structure "
6373 return error_mark_node
;
6375 off
= size_binop (PLUS_EXPR
, DECL_FIELD_OFFSET (t
),
6376 size_int (tree_low_cst (DECL_FIELD_BIT_OFFSET (t
), 1)
6381 base
= fold_offsetof_1 (TREE_OPERAND (expr
, 0), stop_ref
);
6382 if (base
== error_mark_node
)
6385 t
= TREE_OPERAND (expr
, 1);
6386 if (TREE_CODE (t
) == INTEGER_CST
&& tree_int_cst_sgn (t
) < 0)
6389 t
= fold_build1 (NEGATE_EXPR
, TREE_TYPE (t
), t
);
6391 t
= convert (sizetype
, t
);
6392 off
= size_binop (MULT_EXPR
, TYPE_SIZE_UNIT (TREE_TYPE (expr
)), t
);
6399 return size_binop (code
, base
, off
);
6403 fold_offsetof (tree expr
, tree stop_ref
)
6405 /* Convert back from the internal sizetype to size_t. */
6406 return convert (size_type_node
, fold_offsetof_1 (expr
, stop_ref
));
6409 /* Print an error message for an invalid lvalue. USE says
6410 how the lvalue is being used and so selects the error message. */
6413 lvalue_error (enum lvalue_use use
)
6418 error ("lvalue required as left operand of assignment");
6421 error ("lvalue required as increment operand");
6424 error ("lvalue required as decrement operand");
6427 error ("lvalue required as unary %<&%> operand");
6430 error ("lvalue required in asm statement");
6437 /* *PTYPE is an incomplete array. Complete it with a domain based on
6438 INITIAL_VALUE. If INITIAL_VALUE is not present, use 1 if DO_DEFAULT
6439 is true. Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
6440 2 if INITIAL_VALUE was NULL, and 3 if INITIAL_VALUE was empty. */
6443 complete_array_type (tree
*ptype
, tree initial_value
, bool do_default
)
6445 tree maxindex
, type
, main_type
, elt
, unqual_elt
;
6446 int failure
= 0, quals
;
6447 hashval_t hashcode
= 0;
6449 maxindex
= size_zero_node
;
6452 if (TREE_CODE (initial_value
) == STRING_CST
)
6455 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
6456 maxindex
= size_int (TREE_STRING_LENGTH (initial_value
)/eltsize
- 1);
6458 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
6460 VEC(constructor_elt
,gc
) *v
= CONSTRUCTOR_ELTS (initial_value
);
6462 if (VEC_empty (constructor_elt
, v
))
6466 maxindex
= integer_minus_one_node
;
6471 unsigned HOST_WIDE_INT cnt
;
6472 constructor_elt
*ce
;
6474 if (VEC_index (constructor_elt
, v
, 0)->index
)
6475 maxindex
= fold_convert (sizetype
,
6476 VEC_index (constructor_elt
,
6478 curindex
= maxindex
;
6481 VEC_iterate (constructor_elt
, v
, cnt
, ce
);
6485 curindex
= fold_convert (sizetype
, ce
->index
);
6487 curindex
= size_binop (PLUS_EXPR
, curindex
, size_one_node
);
6489 if (tree_int_cst_lt (maxindex
, curindex
))
6490 maxindex
= curindex
;
6496 /* Make an error message unless that happened already. */
6497 if (initial_value
!= error_mark_node
)
6509 elt
= TREE_TYPE (type
);
6510 quals
= TYPE_QUALS (strip_array_types (elt
));
6514 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
6516 /* Using build_distinct_type_copy and modifying things afterward instead
6517 of using build_array_type to create a new type preserves all of the
6518 TYPE_LANG_FLAG_? bits that the front end may have set. */
6519 main_type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
6520 TREE_TYPE (main_type
) = unqual_elt
;
6521 TYPE_DOMAIN (main_type
) = build_index_type (maxindex
);
6522 layout_type (main_type
);
6524 /* Make sure we have the canonical MAIN_TYPE. */
6525 hashcode
= iterative_hash_object (TYPE_HASH (unqual_elt
), hashcode
);
6526 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (main_type
)),
6528 main_type
= type_hash_canon (hashcode
, main_type
);
6533 type
= c_build_qualified_type (main_type
, quals
);
6540 /* Used to help initialize the builtin-types.def table. When a type of
6541 the correct size doesn't exist, use error_mark_node instead of NULL.
6542 The later results in segfaults even when a decl using the type doesn't
6546 builtin_type_for_size (int size
, bool unsignedp
)
6548 tree type
= lang_hooks
.types
.type_for_size (size
, unsignedp
);
6549 return type
? type
: error_mark_node
;
6552 /* A helper function for resolve_overloaded_builtin in resolving the
6553 overloaded __sync_ builtins. Returns a positive power of 2 if the
6554 first operand of PARAMS is a pointer to a supported data type.
6555 Returns 0 if an error is encountered. */
6558 sync_resolve_size (tree function
, tree params
)
6565 error ("too few arguments to function %qE", function
);
6569 type
= TREE_TYPE (TREE_VALUE (params
));
6570 if (TREE_CODE (type
) != POINTER_TYPE
)
6573 type
= TREE_TYPE (type
);
6574 if (!INTEGRAL_TYPE_P (type
) && !POINTER_TYPE_P (type
))
6577 size
= tree_low_cst (TYPE_SIZE_UNIT (type
), 1);
6578 if (size
== 1 || size
== 2 || size
== 4 || size
== 8 || size
== 16)
6582 error ("incompatible type for argument %d of %qE", 1, function
);
6586 /* A helper function for resolve_overloaded_builtin. Adds casts to
6587 PARAMS to make arguments match up with those of FUNCTION. Drops
6588 the variadic arguments at the end. Returns false if some error
6589 was encountered; true on success. */
6592 sync_resolve_params (tree orig_function
, tree function
, tree params
)
6594 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
6598 /* We've declared the implementation functions to use "volatile void *"
6599 as the pointer parameter, so we shouldn't get any complaints from the
6600 call to check_function_arguments what ever type the user used. */
6601 arg_types
= TREE_CHAIN (arg_types
);
6602 ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6605 /* For the rest of the values, we need to cast these to FTYPE, so that we
6606 don't get warnings for passing pointer types, etc. */
6607 while (arg_types
!= void_list_node
)
6611 params
= TREE_CHAIN (params
);
6614 error ("too few arguments to function %qE", orig_function
);
6618 /* ??? Ideally for the first conversion we'd use convert_for_assignment
6619 so that we get warnings for anything that doesn't match the pointer
6620 type. This isn't portable across the C and C++ front ends atm. */
6621 val
= TREE_VALUE (params
);
6622 val
= convert (ptype
, val
);
6623 val
= convert (TREE_VALUE (arg_types
), val
);
6624 TREE_VALUE (params
) = val
;
6626 arg_types
= TREE_CHAIN (arg_types
);
6630 /* The definition of these primitives is variadic, with the remaining
6631 being "an optional list of variables protected by the memory barrier".
6632 No clue what that's supposed to mean, precisely, but we consider all
6633 call-clobbered variables to be protected so we're safe. */
6634 TREE_CHAIN (params
) = NULL
;
6639 /* A helper function for resolve_overloaded_builtin. Adds a cast to
6640 RESULT to make it match the type of the first pointer argument in
6644 sync_resolve_return (tree params
, tree result
)
6646 tree ptype
= TREE_TYPE (TREE_TYPE (TREE_VALUE (params
)));
6647 ptype
= TYPE_MAIN_VARIANT (ptype
);
6648 return convert (ptype
, result
);
6651 /* Some builtin functions are placeholders for other expressions. This
6652 function should be called immediately after parsing the call expression
6653 before surrounding code has committed to the type of the expression.
6655 FUNCTION is the DECL that has been invoked; it is known to be a builtin.
6656 PARAMS is the argument list for the call. The return value is non-null
6657 when expansion is complete, and null if normal processing should
6661 resolve_overloaded_builtin (tree function
, tree params
)
6663 enum built_in_function orig_code
= DECL_FUNCTION_CODE (function
);
6664 switch (DECL_BUILT_IN_CLASS (function
))
6666 case BUILT_IN_NORMAL
:
6669 if (targetm
.resolve_overloaded_builtin
)
6670 return targetm
.resolve_overloaded_builtin (function
, params
);
6677 /* Handle BUILT_IN_NORMAL here. */
6680 case BUILT_IN_FETCH_AND_ADD_N
:
6681 case BUILT_IN_FETCH_AND_SUB_N
:
6682 case BUILT_IN_FETCH_AND_OR_N
:
6683 case BUILT_IN_FETCH_AND_AND_N
:
6684 case BUILT_IN_FETCH_AND_XOR_N
:
6685 case BUILT_IN_FETCH_AND_NAND_N
:
6686 case BUILT_IN_ADD_AND_FETCH_N
:
6687 case BUILT_IN_SUB_AND_FETCH_N
:
6688 case BUILT_IN_OR_AND_FETCH_N
:
6689 case BUILT_IN_AND_AND_FETCH_N
:
6690 case BUILT_IN_XOR_AND_FETCH_N
:
6691 case BUILT_IN_NAND_AND_FETCH_N
:
6692 case BUILT_IN_BOOL_COMPARE_AND_SWAP_N
:
6693 case BUILT_IN_VAL_COMPARE_AND_SWAP_N
:
6694 case BUILT_IN_LOCK_TEST_AND_SET_N
:
6695 case BUILT_IN_LOCK_RELEASE_N
:
6697 int n
= sync_resolve_size (function
, params
);
6698 tree new_function
, result
;
6701 return error_mark_node
;
6703 new_function
= built_in_decls
[orig_code
+ exact_log2 (n
) + 1];
6704 if (!sync_resolve_params (function
, new_function
, params
))
6705 return error_mark_node
;
6707 result
= build_function_call (new_function
, params
);
6708 if (orig_code
!= BUILT_IN_BOOL_COMPARE_AND_SWAP_N
6709 && orig_code
!= BUILT_IN_LOCK_RELEASE_N
)
6710 result
= sync_resolve_return (params
, result
);
6720 /* Ignoring their sign, return true if two scalar types are the same. */
6722 same_scalar_type_ignoring_signedness (tree t1
, tree t2
)
6724 enum tree_code c1
= TREE_CODE (t1
), c2
= TREE_CODE (t2
);
6726 gcc_assert ((c1
== INTEGER_TYPE
|| c1
== REAL_TYPE
)
6727 && (c2
== INTEGER_TYPE
|| c2
== REAL_TYPE
));
6729 /* Equality works here because c_common_signed_type uses
6730 TYPE_MAIN_VARIANT. */
6731 return lang_hooks
.types
.signed_type (t1
)
6732 == lang_hooks
.types
.signed_type (t2
);
6735 /* Check for missing format attributes on function pointers. LTYPE is
6736 the new type or left-hand side type. RTYPE is the old type or
6737 right-hand side type. Returns TRUE if LTYPE is missing the desired
6741 check_missing_format_attribute (tree ltype
, tree rtype
)
6743 tree
const ttr
= TREE_TYPE (rtype
), ttl
= TREE_TYPE (ltype
);
6746 for (ra
= TYPE_ATTRIBUTES (ttr
); ra
; ra
= TREE_CHAIN (ra
))
6747 if (is_attribute_p ("format", TREE_PURPOSE (ra
)))
6752 for (la
= TYPE_ATTRIBUTES (ttl
); la
; la
= TREE_CHAIN (la
))
6753 if (is_attribute_p ("format", TREE_PURPOSE (la
)))
6761 /* Subscripting with type char is likely to lose on a machine where
6762 chars are signed. So warn on any machine, but optionally. Don't
6763 warn for unsigned char since that type is safe. Don't warn for
6764 signed char because anyone who uses that must have done so
6765 deliberately. Furthermore, we reduce the false positive load by
6766 warning only for non-constant value of type char. */
6769 warn_array_subscript_with_type_char (tree index
)
6771 if (TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
6772 && TREE_CODE (index
) != INTEGER_CST
)
6773 warning (OPT_Wchar_subscripts
, "array subscript has type %<char%>");
6776 /* Implement -Wparentheses for the unexpected C precedence rules, to
6777 cover cases like x + y << z which readers are likely to
6778 misinterpret. We have seen an expression in which CODE is a binary
6779 operator used to combine expressions headed by CODE_LEFT and
6780 CODE_RIGHT. CODE_LEFT and CODE_RIGHT may be ERROR_MARK, which
6781 means that that side of the expression was not formed using a
6782 binary operator, or it was enclosed in parentheses. */
6785 warn_about_parentheses (enum tree_code code
, enum tree_code code_left
,
6786 enum tree_code code_right
)
6788 if (!warn_parentheses
)
6791 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
6793 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6794 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6795 warning (OPT_Wparentheses
,
6796 "suggest parentheses around + or - inside shift");
6799 if (code
== TRUTH_ORIF_EXPR
)
6801 if (code_left
== TRUTH_ANDIF_EXPR
6802 || code_right
== TRUTH_ANDIF_EXPR
)
6803 warning (OPT_Wparentheses
,
6804 "suggest parentheses around && within ||");
6807 if (code
== BIT_IOR_EXPR
)
6809 if (code_left
== BIT_AND_EXPR
|| code_left
== BIT_XOR_EXPR
6810 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6811 || code_right
== BIT_AND_EXPR
|| code_right
== BIT_XOR_EXPR
6812 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6813 warning (OPT_Wparentheses
,
6814 "suggest parentheses around arithmetic in operand of |");
6815 /* Check cases like x|y==z */
6816 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6817 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6818 warning (OPT_Wparentheses
,
6819 "suggest parentheses around comparison in operand of |");
6822 if (code
== BIT_XOR_EXPR
)
6824 if (code_left
== BIT_AND_EXPR
6825 || code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6826 || code_right
== BIT_AND_EXPR
6827 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6828 warning (OPT_Wparentheses
,
6829 "suggest parentheses around arithmetic in operand of ^");
6830 /* Check cases like x^y==z */
6831 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6832 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6833 warning (OPT_Wparentheses
,
6834 "suggest parentheses around comparison in operand of ^");
6837 if (code
== BIT_AND_EXPR
)
6839 if (code_left
== PLUS_EXPR
|| code_left
== MINUS_EXPR
6840 || code_right
== PLUS_EXPR
|| code_right
== MINUS_EXPR
)
6841 warning (OPT_Wparentheses
,
6842 "suggest parentheses around + or - in operand of &");
6843 /* Check cases like x&y==z */
6844 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6845 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6846 warning (OPT_Wparentheses
,
6847 "suggest parentheses around comparison in operand of &");
6850 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
6852 if (TREE_CODE_CLASS (code_left
) == tcc_comparison
6853 || TREE_CODE_CLASS (code_right
) == tcc_comparison
)
6854 warning (OPT_Wparentheses
,
6855 "suggest parentheses around comparison in operand of %s",
6856 code
== EQ_EXPR
? "==" : "!=");
6858 else if (TREE_CODE_CLASS (code
) == tcc_comparison
)
6860 if ((TREE_CODE_CLASS (code_left
) == tcc_comparison
6861 && code_left
!= NE_EXPR
&& code_left
!= EQ_EXPR
)
6862 || (TREE_CODE_CLASS (code_right
) == tcc_comparison
6863 && code_right
!= NE_EXPR
&& code_right
!= EQ_EXPR
))
6864 warning (OPT_Wparentheses
, "comparisons like X<=Y<=Z do not "
6865 "have their mathematical meaning");
6869 /* If LABEL (a LABEL_DECL) has not been used, issue a warning. */
6872 warn_for_unused_label (tree label
)
6874 if (!TREE_USED (label
))
6876 if (DECL_INITIAL (label
))
6877 warning (OPT_Wunused_label
, "label %q+D defined but not used", label
);
6879 warning (OPT_Wunused_label
, "label %q+D declared but not defined", label
);
6883 /* If FNDECL is a static constructor or destructor, add it to the list
6884 of functions to be called by the file scope initialization
6888 c_record_cdtor_fn (tree fndecl
)
6890 if (targetm
.have_ctors_dtors
)
6893 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
6894 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
6895 if (DECL_STATIC_DESTRUCTOR (fndecl
))
6896 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
6899 /* Synthesize a function which calls all the global ctors or global
6900 dtors in this file. This is only used for targets which do not
6901 support .ctors/.dtors sections. FIXME: Migrate into cgraph. */
6903 build_cdtor (int method_type
, tree cdtors
)
6910 for (; cdtors
; cdtors
= TREE_CHAIN (cdtors
))
6911 append_to_statement_list (build_function_call (TREE_VALUE (cdtors
), 0),
6914 cgraph_build_static_cdtor (method_type
, body
, DEFAULT_INIT_PRIORITY
);
6917 /* Generate functions to call static constructors and destructors
6918 for targets that do not support .ctors/.dtors sections. These
6919 functions have magic names which are detected by collect2. */
6922 c_build_cdtor_fns (void)
6924 if (!targetm
.have_ctors_dtors
)
6926 build_cdtor ('I', static_ctors
);
6927 static_ctors
= NULL_TREE
;
6928 build_cdtor ('D', static_dtors
);
6929 static_dtors
= NULL_TREE
;
6933 gcc_assert (!static_ctors
);
6934 gcc_assert (!static_dtors
);
6938 #include "gt-c-common.h"